The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2019
DOI: 10.1109/jstars.2019.2901122
|View full text |Cite
|
Sign up to set email alerts
|

Sparsity-Constrained Distributed Unmixing of Hyperspectral Data

Abstract: Spectral unmixing (SU) is a technique to characterize mixed pixels in hyperspectral images measured by remote sensors. Most of the spectral unmixing algorithms are developed using the linear mixing models. To estimate endmembers and fractional abundance matrices in a blind problem, nonnegative matrix factorization (NMF) and its developments are widely used in the SU problem. One of the constraints which was added to NMF is sparsity, that was regularized by Lq norm. In this paper, a new algorithm based on distr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 19 publications
(9 citation statements)
references
References 55 publications
0
9
0
Order By: Relevance
“…Endmember extraction can be accomplished using the methods based on projection convex geometry analysis, sparse matrix regression analysis, or statistical learning analysis and so on [20,21]. There are cases, paintings for example, where the images may contain less or even no pure pixel but mixed pixels.…”
Section: Endmember Extractionmentioning
confidence: 99%
“…Endmember extraction can be accomplished using the methods based on projection convex geometry analysis, sparse matrix regression analysis, or statistical learning analysis and so on [20,21]. There are cases, paintings for example, where the images may contain less or even no pure pixel but mixed pixels.…”
Section: Endmember Extractionmentioning
confidence: 99%
“…Apply the abundance non-negativity and sum-to-one constraints to provide fully constrained fractions. For this part, we project the output fractions onto the canonical simplex [56], as presented in [38] and [57].…”
Section: Methodological Frameworkmentioning
confidence: 99%
“…Compute the estimated active set I k with one of the de nitions (AS1) or (AS2). Compute the search direction of the active and inactive variables with (15) and (16).…”
Section: Step 1 (Computation Of the Search Direction)mentioning
confidence: 99%
“…To produce useful decompositions, some constraints on the scales of U or V are needed. Hoyer proposed the nonnegative sparse coding in [10,11], and NMF with sparse constraint had been applied to unmix hyperspectral data [12][13][14][15][16]. Cai et al presented graph-regularized nonnegative matrix factorization (GNMF) [17,18].…”
Section: Introductionmentioning
confidence: 99%