<?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="brunet2010accv">
  <bibtex:inproceedings>
    <bibtex:author>Brunet&#44; Florent and Hartley&#44; Richard and Bartoli&#44; Adrien and Navab&#44; Nassir and Malgouyres&#44; R&#233;my</bibtex:author>
    <bibtex:editor>Kimmel&#44; Ron and Klette&#44; Reinhard and Sugimoto&#44; Akihiro</bibtex:editor>
    <bibtex:title>Monocular Template&#45;based Reconstruction of Smooth and Inextensible Surfaces</bibtex:title>
    <bibtex:booktitle>Proceedings of the Tenth Asian Conference on Computer Vision (ACCV 2010)</bibtex:booktitle>


    <bibtex:year>2010</bibtex:year>
    <bibtex:volume>6494</bibtex:volume>
    <bibtex:month>November</bibtex:month>

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


    <bibtex:series>Lecture Notes in Computer Science</bibtex:series>



    <bibtex:address>Queenstown (New Zealand)</bibtex:address>

    <bibtex:abstract>We present different approaches to reconstructing an inextensible surface from point correspondences between an input image and a template image representing a flat reference shape from a fronto&#45;parallel point of view. We first propose a &#39;point&#45;wise&#39; method&#44; i.e. a method that only retrieves the 3D positions of the point correspondences. This method is formulated as a second&#45;order cone program and it handles inaccuracies in the point measurements. It relies on the fact that the Euclidean distance between two 3D points must be shorter than their geodesic distance (which can easily be computed from the template image). We then present an approach that reconstructs a smooth 3D surface based on Free&#45;Form Deformations. The surface is represented as a smooth map from the template image space to the 3D space. Our idea is to say that the 2D&#45;3D map must be everywhere a local isometry. This induces conditions on the Jacobian matrix of the map which are included in a least&#45;squares minimization problem.</bibtex:abstract>
    <bibtex:url>http://www.brnt.eu/publications/brunet2010accv.pdf</bibtex:url>
    <bibtex:doi>10.1007/978&#45;3&#45;642&#45;19318&#45;7&#95;5</bibtex:doi>











  </bibtex:inproceedings>
</bibtex:entry>
</bibtex:file>
