fbpx
Wikipedia

Multiresolution analysis

A multiresolution analysis (MRA) or multiscale approximation (MSA) is the design method of most of the practically relevant discrete wavelet transforms (DWT) and the justification for the algorithm of the fast wavelet transform (FWT). It was introduced in this context in 1988/89 by Stephane Mallat and Yves Meyer and has predecessors in the microlocal analysis in the theory of differential equations (the ironing method) and the pyramid methods of image processing as introduced in 1981/83 by Peter J. Burt, Edward H. Adelson and James L. Crowley.

Definition edit

A multiresolution analysis of the Lebesgue space   consists of a sequence of nested subspaces

 

that satisfies certain self-similarity relations in time-space and scale-frequency, as well as completeness and regularity relations.

  • Self-similarity in time demands that each subspace Vk is invariant under shifts by integer multiples of 2k. That is, for each   the function g defined as   also contained in  .
  • Self-similarity in scale demands that all subspaces   are time-scaled versions of each other, with scaling respectively dilation factor 2k-l. I.e., for each   there is a   with  .
  • In the sequence of subspaces, for k>l the space resolution 2l of the l-th subspace is higher than the resolution 2k of the k-th subspace.
  • Regularity demands that the model subspace V0 be generated as the linear hull (algebraically or even topologically closed) of the integer shifts of one or a finite number of generating functions   or  . Those integer shifts should at least form a frame for the subspace  , which imposes certain conditions on the decay at infinity. The generating functions are also known as scaling functions or father wavelets. In most cases one demands of those functions to be piecewise continuous with compact support.
  • Completeness demands that those nested subspaces fill the whole space, i.e., their union should be dense in  , and that they are not too redundant, i.e., their intersection should only contain the zero element.

Important conclusions edit

In the case of one continuous (or at least with bounded variation) compactly supported scaling function with orthogonal shifts, one may make a number of deductions. The proof of existence of this class of functions is due to Ingrid Daubechies.

Assuming the scaling function has compact support, then   implies that there is a finite sequence of coefficients   for  , and   for  , such that

 

Defining another function, known as mother wavelet or just the wavelet

 

one can show that the space  , which is defined as the (closed) linear hull of the mother wavelet's integer shifts, is the orthogonal complement to   inside  .[1] Or put differently,   is the orthogonal sum (denoted by  ) of   and  . By self-similarity, there are scaled versions   of   and by completeness one has

 

thus the set

 

is a countable complete orthonormal wavelet basis in  .

See also edit

References edit

  1. ^ Mallat, S.G. "A Wavelet Tour of Signal Processing". www.di.ens.fr. Retrieved 2019-12-30.
  • Chui, Charles K. (1992). An Introduction to Wavelets. San Diego: Academic Press. ISBN 0-585-47090-1.
  • Akansu, A.N.; Haddad, R.A. (1992). Multiresolution signal decomposition: transforms, subbands, and wavelets. Academic Press. ISBN 978-0-12-047141-6.
  • Crowley, J. L., (1982). A Representations for Visual Information, Doctoral Thesis, Carnegie-Mellon University, 1982.
  • Burrus, C.S.; Gopinath, R.A.; Guo, H. (1997). Introduction to Wavelets and Wavelet Transforms: A Primer. Prentice-Hall. ISBN 0-13-489600-9.
  • Mallat, S.G. (1999). A Wavelet Tour of Signal Processing. Academic Press. ISBN 0-12-466606-X.

