In this paper we describe a new technique for general purpose interactive segmentation of N-dimensional images. The user marks certain pixels as "object" or "background" to provide hard constraints for segmentation. Additional soft constraints incorporate both boundary and region information. Graph cuts are used to find the globally optimal segmentation of the N-dimensional image. The obtained solution gives the best balance of boundary and region properties among all segmentations satisfying the constraints. The topology of our segmentation is unrestricted and both "object" and "background" segments may consist of several isolated parts. Some experimental results are presented in the context of photo/video editing and medical image segmentation. We also demonstrate an interesting Gestalt example. A fast implementation of our segmentation method is possible via a new max-flow algorithm.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images


    Beteiligte:
    Boykov, Y.Y. (Autor:in) / Jolly, M.-P. (Autor:in)


    Erscheinungsdatum :

    2001-01-01


    Format / Umfang :

    939573 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Interactive Graph Cuts for Optimal Boundary and Region Segmentation of Objects in N-D Images

    Boykov, Y. / Jolly, M. / IEEE | British Library Conference Proceedings | 2001


    Demonstration of Segmentation with Interactive Graph Cuts

    Boykov, Y. / Jolly, M. / IEEE | British Library Conference Proceedings | 2001



    Efficient Graph Cuts for Multiclass Interactive Image Segmentation

    Lu, Fangfang / Fu, Zhouyu / Robles-Kelly, Antonio | Springer Verlag | 2007


    Iris segmentation in non-ideal images using graph cuts

    Pundlik, S. / Woodard, D. / Birchfield, S. | British Library Online Contents | 2010