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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

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


    Contributors:


    Publication date :

    2003-01-01


    Size :

    486524 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    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

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


    Regularized Marching Cubes Mesh

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


    Fast approximate geodesic paths on triangle mesh

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


    Robot Formations Control Using Fast Marching

    Garrido Bullón, Luis Santiago / Moreno Lorente, Luis Enrique / Lima, Pedro U. | BASE | 2011

    Free access