Least squares quantization in PCM
Open accessThe DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
It has long been realized that in pulse-code modulation (PCM), with a given ensemble of signals to handle, the quantum values should be spaced more closely in the voltage regions where the signal amplitude is more likely to fall. It has been shown by Panter and Dite that, in the limit as the number of quanta becomes infinite, the asymptotic fractional density of quanta per unit voltage should vary as the one-third power of the probability density per unit voltage of signal amplitudes. In this paper the corresponding result for any finite number of quanta is derived; that is, necessary conditions are found that the quanta and associated quantization intervals of an optimum finite quantization scheme must satisfy. The optimization criterion used is that the average quantization noise power be a minimum. It is shown that the result obtained here goes over into the Panter and Dite result as the number of quanta become large. The optimum quautization schemes for2^{b}quanta,b=1,2, \cdots, 7, are given numerically for Gaussian and for Laplacian distribution of signal amplitudes.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The text we found for this paper looks like another document, so the self-check wasn’t run.
Citations
Cites
Mathematical Methods of Statistics.
Geary, R. C., & Cramer, H. (1947) · The Economic Journal · doi:10.2307/2226151 · Cited by 5,927
Oliver, B. M., Pierce, J. R., & Shannon, C. E. (1948) · Proceedings of the IRE · doi:10.1109/jrproc.1948.231941 · Cited by 273
A Generalized Sampling Theorem
Kramer, H. P. (1959) · Studies in Applied Mathematics · doi:10.1002/sapm195938168 · Cited by 249
Quantization Distortion in Pulse-Count Modulation with Nonuniform Spacing of Levels
Panter, P. F., & Dite, W. (1951) · Proceedings of the IRE · doi:10.1109/jrproc.1951.230419 · Cited by 225
On a Generalized Sampling Theorem
Takizawa, É. I. (1975) · Journal of the Japan Society of Precision Engineering · doi:10.2493/jjspe1933.41.1050 · Cited by 208
Instantaneous companding of quantized signals
Smith, B. (1957) · The Bell System Technical Journal · doi:10.1002/j.1538-7305.1957.tb03858.x · Cited by 198
Kač, M. (1934) · Journal of the London Mathematical Society · doi:10.1112/jlms/s1-9.2.116 · Cited by 183
A SIMPLE PROOF AND SOME EXTENSIONS OF THE SAMPLING THEOREM
Parzen, E. (1956) · Defense Technical Information Center (DTIC) · doi:10.21236/ad0117999 · Cited by 48
The Comparison of Measured and Calculated Solar Radiations in Trabzon, Turkey
Kaygusuz, K. (1999) · Energy Sources · doi:10.1080/00908319950014830 · Cited by 47
Research works printed but not linked: 7
- 1956, Math Rev, 17, 757
- sch�tzenberger, 1954, Pub de l'Inst de Statis, 3, 56
- fleischer, 1964, Sufficient conditions for achieving minimum distortion in quantizer, IEEE Int Convention Record, 12, 104
- doob, 1953, Stochastic Processes
- lloyd, 1956, Linear least squares filtering and prediction of sampled signals, Symp Modern Network Synthesis, 5, 221
- zygmund, 1955, Trigonometrical Series, 47
- black, 1953, Modulation Theory
Cited by
Items 101–200 of 1,045
Data stream clustering: A survey
Silva, J. A., Faria, E. R., Barros, R. C., Hruschka, E. R., Carvalho, A. C. P. L. F. D., & Gama, J. (2013) · ACM Computing Surveys · doi:10.1145/2522968.2522981 · Cited by 508
Xia, T., Tao, D., Mei, T., & Zhang, Y. (2010) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2009.2039566 · Cited by 508
Selecting skyline services for QoS-based web service composition
Alrifai, M., Skoutas, D., & Risse, T. (2010) · International World Wide Web Conference (WWW) · doi:10.1145/1772690.1772693 · Cited by 502
An Introduction to Bioinformatics Algorithms
Jones, N., & Pevzner, P. A. (2004) · Cited by 500
Community detection in networks: A multidisciplinary review
Javed, M. A., Younis, M. S., Latif, S., Qadir, J., & Baig, A. (2018) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2018.02.011 · Cited by 499
Deep Learning with Low Precision by Half-Wave Gaussian Quantization
Cai, Z., He, X., Sun, J., & Vasconcelos, N. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.574 · Cited by 498
“Given dot product samples, the optimal solution of (9) can be obtained by Lloyd’s algorithm [27].”
MethodWhat is Machine Learning? A Primer for the Epidemiologist
Bi, Q., Goodman, K. E., Kaminsky, J., & Lessler, J. (2019) · American Journal of Epidemiology · doi:10.1093/aje/kwz189 · Cited by 496
Blind Image Quality Assessment Based on High Order Statistics Aggregation
Xu, J., Ye, P., Li, Q., Du, H., Liu, Y., & Doermann, D. (2016) · IEEE Transactions on Image Processing · doi:10.1109/tip.2016.2585880 · Cited by 495
LMMs-Eval: Reality Check on the Evaluation of Large Multimodal Models
Zhang, K., Li, B., Zhang, P., Pu, F., Cahyono, J. A., Hu, K., Liu, S., Zhang, Y., Yang, J., Li, C., et al. (2025) · Findings of the Association for Computational Linguistics: NAACL · doi:10.18653/v1/2025.findings-naacl.51 · Cited by 495
A Survey on Metric Learning for Feature Vectors and Structured Data
Bellet, A., Habrard, A., & Sebban, M. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1306.6709 · Cited by 494
Designing structured tight frames via an alternating projection method
Tropp, J. A., Dhillon, I. S., Heath, R. W., & Strohmer, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.839492 · Cited by 494
Griffin, D. W., & Lim, J. S. (1988) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/29.1651 · Cited by 494
Recent Advances in Graph Partitioning
Buluç, A., Meyerhenke, H., Safro, I., Sanders, P., & Schulz, C. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-49487-6_4 · Cited by 482
Understanding Straight-Through Estimator in Training Activation Quantized Neural Nets
Yin, P., Lyu, J., Zhang, S., Osher, S., Qi, Y., & Xin, J. X. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.05662 · Cited by 56
Segmentation of Multivariate Mixed Data via Lossy Data Coding and Compression
Ma, Y., Derksen, H., Hong, W., & Wright, J. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1085 · Cited by 481
Douze, M., Guzhva, A., Deng, C., Johnson, J., Szilvasy, G., Mazaré, P.-E., Lomeli, M., Hosseini, L., & Jégou, H. (2026) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2025.3618474 · Cited by 478
“This is formalized in the Lloyd necessary conditions for the optimality of a quantizer [61].”
A local search approximation algorithm for k-means clustering
Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silverman, R., & Wu, A. Y. (2002) · Proceedings of the eighteenth annual symposium on Computational geometry · doi:10.1145/513400.513402 · Cited by 474
Determining the three-dimensional atomic structure of an amorphous solid
Yang, Y., Zhou, J., Zhu, F., Yuan, Y., Chang, D. J., Kim, D. S., Pham, M., Rana, A., Tian, X., Yao, Y., et al. (2021) · Nature · doi:10.1038/s41586-021-03354-0 · Cited by 464
Liu, Z., Bessa, M. A., & Liu, W. K. (2016) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2016.04.004 · Cited by 463
Hierarchical mesh segmentation based on fitting primitives
Attene, M., Falcidieno, B., & Spagnuolo, M. (2006) · The Visual Computer · doi:10.1007/s00371-006-0375-x · Cited by 462
A local search approximation algorithm for k-means clustering
Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silverman, R., & Wu, A. Y. (2004) · Computational Geometry · doi:10.1016/s0925-7721(04)00021-5 · Cited by 461
Coordination and Geometric Optimization via Distributed Dynamical Systems
Cortés, J., & Bullo, F. (2005) · SIAM Journal on Control and Optimization · doi:10.1137/s0363012903428652 · Cited by 452
How much can k-means be improved by using better initialization and repeats?
Fränti, P., & Sieranoja, S. (2019) · Pattern Recognition · doi:10.1016/j.patcog.2019.04.014 · Cited by 451
Efficient Learning Machines: Theories, Concepts, and Applications for Engineers and System Designers
Awad, M., & Khanna, R. (2015) · Directory of Open access Books (OAPEN Foundation) · doi:10.1007/978-1-4302-5990-9 · Cited by 448
Sharma, G., & Trussell, H. J. (1997) · IEEE Transactions on Image Processing · doi:10.1109/83.597268 · Cited by 440
Bandara, K., Bergmeir, C., & Smyl, S. (2020) · Expert Systems with Applications · doi:10.1016/j.eswa.2019.112896 · Cited by 435
Foundations of MIMO Communication
Heath Jr, R. W., & Lozano, A. (2018) · Cambridge University Press eBooks · doi:10.1017/9781139049276 · Cited by 426
Chatterjee, P., & Milanfar, P. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2009.2037087 · Cited by 422
A review of machine learning in processing remote sensing data for mineral exploration
Shirmard, H., Farahbakhsh, E., Müller, R. D., & Chandra, R. (2022) · Remote Sensing of Environment · doi:10.1016/j.rse.2021.112750 · Cited by 420
Fast Computation of Wasserstein Barycenters
Cuturi, M., & Arnaud Doucet, B. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1310.4375 · Cited by 420
Privacy-preserving distributed k-means clustering over arbitrarily partitioned data
Jagannathan, G., & Wright, R. N. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081942 · Cited by 420
Local Aggregation for Unsupervised Learning of Visual Embeddings
Zhuang, C., Zhai, A., & Yamins, D. (2019) · 2019 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.00610 · Cited by 417
Two distinct forms of functional lateralization in the human brain
Gotts, S. J., Jo, H. J., Wallace, G. L., Saad, Z. S., Cox, R. W., & Martin, A. (2013) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1302581110 · Cited by 414
Speech coding: a tutorial review
Spanias, A. S. (1994) · Proceedings of the IEEE · doi:10.1109/5.326413 · Cited by 410
A multi-resolution approach to global ocean modeling
Ringler, T., Petersen, M., Higdon, R. L., Jacobsen, D., Jones, P. W., & Maltrud, M. (2013) · Ocean Modelling · doi:10.1016/j.ocemod.2013.04.010 · Cited by 407
Optimal pruning with applications to tree-structured source coding and modeling
Chou, P. A., Lookabaugh, T., & Gray, R. M. (1989) · IEEE Transactions on Information Theory · doi:10.1109/18.32124 · Cited by 407
Throughput Analysis of Massive MIMO Uplink With Low-Resolution ADCs
Jacobsson, S., Durisi, G., Coldrey, M., Gustavsson, U., & Studer, C. (2017) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2017.2691318 · Cited by 406
A new vector quantization clustering algorithm
Equitz, W. H. (1989) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/29.35395 · Cited by 405
Unsupervised Learning Methods for Molecular Simulation Data
Glielmo, A., Husic, B. E., Rodriguez, A., Clementi, C., Noé, F., & Laio, A. (2021) · Chemical Reviews · doi:10.1021/acs.chemrev.0c01195 · Cited by 402
Foundations of Signal Processing
Vetterli, M., Kovačević, J., & Goyal, V. K. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781139839099 · Cited by 393
Determine the Number of Unknown Targets in Open World Based on Elbow Method
Liu, F., & Deng, Y. (2020) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2020.2966182 · Cited by 393
Nam, J., Adhikary, A., Ahn, J. Y., & Caire, G. (2014) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2014.2313808 · Cited by 389
Maximizing boosted top identification by minimizing N-subjettiness
Thaler, J., & Van Tilburg, K. (2012) · Journal of High Energy Physics · doi:10.1007/jhep02(2012)093 · Cited by 387
Recursive Least Squares Dictionary Learning Algorithm
Skretting, K., & Engan, K. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2040671 · Cited by 387
Graph Clustering with Graph Neural NetworksPreprint
Tsitsulin, A., Palowitch, J., Perozzi, B., & Müller, E. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.16904 · Cited by 389
Block Quantization of Correlated Gaussian Random Variables
Huang, J., & Schultheiss, P. (1963) · IEEE Transactions on Communications · doi:10.1109/tcom.1963.1088759 · Cited by 386
Improving the Accuracy and Efficiency of the k-means Clustering Algorithm
Nazeer, K. A. A., & Sebastian, M. P. (2009) · Cited by 383
Zhu, Q., Zhong, Y., Zhao, B., Xia, G.-S., & Zhang, L. (2016) · IEEE Geoscience and Remote Sensing Letters · doi:10.1109/lgrs.2015.2513443 · Cited by 381
Development of a Chimeric Model to Study and Manipulate Human Microglia In Vivo
Hasselmann, J., Coburn, M. A., England, W., Figueroa Velez, D. X., Kiani Shabestari, S., Tu, C. H., McQuade, A., Kolahdouzan, M., Echeverria, K., Claes, C., et al. (2019) · Neuron · doi:10.1016/j.neuron.2019.07.002 · Cited by 380
“We began by performing DGE analysis, to assess how these transitions altered the transcriptional state of xMGs, and then utilized k-means clustering (Lloyd, 1982) to identify 8 clusters of genes with expression profiles that were unique to each of the states (Figure 6A, Table S6).”
MethodThe Application of Deep Learning in Cancer Prognosis Prediction
Zhu, W., Xie, L., Han, J., & Guo, X. (2020) · Cancers · doi:10.3390/cancers12030603 · Cited by 380
Towards Automatic Concept-based Explanations
Ghorbani, A., Wexler, J., Zou, J., & Kim, B. (2019) · arXiv · doi:10.48550/arxiv.1902.03129 · Cited by 378
“For the choice of cluster, we performed concept discovery using several clustering methods including K-means [18], Affinity Propagation [10], and DBSCAN [8].”
MethodJet substructure at the Tevatron and LHC: new results, new tools, new benchmarks
Altheimer, A., Arora, S., Asquith, L., Brooijmans, G., Butterworth, J. M., Campanelli, M., Chapleau, B., Cholakian, A. E., Chou, J. P., Dasgupta, M., et al. (2012) · Journal of Physics G Nuclear and Particle Physics · doi:10.1088/0954-3899/39/6/063001 · Cited by 378
Chiu, S. J., Allingham, M. J., Mettu, P. S., Cousins, S. W., Izatt, J. A., & Farsiu, S. (2015) · Biomedical Optics Express · doi:10.1364/boe.6.001172 · Cited by 377
RolX: structural role extraction & mining in large graphs
Henderson, K., Gallagher, B., Eliassi-Rad, T., Tong, H., Basu, S., Akoglu, L., Koutra, D., Faloutsos, C., & Li, L. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339723 · Cited by 376
Walk detection and step counting on unconstrained smartphones
Brajdic, A., & Harle, R. (2013) · Proceedings of the 2013 ACM international joint conference on Pervasive and ubiquitous computing · doi:10.1145/2493432.2493449 · Cited by 375
Zamir, R., & Feder, M. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.508838 · Cited by 375
Ckmeans.1d.dp: Optimal k-means Clustering in One Dimension by Dynamic Programming
Wang, H., & Song, M. (2011) · The R Journal · doi:10.32614/rj-2011-015 · Cited by 374
Data Clustering: 50 Years Beyond K-means
Jain, A. K. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-87479-9_3 · Cited by 373
The MADlib analytics library: or MAD skills, the SQL
Hellerstein, J. M., Ré, C., Schoppmann, F., Wang, D. Z., Fratkin, E., Gorajek, A., Ng, K. S., Welton, C., Feng, X., Li, K., et al. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2367502.2367510 · Cited by 373
Abnormal intrinsic brain functional network dynamics in Parkinson’s disease
Kim, J., Criaud, M., Cho, S. S., Díez-Cirarda, M., Mihaescu, A., Coakeley, S., Ghadery, C., Valli, M., Jacobs, M. F., Houle, S., et al. (2017) · Brain · doi:10.1093/brain/awx233 · Cited by 369
Carrete, J., Li, W., Mingo, N., Wang, S., & Stefano Curtarolo, A. (2014) · Physical Review X · doi:10.5281/zenodo.10562670 · Cited by 368
Non-convex Optimization for Machine Learning
Jain, P., & Kar, P. (2017) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000058 · Cited by 364
Aboriginal mitogenomes reveal 50,000 years of regionalism in Australia
Tobler, R., Rohrlach, A., Soubrier, J., Bover, P., Llamas, B., Tuke, J., Bean, N., Abdullah-Highfold, A., Agius, S., O’Donoghue, A., et al. (2017) · Nature · doi:10.1038/nature21416 · Cited by 363
Variational tetrahedral meshing
Alliez, P., Cohen‐Steiner, D., Yvinec, M., & Desbrun, M. (2005) · ACM Transactions on Graphics · doi:10.1145/1073204.1073238 · Cited by 361
Social Network Analysis and Mining for Business Applications
Bonchi, F., Castillo, C., Gionis, A., & Jaimes, A. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1961189.1961194 · Cited by 359
Spectral Methods for Data Science: A Statistical Perspective
Chen, Y., Chi, Y., Fan, J., & Ma, C. (2021) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000079 · Cited by 359
Some Notes on Alternating Optimization
Bezdek, J. C., & Hathaway, R. J. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45631-7_39 · Cited by 355
Image-based reconstruction of spatial appearance and geometric detail
Lensch, H. P. A., Kautz, J., Goesele, M., Heidrich, W., & Seidel, H. (2003) · ACM Transactions on Graphics · doi:10.1145/636886.636891 · Cited by 355
Trace Clustering in Process Mining
Song, M., Günther, C. W., & van der Aalst, W. M. P. (2009) · Lecture Notes in Business Information Processing · doi:10.1007/978-3-642-00328-8_11 · Cited by 354
Clustering Algorithms in Biomedical Research: A Review
Xu, R., & Wunsch, D. C. (2010) · IEEE Reviews in Biomedical Engineering · doi:10.1109/rbme.2010.2083647 · Cited by 349
Stabilization with data-rate-limited feedback: tightest attainable bounds
Nair, G. N., & Evans, R. J. (2000) · Systems & Control Letters · doi:10.1016/s0167-6911(00)00037-2 · Cited by 349
A Survey of Evolutionary Algorithms for Decision-Tree Induction
Barros, R. C., Basgalupp, M. P., de Carvalho, A. C. P. L. F., & Freitas, A. A. (2012) · IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2011.2157494 · Cited by 346
Effective Coverage Control for Mobile Sensor Networks With Guaranteed Collision Avoidance
Hussein, I. I., & Stipanović, D. M. (2007) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2007.899155 · Cited by 343
On centroidal voronoi tessellation—energy smoothness and fast computation
Liu, Y., Wang, W., Lévy, B., Sun, F., Yan, D.-M., Lu, L., & Yang, C. (2009) · ACM Transactions on Graphics · doi:10.1145/1559755.1559758 · Cited by 341
Application of machine learning in groundwater quality modeling - A comprehensive review
Haggerty, R., Sun, J., Yu, H., & Li, Y. (2023) · Water Research · doi:10.1016/j.watres.2023.119745 · Cited by 337
A Comprehensive Survey on Deep Clustering: Taxonomy, Challenges, and Future Directions
Zhou, S., Xu, H., Zheng, Z., Chen, J., Li, Z., Bu, J., Wu, J. X., Wang, X. Y., Zhu, W., & Ester, M. (2024) · ACM Computing Surveys · doi:10.1145/3689036 · Cited by 339
Predictive Analytics and Data Mining: Concepts and Practice with RapidMiner
Kotu, V., & Deshpande, B. (2014) · Cited by 336
Twitter spammer detection using data stream clustering
Miller, Z., Dickinson, B., Deitrick, W., Hu, W., & Wang, A. H. (2014) · Information Sciences · doi:10.1016/j.ins.2013.11.016 · Cited by 332
Optimal quantizer design for noisy channels: An approach to combined source - channel coding
Farvardin, N., & Vaishampayan, V. (1987) · IEEE Transactions on Information Theory · doi:10.1109/tit.1987.1057373 · Cited by 332
Alexa, M., Behr, J., Cohen-Or, D., Fleishman, S., Levin, D., & Silva, C. T. (2005) · Proceedings Visualization, 2001. VIS '01. · doi:10.1109/visual.2001.964489 · Cited by 332
RT-H: Action Hierarchies using Language
Belkhale, S., Ding, T., Xiao, T. G., Sermanet, P., Vuong, Q., Tompson, J., Chebotar, Y., Dwibedi, D., & Sadigh, D. (2024) · Robotics: Science and Systems · doi:10.15607/rss.2024.xx.049 · Cited by 333
Optimum quantizer performance for a class of non-Gaussian memoryless sources
Farvardin, N., & Modestino, J. W. (1984) · IEEE Transactions on Information Theory · doi:10.1109/tit.1984.1056920 · Cited by 332
Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning
Park, J., Lee, M., Chang, H. J., Lee, K., & Choi, J. Y. (2019) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.00662 · Cited by 331
Camacho, D., Panizo-LLedot, Á., Bello-Orgaz, G., Gonzalez-Pardo, A., & Cambria, E. (2020) · Information Fusion · doi:10.1016/j.inffus.2020.05.009 · Cited by 329
A computer vision approach for automated analysis and classification of microstructural image data
DeCost, B. L., & Holm, E. A. (2015) · Computational Materials Science · doi:10.1016/j.commatsci.2015.08.011 · Cited by 327
The k-means clustering technique: General considerations and implementation in Mathematica
Morissette, L., & Chartier, S. (2013) · Tutorials in Quantitative Methods for Psychology · doi:10.20982/tqmp.09.1.p015 · Cited by 327
Distributed Mean Estimation with Limited Communication
Suresh, A. T., Yu, F. X., Kumar, S., & McMahan, H. B. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1611.00429 · Cited by 135
Recent Advances in Remeshing of Surfaces
Alliez, P., Ucelli, G., Gotsman, C., & Attene, M. (2007) · Mathematics and visualization · doi:10.1007/978-3-540-33265-7_2 · Cited by 326
Quad‐Mesh Generation and Processing: A Survey
Bommes, D., Lévy, B., Pietroni, N., Puppo, E., Silva, C., Tarini, M., & Zorin, D. (2013) · Computer Graphics Forum · doi:10.1111/cgf.12014 · Cited by 323
Fischer, T. R. (1986) · IEEE Transactions on Information Theory · doi:10.1109/tit.1986.1057198 · Cited by 323
On the Improvement of Singing Voice Separation for Monaural Recordings Using the MIR-1K Dataset
Hsu, C.-L., & Jang, J. R. (2009) · IEEE Transactions on Audio Speech and Language Processing · doi:10.1109/tasl.2009.2026503 · Cited by 322
Optical types of inland and coastal waters
Spyrakos, E., O'Donnell, R., Hunter, P. D., Miller, C., Scott, M., Simis, S. G. H., Neil, C., Barbosa, C. C. F., Binding, C. E., Bradt, S., et al. (2018) · Limnology and Oceanography · doi:10.1002/lno.10674 · Cited by 321
Introduction to Digital Speech Processing
Rabiner, L. R., & Schafer, R. W. (2007) · Foundations and Trends® in Signal Processing · doi:10.1561/2000000001 · Cited by 319
Crown size and growing space requirement of common tree species in urban centres, parks, and forests
Pretzsch, H., Biber, P., Uhl, E., Dahlhausen, J., Rötzer, T., Caldentey, J., Koike, T., van Con, T., Chavanne, A., Seifert, T., et al. (2015) · Urban Forestry & Urban Greening · doi:10.1016/j.ufug.2015.04.006 · Cited by 319
Ensemble Methods: Foundations and Algorithms
Zhou, Z.-H. (2025) · Chapman & Hall/CRC eBooks · doi:10.1201/9781003587774 · Cited by 321
Image Super-Resolution With Sparse Neighbor Embedding
Gao, X., Zhang, K., Tao, D., & Li, X. (2012) · IEEE Transactions on Image Processing · doi:10.1109/tip.2012.2190080 · Cited by 313
Design and synthesis of the superionic conductor Na10SnP2S12
Richards, W. D., Tsujimura, T., Miara, L. J., Wang, Y., Kim, J. C., Ong, S. P., Uechi, I., Suzuki, N., & Ceder, G. (2016) · Nature Communications · doi:10.1038/ncomms11009 · Cited by 312
Owen, S., Anil, R., Dunning, T. E., & Friedman, E. (2011) · Cited by 312
The Planar k-Means Problem is NP-Hard
Mahajan, M., Nimbhorkar, P., & Varadarajan, K. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-00202-1_24 · Cited by 308
Convergence of the Lloyd Algorithm for Computing Centroidal Voronoi Tessellations
Du, Q., Emelianenko, M., & Ju, L. (2006) · SIAM Journal on Numerical Analysis · doi:10.1137/040617364 · Cited by 305
Metadata
- Authors
- Lloyd, S.
- Affiliations
- AT&T (United States) (US)
- Corresponding author
- Lloyd, S.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1982-03
- Volume
- 28
- Issue
- 2
- Pages
- 129-137
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2150593711
- Cited by
- 15,836
- References
- 9
- Citations by year
- 2026: 964 · 2025: 1161 · 2024: 1087 · 2023: 1243 · 2022: 1145 · 2021: 1244 · 2020: 1139 · 2019: 1089 · 2018: 887 · 2017: 731 · 2016: 662 · 2015: 573 · 2014: 524 · 2013: 488 · 2012: 507
- FWCI
- 29.12
- Type
- journal article
- Language
- en
- Open access
- green
- hal.science
- Licence
- Locations
- IEEE Transactions on Information Theory (publishedVersion)
- HAL (submittedVersion, other-oa)
- IEEE Trans.
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Data Compression Techniques
- Physical Sciences › Computer Science › Signal Processing › Digital Filter Design and Implementation
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Signal Processing Techniques
- Keywords
- pulse code modulation, optimal quantization, normal distribution, Laplacian distribution
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.