Hidden Markov models vs. syntactic modeling in object recognition
- 22 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 893-896
Abstract
This paper addresses the problem of object recognition based on contour descriptions. Two approaches, namely hidden Markov models (HMM) and syntactic modeling based on stochastic finite-state grammars (SFSG), are analyzed and applied to the classification of hardware tools. It is shown that both approaches are able to capture the data variability, leading to high classification performance. While the syntactic paradigm is flexible, the structure of the grammars being automatically inferred from the data, the HMMs are more robust in terms of training data sets requirements.Keywords
This publication has 7 references indexed in Scilit:
- On-line cursive handwriting recognition using speech recognition methods2002
- Clustering of sequences using a minimum grammar complexity criterion1996
- 2-D shape classification using hidden Markov modelIEEE Transactions on Pattern Analysis and Machine Intelligence, 1991
- Some relations among stochastic finite state networks used in automatic speech recognitionIEEE Transactions on Pattern Analysis and Machine Intelligence, 1990
- GRAMMATICAL INFERENCE1990
- A tutorial on hidden Markov models and selected applications in speech recognitionProceedings of the IEEE, 1989
- Grammatical Inference: Introduction and Survey-Part IIEEE Transactions on Pattern Analysis and Machine Intelligence, 1986