Abstract
An important concept in combinatorial image analysis is that of gap. In this paper we derive a simple formula for the number of gaps in a 2D binary picture. Our approach is based on introducing the notions of free vertex and free edge and studying their properties from point of view of combinatorial topology. The number of gaps characterizes the topological structure of a binary picture and is of potential interest in property-based image analysis.
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
Andres, E., Acharya, R., Sibata, C.: Discrete analytical hyperplanes. Graphical Models and Image Processing 59, 302–309 (1997)
Andres, E., Nehlig, P., Françon, J.: Tunnel-free supercover 3D polygons and polyhedra. In: Fellner, D., Szirmay-Kalos, L. (Guest eds.) EUROGRAPHICS 1997, pp. C3–C13 (1997)
Arenas, F.G.: Alexandroff spaces. Acta Mathematica, University of Comenianae LXVIII-1, 17–25 (1999)
Barneva, R.P., Brimkov, V.E., Nehlig, P.: Thin discrete triangular meshes. Theoretical Computer Science 246(1-2), 73–105 (2000)
Brimkov, V.E., Andres, E., Barneva, R.P.: Object discretizations in higher dimensions. Pattern Recognition Letters 23, 623–636 (2002)
Brimkov, V.E., Barneva, R.P., Nehlig, P.: Minimally thin discrete triangulations. In: Kaufman, A., Yagel, R., Chen, M. (eds.) Volume Graphics, ch. 3, pp. 51–70. Springer, Heidelberg (2000)
Brimkov, V.E., Maimone, A., Nordo, G., Barneva, R., Klette, R.: The number of gaps in binary pictures. In: Bebis, G., Boyle, R., Koracin, D., Parvin, B. (eds.) ISVC 2005. LNCS, vol. 3804, pp. 35–42. Springer, Heidelberg (2005)
Cohen-Or, D., Kaufman, A.: 3D line voxelization and connectivity control. IEEE Computer Graphics and Applications 17(6), 80–87 (1997)
Kaufman, A., Cohen, D., Yagel, R.: Volume graphics. IEEE Computer 26(7), 51–64 (1993)
Klette, R., Rosenfeld, A.: Digital Geometry - Geometric Methods for Digital Picture Analysis. Morgan Kaufmann, San Francisco (2004)
Kong, T.Y.: Digital topology. In: Davis, L.S. (ed.) Foundations of Image Understanding, pp. 33–71. Kluwer, Boston (2001)
Kovalevsky, V.A.: Finite topology as applied to image analysis. Computer Vision, Graphics and Image Processing 46(2), 141–161
Latecki, L., Eckhardt, U., Rosenfeld, A.: Well-composed sets. Computer Vision and Vision Understanding 61, 70–83 (1995)
Mylopoulos, J.P., Pavlidis, T.: On the topological properties of quantized spaces. I. The notion of dimension. J. ACM 18, 239–246 (1971)
Pavlidis, T.: Algorithms for Graphics and Image Processing. Computer Science Press, Rockville (1982)
Rosenfeld, A.: Arcs and curves in digital pictures. Journal of the ACM 18, 81–87 (1973)
Rosenfeld, A.: Adjacency in digital pictures. Information and Control 26, 24–33 (1974)
Voss, K.: Discrete Images, Objects, and Functions in Z n. Springer, Berlin (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brimkov, V.E., Maimone, A., Nordo, G. (2006). Counting Gaps in Binary Pictures. In: Reulke, R., Eckardt, U., Flach, B., Knauer, U., Polthier, K. (eds) Combinatorial Image Analysis. IWCIA 2006. Lecture Notes in Computer Science, vol 4040. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11774938_2
Download citation
DOI: https://doi.org/10.1007/11774938_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35153-5
Online ISBN: 978-3-540-35154-2
eBook Packages: Computer ScienceComputer Science (R0)