InforLorV4, Hal, Curation, bibRecord, 001E80

Efficient Neighbourhood Computing for Discrete Rigid Transformation Graph Search

Identifieur interne : 001E80 ( Hal/Curation ); précédent : 001E79; suivant : 001E81

Efficient Neighbourhood Computing for Discrete Rigid Transformation Graph Search

Auteurs : Yukiko Kenmochi [France] ; Phuc Ngo [France] ; Hugues Talbot [France] ; Nicolas Passat [France]

Source :

RBID : Hal:hal-01067537

Abstract

Rigid transformations are involved in a wide variety of image processing applications, including image registration. In this context, we recently proposed to deal with the associated optimization problem from a purely discrete point of view, using the notion of discrete rigid transformation (DRT) graph. In particular, a local search scheme within the DRT graph to compute a locally optimal solution without any numerical approximation was formerly proposed. In this article, we extend this study, with the purpose to reduce the algorithmic complexity of the proposed optimization scheme. To this end, we propose a novel algorithmic framework for just-in-time computation of sub-graphs of interest within the DRT graph. Experimental results illustrate the potential usefulness of our approach for image registration.

Url:

https://hal-upec-upem.archives-ouvertes.fr/hal-01067537

DOI: 10.1007/978-3-319-09955-2_9

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

to stream Hal, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001E80

Links to Exploration step

