InforLorV4, PascalFrancis, Corpus, bibRecord, 000433

An A contrario decision method for shape element recognition

Identifieur interne : 000433 ( PascalFrancis/Corpus ); précédent : 000432; suivant : 000434

An A contrario decision method for shape element recognition

Auteurs : Pablo Muse ; Frédéric Sur ; Frédéric Cao ; Yann Gousseau ; Jean-Michel Morel

Source :

International journal of computer vision [ 0920-5691 ] ; 2006.

RBID : Pascal:06-0387044

Descripteurs français

Pascal (Inist)
- Taux fausse alarme, Image numérique, Recherche information, Forme planaire, Interrogation base donnée, Reconnaissance forme, Forme géométrique, Vision ordinateur, Modèle fond.

English descriptors

KwdEn :
- Computer vision, Database query, Digital image, False alarm rate, Geometrical shape, Information retrieval, Pattern recognition, Planar form.

Abstract

Shape recognition is the field of computer vision which addresses the problem of finding out whether a query shape lies or not in a shape database, up to a certain invariance. Most shape recognition methods simply sort shapes from the database along some (dis-)similarity measure to the query shape. Their main weakness is the decision stage, which should aim at giving a clear-cut answer to the question: "do these two shapes look alike?" In this article, the proposed solution consists in bounding the number of false correspondences of the query shape among the database shapes, ensuring that the obtained matches are not likely to occur "by chance". As an application, one can decide with a parameterless method whether any two digital images share some shapes or not.

Notice en format standard (ISO 2709)

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

