Investigating hidden Markov models' capabilities in 2D shape classification

In this paper, Hidden Markov Models (HMMs) are investigated for the purpose of classifying planar shapes represented by their curvature coefficients. In the training phase, special attention is devoted to the initialization and model selection issues, which make the learning phase particularly effective. The results of tests on different data sets show that the proposed system is able to accurately classify objects that were translated, rotated, occluded, or deformed by shearing, also in the presence of noise.

[1]  Agostino Dovier,et al.  Designing the Minimal Structure of Hidden Markov Model by Bisimulation , 2001, EMMCVPR.

[2]  Pascal Fua,et al.  Computational strategies for object recognition , 1992, CSUR.

[3]  S. P. Mudur,et al.  Three-dimensional computer vision: a geometric viewpoint , 1993 .

[4]  L. Baum,et al.  A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains , 1970 .

[5]  Fatos T. Yarman-Vural,et al.  A shape descriptor based on circular hidden Markov model , 2000, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000.

[6]  Mário A. T. Figueiredo,et al.  A sequential pruning strategy for the selection of the number of states in hidden Markov models , 2003, Pattern Recognit. Lett..

[7]  Anders Krogh,et al.  Hidden Markov models for sequence analysis: extension and analysis of the basic method , 1996, Comput. Appl. Biosci..

[8]  D. Rubin,et al.  Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .

[9]  Sven Loncaric,et al.  A survey of shape analysis techniques , 1998, Pattern Recognit..

[10]  Alex Pentland,et al.  Action Reaction Learning: Automatic Visual Analysis and Synthesis of Interactive Behaviour , 1999, ICVS.

[11]  Azriel Rosenfeld,et al.  Computer Vision , 1988, Adv. Comput..

[12]  L. Baum,et al.  An inequality and associated maximization technique in statistical estimation of probabilistic functions of a Markov process , 1972 .

[13]  B. Ripley,et al.  Pattern Recognition , 1968, Nature.

[14]  Ana L. N. Fred,et al.  Hidden Markov models vs. syntactic modeling in object recognition , 1997, Proceedings of International Conference on Image Processing.

[15]  Gerhard Rigoll,et al.  Hidden Markov model based continuous online gesture recognition , 1998, Proceedings. Fourteenth International Conference on Pattern Recognition (Cat. No.98EX170).

[16]  Linda G. Shapiro,et al.  Computer Vision , 2001 .

[17]  Manuele Bicego,et al.  2D shape recognition by hidden Markov models , 2001, Proceedings 11th International Conference on Image Analysis and Processing.

[18]  Geoffrey J. McLachlan,et al.  Finite Mixture Models , 2019, Annual Review of Statistics and Its Application.

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

[20]  New York Dover,et al.  ON THE CONVERGENCE PROPERTIES OF THE EM ALGORITHM , 1983 .

[21]  G. Schwarz.  Estimating the Dimension of a Model , 1978 .

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

[23]  Matthew Brand,et al.  An Entropic Estimator for Structure Discovery , 1998, NIPS.

[24]  Andreas Stolcke,et al.  Hidden Markov Model} Induction by Bayesian Model Merging , 1992, NIPS.

[25]  Philip N. Klein,et al.  Recognition of shapes by editing their shock graphs , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[26]  Philip N. Klein,et al.  Recognition of Shapes by Editing Shock Graphs , 2001, ICCV.

[27]  Jinhai Cai,et al.  Hidden Markov Models with Spectral Features for 2D Shape Recognition , 2001, IEEE Trans. Pattern Anal. Mach. Intell..