An improved watershed algorithm based on efficient computation of shortest paths

DOI10.1016/J.PATCOG.2006.06.025MaRDI QIDQ856478zbMATH OpenOpenAlexDBLPWikidataFDO

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

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)

Recommendations

• Discrete Geometry for Computer Imagery
• Quasi-linear algorithms for the topological watershed
• scientific article; zbMATH DE number 1262723
• A watershed algorithm progressively unveiling its optimality
• scientific article; zbMATH DE number 1444011

Cites work

• scientific article; zbMATH DE number 1444011 (Why is no real title available?)
• A new set of fast algorithms for mathematical morphology
• A new set of fast algorithms for mathematical morphology
• A queue-based region growing algorithm for accurate segmentation of multi-dimensional digital images

Cited in

(7)

• Incremental Algorithm for Hierarchical Minimum Spanning Forests and Saliency of Watershed Cuts
• Optimized high speed pixel sorting and its application in watershed based image segmentation
• Segmentation and classification of hyperspectral images using watershed transformation
• A watershed algorithm progressively unveiling its optimality
• New clustering algorithm based on watershed transform
• Discrete Geometry for Computer Imagery
• The ordered queue and the optimality of the watershed approaches

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)