Graph Matching Based on Node Signatures
Identifieur interne : 000647 ( Istex/Curation ); précédent : 000646; suivant : 000648Graph Matching Based on Node Signatures
Auteurs : Salim Jouili [France] ; Salvatore Tabbone [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: We present an algorithm for graph matching in a pattern recognition context. This algorithm deals with weighted graphs, based on new structural and topological node signatures. Using these signatures, we compute an optimum solution for node-to-node assignment with the Hungarian method and propose a distance formula to compute the distance between weighted graphs. The experiments demonstrate that the newly presented algorithm is well suited to pattern recognition applications. Compared with four well-known methods, our algorithm gives good results for clustering and retrieving images. A sensitivity analysis reveals that the proposed method is also insensitive to weak structural changes.
Url:
DOI: 10.1007/978-3-642-02124-4_16
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000652
Links to Exploration step
ISTEX:1CA4B7E49D254EFA8A8740472A48A55D4D525C6BLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Graph Matching Based on Node Signatures</title><author><name sortKey="Jouili, Salim" sort="Jouili, Salim" uniqKey="Jouili S" first="Salim" last="Jouili">Salim Jouili</name><affiliation wicri:level="1"><mods:affiliation>University of Nancy 2 - LORIA UMR 7503, BP 239, 54506, Vandoeuvre-lès-Nancy Cedex, France</mods:affiliation><country xml:lang="fr">France</country><wicri:regionArea>University of Nancy 2 - LORIA UMR 7503, BP 239, 54506, Vandoeuvre-lès-Nancy Cedex</wicri:regionArea></affiliation><affiliation wicri:level="1"><mods:affiliation>E-mail: salim.jouili@loria.fr</mods:affiliation><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Tabbone, Salvatore" sort="Tabbone, Salvatore" uniqKey="Tabbone S" first="Salvatore" last="Tabbone">Salvatore Tabbone</name><affiliation wicri:level="1"><mods:affiliation>University of Nancy 2 - LORIA UMR 7503, BP 239, 54506, Vandoeuvre-lès-Nancy Cedex, France</mods:affiliation><country xml:lang="fr">France</country><wicri:regionArea>University of Nancy 2 - LORIA UMR 7503, BP 239, 54506, Vandoeuvre-lès-Nancy Cedex</wicri:regionArea></affiliation><affiliation wicri:level="1"><mods:affiliation>E-mail: tabbone@loria.fr</mods:affiliation><country wicri:rule="url">France</country></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:1CA4B7E49D254EFA8A8740472A48A55D4D525C6B</idno><date when="2009" year="2009">2009</date><idno type="doi">10.1007/978-3-642-02124-4_16</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-1B2JD2Z5-1/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">000652</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000652</idno><idno type="wicri:Area/Istex/Curation">000647</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Graph Matching Based on Node Signatures</title><author><name sortKey="Jouili, Salim" sort="Jouili, Salim" uniqKey="Jouili S" first="Salim" last="Jouili">Salim Jouili</name><affiliation wicri:level="1"><mods:affiliation>University of Nancy 2 - LORIA UMR 7503, BP 239, 54506, Vandoeuvre-lès-Nancy Cedex, France</mods:affiliation><country xml:lang="fr">France</country><wicri:regionArea>University of Nancy 2 - LORIA UMR 7503, BP 239, 54506, Vandoeuvre-lès-Nancy Cedex</wicri:regionArea></affiliation><affiliation wicri:level="1"><mods:affiliation>E-mail: salim.jouili@loria.fr</mods:affiliation><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Tabbone, Salvatore" sort="Tabbone, Salvatore" uniqKey="Tabbone S" first="Salvatore" last="Tabbone">Salvatore Tabbone</name><affiliation wicri:level="1"><mods:affiliation>University of Nancy 2 - LORIA UMR 7503, BP 239, 54506, Vandoeuvre-lès-Nancy Cedex, France</mods:affiliation><country xml:lang="fr">France</country><wicri:regionArea>University of Nancy 2 - LORIA UMR 7503, BP 239, 54506, Vandoeuvre-lès-Nancy Cedex</wicri:regionArea></affiliation><affiliation wicri:level="1"><mods:affiliation>E-mail: tabbone@loria.fr</mods:affiliation><country wicri:rule="url">France</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We present an algorithm for graph matching in a pattern recognition context. This algorithm deals with weighted graphs, based on new structural and topological node signatures. Using these signatures, we compute an optimum solution for node-to-node assignment with the Hungarian method and propose a distance formula to compute the distance between weighted graphs. The experiments demonstrate that the newly presented algorithm is well suited to pattern recognition applications. Compared with four well-known methods, our algorithm gives good results for clustering and retrieving images. A sensitivity analysis reveals that the proposed method is also insensitive to weak structural changes.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000647 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Curation/biblio.hfd -nk 000647 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Istex
|étape= Curation
|type= RBID
|clé= ISTEX:1CA4B7E49D254EFA8A8740472A48A55D4D525C6B
|texte= Graph Matching Based on Node Signatures
}}
| This area was generated with Dilib version V0.6.33. |  |