InforLorV4, PascalFrancis, Corpus, bibRecord, 000266

3D noisy discrete objects: Segmentation and application to smoothing

Identifieur interne : 000266 ( PascalFrancis/Corpus ); précédent : 000265; suivant : 000267

3D noisy discrete objects: Segmentation and application to smoothing

Auteurs : L. Provot ; I. Debled-Rennesson

Source :

Pattern recognition [ 0031-3203 ] ; 2009.

RBID : Pascal:09-0284122

Descripteurs français

Pascal (Inist)
- Volume, Détection contour, Segmentation, Algorithme, Détection forme.

English descriptors

KwdEn :
- Algorithm, Edge detection, Segmentation, Shape detection, Volume.

Abstract

We propose in this paper a segmentation process that can deal with noisy discrete objects. A flexible approach considering arithmetic discrete planes with a variable width is used to avoid the over-segmentation that might happen when classical segmentation algorithms based on regular discrete planes are used to decompose the surface of the object. A method to choose a seed and different segmentation strategies according to the shape of the surface is also proposed, as well as an application to smooth the border of convex noisy discrete objects.

Notice en format standard (ISO 2709)

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

A01	`01`	`1`		`@0 0031-3203`
A02	`01`			`@0 PTNRA8`
A03		`1`		`@0 Pattern recogn.`
A05				`@2 42`
A06				`@2 8`
A08	`01`	`1`	`ENG`	`@1 3D noisy discrete objects: Segmentation and application to smoothing`
A09	`01`	`1`	`ENG`	`@1 Advances in Combinatorial Image Analysis`
A11	`01`	`1`		`@1 PROVOT (L.)`
A11	`02`	`1`		`@1 DEBLED-RENNESSON (I.)`
A12	`01`	`1`		`@1 BRIMKOV (Valentin E.) @9 ed.`
A12	`02`	`1`		`@1 BARNEVA (Reneta P.) @9 ed.`
A14	`01`			`@1 LORIA Nancy, Campus Scienhfique-BP 239 @2 54506 Vandœuvre-lès-Nancy @3 FRA @Z 1 aut. @Z 2 aut.`
A15	`01`			`@1 Mathematics Department, SUNY Buffalo State College @2 Buffalo, NY 14222 @3 USA @Z 1 aut.`
A15	`02`			`@1 Department of Computer Science, SUNY Fredonia @2 Fredonia, NY 14063 @3 USA @Z 2 aut.`
A20				`@1 1626-1636`
A21				`@1 2009`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 15220 @5 354000187855770010`
A44				`@0 0000 @1 © 2009 INIST-CNRS. All rights reserved.`
A45				`@0 20 ref.`
A47	`01`	`1`		`@0 09-0284122`
A60				`@1 P`
A61				`@0 A`
A64	`01`	`1`		`@0 Pattern recognition`
A66	`01`			`@0 GBR`
C01	`01`		`ENG`	@0 We propose in this paper a segmentation process that can deal with noisy discrete objects. A flexible approach considering arithmetic discrete planes with a variable width is used to avoid the over-segmentation that might happen when classical segmentation algorithms based on regular discrete planes are used to decompose the surface of the object. A method to choose a seed and different segmentation strategies according to the shape of the surface is also proposed, as well as an application to smooth the border of convex noisy discrete objects.
C02	`01`	`X`		`@0 001D04A05A`
C03	`01`	`X`	`FRE`	`@0 Volume @5 01`
C03	`01`	`X`	`ENG`	`@0 Volume @5 01`
C03	`01`	`X`	`SPA`	`@0 Volumen @5 01`
C03	`02`	`X`	`FRE`	`@0 Détection contour @5 02`
C03	`02`	`X`	`ENG`	`@0 Edge detection @5 02`
C03	`02`	`X`	`SPA`	`@0 Detección contorno @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 Algorithme @5 04`
C03	`04`	`X`	`ENG`	`@0 Algorithm @5 04`
C03	`04`	`X`	`SPA`	`@0 Algoritmo @5 04`
C03	`05`	`X`	`FRE`	`@0 Détection forme @5 31`
C03	`05`	`X`	`ENG`	`@0 Shape detection @5 31`
C03	`05`	`X`	`SPA`	`@0 Detección forma @5 31`
N21				`@1 208`
N44	`01`			`@1 OTO`
N82				`@1 OTO`

Format Inist (serveur)

NO :	PASCAL 09-0284122 INIST
ET :	3D noisy discrete objects: Segmentation and application to smoothing
AU :	PROVOT (L.); DEBLED-RENNESSON (I.); BRIMKOV (Valentin E.); BARNEVA (Reneta P.)
AF :	LORIA Nancy, Campus Scienhfique-BP 239/54506 Vandœuvre-lès-Nancy/France (1 aut., 2 aut.); Mathematics Department, SUNY Buffalo State College/Buffalo, NY 14222/Etats-Unis (1 aut.); Department of Computer Science, SUNY Fredonia/Fredonia, NY 14063/Etats-Unis (2 aut.)
DT :	Publication en série; Niveau analytique
SO :	Pattern recognition; ISSN 0031-3203; Coden PTNRA8; Royaume-Uni; Da. 2009; Vol. 42; No. 8; Pp. 1626-1636; Bibl. 20 ref.
LA :	Anglais
EA :	We propose in this paper a segmentation process that can deal with noisy discrete objects. A flexible approach considering arithmetic discrete planes with a variable width is used to avoid the over-segmentation that might happen when classical segmentation algorithms based on regular discrete planes are used to decompose the surface of the object. A method to choose a seed and different segmentation strategies according to the shape of the surface is also proposed, as well as an application to smooth the border of convex noisy discrete objects.
CC :	001D04A05A
FD :	Volume; Détection contour; Segmentation; Algorithme; Détection forme
ED :	Volume; Edge detection; Segmentation; Algorithm; Shape detection
SD :	Volumen; Detección contorno; Segmentación; Algoritmo; Detección forma
LO :	INIST-15220.354000187855770010
ID :	09-0284122

Links to Exploration step

Pascal:09-0284122

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">3D noisy discrete objects: Segmentation and application to smoothing</title>
<author><name sortKey="Provot, L" sort="Provot, L" uniqKey="Provot L" first="L." last="Provot">L. Provot</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA Nancy, Campus Scienhfique-BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Debled Rennesson, I" sort="Debled Rennesson, I" uniqKey="Debled Rennesson I" first="I." last="Debled-Rennesson">I. Debled-Rennesson</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA Nancy, Campus Scienhfique-BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">09-0284122</idno>
<date when="2009">2009</date>
<idno type="stanalyst">PASCAL 09-0284122 INIST</idno>
<idno type="RBID">Pascal:09-0284122</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000266</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">3D noisy discrete objects: Segmentation and application to smoothing</title>
<author><name sortKey="Provot, L" sort="Provot, L" uniqKey="Provot L" first="L." last="Provot">L. Provot</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA Nancy, Campus Scienhfique-BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Debled Rennesson, I" sort="Debled Rennesson, I" uniqKey="Debled Rennesson I" first="I." last="Debled-Rennesson">I. Debled-Rennesson</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA Nancy, Campus Scienhfique-BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Pattern recognition</title>
<title level="j" type="abbreviated">Pattern recogn.</title>
<idno type="ISSN">0031-3203</idno>
<imprint><date when="2009">2009</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Pattern recognition</title>
<title level="j" type="abbreviated">Pattern recogn.</title>
<idno type="ISSN">0031-3203</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithm</term>
<term>Edge detection</term>
<term>Segmentation</term>
<term>Shape detection</term>
<term>Volume</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Volume</term>
<term>Détection contour</term>
<term>Segmentation</term>
<term>Algorithme</term>
<term>Détection forme</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We propose in this paper a segmentation process that can deal with noisy discrete objects. A flexible approach considering arithmetic discrete planes with a variable width is used to avoid the over-segmentation that might happen when classical segmentation algorithms based on regular discrete planes are used to decompose the surface of the object. A method to choose a seed and different segmentation strategies according to the shape of the surface is also proposed, as well as an application to smooth the border of convex noisy discrete objects.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0031-3203</s0>
</fA01>
<fA02 i1="01"><s0>PTNRA8</s0>
</fA02>
<fA03 i2="1"><s0>Pattern recogn.</s0>
</fA03>
<fA05><s2>42</s2>
</fA05>
<fA06><s2>8</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>3D noisy discrete objects: Segmentation and application to smoothing</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Advances in Combinatorial Image Analysis</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>PROVOT (L.)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>DEBLED-RENNESSON (I.)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>BRIMKOV (Valentin E.)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>BARNEVA (Reneta P.)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>LORIA Nancy, Campus Scienhfique-BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</fA14>
<fA15 i1="01"><s1>Mathematics Department, SUNY Buffalo State College</s1>
<s2>Buffalo, NY 14222</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
</fA15>
<fA15 i1="02"><s1>Department of Computer Science, SUNY Fredonia</s1>
<s2>Fredonia, NY 14063</s2>
<s3>USA</s3>
<sZ>2 aut.</sZ>
</fA15>
<fA20><s1>1626-1636</s1>
</fA20>
<fA21><s1>2009</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>15220</s2>
<s5>354000187855770010</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2009 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>20 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>09-0284122</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Pattern recognition</s0>
</fA64>
<fA66 i1="01"><s0>GBR</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>We propose in this paper a segmentation process that can deal with noisy discrete objects. A flexible approach considering arithmetic discrete planes with a variable width is used to avoid the over-segmentation that might happen when classical segmentation algorithms based on regular discrete planes are used to decompose the surface of the object. A method to choose a seed and different segmentation strategies according to the shape of the surface is also proposed, as well as an application to smooth the border of convex noisy discrete objects.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D04A05A</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Volume</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Volume</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Volumen</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Détection contour</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Edge detection</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Detección contorno</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>Algorithme</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Algorithm</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Algoritmo</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Détection forme</s0>
<s5>31</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Shape detection</s0>
<s5>31</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Detección forma</s0>
<s5>31</s5>
</fC03>
<fN21><s1>208</s1>
</fN21>
<fN44 i1="01"><s1>OTO</s1>
</fN44>
<fN82><s1>OTO</s1>
</fN82>
</pA>
</standard>
<server><NO>PASCAL 09-0284122 INIST</NO>
<ET>3D noisy discrete objects: Segmentation and application to smoothing</ET>
<AU>PROVOT (L.); DEBLED-RENNESSON (I.); BRIMKOV (Valentin E.); BARNEVA (Reneta P.)</AU>
<AF>LORIA Nancy, Campus Scienhfique-BP 239/54506 Vandœuvre-lès-Nancy/France (1 aut., 2 aut.); Mathematics Department, SUNY Buffalo State College/Buffalo, NY 14222/Etats-Unis (1 aut.); Department of Computer Science, SUNY Fredonia/Fredonia, NY 14063/Etats-Unis (2 aut.)</AF>
<DT>Publication en série; Niveau analytique</DT>
<SO>Pattern recognition; ISSN 0031-3203; Coden PTNRA8; Royaume-Uni; Da. 2009; Vol. 42; No. 8; Pp. 1626-1636; Bibl. 20 ref.</SO>
<LA>Anglais</LA>
<EA>We propose in this paper a segmentation process that can deal with noisy discrete objects. A flexible approach considering arithmetic discrete planes with a variable width is used to avoid the over-segmentation that might happen when classical segmentation algorithms based on regular discrete planes are used to decompose the surface of the object. A method to choose a seed and different segmentation strategies according to the shape of the surface is also proposed, as well as an application to smooth the border of convex noisy discrete objects.</EA>
<CC>001D04A05A</CC>
<FD>Volume; Détection contour; Segmentation; Algorithme; Détection forme</FD>
<ED>Volume; Edge detection; Segmentation; Algorithm; Shape detection</ED>
<SD>Volumen; Detección contorno; Segmentación; Algoritmo; Detección forma</SD>
<LO>INIST-15220.354000187855770010</LO>
<ID>09-0284122</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 000266 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000266 | 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:09-0284122
   |texte=   3D noisy discrete objects: Segmentation and application to smoothing
}}

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

3D noisy discrete objects: Segmentation and application to smoothing

3D noisy discrete objects: Segmentation and application to smoothing

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