We present a new approach for finding a set of contour curves in an image. We consider the problem of perceptual grouping and contour completion, where the data is a set of points in the image. A new method to find complete curves from a set of contours or edge points is presented. Our approach is based on a previous work on finding contours as minimal paths between two end points using the fast marching algorithm (Cohen et al., 1997). Given a set of key points, we find the pairs of points that have to be linked. The paths that join them complete the initial set of contours and allow us to close them. In a second part, we propose a scheme that does not need key points for initialization. Key points are automatically selected from a larger set of admissible points. We illustrate the capability of our approach to close contours with synthetic examples.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Multiple contour finding and perceptual grouping using minimal paths


    Contributors:
    Cohen, L.D. (author)


    Publication date :

    2001-01-01


    Size :

    1003763 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Multiple Contour Finding and Perceptual Grouping using Minimal Paths

    Cohen, L. D. | British Library Online Contents | 2001


    Multiple Contour Finding and Perceptual Grouping Using Minimal Paths

    Cohen, L. / Institute of Electrical and Electronics Engineers | British Library Conference Proceedings | 2001


    Perceptual Grouping of Contour Segments Using Markov Random Fields

    Ackermann, F. / Massmann, A. / Posch, S. et al. | British Library Online Contents | 1997


    Perceptual Grouping by Selection of a Logically Minimal Model

    Feldman, J. | British Library Online Contents | 2003


    Contour Grouping Based on Contour-Skeleton Duality

    Adluru, N. / Latecki, L. J. | British Library Online Contents | 2009