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 301–400 of 1,045
Unsupervised Learning by Predicting Noise
Bojanowski, P., & Joulin, A. (2017) · arXiv · doi:10.48550/arxiv.1704.05310 · Cited by 228
Microstate EEGlab toolbox: An introductory guide
Poulsen, A. T., Pedroni, A., Langer, N., & Hansen, L. K. (2018) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/289850 · Cited by 228
Childhood trauma history is linked to abnormal brain connectivity in major depression
Yu, M., Linn, K. A., Shinohara, R. T., Oathes, D. J., Cook, P. A., Duprat, R., Moore, T. M., Oquendo, M. A., Phillips, M. L., McInnis, M., et al. (2019) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1900801116 · Cited by 228
Heterogeneity for the Win: One-Shot Federated ClusteringPreprint
Dennis, D. K., Li, T., & Smith, V. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.00697 · Cited by 228
Making Better Use of the Crowd: How Crowdsourcing Can Advance Machine Learning Research
Vaughan, J. W. (2018) · Journal of Machine Learning Research · Cited by 227
Fuzzy Clustering: A Historical Perspective
Ruspini, E. H., Bezdek, J. C., & Keller, J. M. (2019) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2018.2881643 · Cited by 226
A Statistical Interpretation of Spectral Embedding: The Generalised Random Dot Product Graph
Rubin‐Delanchy, P., Cape, J., Tang, M., & Priebe, C. E. (2022) · Journal of the Royal Statistical Society Series B (Statistical Methodology) · doi:10.1111/rssb.12509 · Cited by 227
Hierarchical Neural Networks for Image Interpretation
Behnke, S. (2003) · Lecture Notes in Computer Science · doi:10.1007/b11963 · Cited by 225
Analog forecasting of extreme-causing weather patterns using deep learning
Chattopadhyay, A., Nabizadeh, E., & Hassanzadeh, P. (2020) · Journal of Advances in Modeling Earth Systems · doi:10.1029/2019ms001958 · Cited by 224
“ion predicted to experience an extreme event in several days (or longer). In this study we conducted 5-class predictions based on extreme events over North America clustered (using K-means algorithm (Lloyd, 1982)) into 4 geographical regions. However, other clustering algorithms, number of clusters etc. could be used…”
Theoretical aspects of the SOM algorithm
Cottrell, M., Fort, J. C., & Pagès, G. (1998) · Neurocomputing · doi:10.1016/s0925-2312(98)00034-4 · Cited by 224
Self-organizing hierarchical feature maps
Koikkalainen, P., & Oja, E. (1990) · 1990 IJCNN International Joint Conference on Neural Networks · doi:10.1109/ijcnn.1990.137727 · Cited by 224
Secure Cooperative Sensing Techniques for Cognitive Radio Systems
Kaligineedi, P., Khabbazian, M., & Bhargava, V. K. (2008) · 2008 IEEE International Conference on Communications · doi:10.1109/icc.2008.640 · Cited by 224
A Review on Time Series Aggregation Methods for Energy System Models
Hoffmann, M., Kotzur, L., Stolten, D., & Robinius, M. (2020) · Energies · doi:10.3390/en13030641 · Cited by 223
Walvoort, D. J. J., Brus, D. J., & de Gruijter, J. J. (2010) · Computers & Geosciences · doi:10.1016/j.cageo.2010.04.005 · Cited by 223
A Food Recognition System for Diabetic Patients Based on an Optimized Bag-of-Features Model
Anthimopoulos, M. M., Gianola, L., Scarnato, L., Diem, P., & Mougiakakou, S. G. (2014) · IEEE Journal of Biomedical and Health Informatics · doi:10.1109/jbhi.2014.2308928 · Cited by 222
Markov clustering versus affinity propagation for the partitioning of protein interaction graphs
Vlasblom, J., & Wodak, S. J. (2009) · BMC Bioinformatics · doi:10.1186/1471-2105-10-99 · Cited by 222
Deeptime: a Python library for machine learning dynamical models from time series data
Hoffmann, M., Scherer, M., Hempel, T., Mardt, A., de Silva, B., Husic, B. E., Klus, S., Wu, H., Kutz, N., Brunton, S. L., et al. (2022) · Machine Learning: Science and Technology · doi:10.1088/2632-2153/ac3de0 · Cited by 147
Patané, G., & Russo, M. (2001) · Neural Networks · doi:10.1016/s0893-6080(01)00104-6 · Cited by 221
Minimizing charging delay in wireless rechargeable sensor networks
Fu, L., Cheng, P., Gu, Y. J., Chen, J., & He, T. (2013) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2013.6567103 · Cited by 220
A Comparative study Between Fuzzy Clustering Algorithm and Hard Clustering Algorithm
Bora, D. J., & Gupta, A. K. (2014) · International Journal of Computer Trends and Technology · doi:10.14445/22312803/ijctt-v10p119 · Cited by 220
Peeters, A., Zude-Sasse, M., Käthner, J., Ünlü, M., Kanber, R., Hetzroni, A., Gebbers, R., & Ben‐Gal, A. (2015) · Computers and Electronics in Agriculture · doi:10.1016/j.compag.2014.12.011 · Cited by 220
Evolutionary Machine Learning: A Survey
Telikani, A., Tahmassebi, A., Banzhaf, W., & Gandomi, A. H. (2022) · ACM Computing Surveys · doi:10.1145/3467477 · Cited by 219
Three-dimensional atomic structure and local chemical order of medium- and high-entropy nanoalloys
Moniri, S., Yang, Y., Ding, J., Yuan, Y., Zhou, J., Yang, L., Zhu, F., Liao, Y., Yao, Y., Hu, L., et al. (2023) · Nature · doi:10.1038/s41586-023-06785-z · Cited by 218
An efficient approximation to the K-means clustering for massive data
Capó, M., Pérez, A., & Lozano, J. A. (2017) · Knowledge-Based Systems · doi:10.1016/j.knosys.2016.06.031 · Cited by 218
TrajStore: An adaptive storage system for very large trajectory data sets
Cudre-Mauroux, P., Wu, E., & Madden, S. (2010) · 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010) · doi:10.1109/icde.2010.5447829 · Cited by 218
Multirobot Control Using Time-Varying Density Functions
Lee, S. G., Diaz-Mercado, Y. J., & Egerstedt, M. (2015) · IEEE Transactions on Robotics · doi:10.1109/tro.2015.2397771 · Cited by 218
Distributed Coverage Control and Data Collection With Mobile Sensor Networks
Zhong, M., & Cassandras, C. G. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2163860 · Cited by 218
Rateb, A., Scanlon, B., Pool, D., Sun, A. Y., Zhang, Z., Chen, J.-L., Clark, B., Faunt, C., Haugh, C., Hill, M., et al. (2020) · Water Resources Research · doi:10.1029/2020wr027556 · Cited by 156
Persistence-Based Clustering in Riemannian Manifolds
Chazal, F., Guibas, L. J., Oudot, S. Y., & Skraba, P. (2013) · Journal of the ACM · doi:10.1145/2535927 · Cited by 217
Blasco, J., Aleixos, N., & Moltó, E. (2007) · Journal of Food Engineering · doi:10.1016/j.jfoodeng.2006.12.007 · Cited by 217
Álvarez-Garretón, C., Boisier, J. P., Garreaud, R., Seibert, J., & Vis, M. J. P. (2021) · Hydrology and earth system sciences · doi:10.5194/hess-25-429-2021 · Cited by 221
What to Do When K-Means Clustering Fails: A Simple yet Principled Alternative Algorithm
Raykov, Y. P., Boukouvalas, A., Baig, F., & Little, M. A. (2016) · PLOS ONE · doi:10.1371/journal.pone.0162259 · Cited by 216
Optimal Charging in Wireless Rechargeable Sensor Networks
Fu, L., Cheng, P., Gu, Y. J., Chen, J., & He, T. (2015) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2015.2391119 · Cited by 216
Quantum Computing for High-Energy Physics: State of the Art and Challenges
Di Meglio, A., Jansen, K., Tavernelli, I., Alexandrou, C., Arunachalam, S., Bauer, C. W., Borras, K., Carrazza, S., Crippa, A., Croft, V., et al. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.037001 · Cited by 215
Voronoi coverage of non-convex environments with a group of networked robots
Breitenmoser, A., Schwager, M., Metzger, J.-C., Siegwart, R., & Rus, D. (2010) · 2010 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2010.5509696 · Cited by 215
Anomaly Detection in Bitcoin Network Using Unsupervised Learning MethodsPreprint
Pham, T., & Lee, S. S. W. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1611.03941 · Cited by 215
QMugs, quantum mechanical properties of drug-like molecules
Isert, C., Atz, K., Jiménez-Luna, J., & Schneider, G. (2022) · Scientific Data · doi:10.1038/s41597-022-01390-7 · Cited by 144
Quantum speed-up for unsupervised learning
Aïmeur, E., Brassard, G., & Gambs, S. (2013) · Machine Learning · doi:10.1007/s10994-012-5316-5 · Cited by 214
“6.1 Standard version The k-medians algorithm, also called k-medoids (Kaufman and Rousseeuw 1987), is a cousin of the k-means algorithm (Lloyd 1982).”
MethodInfluentialSegmentation by Fusion of Histogram-Based $K$-Means Clusters in Different Color Spaces
Mignotte, M. (2008) · IEEE Transactions on Image Processing · doi:10.1109/tip.2008.920761 · Cited by 214
Adaptive surrogate models for reliability analysis and reliability-based design optimization
Dubourg, V. (2011) · theses.fr (ABES) · doi:10.70675/26701124z4947z4b2az8f9ezc77f12e86dd1 · Cited by 214
Using simulated annealing to design good codes
Gamal, A. E., Hemachandra, L., Shperling, I., & Wei, V. (1987) · IEEE Transactions on Information Theory · doi:10.1109/tit.1987.1057277 · Cited by 213
Quantization and the method ofk-means
Pollard, D. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056481 · Cited by 213
An Improved Genetic Algorithm with Initial Population Strategy for Symmetric TSP
Deng, Y., Liu, Y., & Zhou, D. (2015) · Mathematical Problems in Engineering · doi:10.1155/2015/212794 · Cited by 213
Whole-genome analysis of Alu repeat elements reveals complex evolutionary history
Price, A. L., Eskin, E., & Pevzner, P. A. (2004) · Genome Research · doi:10.1101/gr.2693004 · Cited by 213
Fast clustering using MapReduce
Ene, A., Im, S., & Moseley, B. (2011) · Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2020408.2020515 · Cited by 212
Theory and Use of the EM Algorithm
Gupta, M. R. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984319 · Cited by 212
DARP: Divide Areas Algorithm for Optimal Multi-Robot Coverage Path Planning
Kapoutsis, A. C., Chatzichristofis, S. A., & Kosmatopoulos, E. B. (2017) · Journal of Intelligent & Robotic Systems · doi:10.1007/s10846-016-0461-x · Cited by 212
A Numerical Algorithm forL2Semi-Discrete Optimal Transport in 3D
Bruno Lévy, B. (2015) · ESAIM Mathematical Modelling and Numerical Analysis · doi:10.1051/m2an/2015055 · Cited by 212
Capacity-constrained point distributions: a variant of Lloyd's method
Balzer, M., Schlömer, T., & Deußen, O. (2009) · ACM Transactions on Graphics · doi:10.1145/1531326.1531392 · Cited by 212
Brinch, C., & Hogerheijde, M. R. (2010) · Springer Link (Chiba Institute of Technology) · doi:10.1051/0004-6361/201015333/pdf · Cited by 211
Audio Signal Processing and Coding
Spanias, A., Painter, T., & Atti, V. (2007) · Wiley eBooks · doi:10.1002/0470041978 · Cited by 211
Pyramid of Spatial Relatons for Scene-Level Land Use Classification
Chen, S., & Tian, Y. (2015) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2014.2351395 · Cited by 211
Quantum machine learning for chemistry and physics
Sajjan, M., Li, J., Selvarajan, R., Sureshbabu, S. H., Kale, S. S., Gupta, R., Singh, V., & Kais, S. (2022) · Chemical Society Reviews · doi:10.1039/d2cs00203e · Cited by 214
Calculation of absolute molecular entropies and heat capacities made simple
Pracht, P., & Grimme, S. (2021) · Chemical Science · doi:10.1039/d1sc00621e · Cited by 210
Polygonal finite elements for topology optimization: A unifying paradigm
Talischi, C., Paulino, G. H., Pereira, A., & Menezes, I. F. M. (2009) · International Journal for Numerical Methods in Engineering · doi:10.1002/nme.2763 · Cited by 210
UNIQ: Uniform Noise Injection for Non-Uniform Quantization of Neural Networks
Baskin, C., Liss, N., Schwartz, E., Zheltonozhskii, E., Giryes, R., Bronstein, A. M., & Mendelson, A. (2019) · ACM Transactions on Computer Systems · doi:10.1145/3444943 · Cited by 107
Clustering with the Average Silhouette Width
Batool, F., & Hennig, C. (2021) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2021.107190 · Cited by 209
A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM
MEMARSADEGHI, N., MOUNT, D. M., NETANYAHU, N. S., & LE MOIGNE, J. (2007) · International Journal of Computational Geometry & Applications · doi:10.1142/s0218195907002252 · Cited by 209
Varol, E., Sotiras, A., & Davatzikos, C. (2017) · NeuroImage · doi:10.1016/j.neuroimage.2016.02.041 · Cited by 208
“To validate the clustering potential of our framework, we included the performance of the K-means clustering (Lloyd, 1982) (20 replicates were used).”
MethodRandomized Dimensionality Reduction for $k$ -Means Clustering
Boutsidis, C., Zouzias, A., Mahoney, M. W., & Drineas, P. (2015) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2375327 · Cited by 207
Madsen, J., Liu, P., Kling, J., Wagner, J. B., Hansen, T. W., Winther, O., & Schiøtz, J. (2018) · Advanced Theory and Simulations · doi:10.1002/adts.201800037 · Cited by 207
Mwangi, B., Ebmeier, K. P., Matthews, K., & Douglas Steele, J. (2012) · Brain · doi:10.1093/brain/aws084 · Cited by 207
A Comparison of Methods for Generating Poisson Disk Distributions
Lagae, A., & Dutré, P. (2008) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2007.01100.x · Cited by 206
A critical comparison of Lagrangian methods for coherent structure detection
Hadjighasem, A., Farazmand, M., Blazevski, D., Froyland, G., & Haller, G. (2017) · Chaos: An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.4982720 · Cited by 206
Weakly supervised object detection with convex clustering
Bilen, H., Pedersoli, M., & Tuytelaars, T. (2015) · 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2015.7298711 · Cited by 206
Optimal adaptive k-means algorithm with dynamic adjustment of learning rate
Chinrungrueng, C., & Sequin, C. H. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.363440 · Cited by 206
QoE-Driven Cache Management for HTTP Adaptive Bit Rate Streaming Over Wireless Networks
Zhang, W., Wen, Y., Chen, Z., & Khisti, A. (2013) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2013.2247583 · Cited by 206
Yu, Q., Wang, H., Qiao, S., Collins, M. D., Zhu, Y., Adam, H., Yuille, A., & Chen, L.-C. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-19818-2_17 · Cited by 209
A systematic review of the research trends of machine learning in supply chain management
Ni, D., Xiao, Z., & Lim, M. K. (2020) · International Journal of Machine Learning and Cybernetics · doi:10.1007/s13042-019-01050-0 · Cited by 205
Haplotype estimation for biobank-scale data sets
O'Connell, J., Sharp, K., Shrine, N., Wain, L., Hall, I., Tobin, M., Zagury, J.-F., Delaneau, O., & Marchini, J. (2016) · Nature Genetics · doi:10.1038/ng.3583 · Cited by 205
Grid generation and optimization based on centroidal Voronoi tessellations
Du, Q., & Gunzburger, M. (2002) · Applied Mathematics and Computation · doi:10.1016/s0096-3003(01)00260-0 · Cited by 205
Generative Adversarial TransformersPreprint
Hudson, D. A., & Zitnick, C. L. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.01209 · Cited by 205
Optimizing Multistage Discriminative Dictionaries for Blind Image Quality Assessment
Jiang, Q., Shao, F., Lin, W., Gu, K., Jiang, G., & Sun, H. (2018) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2017.2763321 · Cited by 204
A Survey of Partitional and Hierarchical Clustering Algorithms
Reddy, C. K. A., & Vinzamuri, B. (2018) · Chapman & Hall/CRC eBooks · doi:10.1201/9781315373515-4 · Cited by 206
Differentially Private K-Means Clustering
Su, D., Cao, J., Li, N., Bertino, E., & Jin, H. (2016) · Proceedings of the Sixth ACM Conference on Data and Application Security and Privacy · doi:10.1145/2857705.2857708 · Cited by 131
Hierarchical Poisson disk sampling distributions
McCool, M. D., & Fiume, E. L. (1992) · Proceedings · doi:10.20380/gi1992.12 · Cited by 203
DeepSight: Mitigating Backdoor Attacks in Federated Learning Through Deep Model Inspection
Rieger, P., Nguyen, T. D., Miettinen, M., & Sadeghi, A.-R. (2022) · Proceedings 2022 Network and Distributed System Security Symposium · doi:10.14722/ndss.2022.23156 · Cited by 202
Berger, T., & Gibson, J. D. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720552 · Cited by 202
Unsupervised feature learning for urban sound classification
Salamon, J., & Bello, J. P. (2015) · 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) · doi:10.1109/icassp.2015.7177954 · Cited by 201
An automatic method to determine the number of clusters using decision-theoretic rough set
Yu, H., Liu, Z., & Wang, G. (2014) · International Journal of Approximate Reasoning · doi:10.1016/j.ijar.2013.03.018 · Cited by 201
C2FNAS: Coarse-to-Fine Neural Architecture Search for 3D Medical Image Segmentation
Yu, Q., Yang, D., Roth, H., Bai, Y., Zhang, Y., Yuille, A. L., & Xu, D. (2020) · 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr42600.2020.00418 · Cited by 154
Revisiting Training Strategies and Generalization Performance in Deep Metric LearningPreprint
Roth, K., Milbich, T., Sinha, S., Gupta, P., Ommer, B., & Cohen, J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.08473 · Cited by 201
Semi‐supervised clustering methods
Bair, E. (2013) · WIREs Computational Statistics · doi:10.1002/wics.1270 · Cited by 200
Linkage Based Face Clustering via Graph Convolution Network
Wang, Z., Zheng, L., Li, Y., & Wang, S. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00121 · Cited by 200
On Density-Based Data Streams Clustering Algorithms: A Survey
Amini, A., Wah, T. Y., & Saboohi, H. (2014) · Journal of Computer Science and Technology · doi:10.1007/s11390-014-1416-y · Cited by 200
Network Traffic Classification Using K-means Clustering
Liu, Y., Li, W., & Li, Y. (2007) · International Multi-Symposiums on Computer and Computational Sciences · doi:10.1109/imsccs.2007.52 · Cited by 199
Art in the Age of Machine Learning
Audry, S. (2021) · The MIT Press eBooks · doi:10.7551/mitpress/12832.001.0001 · Cited by 112
Mak, S., & Joseph, V. R. (2018) · The Annals of Statistics · doi:10.1214/17-aos1629 · Cited by 204
Deep Semantic Clustering by Partition Confidence Maximisation
Huang, J., Gong, S., & Zhu, X. (2020) · 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr42600.2020.00887 · Cited by 199
Decision-making techniques in supplier selection: Recent accomplishments and what lies ahead
Chai, J., & Ngai, E. W. T. (2020) · Expert Systems with Applications · doi:10.1016/j.eswa.2019.112903 · Cited by 199
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
Coding of arbitrarily shaped image segments based on a generalized orthogonal transform
Gilge, M., Engelhardt, T., & Mehlan, R. (1989) · Signal Processing Image Communication · doi:10.1016/0923-5965(89)90007-6 · Cited by 199
Maltamo, M., Packalén, P., Yu, X., Eerikäinen, K., Hyyppä, J., & Pitkänen, J. (2005) · Forest Ecology and Management · doi:10.1016/j.foreco.2005.05.034 · Cited by 198
Quantum Machine Learning: A Review and Case Studies
Zeguendry, A., Jarir, Z., & Quafafou, M. (2023) · Entropy · doi:10.3390/e25020287 · Cited by 197
Multidimensional asymptotic quantization theory withrth power distortion measures
Bucklew, J., & Wise, G. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056486 · Cited by 197
Yang, Y., Sun, H., Zhang, Y., Zhang, T., Gong, J., Wei, Y., Duan, Y.-G., Shu, M., Yang, Y., Wu, D., et al. (2021) · Cell Reports · doi:10.1016/j.celrep.2021.109442 · Cited by 197
Clustering with Spectral Norm and the k-Means Algorithm
Kumar, A., & Kannan, R. (2010) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2010.35 · Cited by 197
Tetrahedral mesh generation and optimization based on centroidal Voronoi tessellations
Du, Q., & Wang, D. (2003) · International Journal for Numerical Methods in Engineering · doi:10.1002/nme.616 · Cited by 197
Comprehensive analysis of clustering algorithms: exploring limitations and innovative solutions
Wani, A. A. (2024) · PeerJ Computer Science · doi:10.7717/peerj-cs.2286 · Cited by 198
Chattopadhyay, A., Hassanzadeh, P., & Pasha, S. (2020) · Scientific Reports · doi:10.1038/s41598-020-57897-9 · Cited by 196
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.