Abstract
A 2D topological map allows one to fully describe the topology of a labeled image. In this paper we introduce new tools for comparing the topology of two labeled images. First we define 2D topological map isomorphism. We show that isomorphic topological maps correspond to homeomorphic embeddings in the plane and we give a polynomial-time algorithm for deciding of topological map isomorphism. Then we use this notion to give a generic definition of multi-label simple transformation as a set of transformations of labels of pixels which does not modify the topology of the labeled image. We illustrate the interest of multi-label simple transformation by generating look-up tables of small transformations preserving the topology.
Chapter PDF
References
Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley (1974)
Bazin, P.-L., Ellingsen, L.M., Pham, D.L.: Digital homeomorphisms in deformable registration. In: Karssemeijer, N., Lelieveldt, B. (eds.) IPMI 2007. LNCS, vol. 4584, pp. 211–222. Springer, Heidelberg (2007)
Damiand, G., Bertrand, Y., Fiorio, C.: Topological model for two-dimensional image representation: Definition and optimal extraction algorithm. Computer Vision and Image Understanding 93(2), 111–154 (2004)
Damiand, G., Dupas, A., Lachaud, J.-O.: Combining topological maps, multi-label simple points, and minimum-length polygons for efficient digital partition model. In: Aggarwal, J.K., Barneva, R.P., Brimkov, V.E., Koroutchev, K.N., Korutcheva, E.R. (eds.) IWCIA 2011. LNCS, vol. 6636, pp. 56–69. Springer, Heidelberg (2011)
Damiand, G., Solnon, C., de la Higuera, C., Janodet, J.-C., Samuel, E.: Polynomial algorithms for subisomorphism of nd open combinatorial maps. Computer Vision and Image Understanding 115(7), 996–1010 (2011)
Dupas, A., Damiand, G., Lachaud, J.-O.: Multi-label simple points definition for 3D images digital deformable model. In: Brlek, S., Reutenauer, C., Provençal, X. (eds.) DGCI 2009. LNCS, vol. 5810, pp. 156–167. Springer, Heidelberg (2009)
Gosselin, S., Damiand, G., Solnon, C.: Efficient search of combinatorial maps using signatures. Theoretical Computer Science 412(15), 1392–1405 (2011)
Khalimsky, E., Kopperman, R., Meyer, P.R.: Computer graphics and connected topologies on finite ordered sets. Topology and its Applications 36, 1–17 (1990)
Le Bodic, P., Locteau, H., Adam, S., Héroux, P., Lecourtier, Y., Knippel, A.: Symbol detection using region adjacency graphs and integer linear programming. In: Proc. of ICDAR, Barcelona, Spain, pp. 1320–1324. IEEE Computer Society (July 2009)
Lienhardt, P.: N-Dimensional generalized combinatorial maps and cellular quasi-manifolds. International Journal of Computational Geometry and Applications 4(3), 275–324 (1994)
Mazo, L.: A framework for label images. In: Ferri, M., Frosini, P., Landi, C., Cerri, A., Di Fabio, B. (eds.) CTIC 2012. LNCS, vol. 7309, pp. 1–10. Springer, Heidelberg (2012)
Rosenfeld, A.: Adjacency in digital pictures. Information and Control 26(1), 24–33 (1974)
Rosenfeld, A.: Digital Topology. The American Mathematical Monthly 86(8), 621–630 (1979)
Trémeau, A., Colantoni, P.: Regions adjacency graph applied to color image segmentation. IEEE Transactions on Image Processing 9, 735–744 (2000)
Worboys, M.: The maptree: A fine-grained formal representation of space. In: Xiao, N., Kwan, M.-P., Goodchild, M.F., Shekhar, S. (eds.) GIScience 2012. LNCS, vol. 7478, pp. 298–310. Springer, Heidelberg (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Damiand, G., Roussillon, T., Solnon, C. (2014). 2D Topological Map Isomorphism for Multi-Label Simple Transformation Definition. In: Barcucci, E., Frosini, A., Rinaldi, S. (eds) Discrete Geometry for Computer Imagery. DGCI 2014. Lecture Notes in Computer Science, vol 8668. Springer, Cham. https://doi.org/10.1007/978-3-319-09955-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-09955-2_4
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09954-5
Online ISBN: 978-3-319-09955-2
eBook Packages: Computer ScienceComputer Science (R0)