2013
DOI: 10.1117/1.jrs.7.073525
|View full text |Cite
|
Sign up to set email alerts
|

Comparison of hyperspectral endmember extraction algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 11 publications
0
3
0
Order By: Relevance
“…The proposed methodological framework for improved decision tree classification ( Figure 2) includes, mixed pixel decomposition, construction of an improved decision tree feature dataset, training sample selection based on three-dimensional (3D) Terrain, implementation of an improved decision tree, and accuracy evaluation. The basic premise of building an improved decision tree model is that (1) mixed pixel decomposition can be used to extract different endmember abundance quantities (the proportion of different kinds of features) from multispectral or hyperspectral data [29][30][31][32][33], (2) pixel unmixing can combine with classifier [34], and (3) the decision tree classification method can fuse various data features (such as terrain, texture, spectral information, Iterative Self-organizing Data Analysis Technique (ISODATA) results, Minimum Noise Fraction (MNF) results, and abundance) [35][36][37][38] Therefore, through decision tree algorithms, the potential ROI rules can be mined to establish classification tree for improving LULC analysis. Methodological framework for proposed improved decision tree method.…”
Section: Methodsmentioning
confidence: 99%
“…The proposed methodological framework for improved decision tree classification ( Figure 2) includes, mixed pixel decomposition, construction of an improved decision tree feature dataset, training sample selection based on three-dimensional (3D) Terrain, implementation of an improved decision tree, and accuracy evaluation. The basic premise of building an improved decision tree model is that (1) mixed pixel decomposition can be used to extract different endmember abundance quantities (the proportion of different kinds of features) from multispectral or hyperspectral data [29][30][31][32][33], (2) pixel unmixing can combine with classifier [34], and (3) the decision tree classification method can fuse various data features (such as terrain, texture, spectral information, Iterative Self-organizing Data Analysis Technique (ISODATA) results, Minimum Noise Fraction (MNF) results, and abundance) [35][36][37][38] Therefore, through decision tree algorithms, the potential ROI rules can be mined to establish classification tree for improving LULC analysis. Methodological framework for proposed improved decision tree method.…”
Section: Methodsmentioning
confidence: 99%
“…The most important block (and the one we specifically address in this paper) is the endmember extraction one, which provides prior information of pure materials for target detection [4], abundance mapping [5], change detection [6], and object classification [7]. As a result, proper extraction of pure endmembers is very important in hyperspectral data exploitation [8].…”
Section: Introductionmentioning
confidence: 99%
“…They are widespread in hyperspectral imagery and have become an obstacle for the high accuracy of ground target detection and classification. 3 Typical endmember extraction methods [3][4][5][6] include N-FINDR, 4 the simplex growing algorithm, 5 vertex component analysis (VCA), 6 and so on. 2 Among the various spectral unmixing methods, linear spectral unmixing has been the most widely used.…”
Section: Introductionmentioning
confidence: 99%