WATERSHEDS IN DIGITAL SPACES - AN EFFICIENT ALGORITHM BASED ON IMMERSION SIMULATIONS
WATERSHEDS IN DIGITAL SPACES - AN EFFICIENT ALGORITHM BASED ON IMMERSION SIMULATIONS
复制标题
DOI：
10.1109/34.87344
复制
发表时间：
1991-06-01
影响因子：
23.6
通讯作者：
SOILLE, P
中科院分区：
文献类型：
--
作者：
VINCENT, L;SOILLE, P
本文介绍了一种快速、灵活的计算数字灰度图像分水岭的算法。 本文首先对流域及其相关概念进行了回顾，并对流域的主要确定方法进行了讨论。 本算法是基于一个浸泡过程的类比，其中洪水的图片中有效地模拟使用一个队列的像素。 它被详细描述并以伪C语言提供。 我们证明了该算法的准确性是上级优于现有的实现。 此外，它表明，它的适应任何类型的数字网格和它的推广到n维图像，甚至图形是直接的。 此外，它的最强点是它比任何其他分水岭算法都快。 该算法的应用方面的图片分割的MR图像和数字高程模型。 最后给出了一个三维分水岭的实例。 最后，给出了如何使用图上的分水岭解决复杂分割任务的一些想法。
In this paper, a fast and flexible algorithm for computing watersheds in digital grayscale images is introduced. A review of watersheds and related notion is first presented, and the major methods to determine watersheds are discussed. The present algorithm is based on an immersion process analogy, in which the flooding of the water in the picture is efficiently simulated using a queue of pixels. It is described in detail and provided in a pseudo C language. We prove the accuracy of this algorithm is superior to that of the existing implementations. Furthermore, it is shown that its adaptation to any kind of digital grid and its generalization to n-dimensional images and even to graphs are straightforward. In addition, its strongest point is that it is faster than any other watershed algorithm. Applications of this algorithm with regard to picture segmentation are presented for MR imagery and for digital elevation models. An example of 3-D watershed is also provided. Lastly, some ideas are given on how to solve complex segmentation tasks using watersheds on graphs.