Investigation of the random forest framework for classification of hyperspectral data
The University of Texas at Austin
Abstract
Statistical classification of byperspectral data is challenging because the inputs are high in dimension and represent multiple classes that are sometimes quite mixed, while the amount and quality of ground truth in the form of labeled data is typically limited. The resulting classifiers are often unstable and have poor generalization. This work investigates two approaches based on the concept of random forests of classifiers implemented within a binary hierarchical multiclassifier system, with the goal of achieving improved generalization of the classifier in analysis of hyperspectral data, particularly when the quantity of training data is limited. A new classifier is proposed that incorporates bagging of…
Citation impact
- FWCI
- 24.65
- Percentile
- 100%
- References
- 32
Authors
4- JHJ. HamCorresponding
The University of Texas at Austin
- YCYangchi Chen
The University of Texas at Austin
- MMMelba M. Crawford
The University of Texas at Austin
- JGJoydeep Ghosh
The University of Texas at Austin
Topics & keywords
- Random forest
- Hyperspectral imaging
- Computer science
- Subspace topology
- Random subspace method
- Artificial intelligence
- Classifier (UML)
- Pattern recognition (psychology)
- Life in Land