loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Data Compression Conference (DCC '95)
Coding with partially hidden Markov models
Snowbird, Utah
March 28-March 30
ISBN: 0-8186-7012-6
S. Forchhammer, Inst. of Telecommun., Tech. Univ. Denmark, Lyngby, Denmark
J. Rissanen, Inst. of Telecommun., Tech. Univ. Denmark, Lyngby, Denmark
Partially hidden Markov models (PHMM) are introduced. They are a variation of the hidden Markov models (HMM) combining the power of explicit conditioning on past observations and the power of using hidden states. (P)HMM may be combined with arithmetic coding for lossless data compression. A general 2-part coding scheme for given model order but unknown parameters based on PHMM is presented. A forward-backward reestimation of parameters with a redefined backward variable is given for these models and used for estimating the unknown parameters. Proof of convergence of this reestimation is given. The PHMM structure and the conditions of the convergence proof allows for application of the PHMM to image coding. Relations between the PHMM and hidden Markov models (HMM) are treated. Results of coding bi-level images with the PHMM coding scheme is given. The results indicate that the PHMM can adapt to instationarities in the images.
Index Terms:
image coding; arithmetic codes; data compression; hidden Markov models; parameter estimation; convergence of numerical methods; partially hidden Markov models; arithmetic coding; lossless data compression; forward-backward reestimation; parameter estimation; unknown parameters; convergence; image coding; bi-level images; PHMM coding scheme
Citation:
S. Forchhammer, J. Rissanen, "Coding with partially hidden Markov models," dcc, pp.92, Data Compression Conference (DCC '95), 1995
Usage of this product signifies your acceptance of the Terms of Use.