Fast Feature Selection in an HMM-Based Multiple Classifier System for Handwriting Recognition

A novel, fast feature selection method for hidden Markov model (HMM) based classifiers is introduced in this paper. It is also shown how this method can be used to create ensembles of classifiers. The proposed methods are tested in the context of a handwritten text recognition task.

[1]  Tin Kam Ho,et al.  The Random Subspace Method for Constructing Decision Forests , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Gerhard Rigoll,et al.  Combination of multiple classifiers for handwritten word recognition , 2002, Proceedings Eighth International Workshop on Frontiers in Handwriting Recognition.

[3]  Josef Kittler,et al.  Advances in Statistical Feature Selection , 2001, ICAPR.

[4]  Horst Bunke,et al.  Using a Statistical Language Model to Improve the Performance of an HMM-Based Cursive Handwriting Recognition System , 2001, Int. J. Pattern Recognit. Artif. Intell..

[5]  Yoav Freund,et al.  A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.

[6]  Gyeonghwan Kim,et al.  An architecture for handwritten text recognition systems , 1999, International Journal on Document Analysis and Recognition.

[7]  Yoav Freund,et al.  A decision-theoretic generalization of on-line learning and an application to boosting , 1997, EuroCOLT.

[8]  Pavel Pudil,et al.  Oscillating search algorithms for feature selection , 2000, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000.

[9]  Delphine Charlet,et al.  Optimizing feature set for speaker verification , 1997, Pattern Recognit. Lett..

[10]  Keinosuke Fukunaga,et al.  A Branch and Bound Algorithm for Feature Subset Selection , 1977, IEEE Transactions on Computers.

[11]  Robert Sabourin,et al.  An a priori indicator of the discrimination power of discrete hidden Markov models , 2001, Proceedings of Sixth International Conference on Document Analysis and Recognition.

[12]  Horst Bunke,et al.  The IAM-database: an English sentence database for offline handwriting recognition , 2002, International Journal on Document Analysis and Recognition.

[13]  Torsten Caesar,et al.  Sophisticated topology of hidden Markov models for cursive script recognition , 1993, Proceedings of 2nd International Conference on Document Analysis and Recognition (ICDAR '93).

[14]  Lawrence R. Rabiner,et al.  A tutorial on hidden Markov models and selected applications in speech recognition , 1989, Proc. IEEE.

[15]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[16]  Thomas G. Dietterich.  Multiple Classifier Systems , 2000, Lecture Notes in Computer Science.

[17]  Anil K. Jain,et al.  Feature Selection: Evaluation, Application, and Small Sample Performance , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  S. Krishnan,et al.  Feature selection for pattern classification with Gaussian mixture models: A new objective criterion , 1996, Pattern Recognit. Lett..

[19]  Josef Kittler,et al.  Floating search methods in feature selection , 1994, Pattern Recognit. Lett..

[20]  Josef Kittler,et al.  Pattern recognition : a statistical approach , 1982 .

[21]  Leo Breiman,et al.  Bagging Predictors , 1996, Machine Learning.