Geodesic Interpolating Splines

  title={Geodesic Interpolating Splines},
  author={Vincent Camion and Laurent Younes},
We propose a simple and efficient method to interpolate landmark matching by a non-ambiguous mapping (a diffeomorphism). This method is based on spline interpolation, and on recent techniques developed for the estimation of flows of diffeomorphisms. Experimental results show interpolations of remarkable quality. Moreover, the method provides a Riemannian distance on sets of landmarks (with fixed cardinality), which can be defined intrinsically, without refering to diffeomorphisms. The numerical… 
Combining geodesic interpolating splines and affine transformations
  • L. Younes
  • Mathematics
    IEEE Transactions on Image Processing
  • 2006
The Geodesic spline interpolation method is extended to incorporate the estimation of a affine transformation, yielding a consistent and numerically stable algorithm.
Computing the Geodesic Interpolating Spline
First, a method is described which exploits the structure of the problem in order to permit efficient optimization and second, an approach using the framework of classical mechanics is outlined.
Geodesic Shooting and Diffeomorphic Matching Via Textured Meshes
Two optimization methods formulated in terms of the initial momentum are analyzed and compared: direct optimization by gradient descent, or root-finding for the transversality equation, enhanced by a preconditioning of the Jacobian.
The Euler-Lagrange Equation for Interpolating Sequence of Landmark Datasets
A method for interpolating a sequence of land- marks in a model of growth, where anatomical object boundaries are parametrized by landmarks and the growth processes generate a landmarked sequence in time.
Analysis of the geodesic interpolating spline
We study the geodesic interpolating spline with a biharmonic regulariser for solving the landmark image registration problem. We show existence of solutions, discuss uniqueness and show how the
Measuring Geodesic Distances on the Space of Bounded Diffeomorphisms
This paper considers the problem of measuring the differences between deformations, and introduces a new spline with explicit boundary conditions, and shows how this can be used to generate general flows of bounded diffeomorphisms.
Landmark Matching via Large Deformation Diffeomorphisms on the Sphere
A methodology and algorithm for generating diffeomorphisms of the sphere onto itself, given the displacements of a finite set of template landmarks, has application in brain mapping, where surface data is typically mapped to the sphere as a common coordinate system.
Geodesic Shooting for Computational Anatomy
It is shown that this momentum can be also used for describing a deformation of given visual structures, like points, contours or images, and that, it has the same dimension as the described object, as a consequence of the normal momentum constraint the authors introduce.
Correspondence-Less Non-rigid Registration of Triangular Surface Meshes
  • Zsolt Sánta, Z. Kato
  • Computer Science
    2013 IEEE Conference on Computer Vision and Pattern Recognition
  • 2013
A novel correspondence-less approach to find a thin plate spline map between a pair of deformable 3D objects represented by triangular surface meshes that outperforms state of the art methods both in terms of computing time and accuracy.
Smoothing under Diffeomorphic Constraints with Homeomorphic Splines
A new class of diffeomorphic smoothers based on general spline smoothing techniques and on the use of some tools that have been recently developed in the context of image warping to compute smooth diffeomorphisms is introduced.


Multivariate interpolation at arbitrary points made simple
The concrete method of ‘surface spline interpolation’ is closely connected with the classical problem of minimizing a Sobolev seminorm under interpolatory constraints; the intrinsic structure of
Landmark matching via large deformation diffeomorphisms
Conditions for the existence of solutions in the space of diffeomorphisms are established, with a gradient algorithm provided for generating the optimal flow solving the minimum problem.
Computable Elastic Distances Between Shapes
  • L. Younes
  • Computer Science
    SIAM J. Appl. Math.
  • 1998
An elastic matching algorithm which is based on a true distance between intrinsic properties of the shapes, taking into account possible invariance to scaling or Euclidean transformations in the case they are required.
Image Warping Using Few Anchor Points and Radial Functions
This work decomposes transformations based on radial basis junctions into linear and radial terms, and shows examples where such a decomposition is advantageous.
Image Warping by Radial Basis Functions: Application to Facial Expressions
It is shown that the method of radial basis functions provides a powerful mechanism for processing facial expressions and is applicable to other elastic objects as well.
Variational problems on ows of di eomorphisms for image matching
A food plate package having a bottom plate and a top cover for the temporary storage of prepared food products, the top cover being convex-oval, with support ribs integrally formed in the cover. The
Differential Geometry, Lie Groups, and Symmetric Spaces
Elementary differential geometry Lie groups and Lie algebras Structure of semisimple Lie algebras Symmetric spaces Decomposition of symmetric spaces Symmetric spaces of the noncompact type Symmetric
In nite dimensional group action and pattern recognition
  • Quaterly of Applied Math. (to appear),
  • 2000