Self-Dictionary Sparse Regression for Hyperspectral Unmixing: Greedy Pursuit and Pure Pixel Search are Related
arXiv:1409.4320 · doi:10.1109/JSTSP.2015.2410763
Abstract
This paper considers a recently emerged hyperspectral unmixing formulation based on sparse regression of a self-dictionary multiple measurement vector (SD-MMV) model, wherein the measured hyperspectral pixels are used as the dictionary. Operating under the pure pixel assumption, this SD-MMV formalism is special in that it allows simultaneous identification of the endmember spectral signatures and the number of endmembers. Previous SD-MMV studies mainly focus on convex relaxations. In this study, we explore the alternative of greedy pursuit, which generally provides efficient and simple algorithms. In particular, we design a greedy SD-MMV algorithm using simultaneous orthogonal matching pursuit. Intriguingly, the proposed greedy algorithm is shown to be closely related to some existing pure pixel search algorithms, especially, the successive projection algorithm (SPA). Thus, a link between SD-MMV and pure pixel search is revealed. We then perform exact recovery analyses, and prove that the proposed greedy algorithm is robust to noise---including its identification of the (unknown) number of endmembers---under a sufficiently low noise level. The identification performance of the proposed greedy algorithm is demonstrated through both synthetic and real-data experiments.
References in corpus (7)
- Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
- Fast and Robust Recursive Algorithms for Separable Nonnegative Matrix Factorization
- The Why and How of Nonnegative Matrix Factorization
- A convex model for non-negative matrix factorization and dimensionality reduction on physical space
- Factoring nonnegative matrices with linear programs
- Robust Near-Separable Nonnegative Matrix Factorization Using Linear Optimization
- Robustness Analysis of Hottopixx, a Linear Programming Model for Factoring Nonnegative Matrices
Cited by in corpus (16)
- Nonnegative Matrix Factorization for Signal and Data Analytics: Identifiability, Algorithms, and Applications
- Robust Volume Minimization-Based Matrix Factorization for Remote Sensing and Document Clustering
- Deep Spectrum Cartography: Completing Radio Map Tensors Using Learned Neural Models
- On Identifiability of Nonnegative Matrix Factorization
- Hyperspectral Denoising Using Unsupervised Disentangled Spatio-Spectral Deep Priors
- Shapelet-based Sparse Representation for Landcover Classification of Hyperspectral Images
- A Fast Gradient Method for Nonnegative Sparse Regression with Self Dictionary
- Simplex-Structured Matrix Factorization: Sparsity-based Identifiability and Provably Correct Algorithms
- Recovering Joint Probability of Discrete Random Variables from Pairwise Marginals
- Memory-Efficient Convex Optimization for Self-Dictionary Separable Nonnegative Matrix Factorization: A Frank-Wolfe Approach
- Mixed Membership Graph Clustering via Systematic Edge Query
- Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimization
- Spectral Unmixing with Multiple Dictionaries
- Penalized matrix decomposition for denoising, compression, and improved demixing of functional imaging data
- On Recoverability of Randomly Compressed Tensors with Low CP Rank
- Deep NMF Topic Modeling