Learning a multi-dimensional companding function for lossy source coding

DOI10.1016/J.NEUNET.2009.06.001zbMATH Open1335.94021DBLPjournals/nn/MaedaI09OpenAlexW2090667368WikidataQ51616521 ScholiaQ51616521MaRDI QIDQ280417FDOQ280417

Authors: Shin-Ichi Maeda, Shin Ishii 

Publication date: 10 May 2016

Published in: Neural Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.neunet.2009.06.001

Recommendations

• High-resolution source coding for non-difference distortion measures: multidimensional companding
• Vector Quantization by Companding a Union of Z-Lattices
• Multidimensional companding quantization of the gaussian source
• Simple compression algorithm for memoryless Laplacian source based on the optimal companding technique
• Optimal companding vector quantization for circularly symmetric sources

zbMATH Keywords

bit allocationcompanding functionlossy source codingvector quantization

Mathematics Subject Classification ID

Source coding (94A29)

Cites Work

• Reducing the Dimensionality of Data with Neural Networks
• Least squares quantization in PCM
• A lower bound on the average error of vector quantizers (Corresp.)
• Suboptimality of the Karhunen–LoÈve Transform for Transform Coding
• Companding and random quantization in several dimensions
• Bit allocation and encoding for vector sources
• Asymptotically optimal block quantization
• Transform coding with backward adaptive updates
• Bennett's integral for vector quantizers

Cited In (1)

• Learning a Single Tucker Decomposition Network for Lossy Image Compression With Multiple Bits-per-Pixel Rates

Uses Software

• darch
• MNIST

This page was built for publication: Learning a multi-dimensional companding function for lossy source coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q280417)