Image Segmentation Chapter 14, David A. Forsyth and Jean Ponce, “Computer Vision: A Modern Approach”.

Slides:

Advertisements

Similar presentations

Advertisements

SEEM Tutorial 4 – Clustering. 2 What is Cluster Analysis?  Finding groups of objects such that the objects in a group will be similar (or.

Hierarchical Clustering

Hierarchical Clustering. Produces a set of nested clusters organized as a hierarchical tree Can be visualized as a dendrogram – A tree-like diagram that.

© Tan,Steinbach, Kumar Introduction to Data Mining 4/18/ What is Cluster Analysis? l Finding groups of objects such that the objects in a group will.

Data Mining Cluster Analysis: Basic Concepts and Algorithms

Agglomerative Hierarchical Clustering 1. Compute a distance matrix 2. Merge the two closest clusters 3. Update the distance matrix 4. Repeat Step 2 until.

Human-Computer Interaction Human-Computer Interaction Segmentation Hanyang University Jong-Il Park.

Object Detection by Matching Longin Jan Latecki. Contour-based object detection Database shapes: …..

Lecture 6 Image Segmentation

Image segmentation. The goals of segmentation Group together similar-looking pixels for efficiency of further processing “Bottom-up” process Unsupervised.

Segmentation. Terminology Segmentation, grouping, perceptual organization: gathering features that belong together Fitting: associating a model with observed.

Normalized Cuts and Image Segmentation Jianbo Shi and Jitendra Malik, Presented by: Alireza Tavakkoli.

Region Segmentation. Find sets of pixels, such that All pixels in region i satisfy some constraint of similarity.

Segmentation and Clustering. Segmentation: Divide image into regions of similar contentsSegmentation: Divide image into regions of similar contents Clustering:

Segmentation. Methods Region Growing Split and Merge Clustering.

Segmentation Graph-Theoretic Clustering.

Clustering Color/Intensity

Computer Vision Segmentation Marc Pollefeys COMP 256 Some slides and illustrations from D. Forsyth, T. Darrel,...

Segmentation by Clustering Reading: Chapter 14 (skip 14.5) Data reduction - obtain a compact representation for interesting image data in terms of a set.

Cluster Analysis: Basic Concepts and Algorithms

Image Segmentation Some slides: courtesy of O. Capms, Penn State, J.Ponce and D. Fortsyth, Computer Vision Book.

Segmentation and Clustering. Déjà Vu? Q: Haven’t we already seen this with snakes?Q: Haven’t we already seen this with snakes? A: no, that was about boundaries,

Microarray analysis 2 Golan Yona. 2) Analysis of co-expression Search for similarly expressed genes experiment1 experiment2 experiment3 ……….. Gene i:

© University of Minnesota Data Mining for the Discovery of Ocean Climate Indices 1 CSci 8980: Data Mining (Fall 2002) Vipin Kumar Army High Performance.

Computer Vision Segmentation Marc Pollefeys COMP 256 Some slides and illustrations from D. Forsyth, T. Darrel,...

Computer Vision - A Modern Approach Set: Segmentation Slides by D.A. Forsyth Segmentation and Grouping Motivation: not information is evidence Obtain a.

Clustering Unsupervised learning Generating “classes”

Tal Mor  Create an automatic system that given an image of a room and a color, will color the room walls  Maintaining the original texture.

Computer Vision James Hays, Brown

Segmentation using eigenvectors

CSSE463: Image Recognition Day 34 This week This week Today: Today: Graph-theoretic approach to segmentation Graph-theoretic approach to segmentation Tuesday:

Segmentation by Clustering

Segmentation using eigenvectors Papers: “Normalized Cuts and Image Segmentation”. Jianbo Shi and Jitendra Malik, IEEE, 2000 “Segmentation using eigenvectors:

Computer Vision Lecture 5. Clustering: Why and How.

Image Segmentation February 27, Implicit Scheme is considerably better with topological change. Transition from Active Contours: –contour v(t) 

Segmentation Course web page: vision.cis.udel.edu/~cv May 7, 2003  Lecture 31.

Chapter 14: SEGMENTATION BY CLUSTERING 1. 2 Outline Introduction Human Vision & Gestalt Properties Applications – Background Subtraction – Shot Boundary.

