Announcements Project 4 questions Evaluations.

Slides:



Advertisements
Similar presentations
Clustering II.
Advertisements

Hierarchical Clustering, DBSCAN The EM Algorithm
Lecture 24: Segmentation CS6670: Computer Vision Noah Snavely From Sandlot ScienceSandlot Science.
Segmentácia farebného obrazu
I Images as graphs Fully-connected graph – node for every pixel – link between every pair of pixels, p,q – similarity w ij for each link j w ij c Source:
Image Segmentation Image segmentation (segmentace obrazu) –division or separation of the image into segments (connected regions) of similar properties.
Graph-Based Image Segmentation
Image Segmentation Selim Aksoy Department of Computer Engineering Bilkent University
Lecture 6 Image Segmentation
Image segmentation. The goals of segmentation Group together similar-looking pixels for efficiency of further processing “Bottom-up” process Unsupervised.
Clustering II.
Region Segmentation. Find sets of pixels, such that All pixels in region i satisfy some constraint of similarity.
© University of Minnesota Data Mining for the Discovery of Ocean Climate Indices 1 CSci 8980: Data Mining (Fall 2002) Vipin Kumar Army High Performance.
Segmentation CSE P 576 Larry Zitnick Many slides courtesy of Steve Seitz.
Problem Sets Problem Set 3 –Distributed Tuesday, 3/18. –Due Thursday, 4/3 Problem Set 4 –Distributed Tuesday, 4/1 –Due Tuesday, 4/15. Probably a total.
Segmentation Divide the image into segments. Each segment:
Announcements Project 2 more signup slots questions Picture taking at end of class.
Today: Image Segmentation Image Segmentation Techniques Snakes Scissors Graph Cuts Mean Shift Wednesday (2/28) Texture analysis and synthesis Multiple.
From Pixels to “Blobs” : Rendering and Image Processing Alexei Efros.
Prénom Nom Document Analysis: Data Analysis and Clustering Prof. Rolf Ingold, University of Fribourg Master course, spring semester 2008.
Image Segmentation Today’s Readings Intelligent Scissors, Mortensen et. al, SIGGRAPH 1995Intelligent Scissors From Sandlot ScienceSandlot Science.
Clustering Color/Intensity
Lecture 18: Context and segmentation CS6670: Computer Vision Noah Snavely.
Image Segmentation Today’s Readings Forsyth & Ponce, Chapter 14
Segmentation and Clustering Today’s Readings Forsyth & Ponce, Chapter 7 (plus lots of optional references in the slides) From Sandlot ScienceSandlot Science.
Announcements vote for Project 3 artifacts Project 4 (due next Wed night) Questions? Late day policy: everything must be turned in by next Friday.
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.
Image Segmentation Selim Aksoy Department of Computer Engineering Bilkent University
Graph-based Segmentation
Image Segmentation Image segmentation is the operation of partitioning an image into a collection of connected sets of pixels. 1. into regions, which usually.
Computer Vision James Hays, Brown
Region Segmentation Readings: Chapter 10: 10.1 Additional Materials Provided K-means Clustering (text) EM Clustering (paper) Graph Partitioning (text)
CSE 185 Introduction to Computer Vision Pattern Recognition 2.
Image segmentation Prof. Noah Snavely CS1114
Gaussian Mixture Models and Expectation-Maximization Algorithm.
Radial Basis Function ANN, an alternative to back propagation, uses clustering of examples in the training set.
Segmentation & Grouping Tuesday, Sept 23 Kristen Grauman UT-Austin.
CS654: Digital Image Analysis Lecture 28: Advanced topics in Image Segmentation Image courtesy: IEEE, IJCV.
© Tan,Steinbach, Kumar Introduction to Data Mining 4/18/ Data Mining: Cluster Analysis This lecture node is modified based on Lecture Notes for Chapter.
Course Introduction to Medical Imaging Segmentation 1 – Mean Shift and Graph-Cuts Guy Gilboa.
Clustering (2) Center-based algorithms Fuzzy k-means Density-based algorithms ( DBSCAN as an example ) Evaluation of clustering results Figures and equations.
Graph-based Segmentation
Clustering (1) Clustering Similarity measure Hierarchical clustering
Image Segmentation Today’s Readings Szesliski Chapter 5
Exercise class 13 : Image Segmentation
Announcements CS accounts Project 1 is out today
Region Segmentation Readings: Chapter 10: 10
CS4670/5670: Image Scissors Noah Snavely Today’s Readings
Classification of unlabeled data:
Haim Kaplan and Uri Zwick
Lecture 7: Image alignment
Latent Variables, Mixture Models and EM
CS 2750: Machine Learning Clustering
Grouping.
Lecture 31: Graph-Based Image Segmentation
Announcements Photos right now Project 3 questions
Digital Image Processing
“grabcut”- Interactive Foreground Extraction using Iterated Graph Cuts
Seam Carving Project 1a due at midnight tonight.
Segmentation (continued)
Announcements Project 1 is out today
Midterm Exam Closed book, notes, computer Similar to test 1 in format:
Text Categorization Berlin Chen 2003 Reference:
Announcements Project 4 out today (due Wed March 10)
Midterm Exam Closed book, notes, computer Similar to test 1 in format:
Announcements Project 1 is out today help session at the end of class.
EM Algorithm and its Applications
“Traditional” image segmentation
Presentation transcript:

Announcements Project 4 questions Evaluations

