返回
A pairwise decision tree framework for hyperspectral classification
DOI:10.1080/01431160600954696.png)
摘要
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.
Keyword:
ALGORITHM
SELECTION
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.6
论文数:
1.2W
被引数:
2.7W
机构
暂无机构信息
引用论文
A genetic-algorithm-based selective principal component analysis (GA-SPCA) method for high-dimensional data feature extraction基于遗传算法的选择性主成分分析 (ga-spca) 高维数据特征提取方法
An efficiency comparison between a 18 pulses diode rectifier and a multi-cell AFE rectifier operating with FCS — MPC18脉冲二极管整流器与采用FCS—MPC控制的多单元AFE整流器之间的效率比较

