1. Convolution, Edge Detection, Sampling 15-463: Computational Photography Alexei Efros, CMU, Fall 2006 Some slides from Steve Seitz

2. Fourier spectrum

3. Fun and games with spectra

4. 4 Gaussian filtering A Gaussian kernel gives less weight to pixels further from the center of the window This kernel is an approximation of a Gaussian function: 0000000000 0000000000 00090 00 000 00 000 00 000 0 00 000 00 0000000000 00 0000000 0000000000 121 242 121

5. Convolution Remember cross-correlation: A convolution operation is a cross-correlation where the filter is flipped both horizontally and vertically before being applied to the image: It is written: Suppose H is a Gaussian or mean kernel. How does convolution differ from cross-correlation?

6. The Convolution Theorem The greatest thing since sliced (banana) bread! The Fourier transform of the convolution of two functions is the product of their Fourier transforms The inverse Fourier transform of the product of two Fourier transforms is the convolution of the two inverse Fourier transforms Convolution in spatial domain is equivalent to multiplication in frequency domain!

7. Fourier Transform pairs

8. 2D convolution theorem example * f(x,y)f(x,y) h(x,y)h(x,y) g(x,y)g(x,y) |F(s x,s y )| |H(s x,s y )| |G(s x,s y )|

9. Low-pass, Band-pass, High-pass filters low-pass: band-pass: what’s high-pass?

10. Edges in images

11. Image gradient The gradient of an image: The gradient points in the direction of most rapid change in intensity The gradient direction is given by: how does this relate to the direction of the edge? The edge strength is given by the gradient magnitude

12. Effects of noise Consider a single row or column of the image Plotting intensity as a function of position gives a signal Where is the edge? How to compute a derivative?

13. Where is the edge? Solution: smooth first Look for peaks in

14. Derivative theorem of convolution This saves us one operation:

15. Laplacian of Gaussian Consider Laplacian of Gaussian operator Where is the edge?Zero-crossings of bottom graph

16. 2D edge detection filters is the Laplacian operator: Laplacian of Gaussian Gaussianderivative of Gaussian

17. MATLAB demo g = fspecial('gaussian',15,2); imagesc(g) surfl(g) gclown = conv2(clown,g,'same'); imagesc(conv2(clown,[-1 1],'same')); imagesc(conv2(gclown,[-1 1],'same')); dx = conv2(g,[-1 1],'same'); imagesc(conv2(clown,dx,'same')); lg = fspecial('log',15,2); lclown = conv2(clown,lg,'same'); imagesc(lclown) imagesc(clown +.2*lclown)

18. Image Scaling This image is too big to fit on the screen. How can we reduce it? How to generate a half- sized version?

19. Image sub-sampling Throw away every other row and column to create a 1/2 size image - called image sub-sampling 1/4 1/8

20. Image sub-sampling 1/4 (2x zoom) 1/8 (4x zoom) Why does this look so crufty? 1/2

21. Even worse for synthetic images

22. Really bad in video

23. Alias: n., an assumed name Picket fence receding Into the distance will produce aliasing… Input signal: x = 0:.05:5; imagesc(sin((2.^x).*x)) Matlab output: WHY? Aj-aj-aj: Alias! Not enough samples

24. Aliasing occurs when your sampling rate is not high enough to capture the amount of detail in your image Can give you the wrong signal/image—an alias Where can it happen in images? During image synthesis: sampling continous singal into discrete signal e.g. ray tracing, line drawing, function plotting, etc. During image processing: resampling discrete signal at a different rate e.g. Image warping, zooming in, zooming out, etc. To do sampling right, need to understand the structure of your signal/image Enter Monsieur Fourier…

25. Fourier transform pairs

26. Sampling w Spatial domainFrequency domain 1/w sampling pattern sampled signal

27. Reconstruction Frequency domain 1/w w Spatial domain sinc function reconstructed signal

28. What happens when the sampling rate is too low?

29. Nyquist Rate What’s the minimum Sampling Rate 1/w to get rid of overlaps? Frequency domain 1/w w Spatial domain sinc function Sampling Rate ≥ 2 * max frequency in the image this is known as the Nyquist Rate

30. Antialiasing What can be done? Sampling rate ≥ 2 * max frequency in the image 1.Raise sampling rate by oversampling Sample at k times the resolution continuous signal: easy discrete signal: need to interpolate 2. Lower the max frequency by prefiltering Smooth the signal enough Works on discrete signals 3. Improve sampling quality with better sampling Nyquist is best case! Stratified sampling (jittering) Importance sampling (salaries in Seattle) Relies on domain knowledge

31. Sampling Good sampling: Sample often or, Sample wisely Bad sampling: see aliasing in action!

32. Gaussian pre-filtering G 1/4 G 1/8 Gaussian 1/2 Solution: filter the image, then subsample

33. Subsampling with Gaussian pre-filtering G 1/4G 1/8Gaussian 1/2 Solution: filter the image, then subsample

34. Compare with... 1/4 (2x zoom) 1/8 (4x zoom) 1/2