The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Optimal Clustering Framework for Hyperspectral Band Selection
Open accessAbstract
Band selection, by choosing a set of representative bands in a hyperspectral image, is an effective method to reduce the redundant information without compromising the original contents. Recently, various unsupervised band selection methods have been proposed, but most of them are based on approximation algorithms which can only obtain suboptimal solutions toward a specific objective function. This paper focuses on clustering-based band selection and proposes a new framework to solve the above dilemma, claiming the following contributions: 1) an optimal clustering framework, which can obtain the optimal clustering result for a particular form of objective function under a reasonable constraint; 2) a rank on clusters strategy, which provides an effective criterion to select bands on existing clustering structure; and 3) an automatic method to determine the number of the required bands, which can better evaluate the distinctive information produced by certain number of bands. In experiments, the proposed algorithm is compared with some state-of-the-art competitors. According to the experimental results, the proposed algorithm is robust and significantly outperforms the other methods on various data sets.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Nearest neighbor pattern classification
Cover, T., & Hart, P. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1053964 · Cited by 16,936
Spectral–Spatial Hyperspectral Image Classification With Edge-Preserving Filtering
Kang, X., Li, S., & Benediktsson, J. A. (2014) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2013.2264508 · Cited by 704 · cited 1×
“They are k-nearest neighborhood (KNN) [46], linear discriminant analysis (LDA) [47], support vector machine (SVM) [48], and edge-preserving filtering (EPF) [49].”
Cited by
GETNET: A General End-to-End 2-D CNN Framework for Hyperspectral Image Change Detection
Wang, Q., Yuan, Z., Du, Q., & Li, X. (2019) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2018.2849692 · Cited by 577
Self-citationDeep Cross-Domain Few-Shot Learning for Hyperspectral Image Classification
Li, Z., Liu, M., Chen, Y., Xu, Y., Li, W., & Du, Q. (2022) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2021.3057066 · Cited by 302
SSR-NET: Spatial–Spectral Reconstruction Network for Hyperspectral and Multispectral Image Fusion
Zhang, X., Huang, W., Wang, Q., & Li, X. (2021) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2020.3018732 · Cited by 292
Self-citationBS-Nets: An End-to-End Framework for Band Selection of Hyperspectral Image
Cai, Y., Liu, X., & Cai, Z. (2020) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2019.2951433 · Cited by 278
Metadata
- Authors
- Wang, Q., Zhang, F., & Li, X.
- Venue
- IEEE Transactions on Geoscience and Remote Sensing
- Published
- 2018
- Pages
- 1-13
- ISSN
- 0196-2892 (ISSN-L)
- 1558-0644
- OpenAlex
- W2799954862
- Cited by
- 243
- References
- 2
- FWCI
- 20.44
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.