Fast and high quality overlap repair for patch-based Texture Synthesis

Andrew Nealen, Marc Alexa

    Research output: Chapter in Book/Report/Conference proceedingConference contribution


    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. Patch-based Texture Synthesis, Principal Component Analysis, k-coherence search.

    Original languageEnglish (US)
    Title of host publicationProceedings - Computer Graphics International, CGI 2004
    Number of pages4
    StatePublished - 2004
    EventProceedings - Computer Graphics International, CGI 2004 - Crete, Greece
    Duration: Jun 16 2004Jun 19 2004

    Publication series

    NameProceedings of Computer Graphics International Conference, CGI
    ISSN (Print)1530-1052


    OtherProceedings - Computer Graphics International, CGI 2004

    ASJC Scopus subject areas

    • Software
    • Computer Graphics and Computer-Aided Design


    Dive into the research topics of 'Fast and high quality overlap repair for patch-based Texture Synthesis'. Together they form a unique fingerprint.

    Cite this