A fast fractal decoding algorithm based on the selection of an initial image
Related Experiment Video
Updated: Jul 7, 2026

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
Published on: August 30, 2013
Abstract:
In this correspondence, we show that the number of iterations required for the convergence of the fractal image decoding algorithm can be reduced by selecting a suitable initial image. We consider fractal decoding to have two components, namely, "DC" and "AC". Our initial image is an approximation of the attractor of DC decoding, which is a good estimation of the "range-averaged" image, i.e., the image obtained by replacing all pixel intensities in a given block by the mean value of the block. From the simulation, it is demonstrated that the decoding speed is greatly improved.
Related Concept Videos
Fast Fourier Transform
The computational efficiency of the FFT becomes...
Downsampling
The Fourier transform of the decimated sequence reveals a combination of scaled and shifted versions of the original spectrum. This...
Fast Decoupled and DC Powerflow
