29
Object Segmentation Stella X. Yu Department of Computer Science University of California at Berkeley Yu: Bay Area Vision Meeting 2003 – p.1/20

Object Segmentation - EECS at UC Berkeley

  • Upload
    others

  • View
    7

  • Download
    0

Embed Size (px)

Citation preview

Page 1: Object Segmentation - EECS at UC Berkeley

Object Segmentation

Stella X. Yu

Department of Computer Science

University of California at Berkeley

Yu: Bay Area Vision Meeting 2003 – p.1/20

Page 2: Object Segmentation - EECS at UC Berkeley

Object Segmentation

Yu: Bay Area Vision Meeting 2003 – p.2/20

Page 3: Object Segmentation - EECS at UC Berkeley

Direct Feature Classification for Object Detection

image

recognition

Yu: Bay Area Vision Meeting 2003 – p.3/20

Page 4: Object Segmentation - EECS at UC Berkeley

Why Perceptual Organization

15

9

Mahamud multi-object detector

Yu: Bay Area Vision Meeting 2003 – p.4/20

Page 5: Object Segmentation - EECS at UC Berkeley

Traditional Use of Perceptual Organization

image

segmentation

figure-ground

recognitionperceptual organization

sequential processing (Marr, Lowe, Witkin, Tenenbaum, ...)

Yu: Bay Area Vision Meeting 2003 – p.5/20

Page 6: Object Segmentation - EECS at UC Berkeley

Our Approach to Object Segmentation

Yu: Bay Area Vision Meeting 2003 – p.6/20

Page 7: Object Segmentation - EECS at UC Berkeley

Our Approach to Object Segmentation

Yu: Bay Area Vision Meeting 2003 – p.6/20

Page 8: Object Segmentation - EECS at UC Berkeley

Our Approach to Object Segmentation

Yu: Bay Area Vision Meeting 2003 – p.6/20

Page 9: Object Segmentation - EECS at UC Berkeley

Our Approach to Object Segmentation

Yu: Bay Area Vision Meeting 2003 – p.6/20

Page 10: Object Segmentation - EECS at UC Berkeley

Our Approach to Object Segmentation

Yu: Bay Area Vision Meeting 2003 – p.6/20

Page 11: Object Segmentation - EECS at UC Berkeley

Our Approach to Object Segmentation

Yu: Bay Area Vision Meeting 2003 – p.6/20

Page 12: Object Segmentation - EECS at UC Berkeley

Grouping in a Graph-Theoretic Framework

��

��

Yu: Bay Area Vision Meeting 2003 – p.7/20

Page 13: Object Segmentation - EECS at UC Berkeley

Grouping in a Graph-Theoretic Framework

��

��

Representation: G = {V, E, W} = { nodes, edges, weights }

Yu: Bay Area Vision Meeting 2003 – p.7/20

Page 14: Object Segmentation - EECS at UC Berkeley

Grouping in a Graph-Theoretic Framework

��

��

Representation: G = {V, E, W} = { nodes, edges, weights }

Clustering: ΓKV = {V1, . . . , VK} = K-way node partitioning

(Shi & Malik, Zabih, Boykov, Veksler, Kolmogorov,...)

Yu: Bay Area Vision Meeting 2003 – p.7/20

Page 15: Object Segmentation - EECS at UC Berkeley

Links in Graph Cuts

��

��

Yu: Bay Area Vision Meeting 2003 – p.8/20

Page 16: Object Segmentation - EECS at UC Berkeley

Links in Graph Cuts

��

��

��

��

P Q

Yu: Bay Area Vision Meeting 2003 – p.8/20

Page 17: Object Segmentation - EECS at UC Berkeley

Links in Graph Cuts

��

��

P Q

links(P, Q) =∑

p∈P, q∈Q

W (p, q)

Yu: Bay Area Vision Meeting 2003 – p.8/20

Page 18: Object Segmentation - EECS at UC Berkeley

Degree in Graph Cuts

��

��

P Q

degree(P) = links(P, V)

Yu: Bay Area Vision Meeting 2003 – p.9/20

Page 19: Object Segmentation - EECS at UC Berkeley

Linkratio in Graph Cuts

��

��

P Q

linkratio(P, Q) =links(P, Q)

degree(P)

Yu: Bay Area Vision Meeting 2003 – p.10/20

Page 20: Object Segmentation - EECS at UC Berkeley

Goodness of Grouping in Graph Cuts

��

��

P

V \ P

Maximize within-group connections: linkratio(P, P)

Minimize between-group connections: linkratio(P, V \ P)

Equivalent: linkratio(P, P) + linkratio(P, V \ P) = 1

Yu: Bay Area Vision Meeting 2003 – p.11/20

Page 21: Object Segmentation - EECS at UC Berkeley

K-Way Normalized Cuts

��

��

V1 V2

V3

max knassoc(ΓKV ) =

1

K

K∑

l=1

linkratio(Vl, Vl)

min kncuts(ΓKV ) =

1

K

K∑

l=1

linkratio(Vl, V \ Vl)

Yu: Bay Area Vision Meeting 2003 – p.12/20

Page 22: Object Segmentation - EECS at UC Berkeley

Joint Pixel-Patch Grouping: Criterion

A

B

C

ε̄(ΓKV , ΓK

U ; A, B) =1

K

K∑

l=1

linkratio(Ul, Ul; B) · degree(Ul; B)

degree(Vl; A) + degree(Ul; B)

+1

K

K∑

l=1

linkratio(Vl, Vl; A) · degree(Vl; A)

degree(Vl; A) + degree(Ul; B)

Yu: Bay Area Vision Meeting 2003 – p.13/20

Page 23: Object Segmentation - EECS at UC Berkeley

Joint Pixel-Patch Grouping: Consistency

A

B

C

ΓKU = {U1, . . . , UK}, ΓK

V = {V1, . . . , VK}

Bias linking patches with their pixels

Yu: Bay Area Vision Meeting 2003 – p.14/20

Page 24: Object Segmentation - EECS at UC Berkeley

Computing Constrained Normalized Cuts

• Constrained eigenvalue problem

• Efficient solution using a projector onto the feasible space

• Generalize Rayleigh-Ritz theorem to projected matrices

Yu: Bay Area Vision Meeting 2003 – p.15/20

Page 25: Object Segmentation - EECS at UC Berkeley

How Object Knowledge Helps Segmentation

pixel only pixel w/ ROI pixel-patch

541s 150s 110s

Yu: Bay Area Vision Meeting 2003 – p.16/20

Page 26: Object Segmentation - EECS at UC Berkeley

How Segmentation Helps Object Detection

image patch density segmentation

Yu: Bay Area Vision Meeting 2003 – p.17/20

Page 27: Object Segmentation - EECS at UC Berkeley

When Does Our Method Fail

image patch density segmentation

Yu: Bay Area Vision Meeting 2003 – p.18/20

Page 28: Object Segmentation - EECS at UC Berkeley

Equally Applicable to Multiple Objects

Yu: Bay Area Vision Meeting 2003 – p.19/20

Page 29: Object Segmentation - EECS at UC Berkeley

Acknowledgements

• Shyjan MahamudJianbo Shi

• CMU HumanID LabCMU Hebert Lab

• ONR N00014-00-1-0915NSF IRI-9817496

Yu: Bay Area Vision Meeting 2003 – p.20/20