Warianty tytułu
Języki publikacji
Abstrakty
In the paper, selected informations on Hidden Markov Models (also called Hidden Markov Chains) are reminded. Basic riotions are defined and algorithms related to these models are shortly presented. The research part of the papers shows results of three conducted experiments entitled: "pork cutlet", "form sheet" and ''poetaster". The most important experiment "form sheet" gives a good starting point to a practical application of HMMs to the. handwriting recognition. The "poetaster" experiment shows possible application of HMMs in so called "artifial creation".
Czasopismo
Rocznik
Tom
Strony
175-189
Opis fizyczny
Bibliogr. 6 poz., rys., tab.
Twórcy
autor
- Politechnika Szczecińska, Wydział Informatyki
Bibliografia
- [1] Baum L. E., Sell G. Ft. Growth functions for transformations on manifolds. Pac.J.Math., vol. 73, 1967, pp. 360 363.
- [2] Bronsztejn I. N., Siemiendiajew K. A., Musioł G.. Mulig H.. Nowoczesne Kompendium Matematyki. Wydawnictwo Naukowe PWN, Warszawa, Polska, 2004.
- [3] Graham R. L.. Knuth D. E., Patashnik O. Matematyka konkretna. Wydawnictwo Naukowe PWN SA, Warszawa, Polska, 2002, Tytuł oryginału: Concrete Mathematics. A foundation for Computer Science.
- [4] Kemeny J. G., Snell 3. L. Finite markov chains. Springer Verlag, U.S.A., 1960,1976.
- [5] Rabiner L. R. A tutorial on Hidden Markov Models and Selected Applications in Speech Recognition. IEEE, vol. 77, 2 1989, pp. 257 286.
- [6] Viterbi A. J. Error bounds for convolutional codes and an asymptotically optimal decoding algorithm. IEEE, Trans. Informal. Theory, vol. IT-13, 1967, pp. 200 209.
Typ dokumentu
Bibliografia
Identyfikatory
Identyfikator YADDA
bwmeta1.element.baztech-article-BPS3-0010-0016