InforLorV4, PascalFrancis, Corpus, bibRecord, 000880

Segmentation and length estimation of 3D discrete curves

Identifieur interne : 000880 ( PascalFrancis/Corpus ); précédent : 000879; suivant : 000881

Segmentation and length estimation of 3D discrete curves

Auteurs : David Coeurjolly ; Isabelle Debled-Rennesson ; Olivier Teytaud

Source :

Lecture notes in computer science [ 0302-9743 ] ; 2001.

RBID : Pascal:02-0240215

Descripteurs français

Pascal (Inist)
- Traitement image, Image numérique, Segmentation, Multigrille.

English descriptors

KwdEn :
- Digital image, Image processing, Multigrid, Segmentation.

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.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A01	`01`	`1`		`@0 0302-9743`
A05				`@2 2243`
A08	`01`	`1`	`ENG`	`@1 Segmentation and length estimation of 3D discrete curves`
A09	`01`	`1`	`ENG`	`@1 Digital and image geometry : advanced lectures : Schloss Dagstuhl, 18-22 December 2000`
A11	`01`	`1`		`@1 COEURJOLLY (David)`
A11	`02`	`1`		`@1 DEBLED-RENNESSON (Isabelle)`
A11	`03`	`1`		`@1 TEYTAUD (Olivier)`
A12	`01`	`1`		`@1 BERTRAND (Gilles) @9 ed.`
A12	`02`	`1`		`@1 IMIYA (Atsushi) @9 ed.`
A12	`03`	`1`		`@1 KLETTE (Reinhard) @9 ed.`
A14	`01`			`@1 Laboratoire ERIC, 5, avenue Pierre-Mendes-France @2 69676 Bron @3 FRA @Z 1 aut.`
A14	`02`			`@1 LORIA (Laboratoire LOrrain de Recherche en Informatique et ses Applications), Campus Scientifique, B.P. 239 @2 54506 Vandoeuvre-les-Nancy @3 FRA @Z 2 aut.`
A14	`03`			`@1 ISC 67 Bd Pinel @2 69675 Bron @3 FRA @Z 3 aut.`
A20				`@1 299-317`
A21				`@1 2001`
A23	`01`			`@0 ENG`
A26	`01`			`@0 3-540-43079-2`
A43	`01`			`@1 INIST @2 16343 @5 354000097080590180`
A44				`@0 0000 @1 © 2002 INIST-CNRS. All rights reserved.`
A45				`@0 31 ref.`
A47	`01`	`1`		`@0 02-0240215`
A60				`@1 P @2 C`
A61				`@0 A`
A64	`01`	`1`		`@0 Lecture notes in computer science`
A66	`01`			`@0 DEU`
C01	`01`		`ENG`	`@0 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.`
C02	`01`	`X`		`@0 001D02C03`
C03	`01`	`X`	`FRE`	`@0 Traitement image @5 01`
C03	`01`	`X`	`ENG`	`@0 Image processing @5 01`
C03	`01`	`X`	`SPA`	`@0 Procesamiento imagen @5 01`
C03	`02`	`X`	`FRE`	`@0 Image numérique @5 02`
C03	`02`	`X`	`ENG`	`@0 Digital image @5 02`
C03	`02`	`X`	`SPA`	`@0 Imagen numérica @5 02`
C03	`03`	`X`	`FRE`	`@0 Segmentation @5 03`
C03	`03`	`X`	`ENG`	`@0 Segmentation @5 03`
C03	`03`	`X`	`SPA`	`@0 Segmentación @5 03`
C03	`04`	`X`	`FRE`	`@0 Multigrille @5 04`
C03	`04`	`X`	`ENG`	`@0 Multigrid @5 04`
C03	`04`	`X`	`SPA`	`@0 Multigrilla @5 04`
N21				`@1 140`
N82				`@1 PSI`

A30	`01`	`1`	`ENG`	`@1 Digital and image geometry. Winterschool @3 Schloss Dagstuhl DEU @4 2001-12-18`

Format Inist (serveur)

NO :	PASCAL 02-0240215 INIST
ET :	Segmentation and length estimation of 3D discrete curves
AU :	COEURJOLLY (David); DEBLED-RENNESSON (Isabelle); TEYTAUD (Olivier); BERTRAND (Gilles); IMIYA (Atsushi); KLETTE (Reinhard)
AF :	Laboratoire ERIC, 5, avenue Pierre-Mendes-France/69676 Bron/France (1 aut.); LORIA (Laboratoire LOrrain de Recherche en Informatique et ses Applications), Campus Scientifique, B.P. 239/54506 Vandoeuvre-les-Nancy/France (2 aut.); ISC 67 Bd Pinel/69675 Bron/France (3 aut.)
DT :	Publication en série; Congrès; Niveau analytique
SO :	Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2001; Vol. 2243; Pp. 299-317; Bibl. 31 ref.
LA :	Anglais
EA :	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.
CC :	001D02C03
FD :	Traitement image; Image numérique; Segmentation; Multigrille
ED :	Image processing; Digital image; Segmentation; Multigrid
SD :	Procesamiento imagen; Imagen numérica; Segmentación; Multigrilla
LO :	INIST-16343.354000097080590180
ID :	02-0240215

