3D Vision Interest Points.

Slides:



Advertisements
Similar presentations
Feature extraction: Corners
Advertisements

Feature Detection. Description Localization More Points Robust to occlusion Works with less texture More Repeatable Robust detection Precise localization.
Summary of Friday A homography transforms one 3d plane to another 3d plane, under perspective projections. Those planes can be camera imaging planes or.
CSE 473/573 Computer Vision and Image Processing (CVIP)
Interest points CSE P 576 Ali Farhadi Many slides from Steve Seitz, Larry Zitnick.
TP14 - Local features: detection and description Computer Vision, FCUP, 2014 Miguel Coimbra Slides by Prof. Kristen Grauman.
Matching with Invariant Features
Computational Photography
Invariant Features.
Algorithms and Applications in Computer Vision
Feature extraction: Corners 9300 Harris Corners Pkwy, Charlotte, NC.
Harris corner detector
Lecture 6: Feature matching CS4670: Computer Vision Noah Snavely.
(1) Feature-point matching by D.J.Duff for CompVis Online: Feature Point Matching Detection,
Lecture 4: Feature matching
Automatic Image Alignment (feature-based) : Computational Photography Alexei Efros, CMU, Fall 2005 with a lot of slides stolen from Steve Seitz and.
Feature extraction: Corners and blobs
Interest Points and Corners Computer Vision CS 143, Brown James Hays Slides from Rick Szeliski, Svetlana Lazebnik, Derek Hoiem and Grauman&Leibe 2008 AAAI.
Detecting Patterns So far Specific patterns (eyes) Generally useful patterns (edges) Also (new) “Interesting” distinctive patterns ( No specific pattern:
Blob detection.
Lecture 3a: Feature detection and matching CS6670: Computer Vision Noah Snavely.
Automatic Image Alignment (feature-based) : Computational Photography Alexei Efros, CMU, Fall 2006 with a lot of slides stolen from Steve Seitz and.
1 Image Features Hao Jiang Sept Image Matching 2.
CS4670: Computer Vision Kavita Bala Lecture 7: Harris Corner Detection.
CS4670: Computer Vision Kavita Bala Lecture 8: Scale invariance.
Scale-Invariant Feature Transform (SIFT) Jinxiang Chai.
1 Interest Operators Find “interesting” pieces of the image Multiple possible uses –image matching stereo pairs tracking in videos creating panoramas –object.
Summary of Previous Lecture A homography transforms one 3d plane to another 3d plane, under perspective projections. Those planes can be camera imaging.
Feature matching Digital Visual Effects, Spring 2005 Yung-Yu Chuang 2005/3/16 with slides by Trevor Darrell Cordelia Schmid, David Lowe, Darya Frolova,
CS 558 C OMPUTER V ISION Lecture VII: Corner and Blob Detection Slides adapted from S. Lazebnik.
Lecture 06 06/12/2011 Shai Avidan הבהרה: החומר המחייב הוא החומר הנלמד בכיתה ולא זה המופיע / לא מופיע במצגת.
CSE 185 Introduction to Computer Vision Local Invariant Features.
Feature extraction: Corners 9300 Harris Corners Pkwy, Charlotte, NC.
776 Computer Vision Jan-Michael Frahm, Enrique Dunn Spring 2013.
Local invariant features 1 Thursday October 3 rd 2013 Neelima Chavali Virginia Tech.
Lecture 7: Features Part 2 CS4670/5670: Computer Vision Noah Snavely.
Notes on the Harris Detector
Harris Corner Detector & Scale Invariant Feature Transform (SIFT)
Features Digital Visual Effects, Spring 2006 Yung-Yu Chuang 2006/3/15 with slides by Trevor Darrell Cordelia Schmid, David Lowe, Darya Frolova, Denis Simakov,
Feature extraction: Corners and blobs. Why extract features? Motivation: panorama stitching We have two images – how do we combine them?
Local features and image matching October 1 st 2015 Devi Parikh Virginia Tech Disclaimer: Many slides have been borrowed from Kristen Grauman, who may.
Features Jan-Michael Frahm.
Lecture 9 Feature Extraction and Motion Estimation Slides by: Michael Black Clark F. Olson Jean Ponce.
CS654: Digital Image Analysis
Instructor: Mircea Nicolescu Lecture 10 CS 485 / 685 Computer Vision.
CSE 185 Introduction to Computer Vision Local Invariant Features.
Lecture 10: Harris Corner Detector CS4670/5670: Computer Vision Kavita Bala.
Keypoint extraction: Corners 9300 Harris Corners Pkwy, Charlotte, NC.
Blob detection.
Invariant Local Features Image content is transformed into local feature coordinates that are invariant to translation, rotation, scale, and other imaging.
SIFT Scale-Invariant Feature Transform David Lowe
MAN-522: Computer Vision Edge detection Feature and blob detection
Interest Points EE/CSE 576 Linda Shapiro.
Distinctive Image Features from Scale-Invariant Keypoints
EE465: Introduction to Digital Image Processing Copyright Xin Li'2003
Corners and interest points
Source: D. Lowe, L. Fei-Fei Recap: edge detection Source: D. Lowe, L. Fei-Fei.
Lecture 4: Harris corner detection
Digital Visual Effects, Spring 2006 Yung-Yu Chuang 2006/3/22
Interest Points and Harris Corner Detector
Local features and image matching
SIFT keypoint detection
Digital Visual Effects, Spring 2008 Yung-Yu Chuang 2008/3/18
Lecture VI: Corner and Blob Detection
Lecture 5: Feature invariance
Lecture 5: Feature invariance
Corner Detection COMP 4900C Winter 2008.
Presentation transcript:

3D Vision Interest Points

correspondence and alignment Correspondence: matching points, patches, edges, or regions across images ≈

correspondence and alignment Alignment: solving the transformation that makes two things match better T

Example: estimating “fundamental matrix” that corresponds two views

Example: tracking points frame 0 frame 22 frame 49 Your problem 1 for HW 2!

Human eye movements Your eyes don’t see everything at once, but they jump around. You see only about 2 degrees with high resolution

Human eye movements

Interest points original Suppose you have to click on some point, go away and come back after I deform the image, and click on the same points again. Which points would you choose? deformed

Overview of Keypoint Matching 1. Find a set of distinctive key- points 2. Define a region around each keypoint A1 A2 A3 B1 B2 B3 3. Extract and normalize the region content 4. Compute a local descriptor from the normalized region 5. Match local descriptors

Goals for Keypoints Detect points that are repeatable and distinctive

Choosing interest points Where would you tell your friend to meet you? Corners!

Moravec corner detector (1980) We should easily recognize the point by looking through a small window Shifting a window in any direction should give a large change in intensity

Moravec corner detector flat

Moravec corner detector flat

Moravec corner detector flat edge

Moravec corner detector isolated point flat edge

Moravec corner detector Change of intensity for the shift [u,v]: Intensity Window function Shifted intensity Four shifts: (u,v) = (1,0), (1,1), (0,1), (-1, 1) Look for local maxima in min{E}

Problems of Moravec detector Noisy response due to a binary window function Only a set of shifts at every 45 degree is considered Responds too strong for edges because only minimum of E is taken into account Harris corner detector (1988) solves these problems.

Harris corner detector Noisy response due to a binary window function Use a Gaussian function

Harris corner detector Only a set of shifts at every 45 degree is considered Consider all small shifts by Taylor’s expansion

Harris corner detector Equivalently, for small shifts [u,v] we have a bilinear approximation: , where M is a 22 matrix computed from image derivatives:

Harris corner detector Responds too strong for edges because only minimum of E is taken into account A new corner measurement

Harris corner detector Intensity change in shifting window: eigenvalue analysis 1, 2 – eigenvalues of M direction of the fastest change Ellipse E(u,v) = const direction of the slowest change (max)-1/2 (min)-1/2

Harris corner detector 2 edge 2 >> 1 Classification of image points using eigenvalues of M: 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 edge 1 >> 2 flat 1

Harris corner detector Measure of corner response: (k – empirical constant, k = 0.04-0.06)

Another view

Another view

Another view

Harris corner detector (input)

Corner response R

Threshold on R

Local maximum of R

Harris corner detector

Harris Detector: Summary Average intensity change in direction [u,v] can be expressed as a bilinear form: Describe a point in terms of eigenvalues of M: measure of corner response A good (corner) point should have a large intensity change in all directions, i.e. R should be large positive

Harris Detector: Some Properties Partial invariance to affine intensity change Only derivatives are used => invariance to intensity shift I  I + b Intensity scale: I  a I R x (image coordinate) threshold

Harris Detector: Some Properties Rotation invariance Ellipse rotates but its shape (i.e. eigenvalues) remains the same Corner response R is invariant to image rotation

Harris Detector is rotation invariant Repeatability rate: # correspondences # possible correspondences

Harris Detector: Some Properties But: non-invariant to image scale! All points will be classified as edges Corner !

Harris Detector: Some Properties Quality of Harris detector for different scale changes Repeatability rate: # correspondences # possible correspondences