Lecture 8: Feature matching CS6670: Computer Vision Noah Snavely.

Slides:



Advertisements
Similar presentations
Feature Detection. Description Localization More Points Robust to occlusion Works with less texture More Repeatable Robust detection Precise localization.
Advertisements

Feature matching “What stuff in the left image matches with stuff on the right?” Necessary for automatic panorama stitching (Part of Project 4!) Slides.
Presented by Xinyu Chang
CSE 473/573 Computer Vision and Image Processing (CVIP)
TP14 - Local features: detection and description Computer Vision, FCUP, 2014 Miguel Coimbra Slides by Prof. Kristen Grauman.
Object Recognition using Invariant Local Features Applications l Mobile robots, driver assistance l Cell phone location or object recognition l Panoramas,
Instructor: Mircea Nicolescu Lecture 15 CS 485 / 685 Computer Vision.
IBBT – Ugent – Telin – IPI Dimitri Van Cauwelaert A study of the 2D - SIFT algorithm Dimitri Van Cauwelaert.
Object Recognition with Invariant Features n Definition: Identify objects or scenes and determine their pose and model parameters n Applications l Industrial.
Fast High-Dimensional Feature Matching for Object Recognition David Lowe Computer Science Department University of British Columbia.
Patch Descriptors CSE P 576 Larry Zitnick
CS4670: Computer Vision Kavita Bala Lecture 10: Feature Matching and Transforms.
Feature extraction: Corners 9300 Harris Corners Pkwy, Charlotte, NC.
Lecture 6: Feature matching CS4670: Computer Vision Noah Snavely.
Affine Linear Transformations Prof. Graeme Bailey (notes modified from Noah Snavely, Spring 2009)
Lecture 4: Feature matching
Multi-Class Object Recognition Using Shared SIFT Features
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
Feature-based object recognition Prof. Noah Snavely CS1114
True/False. False True Subject May Go Here True / False ? Type correct answer here. Type incorrect answer here.
Detecting Patterns So far Specific patterns (eyes) Generally useful patterns (edges) Also (new) “Interesting” distinctive patterns ( No specific pattern:
Lecture 3a: Feature detection and matching CS6670: Computer Vision Noah Snavely.
1 Invariant Local Feature for Object Recognition Presented by Wyman 2/05/2006.
Predicting Matchability - CVPR 2014 Paper -
Sebastian Thrun CS223B Computer Vision, Winter Stanford CS223B Computer Vision, Winter 2005 Lecture 3 Advanced Features Sebastian Thrun, Stanford.
Lecture 6: Feature matching and alignment CS4670: Computer Vision Noah Snavely.
Keypoint-based Recognition and Object Search
Keypoint-based Recognition Computer Vision CS 543 / ECE 549 University of Illinois Derek Hoiem 03/04/10.
Object Tracking/Recognition using Invariant Local Features Applications l Mobile robots, driver assistance l Cell phone location or object recognition.
Computer Vision Lecture 4 FEATURE DETECTION. Feature Detection Feature Description Feature Matching Today’s Topics 2.
Lecture 4: Feature matching CS4670 / 5670: Computer Vision Noah Snavely.
4.1 Feature: Point and Patches Xuejin Chen Reading: Szeliski Chap ~238.
Example: line fitting. n=2 Model fitting Measure distances.
Feature extraction: Corners 9300 Harris Corners Pkwy, Charlotte, NC.
Lecture 7: Features Part 2 CS4670/5670: Computer Vision Noah Snavely.
Feature extraction: Corners and blobs. Why extract features? Motivation: panorama stitching We have two images – how do we combine them?
Lecture 08 27/12/2011 Shai Avidan הבהרה: החומר המחייב הוא החומר הנלמד בכיתה ולא זה המופיע / לא מופיע במצגת.
CSE 185 Introduction to Computer Vision Feature Matching.
Project 3 questions? Interest Points and Instance Recognition Computer Vision CS 143, Brown James Hays 10/21/11 Many slides from Kristen Grauman and.
Local features: detection and description
Stereo Vision Local Map Alignment for Robot Environment Mapping Computer Vision Center Dept. Ciències de la Computació UAB Ricardo Toledo Morales (CVC)
CS654: Digital Image Analysis
Image matching by Diva SianDiva Sian by swashfordswashford TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAAAA.
Announcements Project 1 Out today Help session at the end of class.
Lecture 22: Structure from motion CS6670: Computer Vision Noah Snavely.
CSE 185 Introduction to Computer Vision Local Invariant Features.
Lecture 14: Feature matching and Transforms CS4670/5670: Computer Vision Kavita Bala.
Invariant Local Features Image content is transformed into local feature coordinates that are invariant to translation, rotation, scale, and other imaging.
Lecture 5: Feature detection and matching CS4670 / 5670: Computer Vision Noah Snavely.
Recognizing objects Prof. Noah Snavely CS1114
776 Computer Vision Jan-Michael Frahm Spring 2012.
SIFT Scale-Invariant Feature Transform David Lowe
Image Features: Points and Regions
TP12 - Local features: detection and description
Lecture 4: Harris corner detection
Local features: detection and description May 11th, 2017
Modeling the world with photos
Features Readings All is Vanity, by C. Allan Gilbert,
Announcements Project 1 Project 2 (panoramas)
Lecture 5: Feature detection and matching
Announcement Project 1 1.
Lecture 23: Structure from motion 2
CS4670: Intro to Computer Vision
Lecture VI: Corner and Blob Detection
Lecture 15: Structure from motion
CS5760: Computer Vision Lecture 9: RANSAC Noah Snavely
Corner Detection COMP 4900C Winter 2008.
Lecture 6: Feature matching
CS5760: Computer Vision Lecture 9: RANSAC Noah Snavely
Presentation transcript:

Lecture 8: Feature matching CS6670: Computer Vision Noah Snavely

SIFT Example sift 868 SIFT features

Feature matching Given a feature in I 1, how to find the best match in I 2 ? 1.Define distance function that compares two descriptors 2.Test all the features in I 2, find the one with min distance

Feature distance How to define the difference between two features f 1, f 2 ? – Simple approach: L 2 distance, ||f 1 - f 2 || – can give good scores to ambiguous (incorrect) matches I1I1 I2I2 f1f1 f2f2

f1f1 f2f2 f2'f2' Feature distance How to define the difference between two features f 1, f 2 ? Better approach: ratio distance = ||f 1 - f 2 || / || f 1 - f 2 ’ || f 2 is best SSD match to f 1 in I 2 f 2 ’ is 2 nd best SSD match to f 1 in I 2 gives large values for ambiguous matches I1I1 I2I2

Feature matching example 51 matches

Feature matching example 58 matches

Evaluating the results How can we measure the performance of a feature matcher? feature distance

True/false positives The distance threshold affects performance – True positives = # of detected matches that are correct Suppose we want to maximize these—how to choose threshold? – False positives = # of detected matches that are incorrect Suppose we want to minimize these—how to choose threshold? false match true match feature distance How can we measure the performance of a feature matcher?

0.7 Evaluating the results false positive rate true positive rate # true positives # correctly matched features (positives) 0.1 How can we measure the performance of a feature matcher? “recall” # false positives # incorrectly matched features (negatives) 1 - “precision”

0.7 Evaluating the results false positive rate true positive rate 0.1 ROC curve (“Receiver Operator Characteristic”) How can we measure the performance of a feature matcher? # true positives # correctly matched features (positives) “recall” # false positives # incorrectly matched features (negatives) 1 - “precision”

Lots of applications Features are used for: – Image alignment (e.g., mosaics) – 3D reconstruction – Motion tracking – Object recognition (e.g., Google Goggles) – Indexing and database retrieval – Robot navigation – … other

Object recognition (David Lowe)

3D Reconstruction Internet Photos (“Colosseum”) Reconstructed 3D cameras and points

Sony Aibo SIFT usage: Recognize charging station Communicate with visual cards Teach object recognition

Questions?