The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Approximating the Kullback Leibler Divergence Between Gaussian Mixture Models
Abstract
The Kullback Leibler (KL) divergence is a widely used tool in statistics and pattern recognition. The KL divergence between two Gaussian mixture models (GMMs) is frequently needed in the fields of speech and image recognition. Unfortunately the KL divergence between two GMMs is not analytically tractable, nor does any efficient computational algorithm exist. Some techniques cope with this problem by replacing the KL divergence with other functions that can be computed efficiently. We introduce two new methods, the variational approximation and the variational upper bound, and compare them to existing methods. We discuss seven different techniques in total and weigh the benefits of each one against the others. To conclude we evaluate the performance of each one through numerical experiments.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Information theory and statistics
(1959) · Journal of the Franklin Institute · doi:10.1016/0016-0032(59)90368-0 · Cited by 7,094
An Introduction to Variational Methods for Graphical Models
Jordan, M. I., Ghahramani, Z., Jaakkola, T. S., & Saul, L. K. (1999) · Machine Learning · doi:10.1023/a:1007665907178 · Cited by 3,791
Computation of channel capacity and rate-distortion functions
Blahut, R. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054855 · Cited by 1,381
An algorithm for computing the capacity of arbitrary discrete memoryless channels
Arimoto, S. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054753 · Cited by 838
Information Theory and Statistics
(2005) · Elements of Information Theory · doi:10.1002/047174882x.ch11 · Cited by 729
Goldberger, Gordon, & Greenspan (2003) · Proceedings Ninth IEEE International Conference on Computer Vision · doi:10.1109/iccv.2003.1238387 · Cited by 409
Fast approximation of Kullback-Leibler distance for dependence trees and hidden Markov models
Do, M. N. (2003) · IEEE Signal Processing Letters · doi:10.1109/lsp.2003.809034 · Cited by 221
Average divergence distance as a statistical discrimination measure for hidden Markov models
Silva, J. F., & Narayanan, S. S. (2006) · IEEE Transactions on Audio Speech and Language Processing · doi:10.1109/tsa.2005.858059 · Cited by 55
Theory and practice of acoustic confusability
Printz, H., & Olsen, P. A. (2002) · Computer Speech & Language · doi:10.1006/csla.2001.0188 · Cited by 47
Self-citation
Cited by
Anomaly detection in crowded scenes
Mahadevan, V., Li, W., Bhalodia, V., & Vasconcelos, N. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5539872 · Cited by 1,512
Anomaly Detection and Localization in Crowded Scenes
Li, W., Mahadevan, V., & Vasconcelos, N. (2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.111 · Cited by 1,017
Learning Sparse Neural Networks through $L_0$ Regularization
Louizos, C., Welling, M., & Kingma, D. P. (2017) · arXiv · doi:10.48550/arxiv.1712.01312 · Cited by 628
A comprehensive survey and analysis of generative models in machine learning
GM, H., Gourisaria, M. K., Pandey, M., & Rautaray, S. S. (2020) · Computer Science Review · doi:10.1016/j.cosrev.2020.100285 · Cited by 432
On the Achievable Rate of OFDM With Index Modulation
Wen, M., Cheng, X., Ma, M., Jiao, B., & Poor, H. V. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2500880 · Cited by 282
Metadata
- Authors
- Hershey, J. R., & Olsen, P. A.
- Venue
- 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07
- Publisher
- IEEE
- Published
- 2007-04
- Pages
- IV-317-IV-320
- ISSN
- 1520-6149 (ISSN-L)
- OpenAlex
- W2033178790
- Cited by
- 1,189
- References
- 10
- FWCI
- 17.57
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Approximating the Kullback Leibler Divergence Between Gaussian Mixture Models. https://app.cochat.ai/papers/10.1109/icassp.2007.366913
- The paper
- Hershey, J. R., & Olsen, P. A. (2007). Approximating the Kullback Leibler Divergence Between Gaussian Mixture Models. 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07. https://doi.org/10.1109/icassp.2007.366913
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.