.png){kind=icon}
Return
A pairwise decision tree framework for hyperspectral classification
.png){kind=icon}
PRE
AI
DOI：10.1080/01431160600954696.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A novel pairwise decision tree (PDT) framework is proposed for hyperspectral classification, where no partitions and clustering are needed and the original C-class problem is divided into a set of two-class problems. The top of the tree includes all original classes. Each internal node consists of either a set of class pairs or a set of class pairs and a single class. The pairs are selected by the proposed sequential forward selection (SFS) or sequential backward selection (SBS) algorithms. The current node is divided into next-stage nodes by excluding either class of each selected pair. In the classification, an unlabelled pixel is recursively classified into the next node, by excluding the less similar class of each node pair until the classification result is obtained. Compared to the single-stage classifier approach, the pairwise classifier framework and the binary hierarchical classifier (BHC), experiments on an Airborne Visible/Infrared Imaging Spectrometer (AVIRIS) data set for a nine-class problem demonstrated the effectiveness of the proposed framework.
Keywords:
ALGORITHM
SELECTION
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.6
Papers:
1.2W
Citations:
2.7W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSave
ShareSaveShareSaveShareSaveShareSave
View more