Abstract
In order to use structural techniques from graph-based pattern recognition, a first necessary step consists in extracting a graph in an automatic way from an image. We propose to extract plane graphs, because of algorithmic properties these graphs have for isomorphism related problems. We also consider the problem of extracting semantically well-founded graphs as a compression issue: we get simple graphs from which can be rebuilt images similar to the initial image. The technique we introduce consists in segmenting the original image, extracting interest pixels on the segmented image, then converting these pixels into pointels, which in turn can be related by region-based triangulation. We show the feasibility and interest of this approach in a series of experiments.
This work was partially supported by an ANR grant BLANC 07-1-184534 (project Sattic), and the IST Programme of the European Community, under the PASCAL 2 Network of Excellence, IST–2006-216886.
Chapter PDF
Similar content being viewed by others
References
Bres, S., Jolion, J.-M.: Detection of interest points for image indexation. In: Huijsmans, D.P., Smeulders, A.W.M. (eds.) VISUAL 1999. LNCS, vol. 1614, pp. 427–434. Springer, Heidelberg (1999)
Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. Pattern Recogn. and Artificial Intell. 18(3), 265–298 (2004)
Cori, R.: Un code pour les graphes planaires et ses applications. In: Astérisque, vol. 27, Soc. Math. de France, Paris, France (1975)
Damiand, G., de la Higuera, C., Janodet, J.-C., Samuel, E., Solnon, C.: A polynomial algorithm for subisomorphism of open plane graphs. In: MLG 2009 electronic proceedings (2009)
Damiand, G., de la Higuera, C., Janodet, J.-C., Samuel, E., Solnon, C.: A polynomial algorithm for submap isomorphism: Application to searching patterns in images. In: Torsello, A., Escolano, F., Brun, L. (eds.) GbRPR 2009. LNCS, vol. 5534, pp. 102–112. Springer, Heidelberg (2009)
Fàry, I.: On straight-line representation of planar graphs. Acta Scientiarum Mathematicarum 11, 229–233 (1948)
Finch, A.M., Wilson, R.C., Hancock, E.R.: Matching delaunay graphs. Pattern Recognition 30(1), 123–140 (1997)
Harris, C., Stephens, M.: A combined corner and edge detection. In: Proceedings of the Fourth Alvey Vision Conference, pp. 147–151 (1988)
Jiang, X., Bunke, H.: Optimal quadratic-time isomorphism of ordered graphs. Pattern Recognition 32(7), 1273–1283 (1999)
Kandel, A., Bunke, H., Last, M. (eds.): Applied Graph Theory in Computer Vision and Pattern Recognition. Studies in Computational Intelligence, vol. 52. Springer, Heidelberg (2007)
Kropatsch, W., Macho, H.: Finding the structure of connected components using dual irregular pyramids. In: Proc. DGCI 1995, pp. 147–158 (1995)
Lienhardt, P.: Topological models for boundary representation: a comparison with n-dimensional generalized maps. Computer-Aided Design 23(1), 59–82 (1991)
Lowe, D.G.: Distinctive image features from scale-invariant keypoints. International Journal of Computer Vision 60(2), 91–110 (2004)
Lozano, M.A., Escolano, F.: Protein classification by matching and clustering surface graphs. Pattern Recognition 39(4), 539–551 (2006)
Martin, D., Fowlkes, C., Tal, D., Malik, J.: A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In: Proc. 8th Int. Conf. Computer Vision, July 2001, vol. 2, pp. 416–423 (2001) http://www.eecs.berkeley.edu/Research/Projects/CS/vision/grouping/segbench/
Riesen, K., Bunke, H.: IAM graph database repository for graph based pattern recognition and machine learning. In: da Vitoria Lobo, N., Kasparis, T., Roli, F., Kwok, J.T., Georgiopoulos, M., Anagnostopoulos, G.C., Loog, M. (eds.) S+SSPR 2008. LNCS, vol. 5342, pp. 287–297. Springer, Heidelberg (2008)
Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Image Vision Comput. 27(7), 950–959 (2009)
Rosenfeld, A.: Adjacency in digital pictures. Infor. and Control 26(1), 24–33 (1974)
Santo, M.D., Foggia, P., Sansone, C., Vento, M.: A large database of graphs and its use for benchmarking graph isomorphism algorithms. Pattern Recognition Letters 24(8), 1067–1079 (2003)
Tutte, W.: A census of planar maps. Canad. J. Math. 15, 249–271 (1963)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Samuel, É., de la Higuera, C., Janodet, JC. (2010). Extracting Plane Graphs from Images. In: Hancock, E.R., Wilson, R.C., Windeatt, T., Ulusoy, I., Escolano, F. (eds) Structural, Syntactic, and Statistical Pattern Recognition. SSPR /SPR 2010. Lecture Notes in Computer Science, vol 6218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14980-1_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-14980-1_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14979-5
Online ISBN: 978-3-642-14980-1
eBook Packages: Computer ScienceComputer Science (R0)