Recognition and Matching based on local invariant features Cordelia Schmid INRIA, Grenoble David Lowe Univ. of British Columbia.

Slides:



Advertisements
Similar presentations
Distinctive Image Features from Scale-Invariant Keypoints
Advertisements

Object Recognition from Local Scale-Invariant Features David G. Lowe Presented by Ashley L. Kapron.
CSE 473/573 Computer Vision and Image Processing (CVIP)
The SIFT (Scale Invariant Feature Transform) Detector and Descriptor
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,
Image alignment Image from
Matching with Invariant Features
Object Recognition with Invariant Features n Definition: Identify objects or scenes and determine their pose and model parameters n Applications l Industrial.
Computational Photography
Robust and large-scale alignment Image from
1 Interest Operators Find “interesting” pieces of the image –e.g. corners, salient regions –Focus attention of algorithms –Speed up computation Many possible.
Object Recognition with Invariant Features n Definition: Identify objects or scenes and determine their pose and model parameters n Applications l Industrial.
1 Interest Operator Lectures lecture topics –Interest points 1 (Linda) interest points, descriptors, Harris corners, correlation matching –Interest points.
Automatic Image Alignment (feature-based) : Computational Photography Alexei Efros, CMU, Fall 2005 with a lot of slides stolen from Steve Seitz and.
Distinctive Image Feature from Scale-Invariant KeyPoints
Feature extraction: Corners and blobs
Stepan Obdrzalek Jirı Matas
Object Recognition Using Distinctive Image Feature From Scale-Invariant Key point D. Lowe, IJCV 2004 Presenting – Anat Kaspi.
Scale Invariant Feature Transform (SIFT)
Automatic Matching of Multi-View Images
Automatic Image Alignment (feature-based) : Computational Photography Alexei Efros, CMU, Fall 2006 with a lot of slides stolen from Steve Seitz and.
Distinctive Image Features from Scale-Invariant Keypoints David G. Lowe – IJCV 2004 Brien Flewelling CPSC 643 Presentation 1.
1 Interest Operators Find “interesting” pieces of the image Multiple possible uses –image matching stereo pairs tracking in videos creating panoramas –object.
Overview Introduction to local features
Image alignment.
Computer vision.
Local Invariant Features
1 Interest Operators Harris Corner Detector: the first and most basic interest operator Kadir Entropy Detector and its use in object recognition SIFT interest.
Object Tracking/Recognition using Invariant Local Features Applications l Mobile robots, driver assistance l Cell phone location or object recognition.
Overview Harris interest points Comparing interest points (SSD, ZNCC, SIFT) Scale & affine invariant interest points Evaluation and comparison of different.
Local invariant features Cordelia Schmid INRIA, Grenoble.
Evaluation of interest points and descriptors. Introduction Quantitative evaluation of interest point detectors –points / regions at the same relative.
MSRI workshop, January 2005 Object Recognition Collected databases of objects on uniform background (no occlusions, no clutter) Mostly focus on viewpoint.
Lecture 7: Features Part 2 CS4670/5670: Computer Vision Noah Snavely.
Local invariant features Cordelia Schmid INRIA, Grenoble.
Local invariant features Cordelia Schmid INRIA, Grenoble.
Local invariant features Cordelia Schmid INRIA, Grenoble.
Harris Corner Detector & Scale Invariant Feature Transform (SIFT)
Overview Introduction to local features Harris interest points + SSD, ZNCC, SIFT Scale & affine invariant interest point detectors Evaluation and comparison.
Feature extraction: Corners and blobs. Why extract features? Motivation: panorama stitching We have two images – how do we combine them?
Features, Feature descriptors, Matching Jana Kosecka George Mason University.
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 and image matching October 1 st 2015 Devi Parikh Virginia Tech Disclaimer: Many slides have been borrowed from Kristen Grauman, who may.
Local features: detection and description
CS654: Digital Image Analysis
Presented by David Lee 3/20/2006
776 Computer Vision Jan-Michael Frahm Spring 2012.
Image features and properties. Image content representation The simplest representation of an image pattern is to list image pixels, one after the other.
Instructor: Mircea Nicolescu Lecture 10 CS 485 / 685 Computer Vision.
Invariant Local Features Image content is transformed into local feature coordinates that are invariant to translation, rotation, scale, and other imaging.
SIFT.
776 Computer Vision Jan-Michael Frahm Spring 2012.
SIFT Scale-Invariant Feature Transform David Lowe
Lecture 07 13/12/2011 Shai Avidan הבהרה: החומר המחייב הוא החומר הנלמד בכיתה ולא זה המופיע / לא מופיע במצגת.
Distinctive Image Features from Scale-Invariant Keypoints
TP12 - Local features: detection and description
Local features: detection and description May 11th, 2017
Paper Presentation: Shape and Matching
Feature description and matching
Features Readings All is Vanity, by C. Allan Gilbert,
CAP 5415 Computer Vision Fall 2012 Dr. Mubarak Shah Lecture-5
CSE 455 – Guest Lectures 3 lectures Contact Interest points 1
The SIFT (Scale Invariant Feature Transform) Detector and Descriptor
Local features and image matching
Lecture VI: Corner and Blob Detection
Computational Photography
Presented by Xu Miao April 20, 2005
Recognition and Matching based on local invariant features
Presentation transcript:

