Robust near-separable nonnegative matrix factorization using linear optimization

Journal of Machine Learning Research

Volumn 15, Issue , 2014, Pages 1249-1280

  Gillis, Nicolas ^a   Luce, Robert ^b  

^a UNIVERSITY OF MONS   (Belgium)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Convex optimization; Hyperspectral unmixing; Linear programming; Nonnegative matrix factorization; Pure pixel assumption; Robustness to noise; Separability

Indexed keywords

CONES; CONVEX OPTIMIZATION; FACTORIZATION; LINEAR PROGRAMMING;

HYPERSPECTRAL UNMIXING; NONNEGATIVE MATRIX FACTORIZATION; PURE-PIXEL ASSUMPTION; ROBUSTNESS TO NOISE; SEPARABILITY;

MATRIX ALGEBRA;

EID: 84901625045     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. U.M.C. Araujo, B.T.C. Saldanha, R.K.H. Galv~ao, T. Yoneyama, H.C. Chame, and V. Visani. The successive projections algorithm for variable selection in spectroscopic multicomponent analysis. Chemometrics and Intelligent Laboratory Systems, 57(2):65-73, 2001. (Pubitemid 32622170)
2. S. Arora, R. Ge, R. Kannan, and A. Moitra. Computing a nonnegative matrix factorization - provably. In Proc. of the 44th Symp. on Theory of Computing, STOC '12, pages 145- 162, 2012a.
3. S. Arora, R. Ge, and A. Moitra. Learning topic models - going beyond SVD. In Proc. of the 53rd Annual IEEE Symp. on Foundations of Computer Science, FOCS '12, pages 1-10, 2012b.
4. J.M. Bioucas-Dias, A. Plaza, N. Dobigeon, M. Parente, Q. Du, P. Gader, and J. Chanussot. Hyperspectral unmixing overview: Geometrical, statistical, and sparse regression-based approaches. IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 5(2):354-379, Apr. 2012.
5. V. Bittorf, B. Recht, E. Re, and J.A. Tropp. Factoring nonnegative matrices with linear programs. In Advances in Neural Information Processing Systems (NIPS '12), pages 1223-1231, 2012.
6. T.-H. Chan, W.-K. Ma, C.-Y. Chi, and Y. Wang. A convex analysis framework for blind separation of non-negative sources. IEEE Trans. on Signal Processing, 56(10):5120-5134, 2008.
7. L. Chen, P.L. Choyke, T.-H. Chan, C.-Y. Chi, G. Wang, and Y. Wang. Tissue-specic compartmental analysis for dynamic contrast-enhanced MR imaging of complex tumors. IEEE Trans. on Medical Imaging, 30(12):2044-2058, 2011.
8. D. Donoho and V. Stodden. When does non-negative matrix factorization give a correct decomposition into parts? In Advances in Neural Information Processing Systems (NIPS '03), 2003.
9. E. Elhamifar, G. Sapiro, and R. Vidal. See all by looking at a few: Sparse modeling fornding representative objects. In IEEE Conf. on Computer Vision and Pattern Recognition, 2012.
10. E. Esser, M. Moller, S. Osher, G. Sapiro, and J. Xin. A convex model for nonnegative matrix factorization and dimensionality reduction on physical space. IEEE Trans. On Image Processing, 21(7):3239-3252, 2012.
11. N. Gillis. Sparse and unique nonnegative matrix factorization through data preprocessing. Journal of Machine Learning Research, 13(Nov):3349-3386, 2012.
12. N. Gillis. Robustness analysis of Hottopixx, a linear programming model for factoring nonnegative matrices. SIAM J. Mat. Anal. Appl., 34(3):1189-1212, 2013.
13. N. Gillis and S.A. Vavasis. Fast and robust recursive algorithms for separable nonnegative matrix factorization. IEEE Trans. Pattern Anal. Mach. Intell., 36(4):698-714, 2014.
14. F. Glineur and T. Terlaky. Conic formulation for lp-norm optimization. Journal of Optimization Theory and Applications, 122(2):285-307, 2004.
15. A. Kumar, V. Sindhwani, and P. Kambadur. Fast conical hull algorithms for near-separable non-negative matrix factorization. In Int. Conf. on Machine Learning (ICML '13), volume 28, pages 231-239. 2013.
16. S.A. Vavasis. On the complexity of nonnegative matrix factorization. SIAM J. on Optimization, 20(3):1364-1377, 2009.