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
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Introduction to information retrieval
(2009) · Choice Reviews Online · doi:10.5860/choice.46-2715 · Cited by 12,278
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
“The procedure, as described, proceeds deterministically from the given initial partition, as one shifts systematically the vertex with lowest fitness, and is likely to get trapped in local optima.”
MethodData clustering: 50 years beyond K-means
Jain, A. K. (2010) · Pattern Recognition Letters · doi:10.1016/j.patrec.2009.09.011 · Cited by 9,368
SLIC Superpixels Compared to State-of-the-Art Superpixel Methods
Achanta, R., Shaji, A., Smith, K., Lucchi, A., Fua, P., & Süsstrunk, S. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.120 · Cited by 9,201
(2007) · doi:10.5555/1283383.1283494 · Cited by 7,364
Top 10 algorithms in data mining
Wu, X., Kumar, V., Ross Quinlan, J., Ghosh, J., Yang, Q., Motoda, H., McLachlan, G. J., Ng, A., Liu, B., Yu, P. S., et al. (2008) · Knowledge and Information Systems · doi:10.1007/s10115-007-0114-2 · Cited by 5,667
“This algorithm has been discovered by several researchers across different disciplines, most notably Lloyd (1957, 1982) [53], Forgey (1965), Friedman and Rubin (1967), and McQueen (1967).”
An efficient k-means clustering algorithm: analysis and implementation
Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silverman, R., & Wu, A. Y. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1017616 · Cited by 5,660
“(More accurately, it should be called the generalized Lloyd’s algorithm since Lloyd’s original result was for scalar data [37].)”
BackgroundFast Learning in Networks of Locally-Tuned Processing Units
Moody, J., & Darken, C. J. (1989) · Neural Computation · doi:10.1162/neco.1989.1.2.281 · Cited by 4,194
Zwanenburg, A., Vallières, M., Abdalah, M. A., Aerts, H. J. W. L., Andrearczyk, V., Apte, A., Ashrafinia, S., Bakas, S., Beukinga, R. J., Boellaard, R., et al. (2020) · Radiology · doi:10.1148/radiol.2020191145 · Cited by 4,177
“ntain a similar number of voxels, i.e. the histogram is as flat as possible (Hall et al., 1971). The Lloyd-Max algorithm is a clustering method that seeks to minimise discretisation errors (Max, 1960; Lloyd, 1982). 3.1.8 Feature calculation Feature calculation is the processing step where single features are calculated…”
MethodInfluentialBinary Companions of Evolved Stars in APOGEE DR14: Search Method and Catalog of ∼5000 Companions
Price-Whelan, A. M., Hogg, D. W., Rix, H.-W., De Lee, N., Majewski, S. R., Nidever, D. L., Troup, N., Fernández-Trincado, J. G., García-Hernández, D. A., Longa-Peña, P., et al. (2018) · The Astronomical Journal · doi:10.3847/1538-3881/aac387 · Cited by 3,756
Machine Learning in Agriculture: A Review
Liakos, K., Busato, P., Moshou, D., Pearson, S., & Bochtis, D. (2018) · Sensors · doi:10.3390/s18082674 · Cited by 3,441
Bakas, S., Akbari, H., Sotiras, A., Bilello, M., Rozycki, M., Kirby, J. S., Freymann, J. B., Farahani, K., & Davatzikos, C. (2017) · Scientific Data · doi:10.1038/sdata.2017.117 · Cited by 3,049
Data-intensive applications, challenges, techniques and technologies: A survey on Big Data
Philip Chen, C. L., & Zhang, C.-Y. (2014) · Information Sciences · doi:10.1016/j.ins.2014.01.015 · Cited by 3,047
Tracking whole-brain connectivity dynamics in the resting state
Allen, E. A., Damaraju, E., Plis, S. M., Erhardt, E. B., Eichele, T., & Calhoun, V. D. (2014) · Cerebral Cortex · doi:10.1093/cercor/bhs352 · Cited by 2,992
HuBERT: Self-Supervised Speech Representation Learning by Masked Prediction of Hidden Units
Hsu, W.-N., Bolte, B., Tsai, Y.-H. H., Lakhotia, K., Salakhutdinov, R., & Mohamed, A. (2021) · IEEE/ACM Transactions on Audio, Speech, and Language Processing · doi:10.1109/taslp.2021.3122291 · Cited by 2,983
Data Mining: Concepts and Techniques (2nd edition)
Han, J., & Kamber, M. (2006) · Cited by 2,890
Gray, R. M. (1990) · Readings in Speech Recognition · doi:10.1016/b978-0-08-051584-7.50011-5 · Cited by 2,845
Coverage Control for Mobile Sensing Networks
Cortes, J., Martinez, S., Karatas, T., & Bullo, F. (2004) · IEEE Transactions on Robotics and Automation · doi:10.1109/tra.2004.824698 · Cited by 2,710
Vlfeat: an open and portable library of computer vision algorithms
Vedaldi, A., & Fulkerson, B. (2010) · Proceedings of the 18th ACM international conference on Multimedia · doi:10.1145/1873951.1874249 · Cited by 2,664
E pur si muove:Galilean-invariant cosmological hydrodynamical simulations on a moving mesh
Springel, V. (2010) · Monthly Notices of the Royal Astronomical Society · doi:10.1111/j.1365-2966.2009.15715.x · Cited by 2,424
Ikotun, A. M., Ezugwu, A. E., Abualigah, L., Abuhaija, B., & Heming, J. (2023) · Information Sciences · doi:10.1016/j.ins.2022.11.139 · Cited by 2,272
Centroidal Voronoi Tessellations: Applications and Algorithms
Du, Q., Faber, V., & Gunzburger, M. (1999) · SIAM Review · doi:10.1137/s0036144599352836 · Cited by 2,244
Finite-state Markov channel-a useful model for radio communication channels
Wang, H. S., & Moayeri, N. (1995) · IEEE Transactions on Vehicular Technology · doi:10.1109/25.350282 · Cited by 1,647
Gray, R. M., & Neuhoff, D. L. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720541 · Cited by 1,642
Essentials of the self-organizing map
Kohonen, T. (2013) · Neural Networks · doi:10.1016/j.neunet.2012.09.018 · Cited by 1,601
Towards a general-purpose foundation model for computational pathology
Chen, R. J., Ding, T., Lu, M. Y., Williamson, D. F. K., Jaume, G., Song, A. H., Chen, B., Zhang, A., Shao, D., Shaban, M., et al. (2024) · Nature Medicine · doi:10.1038/s41591-024-02857-3 · Cited by 1,560
Comparing clusterings—an information based distance
Meilă, M. (2007) · Journal of Multivariate Analysis · doi:10.1016/j.jmva.2006.11.013 · Cited by 1,546
Vision based hand gesture recognition for human computer interaction: a survey
Rautaray, S. S., & Agrawal, A. (2015) · Artificial Intelligence Review · doi:10.1007/s10462-012-9356-9 · Cited by 1,526
Sketch-based manga retrieval using manga109 dataset
Matsui, Y., Ito, K., Aramaki, Y., Fujimoto, A., Ogawa, T., Yamasaki, T., & Aizawa, K. (2017) · Multimedia Tools and Applications · doi:10.1007/s11042-016-4020-z · Cited by 1,432
'Neural-gas' network for vector quantization and its application to time-series prediction
Martinetz, T. M., Berkovich, S. G., & Schulten, K. J. (1993) · IEEE Transactions on Neural Networks · doi:10.1109/72.238311 · Cited by 1,431
Comparing support vector machines with Gaussian kernels to radial basis function classifiers
Scholkopf, B., Sung, K.-K., Burges, C. J. C., Girosi, F., Niyogi, P., Poggio, T., & Vapnik, V. (1997) · IEEE Transactions on Signal Processing · doi:10.1109/78.650102 · Cited by 1,400
K-means clustering via principal component analysis
Ding, C., & He, X. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015408 · Cited by 1,386
Trajectory clustering: a partition-and-group framework
Lee, J.-G., Han, J., & Whang, K.-Y. (2007) · Proceedings of the 2007 ACM SIGMOD international conference on Management of data · doi:10.1145/1247480.1247546 · Cited by 1,363
A Resource-Allocating Network for Function Interpolation
Platt, J. (1991) · Neural Computation · doi:10.1162/neco.1991.3.2.213 · Cited by 1,354
Adaptive spatial binning of integral-field spectroscopic data using Voronoi tessellations
Cappellari, M., & Copin, Y. (2003) · Monthly Notices of the Royal Astronomical Society · doi:10.1046/j.1365-8711.2003.06541.x · Cited by 1,309
Girod, B., Aaron, A. M., Rane, S., & Rebollo-Monedero, D. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2004.839619 · Cited by 1,246
A comparative study of efficient initialization methods for the k-means clustering algorithm
Celebi, M. E., Kingravi, H. A., & Vela, P. A. (2013) · Expert Systems with Applications · doi:10.1016/j.eswa.2012.07.021 · Cited by 1,214
PyEMMA 2: A Software Package for Estimation, Validation, and Analysis of Markov Models
Scherer, M. K., Trendelkamp-Schroer, B., Paul, F., Pérez-Hernández, G., Hoffmann, M., Plattner, N., Wehmeyer, C., Prinz, J.-H., & Noé, F. (2015) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.5b00743 · Cited by 1,163
Challenges in unsupervised clustering of single-cell RNA-seq data
Kiselev, V. Y., Andrews, T. S., & Hemberg, M. (2019) · Nature Reviews Genetics · doi:10.1038/s41576-018-0088-9 · Cited by 1,160
Data-Driven Science and Engineering: Machine Learning, Dynamical Systems, and Control
Brunton, S. L., & Kutz, J. N. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108380690 · Cited by 1,154
Computing and rendering point set surfaces
Alexa, M., Behr, J., Cohen-Or, D., Fleishman, S., Levin, D., & Silva, C. T. (2003) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2003.1175093 · Cited by 1,089
Clustering trees: a visualization for evaluating clusterings at multiple resolutions
Zappia, L., & Oshlack, A. (2018) · GigaScience · doi:10.1093/gigascience/giy083 · Cited by 1,064
A Review of Data Fusion Techniques
Castanedo, F. (2013) · The Scientific World Journal · doi:10.1155/2013/704504 · Cited by 1,027
Soft-DTW: a Differentiable Loss Function for Time-SeriesPreprint
Cuturi, M., & Blondel, M. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.01541 · Cited by 1,012
Identification of slow molecular order parameters for Markov model construction
Pérez-Hernández, G., Paul, F., Giorgino, T., De Fabritiis, G., & Noé, F. (2013) · The Journal of Chemical Physics · doi:10.1063/1.4811489 · Cited by 990
“thetrajectory isexploredandnrepresentativepointsofthecoordinatespaceareselectedas cluster centers witha 8 clustering method. Various algorithms have been proposed in the literature, including k-means [50], k-centers[20],k-medoids[42],regularspatialclustering[83],regulartemporalclustering[83]andWard clustering[6]. The…”
MethodBayesian Nonparametric Federated Learning of Neural NetworksPreprint
Yurochkin, M., Agarwal, M., Ghosh, S., Greenewald, K. H., Hoang, T. N., & Khazaeni, Y. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.12022 · Cited by 987
Wireless Charging Technologies: Fundamentals, Standards, and Network Applications
Lu, X., Wang, P., Niyato, D., Kim, D. I., & Han, Z. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2499783 · Cited by 968
Image coding using vector quantization: a review
Nasrabadi, N. M., & King, R. A. (1988) · IEEE Transactions on Communications · doi:10.1109/26.3776 · Cited by 958
Using the triangle inequality to accelerate k-means
Elkan, C. (2003) · International Conference on Machine Learning · Cited by 954
Data Mining and Analytics in the Process Industry: The Role of Machine Learning
Ge, Z., Song, Z., Ding, S. X., & Huang, B. (2017) · IEEE Access · doi:10.1109/access.2017.2756872 · Cited by 922
“was originally developed for signal processing [69].”
Elements of Artificial Neural Networks
Mehrotra, K., Mohan, C., & Ranka, S. (1996) · The MIT Press eBooks · doi:10.7551/mitpress/2687.001.0001 · Cited by 912
Multimodal Distributional Semantics
Bruni, E., Tran, N. K., & Baroni, M. (2014) · Journal of Artificial Intelligence Research · doi:10.1613/jair.4135 · Cited by 908
Vallières, M., Freeman, C. R., Skamene, S. R., & El Naqa, I. (2015) · Physics in Medicine and Biology · doi:10.1088/0031-9155/60/14/5471 · Cited by 897
Design of multiple description scalar quantizers
Vaishampayan, V. A. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.256491 · Cited by 889
Rose, K. (1998) · Proceedings of the IEEE · doi:10.1109/5.726788 · Cited by 876
A Unifying Review of Linear Gaussian Models
Roweis, S., & Ghahramani, Z. (1999) · Neural Computation · doi:10.1162/089976699300016674 · Cited by 869
Asymptotically optimal block quantization
Gersho, A. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1056067 · Cited by 863
Vector quantization in speech coding
Makhoul, J., Roucos, S., & Gish, H. (1985) · Proceedings of the IEEE · doi:10.1109/proc.1985.13340 · Cited by 839
The devil is in the details: an evaluation of recent feature encoding methods
Chatfield, K., Lempitsky, V., Vedaldi, A., & Zisserman, A. (2011) · Procedings of the British Machine Vision Conference 2011 · doi:10.5244/c.25.76 · Cited by 834
A survey of kernel and spectral methods for clustering
Filippone, M., Camastra, F., Masulli, F., & Rovetta, S. (2008) · Pattern Recognition · doi:10.1016/j.patcog.2007.05.018 · Cited by 827
Rate-distortion methods for image and video compression
Ortego, A., & Ramchandran, K. (1998) · IEEE Signal Processing Magazine · doi:10.1109/79.733495 · Cited by 808
An Introduction to Machine Learning
Badillo, S., Banfai, B., Birzele, F., Davydov, I. I., Hutchinson, L., Kam‐Thong, T., Siebourg‐Polster, J., Steiert, B., & Zhang, J. D. (2020) · Clinical Pharmacology & Therapeutics · doi:10.1002/cpt.1796 · Cited by 799
(2019) · Acta Polytechnica Hungarica · doi:10.12700/aph · Cited by 786
Image data compression: A review
Jain, A. K. (1981) · Proceedings of the IEEE · doi:10.1109/proc.1981.11971 · Cited by 709
Machine Learning: The art and science of algorithms that make sense of data
Flach, P. A. (2012) · Cited by 697
Meta-Learning for Semi-Supervised Few-Shot Classification
Ren, M., Triantafillou, E., Ravi, S., Snell, J., Swersky, K., Tenenbaum, J. B., Larochelle, H., & Zemel, R. S. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1803.00676 · Cited by 694
Signature of consciousness in the dynamics of resting-state brain activity
Barttfeld, P., Uhrig, L., Sitt, J. D., Sigman, M., Jarraya, B., & Dehaene, S. (2015) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1418031112 · Cited by 670
Competitive learning algorithms for vector quantization
Ahalt, S. C., Krishnamurthy, A. K., Chen, P., & Melton, D. E. (1990) · Neural Networks · doi:10.1016/0893-6080(90)90071-r · Cited by 670
Optimal design of multi-energy systems with seasonal storage
Gabrielli, P., Gazzani, M., Martelli, E., & Mazzotti, M. (2017) · Applied Energy · doi:10.1016/j.apenergy.2017.07.142 · Cited by 663
Color image quantization for frame buffer display
Heckbert, P. (1982) · Proceedings of the 9th annual conference on Computer graphics and interactive techniques · doi:10.1145/800064.801294 · Cited by 656
Identification of slow molecular order parameters for Markov model construction
Perez-hern, G., Paul, F., Giorgino, T., Fabritiis, G. D., Noé, F., & Contribution, E. (2013) · Max Planck Institute for Plasma Physics · Cited by 656
Distributed Control of Robotic Networks
Bullo, F. (2009) · Cited by 649
Oblivious multi-party machine learning on trusted processors
Ohrimenko, O., Schuster, F., Fournet, C., Mehta, A., Nowozin, S., Vaswani, K., & Costa, M. (2016) · MPG.PuRe (Max Planck Society) · Cited by 647
Variational shape approximation
Cohen-Steiner, D., Alliez, P., & Desbrun, M. (2004) · ACM Transactions on Graphics · doi:10.1145/1015706.1015817 · Cited by 642
Entropy-constrained vector quantization
Chou, P. A., Lookabaugh, T. D., & Gray, R. M. (1989) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/29.17498 · Cited by 636
3-D Object Retrieval and Recognition With Hypergraph Analysis
Gao, Y., Wang, M., Tao, D., Ji, R., & Dai, Q. (2012) · IEEE Transactions on Image Processing · doi:10.1109/tip.2012.2199502 · Cited by 633
MagFace: A Universal Representation for Face Recognition and Quality Assessment
Meng, Q., Zhao, S., Huang, Z., & Zhou, F. (2021) · 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr46437.2021.01400 · Cited by 625
An Efficient Framework for Clustered Federated Learning
Ghosh, A., Chung, J., Yin, D., & Ramchandran, K. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3192506 · Cited by 623
SoundStream: An End-to-End Neural Audio Codec
Zeghidour, N., Luebs, A., Omran, A., Skoglund, J., & Tagliasacchi, M. (2022) · IEEE/ACM Transactions on Audio, Speech, and Language Processing · doi:10.1109/taslp.2021.3129994 · Cited by 610
Lafon, S., & Lee, A. B. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.184 · Cited by 609
Comparing Clusterings by the Variation of Information
Meilă, M. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45167-9_14 · Cited by 604
Trellis coded quantization of memoryless and Gauss-Markov sources
Marcellin, M. W., & Fischer, T. R. (1990) · IEEE Transactions on Communications · doi:10.1109/26.46532 · Cited by 596
A survey on Mesh Segmentation Techniques
Shamir, A. (2008) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2007.01103.x · Cited by 593
Deep learning improves antimicrobial peptide recognition
Veltri, D., Kamath, U., & Shehu, A. (2018) · Bioinformatics · doi:10.1093/bioinformatics/bty179 · Cited by 593
Nguyen, V. N., Jenssen, R., & Roverso, D. (2018) · International Journal of Electrical Power & Energy Systems · doi:10.1016/j.ijepes.2017.12.016 · Cited by 591
Data Mining and Analysis: Fundamental Concepts and Algorithms
Zaki, M. J., & Meira, Jr. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810114 · Cited by 586
Deep Clustering via Joint Convolutional Autoencoder Embedding and Relative Entropy Minimization
Dizaji, K. G., Herandi, A., Deng, C., Cai, W., & Huang, H. (2017) · 2017 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2017.612 · Cited by 579
A survey on nature inspired metaheuristic algorithms for partitional clustering
Nanda, S. J., & Panda, G. (2014) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2013.11.003 · Cited by 574
Towards K-means-friendly Spaces: Simultaneous Deep Learning and Clustering
Yang, B., Fu, X., Sidiropoulos, N. D., & Hong, M. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1610.04794 · Cited by 565
Statistical power for cluster analysis
Dalmaijer, E. S., Nord, C. L., & Astle, D. E. (2022) · BMC Bioinformatics · doi:10.1186/s12859-022-04675-1 · Cited by 563
Genome-Scale Imaging of the 3D Organization and Transcriptional Activity of Chromatin
Su, J.-H., Zheng, P., Kinrot, S. S., Bintu, B., & Zhuang, X. (2020) · Cell · doi:10.1016/j.cell.2020.07.032 · Cited by 562
“After step 5, we used a modified K-means algorithm (Lloyd, 1982) to separate the chromatin loci belonging to the same chro- mosome into two homologs.”
Speech 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
Alexa, M., Behr, J., Cohen‐Or, D., Fleishman, S., Levin, D., & Silva, C. T. (2001) · IEEE Visualization · doi:10.5555/601671.601673 · Cited by 554
Sun, H., Burton, H. V., & Huang, H. (2021) · Journal of Building Engineering · doi:10.1016/j.jobe.2020.101816 · Cited by 544
Frequency Selective Hybrid Precoding for Limited Feedback Millimeter Wave Systems
Alkhateeb, A., & Heath, R. W. (2016) · IEEE Transactions on Communications · doi:10.1109/tcomm.2016.2549517 · Cited by 543
QuIP#: Even Better LLM Quantization with Hadamard Incoherence and Lattice Codebooks
Tseng, A., Chee, J., Sun, Q., Kuleshov, V., & De, C. (2024) · PubMed · doi:10.48550/arxiv.2402.04396 · Cited by 522
K-means properties on six clustering benchmark datasets
Fränti, P., & Sieranoja, S. (2018) · Applied Intelligence · doi:10.1007/s10489-018-1238-7 · Cited by 518
A comprehensive survey on model compression and acceleration
Choudhary, T., Mishra, V., Goswami, A., & Sarangapani, J. (2020) · Artificial Intelligence Review · doi:10.1007/s10462-020-09816-7 · Cited by 513
Gray, R. M. (1990) · IEEE Transactions on Information Theory · doi:10.1109/18.59924 · Cited by 513
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.