Blind and fully constrained unmixing of hyperspectral images
arXiv:1403.0289 · doi:10.1109/TIP.2014.2362056
Abstract
This paper addresses the problem of blind and fully constrained unmixing of hyperspectral images. Unmixing is performed without the use of any dictionary, and assumes that the number of constituent materials in the scene and their spectral signatures are unknown. The estimated abundances satisfy the desired sum-to-one and nonnegativity constraints. Two models with increasing complexity are developed to achieve this challenging task, depending on how noise interacts with hyperspectral data. The first one leads to a convex optimization problem, and is solved with the Alternating Direction Method of Multipliers. The second one accounts for signal-dependent noise, and is addressed with a Reweighted Least Squares algorithm. Experiments on synthetic and real data demonstrate the effectiveness of our approach.
References in corpus (4)
- A convex model for non-negative matrix factorization and dimensionality reduction on physical space
- Proximal Splitting Methods in Signal Processing
- Nonlinear spectral unmixing of hyperspectral images using Gaussian processes
- Exploiting spatial sparsity for multi-wavelength imaging in optical interferometry
Cited by in corpus (9)
- Nonnegative Matrix Factorization for Signal and Data Analytics: Identifiability, Algorithms, and Applications
- Hyperspectral unmixing with spectral variability using a perturbed linear mixing model
- Estimating the Intrinsic Dimension of Hyperspectral Images Using an Eigen-Gap Approach
- Nonparametric Detection of Nonlinearly Mixed Pixels and Endmember Estimation in Hyperspectral Images
- Deep Generative Models for Library Augmentation in Multiple Endmember Spectral Mixture Analysis
- Kalman Filtering and Expectation Maximization for Multitemporal Spectral Unmixing
- Memory-Efficient Convex Optimization for Self-Dictionary Separable Nonnegative Matrix Factorization: A Frank-Wolfe Approach
- Deep Hyperspectral and Multispectral Image Fusion with Inter-image Variability
- A graph Laplacian regularization for hyperspectral data unmixing