.png){kind=icon}
返回
Joint graph cut and relative fuzzy connectedness image segmentation algorithm
.png){kind=icon}
OA
AI
DOI：10.1016/j.media.2013.06.006.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We introduce an image segmentation algorithm, called GC(sum)(max), which combines, in novel manner, the strengths of two popular algorithms: Relative Fuzzy Connectedness (RFC) and (standard) Graph Cut (GC). We show, both theoretically and experimentally, that GC(sum)(max) preserves robustness of RFC with respect to the seed choice (thus, avoiding shrinking problem of GC), while keeping GC's stronger control over the problem of leaking though poorly defined boundary segments. The analysis of GC(sum)(max) is greatly facilitated by our recent theoretical results that RFC can be described within the framework of Generalized GC (GGC) segmentation algorithms. In our implementation of GC(sum)(max) we use, as a subroutine, a version of RFC algorithm (based on Image Forest Transform) that runs (provably) in linear time with respect to the image size. This results in GC(sum)(max) running in a time close to linear. Experimental comparison of GC(sum)(max) to GC, an iterative version of RFC (IRFC), and power watershed (PW), based on a variety medical and non-medical images, indicates superior accuracy performance of GC(sum)(max) over these other methods, resulting in a rank ordering of GC(sum)(max) > PW similar to IRFC > GC. (C) 2013 Elsevier B.V. All rights reserved.
Keyword:
Image segmentation
Robustness
Fuzzy connectedness
Graph cut
期刊
IF:
11.8
论文数:
3.9K
被引数:
2.4W
机构
引用论文
.png){kind=icon}
分享收藏Tinnitus Retraining Therapy (TRT) as a Method for Treatment of Tinnitus and Hyperacusis Patients耳鸣再训练疗法 (TRT) 作为治疗耳鸣和高亢患者的方法
PREAI
分享收藏
查看更多内容