InforLorV4, PascalFrancis, Corpus, bibRecord, 000786

RANVEC and the Arc Segmentation Contest

Identifieur interne : 000786 ( PascalFrancis/Corpus ); précédent : 000785; suivant : 000787

RANVEC and the Arc Segmentation Contest

Auteurs : Xavier Hilaire

Source :

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

RBID : Pascal:03-0333770

Descripteurs français

Pascal (Inist)
- Vectorisation, Segmentation arc, Algorithme extraction arc, RANVEC method.

English descriptors

KwdEn :
- Vectorization.

Abstract

This paper briefly describes an experimental arc extraction algorithm that ran the Arc Segmentation Contest at GREC'2001. As the proposed method is based on the one detailed in [5], this paper only describes the improvments we brought to the original method. We first review some rules from the evaluation protocol that helped us to make major assumptions while designing the algorithm. We then explain the method, and discuss the results we obtained in various cases. Finally, we give some conclusions and introduce a possible extension to this method.

Notice en format standard (ISO 2709)

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

A01	`01`	`1`		`@0 0302-9743`
A05				`@2 2390`
A08	`01`	`1`	`ENG`	`@1 RANVEC and the Arc Segmentation Contest`
A09	`01`	`1`	`ENG`	`@1 GREC 2001 : graphics recognition, algorithms and applications : Kingston ON, 7-8 September 2001, selected papers`
A11	`01`	`1`		`@1 HILAIRE (Xavier)`
A12	`01`	`1`		`@1 BLOSTEIN (Dorothea) @9 ed.`
A12	`02`	`1`		`@1 YOUNG-BIN KWON @9 ed.`
A14	`01`			`@1 LORIA, B.P. 239 @2 54506 Vandoeuvre-lès-Nancy @3 FRA @Z 1 aut.`
A14	`02`			`@1 FS2i, 8 impasse de Toulouse @2 78000 Versailles @3 FRA @Z 1 aut.`
A20				`@1 359-364`
A21				`@1 2002`
A23	`01`			`@0 ENG`
A26	`01`			`@0 3-540-44066-6`
A43	`01`			`@1 INIST @2 16343 @5 354000108481260320`
A44				`@0 0000 @1 © 2003 INIST-CNRS. All rights reserved.`
A45				`@0 5 ref.`
A47	`01`	`1`		`@0 03-0333770`
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 This paper briefly describes an experimental arc extraction algorithm that ran the Arc Segmentation Contest at GREC'2001. As the proposed method is based on the one detailed in [5], this paper only describes the improvments we brought to the original method. We first review some rules from the evaluation protocol that helped us to make major assumptions while designing the algorithm. We then explain the method, and discuss the results we obtained in various cases. Finally, we give some conclusions and introduce a possible extension to this method.
C02	`01`	`X`		`@0 001D02C03`
C03	`01`	`X`	`FRE`	`@0 Vectorisation @5 01`
C03	`01`	`X`	`ENG`	`@0 Vectorization @5 01`
C03	`01`	`X`	`SPA`	`@0 Vectorisación @5 01`
C03	`02`	`X`	`FRE`	`@0 Segmentation arc @4 INC @5 82`
C03	`03`	`X`	`FRE`	`@0 Algorithme extraction arc @4 INC @5 83`
C03	`04`	`X`	`FRE`	`@0 RANVEC method @4 INC @5 84`
N21				`@1 230`
N82				`@1 PSI`

A30	`01`	`1`	`ENG`	`@1 IAPR international workshop on graphics recognition @2 4 @3 Kingston On CAN @4 2001-09-07`

Format Inist (serveur)

NO :	PASCAL 03-0333770 INIST
ET :	RANVEC and the Arc Segmentation Contest
AU :	HILAIRE (Xavier); BLOSTEIN (Dorothea); YOUNG-BIN KWON
AF :	LORIA, B.P. 239/54506 Vandoeuvre-lès-Nancy/France (1 aut.); FS2i, 8 impasse de Toulouse/78000 Versailles/France (1 aut.)
DT :	Publication en série; Congrès; Niveau analytique
SO :	Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2002; Vol. 2390; Pp. 359-364; Bibl. 5 ref.
LA :	Anglais
EA :	This paper briefly describes an experimental arc extraction algorithm that ran the Arc Segmentation Contest at GREC'2001. As the proposed method is based on the one detailed in [5], this paper only describes the improvments we brought to the original method. We first review some rules from the evaluation protocol that helped us to make major assumptions while designing the algorithm. We then explain the method, and discuss the results we obtained in various cases. Finally, we give some conclusions and introduce a possible extension to this method.
CC :	001D02C03
FD :	Vectorisation; Segmentation arc; Algorithme extraction arc; RANVEC method
ED :	Vectorization
SD :	Vectorisación
LO :	INIST-16343.354000108481260320
ID :	03-0333770

