Learning a multi-dimensional companding function for lossy source coding
From MaRDI portal
Publication:280417
DOI10.1016/J.NEUNET.2009.06.001zbMath1335.94021DBLPjournals/nn/MaedaI09OpenAlexW2090667368WikidataQ51616521 ScholiaQ51616521MaRDI QIDQ280417
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
Uses Software
Cites Work
- Reducing the Dimensionality of Data with Neural Networks
- 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
- Least squares quantization in PCM
- Bennett's integral for vector quantizers
This page was built for publication: Learning a multi-dimensional companding function for lossy source coding