.png){kind=icon}
Return
Collaborative Sparse Regression for Hyperspectral Unmixing
.png){kind=icon}
OA
AI
DOI：10.1109/TGRS.2013.2240001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Sparse unmixing has been recently introduced in hyperspectral imaging as a framework to characterize mixed pixels. It assumes that the observed image signatures can be expressed in the form of linear combinations of a number of pure spectral signatures known in advance (e. g., spectra collected on the ground by a field spectroradiometer). Unmixing then amounts to finding the optimal subset of signatures in a (potentially very large) spectral library that can best model each mixed pixel in the scene. In this paper, we present a refinement of the sparse unmixing methodology recently introduced which exploits the usual very low number of endmembers present in real images, out of a very large library. Specifically, we adopt the collaborative (also called multitask or simultaneous) sparse regression framework that improves the unmixing results by solving a joint sparse regression problem, where the sparsity is simultaneously imposed to all pixels in the data set. Our experimental results with both synthetic and real hyperspectral data sets show clearly the advantages obtained using the new joint sparse regression strategy, compared with the pixelwise independent approach.
Keywords:
Collaborative sparse regression
hyperspectral imaging
sparse unmixing
spectral libraries
Journal
IF:
8.6
Papers:
2.1W
Citations:
10.7W
Organization
Cited Papers
ShareSaveAlgorithms for simultaneous sparse approximation. Part II: Convex relaxation.png)
SIGNAL PROCESSING
SIGNAL PROCESSINGIF3.6
PREAI
ShareSaveShareSaveShareSaveShareSaveShareSave
View more