In this paper, we present a technique for grouping line segments into 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 applied.
Tracking of convex objects
01.01.1995
468071 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
British Library Conference Proceedings | 1995
|Detecting textured objects using convex hull
British Library Online Contents | 2007
|NTRS | 1981
|On the Polarizability Dyadics of Electrically Small, Convex Objects
British Library Online Contents | 1993
|