16 search results - page 1 / 4 » Approximations of Geodesic Distances for Incomplete Triangul... |
110
Voted
CCCG
2007
15 years 1 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...
100
click to vote
CG
2005
Springer
15 years 9 days 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...
97
Voted
ICIP
2008
IEEE
16 years 2 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 ...
102
click to vote
ECCV
2010
Springer
15 years 4 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...
114
click to vote
FGR
2006
IEEE
15 years 6 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...