how is efficient encoding achieved with different cdf for different symbols #301
-
Hello authors,
My question is if each of all the CxHxW elements has their own estimated CDF, how does rANS achieve an efficient encoding? As I understand, ANS needs a single CDF (same for all incoming symbols) of a pre-defined alphabet to work. But here it looks like each symbol has their own CDF. I may have inaccurate understanding of ANS so would appreciate any pointers on this. Thanks! |
Beta Was this translation helpful? Give feedback.
Replies: 1 comment
-
Arithmetic coding's primary benefit over other lossless encoding schemes is that you can change the encoding probability distribution on-the-fly at any time to almost anything you want. Just subdivide the interval differently. ANS is an "approximation of arithmetic coding", and shares the same advantage of choosing new encoding distributions on-the-fly. |
Beta Was this translation helpful? Give feedback.
Arithmetic coding's primary benefit over other lossless encoding schemes is that you can change the encoding probability distribution on-the-fly at any time to almost anything you want. Just subdivide the interval differently.
ANS is an "approximation of arithmetic coding", and shares the same advantage of choosing new encoding distributions on-the-fly.