Dept. of Electr. Eng., Washington Univ., Seattle, WA.
IEEE Trans Image Process. 1995;4(3):335-45. doi: 10.1109/83.366481.
A new group of recursive morphological transforms on the discrete space Z(2) are discussed. The set of transforms include the recursive erosion transform (RET), the recursive dilation transform (RDT), the recursive opening transform (ROT), and the recursive closing transform (RCT), The transforms are able to compute in constant time per pixel erosions, dilations, openings, and closings with all sized structuring elements simultaneously. They offer a solution to some vision tasks that need to perform a morphological operation but where the size of the structuring element has to be determined after a morphological examination of the content of the image. The computational complexities of the transforms show that the recursive erosion and dilation transform can be done in N+2 operations per pixel, where N is the number of pixels in the base structuring element. The recursive opening and closing transform can be done in 14N operations per pixel based on experimental results.
讨论了离散空间 Z(2)上的一组新的递归形态学变换。该变换集包括递归腐蚀变换（RET）、递归膨胀变换（RDT）、递归开运算变换（ROT）和递归闭运算变换（RCT）。这些变换能够以每个像素的常数时间进行腐蚀、膨胀、开运算和闭运算，同时使用所有大小的结构元素。它们为一些需要执行形态学操作但结构元素的大小必须在对图像内容进行形态学检查后确定的视觉任务提供了一种解决方案。变换的计算复杂度表明，递归腐蚀和膨胀变换可以在每个像素 N+2 次运算中完成，其中 N 是基础结构元素的像素数。根据实验结果，递归开运算和闭运算可以在每个像素 14N 次运算中完成。
