Fast texture synthesis using tree-structured vector quantization

Li-Yi Wei, Marc Levoy
2000 Proceedings of the 27th annual conference on Computer graphics and interactive techniques - SIGGRAPH '00  
Figure 1 : Our texture generation process takes an example texture patch (left) and a random noise (middle) as input, and modifies this random noise to make it look like the given example texture. The synthesized texture (right) can be of arbitrary size, and is perceived as very similar to the given example. Using our algorithm, textures can be generated within seconds, and the synthesized results are always tileable. Abstract Texture synthesis is important for many applications in computer
more » ... hics, vision, and image processing. However, it remains difficult to design an algorithm that is both efficient and capable of generating high quality results. In this paper, we present an efficient algorithm for realistic texture synthesis. The algorithm is easy to use and requires only a sample texture as input. It generates textures with perceived quality equal to or better than those produced by previous techniques, but runs two orders of magnitude faster. This permits us to apply texture synthesis to problems where it has traditionally been considered impractical. In particular, we have applied it to constrained synthesis for image editing and temporal texture generation. Our algorithm is derived from Markov Random Field texture models and generates textures through a deterministic searching process. We accelerate this synthesis process using tree-structured vector quantization.
doi:10.1145/344779.345009 dblp:conf/siggraph/WeiL00 fatcat:wqzlxckvsff7pfbsi33ngzo2fa