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)
- 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
- Minimax and Minimax Projection Designs Using Clustering
- A semiparametric method for clustering mixed data
- On the complexity of clustering with relaxed size constraints in fixed dimension
- Centroidal Voronoi tessellation-based finite element superconvergence
- Adaptive fusion of color and spatial features for noise-robust retrieval of colored logo and trademark images
- A minimal surface criterion for graph partitioning
- Cross-entropy clustering
- Cluster-based reduced-order modelling of a mixing layer
- Mathematical optimization in intensity modulated radiation therapy
- A survey of kernel and spectral methods for clustering
- Direct reading algorithm for hierarchical clustering
- Beam selection in radiotherapy design
- Hhsmm: An R package for hidden hybrid Markov/semi-Markov models
- The finite cell method for polygonal meshes: poly-FCM
- Grid generation and optimization based on centroidal Voronoi tessellations
- Regularized \(k\)-means clustering of high-dimensional data and its asymptotic consistency
- Anisotropic mesh quality measures and adaptation for polygonal meshes
- Clustering through continuous facility location problems
- Enabling high-dimensional range queries using \(k\)NN indexing techniques: approaches and empirical results
- Phase-field based topology optimization with polygonal elements: a finite volume approach for the evolution equation
- A survey of data mining techniques applied to agriculture
- Generalized edge-weighted centroidal Voronoi tessellations for geometry processing
- Cluster-based fitting of phase-type distributions to empirical data
- Structure-sensitive superpixels via geodesic distance
- Quantile-based clustering
- Self-consistent field theory simulations of polymers on arbitrary domains
- Hierarchical Community Detection by Recursive Partitioning
- Quantization and clustering with Bregman divergences
- Deep mixtures of unigrams for uncovering topics in textual data
- Discrete optimal transport: complexity, geometry and applications
- A FAST k-MEANS IMPLEMENTATION USING CORESETS
- CciMST: a clustering algorithm based on minimum spanning tree and cluster centers
- A linear optimal transportation framework for quantifying and visualizing variations in sets of images
- k-POD: A Method for k-Means Clustering of Missing Data
- Beyond good partition shapes: an analysis of diffusive graph partitioning
- Quantum speed-up for unsupervised learning
- Soft clustering-based scenario bundling for a progressive hedging heuristic in stochastic service network design
- A family of unsupervised sampling algorithms
- Recovery guarantees for exemplar-based clustering
- Strong consistency of \(k\)-parameters clustering
- Robust Bregman clustering
- Quantisation scale-spaces
- Constrained low-rank matrix estimation: phase transitions, approximate message passing and applications
- Image compression by vector quantization of muliresolution decompositions
- Derivative of an integral over a convex polytope
- Clustering with the average silhouette width
- Generalized \(k\)-means in GLMs with applications to the outbreak of COVID-19 in the United States
- Tracking people across disjoint camera views by an illumination-tolerant appearance representation
- A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM
- Sparse and smooth: improved guarantees for spectral clustering in the dynamic stochastic block model
- Phase-Amplitude Separation and Modeling of Spherical Trajectories
- A refined approximation for Euclidean \(k\)-means
- Scalable kernel \(k\)-means clustering with Nyström approximation: relative-error bounds
- Min-max optimal data encoding and fusion in sensor networks
- Fast generation of 2-D node distributions for mesh-free PDE discretizations
- Asymptotics of optimal quantizers for some scalar distributions
- \(\gamma\)-SUP: a clustering algorithm for cryo-electron microscopy images of asymmetric particles
- Microstructural material database for self-consistent clustering analysis of elastoplastic strain softening materials
- Learning causal networks via additive faithfulness
- Convergence of the \(k\)-means minimization problem using \(\Gamma\)-convergence
- A \(k\)-points-based distance for robust geometric inference
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)