Edge Map-Based Texture Synthesis via Graph Cuts

This paper presents an edge map-based texture synthesis algorithm using graph cuts to find the optimal patch boundaries. It takes the whole sample texture as a patch. In each step, an optimal patch translation with minimum match error is found, and graph cut technique is used to determine the optimal patch boundaries. In the patch translation searching process, edge map is used to measure the structural similarity, and it ensures the edge continuity better preserved. In the graph cut phase, heuristics are introduced to get around the issue that the energy function is not a metric. In this way, patch boundaries are more seamless. Experimental results show that the performance is satisfactory.