AustralieFrV1, PascalFrancis, Checkpoint, bibRecord, 000188

Monocular template-based 3D surface reconstruction: Convex inextensible and nonconvex isometric methods

Identifieur interne : 000188 ( PascalFrancis/Checkpoint ); précédent : 000187; suivant : 000189

Monocular template-based 3D surface reconstruction: Convex inextensible and nonconvex isometric methods

Auteurs : F. Brunet [France] ; A. Bartoli [France] ; R. I. Hartley [Australie]

Source :

Computer vision and image understanding : (Print) [ 1077-3142 ] ; 2014.

RBID : Pascal:15-0004489

Descripteurs français

Pascal (Inist)
- Image tridimensionnelle, Reconstruction image, Traitement image, Vision ordinateur, Reconstruction surface, Forme libre, Processeur pipeline, Vision monoculaire, Surface convexe, Surface lisse, Initialisation, Analyse non convexe, Isométrie, Programmation conique, Modélisation, Méthode moindre carré, Algorithme de Levenberg Marquardt, Minimisation, Résultat expérimental, Méthode raffinement.

English descriptors

KwdEn :
- Computer vision, Convex surface, Experimental result, Free form, Image processing, Image reconstruction, Initialization, Isometry, Least squares method, Levenberg Marquardt algorithm, Minimization, Modeling, Monocular vision, Non convex analysis, Pipeline processor, Refinement method, Smooth surface, Surface reconstruction, Tridimensional image, conic programming.

Abstract

We study the 3D reconstruction of an isometric surface from point correspondences between a template and a single input image. The template shows the surface flat and fronto-parallel. We propose three new methods. The first two use a convex relaxation of isometry to inextensibility. They are formulated as Second Order Cone Programs (SOCP). The first proposed method is point-wise (it reconstructs only the input point correspondences) while the second proposed method uses a smooth and continuous surface model, based on Free-Form Deformations (FFD). The third proposed method uses the 'true' nonconvex isometric constraint and the same continuous surface model. It is formulated with Nonlinear Least-Squares and can thus be solved with the efficient Levenberg-Marquardt minimization method. The proposed approaches may be combined in a single pipeline whereby one of the convex approximations is used to initialize the nonconvex method. Our contributions solve two important limitations of current state of the art: our convex methods are the first ones to handle noise in both the template and image points, and our nonconvex method is the first one to use 'true' isometric constraints. Our experimental results on simulated and real data show that our convex point-wise method and our nonconvex method outperform respectively current initialization and refinement methods in 3D reconstructed surface accuracy.

Affiliations:

Links toward previous steps (curation, corpus...)

to stream PascalFrancis, to step Corpus: 000147
to stream PascalFrancis, to step Curation: 005D06

Links to Exploration step

