Bregman iteration algorithm for sparse nonnegative matrix factorizations via alternating l1-norm minimization

Multidimensional Systems and Signal Processing

Volumn 23, Issue 3, 2012, Pages 315-328

  Jiang, Lingling ^a   Yin, Haiqing ^b  

^a CHINA UNIVERSITY OF PETROLEUM   (China)

^b XIDIAN UNIVERSITY   (China)

Author keywords

Bregman iteration; Nonnegative matrix factorization; Sparseness; Wavelet transform

Indexed keywords

BASIS MATRIX; BREGMAN ITERATION; COEFFICIENT MATRIX; DETECTION ACCURACY; DIMENSION REDUCTION METHOD; L1 NORM; MINIMIZATION PROBLEMS; NON-NEGATIVITY; NONNEGATIVE MATRIX FACTORIZATION; SPARSE NON-NEGATIVE MATRIX FACTORIZATIONS; SPARSENESS;

ALGORITHMS; FACE RECOGNITION; SIGNAL PROCESSING; WAVELET TRANSFORMS;

FACTORIZATION;

EID: 84861880130     PISSN: 09236082     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11045-011-0147-2     Document Type: Article

References (27)

1. Cai, J.-F., Osher, S., Shen, Z. (2009a). Linearized Bregman iterations for compressed sensing. Mathematics of Computation, 78, 1515-1536.
2. Cai, J.-F., Osher, S., & Shen, Z. (2009b). Linearized Bregman iterations for frame-based image deblurring. SIAM Journal on Imaging Sciences, 2(1), 226-252.
3. Candès, E., Romberg, J., & Tao, T. (2006). Stable signal recovery from incomplete and inaccurate measurements. Communications Pure and Applied Mathematics, 59(8), 1207-1223. (Pubitemid 43988295)
4. Cichocki, A., Zdunek, R., & Amari, S. I. (2007). Hierarchical ALS algorithms for nonnegative matrix and 3D tensor factorization. Springer LNCS, 4666, 169-176.
5. Cichocki, A., Zdunek, R., & Amari, S. (2008). Nonnegative matrix and tensor factorization. IEEE Signal Processing Magazine, 25(1), 142-145.
6. Comon, P. (1994). Indenpendent component analysis-A new concept?. Signal Processing, 36, 287-314.
7. Donoho, D. (2006). For most large underdetermined systems of linear equations the minimal l1-norm solution is also the sparsest Solution. Communications Pure and Applied Mathematics, 59(6), 797-829. (Pubitemid 43667226)
8. Feng, T., Li, S. Z., & Shum H.-Y., et al. (2002). Local nonnegative matrix factorization as a visual representation. In Proceedings of second international conference development and learning.
9. Goldstein, T., & Osher, S. (2008). The split bregman algorithm for L1 regularized problems. UCLA CAM Reports (08-29
10. Guillamet, D., Vitria, J., & Schiele, B. (2003). Introducing a weighted non-negative matrix factorization for image classification. Pattern Recognition Letters, 24, 2447-2454. (Pubitemid 36911088)
11. Hoyer, P. O. (2002). Non-negative sparse coding. In Neural networks for signal processing XII (Proceedings of IEEE workshop on neural networks for signal processing) (pp. 557-565). Martigny, Switzerland.
12. Hoyer, P. O. (2004). Nonnegative matrix factorization with sparseness constraints. Journal of Machine Learning Research, 5, 1457-1469.
13. Kim H., & Park H. (2007). Sparse non-negative matrix factorizations via alternating non-negativityconstrained least squares for microarray data analysis. Bioinformatics, 23(12), 1495-1502. (Pubitemid 47244474)
14. Lee, D. D., & Seung H. S. (1999). Learning the parts of objects by non-negative matrix factorization. Nature, 401(6755), 788-791.
15. Lee, D. D., & Seung H. S. (2001). Algorithms for non-negative matrix factorization. In Advances in Neural Information Processing, 13, 556-562.
16. Liu, W., Zheng, N., & Lu, X. (2003). Non-negative matrix factorization for visual coding. In Proceedings of IEEE international conference on acoustics, speech and signal processing.
17. Neo H. F., Teoh, B. J., & Ngo, C. L. (2004). Face recognition using wavelet transform and non-negative matrix factorization. Lecture note on AI, vol. 3339 (pp. 192-202), Berlin: Springer.
18. Osher, S., Burger, M., Goldfarb, D., Xu, J., & Yin, W. (2005). An iterative regularization method for total variation-based image restoration. Multiscale Model and Simulation, 4, 460-489. (Pubitemid 43885248)
19. Osher, S., Mao, Y., Dong, B., & Yin, W. (2008). Fast linearized bregman iteration for compressed sensing and sparse denoising. UCLA CAM Reports (08-37
20. Pauca, V. P., & Shahnaz, F., et al. (2004). Text mining using non-negative matrix factorizations. In Proceedings of SIAM international conference data mining, April.
21. Pauca, V. P., Piper, J., & Plemmons, R. J. (2006). Nonnegative matrix factorization for spectral data analysis. Linear Algebra and Applications, 416(1), 29-47. (Pubitemid 43737212)
22. Pascual-Montano, A., Carazo, J. M., & Kochi, K., et al. (2006). Nonsmooth nonnegative matrix factorization (nsNMF). IEEE Transactions on PAMI, 28(3), 403-415. (Pubitemid 43159636)
23. Penev, P., & Atick, J. (1996). Local feature analysis: A general statistical theory for object representation. Neural Systems, 7(3), 477-500. (Pubitemid 126717004)
24. Tibshirani, R. (1996). Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society. Series B, 58(1), 267-288.
25. Turk,M., & Pentland, A. (1991). Eigenfaces for recognition. Journal of Cognitive Neuroscience, 3(1), 71-86.
26. Wright, J., Yang, A. Y., & Ganesh et.al, A. (2009). Robust face recognition via sparse representation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 31(2), 210-227.
27. Yin, W., Osher, S., Goldfarb, D., & Darbon, J. (2008). Bregman iterative algorithms for l1-minimization with applications to compressed sensing. SIAM Journal on Imaging Sciences, 1, 143-168.