Abstract
A branch-and-bound algorithm for matching Attributed Graphs (AGs) with Second-Order Random Graphs (SORGs) is presented. We show that the search space explored by this algorithm is drastically reduced by using the information of the 2nd-order joint probabilities of vertices of the SORGs. A SORG is a model graph, described elsewhere, that contains 1st and 2nd-order order probabilities of attribute relations between elements for representing a set of AGs compactly. In this work, we have applied SORGs and the reported algorithm to the recognition of real-life objects on images and the results show that the use of 2nd-order relations between vertices is not only useful to decrease the run time but also to increase the correct classification ratio.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Sanfeliu, 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 18(3), 375–396 (2004)
Serratosa, F., Sanfeliu, A.: Distance measures between Attributed Graphs and Secondorder Random Graphs. In: Fred, A., Caelli, T.M., Duin, R.P.W., Campilho, A.C., de Ridder, D. (eds.) SSPR&SPR 2004. LNCS, vol. 3138, pp. 1135–1144. Springer, Heidelberg (2004)
Serratosa, F., Alquézar, R., Sanfeliu, A.: Synthesis of function-described graphs and clustering of attributed graphs. Int. Journ. of Pattern Recognition and Artificial Intelligence 16(6), 621–655 (2002)
Serratosa, F., Alquézar, R., Sanfeliu, A.: Function-Described Graphs for modeling objects represented by attributed graphs. Pattern Recognition 36(3), 781–798 (2003)
Sengupta, K., Boyer, K.: Organizing large structural modelbases. PAMI 17, 321–332 (1995)
Wong, A.K.C., You, M.: Entropy and distance of random graphs with application to structural pattern recognition. IEEE PAMI 7, 599–609 (1985)
Bunke, H.: Error-tolerant graph matching: a formal framework and algorithms. In: Amin, A., Pudil, P., Dori, D. (eds.) SPR 1998 and SSPR 1998. LNCS, vol. 1451, pp. 1–14. Springer, Heidelberg (1998)
Wong, A.K.C., You, M., Chan, S.C.: An algorithm for graph optimal monomorphism. IEEE Trans. on Systems, Man and Cyber 20, 628–636 (1990)
Peleg, S., Rosenfeld, A.: Determining compatibility coefficients for curve enchancement relaxation processes. IEEE Transactions on Systems, Man and Cybernetics 8, 548–555 (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Serratosa, F., Sanfeliu, A. (2005). Matching Attributed Graphs: 2nd-Order Probabilities for Pruning the Search Tree. In: Marques, J.S., Pérez de la Blanca, N., Pina, P. (eds) Pattern Recognition and Image Analysis. IbPRIA 2005. Lecture Notes in Computer Science, vol 3523. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11492542_17
Download citation
DOI: https://doi.org/10.1007/11492542_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26154-4
Online ISBN: 978-3-540-32238-2
eBook Packages: Computer ScienceComputer Science (R0)