2017
DOI: 10.1109/tip.2016.2617462
|View full text |Cite
|
Sign up to set email alerts
|

Discovering Diverse Subset for Unsupervised Hyperspectral Band Selection

Abstract: Band selection, as a special case of the feature selection problem, tries to remove redundant bands and select a few important bands to represent the whole image cube. This has attracted much attention, since the selected bands provide discriminative information for further applications and reduce the computational burden. Though hyperspectral band selection has gained rapid development in recent years, it is still a challenging task because of the following requirements: 1) an effective model can capture the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
58
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 179 publications
(65 citation statements)
references
References 64 publications
0
58
0
Order By: Relevance
“…According to the employed searching strategy [24], unsupervised band selection can be categorized into rankingbased, clustering-based, greedy-based and evolutionary-based methods. Ranking-based methods assign each band a rank value and simply select the top-rank bands with the desired number.…”
Section: Introductionmentioning
confidence: 99%
“…According to the employed searching strategy [24], unsupervised band selection can be categorized into rankingbased, clustering-based, greedy-based and evolutionary-based methods. Ranking-based methods assign each band a rank value and simply select the top-rank bands with the desired number.…”
Section: Introductionmentioning
confidence: 99%
“…It is completely different from existing BS methods, with the following contributions: (i) It is a BSS method particularly developed for HSIC; (ii) It is quite different from single band-constrained methods in [26] and multiple-band constrained methods in [68], by constraining multiple class signature vectors instead of multiple bands; (iii) It develops three numerical search algorithms to find optimal band subsets which are different from the graph-based approaches [40,43] used by other SMMBS methods; (iv) It is very simple to implement via (7) with no parameters needing to be tuned; (v) Most importantly, it shows that HSIC can be improved by BS provided that the number n BS of selected bands and the set of n BS bands are properly selected.…”
Section: Discussionmentioning
confidence: 99%
“…One is to use graph-based representations with each path used to specify a particular band subset. For example, Yuan et al [43] proposed a graph-based SMMBS method, called multigraph determinantal point process (MDPP), which makes use of multiple graphs to discover a structure and diverse band subset from a graph where each node represents a band and the edges are specified by similarity between bands. Accordingly, a path represents a possible band subset.…”
Section: This Is Infeasible Ifmentioning
confidence: 99%
“…However, the sensors with higher resolution produce a very large volume of data, it will render the traditional image processing algorithms designed for multispectral imagery ineffective [6,7]. In particular, the high dimensionality of HSI data brings about the "curse of dimensionality" problem, that is, under a fixed, small number of training samples, the classification accuracy of HSI data decreases when the dimensionality of HSI data increases [8][9][10]. Besides, the spectral bands are highly correlated and some spectral bands may not carry discriminant information in a specific application.…”
Section: Introductionmentioning
confidence: 99%