• DocumentCode
    2221174
  • Title

    Feature extraction using the Bhattacharyya distance

  • Author

    Lee, Chulhee ; Hong, Daesik

  • Author_Institution
    Dept. of Electron. Eng., Yonsei Univ., Seoul, South Korea
  • Volume
    3
  • fYear
    1997
  • fDate
    12-15 Oct 1997
  • Firstpage
    2147
  • Abstract
    The Bhattacharyya distance provides valuable information in determining the effectiveness of a feature set and has been used as a separability measure for feature selection. In Lee (1997), it has been shown that it is feasible to predict the classification error accurately using the Bhattacharyya distance. The new formula makes it possible to estimate classification error between two classes within 1-2% margin. In this paper, we propose a new feature extraction method utilizing the result. Initially, we start with an arbitrary feature vector. Assuming that the feature vector is used for classification, we estimate the classification error using the error estimation formula. Then we move the feature vector slightly in the direction so that the estimated classification error is decreased most rapidly. This can be done by taking a gradient. Experiments show that the proposed method compares favorably with the conventional methods
  • Keywords
    decision theory; feature extraction; maximum likelihood estimation; pattern classification; search problems; Bhattacharyya distance; classification error; feature extraction; feature selection; separability measure; Distributed computing; Equations; Error analysis; Feature extraction; Gaussian distribution;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Systems, Man, and Cybernetics, 1997. Computational Cybernetics and Simulation., 1997 IEEE International Conference on
  • Conference_Location
    Orlando, FL
  • ISSN
    1062-922X
  • Print_ISBN
    0-7803-4053-1
  • Type

    conf

  • DOI
    10.1109/ICSMC.1997.635183
  • Filename
    635183