Least squares quantization in PCM
From MaRDI portal
Publication:4740474
DOI10.1109/TIT.1982.1056489zbMath0504.94015WikidataQ55881521 ScholiaQ55881521MaRDI QIDQ4740474
Publication date: 1982
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Information theory (general) (94A15) Communication theory (94A05) Modulation and demodulation in information and communication theory (94A14)
Related Items (only showing first 100 items - show all)
High order direct arbitrary-Lagrangian-Eulerian schemes on moving Voronoi meshes with topology changes ⋮ A refined approximation for Euclidean \(k\)-means ⋮ Properties and generation of representative points of the exponential distribution ⋮ \(\mathcal{H}\)-polytope decomposition-based algorithm for continuous optimization ⋮ GPU-based supervoxel segmentation for 3D point clouds ⋮ Temporal gap statistic: a new internal index to validate time series clustering ⋮ Iterative algorithm for discrete structure recovery ⋮ Reduced multidimensional scaling ⋮ Sparse and smooth: improved guarantees for spectral clustering in the dynamic stochastic block model ⋮ Quadratic serendipity element shape functions on general planar polygons ⋮ TCB-spline-based isogeometric analysis method with high-quality parameterizations ⋮ Stable honeycomb structures and temperature based trajectory optimization for wire-arc additive manufacturing ⋮ Semi-supervised spectral algorithms for community detection in complex networks based on equivalence of clustering methods ⋮ A user study on hybrid graph visualizations ⋮ The Kohonen self-organizing map method: An assessment ⋮ A spatial regularization approach for vector quantization ⋮ Beyond good partition shapes: an analysis of diffusive graph partitioning ⋮ A linear optimal transportation framework for quantifying and visualizing variations in sets of images ⋮ Quantum speed-up for unsupervised learning ⋮ Regularized \(k\)-means clustering of high-dimensional data and its asymptotic consistency ⋮ Simplification and hierarchical representations of mixtures of exponential families ⋮ Optimal multirobot coverage path planning: ideal-shaped spanning tree ⋮ CciMST: a clustering algorithm based on minimum spanning tree and cluster centers ⋮ Clustering with missing features: a penalized dissimilarity measure based approach ⋮ Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem ⋮ On the positive semi-definite property of similarity matrices ⋮ A versatile technique for the optimal approximation of random processes by functional quantization ⋮ Higher order mobile coverage control with applications to clustering of discrete sets ⋮ Weighted ultrafast diffusion equations: from well-posedness to long-time behaviour ⋮ Approximation algorithms for fuzzy \(C\)-means problem based on seeding method ⋮ Graph summarization with quality guarantees ⋮ Detecting cooperative and organized spammer groups in micro-blogging community ⋮ Hardness of \(k\)-anonymous microaggregation ⋮ Multi-stage resource-aware scheduling for data centers with heterogeneous servers ⋮ Efficient micromechanical analysis of fiber-reinforced composites subjected to cyclic loading through time homogenization and reduced-order modeling ⋮ A new multi-resolution parallel framework for SPH ⋮ An efficient \(K\)-means clustering algorithm for tall data ⋮ FEM-cluster based reduction method for efficient numerical prediction of effective properties of heterogeneous material in nonlinear range ⋮ An isotropic unstructured mesh generation method based on a fluid relaxation analogy ⋮ On the mathematical foundations of the self-consistent clustering analysis for non-linear materials at small strains ⋮ An adaptive domain-based POD/ECM hyper-reduced modeling framework without offline training ⋮ Support points ⋮ Fuzzy clustering using the convex hull as geometrical model ⋮ Stochastic short-term hydropower planning with inflow scenario trees ⋮ Clustering in block Markov chains ⋮ Delaunay meshing of implicit domains with boundary edge sharpening and sliver elimination ⋮ Distributed consensus-based \(K\)-means algorithm in switching multi-agent networks ⋮ Fast generation of 2-D node distributions for mesh-free PDE discretizations ⋮ A Bayesian mixture model for clustering circular data ⋮ Surface reconstruction by parallel and unified particle-based resampling from point clouds ⋮ Consistently fitting orthopedic casts ⋮ Temporally consistent tone mapping of images and video using optimal \(K\)-means clustering ⋮ An improved Bregman \(k\)-means++ algorithm via local search ⋮ Optimal Bayesian experimental design for electrical impedance tomography in medical imaging ⋮ A GFEM-based reduced-order homogenization model for heterogeneous materials under volumetric and interfacial damage ⋮ Quantum driven machine learning ⋮ Soft clustering-based scenario bundling for a progressive hedging heuristic in stochastic service network design ⋮ The vehicle routing problem with heterogeneous locker boxes ⋮ Greedy vector quantization ⋮ Optimal dual quantizers of \(1 D\log \)-concave distributions: uniqueness and Lloyd like algorithm ⋮ Simplicial variances, potentials and Mahalanobis distances ⋮ The spherical \(k\)-means++ algorithm via local search ⋮ Local search algorithm for the spherical \(k\)-means problem with outliers ⋮ A bi-criteria analysis for fuzzy \(C\)-means problem ⋮ Clustering of measures via mean measure quantization ⋮ Fitting tractable convex sets to support function evaluations ⋮ Scenario generation by selection from historical data ⋮ Bayesian optimization with approximate set kernels ⋮ Convex programming based spectral clustering ⋮ Optimality of spectral clustering in the Gaussian mixture model ⋮ An efficient PODI method for real-time simulation of indenter contact problems using RBF interpolation and contact domain decomposition ⋮ On the behaviour of \(K\)-means clustering of a dissimilarity matrix by means of full multidimensional scaling ⋮ BROCCOLI: overlapping and outlier-robust biclustering through proximal stochastic gradient descent ⋮ On strong consistency of kernel \(k\)-means: a Rademacher complexity approach ⋮ Joint optimization of an autoencoder for clustering and embedding ⋮ 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 ⋮ Surrogate parametric metamodel based on optimal transport ⋮ Optimal routing for electric vehicle charging systems with stochastic demand: a heavy traffic approximation approach ⋮ A multiscale analysis of multi-agent coverage control algorithms ⋮ The bi-criteria seeding algorithms for two variants of \(k\)-means problem ⋮ An approximation algorithm for the uniform capacitated \(k\)-means problem ⋮ The seeding algorithm for spherical \(k\)-means clustering with penalties ⋮ The spherical \(k\)-means++ algorithm via local search scheme ⋮ An approximation algorithm for the spherical \(k\)-means problem with outliers by local search ⋮ Improved local search algorithms for Bregman \(k\)-means and its variants ⋮ 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 ⋮ Sharp optimal recovery in the two component Gaussian mixture model ⋮ An \({\ell_p}\) theory of PCA and spectral clustering ⋮ Grid generation and optimization based on centroidal Voronoi tessellations ⋮ A generalized Weisfeiler-Lehman graph kernel ⋮ Asymptotics of optimal quantizers for some scalar distributions ⋮ Prescriptive selection of machine learning hyperparameters with applications in power markets: retailer's optimal trading ⋮ Stratified mobility fishery models with harvesting outside of no-take areas ⋮ Scenario reduction revisited: fundamental limits and guarantees
This page was built for publication: Least squares quantization in PCM
