In this paper, we describe an algorithm called fast marching watersheds that segments a triangle mesh into visual parts. This computer vision algorithm leverages a human vision theory known as the minima rule. Our implementation computes the principal curvatures and principal directions at each vertex of a mesh, and then our hill-climbing watershed algorithm identifies regions bounded by contours of negative curvature minima. These regions fit the definition of visual parts according to the minima rule. We present evaluation analysis and experimental results for the proposed algorithm.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Perception-based 3D triangle mesh segmentation using fast marching watersheds


    Beteiligte:
    Koschan, A.F. (Autor:in)


    Erscheinungsdatum :

    01.01.2003


    Format / Umfang :

    486524 byte





    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Perception-Based 3D Triangle Mesh Segmentation Using Fast Marching Watersheds

    Page, D. / Koschan, A. / Abidi, M. et al. | British Library Conference Proceedings | 2003


    Regularized Marching Cubes Mesh

    Lee, S.-W. / Senot, A. / Jung, H.-Y. et al. | British Library Conference Proceedings | 2005


    Regularized marching cubes mesh

    Seung-Woo Lee, / Senot, A. / Ho-Youl Jung, et al. | IEEE | 2005


    Fast approximate geodesic paths on triangle mesh

    Tang, J. / Wu, G. S. / Zhang, F. Y. et al. | British Library Online Contents | 2007