2013
DOI: 10.1016/j.isprsjprs.2013.02.020
|View full text |Cite
|
Sign up to set email alerts
|

A Gaussian elimination based fast endmember extraction algorithm for hyperspectral imagery

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
17
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
7
1

Relationship

2
6

Authors

Journals

citations
Cited by 41 publications
(18 citation statements)
references
References 27 publications
1
17
0
Order By: Relevance
“…The spectrum of yellow water is very similar to that of ice/snow, but with a much lower value. A pure water signature can be extracted by endmember extraction algorithms [40,41], or by using water signatures in a spectral library. In this study, for similarity, we manually pick some pure water points in the image for each kind of water based on the ground reference maps.…”
Section: Pure Water Signature Extractionmentioning
confidence: 99%
“…The spectrum of yellow water is very similar to that of ice/snow, but with a much lower value. A pure water signature can be extracted by endmember extraction algorithms [40,41], or by using water signatures in a spectral library. In this study, for similarity, we manually pick some pure water points in the image for each kind of water based on the ground reference maps.…”
Section: Pure Water Signature Extractionmentioning
confidence: 99%
“…As illustrated in Figure 3a, a water-land mixing model assumes that a mixed pixel is a linear combination of water and land endmembers weighted by their corresponding fractions, which satisfy the abundance sum-to-one constraint (ASC) and abundance nonnegative constraint (ANC) [28], where r is the spectrum of the mixed pixel, eW and eL correspond to the water and land endmembers, and cW and cL represent the fractions of water and land endmembers. The endmembers can be extracted from the Landsat images using the common endmember extraction algorithms [28][29][30][31][32][33]. However, these algorithms often assume that all pixels in the image are constructed by the same mixing model.…”
Section: Solving the Spectral Mixing Problem Using Local Spectral Unmmentioning
confidence: 99%
“…LMM is the most popular model for hyperspectral image analysis [28], [3]. Suppose we are given a hyperspectral image with L bands and N pixels {y n } N n=1 ∈ R L + .…”
Section: A Linear Mixture Model (Lmm)mentioning
confidence: 99%