Recognition and Matching based on local invariant features Cordelia Schmid INRIA, Grenoble David Lowe Univ. of British Columbia

Introduction Local invariant photometric descriptors ( ) local descriptor Local : robust to occlusion/clutter + no segmentation Photometric : distinctive Invariant : to image transformations + illumination changes

History - Matching Matching based on line segments  Not very discriminant  Solution : matching with interest points & correlation [ A robust technique for matching two uncalibrated images through the recovery of the unknown epipolar geometry, Z. Zhang, R. Deriche, O. Faugeras and Q. Luong, Artificial Intelligence 1995 ]

Approach Extraction of interest points with the Harris detector Comparison of points with cross-correlation Verification with the fundamental matrix

Harris detector Interest points extracted with Harris (~ 500 points)

Cross-correlation matching Initial matches (188 pairs)

Global constraints Robust estimation of the fundamental matrix 99 inliers 89 outliers

Summary of the approach Very good results in the presence of occlusion and clutter –local information –discriminant greyvalue information –robust estimation of the global relation between images –for limited view point changes Solution for more general view point changes –wide baseline matching (different viewpoint, scale and rotation) –local invariant descriptors based on greyvalue information

History - Recognition Color histogram [Swain 91] Each pixel is described by a color vector Distribution of color vectors is described by a histogram => not robust to occlusion, not invariant, not distinctive

History - Recognition Eigenimages [Turk 91] Each face vector is represented in the eigenimage space –eigenvectors with the highest eigenvalues = eigenimages The new image is projected into the eigenimage space –determine the closest face....  not robust to occlusion, requires segmentation, not invariant, discriminant

History - Recognition Geometric invariants [Rothwell 92] Function with a value independent of the transformation Invariant for image rotation : distance of two points Invariant for planar homography : cross-ratio where => local and invariant, not discriminant, requires sub-pixel extraction of primitives

History - Recognition Problems : occlusion, clutter, image transformations, distinctiveness  Solution : recognition with local photometric invariants [ Local greyvalue invariants for image retrieval, C. Schmid and R. Mohr, PAMI 1997 ]

Approach 1) Extraction of interest points (characteristic locations) 2) Computation of local descriptors 3) Determining correspondences 4) Selection of similar images ( ) local descriptor

Interest points Geometric features repeatable under transformations 2D characteristics of the signal high informational content Comparison of different detectors [Schmid98] Harris detector

Based on the idea of auto-correlation Important difference in all directions => interest point

Harris detector Auto-correlation function for a point and a shift Discret shifts can be avoided with the auto-correlation matrix

Harris detector Auto-correlation matrix

Harris detection Auto-correlation matrix –captures the structure of the local neighborhood –measure based on eigenvalues of this matrix 2 strong eigenvalues => interest point 1 strong eigenvalue => contour 0 eigenvalue => uniform region Interest point detection –threshold on the eigenvalues –local maximum for localization

Local descriptors Descriptors characterize the local neighborhood of a point ( ) local descriptor

Local descriptors Greyvalue derivatives

Local descriptors Invariance to image rotation : differential invariants [Koen87]

Local descriptors Robustness to illumination changes In case of an affine transformation

Local descriptors Robustness to illumination changes In case of an affine transformation or normalization of the image patch with mean and variance

Determining correspondences Vector comparison using the Mahalanobis distance ( ) = ?

Selection of similar images In a large database –voting algorithm –additional constraints Rapid acces with an indexing mechanism

Voting algorithm local characteristics vector of ( )

Voting algorithm }} I is the corresponding model image 1 211

Additional constraints Semi-local constraints –neighboring points should match –angles, length ratios should be similar Global constraints –robust estimation of the image transformation (homogaphy, epipolar geometry)

Results database with ~1000 images

Results

Summary of the approach Very good results in the presence of occlusion and clutter –local information –discriminant greyvalue information –invariance to image rotation and illumination Not invariance to scale and affine changes Solution for more general view point changes –local invariant descriptors to scale and rotation –extraction of invariant points and regions

Approach for Matching and Recognition Detection of interest points/regions –Harris detector (extension to scale and affine invariance) –Blob detector based on Laplacian Computation of descriptors for each point Similarity of descriptors Semi-local constraints Global verification

Approach for Matching and Recognition Detection of interest points/regions Computation of descriptors for each point –greyvalue patch, diff. invariants, steerable filter, SIFT descriptor Similarity of descriptors –correlation, Mahalanobis distance, Euclidean distance Semi-local constraints Global verification

Approach for Matching and Recognition Detection of interest points/regions Computation of descriptors for each point Similarity of descriptors Semi-local constraints –geometrical or statistical relations between neighborhood points Global verification –robust estimation of geometry between images

Overview 8:30-8:45 Scale invariant interest points 8:45-9:00 SIFT descriptors 9:00-9:25 Affine invariance of interest points + applications 9:25-9:45 Evaluation of interest points + descriptors 9:45-10:15 Break

Overview 10:15-11:15 Object recognition system, demo, applications 11:15-11:45 Recognition of textures and object classes 11:45-12:00 Future directions + discussion