A01	`01`	`1`		`@0 0920-5691`
A03		`1`		`@0 Int. j. comput. vis.`
A05				`@2 69`
A06				`@2 3`
A08	`01`	`1`	`ENG`	`@1 An A contrario decision method for shape element recognition`
A11	`01`	`1`		`@1 MUSE (Pablo)`
A11	`02`	`1`		`@1 SUR (Frédéric)`
A11	`03`	`1`		`@1 CAO (Frédéric)`
A11	`04`	`1`		`@1 GOUSSEAU (Yann)`
A11	`05`	`1`		`@1 MOREL (Jean-Michel)`
A14	`01`			`@1 CMLA, ENS de Cachan, 61 avenue du Président Wilson @2 94235 Cachan @3 FRA @Z 1 aut. @Z 2 aut. @Z 5 aut.`
A14	`02`			`@1 LORIA and CNRS, Campus Scientifique BP 239 @2 54506 Vandoeuvre-lès-Nancy @3 FRA @Z 2 aut.`
A14	`03`			`@1 IRISA, INRIA Rennes, Campus Universitaire de Beaulieu @2 35042 Rennes @3 FRA @Z 3 aut.`
A14	`04`			`@1 Signal and Image Processing Department, CNRS UMR 5141, Télécom Paris, 46 rue Barrault @2 75643 Paris @3 FRA @Z 4 aut.`
A20				`@1 295-315`
A21				`@1 2006`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 21361 @5 354000153093140030`
A44				`@0 0000 @1 © 2006 INIST-CNRS. All rights reserved.`
A45				`@0 1 p.1/4`
A47	`01`	`1`		`@0 06-0387044`
A60				`@1 P`
A61				`@0 A`
A64	`01`	`1`		`@0 International journal of computer vision`
A66	`01`			`@0 NLD`
C01	`01`		`ENG`	@0 Shape recognition is the field of computer vision which addresses the problem of finding out whether a query shape lies or not in a shape database, up to a certain invariance. Most shape recognition methods simply sort shapes from the database along some (dis-)similarity measure to the query shape. Their main weakness is the decision stage, which should aim at giving a clear-cut answer to the question: "do these two shapes look alike?" In this article, the proposed solution consists in bounding the number of false correspondences of the query shape among the database shapes, ensuring that the obtained matches are not likely to occur "by chance". As an application, one can decide with a parameterless method whether any two digital images share some shapes or not.
C02	`01`	`X`		`@0 001D02C03`
C03	`01`	`X`	`FRE`	`@0 Taux fausse alarme @5 01`
C03	`01`	`X`	`ENG`	`@0 False alarm rate @5 01`
C03	`01`	`X`	`SPA`	`@0 Porcentaje falsa alarma @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 Recherche information @5 03`
C03	`03`	`X`	`ENG`	`@0 Information retrieval @5 03`
C03	`03`	`X`	`SPA`	`@0 Búsqueda información @5 03`
C03	`04`	`X`	`FRE`	`@0 Forme planaire @5 04`
C03	`04`	`X`	`ENG`	`@0 Planar form @5 04`
C03	`04`	`X`	`SPA`	`@0 Forma planaria @5 04`
C03	`05`	`X`	`FRE`	`@0 Interrogation base donnée @5 05`
C03	`05`	`X`	`ENG`	`@0 Database query @5 05`
C03	`05`	`X`	`SPA`	`@0 Interrogación base datos @5 05`
C03	`06`	`X`	`FRE`	`@0 Reconnaissance forme @5 06`
C03	`06`	`X`	`ENG`	`@0 Pattern recognition @5 06`
C03	`06`	`X`	`SPA`	`@0 Reconocimiento patrón @5 06`
C03	`07`	`X`	`FRE`	`@0 Forme géométrique @5 07`
C03	`07`	`X`	`ENG`	`@0 Geometrical shape @5 07`
C03	`07`	`X`	`SPA`	`@0 Forma geométrica @5 07`
C03	`08`	`X`	`FRE`	`@0 Vision ordinateur @5 08`
C03	`08`	`X`	`ENG`	`@0 Computer vision @5 08`
C03	`08`	`X`	`SPA`	`@0 Visión ordenador @5 08`
C03	`09`	`X`	`FRE`	`@0 Modèle fond @4 INC @5 82`
N21				`@1 254`
N44	`01`			`@1 PSI`
N82				`@1 PSI`

Format Inist (serveur)

NO :	PASCAL 06-0387044 INIST
ET :	An A contrario decision method for shape element recognition
AU :	MUSE (Pablo); SUR (Frédéric); CAO (Frédéric); GOUSSEAU (Yann); MOREL (Jean-Michel)
AF :	CMLA, ENS de Cachan, 61 avenue du Président Wilson/94235 Cachan/France (1 aut., 2 aut., 5 aut.); LORIA and CNRS, Campus Scientifique BP 239/54506 Vandoeuvre-lès-Nancy/France (2 aut.); IRISA, INRIA Rennes, Campus Universitaire de Beaulieu/35042 Rennes/France (3 aut.); Signal and Image Processing Department, CNRS UMR 5141, Télécom Paris, 46 rue Barrault/75643 Paris/France (4 aut.)
DT :	Publication en série; Niveau analytique
SO :	International journal of computer vision; ISSN 0920-5691; Pays-Bas; Da. 2006; Vol. 69; No. 3; Pp. 295-315; Bibl. 1 p.1/4
LA :	Anglais
EA :	Shape recognition is the field of computer vision which addresses the problem of finding out whether a query shape lies or not in a shape database, up to a certain invariance. Most shape recognition methods simply sort shapes from the database along some (dis-)similarity measure to the query shape. Their main weakness is the decision stage, which should aim at giving a clear-cut answer to the question: "do these two shapes look alike?" In this article, the proposed solution consists in bounding the number of false correspondences of the query shape among the database shapes, ensuring that the obtained matches are not likely to occur "by chance". As an application, one can decide with a parameterless method whether any two digital images share some shapes or not.
CC :	001D02C03
FD :	Taux fausse alarme; Image numérique; Recherche information; Forme planaire; Interrogation base donnée; Reconnaissance forme; Forme géométrique; Vision ordinateur; Modèle fond
ED :	False alarm rate; Digital image; Information retrieval; Planar form; Database query; Pattern recognition; Geometrical shape; Computer vision
SD :	Porcentaje falsa alarma; Imagen numérica; Búsqueda información; Forma planaria; Interrogación base datos; Reconocimiento patrón; Forma geométrica; Visión ordenador
LO :	INIST-21361.354000153093140030
ID :	06-0387044

Links to Exploration step

Pascal:06-0387044

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">An A contrario decision method for shape element recognition</title>
<author><name sortKey="Muse, Pablo" sort="Muse, Pablo" uniqKey="Muse P" first="Pablo" last="Muse">Pablo Muse</name>
<affiliation><inist:fA14 i1="01"><s1>CMLA, ENS de Cachan, 61 avenue du Président Wilson</s1>
<s2>94235 Cachan</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Sur, Frederic" sort="Sur, Frederic" uniqKey="Sur F" first="Frédéric" last="Sur">Frédéric Sur</name>
<affiliation><inist:fA14 i1="01"><s1>CMLA, ENS de Cachan, 61 avenue du Président Wilson</s1>
<s2>94235 Cachan</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
<affiliation><inist:fA14 i1="02"><s1>LORIA and CNRS, Campus Scientifique BP 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Cao, Frederic" sort="Cao, Frederic" uniqKey="Cao F" first="Frédéric" last="Cao">Frédéric Cao</name>
<affiliation><inist:fA14 i1="03"><s1>IRISA, INRIA Rennes, Campus Universitaire de Beaulieu</s1>
<s2>35042 Rennes</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Gousseau, Yann" sort="Gousseau, Yann" uniqKey="Gousseau Y" first="Yann" last="Gousseau">Yann Gousseau</name>
<affiliation><inist:fA14 i1="04"><s1>Signal and Image Processing Department, CNRS UMR 5141, Télécom Paris, 46 rue Barrault</s1>
<s2>75643 Paris</s2>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Morel, Jean Michel" sort="Morel, Jean Michel" uniqKey="Morel J" first="Jean-Michel" last="Morel">Jean-Michel Morel</name>
<affiliation><inist:fA14 i1="01"><s1>CMLA, ENS de Cachan, 61 avenue du Président Wilson</s1>
<s2>94235 Cachan</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">06-0387044</idno>
<date when="2006">2006</date>
<idno type="stanalyst">PASCAL 06-0387044 INIST</idno>
<idno type="RBID">Pascal:06-0387044</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000433</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">An A contrario decision method for shape element recognition</title>
<author><name sortKey="Muse, Pablo" sort="Muse, Pablo" uniqKey="Muse P" first="Pablo" last="Muse">Pablo Muse</name>
<affiliation><inist:fA14 i1="01"><s1>CMLA, ENS de Cachan, 61 avenue du Président Wilson</s1>
<s2>94235 Cachan</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Sur, Frederic" sort="Sur, Frederic" uniqKey="Sur F" first="Frédéric" last="Sur">Frédéric Sur</name>
<affiliation><inist:fA14 i1="01"><s1>CMLA, ENS de Cachan, 61 avenue du Président Wilson</s1>
<s2>94235 Cachan</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
<affiliation><inist:fA14 i1="02"><s1>LORIA and CNRS, Campus Scientifique BP 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Cao, Frederic" sort="Cao, Frederic" uniqKey="Cao F" first="Frédéric" last="Cao">Frédéric Cao</name>
<affiliation><inist:fA14 i1="03"><s1>IRISA, INRIA Rennes, Campus Universitaire de Beaulieu</s1>
<s2>35042 Rennes</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Gousseau, Yann" sort="Gousseau, Yann" uniqKey="Gousseau Y" first="Yann" last="Gousseau">Yann Gousseau</name>
<affiliation><inist:fA14 i1="04"><s1>Signal and Image Processing Department, CNRS UMR 5141, Télécom Paris, 46 rue Barrault</s1>
<s2>75643 Paris</s2>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Morel, Jean Michel" sort="Morel, Jean Michel" uniqKey="Morel J" first="Jean-Michel" last="Morel">Jean-Michel Morel</name>
<affiliation><inist:fA14 i1="01"><s1>CMLA, ENS de Cachan, 61 avenue du Président Wilson</s1>
<s2>94235 Cachan</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">International journal of computer vision</title>
<title level="j" type="abbreviated">Int. j. comput. vis.</title>
<idno type="ISSN">0920-5691</idno>
<imprint><date when="2006">2006</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">International journal of computer vision</title>
<title level="j" type="abbreviated">Int. j. comput. vis.</title>
<idno type="ISSN">0920-5691</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Computer vision</term>
<term>Database query</term>
<term>Digital image</term>
<term>False alarm rate</term>
<term>Geometrical shape</term>
<term>Information retrieval</term>
<term>Pattern recognition</term>
<term>Planar form</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Taux fausse alarme</term>
<term>Image numérique</term>
<term>Recherche information</term>
<term>Forme planaire</term>
<term>Interrogation base donnée</term>
<term>Reconnaissance forme</term>
<term>Forme géométrique</term>
<term>Vision ordinateur</term>
<term>Modèle fond</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Shape recognition is the field of computer vision which addresses the problem of finding out whether a query shape lies or not in a shape database, up to a certain invariance. Most shape recognition methods simply sort shapes from the database along some (dis-)similarity measure to the query shape. Their main weakness is the decision stage, which should aim at giving a clear-cut answer to the question: "do these two shapes look alike?" In this article, the proposed solution consists in bounding the number of false correspondences of the query shape among the database shapes, ensuring that the obtained matches are not likely to occur "by chance". As an application, one can decide with a parameterless method whether any two digital images share some shapes or not.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0920-5691</s0>
</fA01>
<fA03 i2="1"><s0>Int. j. comput. vis.</s0>
</fA03>
<fA05><s2>69</s2>
</fA05>
<fA06><s2>3</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>An A contrario decision method for shape element recognition</s1>
</fA08>
<fA11 i1="01" i2="1"><s1>MUSE (Pablo)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>SUR (Frédéric)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>CAO (Frédéric)</s1>
</fA11>
<fA11 i1="04" i2="1"><s1>GOUSSEAU (Yann)</s1>
</fA11>
<fA11 i1="05" i2="1"><s1>MOREL (Jean-Michel)</s1>
</fA11>
<fA14 i1="01"><s1>CMLA, ENS de Cachan, 61 avenue du Président Wilson</s1>
<s2>94235 Cachan</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>5 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>LORIA and CNRS, Campus Scientifique BP 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="03"><s1>IRISA, INRIA Rennes, Campus Universitaire de Beaulieu</s1>
<s2>35042 Rennes</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</fA14>
<fA14 i1="04"><s1>Signal and Image Processing Department, CNRS UMR 5141, Télécom Paris, 46 rue Barrault</s1>
<s2>75643 Paris</s2>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
</fA14>
<fA20><s1>295-315</s1>
</fA20>
<fA21><s1>2006</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>21361</s2>
<s5>354000153093140030</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2006 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>1 p.1/4</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>06-0387044</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>International journal of computer vision</s0>
</fA64>
<fA66 i1="01"><s0>NLD</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>Shape recognition is the field of computer vision which addresses the problem of finding out whether a query shape lies or not in a shape database, up to a certain invariance. Most shape recognition methods simply sort shapes from the database along some (dis-)similarity measure to the query shape. Their main weakness is the decision stage, which should aim at giving a clear-cut answer to the question: "do these two shapes look alike?" In this article, the proposed solution consists in bounding the number of false correspondences of the query shape among the database shapes, ensuring that the obtained matches are not likely to occur "by chance". As an application, one can decide with a parameterless method whether any two digital images share some shapes or not.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02C03</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Taux fausse alarme</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>False alarm rate</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Porcentaje falsa alarma</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>Recherche information</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Information retrieval</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Búsqueda información</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Forme planaire</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Planar form</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Forma planaria</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Interrogation base donnée</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Database query</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Interrogación base datos</s0>
<s5>05</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Reconnaissance forme</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Pattern recognition</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Reconocimiento patrón</s0>
<s5>06</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Forme géométrique</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Geometrical shape</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Forma geométrica</s0>
<s5>07</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Vision ordinateur</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Computer vision</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Visión ordenador</s0>
<s5>08</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Modèle fond</s0>
<s4>INC</s4>
<s5>82</s5>
</fC03>
<fN21><s1>254</s1>
</fN21>
<fN44 i1="01"><s1>PSI</s1>
</fN44>
<fN82><s1>PSI</s1>
</fN82>
</pA>
</standard>
<server><NO>PASCAL 06-0387044 INIST</NO>
<ET>An A contrario decision method for shape element recognition</ET>
<AU>MUSE (Pablo); SUR (Frédéric); CAO (Frédéric); GOUSSEAU (Yann); MOREL (Jean-Michel)</AU>
<AF>CMLA, ENS de Cachan, 61 avenue du Président Wilson/94235 Cachan/France (1 aut., 2 aut., 5 aut.); LORIA and CNRS, Campus Scientifique BP 239/54506 Vandoeuvre-lès-Nancy/France (2 aut.); IRISA, INRIA Rennes, Campus Universitaire de Beaulieu/35042 Rennes/France (3 aut.); Signal and Image Processing Department, CNRS UMR 5141, Télécom Paris, 46 rue Barrault/75643 Paris/France (4 aut.)</AF>
<DT>Publication en série; Niveau analytique</DT>
<SO>International journal of computer vision; ISSN 0920-5691; Pays-Bas; Da. 2006; Vol. 69; No. 3; Pp. 295-315; Bibl. 1 p.1/4</SO>
<LA>Anglais</LA>
<EA>Shape recognition is the field of computer vision which addresses the problem of finding out whether a query shape lies or not in a shape database, up to a certain invariance. Most shape recognition methods simply sort shapes from the database along some (dis-)similarity measure to the query shape. Their main weakness is the decision stage, which should aim at giving a clear-cut answer to the question: "do these two shapes look alike?" In this article, the proposed solution consists in bounding the number of false correspondences of the query shape among the database shapes, ensuring that the obtained matches are not likely to occur "by chance". As an application, one can decide with a parameterless method whether any two digital images share some shapes or not.</EA>
<CC>001D02C03</CC>
<FD>Taux fausse alarme; Image numérique; Recherche information; Forme planaire; Interrogation base donnée; Reconnaissance forme; Forme géométrique; Vision ordinateur; Modèle fond</FD>
<ED>False alarm rate; Digital image; Information retrieval; Planar form; Database query; Pattern recognition; Geometrical shape; Computer vision</ED>
<SD>Porcentaje falsa alarma; Imagen numérica; Búsqueda información; Forma planaria; Interrogación base datos; Reconocimiento patrón; Forma geométrica; Visión ordenador</SD>
<LO>INIST-21361.354000153093140030</LO>
<ID>06-0387044</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 000433 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000433 | 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:06-0387044
   |texte=   An A contrario decision method for shape element recognition
}}

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

An A contrario decision method for shape element recognition

An A contrario decision method for shape element recognition

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