Image Segmentation Today’s Readings Forsyth chapter 14 http://www.dai.ed.ac.uk/HIPR2/morops.htm Dilation, erosion, opening, closing

From images to objects What Defines an Object? Subjective problem, but has been well-studied Gestalt Laws seek to formalize this proximity, similarity, continuation, closure, common fate see notes by Steve Joordens, U. Toronto

Image Segmentation We will consider different methods Already covered: Intelligent Scissors (contour-based) Hough transform (model-based) Today: K-means clustering (color-based) Normalized Cuts (region-based)

Image histograms How many “orange” pixels are in this image? This type of question answered by looking at the histogram A histogram counts the number of occurrences of each color Given an image The histogram is defined to be What is the dimension of the histogram of an NxN RGB image?

What do histograms look like? Photoshop demo                                               How Many Modes Are There? Easy to see, hard to compute

Histogram-based segmentation Goal Break the image into K regions (segments) Solve this by reducing the number of colors to K and mapping each pixel to the closest color photoshop demo

Histogram-based segmentation Goal Break the image into K regions (segments) Solve this by reducing the number of colors to K and mapping each pixel to the closest color photoshop demo Here’s what it looks like if we use two colors

Clustering How to choose the representative colors? Objective This is a clustering problem! Objective Each point should be as close as possible to a cluster center Minimize sum squared distance of each point to closest center

Break it down into subproblems Suppose I tell you the cluster centers ci Q: how to determine which points to associate with each ci? A: for each point p, choose closest ci Suppose I tell you the points in each cluster Q: how to determine the cluster centers? A: choose ci to be the mean of all points in the cluster

K-means clustering K-means clustering algorithm Randomly initialize the cluster centers, c1, ..., cK Given cluster centers, determine points in each cluster For each point p, find the closest ci. Put p into cluster i Given points in each cluster, solve for ci Set ci to be the mean of points in cluster i If ci have changed, repeat Step 2 Java demo: http://www.elet.polimi.it/upload/matteucc/Clustering/tutorial_html/AppletKM.html Properties Will always converge to some solution Can be a “local minimum” does not always find the global minimum of objective function:

Probabilistic clustering Basic questions what’s the probability that a point x is in cluster m? what’s the shape of each cluster? K-means doesn’t answer these questions Probabilistic clustering (basic idea) Treat each cluster as a Gaussian density function

Expectation Maximization (EM) A probabilistic variant of K-means: E step: “soft assignment” of points to clusters estimate probability that a point is in a cluster M step: update cluster parameters mean and variance info (covariance matrix) maximizes the likelihood of the points given the clusters Forsyth Chapter 16 (optional)

EM demo http://www.cs.ucsd.edu/users/ibayrakt/java/em/

Applications of EM Turns out this is useful for all sorts of problems any clustering problem model estimation with missing/hidden data finding outliers segmentation problems segmentation based on color segmentation based on motion foreground/background separation ...

Cleaning up the result Problem: How can these be fixed? Histogram-based segmentation can produce messy regions segments do not have to be connected may contain holes How can these be fixed? photoshop demo

Dilation operator: Assume: binary image 1 1 Assume: binary image Dilation: does H “overlap” F around [x,y]? G[x,y] = 1 if H[u,v] and F[x+u-1,y+v-1] are both 1 somewhere 0 otherwise Written

Dilation operator Demo http://www.cs.bris.ac.uk/~majid/mengine/morph.html

Erosion operator: Erosion: is H “contained in” F around [x,y] 1 1 1 1 Erosion: is H “contained in” F around [x,y] G[x,y] = 1 if F[x+u-1,y+v-1] is 1 everywhere that H[u,v] is 1 0 otherwise Written

Erosion operator Demo http://www.cs.bris.ac.uk/~majid/mengine/morph.html

Nested dilations and erosions What does this operation do? this is called a closing operation

Nested dilations and erosions What does this operation do? this is called a closing operation Is this the same thing as the following?

Nested dilations and erosions What does this operation do? this is called an opening operation http://www.dai.ed.ac.uk/HIPR2/open.htm You can clean up binary pictures by applying combinations of dilations and erosions Dilations, erosions, opening, and closing operations are known as morphological operations see http://www.dai.ed.ac.uk/HIPR2/morops.htm

Graph-based segmentation?

Images as graphs c Fully-connected graph q Cpq p node for every pixel link between every pair of pixels, p,q cost cpq for each link cpq measures similarity similarity is inversely proportional to difference in color and position this is different than the costs for intelligent scissors

Segmentation by Graph Cuts w A B C Break Graph into Segments Delete links that cross between segments Easiest to break links that have low cost (similarity) similar pixels should be in the same segments dissimilar pixels should be in different segments

Cuts in a graph B A Link Cut Find minimum cut set of links whose removal makes a graph disconnected cost of a cut: Find minimum cut gives you a segmentation fast algorithms exist for doing this

But min cut is not always the best cut...

Cuts in a graph B A Normalized Cut a cut penalizes large segments fix by normalizing for size of segments volume(A) = sum of costs of all edges that touch A

Interpretation as a Dynamical System Treat the links as springs and shake the system elasticity proportional to cost vibration “modes” correspond to segments can compute these by solving an eigenvector problem Forsyth chapter 14.5

Interpretation as a Dynamical System Treat the links as springs and shake the system elasticity proportional to cost vibration “modes” correspond to segments can compute these by solving an eigenvector problem Forsyth chapter 14.5

Color Image Segmentation