Spectral Unmixing via Data-Guided Sparsity

DOI10.1109/TIP.2014.2363423zbMATH Open1374.94475arXiv1403.3155WikidataQ30862950 ScholiaQ30862950MaRDI QIDQ4592623FDOQ4592623

Bin Fan, Feiyun Zhu, Shiming Xiang, Gaofeng Meng, Chunhong Pan, Ying Wang

Publication date: 20 November 2017

Published in: IEEE Transactions on Image Processing (Search for Journal in Brave)

Abstract: Hyperspectral unmixing, the process of estimating a common set of spectral bases and their corresponding composite percentages at each pixel, is an important task for hyperspectral analysis, visualization and understanding. From an unsupervised learning perspective, this problem is very challenging---both the spectral bases and their composite percentages are unknown, making the solution space too large. To reduce the solution space, many approaches have been proposed by exploiting various priors. In practice, these priors would easily lead to some unsuitable solution. This is because they are achieved by applying an identical strength of constraints to all the factors, which does not hold in practice. To overcome this limitation, we propose a novel sparsity based method by learning a data-guided map to describe the individual mixed level of each pixel. Through this data-guided map, the $el{l}_p(0<p<1)$ constraint is applied in an adaptive manner. Such implementation not only meets the practical situation, but also guides the spectral bases toward the pixels under highly sparse constraint. What's more, an elegant optimization scheme as well as its convergence proof have been provided in this paper. Extensive experiments on several datasets also demonstrate that the data-guided map is feasible, and high quality unmixing results could be obtained by our method.

Full work available at URL: https://arxiv.org/abs/1403.3155

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Cited In (16)

• On statistical learning of simplices: unmixing problem revisited
• Tensor completion by multi-rank via unitary transformation
• Alternating direction method of multipliers for linear hyperspectral unmixing
• An exact penalty approach for optimization with nonnegative orthogonality constraints
• Orthogonal Nonnegative Matrix Factorization by Sparsity and Nuclear Norm Optimization
• Nonlocal robust tensor recovery with nonconvex regularization ^*
• Orthogonal Nonnegative Tucker Decomposition
• Efficient preconditioning for noisy separable nonnegative matrix factorization problems by successive projection based low-rank approximations
• A Corrected Tensor Nuclear Norm Minimization Method for Noisy Low-Rank Tensor Completion
• Demixing sines and spikes: Robust spectral super-resolution in the presence of outliers
• Spatial feature extraction non-negative tensor factorization for hyperspectral unmixing
• A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization
• Rank properties and computational methods for orthogonal tensor decompositions
• Blind Spectral Unmixing Based on Sparse Nonnegative Matrix Factorization
• Active set type algorithms for nonnegative matrix factorization in hyperspectral unmixing
• Nonnegative Matrix Factorization Via Archetypal Analysis

This page was built for publication: Spectral Unmixing via Data-Guided Sparsity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4592623)