The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
On the structure of vector quantizers
Abstract
Vector quantization is intrinsically superior to predictive coding, transform coding, and other suboptimal and {\em ad hoc} procedures since it achieves optimal rate distortion performance subject only to a constraint on memory or block length of the observable signal segment being encoded. The key limitation of existing techniques is the very large randomly generated code books which must be stored, and the computational complexity of the associated encoding procedures. The quantization operation is decomposed into its rudimentary structural components. This leads to a simple and elegant approach to derive analytical properties of optimal quantizers. Some useful properties of quantizers and algorithmic approaches are given, which are relevant to the complexity of both storage and processing in the encoding operation. Highly disordered quantizers, which have been designed using a clustering algorithm, are considered. Finally, lattice quantizers are examined which circumvent the need for a code book by using a highly structured code based on lattices. The code vectors are algorithmically generated in a simple manner rather than stored in a code book, and fast algorithms perform the encoding algorithm with negligible complexity.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
(1967) · Cited by 23,719
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
Cluster Analysis for Applications
(1973) · Elsevier eBooks · doi:10.1016/c2013-0-06161-0 · Cited by 5,080
Voronoi, G. (1908) · Journal für die reine und angewandte Mathematik (Crelles Journal) · doi:10.1515/crll.1908.134.198 · Cited by 2,248
Cluster analysis of multivariate data : efficiency versus interpretability of classifications
Forgy, E. W. (1965) · Biometrics · Cited by 2,093
A clustering technique for summarizing multivariate data
Ball, G. H., & Hall, D. J. (1967) · Behavioral Science · doi:10.1002/bs.3830120210 · Cited by 912
Asymptotically optimal block quantization
Gersho, A. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1056067 · Cited by 863
Self-citationSpeech coding based upon vector quantization
Buzo, A., Gray, A., Gray, R., & Markel, J. (1980) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1980.1163445 · Cited by 559
Multidimensional group analysis
Jancey, R. (1966) · Australian Journal of Botany · doi:10.1071/bt9660127 · Cited by 193
Asymptotic performance of block quantizers with difference distortion measures
Yamada, Y., Tazaki, S., & Gray, R. M. (1980) · IEEE Transactions on Information Theory · doi:10.1109/tit.1980.1056142 · Cited by 150
Tables of sphere packings and spherical codes
Sloane, N. J. A. (1981) · IEEE Transactions on Information Theory · doi:10.1109/tit.1981.1056351 · Cited by 145
Gersho, A. (1977) · Communications Society · doi:10.1109/mcom.1977.1089500 · Cited by 79
Self-citationOn two or more dimensional optimum quantizers
Chen, D. (2005) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1977.1170166 · Cited by 17
Optimum quantizer algorithm for real-time block quantizing
Menez, J., Boeri, F., & Esteban, D. (2005) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1979.1170824 · Cited by 12
Cited by
Image denoising by sparse 3-D transform-domain collaborative filtering
Dabov, K., Foi, A., Katkovnik, V., & Egiazarian, K. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2007.901238 · Cited by 9,283
Kohonen, T. (1990) · Proceedings of the IEEE · doi:10.1109/5.58325 · Cited by 8,414
Image coding using wavelet transform
Antonini, M., Barlaud, M., Mathieu, P., & Daubechies, I. (1992) · IEEE Transactions on Image Processing · doi:10.1109/83.136597 · Cited by 3,525
Gray, R. M. (1990) · Readings in Speech Recognition · doi:10.1016/b978-0-08-051584-7.50011-5 · Cited by 2,845
Essentials of the self-organizing map
Kohonen, T. (2013) · Neural Networks · doi:10.1016/j.neunet.2012.09.018 · Cited by 1,601
Metadata
- Authors
- Gersho, A.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1982-03
- Volume
- 28
- Issue
- 2
- Pages
- 157-166
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2040336387
- Cited by
- 317
- References
- 14
- FWCI
- 14.11
- 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.