检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]陕西师范大学计算机科学学院,西安710062 [2]青海师范大学物理系,西宁810008 [3]广岛工业大学情报学部智能情报系统系
出 处:《小型微型计算机系统》2014年第3期648-653,共6页Journal of Chinese Computer Systems
基 金:国家自然科学基金项目(41171338)资助;教育部"春晖计划"合作项目(Z2012100)资助
摘 要:传统图割在交互式图像分割方面是比较成功的,但当图像含有噪声、部分被遮挡及背景较复杂的情况下,传统的图割方法并不能得到正确的分割结果.针对此问题,提出了一种将自适应形状先验合并到图割的方法,其思想是在图割框架中,除了通常的边界项和区域项外,将水平集距离函数的一个模板作为形状先验包含在图的边权重中,用图的边权重来传递关于图像和先验形状的信息;通过自适应调整参数来调整形状先验在图像中所起的作用;用加速稳健特征和随机抽样一致算法实现形状模板和目标的配准,使形状的变换具有仿射不变性.将此方法用于含有阴影、噪声污染和遮挡情况的自然图像进行处理,相比于不含形状先验的情况,该方法通过自适应形状先验信息约束分割目标的边缘,可以有效地应对阴影、遮挡和噪声问题,取得了较好的分割结果.:The traditional graph cut is successful in interactive image segmentation, however, such method cannot get the correct seg- mentation results when the image is corrupted by noise, occluded and existed in complex background. To address this problem, a new image segmentation method is proposed by combining adaptive shape priors to graph cuts, besides the traditional boundary item and region item, the basic idea of the proposed graph cut framework is that a template of level set distance functions representing shape priors is contained in the edge weights, and the weight edges of the graph convey information about the image and the prior shape ;by adaptive adjustment of parameters to adjust the shape prior in the different images; Speeded up robust features and Random Sample Consensus algorithm is used to implement shape template and object registration, the shape of affine transformation invariance. The method used to contain corrupted by noises and occluded of natural image,compared to the case without shape prior,the object by con- straining the adaptive shape prior information of the edge, can effectively respond to shadows,occlusion and noise problems,and ob- tained the ideal segmentation results.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222