Pascal:15-0004489

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Monocular template-based 3D surface reconstruction: Convex inextensible and nonconvex isometric methods</title>
<author><name sortKey="Brunet, F" sort="Brunet, F" uniqKey="Brunet F" first="F." last="Brunet">F. Brunet</name>
<affiliation wicri:level="3"><inist:fA14 i1="01"><s1>Ubleam</s1>
<s2>Toulouse</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region">Occitanie (région administrative)</region>
<region type="old region">Midi-Pyrénées</region>
<settlement type="city">Toulouse</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Bartoli, A" sort="Bartoli, A" uniqKey="Bartoli A" first="A." last="Bartoli">A. Bartoli</name>
<affiliation wicri:level="3"><inist:fA14 i1="02"><s1>ISIT, UMR 6284 CNRS-UdA</s1>
<s2>Clermont-Ferrand</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region">Auvergne-Rhône-Alpes</region>
<region type="old region">Auvergne (région administrative)</region>
<settlement type="city">Clermont-Ferrand</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Hartley, R I" sort="Hartley, R I" uniqKey="Hartley R" first="R. I." last="Hartley">R. I. Hartley</name>
<affiliation wicri:level="1"><inist:fA14 i1="03"><s1>ANU-NICTA</s1>
<s2>Canberra</s2>
<s3>AUS</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>Australie</country>
<wicri:noRegion>ANU-NICTA</wicri:noRegion>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">15-0004489</idno>
<date when="2014">2014</date>
<idno type="stanalyst">PASCAL 15-0004489 INIST</idno>
<idno type="RBID">Pascal:15-0004489</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000147</idno>
<idno type="wicri:Area/PascalFrancis/Curation">005D06</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000188</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000188</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Monocular template-based 3D surface reconstruction: Convex inextensible and nonconvex isometric methods</title>
<author><name sortKey="Brunet, F" sort="Brunet, F" uniqKey="Brunet F" first="F." last="Brunet">F. Brunet</name>
<affiliation wicri:level="3"><inist:fA14 i1="01"><s1>Ubleam</s1>
<s2>Toulouse</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region">Occitanie (région administrative)</region>
<region type="old region">Midi-Pyrénées</region>
<settlement type="city">Toulouse</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Bartoli, A" sort="Bartoli, A" uniqKey="Bartoli A" first="A." last="Bartoli">A. Bartoli</name>
<affiliation wicri:level="3"><inist:fA14 i1="02"><s1>ISIT, UMR 6284 CNRS-UdA</s1>
<s2>Clermont-Ferrand</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region">Auvergne-Rhône-Alpes</region>
<region type="old region">Auvergne (région administrative)</region>
<settlement type="city">Clermont-Ferrand</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Hartley, R I" sort="Hartley, R I" uniqKey="Hartley R" first="R. I." last="Hartley">R. I. Hartley</name>
<affiliation wicri:level="1"><inist:fA14 i1="03"><s1>ANU-NICTA</s1>
<s2>Canberra</s2>
<s3>AUS</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>Australie</country>
<wicri:noRegion>ANU-NICTA</wicri:noRegion>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Computer vision and image understanding : (Print)</title>
<title level="j" type="abbreviated">Comput. vis. image underst. : (Print)</title>
<idno type="ISSN">1077-3142</idno>
<imprint><date when="2014">2014</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Computer vision and image understanding : (Print)</title>
<title level="j" type="abbreviated">Comput. vis. image underst. : (Print)</title>
<idno type="ISSN">1077-3142</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Computer vision</term>
<term>Convex surface</term>
<term>Experimental result</term>
<term>Free form</term>
<term>Image processing</term>
<term>Image reconstruction</term>
<term>Initialization</term>
<term>Isometry</term>
<term>Least squares method</term>
<term>Levenberg Marquardt algorithm</term>
<term>Minimization</term>
<term>Modeling</term>
<term>Monocular vision</term>
<term>Non convex analysis</term>
<term>Pipeline processor</term>
<term>Refinement method</term>
<term>Smooth surface</term>
<term>Surface reconstruction</term>
<term>Tridimensional image</term>
<term>conic programming</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Image tridimensionnelle</term>
<term>Reconstruction image</term>
<term>Traitement image</term>
<term>Vision ordinateur</term>
<term>Reconstruction surface</term>
<term>Forme libre</term>
<term>Processeur pipeline</term>
<term>Vision monoculaire</term>
<term>Surface convexe</term>
<term>Surface lisse</term>
<term>Initialisation</term>
<term>Analyse non convexe</term>
<term>Isométrie</term>
<term>Programmation conique</term>
<term>Modélisation</term>
<term>Méthode moindre carré</term>
<term>Algorithme de Levenberg Marquardt</term>
<term>Minimisation</term>
<term>Résultat expérimental</term>
<term>Méthode raffinement</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We study the 3D reconstruction of an isometric surface from point correspondences between a template and a single input image. The template shows the surface flat and fronto-parallel. We propose three new methods. The first two use a convex relaxation of isometry to inextensibility. They are formulated as Second Order Cone Programs (SOCP). The first proposed method is point-wise (it reconstructs only the input point correspondences) while the second proposed method uses a smooth and continuous surface model, based on Free-Form Deformations (FFD). The third proposed method uses the 'true' nonconvex isometric constraint and the same continuous surface model. It is formulated with Nonlinear Least-Squares and can thus be solved with the efficient Levenberg-Marquardt minimization method. The proposed approaches may be combined in a single pipeline whereby one of the convex approximations is used to initialize the nonconvex method. Our contributions solve two important limitations of current state of the art: our convex methods are the first ones to handle noise in both the template and image points, and our nonconvex method is the first one to use 'true' isometric constraints. Our experimental results on simulated and real data show that our convex point-wise method and our nonconvex method outperform respectively current initialization and refinement methods in 3D reconstructed surface accuracy.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>1077-3142</s0>
</fA01>
<fA02 i1="01"><s0>CVIUF4</s0>
</fA02>
<fA03 i2="1"><s0>Comput. vis. image underst. : (Print)</s0>
</fA03>
<fA05><s2>125</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>Monocular template-based 3D surface reconstruction: Convex inextensible and nonconvex isometric methods</s1>
</fA08>
<fA11 i1="01" i2="1"><s1>BRUNET (F.)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>BARTOLI (A.)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>HARTLEY (R. I.)</s1>
</fA11>
<fA14 i1="01"><s1>Ubleam</s1>
<s2>Toulouse</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>ISIT, UMR 6284 CNRS-UdA</s1>
<s2>Clermont-Ferrand</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="03"><s1>ANU-NICTA</s1>
<s2>Canberra</s2>
<s3>AUS</s3>
<sZ>3 aut.</sZ>
</fA14>
<fA20><s1>138-154</s1>
</fA20>
<fA21><s1>2014</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>15463A</s2>
<s5>354000150328090100</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2015 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>29 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>15-0004489</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Computer vision and image understanding : (Print)</s0>
</fA64>
<fA66 i1="01"><s0>NLD</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>We study the 3D reconstruction of an isometric surface from point correspondences between a template and a single input image. The template shows the surface flat and fronto-parallel. We propose three new methods. The first two use a convex relaxation of isometry to inextensibility. They are formulated as Second Order Cone Programs (SOCP). The first proposed method is point-wise (it reconstructs only the input point correspondences) while the second proposed method uses a smooth and continuous surface model, based on Free-Form Deformations (FFD). The third proposed method uses the 'true' nonconvex isometric constraint and the same continuous surface model. It is formulated with Nonlinear Least-Squares and can thus be solved with the efficient Levenberg-Marquardt minimization method. The proposed approaches may be combined in a single pipeline whereby one of the convex approximations is used to initialize the nonconvex method. Our contributions solve two important limitations of current state of the art: our convex methods are the first ones to handle noise in both the template and image points, and our nonconvex method is the first one to use 'true' isometric constraints. Our experimental results on simulated and real data show that our convex point-wise method and our nonconvex method outperform respectively current initialization and refinement methods in 3D reconstructed surface accuracy.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02C03</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D02A05</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Image tridimensionnelle</s0>
<s5>06</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Tridimensional image</s0>
<s5>06</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Imagen tridimensional</s0>
<s5>06</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Reconstruction image</s0>
<s5>07</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Image reconstruction</s0>
<s5>07</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Reconstrucción imagen</s0>
<s5>07</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Traitement image</s0>
<s5>08</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Image processing</s0>
<s5>08</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Procesamiento imagen</s0>
<s5>08</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Vision ordinateur</s0>
<s5>09</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Computer vision</s0>
<s5>09</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Visión ordenador</s0>
<s5>09</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Reconstruction surface</s0>
<s5>10</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Surface reconstruction</s0>
<s5>10</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Reconstrucción superficie</s0>
<s5>10</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Forme libre</s0>
<s5>11</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Free form</s0>
<s5>11</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Forma libre</s0>
<s5>11</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Processeur pipeline</s0>
<s5>12</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Pipeline processor</s0>
<s5>12</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Procesador oleoducto</s0>
<s5>12</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Vision monoculaire</s0>
<s5>18</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Monocular vision</s0>
<s5>18</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Visión monocular</s0>
<s5>18</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Surface convexe</s0>
<s5>19</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Convex surface</s0>
<s5>19</s5>
</fC03>
<fC03 i1="09" i2="X" l="SPA"><s0>Superficie convexa</s0>
<s5>19</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE"><s0>Surface lisse</s0>
<s5>20</s5>
</fC03>
<fC03 i1="10" i2="X" l="ENG"><s0>Smooth surface</s0>
<s5>20</s5>
</fC03>
<fC03 i1="10" i2="X" l="SPA"><s0>Superficie lisa</s0>
<s5>20</s5>
</fC03>
<fC03 i1="11" i2="X" l="FRE"><s0>Initialisation</s0>
<s5>21</s5>
</fC03>
<fC03 i1="11" i2="X" l="ENG"><s0>Initialization</s0>
<s5>21</s5>
</fC03>
<fC03 i1="11" i2="X" l="SPA"><s0>Inicialización</s0>
<s5>21</s5>
</fC03>
<fC03 i1="12" i2="X" l="FRE"><s0>Analyse non convexe</s0>
<s5>23</s5>
</fC03>
<fC03 i1="12" i2="X" l="ENG"><s0>Non convex analysis</s0>
<s5>23</s5>
</fC03>
<fC03 i1="12" i2="X" l="SPA"><s0>Análisis no convexo</s0>
<s5>23</s5>
</fC03>
<fC03 i1="13" i2="X" l="FRE"><s0>Isométrie</s0>
<s5>24</s5>
</fC03>
<fC03 i1="13" i2="X" l="ENG"><s0>Isometry</s0>
<s5>24</s5>
</fC03>
<fC03 i1="13" i2="X" l="SPA"><s0>Isometría</s0>
<s5>24</s5>
</fC03>
<fC03 i1="14" i2="X" l="FRE"><s0>Programmation conique</s0>
<s5>25</s5>
</fC03>
<fC03 i1="14" i2="X" l="ENG"><s0>conic programming</s0>
<s5>25</s5>
</fC03>
<fC03 i1="14" i2="X" l="SPA"><s0>Programación cónica</s0>
<s5>25</s5>
</fC03>
<fC03 i1="15" i2="X" l="FRE"><s0>Modélisation</s0>
<s5>26</s5>
</fC03>
<fC03 i1="15" i2="X" l="ENG"><s0>Modeling</s0>
<s5>26</s5>
</fC03>
<fC03 i1="15" i2="X" l="SPA"><s0>Modelización</s0>
<s5>26</s5>
</fC03>
<fC03 i1="16" i2="X" l="FRE"><s0>Méthode moindre carré</s0>
<s5>27</s5>
</fC03>
<fC03 i1="16" i2="X" l="ENG"><s0>Least squares method</s0>
<s5>27</s5>
</fC03>
<fC03 i1="16" i2="X" l="SPA"><s0>Método cuadrado menor</s0>
<s5>27</s5>
</fC03>
<fC03 i1="17" i2="X" l="FRE"><s0>Algorithme de Levenberg Marquardt</s0>
<s5>28</s5>
</fC03>
<fC03 i1="17" i2="X" l="ENG"><s0>Levenberg Marquardt algorithm</s0>
<s5>28</s5>
</fC03>
<fC03 i1="17" i2="X" l="SPA"><s0>Algoritmo de Levenberg Marquardt</s0>
<s5>28</s5>
</fC03>
<fC03 i1="18" i2="X" l="FRE"><s0>Minimisation</s0>
<s5>29</s5>
</fC03>
<fC03 i1="18" i2="X" l="ENG"><s0>Minimization</s0>
<s5>29</s5>
</fC03>
<fC03 i1="18" i2="X" l="SPA"><s0>Minimización</s0>
<s5>29</s5>
</fC03>
<fC03 i1="19" i2="X" l="FRE"><s0>Résultat expérimental</s0>
<s5>30</s5>
</fC03>
<fC03 i1="19" i2="X" l="ENG"><s0>Experimental result</s0>
<s5>30</s5>
</fC03>
<fC03 i1="19" i2="X" l="SPA"><s0>Resultado experimental</s0>
<s5>30</s5>
</fC03>
<fC03 i1="20" i2="X" l="FRE"><s0>Méthode raffinement</s0>
<s5>31</s5>
</fC03>
<fC03 i1="20" i2="X" l="ENG"><s0>Refinement method</s0>
<s5>31</s5>
</fC03>
<fC03 i1="20" i2="X" l="SPA"><s0>Método afinamiento</s0>
<s5>31</s5>
</fC03>
<fN21><s1>005</s1>
</fN21>
<fN44 i1="01"><s1>OTO</s1>
</fN44>
<fN82><s1>OTO</s1>
</fN82>
</pA>
</standard>
</inist>
<affiliations><list><country><li>Australie</li>
<li>France</li>
</country>
<region><li>Auvergne (région administrative)</li>
<li>Auvergne-Rhône-Alpes</li>
<li>Midi-Pyrénées</li>
<li>Occitanie (région administrative)</li>
</region>
<settlement><li>Clermont-Ferrand</li>
<li>Toulouse</li>
</settlement>
</list>
<tree><country name="France"><region name="Occitanie (région administrative)"><name sortKey="Brunet, F" sort="Brunet, F" uniqKey="Brunet F" first="F." last="Brunet">F. Brunet</name>
</region>
<name sortKey="Bartoli, A" sort="Bartoli, A" uniqKey="Bartoli A" first="A." last="Bartoli">A. Bartoli</name>
</country>
<country name="Australie"><noRegion><name sortKey="Hartley, R I" sort="Hartley, R I" uniqKey="Hartley R" first="R. I." last="Hartley">R. I. Hartley</name>
</noRegion>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Asie/explor/AustralieFrV1/Data/PascalFrancis/Checkpoint

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000188 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd -nk 000188 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Asie
   |area=    AustralieFrV1
   |flux=    PascalFrancis
   |étape=   Checkpoint
   |type=    RBID
   |clé=     Pascal:15-0004489
   |texte=   Monocular template-based 3D surface reconstruction: Convex inextensible and nonconvex isometric methods
}}

This area was generated with Dilib version V0.6.33.
Data generation: Tue Dec 5 10:43:12 2017. Site generation: Tue Mar 5 14:07:20 2024

	Serveur d'exploration sur les relations entre la France et l'Australie
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur les relations entre la France et l'Australie

Monocular template-based 3D surface reconstruction: Convex inextensible and nonconvex isometric methods

Monocular template-based 3D surface reconstruction: Convex inextensible and nonconvex isometric methods

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri