Hypergraph-based image retrieval for graph-based representation

  • Authors:
  • Salim Jouili;Salvatore Tabbone

  • Affiliations:
  • EURA NOVA, 4 Rue Emile Francqui, 1435 Mont-St-Guibert, Belgium;Université de Lorraine-LORIA UMR 7503, BP 239, 54506 Vandoeuvre-lès-Nancy Cedex, France

  • Venue:
  • Pattern Recognition
  • Year:
  • 2012

Quantified Score

Hi-index 0.01

Visualization

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.