Keypoint extraction: Corners Harris Corners Pkwy, Charlotte, NC

Similar documents
Recap: edge detection. Source: D. Lowe, L. Fei-Fei

Feature extraction: Corners and blobs

Feature extraction: Corners and blobs

Edges and Scale. Image Features. Detecting edges. Origin of Edges. Solution: smooth first. Effects of noise

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

Lecture 05 Point Feature Detection and Matching

Corners, Blobs & Descriptors. With slides from S. Lazebnik & S. Seitz, D. Lowe, A. Efros

Instance-level recognition: Local invariant features. Cordelia Schmid INRIA, Grenoble

Image Analysis. Feature extraction: corners and blobs

CS4670: Computer Vision Kavita Bala. Lecture 7: Harris Corner Detec=on

Lecture 8: Interest Point Detection. Saad J Bedros

Instance-level recognition: Local invariant features. Cordelia Schmid INRIA, Grenoble

* h + = Lec 05: Interesting Points Detection. Image Analysis & Retrieval. Outline. Image Filtering. Recap of Lec 04 Image Filtering Edge Features

Instance-level l recognition. Cordelia Schmid INRIA

Instance-level recognition: Local invariant features. Cordelia Schmid INRIA, Grenoble

Lecture 8: Interest Point Detection. Saad J Bedros

Advances in Computer Vision. Prof. Bill Freeman. Image and shape descriptors. Readings: Mikolajczyk and Schmid; Belongie et al.

Perception III: Filtering, Edges, and Point-features

Instance-level l recognition. Cordelia Schmid & Josef Sivic INRIA

Local Features (contd.)

6.869 Advances in Computer Vision. Prof. Bill Freeman March 1, 2005

Lecture 12. Local Feature Detection. Matching with Invariant Features. Why extract features? Why extract features? Why extract features?

Feature detectors and descriptors. Fei-Fei Li

Feature detectors and descriptors. Fei-Fei Li

Invariant local features. Invariant Local Features. Classes of transformations. (Good) invariant local features. Case study: panorama stitching

Detectors part II Descriptors

Optical flow. Subhransu Maji. CMPSCI 670: Computer Vision. October 20, 2016

Corner detection: the basic idea

Interest Point Detection. Lecture-4

Interest Operators. All lectures are from posted research papers. Harris Corner Detector: the first and most basic interest operator

CS5670: Computer Vision

Vlad Estivill-Castro (2016) Robots for People --- A project for intelligent integrated systems

CS 3710: Visual Recognition Describing Images with Features. Adriana Kovashka Department of Computer Science January 8, 2015

INTEREST POINTS AT DIFFERENT SCALES

Motion estimation. Digital Visual Effects Yung-Yu Chuang. with slides by Michael Black and P. Anandan

Extract useful building blocks: blobs. the same image like for the corners

Blobs & Scale Invariance

Lecture 6: Finding Features (part 1/2)

SURF Features. Jacky Baltes Dept. of Computer Science University of Manitoba WWW:

Image Processing 1 (IP1) Bildverarbeitung 1

Edge Detection. Image Processing - Computer Vision

Properties of detectors Edge detectors Harris DoG Properties of descriptors SIFT HOG Shape context

Machine vision, spring 2018 Summary 4

Blob Detection CSC 767

Machine vision. Summary # 4. The mask for Laplacian is given

SIFT: Scale Invariant Feature Transform

CSE 473/573 Computer Vision and Image Processing (CVIP)

SIFT keypoint detection. D. Lowe, Distinctive image features from scale-invariant keypoints, IJCV 60 (2), pp , 2004.

Harris Corner Detector

Image matching. by Diva Sian. by swashford

System 1 (last lecture) : limited to rigidly structured shapes. System 2 : recognition of a class of varying shapes. Need to:

LoG Blob Finding and Scale. Scale Selection. Blobs (and scale selection) Achieving scale covariance. Blob detection in 2D. Blob detection in 2D

Camera calibration. Outline. Pinhole camera. Camera projection models. Nonlinear least square methods A camera calibration tool

Achieving scale covariance

Scale & Affine Invariant Interest Point Detectors

Overview. Introduction to local features. Harris interest points + SSD, ZNCC, SIFT. Evaluation and comparison of different detectors

Introduction to Mobile Robotics Compact Course on Linear Algebra. Wolfram Burgard, Cyrill Stachniss, Kai Arras, Maren Bennewitz

