Abstract
In this paper, we propose to represent shapes by graphs. Based on graphic primitives extracted from the binary images, attributed relational graphs were generated. Thus, the nodes of the graph represent shape primitives like vectors and quadrilaterals while arcs describing the mutual primitives relations. To be invariant to transformations such as rotation and scaling, relative geometric features extracted from primitives are associated to nodes and edges as attributes. Concerning graph matching, due to the fact of NP-completeness of graph-subgraph isomorphism, a considerable attention is given to different strategies of inexact graph matching. We also present a new scoring function to compute a similarity score between two graphs, using the numerical values associated to the nodes and edges of the graphs. The adaptation of a greedy graph matching algorithm with the new scoring function demonstrates significant performance improvements over traditional exhaustive searches of graph matching.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bunke, H.: Error Correcting Graph Matching: On the Influence of the Underlying Cost Function. IEEE transactions on Pattern Analysis and Machine Intelligence 21, 917–922 (1999)
Lam, L., Lee, S.W., Suen, C.Y.: Thinning Methodologies-A Comprehensive Survey. IEEE Transactions on Pattern Analysis and Machine Intelligence 14, 869–885 (1992)
Ruberto, C.D., Rodriguez, G., Casta, L.: Recognition of shapes by morphological attributed relational graphs (2002), citeseer.ist.psu.edu/535355.html
Cordella, L.P., Vento, M.: Symbol Recognition in Documents: A Collection of Techniques. International Journal of Document Analysis and Recognition 3, 73–88 (2000)
Bunke, H.: Recent developments in graph matching. In: The Proc. of 15th Int. Conf. Pattern Recognition, vol. 2, pp. 117–124 ( 2000)
Mehlhorn, K.: Graph Algorithms and NP-Completeness, vol. 2. Springer-Verlag, Berlin Heidelberg (1984)
Dickinson, P.J., Bunke, H., Dadej, A., Kraetzl, M.: On Graphs with Unique Node Labels. In: Hancock, E.R., Vento, M. (eds.) GbRPR 2003. LNCS, vol. 2726, pp. 13–23. Springer, Heidelberg (2003)
Ullman, J.R.: An Algorithm for Subgraph Isomorphism. Journal of the Association for Computing Machinery 23, 31–42 (1976)
Schmidt, D.C., Druffel, L.E.: A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices. Journal of the Association for Computing Machinery 23, 433–445 (1976)
McKay, B.D.: Practical graph isomorphism. Congr. Numerantium 30, 45–87 (1981)
Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: An improved algorithm for matching large graphs. In: Proc. 3rd IAPR –TC15 Workshop Graph Based Representations in Pattern Recognition, pp. 149-159 ( 2001)
Foggia, P., Sansone, C., Vento, M.: A performance comparison of five algorithms for graph isomorphism. In: The 3rd IAPR-TC15 Workshop on Graph-Based Representations in Pattern Recognition, Cuen, 188–199 ( 2001)
Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty Years of Graph Matching in Pattern Recognition. The. International Journal of Pattern Recognition and Artificial Intelligence 18, 265–298 (2004)
Wall, K., Danielsson, P.: A fast sequential method for polygonal approximation of digitized curves. Computer Vision, Graphics and Image Processing 28, 220–221 (1984)
Ramel, J.Y., Vincent, N., Emptoz, H.: A structural representation for understanding line - drawing images. International Journal on Document Analysis and Recognition 3, 58–66 (2000)
Champin, P.A., Solnon, C.: Measuring the Similarity of Labelled Graphs. In: Proceedings of the 5th International Conference on Case-Based, pp. 80–95. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Qureshi, R.J., Ramel, JY., Cardot, H. (2007). Graph Based Shapes Representation and Recognition. In: Escolano, F., Vento, M. (eds) Graph-Based Representations in Pattern Recognition. GbRPR 2007. Lecture Notes in Computer Science, vol 4538. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72903-7_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-72903-7_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72902-0
Online ISBN: 978-3-540-72903-7
eBook Packages: Computer ScienceComputer Science (R0)