Results 1  10
of
40
ThreeDimensional Face Recognition
, 2005
"... An expressioninvariant 3D face recognition approach is presented. Our basic assumption is that facial expressions can be modelled as isometries of the facial surface. This allows to construct expressioninvariant representations of faces using the bendinginvariant canonical forms approach. The re ..."
Abstract

Cited by 103 (22 self)
 Add to MetaCart
An expressioninvariant 3D face recognition approach is presented. Our basic assumption is that facial expressions can be modelled as isometries of the facial surface. This allows to construct expressioninvariant representations of faces using the bendinginvariant canonical forms approach. The result is an efficient and accurate face recognition algorithm, robust to facial expressions, that can distinguish between identical twins (the first two authors). We demonstrate a prototype system based on the proposed algorithm and compare its performance to classical face recognition methods. The numerical methods employed by our approach do not require the facial surface explicitly. The surface gradients field, or the surface metric, are sufficient for constructing the expressioninvariant representation of any given face. It allows us to perform the 3D face recognition task while avoiding the surface reconstruction stage.
Geodesic entropic graphs for dimension and entropy estimation in manifold learning
 IEEE Trans. on Signal Processing
, 2004
"... Abstract—In the manifold learning problem, one seeks to discover a smooth low dimensional surface, i.e., a manifold embedded in a higher dimensional linear vector space, based on a set of measured sample points on the surface. In this paper, we consider the closely related problem of estimating the ..."
Abstract

Cited by 66 (4 self)
 Add to MetaCart
Abstract—In the manifold learning problem, one seeks to discover a smooth low dimensional surface, i.e., a manifold embedded in a higher dimensional linear vector space, based on a set of measured sample points on the surface. In this paper, we consider the closely related problem of estimating the manifold’s intrinsic dimension and the intrinsic entropy of the sample points. Specifically, we view the sample points as realizations of an unknown multivariate density supported on an unknown smooth manifold. We introduce a novel geometric approach based on entropic graph methods. Although the theory presented applies to this general class of graphs, we focus on the geodesicminimalspanningtree (GMST) to obtaining asymptotically consistent estimates of the manifold dimension and the Rényientropy of the sample density on the manifold. The GMST approach is striking in its simplicity and does not require reconstruction of the manifold or estimation of the multivariate density of the samples. The GMST method simply constructs a minimal spanning tree (MST) sequence using a geodesic edge matrix and uses the overall lengths of the MSTs to simultaneously estimate manifold dimension and entropy. We illustrate the GMST approach on standard synthetic manifolds as well as on real data sets consisting of images of faces. Index Terms—Conformal embedding, intrinsic dimension, intrinsic entropy, manifold learning, minimal spanning tree, nonlinear dimensionality reduction. I.
O(N) Implementation of the Fast Marching Algorithm
 Journal of Computational Physics
, 2005
"... In this note we present an implementation of the fast marching algorithm for solving Eikonal equations that reduces the original runtime from O(N log N) to linear. This lower runtime cost is obtained while keeping an error bound of the same order of magnitude as the original algorithm. This improv ..."
Abstract

Cited by 50 (9 self)
 Add to MetaCart
In this note we present an implementation of the fast marching algorithm for solving Eikonal equations that reduces the original runtime from O(N log N) to linear. This lower runtime cost is obtained while keeping an error bound of the same order of magnitude as the original algorithm. This improvement is achieved introducing the straight forward untidy priority queue, obtained via a quantization of the priorities in the marching computation. We present the underlying framework, estimations on the error, and examples showing the usefulness of the proposed approach. Key words: Fast marching, HamiltonJacobi and Eikonal equations, distance functions, bucket sort, untidy priority queue.
A GromovHausdorff framework with diffusion geometry for topologicallyrobust nonrigid shape matching
 IMA PREPRINT SERIES# 2240
, 2009
"... ..."
Approximation with Active Bspline Curves and Surfaces
, 2002
"... An active contour model for parametric curve and surface approximation is presented. The active curve or surface adapts to the model shape to be approximated in an optimization algorithm. The quasiNewton optimization procedure in each iteration step minimizes a quadratic function which is built up ..."
Abstract

Cited by 44 (7 self)
 Add to MetaCart
