Introduction
What is image segmentation?
Technically speaking, image segmentation refers to the decomposition of a scene into different components (thus to facilitate the task at higher levels such as object detection and recognition) Scientifically speaking, segmentation is a hypothetical middle-level vision task performed by neurons between low-level and high-level cortical areas
There is no ground truth to a segmentation task (an example is given in the next slide)
1
Dilemma
input
result 1
result 2
What do we mean by DIFFERENT objects?
Another example: when we look at trees at a close distance, we consider each of them as a different object; but as we look at trees far away, they merge into one coherent object (woods)
Overview of Segmentation Techniques
Edge-based Color-based Texture-based Document images Medical images
Range images
Biometric images
Disparity-based Motion-based
Texture images
Edge-based Techniques
Edge detection
Segmentation by boundary detection Classification and analysis
10
Region-Filling
11
Color-Based Techniques
Color representations
Device dependent: RGB (displaying) or CMYK (printing) Device independent: CIE XYZ or CIELAB (L*a*b*)
There are different specifications of RGB color spaces (e.g., HP/Microsoft vs. Adobe)
12
Color Space Conversion
Analog TV
Digital TV(MPEG)
13
Clustering via K-Means Algorithm
An algorithm for partitioning (or clustering) N data points into K disjoint subsets Sj containing Nj data points so as to minimize the sum-of-squares criterion
data points
centroid
Initialization: randomly choose K centroids
the data points are assigned to the K sets
the centroid is updated for each set
14
Subproblem I: Clustering by distance to known centers
15
Subproblem II: Finding the centers from known clustering
16
Toy Example of Kmeans Clustering
1.Initialization
2.NN-Clustering
3.Codeword-update
4. Alternate 2 and 3 until convergence
http://home.dei.polimi.it/matteucc/Clustering/tutorial_html/AppletKM.html
17
K-means Clustering: Step 1
Algorithm: k-means, Distance Metric: Euclidean Distance
5
k1
3
k2
k3
0 0 1 2 3 4 5
18
K-means Clustering: Step 2
Algorithm: k-means, Distance Metric: Euclidean Distance
5
k1
3
k2
k3
0 0 1 2 3 4 5
19
K-means Clustering: Step 3
Algorithm: k-means, Distance Metric: Euclidean Distance
5
k1
k3
1
k2
0 0 1 2 3 4 5
20
K-means Clustering: Step 4
Algorithm: k-means, Distance Metric: Euclidean Distance
5
k1
k3
1
k2
0 0 1 2 3 4 5
21
K-means Clustering: Step 5
Algorithm: k-means, Distance Metric: Euclidean Distance
5
expression in condition 2
k1
k2
1
k3
0 0 1 2 3 4 5
22
expression in condition 1
Data Clustering via Kmeans
Instead of 2D, kmeans can be applied to 3D color space RGB or L*a*b*
23
Texture-based Techniques
What is Texture?
No one exactly knows.
In the visual arts, texture is the perceived surface quality of an artwork.
24
Disparity-based Techniques
25
Motion Segmentation
26
Document Segmentation
Document images consist of texts, graphics, photos and so on Document segmentation is useful for compression, text recognition Adobe and Xerox are the major players
27
Medical Image Segmentation
Medical image analysis can be used as preliminary screening techniques to help doctors Partial Differential Equation (PDE) has been used for segmenting medical images
active contour model (snake)
28
Range Image Segmentation
range
intensity
ground truth
29
Biometric Image Segmentation
For fingerprint, face and iris images, we also need to segment out the region of interest Various cues can be used such as ridge pattern, skin color and pupil shape Robust segmentation could be difficult for poor-quality images
30
