in a stereo image pair means that the correspondency
problem is principally solved for the object.
The overall algorithm design can be seen in fig-
ure 1. In order to enable an automatic extraction of
the z-position and the position in the image plane, we
developed a recognition algorithm able to detect the
objects used in our experiments and deliver the neces-
sary initialization data for the tracking algorithm. The
tracking algorithm is split into separate algorithms for
each stereo pair image. The tracker for the left im-
age is in the first place minimized freely to segment
the object from the background. The contour data is
then duplicated to the right image tracker, which uses
just restricted transformations to determine the posi-
tion of the object in the right image. Both position
informations are fed to a depth estimation algorithm,
which analyzes the displacement of the two tracked
positions and determines the distance of the object.
2 ALGORITHM INITIALIZATION
A common drawback of active contour based ap-
proaches is the necessity for manual algorithm ini-
tialization. Usually a graphical user interface (GUI)
is used to present a dialog where the user is asked to
draw an initial estimate of the object’s shape. Instead
we choose another approach which allows automatic
initialization of the active contour. The proposed
method is based on the very popular edge detection
method of Canny (Gonzalez and Woods, 2008) and
an initial estimate of the object size. In the following
we will give a brief overview of Canny edge detection
and then show how it can be applied to our problem.
To reduce the effect of high frequency noise usu-
ally a Gaussian low-pass filter is applied to the input
image before edge detection. The main advantages
of the Gaussian low-pass are the efficient computabil-
ity and the good stopband attenuation (Forsyth and
Ponce, 2002). The convolution kernel is:
G
σ
(x,y) =
1
2πσ
2
exp
−
x
2
+ y
2
2σ
2
!
(1)
The actual contour detection algorithm consists of
the following steps:
1. Determination of edge points - A measure of im-
age gradient G in the direction of the image coor-
dinate axes x,y is needed. The Sobel- and Prewitt
operator (Jaehne, 1991) are two examples of first-
order derivative approximation filters. From the
filter responses G
x
,G
y
the local gradient magni-
tude g(x,y) and orientation α (x, y) are computed:
g(x,y) =
q
G
2
x
+ G
2
y
(2)
α (x,y) = tan
−1
(G
y
/G
x
) (3)
Edge points are obtained by finding the local max-
ima of g(x,y) in the direction of α (x,y).
2. Nonmaximal suppression - The prior step pro-
duces ridges along image edges that are not yet
necessarily a thin line. Nonmaximal suppression
removes pixels that are not on the top of the ridge
and leaves a thin line.
3. Hysteresis thresholding - Two threshold values T
1
and T
2
, with T
1
< T
2
are used to remove edges
of low strength. Initially, all edge pixels where
g(x,y) < T
1
are removed. The next step removes
all remaining pixels with T
1
< g(x,y) < T
2
that
are not 8-connected to an edge segment with
g(x,y) < T
2
. This procedure is depicted in
figure 2.
Figure 2: Hysteresis thresholding as used in Canny edge
detection, illustrated by a one-dimensional signal I. Only
connected line segments with derivative values higher than
T
1
and at least one segment higher than T
2
survive this step.
The methods as described above have been ap-
plied to a sample SEM image taken from the automa-
tion sequence (figure 3). The Sobel operator has been
chosen as edge emphasizing filter. It can be seen from
the result of the Canny edge detection that is not only
sensitive to the target object but also to background
structure. For retrieving the actual object shape that
is used to initialize the active contour we incorporate
three further steps:
4. Binary dilation - Lines in the binary edge image
are thickened to close gaps in the outer object hull.
For this operation a structuring element is needed
which is another binary image. A binary approxi-
mation of a circular disk is a common choice.
5. Contour retrieval - The dilated image is inspected
for contours which are point sequences that en-
close 8-connected binary objects. Only outer con-
tours which are not wrapped by a larger contour
are taken into account.
ICINCO 2009 - 6th International Conference on Informatics in Control, Automation and Robotics
80