2015
DOI: 10.1016/j.ijleo.2015.08.020
|View full text |Cite
|
Sign up to set email alerts
|

Fast implementation of linear and nonlinear simplex growing algorithm for hyperspectral endmember extraction

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2018
2018

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 24 publications
0
1
0
Order By: Relevance
“…The 30 th band grey map of the simulated dataset is shown in Fig.3(b). The endmember spectral was extracted by FNSGA (Zhao et al, 2015) and the fraction maps were generated by Fully Constrained Least Squares (Heinz and Chein-I-Chang, 2002) method on the degraded low-resolution images. Then subpixel localization was performed.…”
Section: Simulation Experimentsmentioning
confidence: 99%
“…The 30 th band grey map of the simulated dataset is shown in Fig.3(b). The endmember spectral was extracted by FNSGA (Zhao et al, 2015) and the fraction maps were generated by Fully Constrained Least Squares (Heinz and Chein-I-Chang, 2002) method on the degraded low-resolution images. Then subpixel localization was performed.…”
Section: Simulation Experimentsmentioning
confidence: 99%