The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Vector quantization by deterministic annealing
Abstract
A deterministic annealing approach is suggested to search for the optimal vector quantizer given a set of training data. The problem is reformulated within a probabilistic framework. No prior knowledge is assumed on the source density, and the principle of maximum entropy is used to obtain the association probabilities at a given average distortion. The corresponding Lagrange multiplier is inversely related to the 'temperature' and is used to control the annealing process. In this process, as the temperature is lowered, the system undergoes a sequence of phase transitions when existing clusters split naturally, without use of heuristics. The resulting codebook is independent of the codebook used to initialize the iterations.>
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 48,949
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949
Least squares quantization in PCM
Lloyd, S. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056489 · Cited by 15,836
Information theory and statistical mechanics
Jaynes, E. T. (1957) · Physical Review · doi:10.1103/physrev.106.620 · Cited by 12,931
Self-Organization and Associative Memory
Kohonen, T. (1989) · Springer Series in Information Sciences · doi:10.1007/978-3-642-88163-3 · Cited by 8,740
An Algorithm for Vector Quantizer Design
Linde, Y., Buzo, A., & Gray, R. (1980) · IEEE Transactions on Communications · doi:10.1109/tcom.1980.1094577 · Cited by 7,201
Information theory and statistics
(1959) · Journal of the Franklin Institute · doi:10.1016/0016-0032(59)90368-0 · Cited by 7,094
A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters
Dunn, J. C. (1973) · Journal of Cybernetics · doi:10.1080/01969727308546046 · Cited by 5,049
Self-Organization and Associative Memory
Kohonen, T. (1988) · Springer Series in Information Sciences · doi:10.1007/978-3-662-00784-6 · Cited by 3,812
Quantizing for minimum distortion
Max, J. (1960) · IEEE Transactions on Information Theory · doi:10.1109/tit.1960.1057548 · Cited by 2,038
Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy
Shore, J., & Johnson, R. (1980) · IEEE Transactions on Information Theory · doi:10.1109/tit.1980.1056144 · Cited by 1,774
A Convergence Theorem for the Fuzzy ISODATA Clustering Algorithms
Bezdek, J. C. (1980) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1980.4766964 · Cited by 980
A clustering technique for summarizing multivariate data
Ball, G. H., & Hall, D. J. (1967) · Behavioral Science · doi:10.1002/bs.3830120210 · Cited by 912
(1990) · Acta Applicandae Mathematicae · doi:10.1007/bf00046910 · Cited by 882
Statistical mechanics and phase transitions in clustering
Rose, K., Gurewitz, E., & Fox, G. C. (1990) · Physical Review Letters · doi:10.1103/physrevlett.65.945 · Cited by 458
Self-citationA deterministic annealing approach to clustering
Rose, K., Gurewitz, E., & Fox, G. (1990) · Pattern Recognition Letters · doi:10.1016/0167-8655(90)90010-y · Cited by 382
Self-citationInformation Theory and Statistics
Haroutunian, E. (2011) · International Encyclopedia of Statistical Science · doi:10.1007/978-3-642-04898-2_643 · Cited by 219
Competitive learning and soft competition for vector quantizer design
Yair, E., Zeger, K., & Gersho, A. (1992) · IEEE Transactions on Signal Processing · doi:10.1109/78.124940 · Cited by 199
An Analysis of the Elastic Net Approach to the Traveling Salesman Problem
Durbin, R., Szeliski, R., & Yuille, A. (1989) · Neural Computation · doi:10.1162/neco.1989.1.3.348 · Cited by 184
Constrained clustering as an optimization method
Rose, K., Gurewitz, E., & Fox, G. C. (1993) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.236251 · Cited by 168
Self-citationA tutorial survey of theory and applications of simulated annealing
Hajek, B. (1985) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.1985.268599 · Cited by 148
Globally optimal vector quantizer design by stochastic relaxation
Zeger, K., Vaisey, J., & Gersho, A. (1992) · IEEE Transactions on Signal Processing · doi:10.1109/78.124941 · Cited by 127
Statistical mechanics as the underlying theory of ‘elastic’ and ‘neural’ optimisations
Simić, P. (1990) · Network Computation in Neural Systems · doi:10.1088/0954-898x_1_1_007 · Cited by 123
Gradient algorithms for designing predictive vector quantizers
Chang, P., & Gray, R. M. (1986) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1986.1164905 · Cited by 107
Stochastic relaxation algorithm for improved vector quantiser design
Zeger, K., & Gersho, A. (1989) · Electronics Letters · doi:10.1049/el:19890601 · Cited by 38
Cited by
(2006) · The MIT Press eBooks · doi:10.7551/mitpress/9780262033589.001.0001 · Cited by 4,280
Gray, R. M., & Neuhoff, D. L. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720541 · Cited by 1,642
Rose, K. (1998) · Proceedings of the IEEE · doi:10.1109/5.726788 · Cited by 876
Self-citationStability-Based Validation of Clustering Solutions
Lange, T., Roth, V., Braun, M. L., & Buhmann, J. M. (2004) · Neural Computation · doi:10.1162/089976604773717621 · Cited by 526
Deterministic annealing EM algorithm
Ueda, N., & Nakano, R. (1998) · Neural Networks · doi:10.1016/s0893-6080(97)00133-0 · Cited by 469
Metadata
- Authors
- Rose, K., Gurewitz, E., & Fox, G. C.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1992-07
- Volume
- 38
- Issue
- 4
- Pages
- 1249-1257
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2074225934
- Cited by
- 262
- References
- 28
- FWCI
- 9.08
- Type
- journal article
- 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
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.