<?xml version="1.0" ?>
<bibtex:file xmlns:bibtex="http://bibtexml.sf.net/">
<!-- This file was exported from JabRef jabref.sf.net -->
<!-- 2006-01-17 added DOI XML character formatting, because DOI can contain &lt; and &gt; -->

<bibtex:entry id="brunet2011ijcv">
  <bibtex:article>
    <bibtex:author>Brunet&#44; Florent and Gay&#45;Bellile&#44; Vincent and Bartoli&#44; Adrien and Navab&#44; Nassir and Malgouyres&#44; R&#233;my</bibtex:author>

    <bibtex:title>Feature&#45;Driven Direct Non&#45;Rigid Image Registration</bibtex:title>

    <bibtex:journal>International Journal of Computer Vision</bibtex:journal>
    <bibtex:publisher>Springer</bibtex:publisher>
    <bibtex:year>2011</bibtex:year>
    <bibtex:volume>93</bibtex:volume>


    <bibtex:pages>33-52</bibtex:pages>








    <bibtex:abstract>The direct registration problem for images of a deforming surface has been well studied. Parametric flexible warps based&#44; for instance&#44; on the Free&#45;Form Deformation or a Radial Basis Function such as the Thin&#45;Plate Spline&#44; are often estimated using additive Gauss&#45;Newton&#45;like algorithms. The recently proposed compositional framework has been shown to be more efficient&#44; but cannot be directly applied to such non&#45;groupwise warps. &#10;&#10;Our main contribution in this paper is the Feature&#45;Driven framework. It makes possible the use of compositional algorithms for most parametric warps such as those above mentioned. Two algorithms are proposed to demonstrate the relevance of our Feature&#45;Driven framework: the Feature&#45;Driven Inverse Compositional and the Feature&#45;Driven Learning&#45;based algorithms. As another contribution&#44; a detailed derivation of the Feature&#45;Driven warp parameterization is given for the Thin&#45;Plate Spline and the Free&#45;Form Deformation. We experimentally show that these two types of warps have a similar representational power. Experimental results show that our Feature&#45;Driven registration algorithms are more efficient in terms of computational cost&#44; without loss of accuracy&#44; compared to existing methods.</bibtex:abstract>
    <bibtex:url>http://www.brnt.eu/publications/brunet2011ijcv.pdf</bibtex:url>
    <bibtex:doi>10.1007/s11263&#45;010&#45;0407&#45;x</bibtex:doi>











  </bibtex:article>
</bibtex:entry>
</bibtex:file>
