Example 1: Regions
Example 2:
Straight Lines
Example 3:
Lines and Circular Arcs
Region Segmentation:
Segmentation Criteria
From Pavlidis
A segmentation is a partition of an image I into
a set of regions S satisfying:
1. Si = S
2. Si Sj = , i j
3. Si, P(Si) = true
4. P(Si Sj) = false,
i j, Si adjacent Sj
So
So all we have to do is define and implement the
similarity predicate.
Region Growing
Region growing techniques start with one pixel of a
potential region and try to grow it by adding adjacent
pixels till the pixels being compared are too disimilar.
The first pixel selected can be just the first unlabeled
pixel in the image or a set of seed pixels can be chosen
from the image.
Usually a statistical test is used to decide which pixels
can be added to a region.
8
S = 1/N (I(r,c) - X)
(r,c) R
(N-1) * N
2
2
-------------- (y - X) / S
(N+1)
1/2
RGGROW Example
image
Not great!
segmentation
What do you think this would
do on wallpaper texture?
12
Clustering
There are K clusters C1,, CK with means m1,, mK.
The least-squares error is defined as
K
D=
|| xi - mk || .
k=1 xi Ck
14
K-Means Example 1
15
K-Means Example 2
16
X
D>q/2
Z
18
19
Isodata Clustering
1. Select several cluster means and form clusters.
2. Split any cluster whose variance is too large.
3. Group together clusters that are too small.
4. Recompute means.
5. Repeat till 2 and 3 cannot be applied.
We used this to cluster normal vectors in 3D data.
20
K-means, K=6
Comparison
Isodata, K became 5
Original
21
Ohlanders Method
tree2
tree1
sky
23
24
Minimal Cuts
Let G = (V,E) be a graph. Each edge (u,v) has a weight w(u,v)
that represents the similarity between u and v.
Graph G can be broken into 2 disjoint graphs with node sets
A and B by removing edges that connect these sets.
Let cut(A,B) =
w(u,v).
uA, vB
25
Cut(A,B)
cut(A,B) =
w(u,v).
uA, vB
B
A
w1
w2
26
Normalized Cut
Minimal cut favors cutting off small node groups,
so Shi proposed the normalized cut.
cut(A, B)
cut(A,B)
Ncut(A,B) = ------------- + ------------asso(A,V)
asso(B,V)
asso(A,V) = w(u,t)
uA, tV
normalized
cut
27
A
2
1
2
2
1
2
3
3
3
Ncut(A,B) = ------- + -----21
16
28
29
||F(i)-F(j)||2 / I
||X(i)-X(j)||2 / X
e
0
if ||X(i)-X(j)||2 < r
otherwise
Examples of
Shi Clustering
31
Edge Detection
Basic idea: look for a neighborhood with strong signs
of change.
Problems:
neighborhood size
81 82 26 24
82 33 25 25
81 82 26 24
33
Differential Operators
Differential operators
attempt to approximate the gradient at a pixel via masks
threshold the gradient to select the edge pixels
34
-1 0 1
-2 0 2
-1 0 1
1 2 1
Sy = 0 0 0
-1 -2 -1
Then g = (gx + gy )
1/2
= atan2(gy,gx)
original image
gradient
magnitude
thresholded
gradient
magnitude
36
2nd derivative
37
Marr/Hildreth Operator
First smooth the image via a Gaussian convolution
Apply a Laplacian filter (estimate 2nd derivative)
Find zero crossings of the Laplacian of the Gaussian
This can be done at multiple resolutions.
38
Haralick Operator
Fit the gray-tone intensity surface to a piecewise
cubic polynomail approximation.
Use the approximation to find zero crossings of the
second directional derivative in the direction that
maximizes the first directional derivative.
The derivatives here are calculated from direct
mathematical expressions wrt the cubic polynomial.
39
Canny Examples
41
42
43
junction
corner
44
Hough Transform
The Hough transform is a method for detecting
lines or curves specified by a parametric function.
If the parameters are p1, p2, pn, then the Hough
procedure uses an n-dimensional accumulator array
in which it accumulates votes for the correct parameters
of the lines or curves found on the image.
image
accumulator
m
y = mx + b
46
Example
gray-tone image
0
0
0
0
0
0
0
0
0
100 100 100
100 100 100
360
.
6
3
0
distance
angle
100
100
100
100
100
DQ
100
100
100
100
100
Accumulator A
- - - - - - - - - - - - - - - 4 - 1 - 2 - - - - - -
5
-
0 10 20 30 40 90
3
3
-
THETAQ
- 3 3 - 3 3 3 3 3 3 3 3 - - - -
360
.
6
3
0
*
-
90
90
PTLIST
- - - - - - - - - * - * - - - -
90
90
-
0
0
40
90
-
*
-
0
0
20
40
-
(3,1)
(3,2)
(4,1)
(4,2)
(4,3)
(1,3)(1,4)(2,3)(2,4)
49
Finding Circles
Equations:
r = r0 + d sin
c = c0 + d cos
r, c, d are parameters
*(r,c)
51
Why it works
Filled Circle:
Outer points of circle have gradient
direction pointing to center.
Circular Ring:
Outer points gradient towards center.
Inner points gradient away from center.
The points in the away direction dont
accumulate in one bin!
52
4
5
3 2
6 7
45
4 3 2
1
5
6 7 8
+22.5
-22.5
See Transparencies
55