Published Articles >> Table of Contents >> Abstract

Computer Graphics International 2004 (CGI'04)   pp. 582-585
Fast and High Quality Overlap Repair for Patch-Based Texture Synthesis
Andrew Nealen, Darmstadt University of Technology
Marc Alexa, Darmstadt University of Technology

Full Article Text:

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CGI.2004.1309268
Send link to a friend

Abstract
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.
Back to Top Additional Information
Index Terms- Patch-based Texture Synthesis, Principal Component Analysis, k-coherence search Citation:  Andrew Nealen, Marc Alexa, "Fast and High Quality Overlap Repair for Patch-Based Texture Synthesis," cgi, pp. 582-585,  Computer Graphics International 2004 (CGI'04),  2004