The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Best-bases feature extraction algorithms for classification of hyperspectral data
Abstract
Due to advances in sensor technology, it is now possible to acquire hyperspectral data simultaneously in hundreds of bands. Algorithms that both reduce the dimensionality of the data sets and handle highly correlated bands are required to exploit the information in these data sets effectively. the authors propose a set of best-bases feature extraction algorithms that are simple, fast, and highly effective for classification of hyperspectral data. These techniques intelligently combine subsets of adjacent bands into a smaller number of features. Both top-down and bottom-up algorithms are proposed. The top-down algorithm recursively partitions the bands into two (not necessarily equal) sets of bands and then replaces each final set of bands by its mean value. The bottom-up algorithm builds an agglomerative tree by merging highly correlated adjacent bands and projecting them onto their Fisher direction, yielding high discrimination among classes. Both these algorithms are used in a pairwise classifier framework where the original C-class problem is divided into a set of (/sub 2//sup C/) two-class problems. The new algorithms (1) find variable length bases localized in wavelength, (2) favor grouping highly correlated adjacent bands that, when merged either by taking their mean or Fisher linear projection, yield maximum discrimination, and (3) seek orthogonal bases for each of the (/sub 2//sup C/) two-class problems into which a C-class problem can be decomposed. Experiments on an AVIRIS data set for a 12-class problem show significant improvements in classification accuracies while using a much smaller number of features.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
Huber, P. J. (1985) · The Annals of Statistics · doi:10.1214/aos/1176349519 · Cited by 1,277
Cited by
Classification of hyperspectral remote sensing images with support vector machines
Melgani, F., & Bruzzone, L. (2004) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2004.831865 · Cited by 4,411
Hyperspectral remote sensing data analysis and future challenges
Bioucas-Dias, J. M., Plaza, A., Camps-Valls, G., Scheunders, P., Nasrabadi, N., & Chanussot, J. (2013) · IEEE Geoscience and Remote Sensing Magazine · doi:10.1109/mgrs.2013.2244672 · Cited by 2,223
Investigation of the random forest framework for classification of hyperspectral data
Ham, J., Chen, Y., Crawford, M. M., & Ghosh, J. (2005) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2004.842481 · Cited by 1,276
Self-citationConvolutional neural networks for hyperspectral image classification
Yu, S., Jia, S., & Xu, C. (2017) · Neurocomputing · doi:10.1016/j.neucom.2016.09.010 · Cited by 703
Rasti, B., Hong, D., Hang, R., Ghamisi, P., Kang, X., Chanussot, J., & Benediktsson, J. A. (2020) · IEEE Geoscience and Remote Sensing Magazine · doi:10.1109/mgrs.2020.2979764 · Cited by 537
Metadata
- Authors
- Kumar, S., Ghosh, J., & Crawford, M. M.
- Venue
- IEEE Transactions on Geoscience and Remote Sensing
- Published
- 2001-07
- Volume
- 39
- Issue
- 7
- Pages
- 1368-1379
- ISSN
- 0196-2892 (ISSN-L)
- OpenAlex
- W2138583748
- Cited by
- 248
- References
- 2
- FWCI
- 34.91
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Best-bases feature extraction algorithms for classification of hyperspectral data. https://app.cochat.ai/papers/10.1109/36.934070
- The paper
- Kumar, S., Ghosh, J., & Crawford, M. M. (2001). Best-bases feature extraction algorithms for classification of hyperspectral data. IEEE Transactions on Geoscience and Remote Sensing. https://doi.org/10.1109/36.934070
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.