Exact evaluation of stochastic watersheds: From trees to general graphs
2014 (English)In: Discrete Geometry for Computer Imagery, Springer Berlin/Heidelberg, 2014, 309-319 p.Conference paper (Refereed)
The stochastic watershed is a method for identifying salient contours in an image, with applications to image segmentation. The method 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 seedpoints. Contours that appear with high probability are assumed to be more important. This paper concerns an efficient method for computing the stochastic watershed PDF exactly, without performing any actual seeded watershed computations. A method for exact evaluation of stochastic watersheds was proposed by Meyer and Stawiaski (2010). Their method does not operate directly on the image, but on a compact tree representation where each edge in the tree corresponds to a watershed partition of the image elements. The output of the exact evaluation algorithm is thus a PDF defined over the edges of the tree. While the compact tree representation is useful in its own right, it is in many cases desirable to convert the results from this abstract representation back to the image, e. g, for further processing. Here, we present an efficient linear time algorithm for performing this conversion.
Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2014. 309-319 p.
, Lecture Notes in Computer Science, ISSN 0302-9743 ; 8668
stochastic watershed, watershed cut, minimum spanning tree
Computer Vision and Robotics (Autonomous Systems)
IdentifiersURN: urn:nbn:se:uu:diva-232251DOI: 10.1007/978-3-319-09955-2_26ISI: 000358195100026ISBN: 978-3-319-09954-5OAI: oai:DiVA.org:uu-232251DiVA: diva2:747199
18th IAPR International Conference on Discrete Geometry for Computer Imagery (DGCI), 2014, September 10-12, Siena, Italy