Computation of the complexity of vector quantizers by affine modeling

DOI10.1016/J.SIGPRO.2010.10.015MaRDI QIDQ548879zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

data compressionvector quantizationentropy constraintrate-distortion complexity

Mathematics Subject Classification ID

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)

Recommendations

• Complexity-constrained tree-structured vector quantizers
• Complexity-constrained trellis quantizers
• Vector quantization with complexity costs
• On the performance and complexity of channel-optimized vector quantizers
• Distortion-rate models for entropy-coded lattice vector quantization

Cites work

• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• scientific article; zbMATH DE number 467196 (Why is no real title available?)
• scientific article; zbMATH DE number 3318548 (Why is no real title available?)
• Analysis of a complexity-based pruning scheme for classification trees
• Analytical Rate-Distortion-Complexity Modeling of Wavelet-Based Video Coders
• Asymptotic quantization error of continuous signals and the quantization dimension
• Asymptotically optimal block quantization
• Complexity distortion theory
• Complexity scalable control for H.264 motion estimation and mode decision under energy constraints
• Complexity-constrained tree-structured vector quantizers
• Computation of the complexity of vector quantizers by affine modeling
• Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
• High-speed closest codeword search algorithms for vector quantization
• Lagrangian Vector Quantization With Combined Entropy and Codebook Size Constraints
• Quantization
• Sampling-Based Correlation Estimation for Distributed Source Coding Under Rate and Complexity Constraints
• Satellite image compression by post-transforms in the wavelet domain
• Suboptimality of the Karhunen–LoÈve Transform for Transform Coding

Cited in

(1)

• Computation of the complexity of vector quantizers by affine modeling

Describes a project that uses

Uses Software

• fminsearch

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)