Abstract: Graph cut technique is widely used in patch-based texture synthesis algorithms to optimize patch boundaries.The traditional graph cut method is based on the cumulative distance metric which sometimes leads the path to taking short cuts through high cost areas. To overcome this problem, a graph cut method based on the non-scalar distance metric was proposed. A minimum cut algorithm based on this metric was presented, and its optimality was proved. The regularity problem of the improved graph cut method was discussed and a solution was provided. Experimental results show that the cutting paths by the improved graph cut method arc smoother and more circuitous, and the patch scams are less obvious.

Key words: Texture synthesis, Graph cut, Non-scalar distance metric, Minimum cut