Accurate Object Localization with Shape Masks Marcin Marszaek - - PowerPoint PPT Presentation

accurate object localization with shape masks
SMART_READER_LITE
LIVE PREVIEW

Accurate Object Localization with Shape Masks Marcin Marszaek - - PowerPoint PPT Presentation

Introduction Method description Experiments Summary Accurate Object Localization with Shape Masks Marcin Marszaek Cordelia Schmid LEAR, INRIA / LJK, Grenoble, France CVPR 2007 Marcin Marszaek, Cordelia Schmid Accurate Object


slide-1
SLIDE 1

Introduction Method description Experiments Summary

Accurate Object Localization with Shape Masks

Marcin Marszałek Cordelia Schmid

LEAR, INRIA / LJK, Grenoble, France

CVPR 2007

Marcin Marszałek, Cordelia Schmid Accurate Object Localization with Shape Masks

slide-2
SLIDE 2

Introduction Method description Experiments Summary

Outline

1

Introduction Problem definition Existing solutions Our approach

2

Method description Basic building blocks Training procedure Recognition procedure

3

Experiments Dataset Importance of aspect clustering Evaluation of recognition components Comparison to the state-of-the-art

4

Summary

Marcin Marszałek, Cordelia Schmid Accurate Object Localization with Shape Masks

slide-3
SLIDE 3

Introduction Method description Experiments Summary Problem definition Existing solutions Our approach

Outline

1

Introduction Problem definition Existing solutions Our approach

2

Method description Basic building blocks Training procedure Recognition procedure

3

Experiments Dataset Importance of aspect clustering Evaluation of recognition components Comparison to the state-of-the-art

4

Summary

Marcin Marszałek, Cordelia Schmid Accurate Object Localization with Shape Masks

slide-4
SLIDE 4

Introduction Method description Experiments Summary Problem definition Existing solutions Our approach

Object class localization

Given an unseen image and a known object class. . . . . . decide where in the image the object of this class is Open questions: How should we answer the question “where”?

Center of the object Bounding box Object outline

What if there is no object or if there are several of them?

The concept of “object” is crucial

Marcin Marszałek, Cordelia Schmid Accurate Object Localization with Shape Masks

slide-5
SLIDE 5

Introduction Method description Experiments Summary Problem definition Existing solutions Our approach

Hough space voting with fragment backprojection

Leibe, Seemann and Schiele [CVPR’05], Opelt, Pinz and Zisserman [CVPR’06]

Hough space implies low-dimensional localization hypotheses, so parametrized shapes have to be used Articulated objects and multiple viewpoints may be confused, backprojection suffers from global consistency problems We replace the Hough space with a high-dimensional hypothesis space based on shape masks

Leibe et al.

Marcin Marszałek, Cordelia Schmid Accurate Object Localization with Shape Masks

slide-6
SLIDE 6

Introduction Method description Experiments Summary Problem definition Existing solutions Our approach

Pixel annotation and object segmentation

Shotton, Winn, Rother and Criminisi [ECCV’06], Todorovic and Ahuja [CVPR’06]

The notion of object concept is necessary to separate multiple instances Segmentation does not include occluded object parts, but in fact the object is there We aim to separate object instances and to determine approximate object outlines

Shotton at al. [ECCV’06] Todorovic and Ahuja [CVPR’06]

Marcin Marszałek, Cordelia Schmid Accurate Object Localization with Shape Masks

slide-7
SLIDE 7

Introduction Method description Experiments Summary Problem definition Existing solutions Our approach

Our approach: Using shape masks as hypotheses

Local features and shape masks can be used to cast localization hypotheses [CVPR’06] We propose to evaluate the hypotheses when cast to clean the hypothesis space before looking for maxima We show how to cluster the hypotheses to find maxima in the high-dimensional hypothesis space

Marcin Marszałek, Cordelia Schmid Accurate Object Localization with Shape Masks

slide-8
SLIDE 8

Introduction Method description Experiments Summary Problem definition Existing solutions Our approach

Features of our approach

Object localization with approximate outlines (rich answers) Implicit handling of multiple object aspects (detection during training and combination during testing) Detection of multiple object instances per image Segmentation of occluded object parts

Marcin Marszałek, Cordelia Schmid Accurate Object Localization with Shape Masks

slide-9
SLIDE 9

Introduction Method description Experiments Summary Basic building blocks Training procedure Recognition procedure

Outline

1

Introduction Problem definition Existing solutions Our approach

2

Method description Basic building blocks Training procedure Recognition procedure

3

Experiments Dataset Importance of aspect clustering Evaluation of recognition components Comparison to the state-of-the-art

4

Summary

