The exact, subpixel watershed algorithm delivers very accurate watershed boundaries based on a spline interpolation, but isslow and only works in 2D. On the other hand, there are very fast pixel watershed algorithms, but they produce errors notonly in certain exotic cases, but also in real-world images and even in the most simple scenarios. In this work, we examineclosely the source of these errors and propose a new algorithm that is fast, approximates the exact watersheds (with pixelresolution), and can be extended to 3D .
%0 Conference Paper
%1 meine_09_watershed_errors
%A Meine, Hans
%A Stelldinger, Peer
%A Köthe, Ullrich
%B Discrete Geometry for Computer Imagery, Proc. DGCI '09
%D 2009
%E Brlek, Srecko
%E Reutenauer, Christophe
%E Provençal, Xavier
%I Springer
%K watershed errors approximation segmentation
%P 193-202
%R 10.1007/978-3-642-04397-0_17
%T Pixel Approximation Errors in Common Watershed Algorithms
%U http://dx.doi.org/10.1007/978-3-642-04397-0_17
%V 5810
%X The exact, subpixel watershed algorithm delivers very accurate watershed boundaries based on a spline interpolation, but isslow and only works in 2D. On the other hand, there are very fast pixel watershed algorithms, but they produce errors notonly in certain exotic cases, but also in real-world images and even in the most simple scenarios. In this work, we examineclosely the source of these errors and propose a new algorithm that is fast, approximates the exact watersheds (with pixelresolution), and can be extended to 3D .
@inproceedings{meine_09_watershed_errors,
abstract = {The exact, subpixel watershed algorithm delivers very accurate watershed boundaries based on a spline interpolation, but isslow and only works in 2D. On the other hand, there are very fast pixel watershed algorithms, but they produce errors notonly in certain exotic cases, but also in real-world images and even in the most simple scenarios. In this work, we examineclosely the source of these errors and propose a new algorithm that is fast, approximates the exact watersheds (with pixelresolution), and can be extended to 3D .},
added-at = {2010-05-20T05:34:04.000+0200},
author = {Meine, Hans and Stelldinger, Peer and Köthe, Ullrich},
biburl = {https://www.bibsonomy.org/bibtex/2b72d33482d5560c89b67aaceb28730da/ukoethe},
booktitle = {Discrete Geometry for Computer Imagery, Proc. DGCI '09},
doi = {10.1007/978-3-642-04397-0_17},
editor = {Brlek, Srecko and Reutenauer, Christophe and Provençal, Xavier},
file = {:meine_09_fast-flowline.pdf:PDF},
interhash = {c59fba9cb0a65c57db4e7f2315f879cb},
intrahash = {b72d33482d5560c89b67aaceb28730da},
keywords = {watershed errors approximation segmentation},
pages = {193-202},
publisher = {Springer},
series = {Springer LNCS},
timestamp = {2010-05-20T05:34:04.000+0200},
title = {Pixel Approximation Errors in Common Watershed Algorithms},
url = {http://dx.doi.org/10.1007/978-3-642-04397-0_17},
volume = 5810,
year = 2009
}