Texture synthesis is one of the most active research topics in the present fields of computer graphics and computer vision, which has been promoted by the demand of virtual set rendering on a large scale and graphics transferred in networks. This paper starts with a brief introduction of Markov Random Field that describes the local statistical characteristics of an image and is the theoretical basis of all the algorithms and their applications concerned with texture synthesis in the whole paper. Next, we analyze the principles of two algorithms in texture growing and apply one of them to fill the texture in a damaged image. Then, in particular, we explore the thought of texture mixing based on multiple samples, of which we present a concrete algorithm and apply it for texture transferring. Finally, we present an efficient algorithm for the constrained texture synthesis based on multiple samples. |