Documentos de Académico
Documentos de Profesional
Documentos de Cultura
and
Edge Detection
Doug Daniels
CIS 467 Spring ‘05
04/26/2005
Boundary Extraction
Introduction
Boundary extraction is one of the basic Morphological algorithms
It is used in Binary images to extract the boundary or edge of objects by
highlighting their borders.
Recall that a boundary is defined as a region R (white pixels) that has
one or more of its neighbors not in R (black pixels).
Boundary Extraction
Applications
The boundary of an object is very
useful in:
Image Recognition – To recognize
identifying features of an object.
Image segmentation – To identify objects
of interest.
Shape Coding – To compress images or
video.
Set Operations
•2 Sets A, B.
•Union is all the pixels
shared in A OR B
(A|B)
•Intersection is all the pixels
shared in A AND B
(A&B)
•Complement is the pixels
NOT in A (~A)
•Difference is the pixels in A
AND NOT B. (A & ~B)
Binary Image
Operations
•NOT operation acts like set
complement on a binary
image
•AND operation acts like set
intersection on a binary image
•A AND NOT(B) acts like set
difference operation (A-B), on
a binary image.
Boundary Extraction
Definition
A & ~ (imerode(A,B)) = β ( A)
∂f
Gx ∂x
∇f = = ∂f
G y
∂y
∇f = mag (∇f) = [G 2 x + G 2 y ]1/ 2
Gx
α ( x, y ) = tan
−1
Gy Gx Gy
Gx = ( z7 + 2 z8 + z9 ) − ( z1 + 2 z 2 + z3 )
G y = ( z3 + 2 z6 + z9 ) − ( z1 + 2 z 4 + z7 )
Noise difficulties
•Noise in an image is almost imperceptible
in the initial image, but it can make it
almost impossible to detect edges even
with small amounts of noise.
•It is important to use smoothing to reduce
noise before edge detection.
Edge Detection
examples
Gx
f
Gy Gx + G y
Edge Linking and
Boundary Detection
Finding edges in an image seldom characterize a
complete edge because of the noise and the gaps in
the image.
We use edge linking procedures to assemble edge
pixels into meaningful edges.
To link edges we analyze a small neighborhood (3x3,
5x5) that has an edge detected point.
We check if it is a similar point with its neighbors if it
is we link it.
Similar points are defined according to the edge
point’s derivative characteristics (Magnitude, and
direction)
Edge Linking criteria
We use the following criteria to link points of an edge where
(x0, y0) is the edge point and (x,y) are the surrounding
neighborhood points.
1. Strength of response of gradient that produced edge.
∇f ( x, y ) − ∇f ( x0 , y 0 ) ≤ E
E is a threshold