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

Scalable One-Pass Self-Representation Learning for Hyperspectral Band Selection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 37 publications
(15 citation statements)
references
References 49 publications
0
15
0
Order By: Relevance
“…To reduce the redundancy of the HSI, we construct sub-HSIs as the input samples by using correlation [32] between bands. Figure 9a is a visualization of the correlation coefficient matrix.…”
Section: Feature Extractionmentioning
confidence: 99%
See 1 more Smart Citation
“…To reduce the redundancy of the HSI, we construct sub-HSIs as the input samples by using correlation [32] between bands. Figure 9a is a visualization of the correlation coefficient matrix.…”
Section: Feature Extractionmentioning
confidence: 99%
“…RSSC kernels can be initialized directly in the first frame and then updated in subsequent frames without offline iterative training of large dataset to extract discriminative spatialspectral features of a HSI in real-time. The redundancy of HSI is reduced by dividing it into sub-HSIs using band correlation [32], and the weights of each sub-HSI to tracking are expressed by relative entropy. Specifically, RSSC kernels are first initialized from a set of sub-HSIs obtained from the initial frame.…”
Section: Introductionmentioning
confidence: 99%
“…In fact, the spectral bands of HSI are highly redundant, so, we do not need to utilize full bands of HSIs. Dimensionality reduction is an effective preprocessing step to discard the redundant information [52][53][54]. Therefore, instead of using full bands we select part of the bands for spatial enhancement through the a parameter.…”
Section: Resblock2mentioning
confidence: 99%
“…The virtual dimensionality (VD) of this scene was estimated by the Harsanyi-Farrand-Chang (HFC) method in [21][22][23] as 9. However, according to [24,25], n BS = 9 seemed insufficient, because when the automatic target generation process (ATGP) developed in [26] was used to find target pixels, only three panel pixels could be found among nine ATGP-found target pixels.…”
Section: Linear Spectral Unmixingmentioning
confidence: 99%
“…However, how to appropriately choose a threshold is challenging, because this threshold is related to how close the correlation is. Recently, with the prevalence of matrix computing, band selection has been transformed into a matrix-based optimization problem reflecting the representativeness of bands from different perspectives-one study [22] formulated band selection into a low-rank-based representation model to define the affinity matrix of bands for band selection via rank minimization, and reference [23] presented a scalable one-pass self-representation learning for hyperspectral band selection. The second issue is that a BP criterion may be good for one application but may not be good for another application.…”
Section: Introductionmentioning
confidence: 99%