Computation of the complexity of vector quantizers by affine modeling
DOI10.1016/J.SIGPRO.2010.10.015zbMATH Open1219.94072OpenAlexW2056548100MaRDI QIDQ548879FDOQ548879
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
Recommendations
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)
Cites Work
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- Title not available (Why is that?)
- Suboptimality of the Karhunen–LoÈve Transform for Transform Coding
- Asymptotic quantization error of continuous signals and the quantization dimension
- Asymptotically optimal block quantization
- Quantization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sampling-Based Correlation Estimation for Distributed Source Coding Under Rate and Complexity Constraints
- Analysis of a complexity-based pruning scheme for classification trees
- Satellite image compression by post-transforms in the wavelet domain
- Lagrangian Vector Quantization With Combined Entropy and Codebook Size Constraints
- Complexity-constrained tree-structured vector quantizers
- Analytical Rate-Distortion-Complexity Modeling of Wavelet-Based Video Coders
- Complexity distortion theory
- 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
Cited In (1)
Uses Software
This page was built for publication: Computation of the complexity of vector quantizers by affine modeling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548879)
