Tracking of Convex Objects,
IEEE International Syposium on Computer Vision Nov. 1995.
In this paper, we present a technique for grouping line segments
sinto convex sets, where the line segments are obtained by linking edges
obtained from the Canny edge detector.
The novelty of the approach is twofold:
first we define an efficient approach for testing the global convexity
criterion, and second, we develop an optimal search based on dynamic
programming or grouping the line segments into convex sets.
Furthermore, we use the convexity results as the initial conditions for a
deformable contour for object tracking. We show results on real images,
and present a specific domain where this type of grouping can be directly
click here to see the full version of this paper in PostScript format.
Or click here for the full version in
Acrobat (PDF) format .
The Acrobat version may be hard to read on a terminal,
especially at normal magnification, apparently because the original font
is not widely supported. It should look normal when printed on
Publication number: LBNL-37649.