Marcin Marszałek, Cordelia Schmid Accurate Object Localization with Shape Masks

slide-10
SLIDE 10

Introduction Method description Experiments Summary Basic building blocks Training procedure Recognition procedure

Casting localization hypotheses

To compute features, Harris-Laplace and Laplacian interest points are detected and described with SIFT For each feature i the rectification matrix θi is saved and for training features a pointer to the shape mask ζi is kept By matching the test features with the training features, localization hypotheses in the form of shape masks can be generated The mask ζi can be projected to the reference frame of test feature j by composing it with the transformation matrix Pij = θ−1

i

θj

Marcin Marszałek, Cordelia Schmid Accurate Object Localization with Shape Masks

slide-11
SLIDE 11

Introduction Method description Experiments Summary Basic building blocks Training procedure Recognition procedure

Casting localization hypotheses

To compute features, Harris-Laplace and Laplacian interest points are detected and described with SIFT For each feature i the rectification matrix θi is saved and for training features a pointer to the shape mask ζi is kept By matching the test features with the training features, localization hypotheses in the form of shape masks can be generated The mask ζi can be projected to the reference frame of test feature j by composing it with the transformation matrix Pij = θ−1

i

θj

Marcin Marszałek, Cordelia Schmid Accurate Object Localization with Shape Masks

slide-12
SLIDE 12

Introduction Method description Experiments Summary Basic building blocks Training procedure Recognition procedure

Casting localization hypotheses

To compute features, Harris-Laplace and Laplacian interest points are detected and described with SIFT For each feature i the rectification matrix θi is saved and for training features a pointer to the shape mask ζi is kept By matching the test features with the training features, localization hypotheses in the form of shape masks can be generated The mask ζi can be projected to the reference frame of test feature j by composing it with the transformation matrix Pij = θ−1

i

θj

Marcin Marszałek, Cordelia Schmid Accurate Object Localization with Shape Masks

slide-13
SLIDE 13

Introduction Method description Experiments Summary Basic building blocks Training procedure Recognition procedure

Casting localization hypotheses

To compute features, Harris-Laplace and Laplacian interest points are detected and described with SIFT For each feature i the rectification matrix θi is saved and for training features a pointer to the shape mask ζi is kept By matching the test features with the training features, localization hypotheses in the form of shape masks can be generated The mask ζi can be projected to the reference frame of test feature j by composing it with the transformation matrix Pij = θ−1

i

θj

Marcin Marszałek, Cordelia Schmid Accurate Object Localization with Shape Masks

slide-14
SLIDE 14

Introduction Method description Experiments Summary Basic building blocks Training procedure Recognition procedure

Casting localization hypotheses

To compute features, Harris-Laplace and Laplacian interest points are detected and described with SIFT For each feature i the rectification matrix θi is saved and for training features a pointer to the shape mask ζi is kept By matching the test features with the training features, localization hypotheses in the form of shape masks can be generated The mask ζi can be projected to the reference frame of test feature j by composing it with the transformation matrix Pij = θ−1

i

θj

Marcin Marszałek, Cordelia Schmid Accurate Object Localization with Shape Masks

slide-15
SLIDE 15

Introduction Method description Experiments Summary Basic building blocks Training procedure Recognition procedure

Casting localization hypotheses

To compute features, Harris-Laplace and Laplacian interest points are detected and described with SIFT For each feature i the rectification matrix θi is saved and for training features a pointer to the shape mask ζi is kept By matching the test features with the training features, localization hypotheses in the form of shape masks can be generated The mask ζi can be projected to the reference frame of test feature j by composing it with the transformation matrix Pij = θ−1

i

θj

Marcin Marszałek, Cordelia Schmid Accurate Object Localization with Shape Masks

slide-16
SLIDE 16

Introduction Method description Experiments Summary Basic building blocks Training procedure Recognition procedure

Casting localization hypotheses

To compute features, Harris-Laplace and Laplacian interest points are detected and described with SIFT For each feature i the rectification matrix θi is saved and for training features a pointer to the shape mask ζi is kept By matching the test features with the training features, localization hypotheses in the form of shape masks can be generated The mask ζi can be projected to the reference frame of test feature j by composing it with the transformation matrix Pij = θ−1

i

θj

Marcin Marszałek, Cordelia Schmid Accurate Object Localization with Shape Masks

slide-17
SLIDE 17

Introduction Method description Experiments Summary Basic building blocks Training procedure Recognition procedure

Similarity between shape masks

A shape mask S : R2 → R is a natural generalization of the discrete binary segmentation mask Sb : Z2 → {0, 1} A commonly used overlap area measure

  • b(Qb, Rb) = |Q1

b ∩ R1 b|

|Q1

