A fast implementation of 3-D binary morphological transformations
A fast implementation of 3-D binary morphological transformations
复制标题
3-D 二值形态变换的快速实现
DOI：
--
复制
发表时间：
2000
影响因子：
10.6
通讯作者：
I. Pitas
中科院分区：
文献类型：
--
作者：
N. Nikopoulos;I. Pitas
针对二值三维图像的特殊情况，利用任意大小和形状的三维结构元素，提出了一种快速实现闵可夫斯基加法基本运算的算法。对于所有其他形态变换，所提出的算法的应用是直接的，因为它们都可以用闵可夫斯基加法表示。分析了该算法的效率，并给出了一些应用的实验结果。如图所示，算法的效率随着结构单元的大小而增加。
This paper proposes a fast algorithm for implementing the basic operation of Minkowski addition for the special case of binary three-dimensional (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.