Image Compression with Iterated Function Systems, Finite Automata and Zerotrees: Grand Unification
Oleg Kiselyov, Paul Fisher

TL;DR
This paper unifies various image compression techniques—fractal, Culik's, and zerotree coding—by demonstrating their algorithmic relations and interpreting them through a common framework involving iterated function systems and automata.
Contribution
It provides a plain-term interpretation of Culik's compression, shows its relation to IFS fractal methods, and offers a unified view of multiresolution image coding techniques.
Findings
Culik's method is algorithmically related to IFS fractal compression.
Zero wavelet coefficients form zerotrees in self-similar images.
Unified interpretation of multilevel image prediction techniques.
Abstract
Fractal image compression, Culik's image compression and zerotree prediction coding of wavelet image decomposition coefficients succeed only because typical images being compressed possess a significant degree of self-similarity. Besides the common concept, these methods turn out to be even more tightly related, to the point of algorithmical reducibility of one technique to another. The goal of the present paper is to demonstrate these relations. The paper offers a plain-term interpretation of Culik's image compression, in regular image processing terms, without resorting to finite state machines and similar lofty language. The interpretation is shown to be algorithmically related to an IFS fractal image compression method: an IFS can be exactly transformed into Culik's image code. Using this transformation, we will prove that in a self-similar (part of an) image any zero wavelet…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
