A protocol to characterize the descriptive power and the complementarity of shape descriptors
Identifieur interne : 000153 ( PascalFrancis/Corpus ); précédent : 000152; suivant : 000154A protocol to characterize the descriptive power and the complementarity of shape descriptors
Auteurs : Muriel Visani ; Oriol Ramos Terrades ; Salvatore TabboneSource :
- International journal on document analysis and recognition : (Print) [ 1433-2833 ] ; 2011.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
Abstract
Most document analysis applications rely on the extraction of shape descriptors, which may be grouped into different categories, each category having its own advantages and drawbacks (O.R. Terrades et al. in Proceedings of ICDAR'07, pp. 227-231, 2007). In order to improve the richness of their description, many authors choose to combine multiple descriptors. Yet, most of the authors who propose a new descriptor content themselves with comparing its performance to the performance of a set of single state-of-the-art descriptors in a specific applicative context (e.g. symbol recognition, symbol spotting...). This results in a proliferation of the shape descriptors proposed in the literature. In this article, we propose an innovative protocol, the originality of which is to be as independent of the final application as possible and which relies on new quantitative and qualitative measures. We introduce two types of mea- sures: while the measures of the first type are intended to characterize the descriptive power (in terms of uniqueness, distinctiveness and robustness towards noise) of a descriptor, the second type of measures characterizes the complemen- tarity between multiple descriptors. Characterizing upstream the complementarity of shape descriptors is an alternative to the usual approach where the descriptors to be combined are selected by trial and error, considering the performance char- acteristics of the overall system. To illustrate the contribution of this protocol, we performed experimental studies using a set of descriptors and a set of symbols which are widely used by the community namely ART and SC descriptors and the GREC 2003 database.
Notice en format standard (ISO 2709)
Pour connaître la documentation sur le format Inist Standard.
pA |
|
---|
Format Inist (serveur)
NO : | PASCAL 11-0227814 INIST |
---|---|
ET : | A protocol to characterize the descriptive power and the complementarity of shape descriptors |
AU : | VISANI (Muriel); RAMOS TERRADES (Oriol); TABBONE (Salvatore); WENYIN (Liu); VALVENY (Ernest) |
AF : | L3I, University of La Rochelle/La Rochelle/France (1 aut.); Instituto Tecnológico de Informatica, Universidad Politécnica de Valencia/Valencia/Espagne (2 aut.); LORIA, University of Nancy 2/Vandoeuvre-les-Nancy/France (3 aut.); City University of Hong Kong/Hong Kong/Chine (1 aut.); Computer Vision Center - Universitat Autònoma de Barcelona, Edifici O, Campus UAB/08193 Bellaterra/Espagne (2 aut.) |
DT : | Publication en série; Niveau analytique |
SO : | International journal on document analysis and recognition : (Print); ISSN 1433-2833; Allemagne; Da. 2011; Vol. 14; No. 1; Pp. 87-100; Bibl. 30 ref. |
LA : | Anglais |
EA : | Most document analysis applications rely on the extraction of shape descriptors, which may be grouped into different categories, each category having its own advantages and drawbacks (O.R. Terrades et al. in Proceedings of ICDAR'07, pp. 227-231, 2007). In order to improve the richness of their description, many authors choose to combine multiple descriptors. Yet, most of the authors who propose a new descriptor content themselves with comparing its performance to the performance of a set of single state-of-the-art descriptors in a specific applicative context (e.g. symbol recognition, symbol spotting...). This results in a proliferation of the shape descriptors proposed in the literature. In this article, we propose an innovative protocol, the originality of which is to be as independent of the final application as possible and which relies on new quantitative and qualitative measures. We introduce two types of mea- sures: while the measures of the first type are intended to characterize the descriptive power (in terms of uniqueness, distinctiveness and robustness towards noise) of a descriptor, the second type of measures characterizes the complemen- tarity between multiple descriptors. Characterizing upstream the complementarity of shape descriptors is an alternative to the usual approach where the descriptors to be combined are selected by trial and error, considering the performance char- acteristics of the overall system. To illustrate the contribution of this protocol, we performed experimental studies using a set of descriptors and a set of symbols which are widely used by the community namely ART and SC descriptors and the GREC 2003 database. |
CC : | 001D02C03 |
FD : | Analyse documentaire; Reconnaissance forme; Base de données; Sémiologie; Symbole; Robustesse; .; Recherche image; Recherche par contenu |
ED : | Document analysis; Pattern recognition; Database; Semiology; Symbol; Robustness; Image retrieval; Content-based retrieval |
SD : | Análisis documental; Reconocimiento patrón; Base dato; Semiología; Símbolo; Robustez; Búsqueda de imagen; Búsqueda por Contenidos |
LO : | INIST-26790.354000193723420090 |
ID : | 11-0227814 |
Links to Exploration step
Pascal:11-0227814Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">A protocol to characterize the descriptive power and the complementarity of shape descriptors</title>
<author><name sortKey="Visani, Muriel" sort="Visani, Muriel" uniqKey="Visani M" first="Muriel" last="Visani">Muriel Visani</name>
<affiliation><inist:fA14 i1="01"><s1>L3I, University of La Rochelle</s1>
<s2>La Rochelle</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Ramos Terrades, Oriol" sort="Ramos Terrades, Oriol" uniqKey="Ramos Terrades O" first="Oriol" last="Ramos Terrades">Oriol Ramos Terrades</name>
<affiliation><inist:fA14 i1="02"><s1>Instituto Tecnológico de Informatica, Universidad Politécnica de Valencia</s1>
<s2>Valencia</s2>
<s3>ESP</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Tabbone, Salvatore" sort="Tabbone, Salvatore" uniqKey="Tabbone S" first="Salvatore" last="Tabbone">Salvatore Tabbone</name>
<affiliation><inist:fA14 i1="03"><s1>LORIA, University of Nancy 2</s1>
<s2>Vandoeuvre-les-Nancy</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">11-0227814</idno>
<date when="2011">2011</date>
<idno type="stanalyst">PASCAL 11-0227814 INIST</idno>
<idno type="RBID">Pascal:11-0227814</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000153</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">A protocol to characterize the descriptive power and the complementarity of shape descriptors</title>
<author><name sortKey="Visani, Muriel" sort="Visani, Muriel" uniqKey="Visani M" first="Muriel" last="Visani">Muriel Visani</name>
<affiliation><inist:fA14 i1="01"><s1>L3I, University of La Rochelle</s1>
<s2>La Rochelle</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Ramos Terrades, Oriol" sort="Ramos Terrades, Oriol" uniqKey="Ramos Terrades O" first="Oriol" last="Ramos Terrades">Oriol Ramos Terrades</name>
<affiliation><inist:fA14 i1="02"><s1>Instituto Tecnológico de Informatica, Universidad Politécnica de Valencia</s1>
<s2>Valencia</s2>
<s3>ESP</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Tabbone, Salvatore" sort="Tabbone, Salvatore" uniqKey="Tabbone S" first="Salvatore" last="Tabbone">Salvatore Tabbone</name>
<affiliation><inist:fA14 i1="03"><s1>LORIA, University of Nancy 2</s1>
<s2>Vandoeuvre-les-Nancy</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">International journal on document analysis and recognition : (Print)</title>
<title level="j" type="abbreviated">Int. j. doc. anal. recognit. : (Print)</title>
<idno type="ISSN">1433-2833</idno>
<imprint><date when="2011">2011</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">International journal on document analysis and recognition : (Print)</title>
<title level="j" type="abbreviated">Int. j. doc. anal. recognit. : (Print)</title>
<idno type="ISSN">1433-2833</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Content-based retrieval</term>
<term>Database</term>
<term>Document analysis</term>
<term>Image retrieval</term>
<term>Pattern recognition</term>
<term>Robustness</term>
<term>Semiology</term>
<term>Symbol</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Analyse documentaire</term>
<term>Reconnaissance forme</term>
<term>Base de données</term>
<term>Sémiologie</term>
<term>Symbole</term>
<term>Robustesse</term>
<term>.</term>
<term>Recherche image</term>
<term>Recherche par contenu</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Most document analysis applications rely on the extraction of shape descriptors, which may be grouped into different categories, each category having its own advantages and drawbacks (O.R. Terrades et al. in Proceedings of ICDAR'07, pp. 227-231, 2007). In order to improve the richness of their description, many authors choose to combine multiple descriptors. Yet, most of the authors who propose a new descriptor content themselves with comparing its performance to the performance of a set of single state-of-the-art descriptors in a specific applicative context (e.g. symbol recognition, symbol spotting...). This results in a proliferation of the shape descriptors proposed in the literature. In this article, we propose an innovative protocol, the originality of which is to be as independent of the final application as possible and which relies on new quantitative and qualitative measures. We introduce two types of mea- sures: while the measures of the first type are intended to characterize the descriptive power (in terms of uniqueness, distinctiveness and robustness towards noise) of a descriptor, the second type of measures characterizes the complemen- tarity between multiple descriptors. Characterizing upstream the complementarity of shape descriptors is an alternative to the usual approach where the descriptors to be combined are selected by trial and error, considering the performance char- acteristics of the overall system. To illustrate the contribution of this protocol, we performed experimental studies using a set of descriptors and a set of symbols which are widely used by the community namely ART and SC descriptors and the GREC 2003 database.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>1433-2833</s0>
</fA01>
<fA03 i2="1"><s0>Int. j. doc. anal. recognit. : (Print)</s0>
</fA03>
<fA05><s2>14</s2>
</fA05>
<fA06><s2>1</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>A protocol to characterize the descriptive power and the complementarity of shape descriptors</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Performance Evaluation of Document Analysis and Recognition Algorithms</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>VISANI (Muriel)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>RAMOS TERRADES (Oriol)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>TABBONE (Salvatore)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>WENYIN (Liu)</s1>
<s9>limin.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>VALVENY (Ernest)</s1>
<s9>limin.</s9>
</fA12>
<fA14 i1="01"><s1>L3I, University of La Rochelle</s1>
<s2>La Rochelle</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>Instituto Tecnológico de Informatica, Universidad Politécnica de Valencia</s1>
<s2>Valencia</s2>
<s3>ESP</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="03"><s1>LORIA, University of Nancy 2</s1>
<s2>Vandoeuvre-les-Nancy</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</fA14>
<fA15 i1="01"><s1>City University of Hong Kong</s1>
<s2>Hong Kong</s2>
<s3>CHN</s3>
<sZ>1 aut.</sZ>
</fA15>
<fA15 i1="02"><s1>Computer Vision Center - Universitat Autònoma de Barcelona, Edifici O, Campus UAB</s1>
<s2>08193 Bellaterra</s2>
<s3>ESP</s3>
<sZ>2 aut.</sZ>
</fA15>
<fA20><s1>87-100</s1>
</fA20>
<fA21><s1>2011</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>26790</s2>
<s5>354000193723420090</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2011 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>30 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>11-0227814</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>International journal on document analysis and recognition : (Print)</s0>
</fA64>
<fA66 i1="01"><s0>DEU</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>Most document analysis applications rely on the extraction of shape descriptors, which may be grouped into different categories, each category having its own advantages and drawbacks (O.R. Terrades et al. in Proceedings of ICDAR'07, pp. 227-231, 2007). In order to improve the richness of their description, many authors choose to combine multiple descriptors. Yet, most of the authors who propose a new descriptor content themselves with comparing its performance to the performance of a set of single state-of-the-art descriptors in a specific applicative context (e.g. symbol recognition, symbol spotting...). This results in a proliferation of the shape descriptors proposed in the literature. In this article, we propose an innovative protocol, the originality of which is to be as independent of the final application as possible and which relies on new quantitative and qualitative measures. We introduce two types of mea- sures: while the measures of the first type are intended to characterize the descriptive power (in terms of uniqueness, distinctiveness and robustness towards noise) of a descriptor, the second type of measures characterizes the complemen- tarity between multiple descriptors. Characterizing upstream the complementarity of shape descriptors is an alternative to the usual approach where the descriptors to be combined are selected by trial and error, considering the performance char- acteristics of the overall system. To illustrate the contribution of this protocol, we performed experimental studies using a set of descriptors and a set of symbols which are widely used by the community namely ART and SC descriptors and the GREC 2003 database.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02C03</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Analyse documentaire</s0>
<s5>06</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Document analysis</s0>
<s5>06</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Análisis documental</s0>
<s5>06</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Reconnaissance forme</s0>
<s5>07</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Pattern recognition</s0>
<s5>07</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Reconocimiento patrón</s0>
<s5>07</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Base de données</s0>
<s5>08</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Database</s0>
<s5>08</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Base dato</s0>
<s5>08</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Sémiologie</s0>
<s5>18</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Semiology</s0>
<s5>18</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Semiología</s0>
<s5>18</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Symbole</s0>
<s5>19</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Symbol</s0>
<s5>19</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Símbolo</s0>
<s5>19</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Robustesse</s0>
<s5>23</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Robustness</s0>
<s5>23</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Robustez</s0>
<s5>23</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>.</s0>
<s4>INC</s4>
<s5>82</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Recherche image</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Image retrieval</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Búsqueda de imagen</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Recherche par contenu</s0>
<s4>CD</s4>
<s5>97</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Content-based retrieval</s0>
<s4>CD</s4>
<s5>97</s5>
</fC03>
<fC03 i1="09" i2="X" l="SPA"><s0>Búsqueda por Contenidos</s0>
<s4>CD</s4>
<s5>97</s5>
</fC03>
<fN21><s1>150</s1>
</fN21>
<fN44 i1="01"><s1>OTO</s1>
</fN44>
<fN82><s1>OTO</s1>
</fN82>
</pA>
</standard>
<server><NO>PASCAL 11-0227814 INIST</NO>
<ET>A protocol to characterize the descriptive power and the complementarity of shape descriptors</ET>
<AU>VISANI (Muriel); RAMOS TERRADES (Oriol); TABBONE (Salvatore); WENYIN (Liu); VALVENY (Ernest)</AU>
<AF>L3I, University of La Rochelle/La Rochelle/France (1 aut.); Instituto Tecnológico de Informatica, Universidad Politécnica de Valencia/Valencia/Espagne (2 aut.); LORIA, University of Nancy 2/Vandoeuvre-les-Nancy/France (3 aut.); City University of Hong Kong/Hong Kong/Chine (1 aut.); Computer Vision Center - Universitat Autònoma de Barcelona, Edifici O, Campus UAB/08193 Bellaterra/Espagne (2 aut.)</AF>
<DT>Publication en série; Niveau analytique</DT>
<SO>International journal on document analysis and recognition : (Print); ISSN 1433-2833; Allemagne; Da. 2011; Vol. 14; No. 1; Pp. 87-100; Bibl. 30 ref.</SO>
<LA>Anglais</LA>
<EA>Most document analysis applications rely on the extraction of shape descriptors, which may be grouped into different categories, each category having its own advantages and drawbacks (O.R. Terrades et al. in Proceedings of ICDAR'07, pp. 227-231, 2007). In order to improve the richness of their description, many authors choose to combine multiple descriptors. Yet, most of the authors who propose a new descriptor content themselves with comparing its performance to the performance of a set of single state-of-the-art descriptors in a specific applicative context (e.g. symbol recognition, symbol spotting...). This results in a proliferation of the shape descriptors proposed in the literature. In this article, we propose an innovative protocol, the originality of which is to be as independent of the final application as possible and which relies on new quantitative and qualitative measures. We introduce two types of mea- sures: while the measures of the first type are intended to characterize the descriptive power (in terms of uniqueness, distinctiveness and robustness towards noise) of a descriptor, the second type of measures characterizes the complemen- tarity between multiple descriptors. Characterizing upstream the complementarity of shape descriptors is an alternative to the usual approach where the descriptors to be combined are selected by trial and error, considering the performance char- acteristics of the overall system. To illustrate the contribution of this protocol, we performed experimental studies using a set of descriptors and a set of symbols which are widely used by the community namely ART and SC descriptors and the GREC 2003 database.</EA>
<CC>001D02C03</CC>
<FD>Analyse documentaire; Reconnaissance forme; Base de données; Sémiologie; Symbole; Robustesse; .; Recherche image; Recherche par contenu</FD>
<ED>Document analysis; Pattern recognition; Database; Semiology; Symbol; Robustness; Image retrieval; Content-based retrieval</ED>
<SD>Análisis documental; Reconocimiento patrón; Base dato; Semiología; Símbolo; Robustez; Búsqueda de imagen; Búsqueda por Contenidos</SD>
<LO>INIST-26790.354000193723420090</LO>
<ID>11-0227814</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 000153 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000153 | 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:11-0227814 |texte= A protocol to characterize the descriptive power and the complementarity of shape descriptors }}
This area was generated with Dilib version V0.6.33. |