Geometrical Interpretation of IFS Based Image Coding
Julien Signès · Fractals · 1997
In most classical coding methods, a global optimization is carried out to ensure a given bit-rate or a given quality. In IFS based coding, some heuristic choices are made at each step of the algorithm: No method has, for instance, been proposed to optimize the domain blocks position, or the quantization of the transformations parameters. In this article we first analyze the limits of the existing algorithms, then define a new geometrical interpretation of the classical Jacquin-like method. Through the above analysis, we will answer some of these important questions.