Generalized fractal transforms: complexity issues

Abstract

The Bath Fractal Transform (BFT) defines a strategy for obtaining least squares fractal approximations and can be implemented using functions of varying complexity. The approximation method used in ITT-coding is itself the zero-order instance of the BFT. Some of the complexity options available are explored by combining various orders of BFT approximation with various degrees and types of searching. This may be regarded either as the inclusion of searching with the BFT or as a generalization of the matching criterion of ITT-coding. This is considered from the point of view of the cost-fidelity trade-offs incurred, and the implications for practical application to multimedia information retrieval systems and real-time video are discussed.<>