Share Email Print

Journal of Electronic Imaging

Markov chain models based on genetic algorithms for texture and speech recognition
Author(s): Shiueng-Bien Yang; You-Ping Huang
Format Member Price Non-Member Price
PDF $20.00 $25.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

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.

Paper Details

Date Published: 1 July 2006
PDF: 12 pages
J. Electron. Imag. 15(3) 033004 doi: 10.1117/1.2234731
Published in: Journal of Electronic Imaging Volume 15, Issue 3
Show Author Affiliations
Shiueng-Bien Yang, Leader Univ. (Taiwan)
You-Ping Huang, Leader Univ. (Taiwan)

© SPIE. Terms of Use
Back to Top