normalized cuts demo

37
Normalized Cuts Demo Original Implementation from: Jianbo Shi Jitendra Malik Presented by: Joseph Djugash

Upload: louie

Post on 14-Jan-2016

77 views

Category:

Documents


0 download

DESCRIPTION

Normalized Cuts Demo. Original Implementation from: Jianbo Shi Jitendra Malik Presented by: Joseph Djugash. Outline. Clustering Point The Eigenvectors The Affinity Matrix Comparison with K-means Segmentation of Images The Eigenvectors Comparison with K-means. - PowerPoint PPT Presentation

TRANSCRIPT

Page 1: Normalized Cuts Demo

Normalized Cuts Demo

Original Implementation from: Jianbo Shi

Jitendra Malik

Presented by:Joseph Djugash

Page 2: Normalized Cuts Demo

Outline

Clustering Point The Eigenvectors The Affinity Matrix Comparison with K-means

Segmentation of Images The Eigenvectors Comparison with K-means

Page 3: Normalized Cuts Demo

Clustering – How many groups are there?

Out of the various possible partitions, which is the correct one?

Page 4: Normalized Cuts Demo

Clustering – Why is it hard?

Number of components/clusters?

The structure of the components?

Estimation or optimization problem? Convergence to the globally correct solution?

Page 5: Normalized Cuts Demo

Clustering – Example 1

Optimal?

How do we arrive at this Clustering?

Page 6: Normalized Cuts Demo

What does the Affinity Matrix Look Like?

Page 7: Normalized Cuts Demo

The Eigenvectors and the ClustersStep-Function like behavior preferred!

Makes Clustering Easier.

Page 8: Normalized Cuts Demo

The Eigenvectors and the Clusters

Page 9: Normalized Cuts Demo

Clustering – Example 2

Dense Square Cluster

Sparse Square Cluster

Sparse Circle

Cluster

Page 10: Normalized Cuts Demo

Normalized Cut Result

Page 11: Normalized Cuts Demo

The Affinity Matrix

Page 12: Normalized Cuts Demo

The Eigenvectors and the Clusters

Page 13: Normalized Cuts Demo

K-means – Why not?

e1

e2

Input

Eigenvectors

Affinity Matrix

Eigenvector Projection

NCut Output

K-means Output

K-means Clustering?

Possible but not Investigated Here.

Page 14: Normalized Cuts Demo

K-means Result – Example 1

Page 15: Normalized Cuts Demo

K-means Result – Example 2

Page 16: Normalized Cuts Demo

Varying the Number of Clusters

k = 3 k = 4 k = 6

K-

mea

ns

N-C

ut

Page 17: Normalized Cuts Demo

Varying the Sigma Value

σ = 3 σ = 13 σ = 25

Page 18: Normalized Cuts Demo

Image Segmentation – Example 1

Affinity/Similarity matrix (W) based on Intervening Contours and Image Intensity

Page 19: Normalized Cuts Demo

The Eigenvectors

Page 20: Normalized Cuts Demo

Comparison with K-means

Normalized Cuts K-means Segmentation

Page 21: Normalized Cuts Demo

How many Segments?

Page 22: Normalized Cuts Demo

Good Segmentation (k=6,8)

Page 23: Normalized Cuts Demo

Bad Segmentation (k=5,6)

Missing Edge

Bad Edge

• Choice of # of Segments in Critical.• But Hard to decide without prior knowledge.

Page 24: Normalized Cuts Demo

Varying Sigma – (σ= Too Large)

Page 25: Normalized Cuts Demo

Varying Sigma – (σ= Too Small)

• Choice of Sigma is important.• Brute-force search is not Efficient.• The choice is also specific to particular images.

Page 26: Normalized Cuts Demo

Image Segmentation – Example 2

Page 27: Normalized Cuts Demo

Image Segmentation – Example 2

Normalized Cuts K-means Segmentation

Page 28: Normalized Cuts Demo

Image Segmentation – Example 3

Page 29: Normalized Cuts Demo

Image Segmentation – Example 3

Normalized Cuts K-means Segmentation

Page 30: Normalized Cuts Demo

Image Segmentation – Example 4

Page 31: Normalized Cuts Demo

Image Segmentation – Example 4

Normalized Cuts K-means Segmentation

Page 32: Normalized Cuts Demo

Image Segmentation – Example 5

Page 33: Normalized Cuts Demo

Image Segmentation – Example 5

Normalized Cuts K-means Segmentation

Page 34: Normalized Cuts Demo

Image Segmentation – Example 6

Page 35: Normalized Cuts Demo

Comparison with K-means

Normalized Cuts K-means Segmentation

Page 36: Normalized Cuts Demo

The End…

Page 37: Normalized Cuts Demo

The Eigenvectors and the Clusters

Eigenvector #1Eigenvector #2Eigenvector #3Eigenvector #4Eigenvector #5