Learned transform compression with optimized entropy encoding

04/07/2021
by   Magda Gregorova, et al.
0

We consider the problem of learned transform compression where we learn both, the transform as well as the probability distribution over the discrete codes. We utilize a soft relaxation of the quantization operation to allow for back-propagation of gradients and employ vector (rather than scalar) quantization of the latent codes. Furthermore, we apply similar relaxation in the code probability assignments enabling direct optimization of the code entropy. To the best of our knowledge, this approach is completely novel. We conduct a set of proof-of concept experiments confirming the potency of our approaches.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/03/2017

Soft-to-Hard Vector Quantization for End-to-End Learning Compressible Representations

We present a new approach to learn compressible representations in deep ...
research
05/25/2023

NVTC: Nonlinear Vector Transform Coding

In theory, vector quantization (VQ) is always better than scalar quantiz...
research
02/07/2018

Universal Deep Neural Network Compression

Compression of deep neural networks (DNNs) for memory- and computation-e...
research
06/26/2006

Entropy And Vision

In vector quantization the number of vectors used to construct the codeb...
research
12/14/2022

Image Compression with Product Quantized Masked Image Modeling

Recent neural compression methods have been based on the popular hyperpr...
research
08/04/2023

Frequency Disentangled Features in Neural Image Compression

The design of a neural image compression network is governed by how well...
research
11/25/2022

Homology-constrained vector quantization entropy regularizer

This paper describes an entropy regularization term for vector quantizat...

Please sign up or login with your details

Forgot password? Click here to reset