Skip to main content

Cyclic Viterbi Score for Linear Hidden Markov Models

  • Conference paper
  • 2320 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 4478))

Abstract

Hidden Markov Models (HMM) have been successfully applied to describe sequences of observable events. In some problems, objects are more appropriately described as cyclic sequences, i.e., sequences with no begin/end point. Conventional HMMs with Viterbi score cannot deal adequately with cyclic sequences. We propose a cyclic Viterbi score that can be efficiently computed for Linear HMMs. Linear HMMs model sequences that can be partitioned into contiguous segments where each state is responsible for emitting all symbols in one of the segments. Experiments show that our proposal outperforms other approaches in an isolated characters handwritten-text recognition task.

Work partially supported by the Ministerio de Educación y Ciencia (TIN2006-12767), the Generalitat Valenciana (GV06/302) and Bancaixa (P1 1B2006-31).

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Marzal, A., Barrachina, S.: Speeding up the computation of the edit distance for cyclic strings. In: Int. Conf. on Pattern Recognition, pp. 271–280 (2000)

    Google Scholar 

  2. Arica, N., Yarman-Vural, F.: A shape descriptor based on circular hidden markov model. In: International Conference on Pattern Recognition, vol. 1, pp. 924–927 (2000)

    Google Scholar 

  3. Baum, L.E., Petrie, T., Soules, G., Weiss, N.: A maximization technique occurring in the statistical analysis of probabilistic functions of markov chains. Ann. Math. Stat. 41, 164–171 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  4. Peris, G., Marzal, A.: Fast cyclic edit distance computation with weighted edit costs in classification. In: Int. Conf. on Pattern Recognition, pp. 184–187 (2002)

    Google Scholar 

  5. Juang, B.H., Rabiner, L.R.: The segmental K-means algorithm for estimating parameters of hidden markov models. IEEE Transactions on Acoustics, Speech, and Signal Processing 38(9), 1639 (1990)

    Article  MATH  Google Scholar 

  6. Maes, M.: On a cyclic string-to-string correction problem. Information Processing Letters 35, 73–78 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  7. Rabiner, L.R.: A tutorial on hidden Markov models and selected applications in speech recognition. Proc IEEE 77(2) (1989)

    Google Scholar 

  8. Young, S., Odell, J., Ollason, D., Valtchev, V., Woodland, P.: The HTK Book. Cambridge University (1995, 1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Joan Martí José Miguel Benedí Ana Maria Mendonça Joan Serrat

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Palazón, V., Marzal, A. (2007). Cyclic Viterbi Score for Linear Hidden Markov Models. In: Martí, J., Benedí, J.M., Mendonça, A.M., Serrat, J. (eds) Pattern Recognition and Image Analysis. IbPRIA 2007. Lecture Notes in Computer Science, vol 4478. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72849-8_43

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72849-8_43

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72848-1

  • Online ISBN: 978-3-540-72849-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics