Abstract
The paper describes the combination a multi-views approach to represent connected components of 2D binary images. The approach is based on the Object Connectivity Graph (OCG), which is a sub-graph of the connectivity graph generated by the Discrete Cylindrical Algebraic Decomposition(DCAD) performed in the 2D discrete space. This construction allows us to find the number of connected components, to determine their connectivity degree, and to solve visibility problem. We show that the CAD construction, when performed on two orthogonal views, supply information to avoid ambiguities in the interpretation of each image component. The implementation of the algorithm is outlined and the computational complexities is given.
Chapter PDF
Similar content being viewed by others
References
Barcucci, E., Del Lungo, A., Nivat, M., Pinzani, R.: Reconstructing convex polymi-noes from horizontal and vertical projections. Theoretical Computer Science 155 (1996) 321â347. 337
Herman, G. T.: Image Reconstruction from Projections: The Fundamentals of Computerized Tomography. Academic Press (New York) (1980). 337
Chella, A., Di GesĂș, V., Infantino, I., Intravaia, D., Valenti, C.: Cooperating Strat-egy for Objects Recognition. in Lecture Notes in Computer Science book âShape, contour and grouping in computer visionâ, Springer Verlag, 1681 (1999) 264â274. 337
Collins, G. E.: Quantifier elimination for real closed fields by cylindrical algebraic decomposition. Proc.of the Second GI Conference on Automata Theory and Formal Languages, Springer Lect.Notes Comp. SCi. 33 (1975) 515â532. 337
Di GesĂș, V. and Renda, R.: An algorithm to analyse connected components of binary images. Geometrical Problems of Image Processing 4 (1991) 87â93. 337, 338
Arnon, D. S., McCallum, S.: A polynomial-time algorithm for the topological type of a real algebraic curve. Journal Symb. Comp. 5 (1988) 213â236. 337
Arnborg, S., Feng, H.: Algebraic decomposition of regular curves. Journal Symb. Comp. 5 (1988) 131â140. 337
Françon, J. M.: Sur la topologie dâun plan arithmĂ©tique. Theoretical Computer Science 156 (1996) 31â40. 337
Khalimsky, E. D., Kopperman, R., Meyer P. R.: Computer graphics and connected topologies on finite ordered sets. Topology and Applications 36 (1990) 1â17. 337
Chassery, J. M. and Montanvert, A.: GeĂłmetrie discreĂšte en analyse dâimages. HermeĆ, Paris (1991). 338
Kovalevsky, V. A.: Finite Topology as Applied to Image Analysis. Computer Vi-sion, Graphics, and Image Processing 45 (1989) 141â161. 338
Chiavetta, F., Di GesĂș, V., and Renda, R.: A Parallel Algorithm to analyse con-nected components on binary images. International Journal of Pattern Recognition and Artificial Intelligence 6(2,3) (1992) 315â333. 345
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Vito, G., Cesare, V. (2000). Representing 2D Digital Objects. In: Borgefors, G., Nyström, I., di Baja, G.S. (eds) Discrete Geometry for Computer Imagery. DGCI 2000. Lecture Notes in Computer Science, vol 1953. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44438-6_28
Download citation
DOI: https://doi.org/10.1007/3-540-44438-6_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41396-7
Online ISBN: 978-3-540-44438-1
eBook Packages: Springer Book Archive