Instance-level recognition: Local invariant features Cordelia - - PowerPoint PPT Presentation

instance level recognition local invariant features
SMART_READER_LITE
LIVE PREVIEW

Instance-level recognition: Local invariant features Cordelia - - PowerPoint PPT Presentation

Instance-level recognition: Local invariant features Cordelia Schmid INRIA, Grenoble Overview Introduction to local features Harris interest points + SSD, ZNCC, SIFT Scale & affine invariant interest point detectors Scale


slide-1
SLIDE 1

Instance-level recognition: Local invariant features

Cordelia Schmid INRIA, Grenoble

slide-2
SLIDE 2

Overview

  • Introduction to local features
  • Harris interest points + SSD, ZNCC, SIFT
  • Scale & affine invariant interest point detectors
  • Scale & affine invariant interest point detectors
  • Evaluation and comparison of different detectors
  • Region descriptors and their performance
slide-3
SLIDE 3

Local features

( )

local descriptor

Several / many local descriptors per image Robust to occlusion/clutter + no object segmentation required Photometric : distinctive Invariant : to image transformations + illumination changes

slide-4
SLIDE 4

Local features: interest points

slide-5
SLIDE 5

Local features: Contours/segments

slide-6
SLIDE 6

Local features: segmentation

slide-7
SLIDE 7

Application: Matching

Find corresponding locations in the image

slide-8
SLIDE 8

Illustration – Matching

Interest points extracted with Harris detector (~ 500 points)

slide-9
SLIDE 9

Matching Illustration – Matching

Interest points matched based on cross-correlation (188 pairs)

slide-10
SLIDE 10

Global constraints

Global constraint - Robust estimation of the fundamental matrix

Illustration – Matching

99 inliers 89 outliers

slide-11
SLIDE 11

Application: Panorama stitching

Images courtesy of A. Zisserman.

slide-12
SLIDE 12

Application: Instance-level recognition

Search for particular objects and scenes in large databases

slide-13
SLIDE 13
  • Image content is transformed into local features invariant to

geometric and photometric transformations

  • Matching local invariant descriptors

Instance-level recognition: Approach

slide-14
SLIDE 14

Finding the object despite possibly large changes in scale, viewpoint, lighting and partial occlusion

  • requires invariant description

Difficulties

Viewpoint Scale Lighting Occlusion

slide-15
SLIDE 15

Difficulties

  • Very large images collection need for efficient indexing

– Flickr has 2 billion photographs, more than 1 million added daily – Facebook has 15 billion images (~27 million added daily) – Facebook has 15 billion images (~27 million added daily) – Large personal collections – Video collections, i.e., YouTube

slide-16
SLIDE 16

Applications

  • Take a picture of a product or advertisement

find relevant information on the web [Pixee – Milpix]

slide-17
SLIDE 17

Applications

  • Copy detection for images and videos

Search in 200h of video Query video

slide-18
SLIDE 18
  • Sony Aibo – Robotics

– Recognize docking station – Place recognition – Loop closure in SLAM

Applications

slide-19
SLIDE 19

Local features - history

  • Line segments [Lowe’87, Ayache’90]
  • Interest points & cross correlation [Z. Zhang et al. 95]
  • Rotation invariance with differential invariants [Schmid&Mohr’96]
  • Scale & affine invariant detectors [Lindeberg’98, Lowe’99,

Tuytelaars&VanGool’00, Mikolajczyk&Schmid’02, Matas et al.’02]

  • Dense detectors and descriptors [Leung&Malik’99, Fei-Fei&

Perona’05, Lazebnik et al.’06]

  • Contour and region (segmentation) descriptors [Shotton et al.’05,

Opelt et al.’06, Ferrari et al.’06, Leordeanu et al.’07]

slide-20
SLIDE 20

Local features

1) Extraction of local features

– Contours/segments – Interest points & regions – Regions by segmentation – Dense features, points on a regular grid

2) Description of local features

– Dependant on the feature type – Contours/segments angles, length ratios – Interest points greylevels, gradient histograms – Regions (segmentation) texture + color distributions

slide-21
SLIDE 21

Line matching

  • Extraction de contours

– Zero crossing of Laplacian – Local maxima of gradients

  • Chain contour points (hysteresis)
  • Chain contour points (hysteresis)
  • Extraction of line segments
  • Description of segments

