On the complexity of submap isomorphism and maximum common submap problems

Generalized maps describe the subdivision of objects in cells and are widely used to model 2D and 3D images. In this context, several pattern recognition tasks involve solving submap isomorphism problems (to decide if a map is included in another map) or, more generally, computing maximum common submaps (to measure the distance between two maps). Recently, we have described a polynomial-time algorithm for solving the submap isomorphism problem when the pattern map is connected. In this paper, we show that submap isomorphism is NP -complete when the pattern map is not connected. Then, we characterize the inherent difficulty of submap isomorphism with respect to the number of connected components. We show that it is Fixed-Parameter Tractable (FPT) and we give an FPT algorithm for submap isomorphism. We experimentally compare this algorithm with a state-of-the-art subgraph isomorphism algorithm for searching for patterns in an image and we show that it is both more accurate and more efficient. Finally, we study the complexity of the maximum common submap problem, and we show that it is NP -hard even though we restrict the problem to the search of common connected submaps. HighlightsWe show that submap isomorphism is NP-complete.We give a Fixed Parameter Tractable algorithm for submap isomorphism.We experimentally evaluate it to search for patterns in segmented images.We show that maximum common connected submap is NP-hard.

[1]  T. Akutsu.  A Polynomial Time Algorithm for Finding a Largest Common Subgraph of almost Trees of Bounded Degree , 1993 .

[2]  Daniel Méneveaux,et al.  A Hierarchical Topology‐Based Model for Handling Complex Indoor Scenes , 2006, Comput. Graph. Forum.

[3]  Maciej M. SysŁ.  The subgraph isomorphism problem for outerplanar graphs , 1982 .

[4]  Eugene M. Luks,et al.  Isomorphism of graphs of bounded valence can be tested in polynomial time , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[5]  Ina Koch,et al.  Enumerating all connected maximal common subgraphs in two graphs , 2001, Theor. Comput. Sci..

[6]  Donald E. Knuth,et al.  The Problem of Compatible Representatives , 1992, SIAM J. Discret. Math..

[7]  Christine Solnon,et al.  AllDifferent-based filtering for subgraph isomorphism , 2010, Artif. Intell..

[8]  W. Kropatsch.  Building irregular pyramids by dual-graph contraction , 1995 .

[9]  Luc Brun,et al.  Image Segmentation with Topological Maps and Inter-pixel Representation , 1998, J. Vis. Commun. Image Represent..

[10]  Christine Solnon,et al.  On the Complexity of Submap Isomorphism , 2013, GbRPR.

[11]  David Zuckerman,et al.  Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .

[12]  Azriel Rosenfeld,et al.  Adjacency in Digital Pictures , 1974, Inf. Control..

[13]  Christophe Fiorio,et al.  Topological model for two-dimensional image representation: definition and optimal extraction algorithm , 2004, Comput. Vis. Image Underst..

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[15]  Maurice Bruynooghe,et al.  A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics , 2013, Annals of Mathematics and Artificial Intelligence.

[16]  PASCAL LIENHARDT,et al.  N-Dimensional Generalized Combinatorial Maps and Cellular Quasi-Manifolds , 1994, Int. J. Comput. Geom. Appl..

[17]  A. Trémeau,et al.  Regions adjacency graph applied to color image segmentation , 2000, IEEE Trans. Image Process..

[18]  Christine Solnon,et al.  A Polynomial Algorithm for Submap Isomorphism , 2009, GbRPR.

[19]  Yll Haxhimusa,et al.  Representations for Cognitive Vision:A Review of Appearance-Based, Spatio-Temporal, and Graph-Based Approaches , 2008 .

[20]  Christine Solnon,et al.  From maximum common submaps to edit distances of generalized maps , 2012, Pattern Recognit. Lett..

[21]  Jan Ramon,et al.  Frequent subgraph mining in outerplanar graphs , 2006, KDD '06.

[22]  Frederic Dorn,et al.  Planar Subgraph Isomorphism Revisited , 2009, STACS.

[23]  John E. Hopcroft,et al.  Linear time algorithm for isomorphism of planar graphs (Preliminary Report) , 1974, STOC '74.

[24]  Tatsuya Akutsu,et al.  A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree , 2012, MFCS.

[25]  D. Matula.  Subtree Isomorphism in O(n5/2) , 1978 .

[26]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[27]  Horst Bunke,et al.  Optimal quadratic-time isomorphism of ordered graphs , 1999, Pattern Recognit..

[28]  Christine Solnon,et al.  Polynomial algorithms for subisomorphism of nD open combinatorial maps , 2011, Comput. Vis. Image Underst..

[29]  Kaspar Riesen,et al.  Efficient Suboptimal Graph Isomorphism , 2009, GbRPR.

[30]  David Eppstein,et al.  The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems , 1994, GD.

[31]  David Lichtenstein,et al.  Planar Formulae and Their Uses , 1982, SIAM J. Comput..

[32]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[33]  Horst Bunke,et al.  A graph distance metric based on the maximal common subgraph , 1998, Pattern Recognit. Lett..

[34]  Christine Solnon,et al.  A parametric filtering algorithm for the graph isomorphism problem , 2008, Constraints.

[35]  Christine Solnon,et al.  Measuring the Distance of Generalized Maps , 2011, GbRPR.