2014
DOI: 10.1109/jstars.2013.2280063
|View full text |Cite
|
Sign up to set email alerts
|

Non-Local Sparse Unmixing for Hyperspectral Remote Sensing Imagery

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
54
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 115 publications
(54 citation statements)
references
References 30 publications
0
54
0
Order By: Relevance
“…The "reference" column represents the SREs of unmixing results using clean data (not contaminated by the noise) to construct the graph Laplacian matrix. It clearly demonstrates the advantage of pre-denoising before constructing L. Some other denoising methods could also be applied to get better performance, such as non-local total variation, BM3D, and sparse representation [2,26]. …”
Section: The Graph Laplacian Matrix Lmentioning
confidence: 99%
See 2 more Smart Citations
“…The "reference" column represents the SREs of unmixing results using clean data (not contaminated by the noise) to construct the graph Laplacian matrix. It clearly demonstrates the advantage of pre-denoising before constructing L. Some other denoising methods could also be applied to get better performance, such as non-local total variation, BM3D, and sparse representation [2,26]. …”
Section: The Graph Laplacian Matrix Lmentioning
confidence: 99%
“…In general, two restrictions are imposed on the fractional abundances X in LMM due to physical constraints [5,21,24,26,33]. On the one hand, we often assume X ij 0 where X ij denotes the (i, j)-th entry of X, termed as the abundance non-negative constraint (ANC).…”
Section: Linear Mixture Model (Lmm)mentioning
confidence: 99%
See 1 more Smart Citation
“…With the LMM, it is assumed that the spectra of each mixed pixel are linear combinations of the endmembers contained in the pixel. Despite the fact that it holds only for macroscopic mixture conditions [8,11], it is widely used due to its computational tractability and flexibility in various applications.…”
Section: Introductionmentioning
confidence: 99%
“…Mei et al proposed a novel spatially and spectrally constrained sparse unmixing algorithm by imposing spatial and spectral constraints in selecting endmembers from a spectral library that consists of image-derived endmembers [38], which can alleviate the influence of spectral variation. Zhong et al proposed a new sparse unmixing algorithm based on non-local means (NLSU) [39], and it introduces a non-local mean regularization term for sparse unmixing through a weighting average for all the pixels in the abundance image, which is adopted to exploit the similar patterns and structures of the abundance. Iordache et al also proposed collaborative SUnSAL (CLSUnSAL) to improve unmixing results by adopting the collaborative sparse regression framework [40], where the sparsity of abundance is characterized by the 2,1 norm and simultaneously imposed on all pixels in the HSI.…”
Section: Introductionmentioning
confidence: 99%