Multiresolution Analysis: Theory and Applications: Analisi Multirisoluzione: Teoria e Applicazioni
Multiresolution Analysis: Theory and Applications: Analisi Multirisoluzione: Teoria e Applicazioni
applications
Analisi multirisoluzione: teoria e applicazioni
Course overview
● Analytical models aim at approximating the signal E(q) by a truncated linear combination
of basis functions Φ(q) up to the order N:
cj are the transform coefficients characterizing the signal. Usually these coefficients
are obtained by linear fitting, e.g. using regularized mean squares
Continuous Analytical Basis for Diffusion Imaging
● Possibility to calculate the EAP and the ODF analytically, obtaining an exact solution for
all the computations
• Sparse representations: few coefficients reveal the information we are looking for.
– Such representations can be constructed by decomposing signals over elementary waveforms
chosen in a family called a dictionary.
– An orthogonal basis is a dictionary of minimum size that can yield a sparse representation if
designed to concentrate the signal energy over a set of few vectors. This set gives a geometric
signal description.
§ Signal compression and noise reduction
– Dictionaries of vectors that are larger than bases are needed to build sparse representations of
complex signals. But choosing is difficult and requires more complex algorithms.
§ Sparse representations in redundant dictionaries can improve pattern recognition, compression and noise
reduction
• Digital images can be seen as functions defined over a discrete domain {i,j: 0<i<I, 0<j<J}
– I,J: number of rows (columns) of the matrix corresponding to the image
– f=f[i,j]: gray level in position [i,j]
Example 1: δ function
⎧1 i= j=0
δ [i, j ] = ⎨
⎩0 i, j ≠ 0; i ≠ j
⎧1 i = 0; j = J
δ [i, j − J ] = ⎨
⎩0 otherwise
Example 2: Gaussian
Continuous function
x2 + y 2
1 2σ 2
f ( x, y ) = e
σ 2π
Discrete version
i2 + j2
1 2σ 2
f [i, j ] = e
σ 2π
Example 3: Natural image
Example 3: Natural image
The Fourier kingdom
+∞
Signal domain
Frequency domain
The Fourier kingdom
Gaussian function
The Fourier kingdom
rect function
sinc function
2D Fourier transform
+∞
− j (ω x x + ω y y )
fˆ (ω x , ω y ) = ∫ f ( x, y ) e dxdy
−∞
+∞
1 j (ω x + ω y )
f ( x, y ) = ∫ fˆ (ω x , ω y ) e x y d ω x d ω y
4π 2 −∞
1
∫∫ f ( x, y ) g * ( x, y ) dxdy = fˆ (ωx , ω y )gˆ * (ωx , ω y ) d ω x d ω y
4π 2 ∫∫
Parseval formula
2 1 ˆ
2
f = g → ∫∫ f ( x, y ) dxdy = 2 ∫∫ f (ωx , ω y ) d ωx d ω y Plancherel equality
4π
The Fourier kingdom
Wavelets
scalogram
Wavelets&Pyramids
N
N
N
Wavelets&Pyramids
Wavelets&Pyramids
Wavelets&Pyramids
Wavelets&Filterbanks
H ↓2
H ↓2
G ↓2
H ↓2
G ↓2
G ↓2
Wavelets&Filterbanks
↑2 H
↑2 H
↑2 G
↑2 H
↑2 G
↑2 G
Fourier Wavelets
– Basis functions are sinusoids – Different families of basis functions are
§ More in general, complex exponentials possible
– Switching from signal domain t to § Haar, Daubechies’, biorthogonal
frequency domain f – Switching from the signal domain to a
§ Either spatial or temporal multiresolution representation
– Good localization either in time or in – Good localization in time and frequency
frequency § Information on both the sharpness of the
§ Transformed domain: Information on the transient and the point where it happens
sharpness of the transient but not on its – Good for any type of signal
position
– Good for stationary signals but unsuitable
for transient phenomena
Applications