loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR '03) - Volume 2
Perception-based 3D Triangle Mesh Segmentation Using Fast Marching Watersheds
Madison, Wisconsin
June 18-June 20
ISBN: 0-7695-1900-8
ASCII Text
x 
 
D. L. Page, A. F. Koschan, M. A. Abidi, "Perception-based 3D Triangle Mesh Segmentation Using Fast Marching Watersheds," Computer Vision and Pattern Recognition, IEEE Computer Society Conference on, vol. 2, pp. 27, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR '03) - Volume 2, 2003.
 
 
BibTex
x
 
@article{ 10.1109/CVPR.2003.1211448,
author = {D. L. Page and A. F. Koschan and M. A. Abidi},
title = {Perception-based 3D Triangle Mesh Segmentation Using Fast Marching Watersheds},
journal ={Computer Vision and Pattern Recognition, IEEE Computer Society Conference on},
volume = {2},
year = {2003},
issn = {1063-6919},
pages = {27},
doi = {http://doi.ieeecomputersociety.org/10.1109/CVPR.2003.1211448},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computer Vision and Pattern Recognition, IEEE Computer Society Conference on
TI - Perception-based 3D Triangle Mesh Segmentation Using Fast Marching Watersheds
SN - 1063-6919
SP
EP
A1 - D. L. Page,
A1 - A. F. Koschan,
A1 - M. A. Abidi,
PY - 2003
KW - null
VL - 2
JA - Computer Vision and Pattern Recognition, IEEE Computer Society Conference on
ER -
 
D. L. Page, University of Tennessee, Knoxville
A. F. Koschan, University of Tennessee, Knoxville
M. A. Abidi, University of Tennessee, Knoxville
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.
Citation:
D. L. Page, A. F. Koschan, M. A. Abidi, "Perception-based 3D Triangle Mesh Segmentation Using Fast Marching Watersheds," cvpr, vol. 2, pp.27, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR '03) - Volume 2, 2003
Usage of this product signifies your acceptance of the Terms of Use.