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

@article{Vincent1991WatershedsID,
  title={Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations},
  author={Luc M. Vincent and Pierre Soille},
  journal={IEEE Trans. Pattern Anal. Mach. Intell.},
  year={1991},
  volume={13},
  pages={583-598}
}
  • L. VincentP. Soille
  • Published 1 June 1991
  • Computer Science
  • IEEE Trans. Pattern Anal. Mach. Intell.
A fast and flexible algorithm for computing watersheds in digital gray-scale images is introduced. [] Key Method The accuracy of this algorithm is proven to be superior to that of the existing implementations, and it is shown that its adaptation to any kind of digital grid and its generalization to n-dimensional images (and even to graphs) are straightforward. The algorithm is reported to be faster than any other watershed algorithm. Applications of this algorithm with regard to picture segmentation are…
View via Publisher
cse.msu.edu
5,872 Citations
Highly Influential Citations
239
Background Citations
1,100
Methods Citations
2,262
Results Citations
18

5,872 Citations

Fast watershed algorithms: analysis and extensions

The operation of the present fast watershed algorithms is analyzed and a new extension is proposed, based on a split-and-merge scheme, which preserves more information about image details.

Implementation of an Improved Watershed Algorithm in a Virtex 5 Platform

A segmentation algorithm based on a flooding process of the gradient image, which is observed as a topographic surface and which aims at finding the peaks in this surface and identifying them as image contours is proposed.

An efficient immersion-based watershed transform method and its prototype architecture

Segmentation of images using a simplified watershed algorithm

A modification of the standard watershed algorithm, based on the use of mathematical morphology, is described, which is easier to explain and implement, and gives satisfactory results in a typical case.

RECONSTRUCTION OF DIGITAL IMAGES BY COMBINING MULTIPLE GRADIENTS

A new algorithm is introduced to bridge the gap between known grayscale reconstruction algorithms and reconstruct the image in better way by combining multiple gradient operators based on the notion of regional maxima, regional minima, most significant value in the region and regional sorted Meddle values.

IMAGE SEGMENTATION BASED ON VISCOUS FLOODING SIMULATION

The morphological approach to image segmentation is based on the watershed transform. It is a very powerful tool which presents many advantages: it is not parametric, computationally efficient...…

An Overview on Watershed Transform and Its Consequences

The concept of watershed transform applied for image segmentation using watershed algorithm is discussed in detail and remedial measures are suggested for overcoming the shortfalls of such segmentation of digital image.

PDE Based Algorithms for Smooth Watersheds

A continuous approach based on a geometric description of the immersion front which gives rise to a partial differential equation is explored, which creates a robust algorithm which minimizes over- and under-segmentation even without predefined markers.

A connected component approach to the watershed segmentation

A deenition of the watershed segmentation, based on sets of neighboring pixels, which leads to a new type of watershed algorithm which is closely related to the connected component algorithm.

IWT-interactive watershed transform: a hierarchical method for efficient interactive and automated segmentation of multidimensional gray-scale images

The Interactive Watershed Transform (IWT) combines automation and efficient interactive control in a coherent algorithm while completely avoiding oversegmentation which is the major problem of the classical WT.
...

References

SHOWING 1-10 OF 52 REFERENCES

Watersheds of functions and picture segmentation

The watersheds of a function are geometric features which are very useful in picture segmentation and can be performed starting from the skeleton of the function, which is a particular case of a general morphological transformation called Thinning.

Image Analysis and Mathematical Morphology

This invaluable reference helps readers assess and simplify problems and their essential requirements and complexities, giving them all the necessary data and methodology to master current theoretical developments and applications, as well as create new ones.

Distance transformations in digital images

  • G. Borgefors
  • Computer Science
    Comput. Vis. Graph. Image Process.
  • 1986

Graphs and mathematical morphology

A contour processing method for fast binary neighbourhood operations

Euclidean distance mapping

Geodesic methods in quantitative image analysis

TERRAIN PARAMETERS DIRECTLY FROM A DIGITAL TERRAIN MODEL

The algorithm suggests a new approach to the use of DTMS in which all information is selected by the computer directly from the RAW data, and points out new ways of defining physical features so that they can be classified by fast sorting methods.

Topographic Partition of Watersheds with Digital Elevation Models

Digital elevation models are used to automatically map the stream channel and divide networks of a watershed. These topographic skeletons are used to partition the watershed into a set of…

A Computational Approach to Edge Detection

  • J. Canny
  • Computer Science
    IEEE Transactions on Pattern Analysis and Machine Intelligence
  • 1986
There is a natural uncertainty principle between detection and localization performance, which are the two main goals, and with this principle a single operator shape is derived which is optimal at any scale.
...