Hypergraph-based image retrieval for graph-based representation
Identifieur interne : 001F16 ( Main/Merge ); précédent : 001F15; suivant : 001F17Hypergraph-based image retrieval for graph-based representation
Auteurs : Salim Jouili [Belgique] ; Salvatore Tabbone [France]Source :
- Pattern recognition [ 0031-3203 ] ; 2012.
Descripteurs français
- Pascal (Inist)
- Wicri :
- topic : Base de données.
English descriptors
- KwdEn :
Abstract
In this paper, we introduce a novel method for graph indexing. We propose a hypergraph-based model for graph data sets by allowing cluster overlapping. More precisely, in this representation one graph can be assigned to more than one cluster. Using the concept of the graph median and a given threshold, the proposed algorithm detects automatically the number of classes in the graph database. We consider clusters as hyperedges in our hypergraph model and we index the graph set by the hyperedge centroids. This model is interesting to traverse the data set and efficient to retrieve graphs.
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: 000117
- to stream PascalFrancis, to step Curation: 000895
- to stream PascalFrancis, to step Checkpoint: 000107
Links to Exploration step
Pascal:12-0273033Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Hypergraph-based image retrieval for graph-based representation</title><author><name sortKey="Jouili, Salim" sort="Jouili, Salim" uniqKey="Jouili S" first="Salim" last="Jouili">Salim Jouili</name><affiliation wicri:level="3"><inist:fA14 i1="01"><s1>EURA NOVA, 4 Rue Emile Francqui</s1><s2>1435 Mont-St-Guibert</s2><s3>BEL</s3><sZ>1 aut.</sZ></inist:fA14><country>Belgique</country><placeName><region type="land" nuts="2">Vienne (Autriche)</region><settlement type="city">Vienne (Autriche)</settlement></placeName></affiliation></author><author><name sortKey="Tabbone, Salvatore" sort="Tabbone, Salvatore" uniqKey="Tabbone S" first="Salvatore" last="Tabbone">Salvatore Tabbone</name><affiliation wicri:level="3"><inist:fA14 i1="02"><s1>Universite de Lorraine-LORIA UMR 7503, BP 239</s1><s2>54506 Vandoeuvre-lès-Nancy</s2><s3>FRA</s3><sZ>2 aut.</sZ></inist:fA14><country>France</country><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Vandœuvre-lès-Nancy</settlement></placeName></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">12-0273033</idno><date when="2012">2012</date><idno type="stanalyst">PASCAL 12-0273033 INIST</idno><idno type="RBID">Pascal:12-0273033</idno><idno type="wicri:Area/PascalFrancis/Corpus">000117</idno><idno type="wicri:Area/PascalFrancis/Curation">000895</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000107</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000107</idno><idno type="wicri:doubleKey">0031-3203:2012:Jouili S:hypergraph:based:image</idno><idno type="wicri:Area/Main/Merge">001F16</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Hypergraph-based image retrieval for graph-based representation</title><author><name sortKey="Jouili, Salim" sort="Jouili, Salim" uniqKey="Jouili S" first="Salim" last="Jouili">Salim Jouili</name><affiliation wicri:level="3"><inist:fA14 i1="01"><s1>EURA NOVA, 4 Rue Emile Francqui</s1><s2>1435 Mont-St-Guibert</s2><s3>BEL</s3><sZ>1 aut.</sZ></inist:fA14><country>Belgique</country><placeName><region type="land" nuts="2">Vienne (Autriche)</region><settlement type="city">Vienne (Autriche)</settlement></placeName></affiliation></author><author><name sortKey="Tabbone, Salvatore" sort="Tabbone, Salvatore" uniqKey="Tabbone S" first="Salvatore" last="Tabbone">Salvatore Tabbone</name><affiliation wicri:level="3"><inist:fA14 i1="02"><s1>Universite de Lorraine-LORIA UMR 7503, BP 239</s1><s2>54506 Vandoeuvre-lès-Nancy</s2><s3>FRA</s3><sZ>2 aut.</sZ></inist:fA14><country>France</country><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Vandœuvre-lès-Nancy</settlement></placeName></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="2012">2012</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>Conceptual graph</term><term>Content based retrieval</term><term>Database</term><term>Graph theory</term><term>Hypergraph</term><term>Image retrieval</term><term>Indexing</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Hypergraphe</term><term>Recherche image</term><term>Théorie graphe</term><term>Indexation</term><term>Graphe conceptuel</term><term>Algorithme</term><term>Base de données</term><term>Recherche par contenu</term></keywords><keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Base de données</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">In this paper, we introduce a novel method for graph indexing. We propose a hypergraph-based model for graph data sets by allowing cluster overlapping. More precisely, in this representation one graph can be assigned to more than one cluster. Using the concept of the graph median and a given threshold, the proposed algorithm detects automatically the number of classes in the graph database. We consider clusters as hyperedges in our hypergraph model and we index the graph set by the hyperedge centroids. This model is interesting to traverse the data set and efficient to retrieve graphs.</div></front></TEI><affiliations><list><country><li>Belgique</li><li>France</li></country><region><li>Grand Est</li><li>Lorraine (région)</li><li>Vienne (Autriche)</li></region><settlement><li>Vandœuvre-lès-Nancy</li><li>Vienne (Autriche)</li></settlement></list><tree><country name="Belgique"><region name="Vienne (Autriche)"><name sortKey="Jouili, Salim" sort="Jouili, Salim" uniqKey="Jouili S" first="Salim" last="Jouili">Salim Jouili</name></region></country><country name="France"><region name="Grand Est"><name sortKey="Tabbone, Salvatore" sort="Tabbone, Salvatore" uniqKey="Tabbone S" first="Salvatore" last="Tabbone">Salvatore Tabbone</name></region></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001F16 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 001F16 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Merge
|type= RBID
|clé= Pascal:12-0273033
|texte= Hypergraph-based image retrieval for graph-based representation
}}
| This area was generated with Dilib version V0.6.33. |  |