On hidden Markov models and cyclic strings for shape recognition
From MaRDI portal
Publication:2629864
DOI10.1016/j.patcog.2014.01.018zbMath1339.68237OpenAlexW2069412033MaRDI QIDQ2629864
Andrés Marzal, Vicente Palazón-González, Juan Miguel Vilar
Publication date: 7 July 2016
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10234/124503
Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a cyclic string-to-string correction problem
- On the convergence properties of the EM algorithm
- Estimating the dimension of a model
- The segmental K-means algorithm for estimating parameters of hidden Markov models
- An Introduction to the Application of the Theory of Probabilistic Functions of a Markov Process to Automatic Speech Recognition
- An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology