Texture synthesis through so-called ‘smart copying’ requires a seamless meshing of texture subparts. Current systems first select subparts that seem to globally fit well and then optimise the cut between them on a rather local scale. This order of first selecting patches and then caring about the seamless meshing reduces one’s leeway in the choice of seamless cuts to a small zone of overlap between the patches. Therefore, even in the latest and smartest of smart copying approaches seams still tend to show up in the results. Here we present an approach that first looks for promising cuts, and uses these as the point of departure. It is shown that even a simple criterion for the quality of seams already supports high-quality smart copying and texture tessellation. Index Terms – texture synthesis, smart copying, seamless cuts, texture tessellation.
[1]
Jeremy S. De Bonet,et al.
Multiresolution sampling procedure for analysis and synthesis of texture images
,
1997,
SIGGRAPH.
[2]
Edsger W. Dijkstra,et al.
A note on two problems in connexion with graphs
,
1959,
Numerische Mathematik.
[3]
Irfan A. Essa,et al.
Graphcut textures: image and video synthesis using graph cuts
,
2003,
ACM Trans. Graph..
[4]
Marc Levoy,et al.
Fast texture synthesis using tree-structured vector quantization
,
2000,
SIGGRAPH.
[5]
Alexei A. Efros,et al.
Image quilting for texture synthesis and transfer
,
2001,
SIGGRAPH.