A watershed algorithm progressively unveiling its optimality

DOI10.1007/978-3-319-18720-4_60MaRDI QIDQ2946862zbMATH OpenOpenAlexFDO

Authors Fernand Meyer

Publication date 18 September 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://hal-mines-paristech.archives-ouvertes.fr/hal-01110891/file/ismm2015_fah.pdf

zbMATH Keywords

floodinghierarchical queuesteepest lexicographic distancetopographic distancewatershedweighted graphs

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10)

Recommendations

• Topographic distance and watershed lines
• Discrete Geometry for Computer Imagery
• scientific article; zbMATH DE number 3989403
• Quasi-linear algorithms for the topological watershed
• An improved watershed algorithm based on efficient computation of shortest paths

Cites work

• scientific article; zbMATH DE number 1444011 (Why is no real title available?)
• Topographic distance and watershed lines

Cited in

(4)

• The ordered queue and the optimality of the watershed approaches
• scientific article; zbMATH DE number 3989403 (Why is no real title available?)
• Extending the Power Watershed Framework Thanks to \Gamma-Convergence
• An improved watershed algorithm based on efficient computation of shortest paths

This page was built for publication: A watershed algorithm progressively unveiling its optimality

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