1 July 2006 Markov chain models based on genetic algorithms for texture and speech recognition
Author Affiliations +
Markov chain models (MCMs) were recently adopted in many recognition applications. The well-known clustering algorithm, the k-means algorithm, is used to design the codebooks of the MCM, and then each code word in the codebook is regarded as one state of MCM. However, users usually have no idea how to determine the number of states before the design of the MCM, and therefore doubt whether the MCM produced by the k-means algorithm is optimal. We propose a new MCM based on the genetic algorithm for recognition applications. Genetic algorithms combine the clustering algorithm and the MCM design. The users do not need to define the size of the codebook before the design of the MCM. The genetic algorithm can automatically find the number of states in MCM, and thereby obtain a near-optimal MCM. Furthermore, we propose the fuzzy MCM (FMCM) and the fuzzy genetic algorithm (FGA) to enhance the recognition rate. Experimental results show that the proposed MCM outperforms the traditional MCM and other texture and speech recognition methods.
© (2006) Society of Photo-Optical Instrumentation Engineers (SPIE)
Shiueng-Bien Yang, Shiueng-Bien Yang, You-Ping Huang, You-Ping Huang, } "Markov chain models based on genetic algorithms for texture and speech recognition," Journal of Electronic Imaging 15(3), 033004 (1 July 2006). https://doi.org/10.1117/1.2234731 . Submission:


Indexing and retrieval VRML models
Proceedings of SPIE (December 19 2001)
Robust language-independent OCR system
Proceedings of SPIE (January 28 1999)
Learning of fuzzy rules by mountain clustering
Proceedings of SPIE (December 21 1993)

Back to Top