Spectral Unmixing via Data-Guided Sparsity

DOI10.1109/TIP.2014.2363423zbMath1374.94475arXiv1403.3155WikidataQ30862950 ScholiaQ30862950MaRDI QIDQ4592623

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)

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)

Related Items (14)

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

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