A NEW 26-CONNECTED OBJECTS SURFACE TRACKING ALGORITHM AND ITS RELATED PRAM VERSION
Abstract
In this paper, we show the interest of the 3D discrete surface notion for the extraction of object contours. We introduce some notions related to surfaces of 18-and 26-connected objects in 3D discrete images, and a new sequential algorithm to extract the surface and contours of 26-connected objects. Then, we present a PRAM related algorithm to construct the successor function of the surface graph. The complexity of the algorithm is O(log N) for an N×N×N image, with N3 processors.
This work has been supported by the Direction des Recherches, Etudes et Techniques which is gracefully acknowledged, the Project C3 of the French Council for Research CNRS, and by the ESPRIT2 Basic Research Action 6632 “NANA2” of the European Economic Community.