Advertisement

On the Computation of the Common Labelling of a Set of Attributed Graphs

  • Albert Solé-Ribalta
  • Francesc Serratosa
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5856)

Abstract

In some methodologies, it is needed a consistent common labelling between the vertices of a set of graphs, for instance, to compute a representative of a set of graphs. This is a NP-problem with an exponential computational cost depending on the number of nodes and the number of graphs. The aim of this paper is twofold. On one hand, we aim to establish a technical methodology to define this problem for the present and further research. On the other hand, we present two sub-optimal algorithms to compute the labelling between a set of graphs. Results show that our new algorithms are able to find a consistent common labelling while reducing, most of the times, the mean distance of the AG set.

Keywords

Multiple graph matching common graph labelling inconsistent labelling softassign 

References

  1. 1.
    Bonev, B., et al.: Constellations and the unsupervised learning of graphs. In: Escolano, F., Vento, M. (eds.) GbRPR. LNCS, vol. 4538, pp. 340–350. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  2. 2.
    Sanfeliu, A., Serratosa, F., Alquézar, R.: Second-Order Random Graphs for modeling sets of Attributed Graphs and their application to object learning and recognition. International Journal of Pattern Recognition and Artificial Intelligence, IJPRAI 18(3), 375–396 (2004)CrossRefGoogle Scholar
  3. 3.
    Serratosa, F., Alquézar, R., Sanfeliu, A.: Function-Described Graphs for modeling objects represented by attributed graphs. Pattern Recognition 36(3), 781–798 (2003)CrossRefGoogle Scholar
  4. 4.
    Wong, A.K.C., You, M.: Entropy and distance of random graphs with application to structural pattern recognition. IEEE Transactions on PAMI 7, 599–609 (1985)zbMATHGoogle Scholar
  5. 5.
    Gold, S., Rangarajan, A.: A Graduated Assignment Algorithm for Graph Matching. Trans. on PAMI 18(4), 377–388 (1996)Google Scholar
  6. 6.
    Latouche, G., Ramaswami, V.: Introduction to Matrix Analytic Methods in Stochastic Modelling. In: PH Distributions; ASA, ch. 2, 1st edn., SIAM, Philadelphia (1999)Google Scholar
  7. 7.
    Solé-Ribalta, A., Serratosa, F.: A structural and semantic probabilistic model for matching and representing a set of graphs, GbR, Venice, Italy. LNCS, vol. 5534, pp. 164–173. Springer, Heidelberg (2009)Google Scholar
  8. 8.
    Williams, M.L., Wilson, R.C., Hancock, E.R.: Multiple Graph Matching with Bayesian Inference. Pattern Recognition Letters 18, 1275–1281 (1997)CrossRefGoogle Scholar
  9. 9.
    Sanfeliu, A., Fu, K.S.: A Distance Measure Between Attributed Relational Graphs for Pattern Recognition. Trans. Systems, Man, and Cybernetics 13, 353–362 (1983)zbMATHGoogle Scholar
  10. 10.
    Riesen, K., Bunke, H.: Graph Database Repository for Graph Based Pattern Recognition and Machine Learning. In: SSPR 2008 (2008)Google Scholar
  11. 11.
    Fekete, G., Eklundh, J.O., Rosenfeld, A.: Relaxation: Evaluation and Applications. Trans. on PAMI 4(3), 459–469 (1981)Google Scholar
  12. 12.
    Luo, B., Hancock, E.R.: Structural graph matching using the EM algorithm and singular value decomposition. Trans. on PAMI 10(23), 1120–1136 (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Albert Solé-Ribalta
    • 1
  • Francesc Serratosa
    • 1
  1. 1.Department of Computer Science and MathematicsUniversitat Rovira i Virgili (URV)Tarragona

Personalised recommendations