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

Andrew Nealen, Marc Alexa

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

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

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

    Other

    OtherProceedings - Computer Graphics International, CGI 2004
    CountryGreece
    CityCrete
    Period6/16/046/19/04

    Fingerprint

    Repair
    Textures
    Pixels
    Principal component analysis
    Data structures

    ASJC Scopus subject areas

    • Computer Science(all)

    Cite this

    Nealen, A., & Alexa, M. (2004). Fast and high quality overlap repair for patch-based Texture Synthesis. In Proceedings - Computer Graphics International, CGI 2004 (pp. 582-585) https://doi.org/10.1109/CGI.2004.1309268

    Fast and high quality overlap repair for patch-based Texture Synthesis. / Nealen, Andrew; Alexa, Marc.

    Proceedings - Computer Graphics International, CGI 2004. 2004. p. 582-585.

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

    Nealen, A & Alexa, M 2004, Fast and high quality overlap repair for patch-based Texture Synthesis. in Proceedings - Computer Graphics International, CGI 2004. pp. 582-585, Proceedings - Computer Graphics International, CGI 2004, Crete, Greece, 6/16/04. https://doi.org/10.1109/CGI.2004.1309268
    Nealen A, Alexa M. Fast and high quality overlap repair for patch-based Texture Synthesis. In Proceedings - Computer Graphics International, CGI 2004. 2004. p. 582-585 https://doi.org/10.1109/CGI.2004.1309268
    Nealen, Andrew ; Alexa, Marc. / Fast and high quality overlap repair for patch-based Texture Synthesis. Proceedings - Computer Graphics International, CGI 2004. 2004. pp. 582-585
    @inproceedings{b598ca97b0964c9996c4574daddf578a,
    title = "Fast and high quality overlap repair for patch-based Texture Synthesis",
    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. Patch-based Texture Synthesis, Principal Component Analysis, k-coherence search.",
    author = "Andrew Nealen and Marc Alexa",
    year = "2004",
    doi = "10.1109/CGI.2004.1309268",
    language = "English (US)",
    isbn = "0769521711",
    pages = "582--585",
    booktitle = "Proceedings - Computer Graphics International, CGI 2004",

    }

    TY - GEN

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

    AU - Nealen, Andrew

    AU - Alexa, Marc

    PY - 2004

    Y1 - 2004

    N2 - 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.

    AB - 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.

    UR - http://www.scopus.com/inward/record.url?scp=5444252209&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=5444252209&partnerID=8YFLogxK

    U2 - 10.1109/CGI.2004.1309268

    DO - 10.1109/CGI.2004.1309268

    M3 - Conference contribution

    SN - 0769521711

    SP - 582

    EP - 585

    BT - Proceedings - Computer Graphics International, CGI 2004

    ER -