Sciweavers

39 search results - page 7 / 8
» On minimally 3-connected graphs on a surface
Sort
View
CVPR
2010
IEEE
14 years 2 months ago
3D Shape Correspondence by Isometry-Driven Greedy Optimization
We present an automatic method that establishes 3D correspondence between isometric shapes. Our goal is to find an optimal correspondence between two given (nearly) isometric sha...
Yusuf Sahillioglu, Yucel Yemez
MICCAI
2010
Springer
13 years 4 months ago
Non-parametric Iterative Model Constraint Graph min-cut for Automatic Kidney Segmentation
We present a new non-parametric model constraint graph min-cut algorithm for automatic kidney segmentation in CT images. The segmentation is formulated as a maximum a-posteriori es...
Moti Freiman, A. Kronman, S. J. Esses, Leo Joskowi...
ICPR
2010
IEEE
13 years 11 months ago
Geodesic Thin Plate Splines for Image Segmentation
Thin Plate Splines are often used in image registration to model deformations. Its physical analogy involves a thin lying sheet of metal that is deformed and forced to pass throug...
Herve Lombaert, Farida Cheriet
CVPR
2007
IEEE
14 years 3 days ago
A Graph Reduction Method for 2D Snake Problems
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
Jianhua Yan, Keqi Zhang, Chengcui Zhang, Shu-Ching...
COMPGEOM
2010
ACM
13 years 10 months ago
Computing similarity between piecewise-linear functions
We study the problem of computing the similarity between two piecewise-linear bivariate functions defined over a common domain, where the surfaces they define in 3D—polyhedral...
Pankaj K. Agarwal, Boris Aronov, Marc J. van Kreve...