提出一种带边界匹配的基于 Graph Cut 的快速纹理合成算法.通过将纹理样本以不同的位移贴到输出图中完成合成 ,重叠区域的像素取值由 Graph Cut 确定.引入边界图辅助位移搜索 ,以增强合成结果的边界连续性 在预处理过程中计算 2 个相同样本在所有相对位移下的匹配误差 ,选取一部分误差最小的位移组成 “优选位移” 集合 ,合成过程中的块间相对位移仅从此集合中选取 ,大大地提高了合成速度.-This paper proposes an efficient method for texture synthesis based on graph cut echnique and edge map.By　the　method, the synthesis is made by iteratively pasting the sample to the output with different displacements , and graph cut technique is used to find the optimal patch boundaries. To make the edge continuously better reserved, edge map is introduced to measure the structural similarity in the displacement search. In the preprocessing step , match errors for all relative displacements of two samples are calculated , and several displacements with the smallest match errors are selected to form the "optimal displacement set" . In the synthesis step , the relative displacements are fully chosen only from this set.