- 1、本文档共6页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
图像分割的自适应交互核图割模型_崔威威
网络出版时间:2011-10-24 10:12
网络出版地址:/kcms/detail/11.2127.tp1012.031.html
2011-7-22 崔威威 等,图像分割的自适应交互核图割模型
图像分割的自适应交互核图割模型
1 1 1
崔威威 ,田铮 ,赵伟
1 1 1
CUI Weiwei ,TIAN Zheng ,ZHAO Wei
1.西北工业大学 理学院 应用数学系,西安 710129
1. Department of Applied Mathematics,School of Science,Northwestern Polytechnical University, Xi’an 710129
CUI Weiwei,TIAN Zheng,ZHAO Wei, Self-adaptive interactive kernel graph cut model for
image segmentation
Abstract :There are two limitations with the graph cut models used in image segmentation, the parameters are
predefined manually and a cut may end up with a local minimum. To overcome these limitations, an interactive
kernel graph cut based upon EM algorithm is proposed. first image data is mapped into a kernel space and define a
new objective function ,then calculate various parameters which are needed in the previous step according to the
subimages we get;These two steps iterate until object function converges. Real and synthesis image segmentation
experiments confirm it that the proposed algorithm is more precise and accurate compared with interactive graph
cut based on normalized cut, especially when segmenting optical images; this algorithm can also keep detailed
image information that cannot be captured by the normalized cut. Interactive kernel graph cut can offer an global
optimum segmentation, and EM algorithm calculates various parameters needed in the graph cut, that’s why we
use the word ‘adaptive ’.
文档评论(0)