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

Slides:



Advertisements
Similar presentations
Liang Shan Clustering Techniques and Applications to Image Segmentation.
Advertisements

Class 12: Communities Network Science: Communities Dr. Baruch Barzel.
Normalized Cuts and Image Segmentation
Clustering II CMPUT 466/551 Nilanjan Ray. Mean-shift Clustering Will show slides from:
ADS lab NCKU1 Michael Maire, Pablo Arbelaez, Charless Fowlkes, and Jitendra Malik university of California, Berkeley – Berkeley university of California,
Biased Normalized Cuts 1 Subhransu Maji and Jithndra Malik University of California, Berkeley IEEE Conference on Computer Vision and Pattern Recognition.
10/11/2001Random walks and spectral segmentation1 CSE 291 Fall 2001 Marina Meila and Jianbo Shi: Learning Segmentation by Random Walks/A Random Walks View.
Lecture 6 Image Segmentation
Image segmentation. The goals of segmentation Group together similar-looking pixels for efficiency of further processing “Bottom-up” process Unsupervised.
Lecture 21: Spectral Clustering
Algorithms & Applications in Computer Vision Lihi Zelnik-Manor Lecture 11: Structure from Motion.
A Unified View of Kernel k-means, Spectral Clustering and Graph Cuts Dhillon, Inderjit S., Yuqiang Guan, and Brian Kulis.
Normalized Cuts and Image Segmentation Jianbo Shi and Jitendra Malik, Presented by: Alireza Tavakkoli.
© 2003 by Davi GeigerComputer Vision October 2003 L1.1 Image Segmentation Based on the work of Shi and Malik, Carnegie Mellon and Berkley and based on.
1 Segmentation with Global Optimal Contour Xizhou Feng 4/25/2003.
Region Segmentation. Find sets of pixels, such that All pixels in region i satisfy some constraint of similarity.
Unsupervised Learning of Categories from Sets of Partially Matching Image Features Dominic Rizzo and Giota Stratou.
A Unified View of Kernel k-means, Spectral Clustering and Graph Cuts
Announcements Project 2 more signup slots questions Picture taking at end of class.
CS 376b Introduction to Computer Vision 04 / 04 / 2008 Instructor: Michael Eckmann.
Segmentation Graph-Theoretic Clustering.
Efficient Spatiotemporal Grouping Using the Nyström Method Charless Fowlkes, U.C. Berkeley Serge Belongie, U.C. San Diego Jitendra Malik, U.C. Berkeley.
1 Segmentation with Scene and Sub-Scene Categories Joseph Djugash Input Image Scene/Sub-Scene Classification Segmentation.
Presentation By Michael Tao and Patrick Virtue. Agenda History of the problem Graph cut background Compute graph cut Extensions State of the art Continued.
Perceptual Organization: Segmentation and Optical Flow.
Announcements vote for Project 3 artifacts Project 4 (due next Wed night) Questions? Late day policy: everything must be turned in by next Friday.
A Fault-tolerant Architecture for Quantum Hamiltonian Simulation Guoming Wang Oleg Khainovski.
Announcements Project 3 questions Photos after class.
Computer Vision - A Modern Approach Set: Segmentation Slides by D.A. Forsyth Segmentation and Grouping Motivation: not information is evidence Obtain a.
Fitting and Registration
Image Segmentation Image segmentation is the operation of partitioning an image into a collection of connected sets of pixels. 1. into regions, which usually.
Graph-based consensus clustering for class discovery from gene expression data Zhiwen Yum, Hau-San Wong and Hongqiang Wang Bioinformatics, 2007.
Image Segmentation Rob Atlas Nick Bridle Evan Radkoff.
CSE 185 Introduction to Computer Vision
Segmentation Techniques Luis E. Tirado PhD qualifying exam presentation Northeastern University.
1/24 Exploring the Design Space of a Parallel Object Recognition System Bor-Yiing Su, Kurt Keutzer,
Presenter : Kuang-Jui Hsu Date : 2011/5/3(Tues.).
Segmentation using eigenvectors
Segmentation using eigenvectors Papers: “Normalized Cuts and Image Segmentation”. Jianbo Shi and Jitendra Malik, IEEE, 2000 “Segmentation using eigenvectors:
Region Segmentation Readings: Chapter 10: 10.1 Additional Materials Provided K-means Clustering (text) EM Clustering (paper) Graph Partitioning (text)
Recognition using Regions (Demo) Sudheendra V. Outline Generating multiple segmentations –Normalized cuts [Ren & Malik (2003)] Uniform regions –Watershed.
Chapter 14: SEGMENTATION BY CLUSTERING 1. 2 Outline Introduction Human Vision & Gestalt Properties Applications – Background Subtraction – Shot Boundary.
CSIE Dept., National Taiwan Univ., Taiwan
CS654: Digital Image Analysis
Spectral Clustering Jianping Fan Dept of Computer Science UNC, Charlotte.
Learning Spectral Clustering, With Application to Speech Separation F. R. Bach and M. I. Jordan, JMLR 2006.
Image Segmentation Superpixel methods Speaker: Hsuan-Yi Ko.
Efficient Semi-supervised Spectral Co-clustering with Constraints
 In the previews parts we have seen some kind of segmentation method.  In this lecture we will see graph cut, which is a another segmentation method.
1 Microarray Clustering. 2 Outline Microarrays Hierarchical Clustering K-Means Clustering Corrupted Cliques Problem CAST Clustering Algorithm.
Mestrado em Ciência de Computadores Mestrado Integrado em Engenharia de Redes e Sistemas Informáticos VC 15/16 – TP10 Advanced Segmentation Miguel Tavares.
Iterative K-Means Algorithm Based on Fisher Discriminant UNIVERSITY OF JOENSUU DEPARTMENT OF COMPUTER SCIENCE JOENSUU, FINLAND Mantao Xu to be presented.
CS 2750: Machine Learning Clustering Prof. Adriana Kovashka University of Pittsburgh January 25, 2016.
Normalized Cuts and Image Segmentation Patrick Denis COSC 6121 York University Jianbo Shi and Jitendra Malik.
Document Clustering with Prior Knowledge Xiang Ji et al. Document Clustering with Prior Knowledge. SIGIR 2006 Presenter: Suhan Yu.
Miguel Tavares Coimbra
Image Segmentation Today’s Readings Szesliski Chapter 5
Segmentation by clustering: normalized cut
Exercise class 13 : Image Segmentation
CSSE463: Image Recognition Day 34
CS200: Algorithm Analysis
Segmentation and Grouping
Segmentation Graph-Theoretic Clustering.
Grouping.
Clustering.
Announcements Photos right now Project 3 questions
Spectral Clustering Eric Xing Lecture 8, August 13, 2010
Announcements Project 4 out today (due Wed March 10)
CSSE463: Image Recognition Day 34
Clustering.
Presentation transcript:

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

Clustering – How many groups are there? Out of the various possible partitions, which is the correct one?

Clustering – Why is it hard? Number of components/clusters? The structure of the components? Estimation or optimization problem?  Convergence to the globally correct solution?

Clustering – Example 1 Optimal? How do we arrive at this Clustering?

What does the Affinity Matrix Look Like?

The Eigenvectors and the Clusters Step-Function like behavior preferred! Makes Clustering Easier.

The Eigenvectors and the Clusters

Clustering – Example 2 Dense Square Cluster Sparse Square Cluster Sparse Circle Cluster

Normalized Cut Result

The Affinity Matrix

The Eigenvectors and the Clusters

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.

K-means Result – Example 1

K-means Result – Example 2

Varying the Number of Clusters k = 3k = 4k = 6 K-means N-Cut

Varying the Sigma Value σ = 3σ = 13σ = 25

Image Segmentation – Example 1 Affinity/Similarity matrix (W) based on Intervening Contours and Image Intensity

The Eigenvectors

Comparison with K-means Normalized Cuts K-means Segmentation

How many Segments?

Good Segmentation (k=6,8)

Bad Segmentation (k=5,6) Missing Edge Bad Edge Choice of # of Segments in Critical. But Hard to decide without prior knowledge.

Varying Sigma – (σ= Too Large)

Varying Sigma – (σ= Too Small) Choice of Sigma is important. Brute-force search is not Efficient. The choice is also specific to particular images.

Image Segmentation – Example 2

Normalized Cuts K-means Segmentation

Image Segmentation – Example 3

Normalized Cuts K-means Segmentation

Image Segmentation – Example 4

Normalized Cuts K-means Segmentation

Image Segmentation – Example 5

Normalized Cuts K-means Segmentation

Image Segmentation – Example 6

Comparison with K-means Normalized Cuts K-means Segmentation

The End…

The Eigenvectors and the Clusters Eigenvector #1 Eigenvector #2Eigenvector #3Eigenvector #4Eigenvector #5