Links to Exploration step

Pascal:02-0240215

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">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>
<affiliation><inist:fA14 i1="01"><s1>Laboratoire ERIC, 5, avenue Pierre-Mendes-France</s1>
<s2>69676 Bron</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</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><inist:fA14 i1="02"><s1>LORIA (Laboratoire LOrrain de Recherche en Informatique et ses Applications), Campus Scientifique, B.P. 239</s1>
<s2>54506 Vandoeuvre-les-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Teytaud, Olivier" sort="Teytaud, Olivier" uniqKey="Teytaud O" first="Olivier" last="Teytaud">Olivier Teytaud</name>
<affiliation><inist:fA14 i1="03"><s1>ISC 67 Bd Pinel</s1>
<s2>69675 Bron</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">02-0240215</idno>
<date when="2001">2001</date>
<idno type="stanalyst">PASCAL 02-0240215 INIST</idno>
<idno type="RBID">Pascal:02-0240215</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000880</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">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>
<affiliation><inist:fA14 i1="01"><s1>Laboratoire ERIC, 5, avenue Pierre-Mendes-France</s1>
<s2>69676 Bron</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</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><inist:fA14 i1="02"><s1>LORIA (Laboratoire LOrrain de Recherche en Informatique et ses Applications), Campus Scientifique, B.P. 239</s1>
<s2>54506 Vandoeuvre-les-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Teytaud, Olivier" sort="Teytaud, Olivier" uniqKey="Teytaud O" first="Olivier" last="Teytaud">Olivier Teytaud</name>
<affiliation><inist:fA14 i1="03"><s1>ISC 67 Bd Pinel</s1>
<s2>69675 Bron</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2001">2001</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Digital image</term>
<term>Image processing</term>
<term>Multigrid</term>
<term>Segmentation</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Traitement image</term>
<term>Image numérique</term>
<term>Segmentation</term>
<term>Multigrille</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>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>2243</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>Segmentation and length estimation of 3D discrete curves</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Digital and image geometry : advanced lectures : Schloss Dagstuhl, 18-22 December 2000</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>COEURJOLLY (David)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>DEBLED-RENNESSON (Isabelle)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>TEYTAUD (Olivier)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>BERTRAND (Gilles)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>IMIYA (Atsushi)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="03" i2="1"><s1>KLETTE (Reinhard)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>Laboratoire ERIC, 5, avenue Pierre-Mendes-France</s1>
<s2>69676 Bron</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>LORIA (Laboratoire LOrrain de Recherche en Informatique et ses Applications), Campus Scientifique, B.P. 239</s1>
<s2>54506 Vandoeuvre-les-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="03"><s1>ISC 67 Bd Pinel</s1>
<s2>69675 Bron</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</fA14>
<fA20><s1>299-317</s1>
</fA20>
<fA21><s1>2001</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-43079-2</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000097080590180</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2002 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>31 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>02-0240215</s0>
</fA47>
<fA60><s1>P</s1>
<s2>C</s2>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64>
<fA66 i1="01"><s0>DEU</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>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.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02C03</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Traitement image</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Image processing</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Procesamiento imagen</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Image numérique</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Digital image</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Imagen numérica</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Segmentation</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Segmentation</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Segmentación</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Multigrille</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Multigrid</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Multigrilla</s0>
<s5>04</s5>
</fC03>
<fN21><s1>140</s1>
</fN21>
<fN82><s1>PSI</s1>
</fN82>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>Digital and image geometry. Winterschool</s1>
<s3>Schloss Dagstuhl DEU</s3>
<s4>2001-12-18</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 02-0240215 INIST</NO>
<ET>Segmentation and length estimation of 3D discrete curves</ET>
<AU>COEURJOLLY (David); DEBLED-RENNESSON (Isabelle); TEYTAUD (Olivier); BERTRAND (Gilles); IMIYA (Atsushi); KLETTE (Reinhard)</AU>
<AF>Laboratoire ERIC, 5, avenue Pierre-Mendes-France/69676 Bron/France (1 aut.); LORIA (Laboratoire LOrrain de Recherche en Informatique et ses Applications), Campus Scientifique, B.P. 239/54506 Vandoeuvre-les-Nancy/France (2 aut.); ISC 67 Bd Pinel/69675 Bron/France (3 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2001; Vol. 2243; Pp. 299-317; Bibl. 31 ref.</SO>
<LA>Anglais</LA>
<EA>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.</EA>
<CC>001D02C03</CC>
<FD>Traitement image; Image numérique; Segmentation; Multigrille</FD>
<ED>Image processing; Digital image; Segmentation; Multigrid</ED>
<SD>Procesamiento imagen; Imagen numérica; Segmentación; Multigrilla</SD>
<LO>INIST-16343.354000097080590180</LO>
<ID>02-0240215</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus

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

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000880 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Corpus
   |type=    RBID
   |clé=     Pascal:02-0240215
   |texte=   Segmentation and length estimation of 3D discrete curves
}}

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

Segmentation and length estimation of 3D discrete curves

Segmentation and length estimation of 3D discrete curves

Source :

Descripteurs français

English descriptors

Abstract

Notice en format standard (ISO 2709)

Format Inist (serveur)

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