Learning a multi-dimensional companding function for lossy source coding

DOI10.1016/J.NEUNET.2009.06.001MaRDI QIDQ280417zbMATH OpenOpenAlexDBLPWikidataFDO

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

zbMATH Keywords

bit allocationcompanding functionlossy source codingvector quantization

Mathematics Subject Classification ID

Source coding (94A29)

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

Cites work

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

Cited in

(1)

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

Describes a project that uses

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)