446 search results - page 9 / 90 » Curve Matching Using the Fast Marching Method |
CG
2005
Springer
13 years 7 months ago
2005
Springer
We present a new algorithm to compute a geodesic path over a triangulated surface. Based on Sethian's Fast Marching Method and Polthier's Straightest Geodesics theory, w...
SMI
2008
IEEE
14 years 1 months ago
2008
IEEE
In this work we compute the similarity of 3D faces using a set of eight contour curves. These contours were selected and matched using our 3D face matching framework. In previous ...
CVPR
2001
IEEE
14 years 9 months ago
2001
IEEE
We approach the problem of 2-D and 3-D puzzle solving by matching the geometric features of puzzle pieces three at a time. First, we define an affinity measure for a pair of piece...
BMVC
1998
13 years 8 months ago
1998
In this paper, we discuss a method for representing and matching planar curves. The technique is based on using calculations from concentric circles to represent each curve by two...
AVBPA
2003
Springer
14 years 21 days ago
2003
Springer
Given a biometric feature-space, in this paper we present a method to predict cumulative match characteristic (CMC) curve performance for a large population of individuals using a ...