Contour tracking of 3D 26-connected discrete objects

The goal of this paper is to introduce a surface tracking algorithm of 26-connected objects and to apply it to contour tracking of discrete 3D digital objects. We show that border notion is insufficient to make a distinction between outer points and points of its cavities. Then, we introduce 3D discrete surfaces modelization. A classical surface tracking algorithm is introduced for 6 and 18-connected objects. We propose an original contour tracking algorithm based on the surface tracking one, and an extension to 26-connected objects. Two parallelization strategies of the contour extraction algorithm are then proposed, one using a data structure of list, the other one, a spatial distribution of the image over the processors.

[1]  Sargur N. Srihari,et al.  Boundary Detection in Multidimensions , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Azriel Rosenfeld,et al.  Parallel processing of region boundaries , 1989, Pattern Recognit..

[3]  Alan Bryant,et al.  Following boundaries of discrete binary objects in space , 1990, Pattern Recognit..

[4]  Larry S. Davis,et al.  Efficient Parallel Processing of Image Contours , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  Gabor T. Herman,et al.  The theory, design, implementation and evaluation of a three-dimensional surface detection algorithm , 1980, SIGGRAPH '80.