E. Reusens. Partitioning complexity issue for iterated function systems based image coding. In Proceedings of the VIIth European Signal Processing Conference EUSIPCO'94, Volume I, Pages 171-174, Edinburgh, 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 partiton representation and the transformation parameters of the system. Several systems involving different degrees of adaptivity will 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.
Download paper:
Adobe PDF
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
@InProceedings{Reus94b,
Author = {Reusens, E.},
Title = {Partitioning complexity issue for iterated function systems based image coding},
BookTitle = {Proceedings of the VIIth European Signal Processing Conference EUSIPCO'94},
Volume = {I},
Pages = {171--174},
Address = {Edinburgh},
Month = {},
Year = {1994}
}