2011
DOI: 10.1109/lgrs.2010.2053516
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Method for Supervised Hyperspectral Band Selection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
101
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
3
3
3

Relationship

1
8

Authors

Journals

citations
Cited by 251 publications
(108 citation statements)
references
References 13 publications
0
101
0
Order By: Relevance
“…As noted in the introduction, one major issue arising from this approach is how to deal with redundant bands caused by band correlation. As an alternative, another BP-derived SQMBS method is to specify a particular application such as minimum estimated abundance covariance (MEAC) for classification [34], which can generate feature vectors for BP and then takes advantage of the sequential forward floating search (SFFS) and sequential backward floating search (SBFS) developed in [73] to derive forward and backward BS methods. However, the band correlation issue still remains.…”
Section: Band Subset Selectionmentioning
confidence: 99%
“…As noted in the introduction, one major issue arising from this approach is how to deal with redundant bands caused by band correlation. As an alternative, another BP-derived SQMBS method is to specify a particular application such as minimum estimated abundance covariance (MEAC) for classification [34], which can generate feature vectors for BP and then takes advantage of the sequential forward floating search (SFFS) and sequential backward floating search (SBFS) developed in [73] to derive forward and backward BS methods. However, the band correlation issue still remains.…”
Section: Band Subset Selectionmentioning
confidence: 99%
“…In an unsupervised case, the most informative and distinctive bands are selected according to certain searching criteria. In this paper we adopt an unsupervised method in [10] and a supervised method in [11] due to their excellent performance and simple implementation. Both algorithms were designed using spectral unmixing related concepts in conjunction with sequential forward search strategy.…”
Section: Band Selection Based On the Difference Imagementioning
confidence: 99%
“…The algorithm can continue to select more bands. A minimum estimated abundance covariance (MEAC) method was proposed for supervised band selection [11]. Assume that a given pixel z can be expressed according to a linear mixture model:…”
Section: Main Descriptionsmentioning
confidence: 99%
“…This procedure usually results in a loss of accuracy as the data dimensionality increases, which is called the curse of dimensionality (Chen andZhang, 2011, Kaya et al, 2011). Therefore, the most important and urgent issue is how to reduce the number of those bands largely, but without loss of information (Yang et al, 2011, Paskaleva et al, 2008.…”
Section: Introductionmentioning
confidence: 99%