140 likes | 502 Vues
Explore the commutative, associative, homogeneous, and additive properties of convolution in signal processing. Learn about shift-invariance and the Convolution Theorem, alongside examples and Fourier Transform in the Image Domain and Frequency Domain. Discover Multi-Resolution Image Representation through Gaussian, Laplacian, and Wavelet Pyramids, useful for fast pattern matching, motion analysis, image compression, and other applications.
E N D
Convolution Properties • Commutative: f*g = g*f • Associative: (f*g)*h = f*(g*h) • Homogeneous: f*(g)= f*g • Additive (Distributive): f*(g+h)= f*g+f*h • Shift-Invariant f*g(x-x0,y-yo)= (f*g) (x-x0,y-yo)
The Convolution Theorem and similarly:
* Examples What is the Fourier Transform of ?
Image Domain Frequency Domain
The Sampling Theorem Nyquist frequency, Aliasing, etc… (on the board)
Multi-Resolution Image Representation • Gaussian pyramids • Laplacian Pyramids • Wavelet Pyramids
Image Pyramid Low resolution High resolution
search search search search FastPattern Matching Also good for: - motion analysis - image compression - other applications
down-sample blur down-sample blur down-sample blur down-sample blur The Gaussian Pyramid Low resolution High resolution
The Laplacian Pyramid expand - = expand - = expand - = Laplacian Pyramid Gaussian Pyramid
Laplacian ~ Difference of Gaussians - = DOG = Difference of Gaussians More details on Gaussian and Laplacian pyramids can be found in the paper by Burt and Adelson (link will appear on the website).
v F(u,v) u Computerized Tomography f(x,y)
Computerized Tomography Original (simulated) 2D image 8 projections- Frequency Domain 120 projections- Frequency Domain Reconstruction from 120 projections Reconstruction from 8 projections