改进的Graphcut算法  

Improved algorithm of graphcut

作　　者：聂俊岚[1] 王艳芬[1] 

机构地区：[1]燕山大学信息科学与工程学院,河北秦皇岛066004

出　　处：《计算机工程与设计》2009年第13期3225-3227,共3页Computer Engineering and Design

基　　金：国家863高技术研究发展计划基金项目

摘　　要：分析了查找路径时高权值边的存在对于合成结果的影响,在graphcut算法的基础上,针对其在查找最优路径时,没有考虑到高权值的边对于路径选取的影响这一缺点,结合其将重叠区域看作一个带权图的优点,对其进行了改进,提出了一种新的查找最优路径的算法,采用一种新的度量距离的方法,对算法查找到的最短路径进行选取,得出最优路径,避免了路径上高权值边的存在,使人眼不易察觉块间接缝的不连续,提高了合成质量。The influence of high weight edge＇ s presence on synthesis effect is investigated. The graphcut algorithm shows overlap as a weighted graph. However it does not take into account high weight edge for the impact of the selected path. Then grapheut algorithm is improved. A novel approach is proposed to seek the best path using an altemate distance metric for algorithm. It prevents high weight edge on the selected path, makes eyes difficult to detect the discontinuities along the seams of the patches, and improves the synthesis quality.

关 键 词：纹理合成 基于图像绘制 带权图 最优路径 权值 

分 类 号：TP391.42[自动化与计算机技术—计算机应用技术]