– Mi-point, length, orientation, angle between pairs etc.

slide-22
SLIDE 22

Experimental results – line segments

images 600 x 600

slide-23
SLIDE 23

Experimental results – line segments

248 / 212 line segments extracted

slide-24
SLIDE 24

Experimental results – line segments

89 matched line segments - 100% correct

slide-25
SLIDE 25

Experimental results – line segments

3D reconstruction

slide-26
SLIDE 26

Problems of line segments

  • Often only partial extraction

– Line segments broken into parts – Missing parts

  • Information not very discriminative
  • Information not very discriminative

– 1D information – Similar for many segments

  • Potential solutions

– Pairs and triplets of segments – Interest points

slide-27
SLIDE 27

Overview

  • Introduction to local features
  • Harris interest points + SSD, ZNCC, SIFT
  • Scale & affine invariant interest point detectors
  • Scale & affine invariant interest point detectors
  • Evaluation and comparison of different detectors
  • Region descriptors and their performance
slide-28
SLIDE 28

Harris detector [Harris & Stephens’88]

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

slide-29
SLIDE 29

Harris detector

2 ) , ( ) , (

)) , ( ) , ( ( ) , ( y y x x I y x I y x A

k k k y x W y x k

k k

∆ + ∆ + − =

Auto-correlation function for a point and a shift

) , ( y x ) , ( y x ∆ ∆

W

) , ( y x ∆ ∆

slide-30
SLIDE 30

Harris detector

2 ) , ( ) , (

)) , ( ) , ( ( ) , ( y y x x I y x I y x A

k k k y x W y x k

k k

∆ + ∆ + − =

Auto-correlation function for a point and a shift

) , ( y x ) , ( y x ∆ ∆

W

) , ( y x ∆ ∆

small in all directions large in one directions large in all directions

) , ( y x A {

→ uniform region → contour → interest point

slide-31
SLIDE 31

Harris detector

slide-32
SLIDE 32

Harris detector

Discret shifts are avoided based on the auto-correlation matrix

     ∆ + = ∆ + ∆ + x y x I y x I y x I y y x x I )) , ( ) , ( ( ) , ( ) , (

with first order approximation

( )

2 ) , (

) , ( ) , (

                ∆ ∆ =

W y x k k y k k x

k k

y x y x I y x I

     ∆ + = ∆ + ∆ + y y x I y x I y x I y y x x I

k k y k k x k k k k

)) , ( ) , ( ( ) , ( ) , (

2 ) , ( ) , (

)) , ( ) , ( ( ) , ( y y x x I y x I y x A

k k k y x W y x k

k k

∆ + ∆ + − =

slide-33
SLIDE 33

Harris detector

( )

        ∆ ∆           ∆ ∆ =

∑ ∑ ∑ ∑

∈ ∈ ∈ ∈

y x y x I y x I y x I y x I y x I y x I y x

W y x k k y W y x k k y k k x W y x k k y k k x W y x k k x

k k k k k k k k

) , ( 2 ) , ( ) , ( ) , ( 2

)) , ( ( ) , ( ) , ( ) , ( ) , ( )) , ( (

Auto-correlation matrix the sum can be smoothed with a Gaussian

( )

        ∆ ∆         ⊗ ∆ ∆ = y x I I I I I I G y x

y y x y x x 2 2

slide-34
SLIDE 34

Harris detector

  • Auto-correlation matrix

        ⊗ =

2 2

) , (

y y x y x x

I I I I I I G y x A

– captures the structure of the local neighborhood – measure based on eigenvalues of this matrix

  • 2 strong eigenvalues
  • 1 strong eigenvalue
  • 0 eigenvalue

=> interest point => contour => uniform region

slide-35
SLIDE 35

Interpreting the eigenvalues

λ2 “Corner” λ1 and λ2 are large, λ ~ λ ; “Edge” λ2 >> λ1

Classification of image points using eigenvalues of autocorrelation matrix:

λ1 λ1 ~ λ2; \ λ1 and λ2 are small; “Edge” λ1 >> λ2 “Flat” region

slide-36
SLIDE 36

Corner response function

“Corner” R > 0 “Edge” R < 0

2 2 1 2 1 2

) ( ) ( trace ) det( λ λ α λ λ α + − = − = A A R

α: constant (0.04 to 0.06)

“Edge” R < 0 “Flat” region |R| small

slide-37
SLIDE 37

Harris detector

2 2 1 2 1 2

) ( )) ( ( ) det( λ λ λ λ + − = − = k A trace k A f

Reduces the effect of a strong contour

  • Cornerness function

Reduces the effect of a strong contour

  • Interest point detection

– Treshold (absolut, relatif, number of corners) – Local maxima

) , ( ) , ( 8 , y x f y x f

  • od

neighbourh y x thresh f ′ ′ ≥ − ∈ ∀ ∧ >

slide-38
SLIDE 38

Harris Detector: Steps

slide-39
SLIDE 39

Harris Detector: Steps

Compute corner response R

slide-40
SLIDE 40

Harris Detector: Steps

Find points with large corner response: R>threshold

slide-41
SLIDE 41

Harris Detector: Steps

Take only the points of local maxima of R

slide-42
SLIDE 42

Harris Detector: Steps

slide-43
SLIDE 43

Harris detector: Summary of steps

1. Compute Gaussian derivatives at each pixel 2. Compute second moment matrix A in a Gaussian window around each pixel 3. Compute corner response function R 4. Threshold R 4. Threshold R 5. Find local maxima of response function (non-maximum suppression)

slide-44
SLIDE 44

Harris - invariance to transformations

  • Geometric transformations

– translation – rotation – similitude (rotation + scale change) – similitude (rotation + scale change) – affine (valide for local planar objects)

  • Photometric transformations

– Affine intensity changes (I → a I + b)

slide-45
SLIDE 45

Harris Detector: Invariance Properties

  • Rotation

Ellipse rotates but its shape (i.e. eigenvalues) remains the same Corner response R is invariant to image rotation

slide-46
SLIDE 46

Harris Detector: Invariance Properties

  • Affine intensity change

Only derivatives are used => invariance to intensity shift I → I + b Intensity scale: I → a I R x (image coordinate)

threshold

R x (image coordinate) Partially invariant to affine intensity change, dependent on type of threshold

slide-47
SLIDE 47

Harris Detector: Invariance Properties

  • Scaling

All points will be classified as edges Corner

Not invariant to scaling

slide-48
SLIDE 48

Comparison of patches - SSD

) , (

1 1 y

x

Comparison of the intensities in the neighborhood of two interest points

) , (

2 2 y

x

image 1 image 2

SSD : sum of square difference

2 2 2 2 1 1 1 ) 1 2 ( 1

)) , ( ) , ( (

2

j y i x I j y i x I

N N i N N j N

+ + − + +

∑ ∑

− = − = +

Small difference values similar patches

slide-49
SLIDE 49

Comparison of patches

2 2 2 2 1 1 1 ) 1 2 ( 1

)) , ( ) , ( (

2

j y i x I j y i x I

N N i N N j N

+ + − + +

∑ ∑

− = − = +

SSD : Invariance to photometric transformations? Intensity changes (I → I + b) => Normalizing with the mean of each patch Intensity changes (I → aI + b)

2 2 2 2 2 1 1 1 1 ) 1 2 ( 1

)) ) , ( ( ) ) , ( ((

2

m j y i x I m j y i x I

N N i N N j N

− + + − − + +

∑ ∑

− = − = +

=> Normalizing with the mean of each patch

2 2 2 2 2 2 1 1 1 1 1 ) 1 2 ( 1

) , ( ) , (

2 ∑ ∑

− = − = +

        − + + − − + +

N N i N N j N

m j y i x I m j y i x I σ σ

=> Normalizing with the mean and standard deviation of each patch

slide-50
SLIDE 50

Cross-correlation ZNCC

2 2 2 2 2 2 1 1 1 1 1 ) 1 2 ( 1

) , ( ) , (

2 ∑ ∑

− = − = +

        − + + − − + +

N N i N N j N

m j y i x I m j y i x I σ σ zero normalized SSD ZNCC: zero normalized cross correlation         − + + ⋅         − + +

∑ ∑

− = − = + 2 2 2 2 2 1 1 1 1 1 ) 1 2 ( 1

) , ( ) , (

2

σ σ m j y i x I m j y i x I

N N i N N j N

ZNCC values between -1 and 1, 1 when identical patches in practice threshold around 0.5

slide-51
SLIDE 51

Local descriptors

  • Greyvalue derivatives
  • Differential invariants [Koenderink’87]
  • SIFT descriptor [Lowe’99]
  • SIFT descriptor [Lowe’99]
slide-52
SLIDE 52

Greyvalue derivatives: Image gradient

  • The gradient of an image:
  • The gradient points in the direction of most rapid increase in

intensity

  • The gradient direction is given by

– how does this relate to the direction of the edge?

  • The edge strength is given by the gradient magnitude
slide-53
SLIDE 53

Differentiation and convolution

  • Recall, for 2D function, f(x,y):
  • We could approximate this as

∂f ∂x = lim

ε→0

f x + ε, y

( )

ε − f x,y

( )

ε       ∂f ∂x ≈ f xn+1,y

( )− f xn, y ( )

∆x

  • We could approximate this as

∂x ≈ ∆x

  • 1

1

  • Convolution with the filter
slide-54
SLIDE 54

Finite difference filters

  • Other approximations of derivative filters exist:
slide-55
SLIDE 55

Effects of noise

  • Consider a single row or column of the image

– Plotting intensity as a function of position gives a signal

  • Where is the edge?
slide-56
SLIDE 56

Solution: smooth first

f g

  • To find edges, look for peaks in

) ( g f dx d ∗ f * g

) ( g f dx d ∗

slide-57
SLIDE 57
  • Differentiation is convolution, and convolution is

associative:

  • This saves us one operation:

g dx d f g f dx d ∗ = ∗ ) (

Derivative theorem of convolution

g dx d f ∗

f

g dx d

slide-58
SLIDE 58

Local descriptors

        ∗ ∗ ) ( * ) , ( ) ( ) , ( ) ( ) , ( σ σ σ

x

G y x I G y x I G y x I

  • Greyvalue derivatives

– Convolution with Gaussian derivatives

) 2 exp( 2 1 ) , , (

2 2 2 2

σ πσ σ y x y x G + − =

∫ ∫

∞ ∞ − ∞ ∞ −

′ ′ ′ − ′ − ′ ′ = ∗ y d x d y y x x I y x G G y x I ) , ( ) , , ( ) ( ) , ( σ σ

                =

  • )

( * ) , ( ) ( * ) , ( ) ( * ) , ( ) ( * ) , ( ) , ( σ σ σ σ

yy xy xx y

G y x I G y x I G y x I G y x I y x v

slide-59
SLIDE 59

Local descriptors

                    ∗ ∗ ) , ( ) , ( ) , ( ) ( * ) , ( ) ( ) , ( ) ( ) , ( y x L y x L y x L G y x I G y x I G y x I

y x y x

σ σ σ

Notation for greyvalue derivatives [Koenderink’87]

              =               =

  • )

, ( ) , ( ) , ( ) , ( ) ( * ) , ( ) ( * ) , ( ) ( * ) , ( ) ( * ) , ( ) , ( y x L y x L y x L y x L G y x I G y x I G y x I G y x I y x

yy xy xx y yy xy xx y

σ σ σ σ v

Invariance?

slide-60
SLIDE 60

Local descriptors – rotation invariance

Invariance to image rotation : differential invariants [Koen87]

        + + +

y y x x

L L L L L L L L L L L L L 2

gradient magnitude

                      + + + + +

  • yy

yy xy xy xx xx yy xx yy yy y x xy x x xx

L L L L L L L L L L L L L L L L 2 2

Laplacian

slide-61
SLIDE 61

Laplacian of Gaussian (LOG)

) ( ) ( σ σ

yy xx

G G LOG + =

slide-62
SLIDE 62

SIFT descriptor [Lowe’99]

  • Approach

– 8 orientations of the gradient – 4x4 spatial grid – Dimension 128 – soft-assignment to spatial bins – normalization of the descriptor to norm one – normalization of the descriptor to norm one – comparison with Euclidean distance gradient 3D histogram

→ →

image patch

y x

slide-63
SLIDE 63

Local descriptors - rotation invariance

  • Estimation of the dominant orientation

– extract gradient orientation – histogram over gradient orientation – peak in this histogram

  • Rotate patch in dominant direction
slide-64
SLIDE 64

Local descriptors – illumination change

in case of an affine transformation

b aI I + = ) ( ) (

2 1

x x

  • Robustness to illumination changes
slide-65
SLIDE 65

Local descriptors – illumination change

in case of an affine transformation

b aI I + = ) ( ) (

2 1

x x

  • Normalization of derivatives with gradient magnitude
  • Robustness to illumination changes
  • Normalization of derivatives with gradient magnitude

y y x x yy xx

L L L L L L + + ) (

slide-66
SLIDE 66

Local descriptors – illumination change

in case of an affine transformation

b aI I + = ) ( ) (

2 1

x x

  • Normalization of derivatives with gradient magnitude
  • Robustness to illumination changes
  • Normalization of the image patch with mean and variance
  • Normalization of derivatives with gradient magnitude

y y x x yy xx

L L L L L L + + ) (

slide-67
SLIDE 67

Invariance to scale changes

  • Scale change between two images
  • Scale factor s can be eliminated
  • Support region for calculation!!

– In case of a convolution with Gaussian derivatives defined by

) 2 exp( 2 1 ) , , (

2 2 2 2

σ πσ σ y x y x G + − =

∫ ∫

∞ ∞ − ∞ ∞ −

′ ′ ′ − ′ − ′ ′ = ∗ y d x d y y x x I y x G G y x I ) , ( ) , , ( ) ( ) , ( σ σ

σ

slide-68
SLIDE 68

Overview

  • Introduction to local features
  • Harris interest points + SSD, ZNCC, SIFT
  • Scale & affine invariant interest point detectors
  • Scale & affine invariant interest point detectors
  • Evaluation and comparison of different detectors
  • Region descriptors and their performance
slide-69
SLIDE 69

Scale invariance - motivation

  • Description regions have to be adapted to scale changes
  • Interest points have to be repeatable for scale changes
slide-70
SLIDE 70

Harris detector + scale changes

|) | |, max(| | } ) ), ( ( | ) , {( | ) (

i i i i i i

H dist R b a b a b a ε ε < =

Repeatability rate

slide-71
SLIDE 71

Scale adaptation

        =         =        

1 1 2 2 2 2 1 1 1

sy sx I y x I y x I Scale change between two images       Scale adapted derivative calculation

slide-72
SLIDE 72

Scale adaptation

        =         =        

1 1 2 2 2 2 1 1 1

sy sx I y x I y x I Scale change between two images      

) ( ) (

1 1

2 2 2 1 1 1

σ σ s G y x I s G y x I

n n

i i n i i

        = ⊗        

Scale adapted derivative calculation

σ s

n

s

slide-73
SLIDE 73

Scale adaptation

) (σ

i

L where are the derivatives with Gaussian convolution

        ⊗ ) ( ) ( ) ( ) ( ) ~ (

2 2

σ σ σ σ σ

y y x y x x

L L L L L L G

slide-74
SLIDE 74

Scale adaptation

) (σ

i

L where are the derivatives with Gaussian convolution

        ⊗ ) ( ) ( ) ( ) ( ) ~ (

2 2

σ σ σ σ σ

y y x y x x

L L L L L L G

      ⊗ ) ( ) ( ) ( ) ( ) ~ (

2 2 2

σ σ σ σ σ s L s L L s L L s L s G s

y y x y x x

Scale adapted auto-correlation matrix

slide-75
SLIDE 75

Harris detector – adaptation to scale

} ) ), ( ( | ) , {( ) ( ε ε < =

i i i i

H dist R b a b a

slide-76
SLIDE 76

Multi-scale matching algorithm

1 = s 3 = s 5 = s

slide-77
SLIDE 77

Multi-scale matching algorithm

1 = s

8 matches

slide-78
SLIDE 78

Multi-scale matching algorithm

1 = s

3 matches

Robust estimation of a global affine transformation

slide-79
SLIDE 79

Multi-scale matching algorithm

1 = s

3 matches

3 = s

4 matches

slide-80
SLIDE 80

Multi-scale matching algorithm

1 = s

3 matches

3 = s 5 = s

4 matches 16 matches

correct scale

highest number of matches

slide-81
SLIDE 81

Matching results

Scale change of 5.7

slide-82
SLIDE 82

Matching results

100% correct matches (13 matches)

slide-83
SLIDE 83

Scale selection

  • We want to find the characteristic scale of the blob by

convolving it with Laplacians at several scales and looking for the maximum response

  • However, Laplacian response decays as scale

increases:

Why does this happen?

increasing σ

  • riginal signal

(radius=8)

slide-84
SLIDE 84

Scale normalization

  • The response of a derivative of Gaussian filter to a perfect

step edge decreases as σ increases

1 π σ 2 1

slide-85
SLIDE 85

Scale normalization

  • The response of a derivative of Gaussian filter to a perfect

step edge decreases as σ increases

  • To keep response the same (scale-invariant), must

multiply Gaussian derivative by σ

  • Laplacian is the second Gaussian derivative, so it must be
  • Laplacian is the second Gaussian derivative, so it must be

multiplied by σ2

slide-86
SLIDE 86

Effect of scale normalization

Unnormalized Laplacian response Original signal Scale-normalized Laplacian response maximum

slide-87
SLIDE 87

Blob detection in 2D

  • Laplacian of Gaussian: Circularly symmetric operator for

blob detection in 2D

2 2 2 2 2

y g x g g ∂ ∂ + ∂ ∂ = ∇

slide-88
SLIDE 88

Blob detection in 2D

  • Laplacian of Gaussian: Circularly symmetric operator for

blob detection in 2D

        ∂ ∂ + ∂ ∂ = ∇

2 2 2 2 2 2 norm

y g x g g σ

Scale-normalized:

slide-89
SLIDE 89

Scale selection

  • The 2D Laplacian is given by
  • For a binary circle of radius r, the Laplacian achieves a

2 2 2

2 / ) ( 2 2 2

) 2 (

σ

σ

y x

e y x

+ −

− +

(up to scale)

  • For a binary circle of radius r, the Laplacian achieves a

maximum at

2 / r = σ

r

2 / r image Laplacian response scale (σ)

slide-90
SLIDE 90

Characteristic scale

  • We define the characteristic scale as the scale that

produces peak of Laplacian response

characteristic scale

  • T. Lindeberg (1998). Feature detection with automatic scale selection.

International Journal of Computer Vision 30 (2): pp 77--116.

slide-91
SLIDE 91

Scale selection

  • For a point compute a value (gradient, Laplacian etc.) at

several scales

  • Normalization of the values with the scale factor

e.g. Laplacian

| ) ( |

2 yy xx

L L s +

  • Select scale at the maximum → characteristic scale
  • Exp. results show that the Laplacian gives best results

| ) ( |

2 yy xx

L L s +

s

scale

slide-92
SLIDE 92

Scale selection

  • Scale invariance of the characteristic scale

s

  • norm. Lap.

scale

slide-93
SLIDE 93

Scale selection

  • Scale invariance of the characteristic scale

s

∗ ∗ =

2 1

s s s

  • norm. Lap.
  • norm. Lap.
  • Relation between characteristic scales

scale scale

slide-94
SLIDE 94

Scale-invariant detectors

  • Harris-Laplace (Mikolajczyk & Schmid’01)
  • Laplacian detector (Lindeberg’98)
  • Difference of Gaussian (Lowe’99)

Harris-Laplace Laplacian

slide-95
SLIDE 95

Harris-Laplace

multi-scale Harris points invariant points + associated regions [Mikolajczyk & Schmid’01] selection of points at maximum of Laplacian

slide-96
SLIDE 96

Matching results

213 / 190 detected interest points

slide-97
SLIDE 97

Matching results

58 points are initially matched

slide-98
SLIDE 98

Matching results

32 points are matched after verification – all correct

slide-99
SLIDE 99

LOG detector

Convolve image with scale- normalized Laplacian at several scales

)) ( ) ( (

2

σ σ

yy xx

G G s LOG + =

Detection of maxima and minima

  • f Laplacian in scale space
slide-100
SLIDE 100

Hessian detector

      =

yy xy xy xx

L L L L x H ) (

Hessian matrix

2 xy yy xx

L L L DET − =

Determinant of Hessian matrix Penalizes/eliminates long structures

with small derivative in a single direction

slide-101
SLIDE 101

Efficient implementation

  • Difference of Gaussian (DOG) approximates the

Laplacian

) ( ) ( σ σ G k G DOG − =

  • Error due to the approximation
slide-102
SLIDE 102

DOG detector

  • Fast computation, scale space processed one octave at a

time

David G. Lowe. "Distinctive image features from scale-invariant keypoints.”IJCV 60 (2).