Feature selection based on the Bhattacharyya distance
Document Type
Conference Proceeding
Publication Date
12-1-2006
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. © 2006 IEEE.
Identifier
34147145862 (Scopus)
ISBN
[0769525210, 9780769525211]
Publication Title
Proceedings International Conference on Pattern Recognition
External Full Text Location
https://doi.org/10.1109/ICPR.2006.558
ISSN
10514651
First Page
1232
Last Page
1235
Volume
3
Recommended Citation
Xuan, Guorong; Zhu, Xiuming; Chai, Peiqi; Zhang, Zhenping; Shi, Yun Q.; and Fu, Dongdong, "Feature selection based on the Bhattacharyya distance" (2006). Faculty Publications. 18668.
https://digitalcommons.njit.edu/fac_pubs/18668
