The steepest watershed: from graphs to images
Fernand Meyer

TL;DR
This paper introduces a new watershed segmentation algorithm that accurately estimates steepest descent trajectories on graphs and images, improving contour localization and structure detection in topographic and image data.
Contribution
The authors develop a non-myopic watershed algorithm that considers total trajectory length, enabling precise catchment basin detection and steepest path extraction in graphs and images.
Findings
Improved accuracy in watershed segmentation and contour localization.
Effective detection of river and thalweg structures.
Enhanced topographic surface analysis.
Abstract
The watershed is a powerful tool for segmenting objects whose contours appear as crest lines on a gradient image. The watershed transform associates to a topographic surface a partition into catchment basins, defined as attraction zones of a drop of water falling on the relief and following a line of steepest descent. Unfortunately, catchment basins may overlap and do not form a partition. Moreover, current watershed algorithms, being shortsighted, do not correctly estimate the steepness of the downwards trajectories and overestimate the overlapping zones of catchment basins. An arbitrary division of these zones between adjacent catchment basin results in a poor localization of the contours. We propose an algorithm without myopia, which considers the total length of a trajectory for estimating its steepness. We first consider topographic surfaces defined on node weighted graphs. The…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Vision and Imaging · Medical Image Segmentation Techniques · Automated Road and Building Extraction
