19427

On Demand Solid Texture Synthesis Using Deep 3D Networks

Jorge Gutierrez, Julien Rabin, Bruno Galerne, Thomas Hurtut
Polytechnique Montréal, Canada
arXiv:2001.04528 [cs.GR], (13 Jan 2020)

@article{Gutierrez_2019,

   title={On Demand Solid Texture Synthesis Using Deep 3D Networks},

   ISSN={1467-8659},

   url={http://dx.doi.org/10.1111/cgf.13889},

   DOI={10.1111/cgf.13889},

   journal={Computer Graphics Forum},

   publisher={Wiley},

   author={Gutierrez, J. and Rabin, J. and Galerne, B. and Hurtut, T.},

   year={2019},

   month={Nov}

}

Download Download (PDF)   View View   Source Source   Source codes Source codes

Package:

616

views

This paper describes a novel approach for on demand volumetric texture synthesis based on a deep learning framework that allows for the generation of high quality 3D data at interactive rates. Based on a few example images of textures, a generative network is trained to synthesize coherent portions of solid textures of arbitrary sizes that reproduce the visual characteristics of the examples along some directions. To cope with memory limitations and computation complexity that are inherent to both high resolution and 3D processing on the GPU, only 2D textures referred to as "slices" are generated during the training stage. These synthetic textures are compared to exemplar images via a perceptual loss function based on a pre-trained deep network. The proposed network is very light (less than 100k parameters), therefore it only requires sustainable training (i.e. few hours) and is capable of very fast generation (around a second for 256^3 voxels) on a single GPU. Integrated with a spatially seeded PRNG the proposed generator network directly returns an RGB value given a set of 3D coordinates. The synthesized volumes have good visual results that are at least equivalent to the state-of-the-art patch based approaches. They are naturally seamlessly tileable and can be fully generated in parallel.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2020 hgpu.org

All rights belong to the respective authors

Contact us: