The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
A new vector quantization clustering algorithm
Abstract
The pairwise nearest neighbor (PNN) algorithm is presented as an alternative to the Linde-Buzo-Gray (1980, LBG) (generalized Lloyd, 1982) algorithm for vector quantization clustering. The PNN algorithm derives a vector quantization codebook in a diminishingly small fraction of the time previously required, without sacrificing performance. In addition, the time needed to generate a codebook grows only O(N log N) in training set size and is independent of the number of code words desired. Using this method, one can either minimize the number of code words needed subject to a maximum rate. The PNN algorithm can be used with squared error and weighted squared error distortion measure. Simulations on a variety of images encoded at 1/2 b/pixel indicate that PNN codebooks can be developed in roughly 5% of the time required by the LBG algorithm.>
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
Least squares quantization in PCM
Lloyd, S. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056489 · Cited by 15,836
Multidimensional binary search trees used for associative searching
Bentley, J. L. (1975) · Communications of the ACM · doi:10.1145/361002.361007 · Cited by 7,520
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
Gray, R. M. (1990) · Readings in Speech Recognition · doi:10.1016/b978-0-08-051584-7.50011-5 · Cited by 2,845
An Algorithm for Finding Best Matches in Logarithmic Expected Time
Friedman, J. H., Bentley, J. L., & Finkel, R. A. (1977) · ACM Transactions on Mathematical Software · doi:10.1145/355744.355745 · Cited by 2,813
An improvement of the minimum distortion encoding algorithm for vector quantization
Bei, C.-D., & Gray, R. M. (1985) · IEEE Transactions on Communications · doi:10.1109/tcom.1985.1096214 · Cited by 411
On the structure of vector quantizers
Gersho, A. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056457 · Cited by 317
Image coding using vector quantization
Gersho, A., & Ramamurthi, B. (2005) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1982.1171673 · Cited by 150
Vector quantiser of video signals
Murakami, T., Asai, K., & Yamazaki, E. (1982) · Electronics Letters · doi:10.1049/el:19820688 · Cited by 63
Fast algorithms for vector quantization picture coding
Equitz, W. (2005) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1987.1169547 · Cited by 50
Self-citation
Cited by
Gray, R. M., & Neuhoff, D. L. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720541 · Cited by 1,642
A Survey of Quantization Methods for Efficient Neural Network Inference
Gholami, A., Kim, S., Dong, Z., Yao, Z., Mahoney, M. W., & Keutzer, K. (2022) · Low-Power Computer Vision · doi:10.1201/9781003162810-13 · Cited by 1,219
“This concept was extended and became practical in [53, 55, 67, 201] for real communication applications.”
Speech emotion recognition using hidden Markov models
Nwe, T. L., Foo, S. W., & De Silva, L. C. (2003) · Speech Communication · doi:10.1016/s0167-6393(03)00099-2 · Cited by 920
Iterative shrinking method for clustering problems
Fränti, P., & Virmajoki, O. (2006) · Pattern Recognition · doi:10.1016/j.patcog.2005.09.012 · Cited by 341
Image compression techniques: A survey in lossless and lossy algorithms
Hussain, A. J., Al-Fayadh, A., & Radi, N. (2018) · Neurocomputing · doi:10.1016/j.neucom.2018.02.094 · Cited by 275
Metadata
- Authors
- Equitz, W. H.
- Venue
- IEEE Transactions on Acoustics, Speech, and Signal Processing
- Published
- 1989
- Volume
- 37
- Issue
- 10
- Pages
- 1568-1575
- ISSN
- 0096-3518 (ISSN-L)
- OpenAlex
- W2156097299
- Cited by
- 405
- References
- 10
- FWCI
- 7.64
- 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.