Feature selection based on the Bhattacharyya distance

Guorong Xuan, Xiuming Zhu, Peiqi Chai, Zhenping Zhang, Yun Q. Shi, Dongdong Fu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

34 Scopus citations

Abstract

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.

Original languageEnglish (US)
Title of host publicationProceedings - 18th International Conference on Pattern Recognition, ICPR 2006
Pages1232-1235
Number of pages4
DOIs
StatePublished - 2006
Event18th International Conference on Pattern Recognition, ICPR 2006 - Hong Kong, China
Duration: Aug 20 2006Aug 24 2006

Publication series

NameProceedings - International Conference on Pattern Recognition
Volume3
ISSN (Print)1051-4651

Other

Other18th International Conference on Pattern Recognition, ICPR 2006
CountryChina
CityHong Kong
Period8/20/068/24/06

All Science Journal Classification (ASJC) codes

  • Computer Vision and Pattern Recognition

Fingerprint Dive into the research topics of 'Feature selection based on the Bhattacharyya distance'. Together they form a unique fingerprint.

Cite this