CS 558: Computer Vision 3 rd Set of Notes
|
|
- Erika Cunningham
- 5 years ago
- Views:
Transcription
1 1 CS 558: Computer Vision 3 rd Set of Notes Instructor: Philippos Mordohai Webpage: Philippos.Mordohai@stevens.edu Office: Lieb 215
2 Overview Denoising Based on slides b S. Lazebnik Edge detection Based on slides b S. Lazebnik and D. Hoiem Feature etraction: Corners Based on slides b S. Lazebnik Sampling images Based on slides b D. Hoiem 2
3 Image denoising How can we reduce noise in a photograph?
4 Moving average Let s replace each piel with a weighted average of its neighborhood The weights are called the filter kernel What are the weights for the average of a 33 neighborhood? bo filter Source: D. Lowe
5 Noise Original Impulse noise Salt and pepper noise Gaussian noise Salt and pepper noise: contains random occurrences of black and white piels Impulse noise: contains random occurrences of white piels Gaussian noise: variations in intensit drawn from a Gaussian normal distribution Source: S. Seitz
6 Gaussian noise Mathematical model: sum of man independent factors Good for small standard deviations Assumption: independent, zero-mean noise Source: M. Hebert
7 Reducing Gaussian noise Smoothing with larger standard deviations suppresses noise, but also blurs the image
8 Reducing salt-and-pepper noise What s wrong with the results?
9 Alternative idea: Median filtering A median filter operates over a window b selecting the median intensit in the window Is median filtering linear? Source: K. Grauman
10 Median filter What advantage does median filtering have over Gaussian filtering? Robustness to outliers Source: K. Grauman
11 Median filter Salt-and-pepper noise Median filtered MATLAB: medfilt2(image, [h w]) Source: M. Hebert
12 Gaussian vs. median filtering Gaussian Median
13 Sharpening revisited Source: D. Lowe
14 Sharpening filter Original Sharpening filter - Accentuates differences with local average Source: D. Lowe
15 Sharpening revisited What does blurring take awa? = original smoothed (55) detail Let s add it back: + α = original detail sharpened
16 Edge detection Winter in Kraków photographed b Marcin Rczek
17 Edge detection Goal: Identif sudden changes (discontinuities) in an image Intuitivel, most semantic and shape information from the image can be encoded in the edges More compact than piels Ideal: artist s line drawing (but artist is also using object-level knowledge) Source: D. Lowe
18 Origin of edges Edges are caused b a variet of factors: surface normal discontinuit depth discontinuit surface color discontinuit illumination discontinuit Source: Steve Seitz
19 Wh finding edges is important Group piels into objects or parts Cues for 3D shape Guiding interactive image editing
20 Closeup of edges
21 Closeup of edges
22 Closeup of edges
23 Closeup of edges
24 Edge detection An edge is a place of rapid change in the image intensit function image intensit function (along horizontal scanline) first derivative edges correspond to etrema of derivative
25 Derivatives with convolution For 2D function f(,), the partial derivative is: For discrete data, we can approimate using finite differences: To implement the above as convolution, what would be the associated filter? ), ( ), ( lim ), ( 0 f f f 1 ), ( ) 1, ( ), ( f f f Source: K. Grauman
26 Partial derivatives of an image f (, ) f (, ) or 1-1 Which shows changes with respect to?
27 Finite difference filters Other approimations of derivative filters eist: Source: K. Grauman
28 Image gradient The gradient of an image: The gradient points in the direction of most rapid increase in intensit How does this direction relate to the direction of the edge? The gradient direction is given b The edge strength is given b the gradient magnitude Source: Steve Seitz
29 Intensit Intensit profile Gradient
30 With a little Gaussian noise Gradient
31 Effects of noise Consider a single row or column of the image Where is the edge? Source: S. Seitz
32 Effects of noise Difference filters respond strongl to noise Image noise results in piels that look ver different from their neighbors Generall, the larger the noise the stronger the response What can we do about it? Source: D. Forsth
33 Solution: smooth first f g f * g d d ( f g) To find edges, look for peaks in ( f g) d d Source: S. Seitz
34 Derivative theorem of convolution Differentiation is convolution, and convolution is associative: d d ( f g) f g d d This saves us one operation f d d g f d d g Source: S. Seitz
35 Derivative of Gaussian filters Which one finds horizontal/vertical edges?
36 Derivative of Gaussian filters Are these filters separable?
37 Recall: Separabilit of the Gaussian filter Source: D. Lowe
38 Scale of Gaussian derivative filter 1 piel 3 piels 7 piels Smoothed derivative removes noise, but blurs edge. Also finds edges at different scales Source: D. Forsth
39 Review: Smoothing vs. derivative filters Smoothing filters Gaussian: remove high-frequenc components; low-pass filter Can the values of a smoothing filter be negative? What should the values sum to? One: constant regions are not affected b the filter Derivative filters Derivatives of Gaussian Can the values of a derivative filter be negative? What should the values sum to? Zero: no response in constant regions High absolute value at points of high contrast
40 The Cann edge detector 1. Filter image with derivative of Gaussian 2. Find magnitude and orientation of gradient 3. Non-maimum suppression: Thin wide ridges down to single piel width 4. Linking and thresholding (hsteresis): Define two thresholds: low and high Use the high threshold to start edge curves and the low threshold to continue them
41 The Cann edge detector original image Slide credit: Steve Seitz
42 The Cann edge detector norm of the gradient
43 The Cann edge detector thresholding
44 The Cann edge detector How to turn these thick regions of the gradient into curves? thresholding
45 Non-maimum suppression Check if piel is local maimum along gradient direction, select single ma across width of the edge requires checking interpolated piels p and r Source: D. Forsth
46 Bilinear Interpolation
47 The Cann edge detector Thinning (non-maimum suppression) Problem: piels along this edge didn t survive the thresholding
48 Hsteresis thresholding Use a high threshold to start edge curves, and a low threshold to continue them Source: Steve Seitz
49 Hsteresis thresholding Threshold at low/high levels to get weak/strong edge piels Trace connected components, starting from strong edge piels
50 Recap: Cann edge detector 1. Compute and gradient images 2. Find magnitude and orientation of gradient 3. Non-maimum suppression: Thin wide ridges down to single piel width 4. Linking and thresholding (hsteresis): Define two thresholds: low and high Use the high threshold to start edge curves and the low threshold to continue them MATLAB: edge(image, cann ); J. Cann, A Computational Approach To Edge Detection, IEEE Trans. Pattern Analsis and Machine Intelligence, 8: , 1986.
51 Effect of (Gaussian kernel spread/size) original Cann with Cann with The choice of depends on desired behavior large detects large scale edges small detects fine features Source: S. Seitz
52 Learning to detect boundaries image human segmentation gradient magnitude Berkele segmentation database:
53 pb boundar detector Martin, Fowlkes, Malik 2004: Learning to Detect Natural Image Boundaries on/grouping/papers/mfm-pami-boundar.pdf Figure from Fowlkes
54 pb Boundar Detector Figure from Fowlkes
55 Brightness Color Teture Combined Human
56 Results Pb (0.88) Human (0.95)
57 Results Pb Global Pb (0.88) Pb Human Human (0.96)
58 Human (0.95) Pb (0.63)
59 Pb (0.35) Human (0.90) For more: ision/bsds/bench/html/ color.html
60 Feature etraction: Corners
61 Wh etract features? Motivation: panorama stitching We have two images how do we combine them?
62 Wh etract features? Motivation: panorama stitching We have two images how do we combine them? Step 1: etract features Step 2: match features
63 Wh etract features? Motivation: panorama stitching We have two images how do we combine them? Step 1: etract features Step 2: match features Step 3: align images
64 Characteristics of good features Repeatabilit The same feature can be found in several images despite geometric and photometric transformations Salienc Each feature is distinctive Compactness and efficienc Man fewer features than image piels Localit A feature occupies a relativel small area of the image; robust to clutter and occlusion
65 Applications Feature points are used for: Image alignment 3D reconstruction Motion tracking Robot navigation Indeing and database retrieval Object recognition
66 A hard feature matching problem NASA Mars Rover images
67 Answer below (look for tin colored squares ) NASA Mars Rover images with SIFT feature matches Figure b Noah Snavel
68 Corner Detection: Basic Idea We should easil recognize the point b looking through a small window Shifting a window in an direction should give a large change in intensit flat region: no change in all directions edge : no change along the edge direction corner : significant change in all directions
69 Corner Detection: Mathematics Change in appearance of window W for the shift [u,v]: I(, ) E(u, v) E(3,2) W I v u I v u E ), ( 2 )], ( ), ( [ ), (
70 Corner Detection: Mathematics I(, ) E(u, v) E(0,0) W I v u I v u E ), ( 2 )], ( ), ( [ ), ( Change in appearance of window W for the shift [u,v]:
71 Corner Detection: Mathematics We want to find out how this function behaves for small shifts E(u, v) W I v u I v u E ), ( 2 )], ( ), ( [ ), ( Change in appearance of window W for the shift [u,v]:
72 Corner Detection: Mathematics First-order Talor approimation for small motions [u, v]: Let s plug this into E(u,v): v I u I I v u I ), ( ), ( W W W W v I uv I I u I v I u I I v I u I I I v u I v u E ), ( ), ( 2 ), ( 2 ), ( 2 2 ] [ )], ( ), ( [ )], ( ), ( [ ), (
73 Corner Detection: Mathematics The quadratic approimation can be written as where M is a second moment matri computed from image derivatives: v u M v u v u E ), ( I I I I I I M, 2,,, 2 (the sums are over all the piels in the window W)
74 The surface E(u,v) is locall approimated b a quadratic form. Let s tr to understand its shape. Specificall, in which directions does it have the smallest/greatest change? Interpreting the second moment matri v u M v u v u E ] [ ), ( E(u, v) I I I I I I M, 2,,, 2
75 First, consider the ais-aligned case (gradients are either horizontal or vertical) If either a or b is close to 0, then this is not a corner, so look for locations where both are large. b a 0 0 I I I I I I M, 2,,, 2 Interpreting the second moment matri
76 Interpreting the second moment matri Consider a horizontal slice of E(u, v): [ u v] M u const v This is the equation of an ellipse.
77 Interpreting the second moment matri Consider a horizontal slice of E(u, v): This is the equation of an ellipse. [ u v] M u v Diagonalization of M: M R R 0 2 The ais lengths of the ellipse are determined b the eigenvalues and the orientation is determined b R direction of the fastest change direction of the slowest change const ( ma ) -1/2 ( min ) -1/2
78 Quick Eigenvalue/Eigenvector Review The eigenvectors of a matri A are the vectors that satisf: The scalar is the eigenvalue corresponding to The eigenvalues are found b solving: In our case, A = H is a 22 matri, so we have The solution: Once ou know, ou find b solving
79 Visualization of second moment matrices
80 Visualization of second moment matrices
81 Interpreting the eigenvalues Classification of image points using eigenvalues of M: 2 Edge 2 >> 1 Corner 1 and 2 are large, 1 2 ; E increases in all directions 1 and 2 are small; E is almost constant in all directions Flat region Edge 1 >> 2 1
82 Corner response function R det( M ) trace( M ) ( ) α: constant (0.04 to 0.06) Edge R < 0 Corner R > 0 Flat region R small Edge R < 0
83 The Harris corner detector 1. Compute partial derivatives at each piel 2. Compute second moment matri M in a Gaussian window around each piel: C.Harris and M.Stephens. A Combined Corner and Edge Detector. Proceedings of the 4th Alve Vision Conference: pages , I w I I w I I w I w M, 2,,, 2 ), ( ), ( ), ( ), (
84 The Harris corner detector 1. Compute partial derivatives at each piel 2. Compute second moment matri M in a Gaussian window around each piel 3. Compute corner response function R
85 Harris Detector: Steps
86 Harris Detector: Steps Compute corner response R
87 The Harris corner detector 1. Compute partial derivatives at each piel 2. Compute second moment matri M in a Gaussian window around each piel 3. Compute corner response function R 4. Threshold R 5. Find local maima of response function (non-maimum suppression)
88 Harris Detector: Steps Find points with large corner response: R > threshold
89 Harris Detector: Steps Take onl the points of local maima of R
90 Harris Detector: Steps
91 Invariance and covariance We want corner locations to be invarian to photometric transformations and covarian to geometric transformations Invariance: image is transformed and corner locations do not change Covariance: if we have two transformed versions of the same image, features should be detected in corresponding locations
92 Intensit changes I a I + b Onl derivatives are used => invariance to intensit shift I I + b Intensit scaling: I a I R threshold R (image coordinate) (image coordinate) Partiall invariant to affine intensit change
93 Image translation Derivatives and window function are shift-invariant Corner location is covariant w.r.t. translation
94 Image rotation Second moment ellipse rotates but its shape (i.e. eigenvalues) remains the same Corner location is covariant w.r.t. rotation
95 Scaling Corner All points will be classified as edges Corner location is not covariant to scaling!
96 Sampling Wh does a lower resolution image still make sense to us? What do we lose? Image:
97 Subsampling b a factor of 2 Throw awa ever other row and column to create a 1/2 size image
98 Aliasing problem 1D eample (sinewave): Source: S. Marschner
99 Aliasing problem 1D eample (sinewave): Source: S. Marschner
100 Aliasing problem Sub-sampling ma be dangerous. Characteristic errors ma appear: Wagon wheels rolling the wrong wa in movies Checkerboards disintegrate in ra tracing Striped shirts look funn on color television Source: D. Forsth
101 Aliasing in video Slide b Steve Seitz
102 Aliasing in graphics Source: A. Efros
103 Sampling and aliasing
104 Nquist-Shannon Sampling Theorem When sampling a signal at discrete intervals, the sampling frequenc must be 2 f ma f ma = ma frequenc of the input signal This will allows to reconstruct the original perfectl from the sampled version v v v good bad
105 Anti-aliasing Solutions: Sample more often Get rid of all frequencies that are greater than half the new sampling frequenc Will lose information But it s better than aliasing Appl a smoothing filter
106 Algorithm for downsampling b factor of 2 1. Start with image(h, w) 2. Appl low pass filter im_blur = imfilter(image, fspecial( gaussian, 7, 1)) 3. Sample ever other piel im_small = im_blur(1:2:end, 1:2:end);
107 Anti-aliasing Forsth and Ponce 2002
108 Subsampling without pre-filtering 1/2 1/4 (2 zoom) 1/8 (4 zoom) Slide b Steve Seitz
109 Subsampling with Gaussian pre-filtering Gaussian 1/2 G 1/4 G 1/8 Slide b Steve Seitz
110 Slide Credits This set of sides contains contributions kindl made available b the following authors Svetlana Lazebnik Aleei Efros Li Fei-Fei Kristen Grauman Martial Hebert Derek Hoiem David Lowe Steve Marschner David Forsth Steve Seitz Richard Szeliski
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 informationEdge and corner detection
Edge and corner detection Prof. Stricker Doz. G. Bleser Computer Vision: Object and People Tracking Goals Where is the information in an image? How is an object characterized? How can I find measurements
More informationWikipedia - Mysid
Wikipedia - Mysid Erik Brynjolfsson, MIT Filtering Edges Corners Feature points Also called interest points, key points, etc. Often described as local features. Szeliski 4.1 Slides from Rick Szeliski,
More informationEdge detection. Winter in Kraków photographed by Marcin Ryczek
Edge detection Winter in Kraków photographed by Marcin Ryczek Edge detection Goal: Identify sudden changes (discontinuities) in an image Intuitively, most semantic and shape information from the image
More informationEdge detection. Goal: Identify sudden. an image. Ideal: artist s line drawing. object-level knowledge)
Edge detection Goal: Identify sudden changes (discontinuities) in an image Intuitively, most semantic and shape information from the image can be encoded in the edges More compact than pixels Ideal: artist
More informationCS5670: Computer Vision
CS5670: Computer Vision Noah Snavely Lecture 4: Harris corner detection Szeliski: 4.1 Reading Announcements Project 1 (Hybrid Images) code due next Wednesday, Feb 14, by 11:59pm Artifacts due Friday, Feb
More informationEdge detection. Winter in Kraków photographed by Marcin Ryczek
Edge detection Winter in Kraków photographed by Marcin Ryczek Edge detection Goal: Identify sudden changes (discontinuities) in an image Intuitively, edges carry most of the semantic and shape information
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 informationEdge Detection CSC 767
Edge Detection CSC 767 Edge detection Goal: Identify sudden changes (discontinuities) in an image Most semantic and shape information from the image can be encoded in the edges More compact than pixels
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 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 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 informationFeature extraction: Corners Harris Corners Pkwy, Charlotte, NC
Featre etraction: Corners 9300 Harris Corners Pkw Charlotte NC Wh etract featres? Motiation: panorama stitching We hae two images how do we combine them? Wh etract featres? Motiation: panorama stitching
More informationEdge Detection. Computer Vision Shiv Ram Dubey, IIIT Sri City
Edge Detection Computer Vision Shiv Ram Dubey, IIIT Sri City Previous two classes: Image Filtering Spatial domain Smoothing, sharpening, measuring texture * = FFT FFT Inverse FFT = Frequency domain Denoising,
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 informationEdges and Binary Images
CS 699: Intro to Computer Vision Edges and Binary Images Prof. Adriana Kovashka University of Pittsburgh September 5, 205 Plan for today Edge detection Binary image analysis Homework Due on 9/22, :59pm
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 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 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 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 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 informationImage Features. Work on project 1. All is Vanity, by C. Allan Gilbert,
Image Features Work on project 1 All is Vanity, by C. Allan Gilbert, 1873-1929 Feature extrac*on: Corners and blobs c Mo*va*on: Automa*c panoramas Credit: Ma9 Brown Why extract features? Mo*va*on: panorama
More informationSolution: filter the image, then subsample F 1 F 2. subsample blur subsample. blur
Pyramids 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 { Gaussian pyramid blur F 0 subsample blur subsample * F 0 H F 1 F 1
More informationAutomatic Image Alignment (feature-based)
Automatic Image Alignment (feature-based) Mike Nese with a lot of slides stolen from Steve Seitz and Rick Szeliski 15-463: Computational Photography Alexei Efros, CMU, Fall 2006 Today s lecture Feature
More informationProf. Feng Liu. Spring /26/2017
Prof. Feng Liu Spring 2017 http://www.cs.pdx.edu/~fliu/courses/cs510/ 04/26/2017 Last Time Re-lighting HDR 2 Today Panorama Overview Feature detection Mid-term project presentation Not real mid-term 6
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 informationMidterm Wed. Local features: detection and description. Today. Last time. Local features: main components. Goal: interest operator repeatability
Midterm Wed. Local features: detection and description Monday March 7 Prof. UT Austin Covers material up until 3/1 Solutions to practice eam handed out today Bring a 8.5 11 sheet of notes if you want Review
More informationComputer Vision Lecture 20
Computer Vision Lecture 2 Motion and Optical Flow Bastian Leibe RWTH Aachen http://www.vision.rwth-aachen.de leibe@vision.rwth-aachen.de 28.1.216 Man slides adapted from K. Grauman, S. Seitz, R. Szeliski,
More informationEdge Detection. CSC320: Introduction to Visual Computing Michael Guerzhoy. René Magritte, Decalcomania. Many slides from Derek Hoiem, Robert Collins
Edge Detection René Magritte, Decalcomania Many slides from Derek Hoiem, Robert Collins CSC320: Introduction to Visual Computing Michael Guerzhoy Discontinuities in Intensity Source: Robert Collins Origin
More informationCS5670: Computer Vision
CS5670: Computer Vision Noah Snavely Lecture 2: Edge detection From Sandlot Science Announcements Project 1 (Hybrid Images) is now on the course webpage (see Projects link) Due Wednesday, Feb 15, by 11:59pm
More informationHarder case. Image matching. Even harder case. Harder still? by Diva Sian. by swashford
Image matching Harder case by Diva Sian by Diva Sian by scgbt by swashford Even harder case Harder still? How the Afghan Girl was Identified by Her Iris Patterns Read the story NASA Mars Rover images Answer
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 informationHarder case. Image matching. Even harder case. Harder still? by Diva Sian. by swashford
Image matching Harder case by Diva Sian by Diva Sian by scgbt by swashford Even harder case Harder still? How the Afghan Girl was Identified by Her Iris Patterns Read the story NASA Mars Rover images Answer
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 informationLocal Feature Detectors
Local Feature Detectors Selim Aksoy Department of Computer Engineering Bilkent University saksoy@cs.bilkent.edu.tr Slides adapted from Cordelia Schmid and David Lowe, CVPR 2003 Tutorial, Matthew Brown,
More informationCS 2770: Computer Vision. Edges and Segments. Prof. Adriana Kovashka University of Pittsburgh February 21, 2017
CS 2770: Computer Vision Edges and Segments Prof. Adriana Kovashka University of Pittsburgh February 21, 2017 Edges vs Segments Figure adapted from J. Hays Edges vs Segments Edges More low-level Don t
More informationImage matching. Announcements. Harder case. Even harder case. Project 1 Out today Help session at the end of class. by Diva Sian.
Announcements Project 1 Out today Help session at the end of class Image matching by Diva Sian by swashford Harder case Even harder case How the Afghan Girl was Identified by Her Iris Patterns Read the
More informationBSB663 Image Processing Pinar Duygulu. Slides are adapted from Selim Aksoy
BSB663 Image Processing Pinar Duygulu Slides are adapted from Selim Aksoy Image matching Image matching is a fundamental aspect of many problems in computer vision. Object or scene recognition Solving
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 information2%34 #5 +,,% ! # %& ()% #% +,,%. & /%0%)( 1 ! # %& % %()# +(& ,.+/ +&0%//#/ &
! # %& ()% #% +,,%. & /%0%)( 1 2%34 #5 +,,%! # %& % %()# +(&,.+/ +&0%//#/ & & Many slides in this lecture are due to other authors; they are credited on the bottom right Topics of This Lecture Problem
More informationLocal Image preprocessing (cont d)
Local Image preprocessing (cont d) 1 Outline - Edge detectors - Corner detectors - Reading: textbook 5.3.1-5.3.5 and 5.3.10 2 What are edges? Edges correspond to relevant features in the image. An edge
More informationScale Invariant Feature Transform (SIFT) CS 763 Ajit Rajwade
Scale Invariant Feature Transform (SIFT) CS 763 Ajit Rajwade What is SIFT? It is a technique for detecting salient stable feature points in an image. For ever such point it also provides a set of features
More informationLocal features: detection and description. Local invariant features
Local features: detection and description Local invariant features Detection of interest points Harris corner detection Scale invariant blob detection: LoG Description of local patches SIFT : Histograms
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 informationImage gradients and edges
Image gradients and edges Thurs Sept 3 Prof. Kristen Grauman UT-Austin Last time Various models for image noise Linear filters and convolution useful for Image smoothing, remov ing noise Box filter Gaussian
More informationEdge Detection. CSE 576 Ali Farhadi. Many slides from Steve Seitz and Larry Zitnick
Edge Detection CSE 576 Ali Farhadi Many slides from Steve Seitz and Larry Zitnick Edge Attneave's Cat (1954) Origin of edges surface normal discontinuity depth discontinuity surface color discontinuity
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 informationCS4670: Computer Vision Noah Snavely
CS4670: Computer Vision Noah Snavely Lecture 2: Edge detection From Sandlot Science Announcements Project 1 released, due Friday, September 7 1 Edge detection Convert a 2D image into a set of curves Extracts
More informationLocal invariant features
Local invariant features Tuesday, Oct 28 Kristen Grauman UT-Austin Today Some more Pset 2 results Pset 2 returned, pick up solutions Pset 3 is posted, due 11/11 Local invariant features Detection of interest
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 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 informationMotion Estimation and Optical Flow Tracking
Image Matching Image Retrieval Object Recognition Motion Estimation and Optical Flow Tracking Example: Mosiacing (Panorama) M. Brown and D. G. Lowe. Recognising Panoramas. ICCV 2003 Example 3D Reconstruction
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 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 informationVisual motion. Many slides adapted from S. Seitz, R. Szeliski, M. Pollefeys
Visual motion Man slides adapted from S. Seitz, R. Szeliski, M. Pollefes Motion and perceptual organization Sometimes, motion is the onl cue Motion and perceptual organization Sometimes, motion is the
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 informationLocal features and image matching. Prof. Xin Yang HUST
Local features and image matching Prof. Xin Yang HUST Last time RANSAC for robust geometric transformation estimation Translation, Affine, Homography Image warping Given a 2D transformation T and a source
More informationFeature Based Registration - Image Alignment
Feature Based Registration - Image Alignment Image Registration Image registration is the process of estimating an optimal transformation between two or more images. Many slides from Alexei Efros http://graphics.cs.cmu.edu/courses/15-463/2007_fall/463.html
More informationCS 4495 Computer Vision A. Bobick. CS 4495 Computer Vision. Features 2 SIFT descriptor. Aaron Bobick School of Interactive Computing
CS 4495 Computer Vision Features 2 SIFT descriptor Aaron Bobick School of Interactive Computing Administrivia PS 3: Out due Oct 6 th. Features recap: Goal is to find corresponding locations in two images.
More informationBias-Variance Trade-off (cont d) + Image Representations
CS 275: Machine Learning Bias-Variance Trade-off (cont d) + Image Representations Prof. Adriana Kovashka University of Pittsburgh January 2, 26 Announcement Homework now due Feb. Generalization Training
More informationImage Analysis. Edge Detection
Image Analysis Edge Detection Christophoros Nikou cnikou@cs.uoi.gr Images taken from: Computer Vision course by Kristen Grauman, University of Texas at Austin (http://www.cs.utexas.edu/~grauman/courses/spring2011/index.html).
More informationSchool of Computing University of Utah
School of Computing University of Utah Presentation Outline 1 2 3 4 Main paper to be discussed David G. Lowe, Distinctive Image Features from Scale-Invariant Keypoints, IJCV, 2004. How to find useful keypoints?
More informationCS 558: Computer Vision 4 th Set of Notes
1 CS 558: Computer Vision 4 th Set of Notes Instructor: Philippos Mordohai Webpage: www.cs.stevens.edu/~mordohai E-mail: Philippos.Mordohai@stevens.edu Office: Lieb 215 Overview Keypoint matching Hessian
More informationKey properties of local features
Key properties of local features Locality, robust against occlusions Must be highly distinctive, a good feature should allow for correct object identification with low probability of mismatch Easy to etract
More informationLecture: RANSAC and feature detectors
Lecture: RANSAC and feature detectors Juan Carlos Niebles and Ranjay Krishna Stanford Vision and Learning Lab 1 What we will learn today? A model fitting method for edge detection RANSAC Local invariant
More informationSIFT: SCALE INVARIANT FEATURE TRANSFORM SURF: SPEEDED UP ROBUST FEATURES BASHAR ALSADIK EOS DEPT. TOPMAP M13 3D GEOINFORMATION FROM IMAGES 2014
SIFT: SCALE INVARIANT FEATURE TRANSFORM SURF: SPEEDED UP ROBUST FEATURES BASHAR ALSADIK EOS DEPT. TOPMAP M13 3D GEOINFORMATION FROM IMAGES 2014 SIFT SIFT: Scale Invariant Feature Transform; transform image
More informationLecture 7: Most Common Edge Detectors
#1 Lecture 7: Most Common Edge Detectors Saad Bedros sbedros@umn.edu Edge Detection Goal: Identify sudden changes (discontinuities) in an image Intuitively, most semantic and shape information from the
More informationWhy is computer vision difficult?
Why is computer vision difficult? Viewpoint variation Illumination Scale Why is computer vision difficult? Intra-class variation Motion (Source: S. Lazebnik) Background clutter Occlusion Challenges: local
More informationLecture 6: Finding Features (part 1/2)
Lecture 6: Finding Features (part 1/2) Dr. Juan Carlos Niebles Stanford AI Lab Professor Stanford Vision Lab 1 What we will learn today? Local invariant features MoOvaOon Requirements, invariances Keypoint
More informationCEE598 - Visual Sensing for Civil Infrastructure Eng. & Mgmt.
CEE598 - Visual Sensing for Civil Infrastructure Eng. & Mgmt. Section 10 - Detectors part II Descriptors Mani Golparvar-Fard Department of Civil and Environmental Engineering 3129D, Newmark Civil Engineering
More informationHow and what do we see? Segmentation and Grouping. Fundamental Problems. Polyhedral objects. Reducing the combinatorics of pose estimation
Segmentation and Grouping Fundamental Problems ' Focus of attention, or grouping ' What subsets of piels do we consider as possible objects? ' All connected subsets? ' Representation ' How do we model
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 informationCS 2770: Intro to Computer Vision. Multiple Views. Prof. Adriana Kovashka University of Pittsburgh March 14, 2017
CS 277: Intro to Computer Vision Multiple Views Prof. Adriana Kovashka Universit of Pittsburgh March 4, 27 Plan for toda Affine and projective image transformations Homographies and image mosaics Stereo
More informationPhoto by Carl Warner
Photo b Carl Warner Photo b Carl Warner Photo b Carl Warner Fitting and Alignment Szeliski 6. Computer Vision CS 43, Brown James Has Acknowledgment: Man slides from Derek Hoiem and Grauman&Leibe 2008 AAAI
More informationEECS 556 Image Processing W 09
EECS 556 Image Processing W 09 Motion estimation Global vs. Local Motion Block Motion Estimation Optical Flow Estimation (normal equation) Man slides of this lecture are courtes of prof Milanfar (UCSC)
More informationLecture 4: Finding lines: from detection to model fitting
Lecture 4: Finding lines: from detection to model fitting Professor Fei Fei Li Stanford Vision Lab 1 What we will learn today Edge detection Canny edge detector Line fitting Hough Transform RANSAC (Problem
More informationImage Analysis. Edge Detection
Image Analysis Edge Detection Christophoros Nikou cnikou@cs.uoi.gr Images taken from: Computer Vision course by Kristen Grauman, University of Texas at Austin (http://www.cs.utexas.edu/~grauman/courses/spring2011/index.html).
More informationLocal Features: Detection, Description & Matching
Local Features: Detection, Description & Matching Lecture 08 Computer Vision Material Citations Dr George Stockman Professor Emeritus, Michigan State University Dr David Lowe Professor, University of British
More informationEdge Detection. Today s reading. Cipolla & Gee on edge detection (available online) From Sandlot Science
Edge Detection From Sandlot Science Today s reading Cipolla & Gee on edge detection (available online) Project 1a assigned last Friday due this Friday Last time: Cross-correlation Let be the image, be
More informationOther Linear Filters CS 211A
Other Linear Filters CS 211A Slides from Cornelia Fermüller and Marc Pollefeys Edge detection Convert a 2D image into a set of curves Extracts salient features of the scene More compact than pixels Origin
More informationCS534: Introduction to Computer Vision Edges and Contours. Ahmed Elgammal Dept. of Computer Science Rutgers University
CS534: Introduction to Computer Vision Edges and Contours Ahmed Elgammal Dept. of Computer Science Rutgers University Outlines What makes an edge? Gradient-based edge detection Edge Operators Laplacian
More informationLocal features: detection and description May 12 th, 2015
Local features: detection and description May 12 th, 2015 Yong Jae Lee UC Davis Announcements PS1 grades up on SmartSite PS1 stats: Mean: 83.26 Standard Dev: 28.51 PS2 deadline extended to Saturday, 11:59
More informationCS334: Digital Imaging and Multimedia Edges and Contours. Ahmed Elgammal Dept. of Computer Science Rutgers University
CS334: Digital Imaging and Multimedia Edges and Contours Ahmed Elgammal Dept. of Computer Science Rutgers University Outlines What makes an edge? Gradient-based edge detection Edge Operators From Edges
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 informationComputer Vision for HCI. Topics of This Lecture
Computer Vision for HCI Interest Points Topics of This Lecture Local Invariant Features Motivation Requirements, Invariances Keypoint Localization Features from Accelerated Segment Test (FAST) Harris Shi-Tomasi
More informationEdges and Binary Image Analysis April 12 th, 2018
4/2/208 Edges and Binary Image Analysis April 2 th, 208 Yong Jae Lee UC Davis Previously Filters allow local image neighborhood to influence our description and features Smoothing to reduce noise Derivatives
More informationFeature Tracking and Optical Flow
Feature Tracking and Optical Flow Prof. D. Stricker Doz. G. Bleser Many slides adapted from James Hays, Derek Hoeim, Lana Lazebnik, Silvio Saverse, who 1 in turn adapted slides from Steve Seitz, Rick Szeliski,
More informationLocal Image Features
Local Image Features Computer Vision Read Szeliski 4.1 James Hays Acknowledgment: Many slides from Derek Hoiem and Grauman&Leibe 2008 AAAI Tutorial Flashed Face Distortion 2nd Place in the 8th Annual Best
More informationLocal Image Features
Local Image Features Computer Vision CS 143, Brown Read Szeliski 4.1 James Hays Acknowledgment: Many slides from Derek Hoiem and Grauman&Leibe 2008 AAAI Tutorial This section: correspondence and alignment
More informationCS4670: Computer Vision
CS4670: Computer Vision Noah Snavely Lecture 6: Feature matching and alignment Szeliski: Chapter 6.1 Reading Last time: Corners and blobs Scale-space blob detector: Example Feature descriptors We know
More informationAn edge is not a line... Edge Detection. Finding lines in an image. Finding lines in an image. How can we detect lines?
Edge Detection An edge is not a line... original image Cann edge detector Compute image derivatives if gradient magnitude > τ and the value is a local maimum along gradient direction piel is an edge candidate
More informationComputer Vision I - Filtering and Feature detection
Computer Vision I - Filtering and Feature detection Carsten Rother 30/10/2015 Computer Vision I: Basics of Image Processing Roadmap: Basics of Digital Image Processing Computer Vision I: Basics of Image
More informationComputer Vision I - Basics of Image Processing Part 2
Computer Vision I - Basics of Image Processing Part 2 Carsten Rother 07/11/2014 Computer Vision I: Basics of Image Processing Roadmap: Basics of Digital Image Processing Computer Vision I: Basics of Image
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 informationAutomatic Image Alignment
Automatic Image Alignment with a lot of slides stolen from Steve Seitz and Rick Szeliski Mike Nese CS194: Image Manipulation & Computational Photography Alexei Efros, UC Berkeley, Fall 2018 Live Homography
More informationThe SIFT (Scale Invariant Feature
The SIFT (Scale Invariant Feature Transform) Detector and Descriptor developed by David Lowe University of British Columbia Initial paper ICCV 1999 Newer journal paper IJCV 2004 Review: Matt Brown s Canonical
More information[ ] Review. Edges and Binary Images. Edge detection. Derivative of Gaussian filter. Image gradient. Tuesday, Sept 16
Review Edges and Binary Images Tuesday, Sept 6 Thought question: how could we compute a temporal gradient from video data? What filter is likely to have produced this image output? original filtered output
More informationMotion illusion, rotating snakes
Motion illusion, rotating snakes Local features: main components 1) Detection: Find a set of distinctive key points. 2) Description: Extract feature descriptor around each interest point as vector. x 1
More informationFeature descriptors. Alain Pagani Prof. Didier Stricker. Computer Vision: Object and People Tracking
Feature descriptors Alain Pagani Prof. Didier Stricker Computer Vision: Object and People Tracking 1 Overview Previous lectures: Feature extraction Today: Gradiant/edge Points (Kanade-Tomasi + Harris)
More informationCS4442/9542b Artificial Intelligence II prof. Olga Veksler
CS4442/9542b Artificial Intelligence II prof. Olga Veksler Lecture 8 Computer Vision Introduction, Filtering Some slides from: D. Jacobs, D. Lowe, S. Seitz, A.Efros, X. Li, R. Fergus, J. Hayes, S. Lazebnik,
More information