multiresolution, analysis, confused, with, multiple, scale, analysis, multiresolution, analysis, multiscale, approximation, design, method, most, practically, relevant, discrete, wavelet, transforms, justification, algorithm, fast, wavelet, transform, introduc. Not to be confused with Multiple scale analysis A multiresolution analysis MRA or multiscale approximation MSA is the design method of most of the practically relevant discrete wavelet transforms DWT and the justification for the algorithm of the fast wavelet transform FWT It was introduced in this context in 1988 89 by Stephane Mallat and Yves Meyer and has predecessors in the microlocal analysis in the theory of differential equations the ironing method and the pyramid methods of image processing as introduced in 1981 83 by Peter J Burt Edward H Adelson and James L Crowley Contents 1 Definition 2 Important conclusions 3 See also 4 ReferencesDefinition editA multiresolution analysis of the Lebesgue space L 2 R displaystyle L 2 mathbb R nbsp consists of a sequence of nested subspaces 0 V 1 V 0 V 1 V n V n 1 L 2 R displaystyle 0 dots subset V 1 subset V 0 subset V 1 subset dots subset V n subset V n 1 subset dots subset L 2 mathbb R nbsp dd that satisfies certain self similarity relations in time space and scale frequency as well as completeness and regularity relations Self similarity in time demands that each subspace Vk is invariant under shifts by integer multiples of 2k That is for each f V k m Z displaystyle f in V k m in mathbb Z nbsp the function g defined as g x f x m 2 k displaystyle g x f x m2 k nbsp also contained in V k displaystyle V k nbsp Self similarity in scale demands that all subspaces V k V l k gt l displaystyle V k subset V l k gt l nbsp are time scaled versions of each other with scaling respectively dilation factor 2k l I e for each f V k displaystyle f in V k nbsp there is a g V l displaystyle g in V l nbsp with x R g x f 2 k l x displaystyle forall x in mathbb R g x f 2 k l x nbsp In the sequence of subspaces for k gt l the space resolution 2l of the l th subspace is higher than the resolution 2k of the k th subspace Regularity demands that the model subspace V0 be generated as the linear hull algebraically or even topologically closed of the integer shifts of one or a finite number of generating functions ϕ displaystyle phi nbsp or ϕ 1 ϕ r displaystyle phi 1 dots phi r nbsp Those integer shifts should at least form a frame for the subspace V 0 L 2 R displaystyle V 0 subset L 2 mathbb R nbsp which imposes certain conditions on the decay at infinity The generating functions are also known as scaling functions or father wavelets In most cases one demands of those functions to be piecewise continuous with compact support Completeness demands that those nested subspaces fill the whole space i e their union should be dense in L 2 R displaystyle L 2 mathbb R nbsp and that they are not too redundant i e their intersection should only contain the zero element Important conclusions editIn the case of one continuous or at least with bounded variation compactly supported scaling function with orthogonal shifts one may make a number of deductions The proof of existence of this class of functions is due to Ingrid Daubechies Assuming the scaling function has compact support then V 0 V 1 displaystyle V 0 subset V 1 nbsp implies that there is a finite sequence of coefficients a k 2 ϕ x ϕ 2 x k displaystyle a k 2 langle phi x phi 2x k rangle nbsp for k N displaystyle k leq N nbsp and a k 0 displaystyle a k 0 nbsp for k gt N displaystyle k gt N nbsp such that ϕ x k N N a k ϕ 2 x k displaystyle phi x sum k N N a k phi 2x k nbsp Defining another function known as mother wavelet or just the wavelet ps x k N N 1 k a 1 k ϕ 2 x k displaystyle psi x sum k N N 1 k a 1 k phi 2x k nbsp one can show that the space W 0 V 1 displaystyle W 0 subset V 1 nbsp which is defined as the closed linear hull of the mother wavelet s integer shifts is the orthogonal complement to V 0 displaystyle V 0 nbsp inside V 1 displaystyle V 1 nbsp 1 Or put differently V 1 displaystyle V 1 nbsp is the orthogonal sum denoted by displaystyle oplus nbsp of W 0 displaystyle W 0 nbsp and V 0 displaystyle V 0 nbsp By self similarity there are scaled versions W k displaystyle W k nbsp of W 0 displaystyle W 0 nbsp and by completeness one has L 2 R closure of k Z W k displaystyle L 2 mathbb R mbox closure of bigoplus k in mathbb Z W k nbsp thus the set ps k n x 2 k ps 2 k x n k n Z displaystyle psi k n x sqrt 2 k psi 2 k x n k n in mathbb Z nbsp is a countable complete orthonormal wavelet basis in L 2 R displaystyle L 2 mathbb R nbsp See also editMultigrid method Multiscale modeling Scale space Time frequency analysis WaveletReferences edit Mallat S G A Wavelet Tour of Signal Processing www di ens fr Retrieved 2019 12 30 Chui Charles K 1992 An Introduction to Wavelets San Diego Academic Press ISBN 0 585 47090 1 Akansu A N Haddad R A 1992 Multiresolution signal decomposition transforms subbands and wavelets Academic Press ISBN 978 0 12 047141 6 Crowley J L 1982 A Representations for Visual Information Doctoral Thesis Carnegie Mellon University 1982 Burrus C S Gopinath R A Guo H 1997 Introduction to Wavelets and Wavelet Transforms A Primer Prentice Hall ISBN 0 13 489600 9 Mallat S G 1999 A Wavelet Tour of Signal Processing Academic Press ISBN 0 12 466606 X Retrieved from https en wikipedia org w index php title Multiresolution analysis amp oldid 1149404255, wikipedia, wiki, book, books, library,

article

, read, download, free, free download, mp3, video, mp4, 3gp, jpg, jpeg, gif, png, picture, music, song, movie, book, game, games.