The Community for Technology Leaders
RSS Icon
Issue No.07 - July (2012 vol.18)
pp: 1135-1145
Sung-Ho Lee , Korea University, Seoul
Taejung Park , Korea University, Seoul
Jong-Hyeon Kim , Korea University, Seoul
Chang-Hun Kim , Korea University, Seoul
We address the computational resource requirements of 3D example-based synthesis with an adaptive synthesis technique that uses a tree-based synthesis map. A signed-distance field (SDF) is determined for the 3D exemplars, and then new models can be synthesized as SDFs by neighborhood matching. Unlike voxel synthesis approach, our input is posed in the real domain to preserve maximum detail. In comparison to straightforward extensions to the existing volume texture synthesis approach, we made several improvements in terms of memory requirements, computation times, and synthesis quality. The inherent parallelism in this method makes it suitable for a multicore CPU. Results show that computation times and memory requirements are very much reduced, and large synthesized scenes exhibit fine details which mimic the exemplars.
3D shape synthesis, example-based synthesis.
Sung-Ho Lee, Taejung Park, Jong-Hyeon Kim, Chang-Hun Kim, "Adaptive Synthesis of Distance Fields", IEEE Transactions on Visualization & Computer Graphics, vol.18, no. 7, pp. 1135-1145, July 2012, doi:10.1109/TVCG.2011.134
[1] S. Lefebvre and H. Hoppe, “Parallel Controllable Texture Synthesis,” ACM Trans. Graphics, vol. 24, no. 3, pp. 777-786, 2005.
[2] S. Avidan and A. Shamir, “Seam Carving for Content-Aware Image Resizing,” ACM Trans. Graphics, vol. 26, no. 3, p. 10, 2007.
[3] C. Barnes, E. Shechtman, A. Finkelstein, and D.B. Goldman, “PatchMatch: A Randomized Correspondence Algorithm for Structural Image Editing,” ACM Trans. Graphics, vol. 28, no. 3, 2009.
[4] A. Sharf, M. Alexa, and D. Cohen-Or, “Context-Based Surface Completion,” ACM Trans. Graphics, vol. 23, pp. 878-887, 2004.
[5] P. Bhat, S. Ingram, and G. Turk, “Geometric Texture Synthesis by Example,” Proc. Eurographics Symp. Geometry Processing, pp. 41-44, 2004.
[6] A. Lagae, O. Dumont, and P. Dutre, “Geometry Synthesis by Example,” Proc. Int'l Conf. Shape Modeling and Applications, pp. 176-185, 2005.
[7] K. Zhou, X. Huang, X. Wang, Y. Tong, M. Desbrun, B. Guo, and H.-Y. Shum, “Mesh Quilting for Geometric Texture Synthesis,” ACM Trans. Graphics, vol. 25, pp. 690-697, 2006.
[8] P. Merrell and D. Manocha, “Continuous Model Synthesis,” ACM Trans. Graphics, vol. 27, no. 5, pp. 1-7, 2008.
[9] M. Ashikhmin, “Synthesizing Natural Textures,” Proc. Symp. Interactive 3D Graphics, pp. 217-226, 2001.
[10] S. Lefebvre and H. Hoppe, “Compressed Random-Access Trees for Spatially Coherent Data,” Proc. Eurographics Symp. Rendering, 2007.
[11] Y. Ohtake, A. Belyaev, M. Alexa, G. Turk, and H.-P. Seidel, “Multi-Level Partition of Unity Implicits,” ACM Trans. Graphics, vol. 22, no. 3, pp. 463-470, 2003.
[12] S.F. Frisken, R.N. Perry, A.P. Rockwood, and T.R. Jones, “Adaptively Sampled Distance Fields: A General Representation of Shape for Computer Graphics,” Proc. ACM SIGGRAPH, pp. 249-254, 2000.
[13] A.A. Efros and T.K. Leung, “Texture Synthesis by Non-Parametric Sampling,” Proc. Int'l Conf. Computer Vision (ICCV), pp. 1033-1038, 1999.
[14] Y. Dong, S. Lefebvre, X. Tong, and G. Drettakis, “Lazy Solid Texture Synthesis,” Computer Graphics Forum, vol. 27, no. 4, pp. 1165-1174, 2008.
[15] D. Simakov, Y. Caspi, E. Shechtman, and M. Irani, “Summarizing Visual Data Using Bidirectional Similarity,” Proc. IEEE Conf. Computer Vision and Pattern Recognition (CVPR), pp. 1-8, 2008.
[16] A. Criminisi, P. Pérez, and K. Toyama, “Region Filling and Object Removal by Exemplar-Based Image Inpainting,” IEEE Trans. Image Processing, vol. 13, no. 9, pp. 1200-1212, Sept. 2004.
[17] M. Pauly, N.J. Mitra, J. Wallner, H. Pottmann, and L. Guibas, “Discovering Structural Regularity in 3D Geometry,” Proc. ACM SIGGRAPH, p. 43, 2008.
[18] M. Bokeloh, M. Wand, and H.-P. Seidel, “A Connection between Partial Symmetry and Inverse Procedural Modeling,” Proc. ACM SIGGRAPH, p. 104, 2010.
[19] J.A. Baerentzen and H. Aanaes, “Signed Distance Computation Using the Angle Weighted Pseudonormal,” IEEE Trans. Visualization and Computer Graphics, vol. 11, no. 3, pp. 243-253, May/June 2005.
[20] A. Sud, M.A. Otaduy, and D. Manocha, “Difi: Fast 3D Distance Field Computation Using Graphics Hardware,” Computer Graphics Forum, vol. 23, no. 3, pp. 557-566, 2004.
[21] A. Sud, N.K. Govindaraju, R. Gayle, and D. Manocha, “Interactive 3D Distance Field Computation Using Linear Factorization,” Proc. ACM Symp. Interactive 3D Graphics and Games (SI3D), pp. 117-124, 2006.
[22] X. Tong, J. Zhang, L. Liu, X. Wang, B. Guo, and H.-Y. Shum, “Synthesis of Bidirectional Texture Functions on Arbitrary Surfaces,” Proc. ACM SIGGRAPH, pp. 665-672, 2002.
[23] A. Hertzmann, C.E. Jacobs, N. Oliver, and B. Curless, and D.H. Salesin, “Image Analogies,” Proc. ACM SIGGRAPH, pp. 327-340, 2001.
[24] S. Zelinka and M. Garland, “Towards Real-Time Texture Synthesis with the Jump Map,” Proc. Eurographics Workshop Rendering, pp. 99-104, 2002.
[25] K. Perlin, “Improving Noise,” Proc. ACM SIGGRAPH, pp. 681-682, 2002.
[26] C. Shen, J.F. O'Brien, and J.R. Shewchuk, “Interpolating and Approximating Implicit Surfaces from Polygon Soup,” Proc. ACM SIGGRAPH, pp. 896-904, 2004.
[27] T.-J. Park, S.-H. Lee, J.-H. Kim, and C.-H. Kim, “Cuda-Based Signed Distance Field Calculation for Adaptive Grids,” Proc. IEEE Int'l Conf. Computer and Information Technology, pp. 1202-1206, 2010.
[28] M. Shevtsov, A. Soupikov, and A. Kapustin, “Highly Parallel Fast Kd-Tree Construction for Interactive Ray Tracing of Dynamic Scenes,” Computer Graphics Forum, vol. 26, no. 3, pp. 395-404, 2007.
[29] T. Ju, F. Losasso, S. Schaefer, and J. Warren, “Dual Contouring of Hermite Data,” Proc. ACM SIGGRAPH, pp. 339-346, 2002.
[30] M.G. Amdahl, “Validity of the Single Processor Approach to Achieving Large Scale Computing Capabilities,” Proc. Spring Joint Computer Conf., pp. 483-485, 1967.
45 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool