Spectral Unmixing with Multiple Dictionaries
arXiv:1711.02883 · doi:10.1109/LGRS.2017.2779477
Abstract
Spectral unmixing aims at recovering the spectral signatures of materials, called endmembers, mixed in a hyperspectral or multispectral image, along with their abundances. A typical assumption is that the image contains one pure pixel per endmember, in which case spectral unmixing reduces to identifying these pixels. Many fully automated methods have been proposed in recent years, but little work has been done to allow users to select areas where pure pixels are present manually or using a segmentation algorithm. Additionally, in a non-blind approach, several spectral libraries may be available rather than a single one, with a fixed number (or an upper or lower bound) of endmembers to chose from each. In this paper, we propose a multiple-dictionary constrained low-rank matrix approximation model that address these two problems. We propose an algorithm to compute this model, dubbed M2PALS, and its performance is discussed on both synthetic and real hyperspectral images.
References in corpus (8)
- Accelerated Multiplicative Updates and Hierarchical ALS Algorithms for Nonnegative Matrix Factorization
- A convex model for non-negative matrix factorization and dimensionality reduction on physical space
- Factoring nonnegative matrices with linear programs
- Hierarchical Clustering of Hyperspectral Images using Rank-Two Nonnegative Matrix Factorization
- Successive Nonnegative Projection Algorithm for Robust Nonnegative Blind Source Separation
- Self-Dictionary Sparse Regression for Hyperspectral Unmixing: Greedy Pursuit and Pure Pixel Search are Related
- A Fast Gradient Method for Nonnegative Sparse Regression with Self Dictionary
- Dictionary-based Tensor Canonical Polyadic Decomposition