| | This Article | |
| |
| |
| | Share | |
| |
| |
| | Bibliographic References | |
| |
| |
| | Add to: | |
| |
 Digg
 Furl
 Spurl
 Blink
 Simpy
 Google
 Del.icio.us
 Y!MyWeb
| |
| | Search | |
| |
| |
| | |
Constrained Texture Synthesis via Energy Minimization
January/February 2007 (vol. 13 no. 1)
pp. 167-178
Abstract—This paper describes CMS (constrained minimization synthesis), a fast, robust texture synthesis algorithm that creates output textures while satisfying constraints. We show that constrained texture synthesis can be posed in a principled way as an energy minimization problem that requires balancing two measures of quality: constraint satisfaction and texture seamlessness. We then present an efficient algorithm for finding good solutions to this problem using an adaptation of graphcut energy minimization. CMS is particularly well suited to detail synthesis, the process of adding high-resolution detail to low-resolution images. It also supports the full Image Analogies framework, while providing superior image quality and performance. CMS is easily extended to handle multiple constraints on a single output, thus enabling novel applications that combine both user-specified and image-based control.
[1] 167 G. Ramanarayanan and K. Bala, “Constrained Graphcut Texture Synthesis,” Technical Report CUCS-TR2005-1995, Dept. of Computer Science, Cornell Univ., Apr. 2005.[2] V. Kwatra, A. Schodl, I. Essa, G. Turk, and A. Bobick, “Graphcut Textures: Image and Video Synthesis Using Graph Cuts,” Proc. SIGGRAPH, pp. 277-286, 2003.[3] A. Hertzmann, C.E. Jacobs, N. Oliver, B. Curless, and D.H. Salesin, “Image Analogies,” Proc. SIGGRAPH, pp. 327-340, 2001.[4] A.A. Efros and W.T. Freeman, “Image Quilting for Texture Synthesis and Transfer,” Proc. SIGGRAPH, pp. 341-346, 2001.[5] R. Ismert, K. Bala, and D. Greenberg, “Detail Synthesis for Image-Based Texturing,” Proc. Symp. Interactive 3D Graphics, pp. 171-176, Apr. 2003.[6] D.J. Heeger and J.R. Bergen, “Pyramid-Based Texture Analysis/Synthesis,” Proc. SIGGRAPH, pp. 229-238, 1995.[7] J.S.D. Bonet, “Multiresolution Sampling Procedure for Analysis and Synthesis of Texture Images,” Proc. SIGGRAPH, pp. 361-368, 1997.[8] L.-Y. Wei and M. Levoy, “Fast Texture Synthesis Using Tree-Structured Vector Quantization,” Proc. SIGGRAPH, pp. 479-488, 2000.[9] L. Liang, C. Liu, Y.-Q. Xu, B. Guo, and H.-Y. Shum, “Real-Time Texture Synthesis by Patch-Based Sampling,” ACM Trans. Graphics, vol. 20, no. 3, pp. 127-150, 2001.[10] M. Ashikhmin, “Synthesizing Natural Textures,” Proc. Symp. Interactive 3D Graphics, pp. 217-226, 2001.[11] V. Kwatra, I. Essa, A. Bobick, and N. Kwatra, “Texture Optimization for Example-Based Synthesis,” Proc. SIGGRAPH, pp. 795-802, 2005.[12] J. Zhang, K. Zhou, L. Velho, B. Guo, and H.-Y. Shum, “Synthesis of Progressively-Variant Textures on Arbitrary Surfaces,” Proc. SIGGRAPH, pp. 295-302, 2003.[13] A. Schödl, “Multi-Dimensional Exemplar-Based Texture Synthesis,” PhD dissertation, Georgia Inst. of Tech nology, 2002.[14] A. Agarwala, M. Dontcheva, M. Agrawala, S. Drucker, A. Colburn, B. Curless, D. Salesin, and M. Cohen, “Interactive Digital Photomontage,” Proc. SIGGRAPH, pp. 294-302, 2004.[15] K. Zhou, P. Du, L. Wang, Y. Matsushita, J. Shi, B. Guo, and H.-Y. Shum, “Decorating Surfaces with Bidirectional Texture Functions,” IEEE Trans. Visualization and Computer Graphics, vol. 11, no. 5, pp. 519-528, Sept./Oct. 2005.[16] S. Borman and R.L. Stevenson, “Super-Resolution from Image Sequences—A Review,” Proc. Midwest Symp. Circuits and Systems, 1998.[17] W.T. Freeman, T.R. Jones, and E.C. Pasztor, “Example-Based Super-Resolution,” IEEE Computer Graphics and Applications, vol. 22, no. 2, pp. 56-65, Mar./Apr. 2002.[18] C. Liu, H.-Y. Shum, and C.-S. Zhang, “A Two-Step Approach to Hallucinating Faces: Global Parameteric Model and Local Nonparametric Model,” Proc. Conf. Computer Vision and Pattern Recognition (CVPR), pp. 192-198, 2001.[19] L. Wang and K. Mueller, “Generating Sub-Resolution Detail in Images and Volumes Using Constrained Texture Synthesis,” Proc. IEEE Visualization Conf., pp. 75-82, 2004.[20] Y. Boykov, O. Veksler, and R. Zabih, “Fast Approximate Energy Minimization via Graph Cuts,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 11, pp. 1222-1239, Nov. 2001.[21] S. Birchfield and C. Tomasi, “Multiway Cut for Stereo and Motion with Slanted Surfaces,” Proc. IEEE Int'l Conf. Computer Vision (ICCV), pp. 489-495, Sept. 1999.[22] V. Kolmogorov and R. Zabih, “Computing Visual Correspondence with Occlusions Using Graph Cuts,” Proc. IEEE Int'l Conf. Computer Vision (ICCV), pp. 508-515, 2001.[23] V. Kolmogorov and R. Zabih, “Multi-Camera Scene Reconstruction via Graph Cuts,” Proc. European Conf. Computer Vision (ECCV), pp.82-96, 2002.[24] C. Rother, V. Kolmogorov, and A. Blake, “Grabcut: Interactive Foreground Extraction Using Iterated Graph Cuts,” Proc. SIGGRAPH, pp. 309-314, 2004.[25] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms. MIT Press and McGraw-Hill, 2001.[26] V. Kolmogorov and R. Zabih, “What Energy Functions Can Be Minimized via Graph Cuts?,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 2, pp. 147-159, Feb. 2004.[27] S. Zelinka and M. Garland, “Jump Map-Based Interactive Texture Synthesis,” ACM Trans. Graphics, vol. 23, no. 4, pp. 930-962, 2004.[28] Y. Liu, W.-C. Lin, and J. Hays, “Near-Regular Texture Analysis and Manipulation,” Proc. SIGGRAPH, pp. 368-376, 2004.[29] A.A. Efros and T.K. Leung, “Texture Synthesis by Non-Parametric Sampling,” Proc. IEEE Int'l Conf. Computer Vision (ICCV), pp. 1033-1038, Sept. 1999.[30] C. Rother, S. Kumar, V. Kolmogorov, and A. Blake, “Digital Tapestry,” Proc. Computer Vision and Pattern Recognition (CVPR), pp. 589-596, June 2005.[31] Q. Wu and Y. Yu, “Feature Matching and Deformation for Texture Synthesis,” Proc. SIGGRAPH, pp. 364-367, 2004.
Index Terms:
Texture synthesis, detail synthesis, super-resolution, image analogies.
Citation:
Ganesh Ramanarayanan, Kavita Bala, "Constrained Texture Synthesis via Energy Minimization," IEEE Transactions on Visualization and Computer Graphics, vol. 13, no. 1, pp. 167-178, Jan./Feb. 2007, doi:10.1109/TVCG.2007.4
