Pixel approximation errors in common watershed algorithms

Authors:
Hans Meine;Peer Stelldinger;Ullrich Köthe
Affiliations:
Cognitive Systems Laboratory, University of Hamburg, Germany;Cognitive Systems Laboratory, University of Hamburg, Germany;Heidelberg Collaboratory for Image Processing, University of Heidelberg, Germany
Venue:
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Year:
2009

Citing 4
Cited 0

Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations

IEEE Transactions on Pattern Analysis and Machine Intelligence
The watershed transform: definitions, algorithms and parallelization strategies

Fundamenta Informaticae - Special issue on mathematical morphology
Mean Shift: A Robust Approach Toward Feature Space Analysis

IEEE Transactions on Pattern Analysis and Machine Intelligence
A topological sampling theorem for Robust boundary reconstruction and image segmentation

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The exact, subpixel watershed algorithm delivers very accurate watershed boundaries based on a spline interpolation, but is slow and only works in 2D. On the other hand, there are very fast pixel watershed algorithms, but they produce errors not only in certain exotic cases, but also in real-world images and even in the most simple scenarios. In this work, we examine closely the source of these errors and propose a new algorithm that is fast, approximates the exact watersheds (with pixel resolution), and can be extended to 3D.