.png){kind=icon}
返回
Improving random walker segmentation using a nonlocal bipartite graph
.png){kind=icon}
PRE
AI
DOI：10.1016/j.bspc.2021.103154.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The classical random walk segmentation explores merely local affinity among neighboring pixels for cutting out objects, which falls short of effectiveness when handling distant repetitive patterns. Meanwhile, the running efficiency is also limited by solving a large scale linear system. To alleviate the quandary, in this paper, we first propose to introduce nonlocal affinity among distant pixels with similar local features in the underlying segmentation graph, which enables label propagation among disconnected foregrounds and thus multiple repetitive patterns can be segmented jointly. Secondly, the segmentation graph is extended to a multi-scale superpixel based bipartite graph, where random walker segmentation is performed to transfer labeling information from annotated seeds to superpixels and further to unlabeled pixels. We show such a bipartite graph based approach can considerably save the computational cost without sacrificing the segmentation accuracy. Extensive experiments are conducted on multiple datasets, demonstrating the effectiveness of the proposed method.
Keyword:
Random walker segmentation
Bipartite graph segmentation
Superpixel segmentation
期刊
IF:
4.9
论文数:
1.0W
被引数:
2.4W
机构
引用论文
分享收藏A fully convolutional two-stream fusion network for interactive image segmentation.png)
NEURAL NETWORKS
OAAI
NEURAL NETWORKSIF6.3
OAAI分享收藏分享收藏Health Literacy – a review of research using the European Health Literacy Questionnaire (HLS-EU-Q16) in 2010-2018健康素养-2010-2018使用欧洲健康素养问卷 (HLS-EU-Q16) 进行的研究综述
OAAI
OAAI分享收藏
查看更多内容