Sciweavers

Share
CGI
2004
IEEE

Fast and High Quality Overlap Repair for Patch-Based Texture Synthesis

9 years 3 months ago
Fast and High Quality Overlap Repair for Patch-Based Texture Synthesis
Patch-based texture synthesis has proven to produce high quality textures faster than pixel-based approaches. Previous algorithms differ in how the regions of overlap between neighboring patches are treated. We present an approach that produces higher quality overlap regions than simple blending of patches or computing good boundaries, however, that is faster than re-synthesizing invalid pixels using a classical per-pixel synthesis algorithm: we use a k-nearest neighbor (knn) data structure, obtained from the input texture in a precomputation step. Results from our implementation show that the algorithm produces high-quality textures, where the time complexity of the synthesis stage is linear in the number of re-synthesized pixels and, therefore, scales well with the size of the input texture.
Andrew Nealen, Marc Alexa
Added 20 Aug 2010
Updated 20 Aug 2010
Type Conference
Year 2004
Where CGI
Authors Andrew Nealen, Marc Alexa
Comments (0)
books