Building a Panorama. Matching features. Matching with Features. How do we build a panorama? Computational Photography, 6.882

Similar documents
CS 4495 Computer Vision A. Bobick. CS 4495 Computer Vision. Features 2 SIFT descriptor. Aaron Bobick School of Interactive Computing

Feature Based Registration - Image Alignment

Motion Estimation and Optical Flow Tracking

The SIFT (Scale Invariant Feature

CEE598 - Visual Sensing for Civil Infrastructure Eng. & Mgmt.

Local features: detection and description. Local invariant features

Automatic Image Alignment (feature-based)

Local features: detection and description May 12 th, 2015

School of Computing University of Utah

Prof. Feng Liu. Spring /26/2017

Local invariant features

Midterm Wed. Local features: detection and description. Today. Last time. Local features: main components. Goal: interest operator repeatability

EECS150 - Digital Design Lecture 14 FIFO 2 and SIFT. Recap and Outline

Local Feature Detectors

Local features and image matching. Prof. Xin Yang HUST

Scale Invariant Feature Transform

SIFT: SCALE INVARIANT FEATURE TRANSFORM SURF: SPEEDED UP ROBUST FEATURES BASHAR ALSADIK EOS DEPT. TOPMAP M13 3D GEOINFORMATION FROM IMAGES 2014

SCALE INVARIANT FEATURE TRANSFORM (SIFT)

Scale Invariant Feature Transform

BSB663 Image Processing Pinar Duygulu. Slides are adapted from Selim Aksoy

Object Recognition with Invariant Features

Automatic Image Alignment

Automatic Image Alignment

Feature descriptors. Alain Pagani Prof. Didier Stricker. Computer Vision: Object and People Tracking

Augmented Reality VU. Computer Vision 3D Registration (2) Prof. Vincent Lepetit

Outline 7/2/201011/6/

Motion illusion, rotating snakes

Introduction. Introduction. Related Research. SIFT method. SIFT method. Distinctive Image Features from Scale-Invariant. Scale.

Lecture 10 Detectors and descriptors

Problems with template matching

SUMMARY: DISTINCTIVE IMAGE FEATURES FROM SCALE- INVARIANT KEYPOINTS

Computer Vision for HCI. Topics of This Lecture

Feature Detection. Raul Queiroz Feitosa. 3/30/2017 Feature Detection 1

SIFT - scale-invariant feature transform Konrad Schindler

Local Features: Detection, Description & Matching

2D Image Processing Feature Descriptors

Feature Matching and Robust Fitting

Scale Invariant Feature Transform by David Lowe

AK Computer Vision Feature Point Detectors and Descriptors

Features Points. Andrea Torsello DAIS Università Ca Foscari via Torino 155, Mestre (VE)

Local Image Features

CS 558: Computer Vision 4 th Set of Notes

Local Image Features

Local Features Tutorial: Nov. 8, 04

Patch-based Object Recognition. Basic Idea

Image matching. Announcements. Harder case. Even harder case. Project 1 Out today Help session at the end of class. by Diva Sian.

Evaluation and comparison of interest points/regions

Computer Vision. Recap: Smoothing with a Gaussian. Recap: Effect of σ on derivatives. Computer Science Tripos Part II. Dr Christopher Town

Harder case. Image matching. Even harder case. Harder still? by Diva Sian. by swashford

CAP 5415 Computer Vision Fall 2012

Harder case. Image matching. Even harder case. Harder still? by Diva Sian. by swashford

Local Image preprocessing (cont d)

Advanced Video Content Analysis and Video Compression (5LSH0), Module 4

Image Matching. AKA: Image registration, the correspondence problem, Tracking,

Local Feature Extraction and Description for

Vision and Image Processing Lab., CRV Tutorial day- May 30, 2010 Ottawa, Canada

Feature descriptors and matching

Key properties of local features

Image Features. Work on project 1. All is Vanity, by C. Allan Gilbert,

Wikipedia - Mysid

Stitching and Blending

EE368 Project Report CD Cover Recognition Using Modified SIFT Algorithm

TA Section 7 Problem Set 3. SIFT (Lowe 2004) Shape Context (Belongie et al. 2002) Voxel Coloring (Seitz and Dyer 1999)

Eppur si muove ( And yet it moves )

Feature Detectors and Descriptors: Corners, Lines, etc.

A NEW FEATURE BASED IMAGE REGISTRATION ALGORITHM INTRODUCTION

Corner Detection. GV12/3072 Image Processing.

CS4670: Computer Vision

CS 556: Computer Vision. Lecture 3

Image Features: Local Descriptors. Sanja Fidler CSC420: Intro to Image Understanding 1/ 58

CS 1674: Intro to Computer Vision. Midterm Review. Prof. Adriana Kovashka University of Pittsburgh October 10, 2016

LOCAL AND GLOBAL DESCRIPTORS FOR PLACE RECOGNITION IN ROBOTICS

CS231A Section 6: Problem Set 3

Local Image Features

Distinctive Image Features from Scale-Invariant Keypoints

Midterm Examination CS 534: Computational Photography

Distinctive Image Features from Scale-Invariant Keypoints

Instance-level recognition II.

CS664 Lecture #21: SIFT, object recognition, dynamic programming

3D from Photographs: Automatic Matching of Images. Dr Francesco Banterle

Image Features: Detection, Description, and Matching and their Applications

CS 556: Computer Vision. Lecture 3

Distinctive Image Features from Scale-Invariant Keypoints

CS 223B Computer Vision Problem Set 3

A Novel Algorithm for Color Image matching using Wavelet-SIFT

Ulas Bagci

A SIFT Descriptor with Global Context

Edge and corner detection

Performance Evaluation of Scale-Interpolated Hessian-Laplace and Haar Descriptors for Feature Matching

CS5670: Computer Vision

Scale Invariant Feature Transform (SIFT) CS 763 Ajit Rajwade

Multi-view 3D reconstruction. Problem formulation Projective ambiguity Rectification Autocalibration Feature points and their matching

A Comparison and Matching Point Extraction of SIFT and ISIFT

3D Reconstruction From Multiple Views Based on Scale-Invariant Feature Transform. Wenqi Zhu

Feature Detection and Matching

Filtering Images. Contents

Visual Tracking (1) Tracking of Feature Points and Planar Rigid Objects

Panoramic Image Stitching

Multi-modal Registration of Visual Data. Massimiliano Corsini Visual Computing Lab, ISTI - CNR - Italy

III. VERVIEW OF THE METHODS

Transcription:

Matching features Building a Panorama Computational Photography, 6.88 Prof. Bill Freeman April 11, 006 Image and shape descriptors: Harris corner detectors and SIFT features. Suggested readings: Mikolajczyk and Schmid, David Lowe IJCV. Modifications to slides by Allan + Jepson, Oct. 009 M. Brown and D. G. Lowe. Recognising Panoramas. ICCV 003 How do we build a panorama? Matching with Features Detect feature points in both images We need to match (align) images 1

Matching with Features Detect feature points in both images Find corresponding pairs Matching with Features Detect feature points in both images Find corresponding pairs Use these pairs to align images Matching with Features Problem 1: Detect the same point independently in both images Matching with Features Problem : For each point correctly recognize the corresponding one? no chance to match! We need a repeatable detector We need a reliable and distinctive descriptor

More motivation Feature points are used also for: Image alignment (homography, fundamental matrix) 3D reconstruction Motion tracking Object recognition Indexing and database retrieval Robot navigation other We want to: detect the same interest points regardless of image changes Geometry Models of Image Change Rotation Similarity (rotation + uniform scale) Affine (scale dependent on direction) valid for: orthographic camera, locally planar object Photometry Affine intensity change (I a I + b) Selecting Good Features What s a good feature? Distinctive Image Location, Scale and Orientation: image landmark. pose can be repeatably identified from the image itself. Descriptive: Provides distinctive information about the image structure in a neighbourhood of the landmark point. Stable under viewpoint changes: information is stable under common changes in noise, orientation, scale, 3D pose, view, lighting. 3

Contents Feature Location Harris Corner Feature Scale Laplacian (of Gaussian) Difference of Gaussians (DoG) Feature Orientation Local Gradient Histogram Image Patch Descriptor SIFT (Scale Invariant Feature Transform) Harris Detector: Summary Spatially averaged outer product of image gradient: I x II x y M w( x, y) xy, I xiy Iy Eigenvalues of M indicate texture/oriented/blank regions R k 1 1 (k empirical constant, k = 0.04-0.06) A good (textured) point should have a large intensity change in all directions, i.e. R should be large positive Selecting Good Features Selecting Good Features 1 and are large large 1, small 4

Selecting Good Features Harris Detector The Algorithm: Find points with large corner response function R (R > threshold) Take the points of local maxima of R small 1, small Harris Detector: Workflow Harris Detector: Workflow Compute corner response R 5

Harris Detector: Workflow Find points with large corner response: R>threshold Harris Detector: Workflow Take only the points of local maxima of R Harris Detector: Workflow Harris Detector: Some Properties Rotation invariance. Scaling I ai, R ar, R > threshold varies, but local spatial peaks remain peaks. Not scale invariant. 6

Harris Detector: Some Properties Quality of Harris detector for different scale changes Repeatability rate: # correspondences # possible correspondences Contents Feature Location Harris Corner Feature Scale Laplacian (of Gaussian) Difference of Gaussians (DoG) Feature Orientation Local Gradient Histogram Image Patch Descriptor SIFT (Scale Invariant Feature Transform) C.Schmid et.al. Evaluation of Interest Point Detectors. IJCV 000 Scale Invariant Detection Consider regions (e.g. circles) of different sizes around a point Regions of corresponding sizes will look the same in both images Scale Invariant Detection The problem: how do we choose corresponding circles independently in each image? 7

f Scale Invariant Detection Common approach: Take a isotropic bandpass filter, vary σ (aka region size) Size for which the maximum is achieved, should be invariant to image scale. Important: this scale invariant region size is found in each image independently! Image 1 scale = 1/ f Image f Scale Invariant Detection A good function for scale detection: has one stable sharp peak bad region size f bad region size f Good! region size For usual images: a good function would be a one which responds to contrast variations. s 1 region size s region size Scale Invariant Detection Functions for determining scale f Kernel Image Kernels: L Gxx x y Gyy x y (,, ) (,, ) (Laplacian) Scale Invariant Detectors Harris-Laplacian 1 Find local maximum of: Harris corner detector in space (image coordinates) Laplacian in scale scale y Harris x Laplacian DoG G( x, y, k ) G( x, y, ) (Difference of Gaussians) where Gaussian SIFT (Lowe) scale Find local maximum of: Difference of Gaussians in space and scale y DoG x y 1 Gxy (,, ) e Note: both kernels are invariant to scale and rotation DoG 1 K.Mikolajczyk, C.Schmid. Indexing Based on Scale Invariant Interest Points. ICCV 001 D.Lowe. Distinctive Image Features from Scale-Invariant Keypoints. Accepted to IJCV 004 x 8

Scale Invariant Detectors Experimental evaluation of detectors w.r.t. scale change Repeatability rate: # correspondences # possible correspondences Contents Feature Location Harris Corner Feature Scale Laplacian (of Gaussian) Difference of Gaussians (DoG) Feature Orientation Local Gradient Histogram Image Patch Descriptor SIFT (Scale Invariant Feature Transform) K.Mikolajczyk, C.Schmid. Indexing Based on Scale Invariant Interest Points. ICCV 001 Select canonical orientation Contents Create histogram of local gradient directions computed at selected scale Assign canonical orientation(s) at peak(s) of smoothed histogram Each key-point then specifies stable D coordinates (x, y, scale, orientation) 0 Feature Location Harris Corner Feature Scale Laplacian (of Gaussian) Difference of Gaussians (DoG) Feature Orientation Local Gradient Histogram Image Patch Descriptor SIFT (Scale Invariant Feature Transform) 9

Point Descriptors We know how to detect points Next question: How to match them? Invariant Local Features Image content is transformed into local feature coordinates that are invariant to translation, rotation, scale, and other imaging parameters? Point descriptor should be: 1. Insensitive to image deformations.. Distinctive SIFT Features (Scale Invariant Feature Transform) SIFT vector formation Thresholded image gradients are sampled over 16x16 array of locations in scale space Create array of orientation histograms 8 orientations x 4x4 histogram array = 18 dimensions Distinctiveness of features Vary size of database of features, with 30 degree affine change, % image noise Measure % correct for single nearest neighbor match D.Lowe. Distinctive Image Features from Scale-Invariant Keypoints. IJCV 004 10

A good SIFT features tutorial http://www.cs.toronto.edu/~jepson/csc503/tutsift04.pdf By Estrada, Jepson, and Fleet. The Matlab SIFTtutorial in utvistoolbox is also pretty cool. 11