Abstract

The stochastic watershed is a method for unsupervised image segmentation proposed by Angulo and Jeulin (2007). The method first computes a probability density function (PDF), assigning to each piece of contour in the image the probability to appear as a segmentation boundary in seeded watershed segmentation with randomly selected seeds. Contours that appear with high probability are assumed to be more important. This PDF is then post-processed to obtain a final segmentation. The main computational hurdle with the stochastic watershed method is the calculation of the PDF. In the original publication by Angulo and Jeulin, the PDF was estimated by Monte Carlo simulation, i.e., repeatedly selecting random markers and performing seeded watershed segmentation. Meyer and Stawiaski (2010) showed that the PDF can be calculated exactly, without performing any Monte Carlo simulations, but do not provide any implementation details. In a naive implementation, the computational cost of their method is too high to make it useful in practice. Here, we extend the work of Meyer and Stawiaski by presenting an efficient (quasi-linear) algorithm for exact computation of the PDF. We demonstrate that in practice, the proposed method is faster than any previously reported method by more than two orders of magnitude. The algorithm is formulated for general undirected graphs, and thus trivially generalizes to images with any number of dimensions. (C) 2014 Elsevier B. V. All rights reserved.

Keywords

Mathematical morphology; Image segmentation; Stochastic watershed; Seeded watershed; Minimum spanning tree

Published in

Pattern Recognition Letters
2014, Volume: 47, pages: 80-84
Publisher: ELSEVIER SCIENCE BV

SLU Authors

• Luengo, Cris

  • Centre for Image Analysis, Swedish University of Agricultural Sciences
    

UKÄ Subject classification

Computational Mathematics
Probability Theory and Statistics


Publication identifier

DOI: https://doi.org/10.1016/j.patrec.2014.03.016

Permanent link to this page (URI)

https://res.slu.se/id/publ/67586