Constrained texture synthesis by scalable sub-patch algorithm
Jhing-Fa Wang, Han‐Jen Hsu, Hongming Wang · 2005
We propose a novel scalable sub-patch algorithm for texture synthesis. Texture synthesis is an important research topic in computer graphics and image processing. We present an efficient algorithm which can paste a patch each time without boundary processing technique. In particular, the proposed sub-patch algorithm can be used in constrained texture synthesis to fill the large lost region. On the other hand, the searching neighborhood pixels can be changed due to different patch size in image reconstruction. The comparison of previous algorithms is also provided in this paper. We present a first algorithm used in constrained texture synthesis by regular synthesizing order.