Issue No. 07 - July (2012 vol. 18)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TVCG.2011.134
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.
J. Kim, T. Park, S. Lee and C. Kim, "Adaptive Synthesis of Distance Fields," in IEEE Transactions on Visualization & Computer Graphics, vol. 18, no. , pp. 1135-1145, 2011.