b ∪ R1 b| =

min(Qb, Rb) max(Qb, Rb) is generalized to a mask overlap similarity measure

  • s(Q, R) =
  • min(Q, R)
  • max(Q, R)

We define a similarity measure between shape masks ζi and ζj associated with features i and j as o(i, j) = os(ζi ◦ Pij, ζj)

Marcin Marszałek, Cordelia Schmid Accurate Object Localization with Shape Masks

slide-18
SLIDE 18

Introduction Method description Experiments Summary Basic building blocks Training procedure Recognition procedure

Similarity between shape masks

A shape mask S : R2 → R is a natural generalization of the discrete binary segmentation mask Sb : Z2 → {0, 1} A commonly used overlap area measure

  • b(Qb, Rb) = |Q1

b ∩ R1 b|

|Q1

b ∪ R1 b| =

min(Qb, Rb) max(Qb, Rb) is generalized to a mask overlap similarity measure

  • s(Q, R) =
  • min(Q, R)
  • max(Q, R)

We define a similarity measure between shape masks ζi and ζj associated with features i and j as o(i, j) = os(ζi ◦ Pij, ζj)

Marcin Marszałek, Cordelia Schmid Accurate Object Localization with Shape Masks

slide-19
SLIDE 19

Introduction Method description Experiments Summary Basic building blocks Training procedure Recognition procedure

Similarity between shape masks

A shape mask S : R2 → R is a natural generalization of the discrete binary segmentation mask Sb : Z2 → {0, 1} A commonly used overlap area measure

  • b(Qb, Rb) = |Q1

b ∩ R1 b|

|Q1

b ∪ R1 b| =

min(Qb, Rb) max(Qb, Rb) is generalized to a mask overlap similarity measure

  • s(Q, R) =
  • min(Q, R)
  • max(Q, R)

We define a similarity measure between shape masks ζi and ζj associated with features i and j as o(i, j) = os(ζi ◦ Pij, ζj)

Marcin Marszałek, Cordelia Schmid Accurate Object Localization with Shape Masks

slide-20
SLIDE 20

Introduction Method description Experiments Summary Basic building blocks Training procedure Recognition procedure

Evaluation of shape masks

A bag-of-features representation can be computed for the image part covered by a shape mask A non-linear SVM classifier with χ2 kernel is trained to distinguish between object and background

image positive negative

Marcin Marszałek, Cordelia Schmid Accurate Object Localization with Shape Masks

slide-21
SLIDE 21

Introduction Method description Experiments Summary Basic building blocks Training procedure Recognition procedure

The training procedure

1

Sparse local features are computed for the training images

2

Then Object aspects are learned by agglomerative clustering

  • f object shape masks

An object classifier is trained with segmented objects (positive samples) and background (negative samples)

Marcin Marszałek, Cordelia Schmid Accurate Object Localization with Shape Masks

slide-22
SLIDE 22

Introduction Method description Experiments Summary Basic building blocks Training procedure Recognition procedure

Agglomerative aspect clustering - main loop

1

For each pair of similar features, the similarity between the associated shape masks is computed

2

Feature pairs with similar shape masks (similarity above T = 0.85) vote for shape mask pairs to get merged

3

The shape mask pair with the highest number of votes is merged according to the best feature pair match

4

The features associated with the masks are combined

Marcin Marszałek, Cordelia Schmid Accurate Object Localization with Shape Masks

slide-23
SLIDE 23

Introduction Method description Experiments Summary Basic building blocks Training procedure Recognition procedure

Agglomerative aspect clustering - singleton pruning

Aspect merging is repeated until no more aspects are found to be similar enough After the agglomerative aspect clustering is over, singletons (outliers) can be discarded

Marcin Marszałek, Cordelia Schmid Accurate Object Localization with Shape Masks

slide-24
SLIDE 24

Introduction Method description Experiments Summary Basic building blocks Training procedure Recognition procedure

Agglomerative aspect clustering - singleton pruning

Aspect merging is repeated until no more aspects are found to be similar enough After the agglomerative aspect clustering is over, singletons (outliers) can be discarded Demo Example for aspect clustering

Marcin Marszałek, Cordelia Schmid Accurate Object Localization with Shape Masks

slide-25
SLIDE 25

Introduction Method description Experiments Summary Basic building blocks Training procedure Recognition procedure

The recognition procedure

1

Each local feature in a test image is matched with similar training features and a localization hypothesis is generated for each pair

2

Generated hypotheses are evaluated on-line with the object classifier and a score is assigned

3

The hypotheses are clustered on-line (up to L = 100 hypotheses are kept). Similar hypotheses are merged (similarity threshold U = 0.7) and the scores are added. Non-promising hypotheses (with the lowest score) are dropped.

