• Articles • Previous Articles     Next Articles

Transition Texture Synthesis

Yueh-Yi Lai and Wen-Kai Tai   

  1. Department of Computer Science and Information Engineering, "National Dong Hwa University'', Hualien 97401 Taiwan, China
  • Received:2006-12-14 Revised:2007-11-29 Online:2008-03-15 Published:2008-03-10

Synthesis of transition textures is essential for displaying visually acceptable appearances on a terrain. This investigation presents a modified method for synthesizing the transition texture to be tiled on a terrain. All transition pattern types are recognized for a number of input textures. The proposed modified patch-based sampling texture synthesis approach, using the extra feature map of the input source and target textures for patch matching, can synthesize any transition texture on a succession pattern by initializing the output texture using a portion of the source texture enclosed in a transition cut. The transition boundary is further enhanced to improve the visual effect by tracing out the integral texture elements. Either the Game of Life model or Wang tiles method are exploited to present a good-looking profile of successions on a terrain for tiling transition textures. Experimental results indicate that the proposed method requires few input textures, yet synthesizes numerous tileable transition textures, which are useful for obtaining a vivid appearance of a terrain.

Key words: Steiner tree; complexity theory; combination optimization;

[1] Lai Y Y, Tai W K, Chang C C, Liu C D. Synthesizing transition textures on succession patterns. In -\it Proc. Computer Graphics and Interactive Techniques in Australasia and South East Asia}, New Zealand, 2005, pp.273--276.

[2] Conway J H. Mathematical Games. Scientific American, 1970.

[3] Wang H. Proving Theorems by pattern recognition II. -\it Bell System Technique Journal}, 1961, 40: 1--42.

[4] David J Heeger, James R Bergen. Pyramid-based texture analysis/synthesis. In -\it Proc. SIGGRAPH 1995 Conference on Computer Graphics and Interactive Techniques}, Los Angeles, USA, 1995, pp.229--233.

[5] Ziv B J, Ran E Y, Lischinski D, Werman M. Texture mixing and texture movie synthesis using statistical learning. -\it IEEE Trans. Visualization and Computer Graphics}, 2001, 7(2): 120--135.

[6] Wei L Y, Levoy M. Fast texture synthesis using treestructured vector quantization. In -\it Proc. SIGGRAPH 2000}, New Orleans, USA, 2000, pp.479--488.

[7] Efros A A, Leung T K. Texture synthesis by non-parametric sampling. In -\it Proc. International Conference on Computer Vision $($ICCV'99$)$}, Corfu, Greece Vol. 2, 1999.

[8] Ashikhmin M. Synthesizing natural textures. In -\it Proc. ACM Symposium on Interactive 3D Graphics}, Chapel Hill, NC, 2001, pp.217--226.

[9] Wei L Y. Texture synthesis from multiple sources. In -\it Proc. SIGGRAPH 2003, Conference on Sketches and Applications}, San Diego, USA, 2003, p.1.

[10] Hertzmann A, Jacobs C E, Oliver N, Curless B, Salesin D H. Image analogies. In -\it Proc. SIGGRAPH 2001}, Los Angeles, 2001, pp.327--340.

[11] Lin Liang, Ce Liu, Ying-Qing Xu, Baining Guo, Heung-Yeung Shum. Real-time texture synthesis by patch-based sampling. -\it ACM Transactions on Graphics $($TOG$)$}, 2001, 20(3): 127--150.

[12] Efros A A, Freeman W. Image quilting for texture synthesis and transfer. In -\it Proc. SIGGRAPH 2001}, Los Angeles, 2001, pp.341--346.

[13] Cohen M F, Shade J, Hiller S, Deussen O. Wang tiles for image and texture generation. -\it ACM Transaction of Graphics}, 2003, 22(3): 287--294.

[14] Kwatra V, Schodl A, Essa I, Turk G, Bobick A. Graphcut textures: Image and video synthesis using graph cuts. In -\it Proc. SIGGRAPH 2003}, San Diego, USA, 2003, pp.277--286.

[15] Wu Q, Yu Y. Feature matching and deformation for texture synthesis. In -\it Proc. SIGGRAPH 2004}, Los Angeles, USA, 2004, pp.364--367.

[16] Smith S M, Brady J M. SUSAN -A new approach to low level image processing. -Defence Research Agency}, 1995, TR95SMS1c.

[17] Tomasi C, Manduchi R. Bilateral filtering for gray and color images. In -\it Proc. the Sixth International Conference on Computer Vision}, Bombay, India, 1998, pp.836--846.

[18] Kwok P C K. A thinning algorithm by contour generation. -\it Communications of the ACM}, 1988, 31(11): 1314--1324.

[19] Nealen A, Alexa M. Fast and high quality overlap repair for patch-based texture synthesis. In -\it Proc. the Computer Graphics International $($CGI'04$)$}, Crete, Greece, 2004, pp.582--585.
[1] David P. Woodruff. A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field [J]. , 2012, 27(4): 678-686.
[2] Yi Wu (吴奕). Pricing Loss Leaders Can be Hard [J]. , 2012, 27(4): 718-726.
[3] Jin-Yi Cai, and Hong Zhu. Progress in Computational Complexity Theory [J]. , 2005, 20(6): 735-750 .
[4] Zi-Mao Li, Da-Ming Zhu, and Shao-Han Ma. Approximation Algorithm for Bottleneck Steiner Tree Problem in the Euclidean Plane [J]. , 2004, 19(6): 0-0.
[5] MA Jun; YANG Bo; MA Shaohan;. A Practical Algorithm for the Minimum Rectilinear Steiner Tree [J]. , 2000, 15(1): 96-99.
Full text



[1] Gong Zhenhe;. On Conceptual Model Specification and Verification[J]. , 1987, 2(1): 35 -50 .
[2] Xu Zhiming;. Discrete Interpolation Surface[J]. , 1990, 5(4): 329 -332 .
[3] Guo Hengchang;. On the Characterization and Fault Identification of Sequentially t-Diagnosable System Under PMC Model[J]. , 1991, 6(1): 83 -90 .
[4] Li Weihua; Yuan Youguang;. Error Recovery in a Real-Time Multiprocessor System[J]. , 1992, 7(1): 83 -87 .
[5] Xu Meirui; Liu Xiaolin;. A VLSI Algorithm for Calculating the Tree to Tree Distance[J]. , 1993, 8(1): 68 -76 .
[6] Wang Zhijian;. Validating Inductive Hypotheses by Mode Inference[J]. , 1993, 8(2): 37 -41 .
[7] Zheng Yuhua; Xie Li; Sun Zliongxiu;. Full Or-Parallemism and Restricted And-Parallelism in BTM[J]. , 1994, 9(4): 373 -381 .
[8] Chen Ke; Masumi Ishikawa;. A Parallel Voting Scheme for Aspect Recovery[J]. , 1995, 10(5): 385 -402 .
[9] Yu Shengke;. Reasoning in H-Net: A Unified Approach to Intelligent Hypermedia Systems[J]. , 1996, 11(1): 83 -89 .
[10] Sun Yufang;. Hanzix and Chinese Open System Platform[J]. , 1997, 12(3): 283 -288 .

ISSN 1000-9000(Print)

CN 11-2296/TP

Editorial Board
Author Guidelines
Journal of Computer Science and Technology
Institute of Computing Technology, Chinese Academy of Sciences
P.O. Box 2704, Beijing 100190 P.R. China
E-mail: jcst@ict.ac.cn
  Copyright ©2015 JCST, All Rights Reserved