Sparse nonnegative matrix underapproximation and its application to hyperspectral image analysis
DOI10.1016/j.laa.2012.04.033zbMath1281.65032OpenAlexW2038304857MaRDI QIDQ389667
Nicolas Gillis, Robert J. Plemmons
Publication date: 21 January 2014
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2012.04.033
classificationprincipal component analysisdimensionality reductionsparsitynonnegative matrix factorizationhyperspectral imagesspectral mixture analysisunderapproximation
Factor analysis and principal components; correspondence analysis (62H25) Factorization of matrices (15A23) Image analysis in multivariate analysis (62H35) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Positive matrices and their generalizations; cones of matrices (15B48) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- Sparse nonnegative matrix underapproximation and its application to hyperspectral image analysis
- Template matching via \(l_1\) minimization and its application to hyperspectral data
- Using underapproximations for sparse nonnegative matrix factorization
- Two ``well-known properties of subgradient optimization
- Compressed sensing and best 𝑘-term approximation
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- On search directions for minimization algorithms
- Compressed sensing
This page was built for publication: Sparse nonnegative matrix underapproximation and its application to hyperspectral image analysis