SURF: Speeded-Up Robust Features

Slides:



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

Distinctive Image Features from Scale-Invariant Keypoints David Lowe.
Scale & Affine Invariant Interest Point Detectors Mikolajczyk & Schmid presented by Dustin Lennon.
Group Meeting Presented by Wyman 10/14/2006
Interest points CSE P 576 Ali Farhadi Many slides from Steve Seitz, Larry Zitnick.
Computer vision: models, learning and inference Chapter 13 Image preprocessing and feature extraction.
TP14 - Local features: detection and description Computer Vision, FCUP, 2014 Miguel Coimbra Slides by Prof. Kristen Grauman.
CSE 473/573 Computer Vision and Image Processing (CVIP)
Instructor: Mircea Nicolescu Lecture 15 CS 485 / 685 Computer Vision.
SURF: Speeded-Up Robust Features
SURF applied in Panorama Image Stitching
Patch Descriptors CSE P 576 Larry Zitnick
Interest points CSE P 576 Larry Zitnick Many slides courtesy of Steve Seitz.
Lecture 6: Feature matching CS4670: Computer Vision Noah Snavely.
Lecture 4: Feature matching
Scale Invariant Feature Transform
Distinctive Image Feature from Scale-Invariant KeyPoints
Feature extraction: Corners and blobs
Scale Invariant Feature Transform (SIFT)
Representation, Description and Matching
Automatic Matching of Multi-View Images
Blob detection.
1 Invariant Local Feature for Object Recognition Presented by Wyman 2/05/2006.
CS4670: Computer Vision Kavita Bala Lecture 8: Scale invariance.
Distinctive Image Features from Scale-Invariant Keypoints David G. Lowe – IJCV 2004 Brien Flewelling CPSC 643 Presentation 1.
Overview Introduction to local features
Interest Point Descriptors
Computer vision.
Interest Point Descriptors and Matching
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.
776 Computer Vision Jan-Michael Frahm Fall SIFT-detector Problem: want to detect features at different scales (sizes) and with different orientations!
CSE 185 Introduction to Computer Vision Local Invariant Features.
CSCE 643 Computer Vision: Extractions of Image Features Jinxiang Chai.
Lecture 7: Features Part 2 CS4670/5670: Computer Vision Noah Snavely.
Local invariant features Cordelia Schmid INRIA, Grenoble.
Distinctive Image Features from Scale-Invariant Keypoints Ronnie Bajwa Sameer Pawar * * Adapted from slides found online by Michael Kowalski, Lehigh University.
Distinctive Image Features from Scale-Invariant Keypoints David Lowe Presented by Tony X. Han March 11, 2008.
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?
CS654: Digital Image Analysis
SURF: Speeded Up Robust Features
Presented by David Lee 3/20/2006
Instructor: Mircea Nicolescu Lecture 10 CS 485 / 685 Computer Vision.
Frank Bergschneider February 21, 2014 Presented to National Instruments.
CSE 185 Introduction to Computer Vision Local Invariant Features.
Recognizing specific objects Matching with SIFT Original suggestion Lowe, 1999,2004.
Blob detection.
CS262: Computer Vision Lect 09: SIFT Descriptors
Lecture 13: Feature Descriptors and Matching
Presented by David Lee 3/20/2006
Distinctive Image Features from Scale-Invariant Keypoints
Scale Invariant Feature Transform (SIFT)
TP12 - Local features: detection and description
Source: D. Lowe, L. Fei-Fei Recap: edge detection Source: D. Lowe, L. Fei-Fei.
SURF detectors and descriptors
Digital Visual Effects, Spring 2006 Yung-Yu Chuang 2006/3/22
Scale and interest point descriptors
Homework| Homework: Derive the following expression for the derivative of the inverse mapping Arun Das | Waterloo Autonomous Vehicles Lab.
CAP 5415 Computer Vision Fall 2012 Dr. Mubarak Shah Lecture-5
What I learned in the first 2 weeks
The SIFT (Scale Invariant Feature Transform) Detector and Descriptor
SIFT keypoint detection
Edge detection f(x,y) viewed as a smooth function
Lecture VI: Corner and Blob Detection
Feature descriptors and matching
Lecture 5: Feature invariance
Presented by Xu Miao April 20, 2005
Lecture 5: Feature invariance
Presentation transcript:

