A parallel decoding algorithm for IFS codes without transient behavior
Abstract:
Iterated function systems (IFSs) have received great attention in encoding and decoding fractal images. Barnsley (1988) has shown that IFSs for image compression can achieve a very high compression ratio for a single image. However, the major drawback of such a technique is the large computation load required to both encode and decode a fractal image. We provide a novel algorithm to decode IFS codes. The main features of this algorithm are that it is very suitable for parallel implementation and has no transient behavior. Also, from the decoding process of this method we can understand the encoding procedure explicitly. One example is illustrated to demonstrate the quality of its performance.
Related Concept Videos
Block Diagram Reduction
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
Statically Indeterminate Problem Solving
Linear time-invariant Systems
The input-output behavior of an LTI system can be fully defined by its response to an impulsive excitation at its input. Once this impulse response is known, the system's reaction to any other input can be calculated...
Fast Fourier Transform
The computational efficiency of the FFT becomes...
Signal Sequences and Sorting Receptors
Discrete-time Fourier transform
One of the notable...


