EEM 561 Machine Vision. Week 3: Fourier Transform and Image Pyramids
|
|
- Hector Dalton
- 5 years ago
- Views:
Transcription
1 EEM 561 Machine Vision Week 3: Fourier Transform and Image Pyramids Spring 2015 Instructor: Hatice Çınar Akakın, Ph.D. Anadolu University
2 Linear Image Transformations In analyzing images, it s often useful to make a change of basis. Transformed image Vectorized image Fourier transform, or Wavelet transform, or Steerable pyramid transform = Source: A.Torralba
3 Self-inverting transforms Same basis functions are used for the inverse transform U transpose and complex conjugate Source: A.Torralba
4 Background Fourier Series Any periodic fuction can be expressed as the sum of sines and /or cosines of different frequencies, each multiplied by different coefficients Fourier Transform Other functions that are not periodic (but whose area under curve is finite) can be expressed as the integral of sines and/or cosines multiplied by a weigthing function
5 Preliminary Concepts Remember that, In 1-D; The period of cos(t) is2π seconds, i.e. The signal repeats itself after2π seconds. The period of cos(2π t) is one second. Frequency is measured in Hz (Hertz) and is the number of periods (or cycles) per second, denoted f. That is, f = 1 T The function cos(2π f t) has a frequency of f and a period of 1/f Angular frequency is measured in rad/s, denoted by ω, so ω=2π/t.
6 Sum of cosines and sines to Express a periodic function
7 Frequency Spectra example : g(t) = sin(2πf t) + (1/3)sin(2π(3f) t) = + Slides: Efros
8 Fourier Transform Fourier transform stores the magnitude and phase at each frequency Magnitude encodes how much signal there is at a particular frequency Phase encodes spatial information (indirectly) For mathematical convenience, this is often notated in terms of real and complex numbers Amplitude: A R I 2 2 ( ) ( ) Phase: tan 1 I( ) R( )
9 Example:
10 Fourier transform visualization imaginary j 1 real color key F[m,n] = M -1N-1 åå k= 0 l = 0 Fourier transform matrix f [k,l]e -pi æ ç è km M + ln N ö ø input signal Source: A.Torralba
11 The Discrete Fourier Transform (DFT) of One Variable Suppose we want to obtain M equally spaced samples of F(μ) taken over the period μ=0 to μ=1/ T (only one needed). Take samples at μ = m M T M 1 F m = f n e j2πmn/m n 0 M 1 f n = 1 F M m e j2πmn/m m 0 m = 0, 1, 2,, M-1 DFT n = 0, 1, 2,, M-1 IDFT F u = M 1 n 0 f n e j2πux/m M 1 f x = 1 M m 0 F m e j2πux/m In image (spatial) processing, the more natural and widely used expression
12 The 2D impulse and Its Sifting Property (Continuous) Impulse of two continuous variables t and z : if t z 0 The impulse ( t, z), ( t, z) 0 otherwise and ( t, z) dtdz 1 The sifting property and f ( t, z) ( t, z) dtdz f (0,0) f ( t, z) ( t t, z z ) dtdz f ( t, z )
13 The 2D impulse and Its Sifting Property (Discrete) 1 if x y 0 The impulse ( x, y), ( x, y) 0 otherwise The sifting property and x y x y f ( x, y) ( x, y) f (0,0) f ( x, y) ( x x, y y ) f ( x, y )
14 The 2-D Discrete Fourier Transform and its Inverse DFT: M 1N 1 F(, ) f ( x, y) e x 0 y 0 j2 ( x/ M y/ N ) 0,1, 2,..., M 1; 0,1, 2,..., N 1; f ( x, y) is a digital image of size M N. IDFT: M 1N 1 1 f ( x, y) F(, ) e MN x 0 y 0 j 2 ( x/ M y/ N )
15 To get some sense of what basis elements look like, we plot a basis element --- or rather, its real part --- as a function of x,y for some fixed u, v. We get a function that is constant when (ux+vy) is constant. The magnitude of the vector (u, v) gives a frequency, and its direction gives an orientation. The function is a sinusoid with this frequency along the direction, and constant perpendicular to the direction. v e i e i ux vy ux vy u Source: A.Torralba
16 Here u and v are larger than in the previous slide. e v i ux vy e i u ux vy Source: A.Torralba
17 And larger still... e i ux vy v e u i ux vy Source: A.Torralba
18 Convolution The convolution of two functions f(t) and h(t) is defined as: Fourier transform pairs f ( t) h( t) H( ) F( ) f ( t) h( t) H( ) F( )
19 Bracewell s pictorial dictionary of Fourier transform pairs Bracewell, The Fourier Transform and its Applications, McGraw Hill 1978
20 Szeliski, Computer Vision, 2010
21 Magnitude FT Image Some important Fourier Transforms Source: A.Torralba
22 Magnitude FT Image Some important Fourier Transforms Source: A.Torralba
23
24 Fourier Amplitude Spectrum A B C fx(cycles/image pixel size) fx(cycles/image pixel size) fx(cycles/image pixel size) Source: A.Torralba
25 Phase and Magnitude Curious fact all natural images have about the same magnitude transform hence, phase seems to matter, but magnitude largely doesn t Demonstration Take two pictures, swap the phase transforms, compute the inverse - what does the result look like? Source: A.Torralba
26 Spectrum is insensitive to translation But rotates by the same angle as the rotated image
27 Computer Vision - A Modern Approach - Set: Pyramids and Texture - Slides by D.A. Forsyth
28 This is the magnitude transform of the cheetah pic Computer Vision - A Modern Approach - Set: Pyramids and Texture - Slides by D.A. Forsyth
29 This is the phase transform of the cheetah pic Computer Vision - A Modern Approach - Set: Pyramids and Texture - Slides by D.A. Forsyth
30 Computer Vision - A Modern Approach - Set: Pyramids and Texture - Slides by D.A. Forsyth
31 This is the magnitude transform of the zebra pic Computer Vision - A Modern Approach - Set: Pyramids and Texture - Slides by D.A. Forsyth
32 Reconstruction with zebra phase, cheetah magnitude Computer Vision - A Modern Approach - Set: Pyramids and Texture - Slides by D.A. Forsyth
33 Reconstruction with cheetah phase, zebra magnitude Computer Vision - A Modern Approach - Set: Pyramids and Texture - Slides by D.A. Forsyth
34 Summary of Steps for Filtering in the Frequency Domain 1. Given an input image f(x,y) of size MxN, obtain the padding parameters P and Q. Typically, P = 2M and Q = 2N. 2. Form a padded image, f p (x,y) of size PxQ by appending the necessary number of zeros to f(x,y). 3. Multiply f p (x,y) by (-1) x+y to center its transform. 4. Compute the DFT, F(u,v) of the image from step Generate a real, symmetric filter function, H(u,v), of size PxQ with center at coordinates (P/2, Q/2). Form the product G(u,v) = H(u,v)F(u,v) using array multiplication Obtain the processed image: (, ) (, ) ( 1) x g y p x y real G u v 7. Obtain the final processed result, g(x,y), by extracting the MxN region from the top, left quadrant of g p (x,y)
35 Filtering in spatial domain * =
36 Filtering in frequency domain FFT FFT = Inverse FFT Slide: Hoiem
37 FFT in Matlab Filtering with fft im = double(imread( '))/255; im = rgb2gray(im); % im should be a gray-scale floating point image [imh, imw] = size(im); hs = 50; % filter half-size fil = fspecial('gaussian', hs*2+1, 10); fftsize = 1024; % should be order of 2 (for speed) and include padding im_fft = fft2(im, fftsize, fftsize); % 1) fft im with padding fil_fft = fft2(fil, fftsize, fftsize); % 2) fft fil, pad to same size as image im_fil_fft = im_fft.* fil_fft; % 3) multiply fft images im_fil = ifft2(im_fil_fft); % 4) inverse fft2 im_fil = im_fil(1+hs:size(im,1)+hs, 1+hs:size(im, 2)+hs); % 5) remove padding Displaying with fft figure(1), imagesc(log(abs(fftshift(im_fft)))), axis image, colormap jet Slide: Hoiem
38 Image Sharpening Using Frequency Domain Filters Edges and sharp transitions in gray-values in an image contribute significantly to high-frequency content of its Fourier transform. Regions of relatively uniform gray-values in an image contribute to low-frequency content of its Fourier transform. Hence, image sharpening in the Frequency domain can be done by attenuating the low-frequency content of its Fourier transform. This would be a highpass filter!
39 Contrast Sensitivity Function From:
40 Contrast Sensitivity Function A demo of human contrast sensitivity as a function of spatial frequency. Frequency rises from left to right at a constant rate. Contrast drops from bottom to top at a constant rate. The bars are visible further up for middle frequencies, showing these are more salient to the human visual system. 40
41 Contrast sensitivity Contrast Sensitivity Function Blackmore & Campbell (1969) Maximum sensitivity ~ 6 cycles / degree of visual angle Invisible visible Spatial frequency (cycles/degree) High Low
42 Let Hu ( ) denote the difference of Gaussian filter /2 1 u /2 2 H ( u) Ae Be -u - with A B and 1 2 The corresponding filter in the spatial domain x 2 x h( x) 2 Ae 2 Ae
43 Image Smoothing using Frequency Domain Filters Ideal Lowpass filter (ILPF) Mathematically Cutoff Frequency Where D(u,v) is the distance from (u,v) to origin. an ILPF cannot be realized with real electronic components
44 Gaussian Lowpass Filters Gaussian Lowpass Filters (GLPF) in two dimensions is given By letting D 0 = cutoff frequency) H ( u, v) e D 0 H ( u, v) e D 2 2 (, )/2 0 D u v D 2 2 ( u, v)/2 σ = measure of spread about the centre
45 A highpass (HP) filter is obtained from a given lowpass (LP) filter using H ( u, v) 1 H ( u, v) HP An 2D ideal highpass filter (IHPF) with cutoff frequency D 0 : H u, v = 0 if D(u, v) D 0 1 if D u, v > D 0 LP
46
47 Ideal Butterworth Gaussian Spatial representations of HP filters
48 Sampling Pixels Continuous world Source: A.Torralba
49 Sampling Source: A.Torralba
50 Subsampling by a factor of 2 Throw away every other row and column to create a 1/2 size image Source: J. Hays
51 Aliasing problem Sub-sampling may be dangerous. Characteristic errors may appear: Wagon wheels rolling the wrong way in movies Checkerboards disintegrate in ray tracing Striped shirts look funny on color television Source: D. Forsyth
52
53
54 Nyquist-Shannon Sampling Theorem When sampling a signal at discrete intervals, the sampling frequency must be 2 f max f max = max frequency of the input signal This will allows to reconstruct the original perfectly from the sampled version v v v good bad Source: J. Hays
55 Anti-aliasing Solutions: Sample more often Get rid of all frequencies that are greater than half the new sampling frequency Will lose information But it s better than aliasing Apply a smoothing filter Source: J. Hays
56 Algorithm for downsampling by factor of 2 1. Start with image(h, w) 2. Apply low-pass filter im_blur = imfilter(image, fspecial( gaussian, 7, 1)) 3. Sample every other pixel im_small = im_blur(1:2:end, 1:2:end);
57 Subsampling without pre-filtering 1/2 1/4 (2x zoom) 1/8 (4x zoom) Slide by Steve Seitz
58 Subsampling with Gaussian pre-filtering Gaussian 1/2 G 1/4 G 1/8 Slide by Steve Seitz
59 Pyramids and Scale Space Basic idea: different scales are appropriate for describing different objects in the image, and we may not know the correct scale/size ahead of time.
60 Gaussian pre-filtering Solution: filter the image, then subsample blur F 0 subsample blur subsample * F 0 H F 1 F 1 * H F 2 Source:N. Snavely
61 Gaussian pyramid blur F 0 subsample blur subsample * F 0 H F 1 F 1 * H F 2 Source:N. Snavely
62 Gaussian pyramids [Burt and Adelson, 1983] In computer graphics, a mip map [Williams, 1983] A precursor to wavelet transform Gaussian Pyramids have all sorts of applications in computer vision Source: S. Seitz
63 Image representation Pixels: great for spatial resolution, poor access to frequency Fourier transform: great for frequency, not for spatial info Pyramids/filter banks: balance between spatial and frequency information Source: J. Hays
64 Major uses of image pyramids Compression Object detection Scale search Features Detecting stable interest points Registration Course-to-fine Source: J. Hays
65 The Laplacian Pyramid Synthesis Compute the difference between upsampled Gaussian pyramid level and Gaussian pyramid level. band pass filter - each level represents spatial frequencies (largely) unrepresented at other level.
66 Laplacian pyramid Source: Forsyth
67 gg Source: A. Torralba
68
69
70 Application: Representing Texture Source: Forsyth
71 Texture and Material
72 Texture and Orientation
73 Texture and Scale
74 How can we represent texture? Compute responses of blobs and edges at various orientations and scales
75 Overcomplete representation: filter banks LM Filter Bank Gaussian first and second derivative filters at three scales and 6 orientations 8 LoG filters at different scales, and 4 Gaussians at different scales Code for filter banks:
76
77
78
79
80 Upsampling This image is too small for this screen: How can we make it 10 times as big? Simplest approach: repeat each row and column 10 times ( Nearest neighbor interpolation ) Source:N. Snavely
81 Image interpolation d = 1 in this example Recall how a digital image is formed It is a discrete point-sampling of a continuous function If we could somehow reconstruct the original function, any new image could be generated, at any resolution and scale Adapted from: S. Seitz
82 Image interpolation d = 1 in this example Recall how a digital image is formed It is a discrete point-sampling of a continuous function If we could somehow reconstruct the original function, any new image could be generated, at any resolution and scale Adapted from: S. Seitz
83 Image interpolation 1 d = 1 in this example What if we don t know? Guess an approximation: Can be done in a principled way: filtering Convert to a continuous function: Reconstruct by convolution with a reconstruction filter, h Adapted from: S. Seitz
84 Image interpolation Ideal reconstruction Nearest-neighbor interpolation Linear interpolation Gaussian reconstruction Source: B. Curless
85 Image interpolation Original image: x 10 Nearest-neighbor interpolation Bilinear interpolation Bicubic interpolation Source:N. Snavely
Applications of Image Filters
02/04/0 Applications of Image Filters Computer Vision CS 543 / ECE 549 University of Illinois Derek Hoiem Review: Image filtering g[, ] f [.,.] h[.,.] 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 90
More informationThinking in Frequency
Thinking in Frequency Computer Vision Jia-Bin Huang, Virginia Tech Dali: Gala Contemplating the Mediterranean Sea (1976) Administrative stuffs Course website: http://bit.ly/vt-computer-vision-fall-2017
More informationScaled representations
Scaled representations Big bars (resp. spots, hands, etc.) and little bars are both interesting Stripes and hairs, say Inefficient to detect big bars with big filters And there is superfluous detail in
More informationTexture Representation + Image Pyramids
CS 1674: Intro to Computer Vision Texture Representation + Image Pyramids Prof. Adriana Kovashka University of Pittsburgh September 14, 2016 Reminders/Announcements HW2P due tonight, 11:59pm HW3W, HW3P
More informationFiltering in frequency domain
Filtering in frequency domain FFT FFT = Inverse FFT Filtering in frequency domain Can be faster than filtering in spatial domain (for large filters) Can help understand effect of filter Algorithm: 1. Convert
More informationTemplates, Image Pyramids, and Filter Banks
Templates, Image Pyramids, and Filter Banks Computer Vision James Hays, Brown Slides: Hoiem and others Reminder Project due Friday Fourier Bases Teases away fast vs. slow changes in the image. This change
More informationDigital Image Processing. Lecture 6
Digital Image Processing Lecture 6 (Enhancement in the Frequency domain) Bu-Ali Sina University Computer Engineering Dep. Fall 2016 Image Enhancement In The Frequency Domain Outline Jean Baptiste Joseph
More informationTexture and Other Uses of Filters
CS 1699: Intro to Computer Vision Texture and Other Uses of Filters Prof. Adriana Kovashka University of Pittsburgh September 10, 2015 Slides from Kristen Grauman (12-52) and Derek Hoiem (54-83) Plan for
More informationComputer Vision: 4. Filtering. By I-Chen Lin Dept. of CS, National Chiao Tung University
Computer Vision: 4. Filtering By I-Chen Lin Dept. of CS, National Chiao Tung University Outline Impulse response and convolution. Linear filter and image pyramid. Textbook: David A. Forsyth and Jean Ponce,
More informationLecture 2: 2D Fourier transforms and applications
Lecture 2: 2D Fourier transforms and applications B14 Image Analysis Michaelmas 2017 Dr. M. Fallon Fourier transforms and spatial frequencies in 2D Definition and meaning The Convolution Theorem Applications
More informationFOURIER TRANSFORM GABOR FILTERS. and some textons
FOURIER TRANSFORM GABOR FILTERS and some textons Thank you for the slides. They come mostly from the following sources Alexei Efros CMU Martial Hebert CMU Image sub-sampling 1/8 1/4 Throw away every other
More informationImage Pyramids and Applications
Image Pyramids and Applications Computer Vision Jia-Bin Huang, Virginia Tech Golconda, René Magritte, 1953 Administrative stuffs HW 1 will be posted tonight, due 11:59 PM Sept 25 Anonymous feedback Previous
More informationPoint and Spatial Processing
Filtering 1 Point and Spatial Processing Spatial Domain g(x,y) = T[ f(x,y) ] f(x,y) input image g(x,y) output image T is an operator on f Defined over some neighborhood of (x,y) can operate on a set of
More informationComputer Vision and Graphics (ee2031) Digital Image Processing I
Computer Vision and Graphics (ee203) Digital Image Processing I Dr John Collomosse J.Collomosse@surrey.ac.uk Centre for Vision, Speech and Signal Processing University of Surrey Learning Outcomes After
More informationSampling and Reconstruction. Most slides from Steve Marschner
Sampling and Reconstruction Most slides from Steve Marschner 15-463: Computational Photography Alexei Efros, CMU, Fall 2008 Sampling and Reconstruction Sampled representations How to store and compute
More informationFiltering Applications & Edge Detection. GV12/3072 Image Processing.
Filtering Applications & Edge Detection GV12/3072 1 Outline Sampling & Reconstruction Revisited Anti-Aliasing Edges Edge detection Simple edge detector Canny edge detector Performance analysis Hough Transform
More informationDigital Image Processing. Image Enhancement in the Frequency Domain
Digital Image Processing Image Enhancement in the Frequency Domain Topics Frequency Domain Enhancements Fourier Transform Convolution High Pass Filtering in Frequency Domain Low Pass Filtering in Frequency
More informationFilters and Pyramids. CSC320: Introduction to Visual Computing Michael Guerzhoy. Many slides from Steve Marschner, Alexei Efros
Filters and Pyramids Wassily Kandinsky, "Accent in Pink" Many slides from Steve Marschner, Alexei Efros CSC320: Introduction to Visual Computing Michael Guerzhoy Moving Average In 2D What are the weights
More informationLecture 5: Frequency Domain Transformations
#1 Lecture 5: Frequency Domain Transformations Saad J Bedros sbedros@umn.edu From Last Lecture Spatial Domain Transformation Point Processing for Enhancement Area/Mask Processing Transformations Image
More informationVivekananda. Collegee of Engineering & Technology. Question and Answers on 10CS762 /10IS762 UNIT- 5 : IMAGE ENHANCEMENT.
Vivekananda Collegee of Engineering & Technology Question and Answers on 10CS762 /10IS762 UNIT- 5 : IMAGE ENHANCEMENT Dept. Prepared by Harivinod N Assistant Professor, of Computer Science and Engineering,
More informationDIGITAL IMAGE PROCESSING
The image part with relationship ID rid2 was not found in the file. DIGITAL IMAGE PROCESSING Lecture 6 Wavelets (cont), Lines and edges Tammy Riklin Raviv Electrical and Computer Engineering Ben-Gurion
More informationBiomedical Image Analysis. Spatial Filtering
Biomedical Image Analysis Contents: Spatial Filtering The mechanics of Spatial Filtering Smoothing and sharpening filters BMIA 15 V. Roth & P. Cattin 1 The Mechanics of Spatial Filtering Spatial filter:
More informationFourier analysis and sampling theory
Reading Required: Shirley, Ch. 9 Recommended: Fourier analysis and sampling theory Ron Bracewell, The Fourier Transform and Its Applications, McGraw-Hill. Don P. Mitchell and Arun N. Netravali, Reconstruction
More informationImage restoration. Lecture 14. Milan Gavrilovic Centre for Image Analysis Uppsala University
Image restoration Lecture 14 Milan Gavrilovic milan@cb.uu.se Centre for Image Analysis Uppsala University Computer Assisted Image Analysis 2009-05-08 M. Gavrilovic (Uppsala University) L14 Image restoration
More informationEEM 463 Introduction to Image Processing. Week 3: Intensity Transformations
EEM 463 Introduction to Image Processing Week 3: Intensity Transformations Fall 2013 Instructor: Hatice Çınar Akakın, Ph.D. haticecinarakakin@anadolu.edu.tr Anadolu University Enhancement Domains Spatial
More informationDoes everyone have an override code?
Does everyone have an override code? Project 1 due Friday 9pm Review of Filtering Filtering in frequency domain Can be faster than filtering in spatial domain (for large filters) Can help understand effect
More informationCPSC 425: Computer Vision
CPSC 425: Computer Vision Image Credit: https://docs.adaptive-vision.com/4.7/studio/machine_vision_guide/templatematching.html Lecture 9: Template Matching (cont.) and Scaled Representations ( unless otherwise
More informationReview of Filtering. Filtering in frequency domain
Review of Filtering Filtering in frequency domain Can be faster than filtering in spatial domain (for large filters) Can help understand effect of filter Algorithm: 1. Convert image and filter to fft (fft2
More informationEdge and Texture. CS 554 Computer Vision Pinar Duygulu Bilkent University
Edge and Texture CS 554 Computer Vision Pinar Duygulu Bilkent University Filters for features Previously, thinking of filtering as a way to remove or reduce noise Now, consider how filters will allow us
More informationSampling and Reconstruction
Sampling and Reconstruction Sampling and Reconstruction Sampling and Spatial Resolution Spatial Aliasing Problem: Spatial aliasing is insufficient sampling of data along the space axis, which occurs because
More informationImage pyramids and their applications Bill Freeman and Fredo Durand Feb. 28, 2006
Image pyramids and their applications 6.882 Bill Freeman and Fredo Durand Feb. 28, 2006 Image pyramids Gaussian Laplacian Wavelet/QMF Steerable pyramid http://www-bcs.mit.edu/people/adelson/pub_pdfs/pyramid83.pdf
More informationImage transformations. Prof. Noah Snavely CS Administrivia
Image transformations Prof. Noah Snavely CS1114 http://www.cs.cornell.edu/courses/cs1114/ Administrivia 2 Last time: Interpolation 3 Nearest neighbor interpolation 4 Bilinear interpolation 5 Bicubic interpolation
More informationPSD2B Digital Image Processing. Unit I -V
PSD2B Digital Image Processing Unit I -V Syllabus- Unit 1 Introduction Steps in Image Processing Image Acquisition Representation Sampling & Quantization Relationship between pixels Color Models Basics
More informationLecture 6: Edge Detection
#1 Lecture 6: Edge Detection Saad J Bedros sbedros@umn.edu Review From Last Lecture Options for Image Representation Introduced the concept of different representation or transformation Fourier Transform
More informationFrequency analysis, pyramids, texture analysis, applications (face detection, category recognition)
Frequency analysis, pyramids, texture analysis, applications (face detection, category recognition) Outline Measuring frequencies in images: Definitions, properties Sampling issues Relation with Gaussian
More informationReading. 2. Fourier analysis and sampling theory. Required: Watt, Section 14.1 Recommended:
Reading Required: Watt, Section 14.1 Recommended: 2. Fourier analysis and sampling theory Ron Bracewell, The Fourier Transform and Its Applications, McGraw-Hill. Don P. Mitchell and Arun N. Netravali,
More informationFourier Transform in Image Processing. CS/BIOEN 6640 U of Utah Guido Gerig (slides modified from Marcel Prastawa 2012)
Fourier Transform in Image Processing CS/BIOEN 6640 U of Utah Guido Gerig (slides modified from Marcel Prastawa 2012) 1D: Common Transform Pairs Summary source FT Properties: Convolution See book DIP 4.2.5:
More informationSampling, Aliasing, & Mipmaps
Sampling, Aliasing, & Mipmaps Last Time? Monte-Carlo Integration Importance Sampling Ray Tracing vs. Path Tracing source hemisphere Sampling sensitive to choice of samples less sensitive to choice of samples
More informationSampling, Aliasing, & Mipmaps
Sampling, Aliasing, & Mipmaps Last Time? Monte-Carlo Integration Importance Sampling Ray Tracing vs. Path Tracing source hemisphere What is a Pixel? Sampling & Reconstruction Filters in Computer Graphics
More informationComputer Vision 2. SS 18 Dr. Benjamin Guthier Professur für Bildverarbeitung. Computer Vision 2 Dr. Benjamin Guthier
Computer Vision 2 SS 18 Dr. Benjamin Guthier Professur für Bildverarbeitung Computer Vision 2 Dr. Benjamin Guthier 1. IMAGE PROCESSING Computer Vision 2 Dr. Benjamin Guthier Content of this Chapter Non-linear
More informationSchedule for Rest of Semester
Schedule for Rest of Semester Date Lecture Topic 11/20 24 Texture 11/27 25 Review of Statistics & Linear Algebra, Eigenvectors 11/29 26 Eigenvector expansions, Pattern Recognition 12/4 27 Cameras & calibration
More informationCS 534: Computer Vision Texture
CS 534: Computer Vision Texture Ahmed Elgammal Dept of Computer Science CS 534 Texture - 1 Outlines Finding templates by convolution What is Texture Co-occurrence matrices for texture Spatial Filtering
More informationDigital Image Processing. Prof. P. K. Biswas. Department of Electronic & Electrical Communication Engineering
Digital Image Processing Prof. P. K. Biswas Department of Electronic & Electrical Communication Engineering Indian Institute of Technology, Kharagpur Lecture - 21 Image Enhancement Frequency Domain Processing
More informationCOMP 9517 Computer Vision
COMP 9517 Computer Vision Frequency Domain Techniques 1 Frequency Versus Spa
More informationAnnouncements. Image Matching! Source & Destination Images. Image Transformation 2/ 3/ 16. Compare a big image to a small image
2/3/ Announcements PA is due in week Image atching! Leave time to learn OpenCV Think of & implement something creative CS 50 Lecture #5 February 3 rd, 20 2/ 3/ 2 Compare a big image to a small image So
More informationTexture. Texture. 2) Synthesis. Objectives: 1) Discrimination/Analysis
Texture Texture D. Forsythe and J. Ponce Computer Vision modern approach Chapter 9 (Slides D. Lowe, UBC) Key issue: How do we represent texture? Topics: Texture segmentation Texture-based matching Texture
More informationCS 4495 Computer Vision. Linear Filtering 2: Templates, Edges. Aaron Bobick. School of Interactive Computing. Templates/Edges
CS 4495 Computer Vision Linear Filtering 2: Templates, Edges Aaron Bobick School of Interactive Computing Last time: Convolution Convolution: Flip the filter in both dimensions (right to left, bottom to
More informationconvolution shift invariant linear system Fourier Transform Aliasing and sampling scale representation edge detection corner detection
COS 429: COMPUTER VISON Linear Filters and Edge Detection convolution shift invariant linear system Fourier Transform Aliasing and sampling scale representation edge detection corner detection Reading:
More informationMultiresolution Image Processing
Multiresolution Image Processing 2 Processing and Analysis of Images at Multiple Scales What is Multiscale Decompostion? Why use Multiscale Processing? How to use Multiscale Processing? Related Concepts:
More informationIntroduction to Computer Vision. Week 3, Fall 2010 Instructor: Prof. Ko Nishino
Introduction to Computer Vision Week 3, Fall 2010 Instructor: Prof. Ko Nishino Last Week! Image Sensing " Our eyes: rods and cones " CCD, CMOS, Rolling Shutter " Sensing brightness and sensing color! Projective
More informationSampling, Aliasing, & Mipmaps
Last Time? Sampling, Aliasing, & Mipmaps 2D Texture Mapping Perspective Correct Interpolation Common Texture Coordinate Projections Bump Mapping Displacement Mapping Environment Mapping Texture Maps for
More informationTheoretically Perfect Sensor
Sampling 1/60 Sampling The ray tracer samples the geometry, only gathering information from the parts of the world that interact with a finite number of rays In contrast, a scanline renderer can push all
More informationImage gradients and edges April 11 th, 2017
4//27 Image gradients and edges April th, 27 Yong Jae Lee UC Davis PS due this Friday Announcements Questions? 2 Last time Image formation Linear filters and convolution useful for Image smoothing, removing
More informationImage gradients and edges April 10 th, 2018
Image gradients and edges April th, 28 Yong Jae Lee UC Davis PS due this Friday Announcements Questions? 2 Last time Image formation Linear filters and convolution useful for Image smoothing, removing
More informationChapter4 Image Enhancement
Chapter4 Image Enhancement Preview 4.1 General introduction and Classification 4.2 Enhancement by Spatial Transforming(contrast enhancement) 4.3 Enhancement by Spatial Filtering (image smoothing) 4.4 Enhancement
More informationFilterbanks and transforms
Filterbanks and transforms Sources: Zölzer, Digital audio signal processing, Wiley & Sons. Saramäki, Multirate signal processing, TUT course. Filterbanks! Introduction! Critical sampling, half-band filter!
More informationDigital Image Processing. Week 2
Geometric spatial transformations and image registration - modify the spatial relationship between pixels in an image - these transformations are often called rubber-sheet transformations (analogous to
More informationThe main goal of Computer Graphics is to generate 2D images 2D images are continuous 2D functions (or signals)
Motivation The main goal of Computer Graphics is to generate 2D images 2D images are continuous 2D functions (or signals) monochrome f(x,y) or color r(x,y), g(x,y), b(x,y) These functions are represented
More informationDigital Image Processing
Digital Image Processing Third Edition Rafael C. Gonzalez University of Tennessee Richard E. Woods MedData Interactive PEARSON Prentice Hall Pearson Education International Contents Preface xv Acknowledgments
More informationImage processing in frequency Domain
Image processing in frequency Domain Introduction to Frequency Domain Deal with images in: -Spatial domain -Frequency domain Frequency Domain In the frequency or Fourier domain, the value and location
More informationTheoretically Perfect Sensor
Sampling 1/67 Sampling The ray tracer samples the geometry, only gathering information from the parts of the world that interact with a finite number of rays In contrast, a scanline renderer can push all
More informationC2: Medical Image Processing Linwei Wang
C2: Medical Image Processing 4005-759 Linwei Wang Content Enhancement Improve visual quality of the image When the image is too dark, too light, or has low contrast Highlight certain features of the image
More informationEECS 556 Image Processing W 09. Image enhancement. Smoothing and noise removal Sharpening filters
EECS 556 Image Processing W 09 Image enhancement Smoothing and noise removal Sharpening filters What is image processing? Image processing is the application of 2D signal processing methods to images Image
More informationLecture 6 Basic Signal Processing
Lecture 6 Basic Signal Processing Copyright c1996, 1997 by Pat Hanrahan Motivation Many aspects of computer graphics and computer imagery differ from aspects of conventional graphics and imagery because
More informationMotivation. The main goal of Computer Graphics is to generate 2D images. 2D images are continuous 2D functions (or signals)
Motivation The main goal of Computer Graphics is to generate 2D images 2D images are continuous 2D functions (or signals) monochrome f(x,y) or color r(x,y), g(x,y), b(x,y) These functions are represented
More informationAnalysis and Synthesis of Texture
Analysis and Synthesis of Texture CMPE 264: Image Analysis and Computer Vision Spring 02, Hai Tao 31/5/02 Extracting image structure by filter banks Q Represent image textures using the responses of a
More informationBroad field that includes low-level operations as well as complex high-level algorithms
Image processing About Broad field that includes low-level operations as well as complex high-level algorithms Low-level image processing Computer vision Computational photography Several procedures and
More informationLow-level Vision Processing Algorithms Speaker: Ito, Dang Supporter: Ishii, Toyama and Y. Murakami
Low-level Vision Processing Algorithms Speaker: Ito, Dang Supporter: Ishii, Toyama and Y. Murakami Adaptive Systems Lab The University of Aizu Overview Introduction What is Vision Processing? Basic Knowledge
More informationComputer Vision Course Lecture 04. Template Matching Image Pyramids. Ceyhun Burak Akgül, PhD cba-research.com. Spring 2015 Last updated 11/03/2015
Computer Vision Course Lecture 04 Template Matching Image Pyramids Ceyhun Burak Akgül, PhD cba-research.com Spring 2015 Last updated 11/03/2015 Photo credit: Olivier Teboul vision.mas.ecp.fr/personnel/teboul
More informationFeature extraction. Bi-Histogram Binarization Entropy. What is texture Texture primitives. Filter banks 2D Fourier Transform Wavlet maxima points
Feature extraction Bi-Histogram Binarization Entropy What is texture Texture primitives Filter banks 2D Fourier Transform Wavlet maxima points Edge detection Image gradient Mask operators Feature space
More informationComputer Vision. Recap: Smoothing with a Gaussian. Recap: Effect of σ on derivatives. Computer Science Tripos Part II. Dr Christopher Town
Recap: Smoothing with a Gaussian Computer Vision Computer Science Tripos Part II Dr Christopher Town Recall: parameter σ is the scale / width / spread of the Gaussian kernel, and controls the amount of
More informationAliasing. Can t draw smooth lines on discrete raster device get staircased lines ( jaggies ):
(Anti)Aliasing and Image Manipulation for (y = 0; y < Size; y++) { for (x = 0; x < Size; x++) { Image[x][y] = 7 + 8 * sin((sqr(x Size) + SQR(y Size)) / 3.0); } } // Size = Size / ; Aliasing Can t draw
More informationTexture. Outline. Image representations: spatial and frequency Fourier transform Frequency filtering Oriented pyramids Texture representation
Texture Outline Image representations: spatial and frequency Fourier transform Frequency filtering Oriented pyramids Texture representation 1 Image Representation The standard basis for images is the set
More informationEdges, interpolation, templates. Nuno Vasconcelos ECE Department, UCSD (with thanks to David Forsyth)
Edges, interpolation, templates Nuno Vasconcelos ECE Department, UCSD (with thanks to David Forsyth) Edge detection edge detection has many applications in image processing an edge detector implements
More informationProf. Feng Liu. Winter /15/2019
Prof. Feng Liu Winter 2019 http://www.cs.pdx.edu/~fliu/courses/cs410/ 01/15/2019 Last Time Filter 2 Today More on Filter Feature Detection 3 Filter Re-cap noisy image naïve denoising Gaussian blur better
More informationStraight Lines and Hough
09/30/11 Straight Lines and Hough Computer Vision CS 143, Brown James Hays Many slides from Derek Hoiem, Lana Lazebnik, Steve Seitz, David Forsyth, David Lowe, Fei-Fei Li Project 1 A few project highlights
More informationEdge Detection. Announcements. Edge detection. Origin of Edges. Mailing list: you should have received messages
Announcements Mailing list: csep576@cs.washington.edu you should have received messages Project 1 out today (due in two weeks) Carpools Edge Detection From Sandlot Science Today s reading Forsyth, chapters
More informationMosaics. Today s Readings
Mosaics VR Seattle: http://www.vrseattle.com/ Full screen panoramas (cubic): http://www.panoramas.dk/ Mars: http://www.panoramas.dk/fullscreen3/f2_mars97.html Today s Readings Szeliski and Shum paper (sections
More information2D Image Processing INFORMATIK. Kaiserlautern University. DFKI Deutsches Forschungszentrum für Künstliche Intelligenz
2D Image Processing - Filtering Prof. Didier Stricker Kaiserlautern University http://ags.cs.uni-kl.de/ DFKI Deutsches Forschungszentrum für Künstliche Intelligenz http://av.dfki.de 1 What is image filtering?
More informationFourier transform of images
Fourier transform of images Stefano Ferrari Università degli Studi di Milano stefano.ferrari@unimi.it Methods for Image Processing academic year 2014 2015 Extension to bidimensional domain The concepts
More informationFiltering and Enhancing Images
KECE471 Computer Vision Filtering and Enhancing Images Chang-Su Kim Chapter 5, Computer Vision by Shapiro and Stockman Note: Some figures and contents in the lecture notes of Dr. Stockman are used partly.
More informationComputer Vision. Fourier Transform. 20 January Copyright by NHL Hogeschool and Van de Loosdrecht Machine Vision BV All rights reserved
Van de Loosdrecht Machine Vision Computer Vision Fourier Transform 20 January 2017 Copyright 2001 2017 by NHL Hogeschool and Van de Loosdrecht Machine Vision BV All rights reserved j.van.de.loosdrecht@nhl.nl,
More informationME/CS 132: Introduction to Vision-based Robot Navigation! Low-level Image Processing" Larry Matthies"
ME/CS 132: Introduction to Vision-based Robot Navigation! Low-level Image Processing" Larry Matthies" lhm@jpl.nasa.gov, 818-354-3722" Announcements" First homework grading is done! Second homework is due
More informationFilters (cont.) CS 554 Computer Vision Pinar Duygulu Bilkent University
Filters (cont.) CS 554 Computer Vision Pinar Duygulu Bilkent University Today s topics Image Formation Image filters in spatial domain Filter is a mathematical operation of a grid of numbers Smoothing,
More informationFiltering, scale, orientation, localization, and texture. Nuno Vasconcelos ECE Department, UCSD (with thanks to David Forsyth)
Filtering, scale, orientation, localization, and texture Nuno Vasconcelos ECE Department, UCSD (with thanks to David Forsyth) Beyond edges we have talked a lot about edges while they are important, it
More informationWhat is an edge? Paint. Depth discontinuity. Material change. Texture boundary
EDGES AND TEXTURES The slides are from several sources through James Hays (Brown); Srinivasa Narasimhan (CMU); Silvio Savarese (U. of Michigan); Bill Freeman and Antonio Torralba (MIT), including their
More informationCS 558: Computer Vision 3 rd Set of Notes
1 CS 558: Computer Vision 3 rd Set of Notes Instructor: Philippos Mordohai Webpage: www.cs.stevens.edu/~mordohai E-mail: Philippos.Mordohai@stevens.edu Office: Lieb 215 Overview Denoising Based on slides
More informationCS4442/9542b Artificial Intelligence II prof. Olga Veksler
CS4442/9542b Artificial Intelligence II prof. Olga Veksler Lecture 2 Computer Vision Introduction, Filtering Some slides from: D. Jacobs, D. Lowe, S. Seitz, A.Efros, X. Li, R. Fergus, J. Hayes, S. Lazebnik,
More informationBME I5000: Biomedical Imaging
1 Lucas Parra, CCNY BME I5000: Biomedical Imaging Lecture 11 Point Spread Function, Inverse Filtering, Wiener Filtering, Sharpening,... Lucas C. Parra, parra@ccny.cuny.edu Blackboard: http://cityonline.ccny.cuny.edu/
More informationTutorial 5. Jun Xu, Teaching Asistant March 2, COMP4134 Biometrics Authentication
Tutorial 5 Jun Xu, Teaching Asistant nankaimathxujun@gmail.com COMP4134 Biometrics Authentication March 2, 2017 Table of Contents Problems Problem 1: Answer The Questions Problem 2: Indeterminate Region
More informationComputer Vision I. Announcements. Fourier Tansform. Efficient Implementation. Edge and Corner Detection. CSE252A Lecture 13.
Announcements Edge and Corner Detection HW3 assigned CSE252A Lecture 13 Efficient Implementation Both, the Box filter and the Gaussian filter are separable: First convolve each row of input image I with
More informationImage gradients and edges
Image gradients and edges April 7 th, 2015 Yong Jae Lee UC Davis Announcements PS0 due this Friday Questions? 2 Last time Image formation Linear filters and convolution useful for Image smoothing, removing
More informationMultimedia Computing: Algorithms, Systems, and Applications: Edge Detection
Multimedia Computing: Algorithms, Systems, and Applications: Edge Detection By Dr. Yu Cao Department of Computer Science The University of Massachusetts Lowell Lowell, MA 01854, USA Part of the slides
More informationCoE4TN4 Image Processing. Chapter 5 Image Restoration and Reconstruction
CoE4TN4 Image Processing Chapter 5 Image Restoration and Reconstruction Image Restoration Similar to image enhancement, the ultimate goal of restoration techniques is to improve an image Restoration: a
More informationEdge Detection (with a sidelight introduction to linear, associative operators). Images
Images (we will, eventually, come back to imaging geometry. But, now that we know how images come from the world, we will examine operations on images). Edge Detection (with a sidelight introduction to
More informationImage processing. Reading. What is an image? Brian Curless CSE 457 Spring 2017
Reading Jain, Kasturi, Schunck, Machine Vision. McGraw-Hill, 1995. Sections 4.2-4.4, 4.5(intro), 4.5.5, 4.5.6, 5.1-5.4. [online handout] Image processing Brian Curless CSE 457 Spring 2017 1 2 What is an
More informationDigital Signal Processing Lecture Notes 22 November 2010
Digital Signal Processing Lecture otes 22 ovember 2 Topics: Discrete Cosine Transform FFT Linear and Circular Convolution Rate Conversion Includes review of Fourier transforms, properties of Fourier transforms,
More informationImage Filtering, Warping and Sampling
Image Filtering, Warping and Sampling Connelly Barnes CS 4810 University of Virginia Acknowledgement: slides by Jason Lawrence, Misha Kazhdan, Allison Klein, Tom Funkhouser, Adam Finkelstein and David
More information11/28/17. Midterm Review. Magritte, Homesickness. Computational Photography Derek Hoiem, University of Illinois
Midterm Review 11/28/17 Computational Photography Derek Hoiem, University of Illinois Magritte, Homesickness Major Topics Linear Filtering How it works Template and Frequency interpretations Image pyramids
More informationChapter 11 Image Processing
Chapter Image Processing Low-level Image Processing Operates directly on a stored image to improve or enhance it. Stored image consists of a two-dimensional array of pixels (picture elements): Origin (0,
More information