16 search results - page 1 / 4 » Approximations of Geodesic Distances for Incomplete Triangul... |
CCCG
2007
13 years 6 months ago
2007
We present a heuristic algorithm to compute approximate geodesic distances on a triangular manifold S containing n vertices with partially missing data. The proposed method comput...
CG
2005
Springer
13 years 5 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...
ICIP
2008
IEEE
14 years 7 months ago
2008
IEEE
In this paper, we focus on the use of random projections as a dimensionality reduction tool for sampled manifolds in highdimensional Euclidean spaces. We show that geodesic paths ...
ECCV
2010
Springer
13 years 9 months ago
2010
Springer
Manifolds are widely used to model non-linearity arising in a range of computer vision applications. This paper treats statistics on manifolds and the loss of accuracy occurring wh...
FGR
2006
IEEE
13 years 11 months ago
2006
IEEE
An unsupervised nonparametric approach is proposed to automatically extract representative face samples (exemplars) from a video sequence or an image set for multipleshot face rec...