A fast implementation of 3-D binary morphological transformations

This paper proposes a fast algorithm for implementing the basic operation of Minkowski addition for the special case of binary threedimensional (3-D) images, using 3-D structuring elements of arbitrary size and shape. The application of the proposed algorithm for all the other morphological transformations is straightforward, as they can all be expressed in terms of Minkowski addition. The efficiency of the algorithm is analyzed and some experimental results of its application are presented. As shown, the efficiency of the algorithm increases with the size of the structuring element.