An active contour model for parametric curve and surface approximation is presented. The active curve or surface adapts to the model shape to be approximated in an optimization algorithm. The quasiNewton optimization procedure in each iteration step minimizes a quadratic function which is built up with help of local quadratic approximants of the squared distance function of the model shape and an internal energy which has a smoothing and regularization effect. The approach completely avoids the parametrization problem. We also show how to use a similar strategy for the solution of variational problems for curves on surfaces. Examples are the geodesic path connecting two points on a surface and interpolating or approximating spline curves on surfaces. Finally we indicate how the latter topic leads to the variational design of smooth motions which interpolate or approximate given positions. 1.
Fast sweeping methods for static hamiltonjacobi equations
 Society for Industrial and Applied Mathematics
, 2005
"... Abstract. We propose a new sweeping algorithm which discretizes the Legendre transform of the numerical Hamiltonian using an explicit formula. This formula yields the numerical solution at a grid point using only its immediate neighboring grid values and is easy to implement numerically. The minimiz ..."
Abstract

Cited by 41 (4 self)
 Add to MetaCart
Abstract. We propose a new sweeping algorithm which discretizes the Legendre transform of the numerical Hamiltonian using an explicit formula. This formula yields the numerical solution at a grid point using only its immediate neighboring grid values and is easy to implement numerically. The minimization that is related to the Legendre transform in our sweeping scheme can either be solved analytically or numerically. We illustrate the efficiency and accuracy approach with several numerical examples in two and three dimensions.
Geometric modeling in shape space
 In Proc. SIGGRAPH
, 2007
"... Figure 1: Geodesic interpolation and extrapolation. The blue input poses of the elephant are geodesically interpolated in an asisometricaspossible fashion (shown in green), and the resulting path is geodesically continued (shown in purple) to naturally extend the sequence. No semantic information, ..."
Abstract

Cited by 41 (4 self)
 Add to MetaCart
Figure 1: Geodesic interpolation and extrapolation. The blue input poses of the elephant are geodesically interpolated in an asisometricaspossible fashion (shown in green), and the resulting path is geodesically continued (shown in purple) to naturally extend the sequence. No semantic information, segmentation, or knowledge of articulated components is used. We present a novel framework to treat shapes in the setting of Riemannian geometry. Shapes – triangular meshes or more generally straight line graphs in Euclidean space – are treated as points in a shape space. We introduce useful Riemannian metrics in this space to aid the user in design and modeling tasks, especially to explore the space of (approximately) isometric deformations of a given shape. Much of the work relies on an efficient algorithm to compute geodesics in shape spaces; to this end, we present a multiresolution framework to solve the interpolation problem – which amounts to solving a boundary value problem – as well as the extrapolation problem – an initial value problem – in shape space. Based on these two operations, several classical concepts like parallel transport and the exponential map can be used in shape space to solve various geometric modeling and geometry processing tasks. Applications include shape morphing, shape deformation, deformation transfer, and intuitive shape exploration.
Intrinsic subdivision with smooth limits for graphics and animation
 ACM TRANS. GRAPH
, 2006
"... This paper demonstrates the definition of subdivision processes in nonlinear geometries such that smoothness of limits can be proved. We deal with curve subdivision in the presence of obstacles, in surfaces, in Riemannian manifolds, and in the Euclidean motion group. We show how to model kinematic s ..."
Abstract

Cited by 32 (10 self)
 Add to MetaCart
This paper demonstrates the definition of subdivision processes in nonlinear geometries such that smoothness of limits can be proved. We deal with curve subdivision in the presence of obstacles, in surfaces, in Riemannian manifolds, and in the Euclidean motion group. We show how to model kinematic surfaces and motions in the presence of obstacles via subdivision. As to numerics, we consider the sensitivity of the limit’s smoothness to sloppy computing.
Solving variational problems and partial differential equations mapping into general target manifolds
 J. Comput. Phys
, 2004
"... ..."
An efficient solution to the eikonal equation on parametric manifolds
 INTERFACES AND FREE BOUNDARIES 6 (2004), 315–327
, 2004
"... We present an efficient solution to the eikonal equation on parametric manifolds, based on the fast marching approach. This method overcomes the problem of a nonorthogonal coordinate system on the manifold by creating an appropriate numerical stencil. The method is tested numerically and demonstrat ..."
Abstract

Cited by 29 (17 self)
 Add to MetaCart
We present an efficient solution to the eikonal equation on parametric manifolds, based on the fast marching approach. This method overcomes the problem of a nonorthogonal coordinate system on the manifold by creating an appropriate numerical stencil. The method is tested numerically and demonstrated by calculating distances on various parametric manifolds. It is further used for two applications: image enhancement and face recognition.