Vector quantization with complexity costs
From MaRDI portal
Recommendations
Cited in
(15)- An efficient vector quantizer providing globally optimal solutions
- A vector-quantization approach to coding systems
- A novel approach for vector quantization using a neural network, mean shift, and principal component analysis-based seed re-initialization
- Computation of the complexity of vector quantizers by affine modeling
- Parallel codebook design for vector quantization on a message passing MIMD architecture
- Logarithmic Pyramid Vector Quantization—Design and Theoretical Analysis
- Complexity-constrained tree-structured vector quantizers
- A Multigrid Approach to the Scalar Quantization Problem
- A spatial regularization approach for vector quantization
- Vector quantization by deterministic annealing
- Memetic algorithm based vector quantizer
- Vector quantization using information theoretic concepts
- Clustering: a neural network approach
- scientific article; zbMATH DE number 2033190 (Why is no real title available?)
- Image vector quantization with variable dimension blocks and edge preserving cost function
This page was built for publication: Vector quantization with complexity costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4307315)