Watershed-based segmentation and region merging
Watershed-based segmentation and region merging
复制标题
DOI：
10.1006/cviu.2000.0822
复制
发表时间：
2000-03-01
影响因子：
4.5
通讯作者：
Leon, LJ
中科院分区：
文献类型：
--
作者：
Bleau, A;Leon, LJ
近年来，分水岭线已成为数学形态学中图像分割的主要工具。已经设计了几种非常有效的算法来确定流域。然而，分水岭算法在图像上的应用往往令人失望：图像被过度分割成大量微小的、浅的分水岭，而人们只希望获得几个深的分水岭。提出了一种新的流域合并方法。它主要解决以下问题：给定一张图像，距离最近且分水岭结构更简单的图像是什么？其基本理念是复制降雨在真实景观上发生的分水岭合并过程：较小的流域逐渐被填满，直到溢流发生。然后，水流入附近更大或更深的分水岭，在那里，溢出的分水岭被合并。本文提出的方法对给定图像进行尽可能小的广泛修改，以获得具有更少分水岭但仍然“接近”原始图像的新图像。它们的有用性在若干生物医学应用中得到证明，(C) 2000年学术出版社。
In recent years, the watershed line has emerged as the primary tool of mathematical morphology for image segmentation. Several very efficient algorithms have been devised for the determination of watersheds. Nevertheless, the application of water-shed algorithms to an image is often disappointing: the image is oversegmented into a large number of tiny, shallow watersheds, where one wanted to obtain only a few deep ones. This paper presents a novel approach to watershed merging. Mainly, it addresses the following question: given an image, what is the closest image that has a simpler watershed structure? The basic idea is to replicate the process of watershed merging that takes place when rain falls over a real landscape: smaller watersheds progressively fill until an overflow occurs. The water then flows to a nearby, larger or deeper watershed, in which the overflown watersheds are merged. The methods presented in this paper apply the minimum extensive modifications possible to a given image to obtain a new one that has many fewer watersheds but is still "close" to the original. Their usefulness is demonstrated for several biomedical applications, (C) 2000 Academic Press.