4

Overlapping hypotheses are removed

Marcin Marszałek, Cordelia Schmid Accurate Object Localization with Shape Masks

slide-26
SLIDE 26

Introduction Method description Experiments Summary Basic building blocks Training procedure Recognition procedure

Main points of our framework

Ambiguities introduced by local features may generate false hypotheses Hypothesis evaluation helps to avoid them in our framework Occlusion weakens the discriminative classifier response and the object may be missed This is reduced in our framework by collecting the local evidence provided by consistent features

Hypothesis evaluation Evidence collection

Marcin Marszałek, Cordelia Schmid Accurate Object Localization with Shape Masks

slide-27
SLIDE 27

Introduction Method description Experiments Summary Dataset Importance of aspect clustering Evaluation of recognition components Comparison to the state-of-the-art

Outline

1

Introduction Problem definition Existing solutions Our approach

2

Method description Basic building blocks Training procedure Recognition procedure

3

Experiments Dataset Importance of aspect clustering Evaluation of recognition components Comparison to the state-of-the-art

4

Summary

Marcin Marszałek, Cordelia Schmid Accurate Object Localization with Shape Masks

slide-28
SLIDE 28

Introduction Method description Experiments Summary Dataset Importance of aspect clustering Evaluation of recognition components Comparison to the state-of-the-art

INRIA Annotations for Graz-02 (IG02)

http://lear.inrialpes.fr/data/

Marcin Marszałek, Cordelia Schmid Accurate Object Localization with Shape Masks

slide-29
SLIDE 29

Introduction Method description Experiments Summary Dataset Importance of aspect clustering Evaluation of recognition components Comparison to the state-of-the-art

Impact of aspect clustering

Aspect clustering improves the recognition results Singleton pruning leads to further improvement Furthermore, both of them improve runtime complexity

0.2 0.4 0.6 0.8 0.2 0.4 0.6 0.8 1 1.2 1.4 1.6 1.8 recall FP / image No aspect clustering No singletons pruning Our full framework

Recognition rate for Graz-02 cars

Marcin Marszałek, Cordelia Schmid Accurate Object Localization with Shape Masks

slide-30
SLIDE 30

Introduction Method description Experiments Summary Dataset Importance of aspect clustering Evaluation of recognition components Comparison to the state-of-the-art

Importance of recognition components

  • bject class

cars people bicycles no hypothesis evaluation 40.4% 28.4% 46.6% no evidence collection 50.3% 40.3% 48.9%

  • ur full framework

53.8% 44.1% 61.8% Table: Pixel-based RPC EER measuring the impact of hypothesis evaluation and evidence collection on Graz-02

For each class the combined framework shows better performance than hypothesis evaluation or evidence collection separately Therefore, both elements are necessary in order to perform precise object class localization

Marcin Marszałek, Cordelia Schmid Accurate Object Localization with Shape Masks

slide-31
SLIDE 31

Introduction Method description Experiments Summary Dataset Importance of aspect clustering Evaluation of recognition components Comparison to the state-of-the-art

Results on Graz-02 dataset

Confidence: 1103.1 561.8 4.9

Marcin Marszałek, Cordelia Schmid Accurate Object Localization with Shape Masks

slide-32
SLIDE 32

Introduction Method description Experiments Summary Dataset Importance of aspect clustering Evaluation of recognition components Comparison to the state-of-the-art

Comparison to the state-of-the-art

Shotton et al. [ICCV’05] 92.1% Our framework (T = 0.85, with singletons) 94.6% Our framework (T = 0.7, no singletons) 94.6% Table: RPC EER for Weizmann horse dataset

We closely follow the experimental setup of Shotton et al. Due to large number of articulations, we had to lower the aspect merge threshold or turn off singleton pruning

Marcin Marszałek, Cordelia Schmid Accurate Object Localization with Shape Masks

slide-33
SLIDE 33

Introduction Method description Experiments Summary

Summary

An object localization framework with shape masks as localization hypotheses was proposed The object outline incorporates additional information about viewpoint, articulation, sub-type or state At the same time, the experimental results show that the standard localization performance of the method is comparable to the state-of-the-art Our method performs well on natural images and handles robustly multiple object aspects, significant intra-class variations, occlusions and background clutter

Marcin Marszałek, Cordelia Schmid Accurate Object Localization with Shape Masks

slide-34
SLIDE 34

Introduction Method description Experiments Summary

Thank you for your attention

I will be glad to answer your questions INRIA Annotations for Graz-02 (IG02): http://lear.inrialpes.fr/data/

Marcin Marszałek, Cordelia Schmid Accurate Object Localization with Shape Masks