当前位置: X-MOL 学术Comput. Vis. Image Underst. › 论文详情
A framework for comparing different image segmentation methods and its use in studying equivalences between level set and fuzzy connectedness frameworks.
Computer Vision and Image Understanding ( IF 2.645 ) Pub Date : 2011-03-29 , DOI: 10.1016/j.cviu.2011.01.003
Krzysztof Chris Ciesielski,Jayaram K Udupa

In the current vast image segmentation literature, there seems to be considerable redundancy among algorithms, while there is a serious lack of methods that would allow their theoretical comparison to establish their similarity, equivalence, or distinctness. In this paper, we make an attempt to fill this gap. To accomplish this goal, we argue that: (1) every digital segmentation algorithm [Formula: see text] should have a well defined continuous counterpart [Formula: see text], referred to as its model, which constitutes an asymptotic of [Formula: see text] when image resolution goes to infinity; (2) the equality of two such models [Formula: see text] and [Formula: see text] establishes a theoretical (asymptotic) equivalence of their digital counterparts [Formula: see text] and [Formula: see text]. Such a comparison is of full theoretical value only when, for each involved algorithm [Formula: see text], its model [Formula: see text] is proved to be an asymptotic of [Formula: see text]. So far, such proofs do not appear anywhere in the literature, even in the case of algorithms introduced as digitizations of continuous models, like level set segmentation algorithms.The main goal of this article is to explore a line of investigation for formally pairing the digital segmentation algorithms with their asymptotic models, justifying such relations with mathematical proofs, and using the results to compare the segmentation algorithms in this general theoretical framework. As a first step towards this general goal, we prove here that the gradient based thresholding model [Formula: see text] is the asymptotic for the fuzzy connectedness Udupa and Samarasekera segmentation algorithm used with gradient based affinity [Formula: see text]. We also argue that, in a sense, [Formula: see text] is the asymptotic for the original front propagation level set algorithm of Malladi, Sethian, and Vemuri, thus establishing a theoretical equivalence between these two specific algorithms. Experimental evidence of this last equivalence is also provided.
更新日期:2019-11-01

 

全部期刊列表>>
Springer Nature 2019高下载量文章和章节
化学/材料学中国作者研究精选
《科学报告》最新环境科学研究
ACS材料视界
自然科研论文编辑服务
中南大学国家杰青杨华明
剑桥大学-
中国科学院大学化学科学学院
材料化学和生物传感方向博士后招聘
课题组网站
X-MOL
北京大学分子工程苏南研究院
华东师范大学分子机器及功能材料
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug