Image Features: Scale Invariant Interest Point Detectionfidler/slides/CSC420/lecture7.pdf ·...

Image Features:

Scale Invariant Interest Point Detection

Sanja Fidler CSC420: Intro to Image Understanding 1 / 19

Scale Invariant Interest Points

How can we independently select interest points in each image, such that thedetections are repeatable across different scales?

[Source: K. Grauman, slide credit: R. Urtasun]

Extract features at a variety of scales, e.g., by using multiple resolutions in apyramid, and then matching features at the same level.

When does this work?

More efficient to extract features that are stable in both location and scale.

Find scale that gives local maxima of a function f in both position and scale.

Automatic Scale Selection

Function responses for increasing scale (scale signature).

[Source: T. Tuyttellaars, slide credit: R. Urtasun]Sanja Fidler CSC420: Intro to Image Understanding 3 / 19

What Can the Signature Function Be?

Lindeberg (1998): extrema in the Laplacian of Gaussian (LoG).

Lowe (2004) proposed computing a set of sub-octave Difference of Gaussianfilters looking for 3D (space+scale) maxima in the resulting structure.

[Source: R. Szeliski, slide credit: R. Urtasun]Sanja Fidler CSC420: Intro to Image Understanding 4 / 19

What Can the Signature Function Be?

Lindeberg (1998): extrema in the Laplacian of Gaussian (LoG).

Lowe (2004) proposed computing a set of sub-octave Difference of Gaussianfilters looking for 3D (space+scale) maxima in the resulting structure.

[Source: R. Szeliski, slide credit: R. Urtasun]Sanja Fidler CSC420: Intro to Image Understanding 5 / 19

Blob Detection – Laplacian of Gaussian

Laplacian of Gaussian: We mentioned it for edge detection

∇2g(x , y , σ) =∂2g(x , y , σ)

∂x2+∂2g(x , y , σ)

∂y2, where g is a Gaussian

It is a circularly symmetric operator (finds difference in all directions)

It can be used for 2D blob detection! How?

[Source: K. Grauman, slide credit: R. Urtasun]Sanja Fidler CSC420: Intro to Image Understanding 6 / 19

Laplacian of Gaussian: We mentioned it for edge detection

∇2g(x , y , σ) = − 1

(1− x2 + y2

)exp− x2+y2

It is a circularly symmetric operator (finds difference in all directions)

[Source: K. Grauman, slide credit: R. Urtasun]Sanja Fidler CSC420: Intro to Image Understanding 6 / 19

[Source: F. Flores-Mangas]Sanja Fidler CSC420: Intro to Image Understanding 7 / 19

Blob Detection in 2D: Scale Selection

Laplacian of Gaussian = blob detector

[Source: B. Leibe, slide credit: R. Urtasun]

Characteristic Scale

We define the characteristic scale as the scale that produces peak(minimum or maximum) of the Laplacian response

[Source: S. Lazebnik]Sanja Fidler CSC420: Intro to Image Understanding 9 / 19

Example

[Source: K. Grauman]Sanja Fidler CSC420: Intro to Image Understanding 10 / 19

Example

[Source: S. Lazebnik]

That’s nice. But can we do faster?

Remember again the Laplacian of Gaussian:

∇2g(x , y , σ) =∂2g(x , y , σ)

∂x2+∂2g(x , y , σ)

So computing our interest points means two convolutions (one for

each derivative) per scale

Larger scale (σ), larger the filters (more work for convolution)

Can we do it faster?

That’s nice. But can we do faster?

Remember again the Laplacian of Gaussian:

∇2g(x , y , σ) =∂2g(x , y , σ)

∂x2+∂2g(x , y , σ)

So computing our interest points means two convolutions (one for

each derivative) per scale

Larger scale (σ), larger the filters (more work for convolution)

Can we do it faster?

Approximate the Laplacian of Gaussian

[Source: K. Grauman]

Lowe’s DoG

Lowe (2004) proposed computing a set of sub-octave Difference of Gaussianfilters looking for 3D (space+scale) maxima in the resulting structure

[Source: R. Szeliski, slide credit: R. Urtasun]

Lowe’s DoG

First compute a Gaussian image pyramid

[Source: F. Flores-Mangas]

Lowe’s DoG

Compute Difference of Gaussians

Lowe’s DoG

At every scale

Lowe’s DoG

At every scale

Find local maxima in scale

A bit of pruning of bad maxima and we’re done!

Lowe’s DoG

At every scale

Find local maxima in scale

A bit of pruning of bad maxima and we’re done!

Other Interest Point Detectors (Many Good Options!)

Lindeberg: Laplacian of Gaussian

Lowe: DoG (typically called the SIFT interest point detector)

Mikolajczyk & Schmid: Hessian/Harris-Laplacian/Affine

Tuyttelaars & Van Gool: EBR and IBR

Matas: MSER

Kadir & Brady: Salient Regions

Summary – Stuff You Should Know

To match the same scene or object under different viewpoint, it’s useful tofirst detect interest points (keypoints)

We looked at these interest point detectors:

Harris corner detector: translation and rotation but not scale invariantScale invariant interest points: Laplacian of Gaussians and Lowe’s DoG

Harris’ approach computes I 2x , I 2y and Ix Iy , and blurs each one with a

Gaussian. Denote with: A = g ∗ I 2x , B = g ∗ (Ix Iy ) and C = g ∗ I 2y . Then

(A(x , y) B(x , y)B(x , y) C (x , y)

)characterizes the shape of EWSSD for a window

around (x , y). Compute “cornerness” score for each (x , y) asR(x , y) = det(Mxy )− α trace(Mxy )2. Find R(x , y) > threshold and donon-maxima suppression to find corners.

Lowe’s approach creates a Gaussian pyramid with s blurring levels peroctave, computes difference between consecutive levels, and finds localextrema in space and scale

Local Descriptors – Next Time

Detection: Identify the interest points.

Description: Extract a feature descriptor around each interest point.

Matching: Determine correspondence between descriptors in two views.

[Source: K. Grauman]

Image Features: Scale Invariant Interest Point Detectionfidler/slides/CSC420/lecture7.pdf ·...

Documents

Mpc Invariant set

Geometric Invariant Theory

Invariant Theory Nq

Invariant Theory Nqrs

INVARIANT MEASURES CONCENTRATED ON COUNTABLE …math.mit.edu/~freer/papers/AFP-invariant.pdf · INVARIANT MEASURES CONCENTRATED ON COUNTABLE STRUCTURES 2 1. ... it produces an invariant

Differential Operators and Invariant Theory · Geometric problem Grassmann varieties Fundamental theorems of invariant theory Invariant operators Hilbert series computations Differential

Invariant face expressions

Geometric Invariant Curve and Surface … Invariant Curve and Surface Normalization ... Abstract. In this work, a ... Geometric Invariant Curve and Surface Normalization 447

Image Features: Scale Invariant Interest Point …fidler/slides/2019/CSC420/lecture7.pdfwith a feature vector (we know how to compare vectors) Sanja Fidler CSC420: Intro to Image Understanding

Spatially invariant computations in stereoscopic visionpapers.vcl.salk.edu/PDFs/Spatially invariant computations...Vidal-Naquet and Gepshtein Spatially invariant computations in stereoscopic

A Complexity-Invariant Distance Measure for Time Serieseamonn/Complexity-Invariant Distance Measure.pdf · A Complexity-Invariant Distance Measure for Time Series Gustavo E.A.P.A

An affine invariant interest point detector

Computing Global Invariant Manifolds: Techniques and ...hinke/preprints/... · Computing Global Invariant Manifolds: Techniques and Applications Hinke M. Osinga Abstract. Global invariant

Invariant Theory Bc

Scale & Afﬁne Invariant Interest Point Detectorsvgg/research/affine/det_eval_files/mikolajczyk... · International Journal of Computer Vision 60(1), 63–86, 2004 c 2004 Kluwer

Lecture 6 Invariant subspaces - Stanford University · Lecture 6 Invariant subspaces • invariant subspaces • a matrix criterion • Sylvester equation • the PBH controllability

Loop invariant computation

Invariant Theory

Invariant Variational Problems Invariant Curve Flows

Learning Viewpoint-Invariant Face Representations from ...papers.cnl.salk.edu/PDFs/Learning Viewpoint-Invariant Face... · Learning viewpoint-invariant face representations from visual