A New Algorithm for Graph Matching with Application to Content-Based Image Retrieval

  • Adel Hlaoui
  • Shengrui Wang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2396)


In this paper, we propose a new efficient algorithm for the inexact matching problem. The algorithm decomposes the matching process into K phases, each exploiting a different part of solution space. With most plausible parts being searched first, only a small number of phases is required in order to produce very good matching (most of them optimal). A Content-based image retrieval application using the new matching algorithm is described in the second part of this paper.


  1. 1.
    J. R. Ulmann. An algorithm for subgraph isomorphism, Journal of the association for Computing Machinery, vol. 23, no 1, January 1976, pp. 31–42.MathSciNetGoogle Scholar
  2. 2.
    D. G. Corneil and C. G. Gotlieb. An Efficient Algorithm for Graph Isomorphism, Journal of the Association for Computing Machinery, vol. 17, no. 1, January 1970, pp. 51–64.zbMATHMathSciNetGoogle Scholar
  3. 3.
    J. Liadós. Combining Graph Matching and Hough Transform for Hand-Drawn Graphical Document Analysis.
  4. 4.
    B. T. Messmer and H. Bunke. A New Algorithm for error-Tolerant Subgraph Isomorphism Detection, IEEE Trans on PAMI, vol. 20, no. 5, May 1998.Google Scholar
  5. 5.
    Sanfeliu and K.S. Fu, A Distance Measure Between Attributed Relational Graphs for Pattern Recognition. IEEE Trans. on SMC, vol. 13, no. 3. May/June 1983.Google Scholar
  6. 6.
    W.H. Tsai and K.S. Fu. Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis. IEEE Trans. on SMC, vol. 9, no. 12. December 1979.Google Scholar
  7. 7.
  8. 8.
    Hlaoui and S. Wang. Graph Matching for Content-based Image Retrieval Systems. Rapport de Recherche, No. 275, Département de mathématiques et d’informatique, Université de Sherbrooke, 2001.Google Scholar
  9. 9.
    Y. Wang, K. Fan and J. Horng. Genetic-Based Search for Error-Correcting Graph Isomorphism. IEEE Trans. on SMC, Part B, vol. 27, no. 4. August 1997.Google Scholar
  10. 10.
    Huet, A. D. J. Cross and E. R. Hancock. Shape Retrieval by Inexact Graph Matching. ICMCS, vol. 1, 1999, pp. 772–776. Google Scholar
  11. 11.
    X. Jiang, A. Munger, and H. Bunke. On Median Graphs: Properties, Algorithms, and Applications. IEEE Trans on PAMI, vol. 23, no. 10, October 2001.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Adel Hlaoui
    • 1
  • Shengrui Wang
    • 1
  1. 1.DMIUniversity de SherbrookeSherbrooke (Quebec)Canada

Personalised recommendations