Partitioning complexity issue for iterated functions systems based image coding
Emmanuel Reusens · 1994
. This paper copes with the issue of adaptive partitioning in the context of Iterated Functions Systems (IFS) image coding. The main concern is to provide some insights on the optimum degree of partition adaptivity. The key point is to point out the proper balance of information between the partition representation and the transformation parameters of the system. Several systems involving different degrees of adaptivity will be compared. To that end a polygonal-based segmentation will be presented. This will allow to compare performances of partitioning using respectively square, rectangular and polygonal segments. 1. Introduction The concept of fractal has been introduced by Mandelbrot in the 1960's as an alternative to the classical Euclidean geometry mainly for describing shapes generated by Nature. Since then, this theory attracts the interest of many researchers in fields ranging from biology to physics through computer imaging and image processing. Iterated contractive function...