A Review of Watershed Implementations for Segmentation of Volumetric Images

Journal of Imaging

Ivan Yakimchuk¹  Anton Kornilov¹  Ilia Safonov¹ 

[1] Schlumberger Moscow Research, Leningradskoe Highway, 16a, 125171 Moscow, Russia;

关键词: segmentation;    watershed algorithm;    waterline;    flooding;    Euclidean distance transform;    benchmarking;   

DOI  :  10.3390/jimaging8050127

来源: DOAJ

【 摘 要 】

Watershed is a widely used image segmentation algorithm. Most researchers understand just an idea of this method: a grayscale image is considered as topographic relief, which is flooded from initial basins. However, frequently they are not aware of the options of the algorithm and the peculiarities of its realizations. There are many watershed implementations in software packages and products. Even if these packages are based on the identical algorithm–watershed, by flooding their outcomes, processing speed, and consumed memory, vary greatly. In particular, the difference among various implementations is noticeable for huge volumetric images; for instance, tomographic 3D images, for which low performance and high memory requirements of watershed might be bottlenecks. In our review, we discuss the peculiarities of algorithms with and without waterline generation, the impact of connectivity type and relief quantization level on the result, approaches for parallelization, as well as other method options. We present detailed benchmarking of seven open-source and three commercial software implementations of marker-controlled watershed for semantic or instance segmentation. We compare those software packages for one synthetic and two natural volumetric images. The aim of the review is to provide information and advice for practitioners to select the appropriate version of watershed for their problem solving. In addition, we forecast future directions of software development for 3D image segmentation by watershed.

【 授权许可】

Unknown