2016
DOI: 10.1109/tgrs.2015.2453362
|View full text |Cite
|
Sign up to set email alerts
|

Unsupervised Hyperspectral Band Selection by Dominant Set Extraction

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
39
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 95 publications
(39 citation statements)
references
References 46 publications
0
39
0
Order By: Relevance
“…According to the involvement of the labeled and the unlabeled samples, band selection can be divided into supervised [9][10][11][12][13], semi-supervised [14][15][16][17] and unsupervised [18][19][20][21][22][23] methods. Supervised and semi-supervised methods utilize the labeled samples to guide the selection process.…”
Section: Introductionmentioning
confidence: 99%
“…According to the involvement of the labeled and the unlabeled samples, band selection can be divided into supervised [9][10][11][12][13], semi-supervised [14][15][16][17] and unsupervised [18][19][20][21][22][23] methods. Supervised and semi-supervised methods utilize the labeled samples to guide the selection process.…”
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%
“…Then, a search algorithm called mixture determinantal point process (Mix-DPP) was further developed to find a diverse subset that can be a potential optimal band combination. The other is DSEBS, which exploits structure information via a set of local spatial-spectral filters and uses a graph-based clustering search strategy derived from dominant set extraction to find a potential optimal band subset [40].…”
Section: This Is Infeasible Ifmentioning
confidence: 99%
“…Feature selection means selecting part of the original bands based on proper criterion [19]. Typical feature selection algorithms include multitask sparsity pursuit [20], structure-aware [21], support vector machine [22], hypergraph model [23], sparse Hilbert-Schmidt independence criterion [24] and nonhomogeneous hidden Markov chain model [25]. Different measures were used to select preferred bands, including mutual information [12], information divergence [13], variance [26] and local spatial information [27].…”
Section: Introductionmentioning
confidence: 99%