The ordered queue and the optimality of the watershed approaches

MaRDI QIDQ2759990zbMATH OpenFDO

Authors Roberto Lotufo, Alexandre Falcao

Publication date 21 March 2002

zbMATH Keywords

shortest-path forest problem

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10)

Recommendations

• A watershed algorithm progressively unveiling its optimality
• Quasi-linear algorithms for the topological watershed
• An improved watershed algorithm based on efficient computation of shortest paths
• Watershed Segmentation with Chamfer Metric
• Discrete Geometry for Computer Imagery

Cited in

(3)

• Multiscale skeletons by image foresting transform and its application to neuromorphometry
• Uniquely-determined thinning of the tie-zone watershed based on label frequency
• Links between image segmentation based on optimum-path forest and minimum cut in graph

This page was built for publication: The ordered queue and the optimality of the watershed approaches

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