Title :
On the redundancy of HMM patterns
Author :
Dhulipala, Anand K. ; Orlitsky, Alon
Author_Institution :
Dept. of ECE, UCSD, La Jolla, CA, USA
fDate :
27 June-2 July 2004
Abstract :
In this paper the pattern redundancy of strings generated by hidden Markov models is bounded over unknown, possibly infinite alphabets, showing in particular that it diminishes to zero when the number of states is sufficiently small.
Keywords :
data compression; hidden Markov models; redundancy; hidden Markov model; infinite alphabet; pattern redundancy; Encoding; H infinity control; Hidden Markov models; Maximum likelihood estimation; Notice of Violation; Pattern analysis; Probability distribution; Speech; Upper bound; Video compression;
Conference_Titel :
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN :
0-7803-8280-3
DOI :
10.1109/ISIT.2004.1365048
