Sciweavers

Share
ACIVS
2005
Springer

A Fast Sequential Rainfalling Watershed Segmentation Algorithm

9 years 9 months ago
A Fast Sequential Rainfalling Watershed Segmentation Algorithm
Abstract. In this paper we present a new implementation of a rainfalling watershed segmentation algorithm. Our previous algorithm was a one-run algorithm. All the steps needed to compute a complete watershed segmentation were done in one run over the input data. In our new algorithm we tried another approach. We separated the watershed algorithm in several low-complexity relabeling steps that can be performed sequentially on a label image. The new implementation is approximately two times faster for parameters that produce visually good segmentations. The new algorithm also handles plateaus in a better way. First we describe the general layout of a rainfalling watershed algorithm. Then we explain the implementations of the two algorithms. Finally we give a detailed report on the timings of the two algorithms for different parameters.
Johan de Bock, Patrick de Smet, Wilfried Philips
Added 26 Jun 2010
Updated 26 Jun 2010
Type Conference
Year 2005
Where ACIVS
Authors Johan de Bock, Patrick de Smet, Wilfried Philips
Comments (0)
books