Optimal quantization by matrix searching

DOI10.1016/0196-6774(91)90039-2zbMath0768.94007OpenAlexW2027973753MaRDI QIDQ3988827

Xiaolin Wu

Publication date: 28 June 1992

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(91)90039-2

zbMATH Keywords

nonlinear programmingdiscrete optimization probleminformation theorysource codingmatrix-searching

Mathematics Subject Classification ID

Source coding (94A29) Rate-distortion theory in information and communication theory (94A34)

Related Items (6)

Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications ⋮ A spatial regularization approach for vector quantization ⋮ Exact Linear-Time Algorithm for Parameterized K-Means Problem with Optimized Number of Clusters in the 1D Case ⋮ Shape rectangularization problems in intensity-modulated radiation therapy ⋮ Polynomial-time solvability of the one-dimensional case of an NP-hard clustering problem ⋮ GEOMETRIC ALGORITHMS FOR THE CONSTRAINED 1-D K-MEANS CLUSTERING PROBLEMS AND IMRT APPLICATIONS

This page was built for publication: Optimal quantization by matrix searching