PostScriptfiles representing thesis chapters and related documents.
zero-tree encoding; in fact, a call it zerotree encoding of A*small_image+B-like transforms
The paper offers a plain-term interpretation of Culik's image compression, a very capable yet undeservingly under-represented method giving spectacular results. The Culik's method will be explained 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 coefficient is the root of a zerotree, or its branch.
A better half of the notes is devoted to a remarkable and stunning method of compressing images using Finite Automata, which was invented/discovered by Dr. Karel Culik. The notes are the result of pondering over Culik's presentation and paper. Along the way, I noticed and corrected a few typos in his paper. I really took a stab at "reverse-engineering" of the compression and decompression algorithms, showing how they work step-by-step, up to the point of pseudo-code and tracing through it.
Dr. Culik's website shows examples of WFA (Weighted Finite Automata) compression and contains his bibliography.