Least squares quantization in PCM
From MaRDI portal
Publication:4740474
DOI10.1109/TIT.1982.1056489zbMATH Open0504.94015WikidataQ55881521 ScholiaQ55881521MaRDI QIDQ4740474FDOQ4740474
Authors: Stuart P. Lloyd
Publication date: 1982
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Communication theory (94A05) Information theory (general) (94A15) Modulation and demodulation in information and communication theory (94A14)
Cited In (only showing first 100 items - show all)
- Fast spherical centroidal Voronoi mesh generation: a Lloyd-preconditioned LBFGS method in parallel
- A Lagrangian inertial centroidal Voronoi particle method for dynamic load balancing in particle-based simulations
- Temporally consistent tone mapping of images and video using optimal \(K\)-means clustering
- An improved Bregman \(k\)-means++ algorithm via local search
- The spherical \(k\)-means++ algorithm via local search
- Quantization and compressive sensing
- Improved local search algorithms for Bregman \(k\)-means and its variants
- The spherical \(k\)-means++ algorithm via local search scheme
- A GFEM-based reduced-order homogenization model for heterogeneous materials under volumetric and interfacial damage
- Quantum driven machine learning
- Approximation algorithms for spherical \(k\)-means problem using local search scheme
- High order direct arbitrary-Lagrangian-Eulerian schemes on moving Voronoi meshes with topology changes
- Title not available (Why is that?)
- A dimension reduction technique for large-scale structured sparse optimization problems with application to convex clustering
- A Simple Stochastic Rate Model for Rate Equity Hybrid Products
- Local search approximation algorithms for the \(k\)-means problem with penalties
- Convex programming based spectral clustering
- The vehicle routing problem with heterogeneous locker boxes
- Optimal dual quantizers of \(1 D\log \)-concave distributions: uniqueness and Lloyd like algorithm
- A streaming algorithm for \(k\)-means with approximate coreset
- A finite element framework based on bivariate simplex splines on triangle configurations
- Local search algorithm for the spherical \(k\)-means problem with outliers
- Clustering of measures via mean measure quantization
- Generalised Voronoi tessellation for generating microstructural finite element models with controllable grain-size distributions and grain aspect ratios
- Fitting tractable convex sets to support function evaluations
- BinaryRelax: a relaxation approach for training deep neural networks with quantized weights
- Noisy, Greedy and Not so Greedy k-Means++
- Bayesian optimization with approximate set kernels
- Scenario generation by selection from historical data
- Optimality of spectral clustering in the Gaussian mixture model
- Scenario reduction revisited: fundamental limits and guarantees
- Approximation Algorithms for Spherical k-Means Problem with Penalties Using Local Search Techniques
- Bonsai: diverse and shallow trees for extreme multi-label classification
- Hanson-Wright inequality in Hilbert spaces with application to \(K\)-means clustering for non-Euclidean data
- An efficient PODI method for real-time simulation of indenter contact problems using RBF interpolation and contact domain decomposition
- Blended coarse gradient descent for full quantization of deep neural networks
- Partial recovery bounds for clustering with the relaxed \(K\)-means
- Unsupervised classification of children's bodies using currents
- BROCCOLI: overlapping and outlier-robust biclustering through proximal stochastic gradient descent
- On the behaviour of \(K\)-means clustering of a dissimilarity matrix by means of full multidimensional scaling
- On strong consistency of kernel \(k\)-means: a Rademacher complexity approach
- Semi-supervised spectral algorithms for community detection in complex networks based on equivalence of clustering methods
- Comparing clusterings and numbers of clusters by aggregation of calibrated clustering validity indexes
- Loss aware post-training quantization
- Simplicial and minimal-variance distances in multivariate data analysis
- The approximation algorithm based on seeding method for functional \(k\)-means problem
- Fast methods for computing centroidal Laguerre tessellations for prescribed volume fractions with applications to microstructure generation of polycrystalline materials
- The correlation between statistical descriptors of heterogeneous materials
- Surrogate parametric metamodel based on optimal transport
- An approximation algorithm for the uniform capacitated \(k\)-means problem
- The bi-criteria seeding algorithms for two variants of \(k\)-means problem
- A frontal Delaunay quad mesh generator using the \(L^{\infty}\) norm
- Supervised distance metric learning through maximization of the Jeffrey divergence
- An approximation algorithm for the spherical \(k\)-means problem with outliers by local search
- Dissecting graph measure performance for node clustering in LFR parameter space
- Approximation algorithm for spherical \(k\)-means problem with penalty
- Multimodal correlations-based data clustering
- Simulation of crumpled sheets via alternating quasistatic and dynamic representations
- Enhanced step-wise approximation to speech file in a noisy environment
- An \({\ell_p}\) theory of PCA and spectral clustering
- Sharp optimal recovery in the two component Gaussian mixture model
- Mathematical optimization in intensity modulated radiation therapy
- Tree approximation for discrete time stochastic processes: a process distance approach
- Clustering of functional data in a low-dimensional subspace
- Modifications of the two-stage transportation problem and their applications
- Design of functionally graded piezocomposites using topology optimization and homogenization -- toward effective energy harvesting materials
- KmL: k-means for longitudinal data
- Fast methods for computing centroidal Voronoi tessellations
- On identification of FIR systems having quantized output data
- Limit theorems for random normalized distortion
- Topology optimization using polytopes
- Learning a multi-dimensional companding function for lossy source coding
- Dirichlet-tree multinomial mixtures for clustering microbiome compositions
- Finding archetypal patterns for binary questionnaires
- Functional factorial \(K\)-means analysis
- Tailoring unstructured meshes for use with a 3D time domain co-volume algorithm for computational electromagnetics
- A bad instance for \texttt{k-means++}
- Reduced order mesh optimisation using proper orthogonal decomposition and a modified cuckoo search
- An extension of multiple correspondence analysis for identifying heterogeneous subgroups of respondents
- The planar \(k\)-means problem is NP-hard
- Identifiability of nonparametric mixture models and Bayes optimal clustering
- Adaptive \(h\)-refinement for reduced-order models
- Projection-based curve clustering
- Comparing clusterings -- an information based distance
- On clustering histograms with \(k\)-means by using mixed \(\alpha\)-divergences
- \(k\)-means requires exponentially many iterations even in the plane
- Simultaneous Registration and Clustering for Multidimensional Functional Data
- The optimal centroidal Voronoi tessellations and the Gersho's conjecture in the three-dimensional space
- Automatic segmentation of blood vessels from retinal fundus images through image processing and data mining techniques
- The Planar k-Means Problem is NP-Hard
- Centroidal Voronoi tessellation in universal covering space of manifold surfaces
- Mixture models of categorization
- Dimension-reduced clustering of functional data via subspace separation
- Mesh sensitivity in peridynamic simulations
- Multi-stage optimization for periodic inspection planning of geo-distributed infrastructure systems
- Uncovering the dynamics of correlation structures relative to the collective market motion
- Recursive algorithms for parameter estimation with adaptive quantizer
- Polygonal finite elements for topology optimization: a unifying paradigm
- Gas storage valuation applying numerically constructed recombining trees
- Meshfree, probabilistic determination of point sets and support regions for meshless computing
This page was built for publication: Least squares quantization in PCM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4740474)