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

Abstract

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.

Cite

Text

Page et al. "Perception-Based 3D Triangle Mesh Segmentation Using Fast Marching Watersheds." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2003. doi:10.1109/CVPR.2003.1211448

Markdown

[Page et al. "Perception-Based 3D Triangle Mesh Segmentation Using Fast Marching Watersheds." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2003.](https://mlanthology.org/cvpr/2003/page2003cvpr-perception/) doi:10.1109/CVPR.2003.1211448

BibTeX

@inproceedings{page2003cvpr-perception,
  title     = {{Perception-Based 3D Triangle Mesh Segmentation Using Fast Marching Watersheds}},
  author    = {Page, David L. and Koschan, Andreas F. and Abidi, Mongi A.},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {2003},
  pages     = {27-32},
  doi       = {10.1109/CVPR.2003.1211448},
  url       = {https://mlanthology.org/cvpr/2003/page2003cvpr-perception/}
}