Fast approximation of Kullback-Leibler distance for dependence trees and hidden Markov models

IEEE Signal Processing Letters

Volumn 10, Issue 4, 2003, Pages 115-118

  Do, Minh N ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

Dependence tree models; Hidden Markov models; Kullback Leibler distance

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; IMAGE RETRIEVAL; MARKOV PROCESSES; MATHEMATICAL MODELS; MONTE CARLO METHODS; REAL TIME SYSTEMS; TREES (MATHEMATICS);

DATASETS;

SPEECH RECOGNITION;

EID: 0037381325     PISSN: 10709908     EISSN: None     Source Type: Journal    
DOI: 10.1109/LSP.2003.809034     Document Type: Article

References (7)

1. O. Roneri, J. R. Rohlicek, and M. Ostendorf, "Parameter estimation of dependence tree models using the EM algorithm," IEEE Signal Processing Lett., vol. 2, pp. 157-159, Aug. 1995.
2. L. R. Rabiner, "A tutorial on hidden Markov models and selected applications in speech recognition," Proc. IEEE, vol. 77, pp. 257-286, Feb. 1989.
3. M. Crouse, R. D. Nowak, and R. O. Baraniuk, "Wavelet-based signal processing using hidden Markov models," IEEE Trans. Signal Processing, vol. 46, pp. 886-902, Apr. 1998.
4. B. H. Juang and L. R. Rabiner, "A probabilistic distance measure for hidden Markov models," AT&T Tech. J., vol. 64, no. 2, pp. 391-408, Feb. 1985.
5. M. N. Do and M. Vetterli, "Rotation invariant texture characterization and retrieval using steerable wavelet-domain hidden Markov models," IEEE Trans. Multimedia, vol. 4, pp. 517-527, Dec. 2002.
6. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley Interscience, 1991.
7. Y. Singer and M. K. Warmuth, "Batch and on-line parameter estimation of Gaussian mixtures based on the joint entropy," in Proc. Advances in Neural Information Processing Systems 11 (NIPS'98), 1998, pp. 578-584.