Hidden Markov models vs. syntactic modeling in object recognition

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.

[1]  Anil K. Jain Fundamentals of Digital Image Processing , 2018, Control of Color Imaging Systems.

[2]  Richard M. Schwartz,et al.  On-line cursive handwriting recognition using speech recognition methods , 1994, Proceedings of ICASSP '94. IEEE International Conference on Acoustics, Speech and Signal Processing.

[3]  Ana L. N. Fred,et al.  Clustering of sequences using minimum grammar compexity criterion , 1996, ICGI.

[4]  Yang He,et al.  2-D Shape Classification Using Hidden Markov Model , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  Taylor L. Booth,et al.  Grammatical Inference: Introduction and Survey-Part I , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Francisco Casacuberta Some Relations Among Stochastic Finite State Networks Used in Automatic Speech Recognition , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

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