An improved watershed algorithm based on efficient computation of shortest paths

DOI10.1016/J.PATCOG.2006.06.025zbMATH Open1119.68221DBLPjournals/pr/Osma-RuizGSV07OpenAlexW2030088149WikidataQ57540418 ScholiaQ57540418MaRDI QIDQ856478FDOQ856478

Juan I. Godino-Llorente, Víctor Osma-Ruiz, Pedro Gómez-Vilda, Nicolás Sáenz-Lechón

Publication date: 7 December 2006

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2006.06.025

zbMATH Keywords

image segmentationwatershedarrowing

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites Work

• Title not available (Why is that?)
• A queue-based region growing algorithm for accurate segmentation of multi-dimensional digital images
• A new set of fast algorithms for mathematical morphology
• A new set of fast algorithms for mathematical morphology

Cited In (4)

• Incremental Algorithm for Hierarchical Minimum Spanning Forests and Saliency of Watershed Cuts
• Segmentation and classification of hyperspectral images using watershed transformation
• Discrete Geometry for Computer Imagery
• The ordered queue and the optimality of the watershed approaches

   Recommendations

• Discrete Geometry for Computer Imagery 👍 👎
• Quasi-linear algorithms for the topological watershed 👍 👎
• Title not available (Why is that?) 👍 👎
• A Watershed Algorithm Progressively Unveiling Its Optimality 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: An improved watershed algorithm based on efficient computation of shortest paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856478)