Abstract

It is well known that the action of a “Fractal Transform” or (Local) Iterated Function System with Grey Level Maps (IFSM) on a function f(x) induces a very simple mapping on its expansion coefficients c ij in the Haar wavelet basis. This is the basis of the “discrete fractal-wavelet transform”: subtrees of the wavelet coefficient tree are scaled and copied to lower subtrees. Such transforms, which we shall also refer to as IFSW—IFS on wavelet coefficients—have been introduced into image processing with other (compactly supported) wavelet basis sets in an attempt to remove the blocking artifacts in the standard IFS block encoding algorithms. Although not as straightforward as in the Haar case, we show that there is a relationship between such wavelet transforms and IFSM. In fact, for most such transforms, there is an equivalent IFSM, which provides a further mathematical basis for their use in image processing. We also present results for the case of periodized wavelets, a common implementation in image processing. Finally, we prove some results on the fractal dimension of the graph of an attractor of IFSM or IFSW operators.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.