检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]北京大学计算机科学技术研究所,北京100871
出 处:《影像技术》2007年第4期22-24,共3页Image Technology
摘 要:本文提出了一种改进的Graph Cuts交互图像分割方法。Graph Cuts交互图像分割方法〔1〕首先由用户选定部分像素作为对象和背景,其余像素为未知区域;然后根据以像素为顶点,以像素相邻关系为边,构造一个图;最后通过图的最小分割方法将图像分为对象和背景两部分。此方法分割图像的结果直接受到用户选定对象和背景像素操作的影响,对象和背景边界的像素容易被分割错误。我们分别对对象区域和背景区域进行腐蚀操作,使分割错误的像素重新变为未知区域(对于在对象或背景内部被错误划分的像素,可以利用类似画笔的工具,直接将其标为对像或背景),然后重新进行一次Graph Cuts分割。由于这次选定了大部分的对象和背景区域,实验结果表明,最后分割结果正确率明显提高了。In this paper, we have improved the interactive graph cuts method for image segmentation. There are three steps in the interactive graph cuts method. First, some pixels are selected as the object and background seeds, and the left is the unknown region. Secondly, a graph is constructed, in which the vertices are all the pixels and the edges are the neighborhood relationship between the pixels. Last, the image is cut into two parts, the object and background, using the min-cut algorithm. The result is directly affected by the seeds which are selected by the user, and the pixels on the border of the object may be partitioned wrongly. We erode the object and background region to exclude the wrong pixels, then we use those as object and background seeds and do the graph cuts again. The experiments show that the result is more accurate because most pixels of the object and background are selected as seeds.
分 类 号:TP317.4[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.14.64.102