18th International Conference on Pattern Recognition (ICPR'06) Volume 3 Feature Selection based on the Bhattacharyya Distance Hong Kong August 20-August 24 ISBN: 0-7695-2521-0
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPR.2006.558
This paper presents a Bhattacharyya distance based feature selection method, which utilizes a recursive algorithm to obtain the optimal dimension reduction matrix in terms of the minimum upper bound of classification error under normal distribution for multi-class classification problem. In our scheme, PCA is incorporated as a pre-processing to reduce the intractably heavy computation burden of the recursive algorithm. The superior experimental results on the handwritten-digit recognition with the MNIST database and the steganalysis applications have demonstrated the effectiveness of our proposed method.
Citation:
Guorong Xuan, Xiuming Zhu, Peiqi Chai, Zhenping Zhang, Yun Q. Shi, Dongdong Fu, "Feature Selection based on the Bhattacharyya Distance," icpr, vol. 3, pp.1232-1235, 18th International Conference on Pattern Recognition (ICPR'06) Volume 3, 2006 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||