Links to Exploration step

Pascal:03-0333770

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">RANVEC and the Arc Segmentation Contest</title>
<author><name sortKey="Hilaire, Xavier" sort="Hilaire, Xavier" uniqKey="Hilaire X" first="Xavier" last="Hilaire">Xavier Hilaire</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA, B.P. 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
<affiliation><inist:fA14 i1="02"><s1>FS2i, 8 impasse de Toulouse</s1>
<s2>78000 Versailles</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">03-0333770</idno>
<date when="2002">2002</date>
<idno type="stanalyst">PASCAL 03-0333770 INIST</idno>
<idno type="RBID">Pascal:03-0333770</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000786</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">RANVEC and the Arc Segmentation Contest</title>
<author><name sortKey="Hilaire, Xavier" sort="Hilaire, Xavier" uniqKey="Hilaire X" first="Xavier" last="Hilaire">Xavier Hilaire</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA, B.P. 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
<affiliation><inist:fA14 i1="02"><s1>FS2i, 8 impasse de Toulouse</s1>
<s2>78000 Versailles</s2>
<s3>FRA</s3>
<sZ>1 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="2002">2002</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>Vectorization</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Vectorisation</term>
<term>Segmentation arc</term>
<term>Algorithme extraction arc</term>
<term>RANVEC method</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">This paper briefly describes an experimental arc extraction algorithm that ran the Arc Segmentation Contest at GREC'2001. As the proposed method is based on the one detailed in [5], this paper only describes the improvments we brought to the original method. We first review some rules from the evaluation protocol that helped us to make major assumptions while designing the algorithm. We then explain the method, and discuss the results we obtained in various cases. Finally, we give some conclusions and introduce a possible extension to this method.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>2390</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>RANVEC and the Arc Segmentation Contest</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>GREC 2001 : graphics recognition, algorithms and applications : Kingston ON, 7-8 September 2001, selected papers</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>HILAIRE (Xavier)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>BLOSTEIN (Dorothea)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>YOUNG-BIN KWON</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>LORIA, B.P. 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>FS2i, 8 impasse de Toulouse</s1>
<s2>78000 Versailles</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA20><s1>359-364</s1>
</fA20>
<fA21><s1>2002</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-44066-6</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000108481260320</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2003 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>5 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>03-0333770</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>This paper briefly describes an experimental arc extraction algorithm that ran the Arc Segmentation Contest at GREC'2001. As the proposed method is based on the one detailed in [5], this paper only describes the improvments we brought to the original method. We first review some rules from the evaluation protocol that helped us to make major assumptions while designing the algorithm. We then explain the method, and discuss the results we obtained in various cases. Finally, we give some conclusions and introduce a possible extension to this method.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02C03</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Vectorisation</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Vectorization</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Vectorisación</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Segmentation arc</s0>
<s4>INC</s4>
<s5>82</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Algorithme extraction arc</s0>
<s4>INC</s4>
<s5>83</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>RANVEC method</s0>
<s4>INC</s4>
<s5>84</s5>
</fC03>
<fN21><s1>230</s1>
</fN21>
<fN82><s1>PSI</s1>
</fN82>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>IAPR international workshop on graphics recognition</s1>
<s2>4</s2>
<s3>Kingston On CAN</s3>
<s4>2001-09-07</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 03-0333770 INIST</NO>
<ET>RANVEC and the Arc Segmentation Contest</ET>
<AU>HILAIRE (Xavier); BLOSTEIN (Dorothea); YOUNG-BIN KWON</AU>
<AF>LORIA, B.P. 239/54506 Vandoeuvre-lès-Nancy/France (1 aut.); FS2i, 8 impasse de Toulouse/78000 Versailles/France (1 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2002; Vol. 2390; Pp. 359-364; Bibl. 5 ref.</SO>
<LA>Anglais</LA>
<EA>This paper briefly describes an experimental arc extraction algorithm that ran the Arc Segmentation Contest at GREC'2001. As the proposed method is based on the one detailed in [5], this paper only describes the improvments we brought to the original method. We first review some rules from the evaluation protocol that helped us to make major assumptions while designing the algorithm. We then explain the method, and discuss the results we obtained in various cases. Finally, we give some conclusions and introduce a possible extension to this method.</EA>
<CC>001D02C03</CC>
<FD>Vectorisation; Segmentation arc; Algorithme extraction arc; RANVEC method</FD>
<ED>Vectorization</ED>
<SD>Vectorisación</SD>
<LO>INIST-16343.354000108481260320</LO>
<ID>03-0333770</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 000786 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000786 | 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:03-0333770
   |texte=   RANVEC and the Arc Segmentation Contest
}}

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

RANVEC and the Arc Segmentation Contest

RANVEC and the Arc Segmentation Contest

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