Hierarchical Clustering

CSE 185 Introduction to Computer Vision Pattern Recognition 2.

Clustering Algorithms k-means Hierarchic Agglomerative Clustering (HAC) …. BIRCH Association Rule Hypergraph Partitioning (ARHP) Categorical clustering.

1 Motivation Web query is usually two or three words long. –Prone to ambiguity –Example “keyboard” –Input device of computer –Musical instruments How can.

CSE5334 DATA MINING CSE4334/5334 Data Mining, Fall 2014 Department of Computer Science and Engineering, University of Texas at Arlington Chengkai Li (Slides.

CS 8751 ML & KDDData Clustering1 Clustering Unsupervised learning Generating “classes” Distance/similarity measures Agglomerative methods Divisive methods.

Hierarchical Clustering Produces a set of nested clusters organized as a hierarchical tree Can be visualized as a dendrogram – A tree like diagram that.

Machine Learning Queens College Lecture 7: Clustering.

Data Mining Cluster Analysis: Basic Concepts and Algorithms Lecture Notes for Chapter 8 Introduction to Data Mining by Tan, Steinbach, Kumar © Tan,Steinbach,

Information Retrieval and Organisation Chapter 17 Hierarchical Clustering Dell Zhang Birkbeck, University of London.

Hierarchical Clustering

© Tan,Steinbach, Kumar Introduction to Data Mining 4/18/ Data Mining: Cluster Analysis This lecture node is modified based on Lecture Notes for Chapter.

Community structure in graphs Santo Fortunato. More links “inside” than “outside” Graphs are “sparse” “Communities”

Mestrado em Ciência de Computadores Mestrado Integrado em Engenharia de Redes e Sistemas Informáticos VC 15/16 – TP10 Advanced Segmentation Miguel Tavares.

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.

Data Mining Cluster Analysis: Basic Concepts and Algorithms Lecture Notes Introduction to Data Mining by Tan, Steinbach, Kumar © Tan,Steinbach, Kumar Introduction.

Clustering [Idea only, Chapter 10.1, 10.2, 10.4].

Clustering Machine Learning Unsupervised Learning K-means Optimization objective Random initialization Determining Number of Clusters Hierarchical Clustering.

K-Means Segmentation.

Miguel Tavares Coimbra

Segmentation by clustering: normalized cut

CSSE463: Image Recognition Day 34

Segmentation and Grouping

Segmentation Graph-Theoretic Clustering.

DATA MINING Introductory and Advanced Topics Part II - Clustering

Emel Doğrusöz Esra Ataer Muhammet Baştan Tolga Can

SEEM4630 Tutorial 3 – Clustering.

CSSE463: Image Recognition Day 34

Hierarchical Clustering

Presentation transcript:

Image Segmentation Chapter 14, David A. Forsyth and Jean Ponce, “Computer Vision: A Modern Approach”.

Possible approaches image segmentation as a clustering problem –Cluster together pixels that belong together image segmentation as a graph cut problem –cut a graph in sub-graphs with strong internal links and weak cut links

Clustering x2x2 x1x1

x2x2 x1x1

Class 1 Class 2 x2x2 x1x1 Class 3 Class 4

Agglomerative Clustering or Clustering by Merging Make each point a separate cluster Until the clustering is satisfactory –Merge the two cluster with the smallest inter-cluster distance

Divisive Clustering or Clustering by Splitting Construct a single cluster containing all points Until the clustering is satisfactory –Split the two clusters that yields the two components with the largest inter-cluster distance

What is a good inter-cluster distance? The distance between the closest elements (single linked clustering) Maximum distance between an element in the first cluster and another in the second (complete-link clustering) Average distance between the elements in the cluster (group average clustering)

How many cluster are there? data set dendrogram

Clustering as a minimization problem x2x2 x1x1 minimize

Clustering by K-Means

Graph theoretic clustering Represent tokens using a weighted graph. –affinity matrix Cut up this graph to get sub-graphs with strong interior links

Measuring Affinity Intensity Color Distance Texture

Scale effect on the affinity

Normalized Cuts Maximize the within cluster similarity compared to the across cluster difference Write graph as V, one cluster as A and the other as B where: