.png){kind=icon}
返回
A rapid multi-source shortest path algorithm for interactive image segmentation
.png){kind=icon}
PRE
AI
DOI：10.1007/s11042-016-4073-z.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper addresses the problem of performing multiple objects, interactive image segmentation. Given a small number of pixels (seeds) with predefined labels, we can quickly and accurately determine the closest seed from each unlabeled pixel. By assigning each pixel to the label same as its closest seed, a rapid image segmentation result can be obtained. Since the shortest distance is considered in this paper which directs our attention of segmentation into path planning problem, Dijkstra occurs to mind. Modifying the classical single-source algorithm, a simple yet rapid multi-source Dijkstra (MSD) algorithm is put forward. From both theoretical and experimental aspects, the proposed algorithm performs quite well in resisting noise, and preserving the objects details. Moreover, under the situation of multiple sources, instead of performing Dijkstra several times to obtain the distance from each pixel to each seed and choose the closest seed, the proposed multi-source image segmentation algorithm could determine the closest seed by running Dijkstra only once. Its efficiency, which will not be affected by the number of initial seed settings, maintains the same as the Dijkstra.
Keyword:
Image segmentation
Multi-Source
Shortest path
Interactive segmentation
Dijkstra
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3
论文数:
2.0W
被引数:
3.2W
机构
引用论文
.png){kind=icon}
分享收藏
Evaluation of design consistency on horizontal curves for two-lane state roads in terms of vehicle path radius and speed基于车辆路径半径和速度对双车道省级道路水平曲线设计一致性的评估
OAAI
OAAI分享收藏分享收藏分享收藏
查看更多内容