Hal:hal-01067537

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Efficient Neighbourhood Computing for Discrete Rigid Transformation Graph Search</title>
<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="Ngo, Phuc" sort="Ngo, Phuc" uniqKey="Ngo P" first="Phuc" last="Ngo">Phuc Ngo</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-206036" status="VALID"><orgName>Applying Discrete Algorithms to Genomics and Imagery</orgName>
<orgName type="acronym">ADAGIO</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche/equipes/adagio</ref>
</desc>
<listRelation><relation active="#struct-423083" type="direct"></relation>
<relation active="#struct-206040" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-423083" type="direct"><org type="department" xml:id="struct-423083" status="VALID"><orgName>Department of Algorithms, Computation, Image and Geometry</orgName>
<orgName type="acronym">LORIA - ALGO</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche-en/departements/algorithmics</ref>
</desc>
<listRelation><relation active="#struct-206040" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-206040" type="indirect"><org 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>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><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="indirect"><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="indirect"><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="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-01067537</idno>
<idno type="halId">hal-01067537</idno>
<idno type="halUri">https://hal-upec-upem.archives-ouvertes.fr/hal-01067537</idno>
<idno type="url">https://hal-upec-upem.archives-ouvertes.fr/hal-01067537</idno>
<idno type="doi">10.1007/978-3-319-09955-2_9</idno>
<date when="2014-09-10">2014-09-10</date>
<idno type="wicri:Area/Hal/Corpus">001E80</idno>
<idno type="wicri:Area/Hal/Curation">001E80</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Efficient Neighbourhood Computing for Discrete Rigid Transformation Graph Search</title>
<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="Ngo, Phuc" sort="Ngo, Phuc" uniqKey="Ngo P" first="Phuc" last="Ngo">Phuc Ngo</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-206036" status="VALID"><orgName>Applying Discrete Algorithms to Genomics and Imagery</orgName>
<orgName type="acronym">ADAGIO</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche/equipes/adagio</ref>
</desc>
<listRelation><relation active="#struct-423083" type="direct"></relation>
<relation active="#struct-206040" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-423083" type="direct"><org type="department" xml:id="struct-423083" status="VALID"><orgName>Department of Algorithms, Computation, Image and Geometry</orgName>
<orgName type="acronym">LORIA - ALGO</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche-en/departements/algorithmics</ref>
</desc>
<listRelation><relation active="#struct-206040" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-206040" type="indirect"><org 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>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><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="indirect"><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="indirect"><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="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>
<idno type="DOI">10.1007/978-3-319-09955-2_9</idno>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Rigid transformations are involved in a wide variety of image processing applications, including image registration. In this context, we recently proposed to deal with the associated optimization problem from a purely discrete point of view, using the notion of discrete rigid transformation (DRT) graph. In particular, a local search scheme within the DRT graph to compute a locally optimal solution without any numerical approximation was formerly proposed. In this article, we extend this study, with the purpose to reduce the algorithmic complexity of the proposed optimization scheme. To this end, we propose a novel algorithmic framework for just-in-time computation of sub-graphs of interest within the DRT graph. Experimental results illustrate the potential usefulness of our approach for image registration.</div>
</front>
</TEI>
<hal api="V3"><titleStmt><title xml:lang="en">Efficient Neighbourhood Computing for Discrete Rigid Transformation Graph Search</title>
<author role="aut"><persName><forename type="first">Yukiko</forename>
<surname>Kenmochi</surname>
</persName>
<email>yukiko.kenmochi@esiee.fr</email>
<idno type="halauthor">1015221</idno>
<affiliation ref="#struct-3210"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Phuc</forename>
<surname>Ngo</surname>
</persName>
<email>ngo.diemphuc@gmail.com</email>
<idno type="halauthor">661420</idno>
<affiliation ref="#struct-206036"></affiliation>
<affiliation ref="#struct-242400"></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>nicolas.passat@univ-reims.fr</email>
<idno type="halauthor">808352</idno>
<affiliation ref="#struct-89542"></affiliation>
</author>
<editor role="depositor"><persName><forename>Yukiko</forename>
<surname>Kenmochi</surname>
</persName>
<email>y.kenmochi@esiee.fr</email>
</editor>
</titleStmt>
<editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2014-09-23 16:10:39</date>
<date type="whenModified">2016-01-28 01:10:52</date>
<date type="whenReleased">2014-09-23 16:25:39</date>
<date type="whenProduced">2014-09-10</date>
<date type="whenEndEmbargoed">2014-09-23</date>
<ref type="file" target="https://hal-upec-upem.archives-ouvertes.fr/hal-01067537/document"><date notBefore="2014-09-23"></date>
</ref>
<ref type="file" subtype="author" n="1" target="https://hal-upec-upem.archives-ouvertes.fr/hal-01067537/file/Kenmochi14Efficient.pdf"><date notBefore="2014-09-23"></date>
</ref>
</edition>
<respStmt><resp>contributor</resp>
<name key="171784"><persName><forename>Yukiko</forename>
<surname>Kenmochi</surname>
</persName>
<email>y.kenmochi@esiee.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt><distributor>CCSD</distributor>
<idno type="halId">hal-01067537</idno>
<idno type="halUri">https://hal-upec-upem.archives-ouvertes.fr/hal-01067537</idno>
<idno type="halBibtex">kenmochi:hal-01067537</idno>
<idno type="halRefHtml">18th IAPR International Conference on Discrete Geometry for Computer Imagery, DGCI 2014, Sep 2014, Sienne, Italy. Springer, 8668, pp.99-110, 2014, Lecture Notes in Computer Science. <10.1007/978-3-319-09955-2_9></idno>
<idno type="halRef">18th IAPR International Conference on Discrete Geometry for Computer Imagery, DGCI 2014, Sep 2014, Sienne, Italy. Springer, 8668, pp.99-110, 2014, Lecture Notes in Computer Science. <10.1007/978-3-319-09955-2_9></idno>
</publicationStmt>
<seriesStmt><idno type="stamp" n="CEA">CEA - Commissariat à l'énergie atomique</idno>
<idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="CV_LIGM" p="CV_UNIV-MLV">CV des membres du LIGM</idno>
<idno type="stamp" n="CV_UNIV-MLV">CV des membres de l'Université de Marne-la-vallée</idno>
<idno type="stamp" n="LIGM" p="CV_LIGM">Laboratoire d'informatique Gaspard-Monge</idno>
<idno type="stamp" n="ENPC-LIGM" p="UNIV-MLV">Laboratoire d'informatique Gaspard-Monge</idno>
<idno type="stamp" n="PARISTECH">ParisTech</idno>
<idno type="stamp" n="LIGM_A3SI" p="LIGM">Algorithms, architectures, image analysis and computer graphics</idno>
<idno type="stamp" n="ENPC" p="PARISTECH">Ecole des Ponts ParisTech</idno>
<idno type="stamp" n="UPEC-UPEM">UPEC-UPEM</idno>
<idno type="stamp" n="UNIV-MLV" p="UPEC-UPEM">Université de Marne la Vallée</idno>
<idno type="stamp" n="LORIA-ACGI" p="LORIA">Algorithmique, calcul, image et géométrie</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
<idno type="stamp" n="LORIA-ALGO-TEST5">LORIA-ALGO-TEST5  </idno>
<idno type="stamp" n="LORIA2">Publications du LORIA</idno>
<idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
</seriesStmt>
<notesStmt><note type="audience" n="2">International</note>
<note type="invited" n="0">No</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
<note type="proceedings" n="1">Yes</note>
</notesStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Efficient Neighbourhood Computing for Discrete Rigid Transformation Graph Search</title>
<author role="aut"><persName><forename type="first">Yukiko</forename>
<surname>Kenmochi</surname>
</persName>
<email>yukiko.kenmochi@esiee.fr</email>
<idno type="halAuthorId">1015221</idno>
<affiliation ref="#struct-3210"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Phuc</forename>
<surname>Ngo</surname>
</persName>
<email>ngo.diemphuc@gmail.com</email>
<idno type="halAuthorId">661420</idno>
<affiliation ref="#struct-206036"></affiliation>
<affiliation ref="#struct-242400"></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>
<email>nicolas.passat@univ-reims.fr</email>
<idno type="halAuthorId">808352</idno>
<affiliation ref="#struct-89542"></affiliation>
</author>
</analytic>
<monogr><meeting><title>18th IAPR International Conference on Discrete Geometry for Computer Imagery, DGCI 2014</title>
<date type="start">2014-09-10</date>
<date type="end">2014-09-12</date>
<settlement>Sienne</settlement>
<country key="IT">Italy</country>
</meeting>
<imprint><publisher>Springer</publisher>
<biblScope unit="serie">Lecture Notes in Computer Science</biblScope>
<biblScope unit="volume">8668</biblScope>
<biblScope unit="pp">99-110</biblScope>
<date type="datePub">2014-09</date>
</imprint>
</monogr>
<idno type="doi">10.1007/978-3-319-09955-2_9</idno>
</biblStruct>
</sourceDesc>
<profileDesc><langUsage><language ident="en">English</language>
</langUsage>
<textClass><classCode scheme="halDomain" n="info.info-dm">Computer Science [cs]/Discrete Mathematics [cs.DM]</classCode>
<classCode scheme="halDomain" n="info.info-cg">Computer Science [cs]/Computational Geometry [cs.CG]</classCode>
<classCode scheme="halDomain" n="info.info-ti">Computer Science [cs]/Image Processing</classCode>
<classCode scheme="halTypology" n="COMM">Conference papers</classCode>
</textClass>
<abstract xml:lang="en">Rigid transformations are involved in a wide variety of image processing applications, including image registration. In this context, we recently proposed to deal with the associated optimization problem from a purely discrete point of view, using the notion of discrete rigid transformation (DRT) graph. In particular, a local search scheme within the DRT graph to compute a locally optimal solution without any numerical approximation was formerly proposed. In this article, we extend this study, with the purpose to reduce the algorithmic complexity of the proposed optimization scheme. To this end, we propose a novel algorithmic framework for just-in-time computation of sub-graphs of interest within the DRT graph. Experimental results illustrate the potential usefulness of our approach for image registration.</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 001E80 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Hal/Curation/biblio.hfd -nk 001E80 | 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-01067537
   |texte=   Efficient Neighbourhood Computing for Discrete Rigid Transformation Graph Search
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	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 la recherche en informatique en Lorraine

Efficient Neighbourhood Computing for Discrete Rigid Transformation Graph Search

Efficient Neighbourhood Computing for Discrete Rigid Transformation Graph Search

Source :

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