We seek to demonstrate a connection between refinable quasi-affine systems and the discrete wavelet transform known as the à trous algorithm. We begin with an introduction of the bracket product, which is the major tool in our analysis. Using multiresolution operators, we then proceed to reinvestigate the equivalence of the duality of refinable affine frames and their quasi-affine counterparts associated with a fairly general class of scaling functions that includes the class of compactly supported scaling functions. Our methods show that for negative scales only one of the generalized Smith-Barnwell equations is actually needed to establish the additivity property of the quasi-affine multiresolution operators. This fact is then identified with the à trous algorithm thereby illustrating the connection with quasi-affine systems. We then introduce the notion of a generalized quasi-affine (GQA) system, in which separated generating wavelets are used for non-negative and negative dilations. Sufficient conditions are described for two GQA systems to constitute dual frames, providing a means for the construction of frames from appropriate à trous systems. We conclude with a brief discussion of examples of GQA frames associated with two different biorthogonal wavelet systems. The novelty of this work is the connection established between the à trous algorithm and refinable quasi-affine systems together with the notion of GQA systems, which are introduced to exploit this connection.
@article{urn:eudml:doc:42913,
title = {On the relationship between quasi-affine systems and the \`a trous algorithm.},
journal = {Collectanea Mathematica},
volume = {53},
year = {2002},
pages = {187-210},
zbl = {1024.42025},
mrnumber = {MR1913517},
language = {en},
url = {http://dml.mathdoc.fr/item/urn:eudml:doc:42913}
}
Johnson, Brody Dylan. On the relationship between quasi-affine systems and the à trous algorithm.. Collectanea Mathematica, Tome 53 (2002) pp. 187-210. http://gdmltest.u-ga.fr/item/urn:eudml:doc:42913/