On the relationship between quasi-affine systems and the à trous algorithm.

Brody Dylan Johnson

Collectanea Mathematica (2002)

  • Volume: 53, Issue: 2, page 187-210
  • ISSN: 0010-0757

Abstract

top
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.

How to cite

top

Johnson, Brody Dylan. "On the relationship between quasi-affine systems and the à trous algorithm.." Collectanea Mathematica 53.2 (2002): 187-210. <http://eudml.org/doc/42913>.

@article{Johnson2002,
abstract = {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.},
author = {Johnson, Brody Dylan},
journal = {Collectanea Mathematica},
keywords = {Ondículas; Transformada wavelet; Marcos de ondículas; generalized quasi-affine system; refinable quasi-affine systems; discrete wavelet transform; à trous algorithm; bracket product; multiresolution operators; refinable affine frames; GQA frames; biorthogonal wavelet systems},
language = {eng},
number = {2},
pages = {187-210},
title = {On the relationship between quasi-affine systems and the à trous algorithm.},
url = {http://eudml.org/doc/42913},
volume = {53},
year = {2002},
}

TY - JOUR
AU - Johnson, Brody Dylan
TI - On the relationship between quasi-affine systems and the à trous algorithm.
JO - Collectanea Mathematica
PY - 2002
VL - 53
IS - 2
SP - 187
EP - 210
AB - 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.
LA - eng
KW - Ondículas; Transformada wavelet; Marcos de ondículas; generalized quasi-affine system; refinable quasi-affine systems; discrete wavelet transform; à trous algorithm; bracket product; multiresolution operators; refinable affine frames; GQA frames; biorthogonal wavelet systems
UR - http://eudml.org/doc/42913
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.