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. © Springer-Verlag Berlin Heidelberg 2000.
|Title of host publication||Discrete Geometry for Computer Imagery, 9th InternationalConference,DGCI 2000 Uppsala,Sweden,December 13–15,2000 Proceedings|
|Number of pages||11|
|Publication status||Published - 2000|
|Name||LECTURE NOTES IN COMPUTER SCIENCE|
- Theoretical Computer Science
- General Computer Science