Segmentation and Length Estimation of 3D Discrete Curves
Identifieur interne : 005D37 ( Hal/Checkpoint ); précédent : 005D36; suivant : 005D38Segmentation and Length Estimation of 3D Discrete Curves
Auteurs : David Coeurjolly ; Isabelle Debled-Rennesson [France] ; Olivier TeytaudSource :
Descripteurs français
- mix :
Abstract
We propose in this paper an arithmetical definition of 3-D discrete lines as well as an efficient construction algorithm. From this notion, an algorithm of 3-D discrete lines segmentation has been developed. It is then used to calculate the length of a discrete curve. A proof of the multigrid convergence of length estimators is presented.
Url:
Links toward previous steps (curation, corpus...)
Links to Exploration step
Hal:inria-00100500Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Segmentation and Length Estimation of 3D Discrete Curves</title><author><name sortKey="Coeurjolly, David" sort="Coeurjolly, David" uniqKey="Coeurjolly D" first="David" last="Coeurjolly">David Coeurjolly</name></author><author><name sortKey="Debled Rennesson, Isabelle" sort="Debled Rennesson, Isabelle" uniqKey="Debled Rennesson I" first="Isabelle" last="Debled-Rennesson">Isabelle Debled-Rennesson</name><affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-2345" status="OLD"><idno type="RNSR">200221405M</idno><orgName>Applying discrete algorithms to genomics</orgName><orgName type="acronym">ADAGE</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.inria.fr/equipes/adage</ref></desc><listRelation><relation active="#struct-160" type="direct"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-300291" type="indirect"></relation><relation active="#struct-300292" type="indirect"></relation><relation active="#struct-300293" type="indirect"></relation><relation active="#struct-2496" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName><orgName type="acronym">LORIA</orgName><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 name="UMR7503" active="#struct-441569" type="direct"></relation><relation active="#struct-300009" type="direct"></relation><relation active="#struct-300291" type="direct"></relation><relation active="#struct-300292" type="direct"></relation><relation active="#struct-300293" type="direct"></relation></listRelation></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><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-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName><orgName type="acronym">UHP</orgName><date type="end">2011-12-31</date><desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName><date type="end">2011-12-31</date><desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName><orgName type="acronym">INPL</orgName><date type="end">2011-12-31</date><desc><address><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</orgName><desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation></listRelation></org></tutelle></tutelles></hal:affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Université Nancy 2</orgName><orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Institut national polytechnique de Lorraine</orgName><orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName></affiliation></author><author><name sortKey="Teytaud, Olivier" sort="Teytaud, Olivier" uniqKey="Teytaud O" first="Olivier" last="Teytaud">Olivier Teytaud</name></author></titleStmt><publicationStmt><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:inria-00100500</idno><idno type="halId">inria-00100500</idno><idno type="halUri">https://hal.inria.fr/inria-00100500</idno><idno type="url">https://hal.inria.fr/inria-00100500</idno><date when="2001">2001</date><idno type="wicri:Area/Hal/Corpus">004435</idno><idno type="wicri:Area/Hal/Curation">004435</idno><idno type="wicri:Area/Hal/Checkpoint">005D37</idno><idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">005D37</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Segmentation and Length Estimation of 3D Discrete Curves</title><author><name sortKey="Coeurjolly, David" sort="Coeurjolly, David" uniqKey="Coeurjolly D" first="David" last="Coeurjolly">David Coeurjolly</name></author><author><name sortKey="Debled Rennesson, Isabelle" sort="Debled Rennesson, Isabelle" uniqKey="Debled Rennesson I" first="Isabelle" last="Debled-Rennesson">Isabelle Debled-Rennesson</name><affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-2345" status="OLD"><idno type="RNSR">200221405M</idno><orgName>Applying discrete algorithms to genomics</orgName><orgName type="acronym">ADAGE</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.inria.fr/equipes/adage</ref></desc><listRelation><relation active="#struct-160" type="direct"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-300291" type="indirect"></relation><relation active="#struct-300292" type="indirect"></relation><relation active="#struct-300293" type="indirect"></relation><relation active="#struct-2496" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName><orgName type="acronym">LORIA</orgName><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 name="UMR7503" active="#struct-441569" type="direct"></relation><relation active="#struct-300009" type="direct"></relation><relation active="#struct-300291" type="direct"></relation><relation active="#struct-300292" type="direct"></relation><relation active="#struct-300293" type="direct"></relation></listRelation></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><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-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName><orgName type="acronym">UHP</orgName><date type="end">2011-12-31</date><desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName><date type="end">2011-12-31</date><desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName><orgName type="acronym">INPL</orgName><date type="end">2011-12-31</date><desc><address><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</orgName><desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation></listRelation></org></tutelle></tutelles></hal:affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Université Nancy 2</orgName><orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Institut national polytechnique de Lorraine</orgName><orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName></affiliation></author><author><name sortKey="Teytaud, Olivier" sort="Teytaud, Olivier" uniqKey="Teytaud O" first="Olivier" last="Teytaud">Olivier Teytaud</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="mix" xml:lang="fr"><term>3d discrete line</term><term>3droites discrètes 3d</term><term>courbe discrète</term><term>discrete curve</term><term>estimation de longueur</term><term>lengthestimation</term><term>segmentation</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">We propose in this paper an arithmetical definition of 3-D discrete lines as well as an efficient construction algorithm. From this notion, an algorithm of 3-D discrete lines segmentation has been developed. It is then used to calculate the length of a discrete curve. A proof of the multigrid convergence of length estimators is presented.</div></front></TEI><hal api="V3"><titleStmt><title xml:lang="en">Segmentation and Length Estimation of 3D Discrete Curves</title><author role="aut"><persName><forename type="first">David</forename><surname>Coeurjolly</surname></persName><email></email><idno type="idhal">david-coeurjolly</idno><idno type="halauthor">131774</idno><orgName ref="#struct-365103"></orgName></author><author role="aut"><persName><forename type="first">Isabelle</forename><surname>Debled-Rennesson</surname></persName><email></email><idno type="halauthor">130271</idno><orgName ref="#struct-364639"></orgName><affiliation ref="#struct-2345"></affiliation></author><author role="aut"><persName><forename type="first">Olivier</forename><surname>Teytaud</surname></persName><email></email><idno type="halauthor">131775</idno><orgName ref="#struct-365103"></orgName></author><editor role="depositor"><persName><forename>Publications</forename><surname>Loria</surname></persName><email>publications@loria.fr</email></editor></titleStmt><editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2006-09-26 14:46:18</date><date type="whenModified">2016-05-19 01:09:07</date><date type="whenReleased">2006-09-28 15:22:47</date><date type="whenProduced">2001</date></edition><respStmt><resp>contributor</resp><name key="108626"><persName><forename>Publications</forename><surname>Loria</surname></persName><email>publications@loria.fr</email></name></respStmt></editionStmt><publicationStmt><distributor>CCSD</distributor><idno type="halId">inria-00100500</idno><idno type="halUri">https://hal.inria.fr/inria-00100500</idno><idno type="halBibtex">coeurjolly:inria-00100500</idno><idno type="halRefHtml">G. Bertrand, A. Imiya and R. Klette. Digital and Image Geometry, 2001, Schloss Dagstuhl, Germany, Springer, 2243, pp.299-317, 2001, Lecture notes in Computer Science</idno><idno type="halRef">G. Bertrand, A. Imiya and R. Klette. Digital and Image Geometry, 2001, Schloss Dagstuhl, Germany, Springer, 2243, pp.299-317, 2001, Lecture notes in Computer Science</idno></publicationStmt><seriesStmt><idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno><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="LORIA2">Publications du LORIA</idno><idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno><idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno><idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno><idno type="stamp" n="INRIA-LORRAINE">INRIA Nancy - Grand Est</idno><idno type="stamp" n="LABO-LORIA-SET" p="LORIA">LABO-LORIA-SET</idno></seriesStmt><notesStmt><note type="commentary">Colloque avec actes et comité de lecture. internationale.</note><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">Segmentation and Length Estimation of 3D Discrete Curves</title><author role="aut"><persName><forename type="first">David</forename><surname>Coeurjolly</surname></persName><idno type="idHal">david-coeurjolly</idno><idno type="halAuthorId">131774</idno><orgName ref="#struct-365103"></orgName></author><author role="aut"><persName><forename type="first">Isabelle</forename><surname>Debled-Rennesson</surname></persName><idno type="halAuthorId">130271</idno><orgName ref="#struct-364639"></orgName><affiliation ref="#struct-2345"></affiliation></author><author role="aut"><persName><forename type="first">Olivier</forename><surname>Teytaud</surname></persName><idno type="halAuthorId">131775</idno><orgName ref="#struct-365103"></orgName></author></analytic><monogr><idno type="localRef">A01-R-155 || coeurjolly01a</idno><meeting><title>Digital and Image Geometry</title><date type="start">2001</date><settlement>Schloss Dagstuhl, Germany</settlement></meeting><editor>G. Bertrand, A. Imiya and R. Klette</editor><imprint><publisher>Springer</publisher><biblScope unit="serie">Lecture notes in Computer Science</biblScope><biblScope unit="volume">2243</biblScope><biblScope unit="pp">299-317</biblScope><date type="datePub">2001</date></imprint></monogr></biblStruct></sourceDesc><profileDesc><langUsage><language ident="en">English</language></langUsage><textClass><keywords scheme="author"><term xml:lang="fr">3droites discrètes 3d</term><term xml:lang="fr">discrete curve</term><term xml:lang="fr">3d discrete line</term><term xml:lang="fr">segmentation</term><term xml:lang="fr">lengthestimation</term><term xml:lang="fr">estimation de longueur</term><term xml:lang="fr">courbe discrète</term></keywords><classCode scheme="halDomain" n="info.info-oh">Computer Science [cs]/Other [cs.OH]</classCode><classCode scheme="halTypology" n="COMM">Conference papers</classCode></textClass><abstract xml:lang="en">We propose in this paper an arithmetical definition of 3-D discrete lines as well as an efficient construction algorithm. From this notion, an algorithm of 3-D discrete lines segmentation has been developed. It is then used to calculate the length of a discrete curve. A proof of the multigrid convergence of length estimators is presented.</abstract></profileDesc></hal></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 005D37 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Hal/Checkpoint/biblio.hfd -nk 005D37 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Hal
|étape= Checkpoint
|type= RBID
|clé= Hal:inria-00100500
|texte= Segmentation and Length Estimation of 3D Discrete Curves
}}
| This area was generated with Dilib version V0.6.33. |  |