| Summary: | This thesis explores new approaches to the analysis of functions by combining tools from the fields of complex bases, number systems, iterated function systems (IFS) and wavelet multiresolution analyses (MRA). The foundation of this work is grounded in the identification of a link between two-dimensional non-separable Haar wavelets and complex bases. The theory of complex bases and this link are generalized to higher dimensional number systems. Tilings generated by number systems are typically fractal in nature. This often yields asymmetry in the wavelet trees of functions during wavelet decomposition. To acknowledge this situation, a class of extensions of functions is developed. These are shown to be consistent with the Mallat algorithm. A formal definition of local IFS on wavelet trees (LIFSW) is constructed for MRA associated with number systems, along with an application to the inverse problem. From these investigations, a series of algorithms emerge, namely the Mallat algorithm using addressing in number systems, an algorithm for extending functions and a method for constructing LIFSW operators in higher dimensions. Applications to image coding are given and ideas for further study are also proposed. Background material is included to assist readers less familiar with the varied topics considered. In addition, an appendix provides a more detailed exposition of the fundamentals of IFS theory.
|
|---|
