We present an improved texture synthesis algorithm over arbitrary surfaces in this paper. The algorithm adopt the searching strategy of restriction degree to compute the texture coordinates of each triangular patch. It reduces the restrictive conditions as searching for the best matching patches and debases the complexity of the algorithm at the same time. Then aiming at the local boundary unmatching phenomenon, we find the best cut path between the overlap regions through extending graph cut technique. In particular, we combine the texture synthesis algorithm with illumination model to gain more natural effect. The results show that our solution fits to a wide range of sample textures and arbitrary surfaces.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Triangular-Patch Based Texture Synthesis over Arbitrary Surfaces


    Contributors:
    Li, Wei (author) / Han, Yuan-yuan (author) / Chen, Jia-xin (author)


    Publication date :

    2008-05-01


    Size :

    529954 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Patch-Based Texture Edges and Segmentation

    Wolf, L. / Huang, X. / Martin, I. et al. | British Library Conference Proceedings | 2006


    Patch-Based Texture Edges and Segmentation

    Wolf, Lior / Huang, Xiaolei / Martin, Ian et al. | Springer Verlag | 2006

    Free access

    High-Order Hyperbolic Residual-Distribution Schemes on Arbitrary Triangular Grids

    Mazaheri, Alireza R. / Nishikawa, Hiroaki | AIAA | 2015



    Optimal Generation of Closed Trajectories over Large, Arbitrary Surfaces Based on Non-calibrated Vision

    Gonzalez-Galvan, Emilio J. / Loredo-Flores, Ambrocio / Bonilla-Gutierrez, Isela et al. | Springer Verlag | 2019