Binary Images - PowerPoint PPT Presentation

1 / 43
About This Presentation
Title:

Binary Images

Description:

... boundary about its two farthest points. Subdivide each resulting ... signature may be started at point which is farthest from centroid (rotational invariance) ... – PowerPoint PPT presentation

Number of Views:109
Avg rating:3.0/5.0
Slides: 44
Provided by: eckerdwor
Category:

less

Transcript and Presenter's Notes

Title: Binary Images


1
Binary Images Region Representation
2
Binary Images Region Representation -
Boundary Representation - Region Representation
3
Boundary Representation Techniques - Chain
Codes - Polygonal Approximations -
Signatures - Boundary Segments Region
Representation Techniques - Skeletons -
Fractal Representation
4
Boundary Representation Techniques -
translational invariance - rotational
invariance - scale invariance
Invariance, why is it important?
5
Chain Codes
OBJECT
6
Chain Codes
OBJECT
BOUNDARY
7
Chain Codes
OBJECT
BOUNDARY (4 - CONNECTED)
8
Chain Codes
OBJECT
BOUNDARY (8 - CONNECTED)
9
Chain Codes
4-CONNECTED
8-CONNECTED
10
0
Chain Code
0
BOUNDARY
11
0
0
Chain Code
0, 0
BOUNDARY
12
0
0
7
Chain Code
0, 0, 7
BOUNDARY
13
0
0
7
2
7
1
2
Chain Code
5
2
6
0, 0, 7, 7, 5, 6, 5, 5 4, 3, 2, 2, 2, 1, 2
2
5
5
3
4
14
First Difference Chain Code
15
First Difference Chain Code
Direction codes are given relative to the
direction of the previous movement (rotational
invariance)
16
First Difference Chain Code
Direction codes are given relative to the
direction of the previous movement (rotational
invariance) Resulting code may be circularly
shifted to form an integer of minimum magnitude
(implementation invariance)
17
First Difference Chain Code
Direction codes are given relative to the
direction of the previous movement (rotational
invariance) Resulting code may be circularly
shifted to form an integer of minimum magnitude
(implementation invariance) Sampling grid may be
adjusted (scale invariance)
18
First Difference Chain Code
0, 0, 7, 7, 5, 6, 5, 5, 4, 3, 2, 2, 2, 1, 2
0
19
First Difference Chain Code
0, 0, 7, 7, 5, 6, 5, 5, 4, 3, 2, 2, 2, 1, 2
0, 7
20
First Difference Chain Code
0, 0, 7, 7, 5, 6, 5, 5, 4, 3, 2, 2, 2, 1, 2
0, 7, 0
21
First Difference Chain Code
0, 0, 7, 7, 5, 6, 5, 5, 4, 3, 2, 2, 2, 1, 2
0, 7, 0, 6
22
First Difference Chain Code
0, 0, 7, 7, 5, 6, 5, 5, 4, 3, 2, 2, 2, 1, 2
0, 7, 0, 6, 1
23
First Difference Chain Code
0, 0, 7, 7, 5, 6, 5, 5, 4, 3, 2, 2, 2, 1, 2
0, 7, 0, 6, 1, 7
24
First Difference Chain Code
0, 0, 7, 7, 5, 6, 5, 5, 4, 3, 2, 2, 2, 1, 2
0, 7, 0, 6, 1, 7, 0, 7, 7, 7, 0, 0, 7, 1
25
First Difference Chain Code
0, 0, 7, 7, 5, 6, 5, 5, 4, 3, 2, 2, 2, 1, 2
0, 7, 0, 6, 1, 7, 0, 7, 7, 7, 0, 0, 7, 1, 6
26
Chain code 0, 0, 7, 7, 5, 6, 5, 5, 4, 3, 2, 2,
2, 1, 2
First difference Chain Code 0, 7, 0, 6, 1, 7, 0,
7, 7, 7, 0, 0, 7, 1, 6
Minimum magnitude 0, 0, 7, 1, 6, 0, 7, 0, 6, 1,
7, 0, 7, 7, 7,
27
Polygonal Approximation a digital boundary can
be approximated with a polygon
28
Polygonal Approximation a digital boundary can
be approximated with a polygon approximation is
exact when of points in polygon points
in boundary
29
Polygonal Approximation a digital boundary can
be approximated with a polygon approximation is
exact when of points in polygon points
in boundary goal is to capture the essence of
the shape with the fewest possible segments
30
Polygonal Approximation Minimal perimeter
polygon
31
Polygonal Approximation Minimal perimeter
polygon
Fit a rubberband about the corners of the border
pixels
32
Polygonal Approximation Boundary Splitting
Subdivide the boundary about its two farthest
points
33
Polygonal Approximation Boundary Splitting
Subdivide each resulting region. Find point with
greatest perpendicular distance.
Continue until perpendicular distance is less
than some threshold.
34
Polygonal Approximation Boundary Splitting
35
Polygonal Approximation Boundary Splitting
36
Signatures 1-D representation of a
boundary plot distance from the centroid to the
boundary as a function of angle
37
Signatures plot distance from the centroid to
the boundary as a function of angle
38
Signatures translation invariant signature may
be started at point which is farthest from
centroid (rotational invariance) amplitude of
function may be scaled to the range 0, 1 (scale
invariance)
39
Boundary Segments
40
Boundary Segments
41
Boundary Segments
Use a smoothed version of the boundary
42
Skeletons
Medial Axis Transform
For each point P in the region, we find its
closest neighbor on the border B. If more than
one closest neighbor, then it is part of the
medial axis.
43
Skeletons
Thinning 1) does not remove endpoints 2) does not
break connectedness 3) does not cause excessive
erosion of the region
Write a Comment
User Comments (0)
About PowerShow.com