Lecture 7: Finding Features (part 2/2)

EECS490: Digital Image Processing. Lecture #26

A A x i x j i j (i, j) (j, i) Let. Compute the value of for and

Mobile Robotics 1. A Compact Course on Linear Algebra. Giorgio Grisetti

Wavelet-based Salient Points with Scale Information for Classification

Mathematics 309 Conic sections and their applicationsn. Chapter 2. Quadric figures. ai,j x i x j + b i x i + c =0. 1. Coordinate changes

Scale & Affine Invariant Interest Point Detectors

Slice Sampling with Adaptive Multivariate Steps: The Shrinking-Rank Method

Eigenvectors and Eigenvalues 1

EE 6882 Visual Search Engine

Covariance Tracking Algorithm on Bilateral Filtering under Lie Group Structure Yinghong Xie 1,2,a Chengdong Wu 1,b

CITS 4402 Computer Vision

Discriminative Direction for Kernel Classifiers

SIFT: SCALE INVARIANT FEATURE TRANSFORM BY DAVID LOWE

Feature Extraction and Image Processing

2D Geometric Transformations. (Chapter 5 in FVD)

EECS150 - Digital Design Lecture 15 SIFT2 + FSM. Recap and Outline

Lecture 6: Edge Detection. CAP 5415: Computer Vision Fall 2008

Lecture 7: Finding Features (part 2/2)

Rapid Object Recognition from Discriminative Regions of Interest

Optical Flow, KLT Feature Tracker.

Slide a window along the input arc sequence S. Least-squares estimate. σ 2. σ Estimate 1. Statistically test the difference between θ 1 and θ 2

Boosting color saliency in image feature detection

Reading. 4. Affine transformations. Required: Watt, Section 1.1. Further reading:

Edge Detection PSY 5018H: Math Models Hum Behavior, Prof. Paul Schrater, Spring 2005

Modeling Classes of Shapes Suppose you have a class of shapes with a range of variations: System 2 Overview

Corner. Corners are the intersections of two edges of sufficiently different orientations.

The state of the art and beyond

Lecture 16: Small Sample Size Problems (Covariance Estimation) Many thanks to Carlos Thomaz who authored the original version of these slides

COMP 408/508. Computer Vision Fall 2017 PCA for Recognition

Identifying second degree equations

Introduction to Mobile Robotics Compact Course on Linear Algebra. Wolfram Burgard, Bastian Steder

Convex Optimization in Classification Problems

Object Recognition Using Local Characterisation and Zernike Moments

Affine Adaptation of Local Image Features Using the Hessian Matrix

KINEMATIC RELATIONS IN DEFORMATION OF SOLIDS

INF Introduction to classifiction Anne Solberg Based on Chapter 2 ( ) in Duda and Hart: Pattern Classification

Geometric Image Manipulation. Lecture #4 Wednesday, January 24, 2018

Diagonalization. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics

Introduction to Mobile Robotics Compact Course on Linear Algebra. Wolfram Burgard, Cyrill Stachniss, Maren Bennewitz, Diego Tipaldi, Luciano Spinello

Shape of Gaussians as Feature Descriptors

Real Time Face Detection and Recognition using Haar - Based Cascade Classifier and Principal Component Analysis

Transcription:

Kepoint etraction: Corners 9300 Harris Corners Pkw Charlotte NC

Wh etract kepoints? Motivation: panorama stitching We have two images how do we combine them?

Wh etract kepoints? Motivation: panorama stitching We have two images how do we combine them? Step 1: etract kepoints Step 2: match kepoint features

Wh etract kepoints? Motivation: panorama stitching We have two images how do we combine them? Step 1: etract kepoints Step 2: match kepoint features Step 3: align images

Characteristics of good kepoints Repeatabilit The same kepoint can be found in several images despite geometric and photometric transformations Salienc Each kepoint is distinctive Compactness and efficienc Man fewer kepoints than image piels Localit A kepoint occupies a relativel small area of the image; robust to clutter and occlusion

Applications Kepoints are used for: mage alignment 3D reconstruction Motion tracking Robot navigation ndeing and database retrieval Object recognition

Corner Detection: Basic dea We should easil recognize the point b looking through a small window Shifting a window in an direction should give a large change in intensit flat region: no change in all directions edge : no change along the edge direction corner : significant change in all directions

