Abstract
Shape descriptions and the corresponding matching techniques must be robust to noise and invariant to transformations for their use in recognition tasks. Most transformations are relatively easy to handle when contours are represented by strings. However, starting point invariance is difficult to achieve. One interesting possibility is the use of cyclic strings, which are strings with no starting and final points. Here we present the use of Hidden Markov Models for modelling cyclic strings and their training using Expectation Maximization. Experimental results show that our proposal outperforms other methods in the literature.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Palazón-Gonzláez, V., Marzal, A.: On the dynamic time warping of cyclic sequences for shape retrieval. Image and Vision Computing 30(12), 978–990 (2012)
Rabiner, L.R.: A tutorial on hidden Markov models and selected applications in speech recognition. Proc. IEEE 77(2) (1989)
He, Y., Kundu, A.: 2-D shape classification using hidden Markov model. IEEE Trans. Pattern Anal. Mach. Intell. 13(11), 1172–1184 (1991)
Arica, N., Yarman-Vural, F.: A shape descriptor based on circular hidden Markov model. In: ICPR, vol. I, pp. 924–927 (2000)
Bicego, M., Murino, V.: Investigating hidden Markov models’ capabilities in 2D shape classification. IEEE Trans. Pattern Anal. Mach. Intell. 26(2), 281–286 (2004)
Bicego, Murino, Figueiredo: Similarity-based classification of sequences using hidden Markov models. Pattern Recognition 37, 2281–2291 (2004)
Thakoor, N., Gao, J., Jung, S.: Hidden Markov model-based weighted likelihood discriminant for 2-D shape classification. IEEE Trans. Image Processing 16(11), 2707–2719 (2007)
Palazón, V., Marzal, A., Vilar, J.M.: Cyclic linear hidden Markov models for shape classification. In: Mery, D., Rueda, L. (eds.) PSIVT 2007. LNCS, vol. 4872, pp. 152–165. Springer, Heidelberg (2007)
Bartolini, I., Ciaccia, P., Patella, M.: WARP: Accurate retrieval of shapes using phase of fourier descriptors and time warping distance. IEEE Trans. Pattern Anal. Mach. Intell. 27(1), 142–147 (2005)
Baum, L.E., Eagon, J.A.: An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model of ecology. Bull. Amer. Math. Soc. 73, 360–363 (1967)
Levinson, S.E., Rabiner, L.R., Sondhi, M.M.: An introduction to the application of the theory of probabilistic functions of a Markov process to automatic speech recognition. The Bell System Technical Journal 62(4), 1035–1074 (1983)
Latecki, L., Lakämper, R., Eckhardt, U.: Shape descriptors for non-rigid shapes with a single closed contour. In: CVPR, June 13-15, pp. 424–429. IEEE, Los Alamitos (2000)
Sharvit, D., Chan, J., Tek, H., Kimia, B.B.: Symmetry-based indexing of image databases. In: Workshop on Content-Based Access of Image and Video Libraries, pp. 56–62 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Palazón-González, V., Marzal, A., Vilar, J.M. (2013). EM Training of Hidden Markov Models for Shape Recognition Using Cyclic Strings. In: Lee, M., Hirose, A., Hou, ZG., Kil, R.M. (eds) Neural Information Processing. ICONIP 2013. Lecture Notes in Computer Science, vol 8228. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-42051-1_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-42051-1_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-42050-4
Online ISBN: 978-3-642-42051-1
eBook Packages: Computer ScienceComputer Science (R0)