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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Tracking of convex objects


    Contributors:


    Publication date :

    1995-01-01


    Size :

    468071 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Tracking of Convex Objects

    Parvin, B. A. / Viswanathan, S. / IEEE; Computer Society; Technical Committee for Pattern Analysis and Machine Intelligence | British Library Conference Proceedings | 1995


    Detecting textured objects using convex hull

    Lu, K. / Pavlidis, T. | British Library Online Contents | 2007


    Tracking after objects

    RAICHELGAUZ IGAL / ODINAEV KARINA | European Patent Office | 2021

    Free access

    Tracking falling objects

    Frazer, R. E. | NTRS | 1981


    On the Polarizability Dyadics of Electrically Small, Convex Objects

    Lakhtakia, A. | British Library Online Contents | 1993