Computation of the complexity of vector quantizers by affine modeling
From MaRDI portal
Publication:548879
DOI10.1016/j.sigpro.2010.10.015zbMath1219.94072OpenAlexW2056548100MaRDI QIDQ548879
Estevan P. Seraco, José Gabriel R. C. Gomes
Publication date: 30 June 2011
Published in: Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sigpro.2010.10.015
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Rate-distortion theory in information and communication theory (94A34)
Related Items
Uses Software
Cites Work
- Computation of the complexity of vector quantizers by affine modeling
- High-speed closest codeword search algorithms for vector quantization
- Complexity scalable control for H.264 motion estimation and mode decision under energy constraints
- Satellite image compression by post-transforms in the wavelet domain
- Complexity-constrained tree-structured vector quantizers
- Suboptimality of the Karhunen–LoÈve Transform for Transform Coding
- Lagrangian Vector Quantization With Combined Entropy and Codebook Size Constraints
- Asymptotic quantization error of continuous signals and the quantization dimension
- Asymptotically optimal block quantization
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- Analytical Rate-Distortion-Complexity Modeling of Wavelet-Based Video Coders
- Analysis of a complexity-based pruning scheme for classification trees
- Complexity distortion theory
- Quantization
- Sampling-Based Correlation Estimation for Distributed Source Coding Under Rate and Complexity Constraints
- Unnamed Item
- Unnamed Item
- Unnamed Item
