Abstract
We propose a novel sampling-based texture synthesis algorithm called Multipatch, which improves on the results of previous sampling-based algorithms by using patches of different size, and by minimizing global pasting errors. A key feature of the proposed algorithm is that it always converges to a local minimum. Multipatch, the patchwork algorithm, and Wei and Levoy’s multi-resolution texture synthesis algorithm, which is based on a tree-structured vector quantization method, are statistically analyzed and subjectively evaluated. The results of simulations show that the patchwork algorithm yields a perceptually acceptable texture in a shorter expected running time than the other two algorithms; however, Multipatch is the most efficient in terms of obtaining a good quality texture image.
Similar content being viewed by others
References
Wu Q. and Yu Y. (2004). Feature matching and deformation for texture synthesis. ACM Trans. Graph. 23: 364–367
Efros A. and Leung T. (1999). Texture synthesis by non-parametric sampling. Int. Conf. Comput. Vis. 2: 1033–1038
Ashikhmin, M.: Synthesizing natural textures. In: Proceedings of 2001 ACM Symposium on Interactive 3D Graphics, pp. 217–226 (2001)
Liang L., Liu C., Xu Y.Q., Guo B. and Shum H.Y. (2001). Real-time texture synthesis by patch-based sampling. ACM Trans. Graph. 20(3): 127–150
Zelinka, S., Garland, M.: Towards real-time texture synthesis with the jump map. In: EGRW ’02: Proceedings of the 13th Eurographics Workshop on Rendering, pp. 99–104 (2002)
Efros, A.A., Freeman, W.T.: Image quilting for texture synthesis and transfer, pp. 341–346 (2001)
Nealen, A., Alexa, M.: Hybrid texture synthesis. In: EGRW ’03: Proceedings of the 13th Eurographics Workshop on Rendering, pp. 97–105 (2003)
Kwatra, V., Schdl, A., Essa, I., Turk, G., Bobick, A.: Graphcut textures: Image and video synthesis using graph cuts. In: SIGGRAPH 2003. ACM Trans. Graph. vol. 22, no. 3, pp. 277–286 (2003)
Heeger, D.J., Bergen, J.R.: Pyramid-based texture analysis/synthesis. In: Proceedings of the 22nd Annual Conference on Computer Graphics and Interactive Techniques, pp. 229–238 (1995)
Zhu S.C., Wu Y.N. and Mumford D. (1997). Minimnax entropy principle and its application to texture modeling. Neural Comput. 9(8): 1627–1660
De Bonet J.S. and Viola P. (1998). A non-parametric multi-scale statistical model for natural images. Adv. Neural Inf. Process. Syst. 10: 773–779
Portilla J. and Simoncelli E.P. (2000). A parametric texture model based on joint statistics of complex wavelet coefficients. Int. J. Comput. Vis. 40(1): 49–71
Geman S. and Geman D. (1984). Stochastic relaxation, gibbs distributions and the bayesian restoration of images. IEEE Trans. on Pattern Anal. Mach. Intell. 6: 721–741
Elfadel I.M. and Picard R.W. (1998). Gibbs radnom fields, cooccurences and texture modeling. IEEE Trans. Pattern Anal. Mach. Intell. 7: 1615–1621
Picard R.W., Elfadel I.W., Pentland A.P.: Markov/gibbs texture modeling: Aura matrices and temperature effects. In: Computer Vision and Pattern Recognition, CVPR’91, pp. 371–377 (1991)
Qin, X., Yang, Y.H.: Similarity measure and learning with gray level aura matrices (glam) for texture image retrieval. In: Computer Vision and Pattern Recognition, CVPR’04, I326–I333 (2004)
Jacovitti G., Neri A. and Scarano G. (1998). Texture synthesis-by-analysis with hard-limited gaussian processes. IEEE Trans. Image Process. 7: 1615–1621
Campisi P., Hatzinakos D. and Neri A. (2000). A perceptually lossless, model-based, texture compression technique. IEEE Trans. Image Process. 9: 1325–1336
Dumitras A. and Haskell B.G. (2004). An encoder-decoder texture replacement method with application to context-based moving coding. IEEE Trans. Circuits Syst. Video Technol. 14: 825–840
Wei, L.Y., Levoy, M.: Fast texture synthesis using tree-structured vector quantization. In: SIGGRAPH, 2000, pp. 479–488 (2000)
Kwatra V., Essa I., Bobick A. and Kwatra N. (2005). Texture optimization for example-based synthesis. ACM Trans. Graph. 24(3): 795–802
Lai, L.Y., Hwang, W.L.: Analysis of sampling-based texture synthesis as a generalized em algorithm. Tech. Rep. TR-IIS-06-008, Institute of Information Science, Academia Sinica (2006)
Derin H. and Elliott H. (1987). Modeling and segmentation of noisy and textured images using gibbs random fields. IEEE Trans. Pattern Anal. Mach. Intell. 9: 39–55
Aho A., Hopcroft J.E. and Ullman J.D. (1974). The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading
Motwani R. and Raghavan P. (1995). Randomized Algorithms. Cambridge University Press, London
Billault, P.: Texture synthesis algorithms. In: Ecole Polytechnique, Promotion X-98, http://w3.impa.br/billault/report.pdf (2001)
Schmidt, J.: Practical implementation of a texture synthesis algorithms. In: Proceedings of 9th Central European Seminar on Computer Graphics (2005)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lai, LY., Hwang, WL. & Sreedevi, P. Performance evaluation of a novel sampling-based texture synthesis technique using different sized patches. SIViP 2, 275–286 (2008). https://doi.org/10.1007/s11760-007-0046-z
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11760-007-0046-z