SURF: Speeded-Up Robust Features CPSC 643, Presentation 2 SURF: Speeded-Up Robust Features Herbert Baya, Andreas Essa, Tinne Tuytellaresb, Luc Van Goola,b aETH Zurich bK. U. Leuven, ESAT-PSI Sternwartstrasse 7 Kasteel Arenberg 10 CH-8092 Zurich B-3001 Leuven Switzerland Belgium Computer Vision and Image Understanding (CVIU) Vol. 110, No. 3, pp. 346-359, 2008.

Mostly Related Works Harris Corner Detector - Harris 1988 Laplacian of Gaussian - Lindeberg 1998 Harris - Laplace Detector - Mikolajczyk 2001 Difference of Gaussian - Lowe 2004

Mostly Related Works Harris Corner Detector - Harris 1988 Laplacian of Gaussian - Lindeberg 1998 Harris - Laplace Detector - Mikolajczyk 2001 Difference of Gaussian - Lowe 2004

Mostly Related Works Harris Corner Detector - Harris 1988 Laplacian of Gaussian - Lindeberg 1998 Harris - Laplace Detector - Mikolajczyk 2001 Difference of Gaussian - Lowe 2004

Mostly Related Works Harris Corner Detector - Harris 1988 Laplacian of Gaussian - Lindeberg 1998 Harris - Laplace Detector - Mikolajczyk 2001 Difference of Gaussian - Lowe 2004

Mostly Related Works Harris Corner Detector - Harris 1988 Laplacian of Gaussian - Lindeberg 1998 Harris - Laplace Detector - Mikolajczyk 2001 Difference of Gaussian - Lowe 2004

Other Related Works Salient Region Detector - Kadir 2001 Edge-based Region Detector - Jurie 2004

Motivation Using Laplacian of Gaussian, one could obtain scale invariant features. Lowe uses difference of Gaussian to approximate Laplacian of Gaussian. This paper uses Hessian - Laplacian to approximate Laplacian of Gaussian, to improve calculation speed.

Methodology Using integral images for major speed up Integral Image (summed area tables) is an intermediate representation for the image and contains the sum of gray scale pixel values of image.

Detection Hessian-based interest point localization Lxx(x,y,σ) is the Laplacian of Gaussian of the image. It is the convolution of the Gaussian second order derivative with the image. Lindeberg showed Gaussian function is optimal for scale-space analysis. This paper use Dxx to approximate Lxx.

Detection Approximated second order derivatives with box filters. Scale analysis with constant image size

Description Orientation Assignment x response y response Side length = 4s Cost 6 operation to compute the response Circular neighborhood of radius 6s around the interest point (s = the scale at which the point was detected)

Description Dominant orientation The Haar wavelet responses are represented as vectors Sum all responses within a sliding orientation window covering an angle of 60 degree The two summed response yield a new vector The longest vector is the dominant orientation

Description Split the interest region (20s x 20s) up into 4 x 4 square sub-regions. Calculate Haar wavelet response dx and dy and weight the response with a Gaussian kernel. Sum the response over each sub-region for dx and dy, then sum the absolute value of resp- onse. Normalize the vector into unit length

Matching Fast indexing through the sign of the Laplacian for the underlying interest point The sign of trace of the Hessian matrix Trace = Lxx + Lyy

Experiments

Experiments

Experiments

Analysis and Conclusion SURF is faster than SIFT by 3 times, and has recall precision not worse than SIFT. SURF is good at handling image with blurring or rotation. SURF is poor at handling image with viewpoint or illumination change.