Discrete rigid registration: A local graph-search approach
Identifieur interne : 001C88 ( Hal/Curation ); précédent : 001C87; suivant : 001C89Discrete rigid registration: A local graph-search approach
Auteurs : Phuc Ngo [France] ; Yukiko Kenmochi [France] ; Akihiro Sugimoto [Japon] ; Hugues Talbot [France] ; Nicolas Passat [France]Source :
- Discrete Applied Mathematics [ 0166-218X ] ; 2016-04-24.
English descriptors
- mix :
Abstract
Image registration has become a crucial step in a wide range of imaging domains, from computer vision to computer graphics. The core of image registration consists of determining the transformation that induces the best mapping between two images. This problem is ill-posed; it is also difficult to handle, due to the high size of the images and the high dimension of the transformation parameter spaces. Computing an actually optimal solution is practically impossible when transformations are assumed continuous (i.e., defined on R n). In this article, we initiate the exploration of a new way of considering image registration. Since digital images are basically defined in a discrete framework (i.e., in Z n), the transformation spaces – despite a potentially high complexity – actually remain finite, allowing for the development of explicit exploration of the parameter space via discrete optimization schemes. We propose an analysis of the very basis of registration, by considering rigid registration between 2D images. We show, in particular, how this problem can be handled in a fully discrete fashion, by computing locally the combinatorial structure of the parameter space of discrete rigid transformations, and by navigating on-the-flight within this space via gradient descent paradigms. This registration framework is applied in real imaging cases, emphasising the relevance of our approach, and the potential usefulness of its further extension to higher dimension images and richer transformations. ✩ The research leading to these results has received funding from the French Agence Nationale de la Recherche (Grant Agreement ANR-2010-BLAN-0205) and the Programme d'Investissements d'Avenir (LabEx Bézout ,
Url:
Links toward previous steps (curation, corpus...)
- to stream Hal, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001C88
Links to Exploration step
Hal:hal-01306035Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Discrete rigid registration: A local graph-search approach</title>
<author><name sortKey="Ngo, Phuc" sort="Ngo, Phuc" uniqKey="Ngo P" first="Phuc" last="Ngo">Phuc Ngo</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno>
<idno type="RNSR">198912571S</idno>
<idno type="IdUnivLorraine">[UL]RSI--</idno>
<orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-413289" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-300009" type="direct"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-413289" type="direct"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="direct"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<settlement type="city">Metz</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université de Lorraine</orgName>
</affiliation>
</author>
<author><name sortKey="Kenmochi, Yukiko" sort="Kenmochi, Yukiko" uniqKey="Kenmochi Y" first="Yukiko" last="Kenmochi">Yukiko Kenmochi</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-3210" status="VALID"><idno type="RNSR">200212717U</idno>
<orgName>Laboratoire d'Informatique Gaspard-Monge</orgName>
<orgName type="acronym">LIGM</orgName>
<desc><address><addrLine>Université de Paris-Est - Marne-la-Vallée, Cité Descartes, Bâtiment Copernic, 5 bd Descartes, 77454 Marne-la-Vallée Cedex 2, Inst Gaspard Monge</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://ligm.u-pem.fr</ref>
</desc>
<listRelation><relation active="#struct-301243" type="direct"></relation>
<relation active="#struct-301545" type="direct"></relation>
<relation active="#struct-302085" type="direct"></relation>
<relation active="#struct-304949" type="direct"></relation>
<relation name="UMR8049" active="#struct-441569" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-301243" type="direct"><org type="institution" xml:id="struct-301243" status="VALID"><orgName>Université Paris-Est Marne-la-Vallée</orgName>
<orgName type="acronym">UPEM</orgName>
<desc><address><addrLine>5 boulevard Descartes - Champs-sur-Marne - 77454 Marne-la-Vallée Cedex2 </addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.u-pem.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-301545" type="direct"><org type="institution" xml:id="struct-301545" status="OLD"><orgName>École des Ponts ParisTech (ENPC)</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-302085" type="direct"><org type="institution" xml:id="struct-302085" status="VALID"><orgName>Fédération de Recherche Bézout</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-304949" type="direct"><org type="institution" xml:id="struct-304949" status="INCOMING"><orgName>ESIEE</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle name="UMR8049" active="#struct-441569" type="direct"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Sugimoto, Akihiro" sort="Sugimoto, Akihiro" uniqKey="Sugimoto A" first="Akihiro" last="Sugimoto">Akihiro Sugimoto</name>
<affiliation wicri:level="1"><hal:affiliation type="institution" xml:id="struct-6501" status="VALID"><orgName>National Institute of Informatics [Tokyo]</orgName>
<orgName type="acronym">NII</orgName>
<desc><address><addrLine>2-1-2 Chiyoda-ku Tokyo 101-8430 Japon</addrLine>
<country key="JP"></country>
</address>
<ref type="url">http://www.nii.ac.jp/en/</ref>
</desc>
</hal:affiliation>
<country>Japon</country>
</affiliation>
</author>
<author><name sortKey="Talbot, Hugues" sort="Talbot, Hugues" uniqKey="Talbot H" first="Hugues" last="Talbot">Hugues Talbot</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-3210" status="VALID"><idno type="RNSR">200212717U</idno>
<orgName>Laboratoire d'Informatique Gaspard-Monge</orgName>
<orgName type="acronym">LIGM</orgName>
<desc><address><addrLine>Université de Paris-Est - Marne-la-Vallée, Cité Descartes, Bâtiment Copernic, 5 bd Descartes, 77454 Marne-la-Vallée Cedex 2, Inst Gaspard Monge</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://ligm.u-pem.fr</ref>
</desc>
<listRelation><relation active="#struct-301243" type="direct"></relation>
<relation active="#struct-301545" type="direct"></relation>
<relation active="#struct-302085" type="direct"></relation>
<relation active="#struct-304949" type="direct"></relation>
<relation name="UMR8049" active="#struct-441569" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-301243" type="direct"><org type="institution" xml:id="struct-301243" status="VALID"><orgName>Université Paris-Est Marne-la-Vallée</orgName>
<orgName type="acronym">UPEM</orgName>
<desc><address><addrLine>5 boulevard Descartes - Champs-sur-Marne - 77454 Marne-la-Vallée Cedex2 </addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.u-pem.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-301545" type="direct"><org type="institution" xml:id="struct-301545" status="OLD"><orgName>École des Ponts ParisTech (ENPC)</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-302085" type="direct"><org type="institution" xml:id="struct-302085" status="VALID"><orgName>Fédération de Recherche Bézout</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-304949" type="direct"><org type="institution" xml:id="struct-304949" status="INCOMING"><orgName>ESIEE</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle name="UMR8049" active="#struct-441569" type="direct"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Passat, Nicolas" sort="Passat, Nicolas" uniqKey="Passat N" first="Nicolas" last="Passat">Nicolas Passat</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-89542" status="VALID"><orgName>Institut Universitaire de Technologie CRESTIC - EA 3804 - Université de Reims-Champagne-Ardenne</orgName>
<desc><address><addrLine>9 rue de Québec 10000 TROYES</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.iut-troyes.univ-reims.fr/pole-recherche/crestic-images.html#pole-recherche</ref>
</desc>
<listRelation><relation active="#struct-7569" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-7569" type="direct"><org type="institution" xml:id="struct-7569" status="VALID"><orgName>Université de Reims Champagne-Ardenne</orgName>
<orgName type="acronym">URCA</orgName>
<desc><address><addrLine>9 boulevard Paix - 51097 Reims cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-reims.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Reims</settlement>
<region type="region" nuts="2">Champagne-Ardenne</region>
</placeName>
<orgName type="university">Université de Reims Champagne-Ardenne</orgName>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:hal-01306035</idno>
<idno type="halId">hal-01306035</idno>
<idno type="halUri">https://hal.inria.fr/hal-01306035</idno>
<idno type="url">https://hal.inria.fr/hal-01306035</idno>
<date when="2016-04-24">2016-04-24</date>
<idno type="wicri:Area/Hal/Corpus">001C88</idno>
<idno type="wicri:Area/Hal/Curation">001C88</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Discrete rigid registration: A local graph-search approach</title>
<author><name sortKey="Ngo, Phuc" sort="Ngo, Phuc" uniqKey="Ngo P" first="Phuc" last="Ngo">Phuc Ngo</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno>
<idno type="RNSR">198912571S</idno>
<idno type="IdUnivLorraine">[UL]RSI--</idno>
<orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-413289" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-300009" type="direct"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-413289" type="direct"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="direct"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<settlement type="city">Metz</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université de Lorraine</orgName>
</affiliation>
</author>
<author><name sortKey="Kenmochi, Yukiko" sort="Kenmochi, Yukiko" uniqKey="Kenmochi Y" first="Yukiko" last="Kenmochi">Yukiko Kenmochi</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-3210" status="VALID"><idno type="RNSR">200212717U</idno>
<orgName>Laboratoire d'Informatique Gaspard-Monge</orgName>
<orgName type="acronym">LIGM</orgName>
<desc><address><addrLine>Université de Paris-Est - Marne-la-Vallée, Cité Descartes, Bâtiment Copernic, 5 bd Descartes, 77454 Marne-la-Vallée Cedex 2, Inst Gaspard Monge</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://ligm.u-pem.fr</ref>
</desc>
<listRelation><relation active="#struct-301243" type="direct"></relation>
<relation active="#struct-301545" type="direct"></relation>
<relation active="#struct-302085" type="direct"></relation>
<relation active="#struct-304949" type="direct"></relation>
<relation name="UMR8049" active="#struct-441569" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-301243" type="direct"><org type="institution" xml:id="struct-301243" status="VALID"><orgName>Université Paris-Est Marne-la-Vallée</orgName>
<orgName type="acronym">UPEM</orgName>
<desc><address><addrLine>5 boulevard Descartes - Champs-sur-Marne - 77454 Marne-la-Vallée Cedex2 </addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.u-pem.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-301545" type="direct"><org type="institution" xml:id="struct-301545" status="OLD"><orgName>École des Ponts ParisTech (ENPC)</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-302085" type="direct"><org type="institution" xml:id="struct-302085" status="VALID"><orgName>Fédération de Recherche Bézout</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-304949" type="direct"><org type="institution" xml:id="struct-304949" status="INCOMING"><orgName>ESIEE</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle name="UMR8049" active="#struct-441569" type="direct"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Sugimoto, Akihiro" sort="Sugimoto, Akihiro" uniqKey="Sugimoto A" first="Akihiro" last="Sugimoto">Akihiro Sugimoto</name>
<affiliation wicri:level="1"><hal:affiliation type="institution" xml:id="struct-6501" status="VALID"><orgName>National Institute of Informatics [Tokyo]</orgName>
<orgName type="acronym">NII</orgName>
<desc><address><addrLine>2-1-2 Chiyoda-ku Tokyo 101-8430 Japon</addrLine>
<country key="JP"></country>
</address>
<ref type="url">http://www.nii.ac.jp/en/</ref>
</desc>
</hal:affiliation>
<country>Japon</country>
</affiliation>
</author>
<author><name sortKey="Talbot, Hugues" sort="Talbot, Hugues" uniqKey="Talbot H" first="Hugues" last="Talbot">Hugues Talbot</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-3210" status="VALID"><idno type="RNSR">200212717U</idno>
<orgName>Laboratoire d'Informatique Gaspard-Monge</orgName>
<orgName type="acronym">LIGM</orgName>
<desc><address><addrLine>Université de Paris-Est - Marne-la-Vallée, Cité Descartes, Bâtiment Copernic, 5 bd Descartes, 77454 Marne-la-Vallée Cedex 2, Inst Gaspard Monge</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://ligm.u-pem.fr</ref>
</desc>
<listRelation><relation active="#struct-301243" type="direct"></relation>
<relation active="#struct-301545" type="direct"></relation>
<relation active="#struct-302085" type="direct"></relation>
<relation active="#struct-304949" type="direct"></relation>
<relation name="UMR8049" active="#struct-441569" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-301243" type="direct"><org type="institution" xml:id="struct-301243" status="VALID"><orgName>Université Paris-Est Marne-la-Vallée</orgName>
<orgName type="acronym">UPEM</orgName>
<desc><address><addrLine>5 boulevard Descartes - Champs-sur-Marne - 77454 Marne-la-Vallée Cedex2 </addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.u-pem.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-301545" type="direct"><org type="institution" xml:id="struct-301545" status="OLD"><orgName>École des Ponts ParisTech (ENPC)</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-302085" type="direct"><org type="institution" xml:id="struct-302085" status="VALID"><orgName>Fédération de Recherche Bézout</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-304949" type="direct"><org type="institution" xml:id="struct-304949" status="INCOMING"><orgName>ESIEE</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle name="UMR8049" active="#struct-441569" type="direct"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Passat, Nicolas" sort="Passat, Nicolas" uniqKey="Passat N" first="Nicolas" last="Passat">Nicolas Passat</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-89542" status="VALID"><orgName>Institut Universitaire de Technologie CRESTIC - EA 3804 - Université de Reims-Champagne-Ardenne</orgName>
<desc><address><addrLine>9 rue de Québec 10000 TROYES</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.iut-troyes.univ-reims.fr/pole-recherche/crestic-images.html#pole-recherche</ref>
</desc>
<listRelation><relation active="#struct-7569" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-7569" type="direct"><org type="institution" xml:id="struct-7569" status="VALID"><orgName>Université de Reims Champagne-Ardenne</orgName>
<orgName type="acronym">URCA</orgName>
<desc><address><addrLine>9 boulevard Paix - 51097 Reims cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-reims.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Reims</settlement>
<region type="region" nuts="2">Champagne-Ardenne</region>
</placeName>
<orgName type="university">Université de Reims Champagne-Ardenne</orgName>
</affiliation>
</author>
</analytic>
<series><title level="j">Discrete Applied Mathematics</title>
<idno type="ISSN">0166-218X</idno>
<imprint><date type="datePub">2016-04-24</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>Image registration</term>
<term>discrete optimization</term>
<term>discrete rigid transformation</term>
<term>discrete rigid transformation graph</term>
<term>graph search</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Image registration has become a crucial step in a wide range of imaging domains, from computer vision to computer graphics. The core of image registration consists of determining the transformation that induces the best mapping between two images. This problem is ill-posed; it is also difficult to handle, due to the high size of the images and the high dimension of the transformation parameter spaces. Computing an actually optimal solution is practically impossible when transformations are assumed continuous (i.e., defined on R n). In this article, we initiate the exploration of a new way of considering image registration. Since digital images are basically defined in a discrete framework (i.e., in Z n), the transformation spaces – despite a potentially high complexity – actually remain finite, allowing for the development of explicit exploration of the parameter space via discrete optimization schemes. We propose an analysis of the very basis of registration, by considering rigid registration between 2D images. We show, in particular, how this problem can be handled in a fully discrete fashion, by computing locally the combinatorial structure of the parameter space of discrete rigid transformations, and by navigating on-the-flight within this space via gradient descent paradigms. This registration framework is applied in real imaging cases, emphasising the relevance of our approach, and the potential usefulness of its further extension to higher dimension images and richer transformations. ✩ The research leading to these results has received funding from the French Agence Nationale de la Recherche (Grant Agreement ANR-2010-BLAN-0205) and the Programme d'Investissements d'Avenir (LabEx Bézout ,</div>
</front>
</TEI>
<hal api="V3"><titleStmt><title xml:lang="en">Discrete rigid registration: A local graph-search approach</title>
<author role="aut"><persName><forename type="first">Phuc</forename>
<surname>Ngo</surname>
</persName>
<email></email>
<idno type="halauthor">1236084</idno>
<affiliation ref="#struct-206040"></affiliation>
<affiliation ref="#struct-22019"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Yukiko</forename>
<surname>Kenmochi</surname>
</persName>
<email></email>
<idno type="halauthor">772283</idno>
<affiliation ref="#struct-3210"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Akihiro</forename>
<surname>Sugimoto</surname>
</persName>
<email></email>
<idno type="halauthor">356211</idno>
<affiliation ref="#struct-6501"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Hugues</forename>
<surname>Talbot</surname>
</persName>
<email></email>
<idno type="idhal">hugues-talbot</idno>
<idno type="halauthor">450077</idno>
<affiliation ref="#struct-3210"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Nicolas</forename>
<surname>Passat</surname>
</persName>
<email></email>
<idno type="halauthor">482029</idno>
<affiliation ref="#struct-89542"></affiliation>
</author>
<editor role="depositor"><persName><forename>Phuc</forename>
<surname>Ngo</surname>
</persName>
<email>ngo.diemphuc@gmail.com</email>
</editor>
<funder ref="#projanr-8431"></funder>
<funder ref="#projanr-37848"></funder>
</titleStmt>
<editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2016-04-22 11:21:53</date>
<date type="whenModified">2016-05-18 10:01:37</date>
<date type="whenReleased">2016-04-26 11:32:48</date>
<date type="whenProduced">2016-04-24</date>
<date type="whenEndEmbargoed">2016-04-22</date>
<ref type="file" target="https://hal.inria.fr/hal-01306035/document"><date notBefore="2016-04-22"></date>
</ref>
<ref type="file" subtype="author" n="1" target="https://hal.inria.fr/hal-01306035/file/DAMarticle_final.pdf"><date notBefore="2016-04-22"></date>
</ref>
</edition>
<respStmt><resp>contributor</resp>
<name key="167086"><persName><forename>Phuc</forename>
<surname>Ngo</surname>
</persName>
<email>ngo.diemphuc@gmail.com</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt><distributor>CCSD</distributor>
<idno type="halId">hal-01306035</idno>
<idno type="halUri">https://hal.inria.fr/hal-01306035</idno>
<idno type="halBibtex">ngo:hal-01306035</idno>
<idno type="halRefHtml">Discrete Applied Mathematics, Elsevier, 2016</idno>
<idno type="halRef">Discrete Applied Mathematics, Elsevier, 2016</idno>
</publicationStmt>
<seriesStmt><idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INPL">Institut National Polytechnique de Lorraine</idno>
<idno type="stamp" n="LABO-LORIA-SET" p="LORIA">LABO-LORIA-SET</idno>
<idno type="stamp" n="LORIA-ACGI" p="LORIA">Algorithmique, calcul, image et géométrie</idno>
<idno type="stamp" n="UPEC-UPEM">UPEC-UPEM</idno>
<idno type="stamp" n="INRIA-MECSCI">Médiation Scientifique en Science du Numérique</idno>
<idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
<idno type="stamp" n="LORIA2">Publications du LORIA</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="CV_LIGM" p="CV_UNIV-MLV">CV des membres du LIGM</idno>
<idno type="stamp" n="LIGM_A3SI" p="LIGM">Algorithms, architectures, image analysis and computer graphics</idno>
<idno type="stamp" n="LIGM" p="CV_LIGM">Laboratoire d'informatique Gaspard-Monge</idno>
<idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
<idno type="stamp" n="PARISTECH">ParisTech</idno>
<idno type="stamp" n="ENPC" p="PARISTECH">Ecole des Ponts ParisTech</idno>
</seriesStmt>
<notesStmt><note type="audience" n="2">International</note>
<note type="popular" n="1">Yes</note>
<note type="peer" n="1">Yes</note>
</notesStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Discrete rigid registration: A local graph-search approach</title>
<author role="aut"><persName><forename type="first">Phuc</forename>
<surname>Ngo</surname>
</persName>
<idno type="halAuthorId">1236084</idno>
<affiliation ref="#struct-206040"></affiliation>
<affiliation ref="#struct-22019"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Yukiko</forename>
<surname>Kenmochi</surname>
</persName>
<idno type="halAuthorId">772283</idno>
<affiliation ref="#struct-3210"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Akihiro</forename>
<surname>Sugimoto</surname>
</persName>
<idno type="halAuthorId">356211</idno>
<affiliation ref="#struct-6501"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Hugues</forename>
<surname>Talbot</surname>
</persName>
<idno type="idHal">hugues-talbot</idno>
<idno type="halAuthorId">450077</idno>
<affiliation ref="#struct-3210"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Nicolas</forename>
<surname>Passat</surname>
</persName>
<idno type="halAuthorId">482029</idno>
<affiliation ref="#struct-89542"></affiliation>
</author>
</analytic>
<monogr><idno type="halJournalId" status="VALID">12621</idno>
<idno type="issn">0166-218X</idno>
<title level="j">Discrete Applied Mathematics</title>
<imprint><publisher>Elsevier</publisher>
<date type="datePub">2016-04-24</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc><langUsage><language ident="en">English</language>
</langUsage>
<textClass><keywords scheme="author"><term xml:lang="en">Image registration</term>
<term xml:lang="en">discrete rigid transformation</term>
<term xml:lang="en">discrete optimization</term>
<term xml:lang="en">discrete rigid transformation graph</term>
<term xml:lang="en">graph search</term>
</keywords>
<classCode scheme="halDomain" n="scco.comp">Cognitive science/Computer science</classCode>
<classCode scheme="halDomain" n="info.info-cg">Computer Science [cs]/Computational Geometry [cs.CG]</classCode>
<classCode scheme="halDomain" n="info.info-dm">Computer Science [cs]/Discrete Mathematics [cs.DM]</classCode>
<classCode scheme="halTypology" n="ART">Journal articles</classCode>
</textClass>
<abstract xml:lang="en">Image registration has become a crucial step in a wide range of imaging domains, from computer vision to computer graphics. The core of image registration consists of determining the transformation that induces the best mapping between two images. This problem is ill-posed; it is also difficult to handle, due to the high size of the images and the high dimension of the transformation parameter spaces. Computing an actually optimal solution is practically impossible when transformations are assumed continuous (i.e., defined on R n). In this article, we initiate the exploration of a new way of considering image registration. Since digital images are basically defined in a discrete framework (i.e., in Z n), the transformation spaces – despite a potentially high complexity – actually remain finite, allowing for the development of explicit exploration of the parameter space via discrete optimization schemes. We propose an analysis of the very basis of registration, by considering rigid registration between 2D images. We show, in particular, how this problem can be handled in a fully discrete fashion, by computing locally the combinatorial structure of the parameter space of discrete rigid transformations, and by navigating on-the-flight within this space via gradient descent paradigms. This registration framework is applied in real imaging cases, emphasising the relevance of our approach, and the potential usefulness of its further extension to higher dimension images and richer transformations. ✩ The research leading to these results has received funding from the French Agence Nationale de la Recherche (Grant Agreement ANR-2010-BLAN-0205) and the Programme d'Investissements d'Avenir (LabEx Bézout ,</abstract>
</profileDesc>
</hal>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001C88 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Hal/Curation/biblio.hfd -nk 001C88 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Hal |étape= Curation |type= RBID |clé= Hal:hal-01306035 |texte= Discrete rigid registration: A local graph-search approach }}
This area was generated with Dilib version V0.6.33. |