D. M. Monro, D. L. Wilson, J. A. Nicholls. High speed image coding with the Bath fractal transform. In IEEE International Symposium on Multimedia Technologies and Future Applications, Southampton, April 1993.
The Bath Fractal Trandform (BFT) is a general strategy for finding least squares approximations to data in any number of dimensions (including time) by contraction mappings of fractal functions of arbitrary complexity. In two dimensions this includes as low order cases fractal transforms previously reported by Jacquin [1], by Monro and Dudbridge [2] and as patented by Barnsley [3]. It is possible to search for these mappings, or to define them on domains which are predetermined. We consider polynomial instances of the BFT, in which case the complexity of coding by the BFT of any order is linear with the number of pixels. We pay particular attention to instances where the coding is done by non-overlapping domains without searching. A minimal plotting algorithm (MPA) is then known for rendering the image, also of linear complexity. The assymetry of coding and decoding is then greatly reduced compared with earlier fractal methods. We therefore can identify a strategy for fast fractal coding and decoding which can extend the usefulness of fractal transform methods into applications requiring real time coding, such as digital video.
@InProceedings{MoWiNi93,
Author = {Monro, D. M. and Wilson, D. L. and Nicholls, J. A.},
Title = {High speed image coding with the Bath fractal transform},
BookTitle = {IEEE International Symposium on Multimedia Technologies and Future Applications},
Address = {Southampton},
Month = {April},
Year = {1993}
}