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 201–300 of 1,045
Detection of Non-Technical Losses Using Smart Meter Data and Supervised Learning
Buzau, M. M., Tejedor-Aguilera, J., Cruz-Romero, P., & Gomez-Exposito, A. (2019) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2018.2807925 · Cited by 305
Blum, A., Hopcroft, J., & Kannan, R. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108755528 · Cited by 304
Dynamic functional connectivity changes associated with dementia in Parkinson’s disease
Fiorenzato, E., Strafella, A. P., Kim, J., Schifano, R., Weis, L., Antonini, A., & Biundo, R. (2019) · Brain · doi:10.1093/brain/awz192 · Cited by 304
How slow is the k -means method?
Arthur, D., & Vassilvitskii, S. (2006) · Proceedings of the twenty-second annual symposium on Computational geometry · doi:10.1145/1137856.1137880 · Cited by 304
Measuring geographical regularities of crowd behaviors for Twitter-based geo-social event detection
Lee, R., & Sumiya, K. (2010) · Proceedings of the 2nd ACM SIGSPATIAL International Workshop on Location Based Social Networks · doi:10.1145/1867699.1867701 · Cited by 300
A systematic evaluation of single-cell RNA-sequencing imputation methods
Hou, W., Ji, Z., Ji, H., & Hicks, S. C. (2020) · Genome Biology · doi:10.1186/s13059-020-02132-x · Cited by 298
Norouzi, M., & Fleet, D. J. (2013) · 2013 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2013.388 · Cited by 298
Patch-Based Near-Optimal Image Denoising
Chatterjee, P., & Milanfar, P. (2012) · IEEE Transactions on Image Processing · doi:10.1109/tip.2011.2172799 · Cited by 296
Stowell, D., & Plumbley, M. D. (2014) · PeerJ · doi:10.7717/peerj.488 · Cited by 295
Cluster-based reduced-order modelling of a mixing layer
Kaiser, E., Noack, B. R., Cordier, L., Spohn, A., Segond, M., Abel, M., Daviller, G., Östh, J., Krajnović, S., & Niven, R. K. (2014) · Journal of Fluid Mechanics · doi:10.1017/jfm.2014.355 · Cited by 294
StreamKM++: A clustering algorithm for data streams
Ackermann, M. R., Märtens, M., Raupach, C., Swierkot, K., Lammersen, C., & Sohler, C. (2012) · ACM Journal of Experimental Algorithmics · doi:10.1145/2133803.2184450 · Cited by 294
Machine learning in geo- and environmental sciences: From small to large scale
Tahmasebi, P., Kamrava, S., Bai, T., & Sahimi, M. (2020) · Advances in Water Resources · doi:10.1016/j.advwatres.2020.103619 · Cited by 293
Build-to-last: strength to weight 3D printed objects
Lu, L., Sharf, A., Zhao, H., Wei, Y., Fan, Q., Chen, X., Savoye, Y., Tu, C., Cohen-Or, D., & Chen, B. (2014) · ACM Transactions on Graphics · doi:10.1145/2601097.2601168 · Cited by 290
WebFace260M: A Benchmark Unveiling the Power of Million-Scale Deep Face Recognition
Zhu, Z., Huang, G., Deng, J., Ye, Y., Huang, J., Chen, X., Zhu, J., Yang, T., Lu, J., Du, D., et al. (2021) · 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr46437.2021.01035 · Cited by 290
Machine learning for wireless communications in the Internet of Things: A comprehensive survey
Jagannath, J., Polosky, N., Jagannath, A., Restuccia, F., & Melodia, T. (2019) · Ad Hoc Networks · doi:10.1016/j.adhoc.2019.101913 · Cited by 288
Eitz, M., Richter, R., Boubekeur, T., Hildebrand, K., & Alexa, M. (2012) · ACM Transactions on Graphics · doi:10.1145/2185520.2185527 · Cited by 287
Blue noise through optimal transport
de Goes, F., Breeden, K., Ostromoukhov, V., & Desbrun, M. (2012) · ACM Transactions on Graphics · doi:10.1145/2366145.2366190 · Cited by 285
HydraLoRA: An Asymmetric LoRA Architecture for Efficient Fine-Tuning
Tian, C., Shi, Z., Guo, Z., Li, L., & Xu, C. (2024) · neural information processing systems · doi:10.52202/079017-0304 · Cited by 285
Unsupervised machine learning for exploratory data analysis in imaging mass spectrometry
Verbeeck, N., Caprioli, R. M., & Van de Plas, R. (2020) · Mass Spectrometry Reviews · doi:10.1002/mas.21602 · Cited by 281
A self-organizing network for hyperellipsoidal clustering (HEC)
Mao, J., & Jain, A. K. (1996) · IEEE Transactions on Neural Networks · doi:10.1109/72.478389 · Cited by 281
Clustering-Based Denoising With Locally Learned Dictionaries
Chatterjee, P., & Milanfar, P. (2009) · IEEE Transactions on Image Processing · doi:10.1109/tip.2009.2018575 · Cited by 280
Sensing and coverage for a network of heterogeneous robots
Pimenta, L. C. A., Kumar, V., Mesquita, R. C., & Pereira, G. A. S. (2008) · 2008 47th IEEE Conference on Decision and Control · doi:10.1109/cdc.2008.4739194 · Cited by 279
Hennig, C., & Liao, T. F. (2013) · Journal of the Royal Statistical Society Series C: Applied Statistics · doi:10.1111/j.1467-9876.2012.01066.x · Cited by 278
The planark-means problem is NP-hard
Mahajan, M., Nimbhorkar, P., & Varadarajan, K. (2012) · Theoretical Computer Science · doi:10.1016/j.tcs.2010.05.034 · Cited by 277
Dimensionality Reduction for k-Means Clustering and Low Rank Approximation
Cohen, M. B., Elder, S., Musco, C., Musco, C., & Persu, M. (2015) · Proceedings of the forty-seventh annual ACM symposium on Theory of Computing · doi:10.1145/2746539.2746569 · Cited by 276
KmL: k-means for longitudinal data
Genolini, C., & Falissard, B. (2010) · Computational Statistics · doi:10.1007/s00180-009-0178-4 · Cited by 275
Trajectory Clustering and an Application to Airspace Monitoring
Gariel, M., Srivastava, A. N., & Feron, E. (2011) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2011.2160628 · Cited by 275
On the Design of MIMO Block-Fading Channels With Feedback-Link Capacity Constraint
Lau, V., Liu, Y., & Chen, T.-A. (2004) · IEEE Transactions on Communications · doi:10.1109/tcomm.2003.822171 · Cited by 275
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
Computer-aided diagnosis of breast cancer based on fine needle biopsy microscopic images
Kowal, M., Filipczuk, P., Obuchowicz, A., Korbicz, J., & Monczak, R. (2013) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2013.08.003 · Cited by 274
Distributed particle filters for sensor networks
Coates, M. (2004) · Proceedings of the 3rd international symposium on Information processing in sensor networks · doi:10.1145/984622.984637 · Cited by 274
Connectivity‐based parcellation: Critique and implications
Eickhoff, S. B., Thirion, B., Varoquaux, G., & Bzdok, D. (2015) · Human Brain Mapping · doi:10.1002/hbm.22933 · Cited by 273
A QRD-M/Kalman filter-based detection and channel estimation algorithm for MIMO-OFDM systems
Kim, K. J., Yue, J., Iltis, R. A., & Gibson, J. D. (2005) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2004.842951 · Cited by 273
Deep TEN: Texture Encoding Network
Zhang, H., Xue, J., & Dana, K. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.309 · Cited by 273
BotGrep: finding P2P bots with structured graph analysis
Nagaraja, S., Mittal, P., Hong, C.-Y., Caesar, M., & Borisov, N. (2010) · University of Birmingham Research Portal (University of Birmingham) · Cited by 273
The MinMax k-Means clustering algorithm
Tzortzis, G., & Likas, A. (2014) · Pattern Recognition · doi:10.1016/j.patcog.2014.01.015 · Cited by 272
Theory and Use of the EM Algorithm
Gupta, M. R. (2010) · Foundations and Trends® in Signal Processing · doi:10.1561/2000000034 · Cited by 272
Convolutions Die Hard: Open-Vocabulary Segmentation with Single Frozen Convolutional CLIP
Yu, Q., He, J., Deng, X., Shen, X., & Chen, L.-C. (2023) · neural information processing systems · doi:10.52202/075280-1399 · Cited by 280
Refining activation downsampling with SoftPool
Stergiou, A., Poppe, R., & Kalliatakis, G. (2021) · 2021 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv48922.2021.01019 · Cited by 271
State of the "Art”: A Taxonomy of Artistic Stylization Techniques for Images and Video
Kyprianidis, J. E., Collomosse, J., Wang, T., & Isenberg, T. (2013) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2012.160 · Cited by 270
Linear and Nonlinear Projective Nonnegative Matrix Factorization
Yang, Z., & Oja, E. (2010) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2010.2041361 · Cited by 270
A modeling framework for the dynamic management of free-floating bike-sharing systems
Caggiani, L., Camporeale, R., Ottomanelli, M., & Szeto, W. Y. (2018) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2018.01.001 · Cited by 269
Hornik, K. (2005) · Journal of Statistical Software · doi:10.18637/jss.v014.i12 · Cited by 268
Hybrid Architectures With Few-Bit ADC Receivers: Achievable Rates and Energy-Rate Tradeoffs
Mo, J., Alkhateeb, A., Abu‐Surra, S., & Heath, R. W. (2017) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2017.2661749 · Cited by 266
Combustion machine learning: Principles, progress and prospects
Ihme, M., Chung, W. T., & Mishra, A. A. (2022) · Progress in Energy and Combustion Science · doi:10.1016/j.pecs.2022.101010 · Cited by 265
Computational pathology: Challenges and promises for tissue analysis
Fuchs, T. J., & Buhmann, J. M. (2011) · Computerized Medical Imaging and Graphics · doi:10.1016/j.compmedimag.2011.02.006 · Cited by 265
Hausner, A. (2001) · ACM SIGGRAPH Conference (SIGGRAPH) · doi:10.1145/383259.383327 · Cited by 265
Sander, P. V., Wood, Z. J., Gortler, S. J., Snyder, J., & Hoppe, H. (2003) · DigitalCommons - CalPoly (California State Polytechnic University) · doi:10.2312/sgp/sgp03/146-155 · Cited by 265
Carrete, J., Li, W., Mingo, N., Wang, S., & Curtarolo, S. (2014) · Physical Review X · doi:10.1103/physrevx.4.011019 · Cited by 264
Mapping ecosystem services: The supply and demand of flood regulation services in Europe
Stürck, J., Poortinga, A., & Verburg, P. H. (2014) · Ecological Indicators · doi:10.1016/j.ecolind.2013.11.010 · Cited by 263
Vector quantization by deterministic annealing
Rose, K., Gurewitz, E., & Fox, G. C. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.144705 · Cited by 262
A quantization algorithm for solving multidimensional discrete-time optimal stopping problems
Bally, V., & Pagès, G. (2003) · Bernoulli · doi:10.3150/bj/1072215199 · Cited by 264
The Effectiveness of Lloyd-Type Methods for the k-Means Problem
Ostrovsky, R., Rabani, Y., Schulman, L., & Swamy, C. (2006) · 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) · doi:10.1109/focs.2006.75 · Cited by 261
Xiong, L., Shamseldin, A. Y., & O'Connor, K. M. (2001) · Journal of Hydrology · doi:10.1016/s0022-1694(01)00349-3 · Cited by 259
Quantized Massive MU-MIMO-OFDM Uplink
Studer, C., & Durisi, G. (2016) · IEEE Transactions on Communications · doi:10.1109/tcomm.2016.2558151 · Cited by 259
EEG Signatures of Dynamic Functional Network Connectivity States
Allen, E. A., Damaraju, E., Eichele, T., Wu, L., & Calhoun, V. D. (2018) · Brain Topography · doi:10.1007/s10548-017-0546-2 · Cited by 259
Teichgraeber, H., & Brandt, A. R. (2019) · Applied Energy · doi:10.1016/j.apenergy.2019.02.012 · Cited by 257
Exploring Wav2vec 2.0 Fine Tuning for Improved Speech Emotion Recognition
Chen, L.-W., & Rudnicky, A. I. (2023) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp49357.2023.10095036 · Cited by 269
Stable Bias: Analyzing Societal Representations in Diffusion Models
Luccioni, A. S., Akiki, C., Mitchell, M., & Jernite, Y. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2303.11408 · Cited by 52
3D Mesh Compression: Survey, Comparisons, and Emerging Trends
Maglo, A., Lavoué, G., Florent Dupont, A., & Hudelot, C. (2015) · ACM Computing Surveys · doi:10.1145/2693443 · Cited by 255
Estimation of Subspace Arrangements with Applications in Modeling and Segmenting Mixed Data
Ma, Y., Yang, A. Y., Derksen, H., & Fossum, R. (2008) · SIAM Review · doi:10.1137/060655523 · Cited by 251
Adaptive binning of X-ray data with weighted Voronoi tessellations
Diehl, S., & Statler, T. S. (2006) · Monthly Notices of the Royal Astronomical Society · doi:10.1111/j.1365-2966.2006.10125.x · Cited by 251
Beyond Subjective and Objective in Statistics
Gelman, A., & Hennig, C. (2017) · Journal of the Royal Statistical Society Series A: Statistics in Society · doi:10.1111/rssa.12276 · Cited by 250
Generic Remeshing of 3D Triangular Meshes with Metric-Dependent Discrete Voronoi Diagrams
Valette, S., Chassery, J., & Prost, R. (2008) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2007.70430 · Cited by 250
Variational shape approximation
Cohen‐Steiner, D., Alliez, P., & Desbrun, M. (2004) · ACM SIGGRAPH Conference (SIGGRAPH) · doi:10.1145/1186562.1015817 · Cited by 250
Overview: Computer Vision and Machine Learning for Microstructural Characterization and Analysis
Holm, E. A., Cohn, R., Gao, N., Kitahara, A. R., Matson, T. P., Lei, B., & Yarasi, S. R. (2020) · Metallurgical and Materials Transactions A · doi:10.1007/s11661-020-06008-4 · Cited by 249
Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets
Parker, L. E. (2002) · Autonomous Robots · doi:10.1023/a:1015256330750 · Cited by 249
L p Centroidal Voronoi Tessellation and its applications
Bruno Lévy, B., & Liu, Y. (2010) · ACM Transactions on Graphics · doi:10.1145/1778765.1778856 · Cited by 249
Using Large Language Models to Generate JUnit Tests: An Empirical Study
Siddiq, M. L., Santos, J. C. S., Tanvir, R. H., Ulfat, N., Rifat, F. A., & Lopes, V. C. (2024) · International Conference on Evaluation and Assessment in Software Engineering (EASE) · doi:10.1145/3661167.3661216 · Cited by 252
Optimal partitioning for classification and regression trees
Chou, P. A. (1991) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.88569 · Cited by 248
Clonality inference in multiple tumor samples using phylogeny
Malikic, S., McPherson, A. W., Donmez, N., & Sahinalp, C. S. (2015) · Bioinformatics · doi:10.1093/bioinformatics/btv003 · Cited by 248
Jin, X., & Han, J. (2011) · Encyclopedia of Machine Learning · doi:10.1007/978-0-387-30164-8_425 · Cited by 247
Cluster Alignment With a Teacher for Unsupervised Domain Adaptation
Deng, Z., Luo, Y., & Zhu, J. (2019) · 2019 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.01004 · Cited by 247
Loss aware post-training quantization
Nahshan, Y., Chmiel, B., Baskin, C., Zheltonozhskii, E., Banner, R., Bronstein, A. M., & Mendelson, A. (2021) · Machine Learning · doi:10.1007/s10994-021-06053-z · Cited by 142
Udell, M., Horn, C., Zadeh, R., & Boyd, S. (2016) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000055 · Cited by 245
K-Means and Alternative Clustering Methods in Modern Power Systems
Miraftabzadeh, S. M., Colombo, C. G., Longo, M., & Foiadelli, F. (2023) · IEEE Access · doi:10.1109/access.2023.3327640 · Cited by 245
Wolff, B., Kühnert, J., Lorenz, E., Kramer, O., & Heinemann, D. (2016) · Solar Energy · doi:10.1016/j.solener.2016.05.051 · Cited by 245
Constrained Centroidal Voronoi Tessellations for Surfaces
Du, Q., Gunzburger, M. D., & Ju, L. (2003) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827501391576 · Cited by 245
Accelerating Large-Scale Inference with Anisotropic Vector Quantization
Guo, R., Sun, P., Lindgren, E., Geng, Q., Simcha, D., Chern, F., & Kumar, S. (2019) · arXiv (Cornell University) · doi:10.4230/lipics.esa.2022.54 · Cited by 108
Near‐Capacity Multi‐Functional MIMO Systems: Sphere‐Packing, Iterative Detection and Cooperation
Hanzo, L., Alamri, O., El‐Hajjar, M., & Wu, N. (2009) · Wiley eBooks · doi:10.1002/9780470744710 · Cited by 244
Isotropic Remeshing with Fast and Exact Computation of Restricted Voronoi Diagram
Dong-ming Yan, A., Bruno Lévy, B., Liu, Y., Sun, F. R., & Wang, W. (2009) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2009.01521.x · Cited by 244
How Does BERT Answer Questions? A Layer-Wise Analysis of Transformer Representations
van Aken, B., Winter, B., Löser, A., & Gers, F. A. (2019) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3357384.3358028 · Cited by 244
Brinch, C., & Hogerheijde, M. R. (2010) · Astronomy & Astrophysics · doi:10.1051/0004-6361/201015333 · Cited by 242
Data-driven science and engineering : machine learning, dynamical systems, and control
Brunton, S. L., & Kutz, J. N. (2019) · doi:10.1017/978-1-009-08951-7 · Cited by 242
Feature Coding in Image Classification: A Comprehensive Study
Huang, Y., Wu, Z., Wang, L., & Tan, T. (2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.113 · Cited by 242
Vector quantization of images based upon the Kohonen self-organizing feature maps
Nasrabadi, & Feng (1988) · IEEE International Conference on Neural Networks · doi:10.1109/icnn.1988.23837 · Cited by 238
Spectral–Spatial Sparse Subspace Clustering for Hyperspectral Remote Sensing Images
Zhang, H., Zhai, H., Zhang, L., & Li, P. (2016) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2016.2524557 · Cited by 236
Vassiliades, V., Chatzilygeroudis, K., & Mouret, J.-B. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2735550 · Cited by 151
Adaptive Graph Encoder for Attributed Graph Embedding
Cui, G., Zhou, J., Yang, C., & Liu, Z. (2020) · Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3394486.3403140 · Cited by 235
DeCost, B. L., Francis, T., & Holm, E. A. (2017) · Acta Materialia · doi:10.1016/j.actamat.2017.05.014 · Cited by 235
Meta-Analytic Methodology for Basic Research: A Practical Guide
Mikolajewicz, N., & Komarova, S. V. (2019) · Frontiers in Physiology · doi:10.3389/fphys.2019.00203 · Cited by 234
Nelson, L. K., Burk, D., Knudsen, M., & McCall, L. (2021) · Sociological Methods & Research · doi:10.1177/0049124118769114 · Cited by 234
A review of population initialization techniques for evolutionary algorithms
Kazimipour, B., Li, X., & Qin, A. K. (2014) · 2014 IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2014.6900618 · Cited by 232
Achievable Rates of FDD Massive MIMO Systems With Spatial Channel Correlation
Jiang, Z., Molisch, A. F., Caire, G., & Niu, Z. (2015) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2015.2396058 · Cited by 232
D‐Charts: Quasi‐Developable Mesh Segmentation
Julius, D., Kraevoy, V., & Sheffer, A. (2005) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2005.00883.x · Cited by 232
Clustering Methods: A History of k-Means Algorithms
Bock, H.-H. (2007) · Studies in Classification, Data Analysis, and Knowledge Organization · doi:10.1007/978-3-540-73560-1_15 · Cited by 231
Ballé, J., Chou, P. A., Minnen, D., Singh, S., Johnston, N., Agustsson, E., Hwang, S. J., & Toderici, G. (2021) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2020.3034501 · Cited by 231
“Both ECVQ and the online K-means algorithms derive in turn from the generalized Lloyd algorithm [17]–[20].”
MethodMachine Learning Approaches for Thermoelectric Materials Research
Wang, T., Zhang, C., Snoussi, H., & Zhang, G. (2020) · Advanced Functional Materials · doi:10.1002/adfm.201906041 · Cited by 231
The (black) art of runtime evaluation: Are we comparing algorithms or implementations?
Kriegel, H.-P., Schubert, E., & Zimek, A. (2017) · Knowledge and Information Systems · doi:10.1007/s10115-016-1004-2 · Cited by 229
k-means Requires Exponentially Many Iterations Even in the Plane
Vattani, A. (2011) · Discrete & Computational Geometry · doi:10.1007/s00454-011-9340-1 · Cited by 229
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.