
MultipleOutput Channel Simulation and Lossy Compression of Probability Distributions
We consider a variant of the channel simulation problem with a single in...
read it

A tutorial on the range variant of asymmetric numeral systems
This paper is intended to be an accessible introduction to the range var...
read it

Infinite Choice and Probability Distributions. An Open Problem: The Real Hotel
We sketch a process algebra with data and probability distributions. Thi...
read it

RunLength Encoding in a Finite Universe
Text compression schemes and compact data structures usually combine sop...
read it

Endtoend optimized image compression with competition of prior distributions
Convolutional autoencoders are now at the forefront of image compression...
read it

Efficient Trimmed Convolutional Arithmetic Encoding for Lossless Image Compression
Arithmetic encoding is an essential class of coding techniques which hav...
read it
Encoding of probability distributions for Asymmetric Numeral Systems
Many data compressors regularly encode probability distributions for entropy coding  requiring minimal description length type of optimizations. Canonical prefix/Huffman coding usually just writes lengths of bit sequences, this way approximating probabilities with powersof2. Operating on more accurate probabilities usually allows for better compression ratios, and is possible e.g. using arithmetic coding and Asymmetric Numeral Systems family. Especially the multiplicationfree tabled variant of the latter (tANS) builds automaton often replacing Huffman coding due to better compression at similar computational cost  e.g. in popular Facebook Zstandard and Apple LZFSE compressors. There is discussed encoding of probability distributions for such applications, especially using Pyramid Vector Quantizer(PVQ)based approach with deformation, also tuned symbol spread for tANS.
READ FULL TEXT
Comments
There are no comments yet.