Corner Detection: Mathematics Change in appearance of window W for the shift [uv]: () W E(u v) = [( + u + v) ( )] 2 ( ) E(u v) E(32)

Corner Detection: Mathematics Change in appearance of window W for the shift [uv]: () W E(u v) = [( + u + v) ( )] 2 ( ) E(u v) E(00)

Corner Detection: Mathematics Change in appearance of window W for the shift [uv]: () W E(u v) = [( + u + v) ( )] 2 We want to find out how this function behaves for small shifts E(u v)

Corner Detection: Mathematics First-order Talor approimation for small motions [u v]: ( + u + v) ( ) + u + v Let s plug this into E(uv): () W E(u v) = [( + u + v) ( )] 2 () W [( )+ u + v ( )] 2 = [ u + v] 2 = 2 u 2 + 2 uv + 2 v 2 () W () W

Corner Detection: Mathematics The quadratic approimation can be written as where M is a second moment matri computed from image derivatives: [ ] v u M v u v u E ) ( = M 2 2 (the sums are over all the piels in the window W)

The surface E(uv) is locall approimated b a quadratic form. Let s tr to understand its shape. Specificall in which directions does it have the smallest/greatest change? nterpreting the second moment matri v u M v u v u E ] [ ) ( E(u v) = M 2 2

nterpreting the second moment matri Consider a horizontal slice of E(u v): [ u v] M u = const v This is the equation of an ellipse.

nterpreting the second moment matri Consider a horizontal slice of E(u v): [ u v] M u = const v This is the equation of an ellipse. Diagonalization of M: M λ = R 1 1 0 R 0 λ2 The ais lengths of the ellipse are determined b the eigenvalues and the orientation is determined b R direction of the fastest change direction of the slowest change (λ ma ) -1/2 (λ min ) -1/2

Consider the ais-aligned case (gradients are either horizontal or vertical) f either a or b is close to 0 then this is not a corner so look for locations where both are large. nterpreting the second moment matri = b a 0 0 = M 2 2

Visualization of second moment matrices

Visualization of second moment matrices

nterpreting the eigenvalues Classification of image points using eigenvalues of M: λ 2 Edge λ 2 >> λ 1 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 Flat region Edge λ 1 >> λ 2 λ 1

Corner response function R = det( M ) M 2 α trace( ) = λ1λ 2 α( λ1 + λ ) 2 2 α: constant (0.04 to 0.06) Edge R < 0 Corner R > 0 Flat region R small Edge R < 0

The Harris corner detector 1. Compute partial derivatives at each piel 2. Compute second moment matri M in a Gaussian window around each piel: C.Harris and M.Stephens. A Combined Corner and Edge Detector. Proceedings of the 4th Alve Vision Conference: pages 147 151 1988. = w w w w M 2 2 ) ( ) ( ) ( ) (

The Harris corner detector 1. Compute partial derivatives at each piel 2. Compute second moment matri M in a Gaussian window around each piel 3. Compute corner response function R C.Harris and M.Stephens. A Combined Corner and Edge Detector. Proceedings of the 4th Alve Vision Conference: pages 147 151 1988.

Harris Detector: Steps

Harris Detector: Steps Compute corner response R

The Harris corner detector 1. Compute partial derivatives at each piel 2. Compute second moment matri M in a Gaussian window around each piel 3. Compute corner response function R 4. Threshold R 5. Find local maima of response function (nonmaimum suppression) C.Harris and M.Stephens. A Combined Corner and Edge Detector. Proceedings of the 4th Alve Vision Conference: pages 147 151 1988.

Harris Detector: Steps Find points with large corner response: R > threshold

Harris Detector: Steps Take onl the points of local maima of R

Harris Detector: Steps

Robustness of corner features What happens to corner features when the image undergoes geometric or photometric transformations?

Affine intensit change Onl derivatives are used => invariance to intensit shift + b ntensit scaling: a a + b R threshold R (image coordinate) (image coordinate) Partiall invariant to affine intensit change

mage translation Derivatives and window function are shift-invariant Corner location is covariant w.r.t. translation

mage rotation Second moment ellipse rotates but its shape (i.e. eigenvalues) remains the same Corner location is covariant w.r.t. rotation

Scaling Corner All points will be classified as edges Corner location is not covariant to scaling!