Distance between Attributed Graphs and Function-Described Graphs Relaxing 2nd Order Restrictions

  • René Alquézar
  • Francesc Serratosa
  • Alberto Sanfeiu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1876)


Function-Described Graphs (FDGs) have been introduced as a representation of an ensemble of Attributed Graphs (AGs) for structural pattern recognition and a distance measure using restrictions between AGs and FDGs has been reported. Nevertheless, in real applications, AGs can be distorted by some external noise, and therefore some constraints have to be relaxed. To gain more flexibility and robustness, some local costs may be added to the global cost of the labelling depending on the fulfilment of the graph element constraints of the FDG instead of applying hard binary constraints.


Boolean Function Order Restriction Attribute Graph Graph Element Individual Cost 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    R. Alquezar, A. Sanfeliu and F. Serratosa, “Synthesis of Function-Described Graphs”. Advances in Pattern Recognition, Proc. Joint IAPR Int. Workshops SSPR’98 and SPR’98, Sydney, Australia, Springer LNCS-1451, pp. 112–121, 1998.Google Scholar
  2. 2.
    F. Serratosa and A. Sanfeliu, “Function-Described Graphs applied to 3D object recognition”. In Proceedings ICIAP’97, 9 th Int. Conf. Image Analysis and Processing, Firenze, Italy, Vol. I, pp. 701–708, 1997.Google Scholar
  3. 3.
    F. Serratosa, R. Alquézar and A. Sanfeliu, “Function-Described Graphs for structural pattern recognition”, Technical report DEIM-RR-99-006, Universität Rovira i Virgili, Tarragona, Spain, 1999.Google Scholar
  4. 4.
    A. Sanfeliu and K. Fu, “A distance measure between attributed relational graphs for pattern recognition”, IEEE Transactions on Systems, Man and Cybernetics, vol. 13, pp. 353–362, 1983.zbMATHGoogle Scholar
  5. 5.
    A.K.C. Wong and M. You, “Entropy and distance of random graphs with application to structural pattern recognition”, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 7, pp. 599–609, 1985.zbMATHCrossRefGoogle Scholar
  6. 6.
    F. Serratosa, R. Alquézar and A. Sanfeliu, “Efficient algorithms for matching attributed graphs and function-described graphs”, Proceedings 15 th Int. Conf. Pattern Recognition, Barcelona, Spain, 2000.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • René Alquézar
    • 1
  • Francesc Serratosa
    • 2
  • Alberto Sanfeiu
    • 3
  1. 1.Dept. Llenguatges i Sistemes InformàticsUniversität Politècnica de CatalunyaSpain
  2. 2.Dept. Enginyeria Informàtica i MatemàtiquesUniversität Rovira i VirgiliSpain
  3. 3.Inst. de Robòtica i InformàticaUniversität Politècnica de CatalunyaSpain

Personalised recommendations