AI帮你理解科学

AI 生成解读视频

AI抽取解析论文重点内容自动生成视频


pub
生成解读视频

AI 溯源

AI解析本论文相关学术脉络


Master Reading Tree
生成 溯源树

Implementation And Complexity Of The Watershed-From-Markers Algorithm Computed As A Minimal Cost Forest

COMPUTER GRAPHICS FORUM, no. 3 (2001): C26-C35

引用55|浏览28
EI
下载 PDF 全文
引用

摘要

The watershed algorithm belongs to classical algorithms in mathematical morphology. Lotufo et al. I published a principle of the watershed computation by means of an iterative forest transform (IFT), which computes a shortest path forest from given markers. The algorithm itself was described for a 2D case (image) without a detailed discus...更多

代码

数据

0
您的评分 :

暂无评分

标签
评论
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn