Abstract
Combinatorial maps are widely used in the field of computer vision, including image segmentation, medical image analysis and mobile robotics. Many practical problems can be formulated as the combinatorial map matching problem. This paper addresses the problem of inexact matching between labeled combinatorial maps. We define Joint Tree of combinatorial maps, and prove it can be used to decide of map isomorphism. In this way, the map matching problem is relaxed to the Joint Tree matching problem, which can be solved in polynomial time. Our approach provides a novel way to explore the problem of combinatorial map matching.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Jones, G.A., Singerman, D.: Theory of maps on orientable surfaces. Proc. Lond. Math. Soc. 3, 273–307 (1978)
Brun, L., Kropatsch, W.: Contraction kernels and combinatorial maps. Pattern Recogn. Lett. 24(8), 1051–1057 (2003)
Brun, L., Kropatsch, W.: Contains and inside relationships within combinatorial pyramids. Pattern Recogn. 39(4), 515–526 (2006)
Damiand, G.: Topological model for 3D image representation: definition and incremental extraction algorithm. Comput. Vis. Image Underst. 109(3), 260–289 (2008)
Dupas, A., Damiand, G.: First Results for 3D image segmentation with topological map. In: Coeurjolly, D., Sivignon, I., Tougne, L., Dupont, F. (eds.) DGCI 2008. LNCS, vol. 4992, pp. 507–518. Springer, Heidelberg (2008)
Heimann, T., MeinZer, H.P.: Statistical shape models for 3D medical image segmentation: a review. Med. Image Anal. 13(4), 543–563 (2009)
Dufourd, D., Chatila, R.: Combinatorial maps for simultaneous localization and map building(SLAM). In: IEEE/RSJ International Conference on Intelligent Robots and Systems, pp 1047–1052 (2004)
Teng, Z., Kang, D.J.: Disjunctive normal form of weak classifiers for online learning based object tracking. In: Proceedings of VISAPP, vol. 2, pp. 138–146. SciTePress (2013)
Ramon, G.D., Jorge, G., Jesus, J.O., Lionello, P.: Some new trends in chemical graph theory. Chem. Rev. 108(3), 1127–1169 (2008)
Cori, R.: Computation of the automorphism group of a topological graph embedding. Technical report (1985)
Liu, Y.P.: Advances in Combinatorial Maps. Northen Jiaotong University Press, Beijing (2003). (In Chinese)
Wang, T., Liu, Y.P.: Implements of some new algorithms for combinatorial maps. OR Trans. 12(2), 58–66 (2008)
Gossenlin, S., Damiand, G., Solnon, C.: Efficient search of combinatorial maps using signatures. Theor. Comput. Sci. 412(15), 1392–1405 (2011)
Damiand, G., Solnon, C., Higuera, C., Jandodet, J.-C., Samuel, E.: Polynomial algorithms for subisomorphism of nD open combinatorial maps. Comput. Vis. Image Underst. 1157, 996–1010 (2011)
Wang, T., Dai, G.J., Xu, D.: A polynomial algorithm for submap isomorphism of general maps. Pattern Recogn. Lett. 32, 1100–1107 (2011)
Combier, C., Damiand, G., Solnon, C.: Measuring the distance of generalized maps. In: Jiang, X., Ferrer, M., Torsello, A. (eds.) GbRPR 2011. LNCS, vol. 6658, pp. 82–91. Springer, Heidelberg (2011)
Combier, C., Damiand, G., Solnon, C.: From maximum common submaps to edit distances of generalized maps. Pattern Recogn. Lett. 33(25), 2020–2028 (2012)
Wang, T., Dai, G.J., Ni, B., Xu, D., Siewe, F.: A distance measure between labeled combinatorial maps. Comput. Vis. Image Underst. 116(12), 1168–1177 (2012)
Bille, P.: A survey on tree edit distance and related problems. Theor. Comput. Sci. 337(1), 217–239 (2005)
Acknowledgements
This work is supported by the National Nature Science Foundation of China (Nos. 61300071, 61272352, 61100142) and the Fundamental Research Funds for the Central Universities (No. 2012JBM040).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Wang, T., Lang, C., Feng, S. (2014). Joint Tree of Combinatorial Maps. In: Peng, WC., et al. Trends and Applications in Knowledge Discovery and Data Mining. PAKDD 2014. Lecture Notes in Computer Science(), vol 8643. Springer, Cham. https://doi.org/10.1007/978-3-319-13186-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-13186-3_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13185-6
Online ISBN: 978-3-319-13186-3
eBook Packages: Computer ScienceComputer Science (R0)