字典神经网络方法快速湍流烟雾合成
Fast turbulent smoke synthesis via a dictionary-based neural network
- 2020年25卷第6期 页码:1235-1244
收稿:2018-12-21,
修回:2019-10-21,
纸质出版:2020-06-16
DOI: 10.11834/jig.180681
移动端阅览

浏览全部资源
扫码关注微信
收稿:2018-12-21,
修回:2019-10-21,
纸质出版:2020-06-16
移动端阅览
目的
2
基于物理的烟雾模拟是计算机图形学的重要组成部分,渲染具有细小结构的高分辨率烟雾,需要大量的计算资源和高精度的数值求解方法。针对目前高精度湍流烟雾模拟速度慢,仿真困难的现状,提出了基于字典神经网络的方法,能够快速合成湍流烟雾,使得合成的结果增加细节的同时,保持高分辨率烟雾结果的重要结构信息。
方法
2
使用高精度的数值仿真求解方法获得高分辨率和低分辨率的湍流烟雾数据,通过采集速度场局部块及相应的空间位置信息和时间特征生成数据集,设计字典神经网络的网络架构,训练烟雾高频成分字典预测器,在GPU(graphic processing unit)上实现并行化,快速合成高分辨率的湍流烟雾结果。
结果
2
实验表明,基于字典神经网络的方法能够在非常低分辨率的烟雾数据下合成空间和时间上连续的高分辨率湍流烟雾结果,效率比通过在GPU平台上直接仿真得到高分辨率湍流烟雾的结果快了一个数量级,且合成的烟雾结果与数值仿真方法得到的高分辨率湍流烟雾结果足够接近。
结论
2
本文方法解决了烟雾的上采样问题,能够从非常低分辨率的烟雾仿真结果,通过设计基于字典神经网络结构以及特征描述符编码烟雾速度场的局部和全局信息,快速合成高分辨率湍流烟雾结果,且保持高精度烟雾的细节,与数值仿真方法的对比表明了本文方法的有效性。
Objective
2
Physics-based smoke simulation is an important topic in computer graphics. Realistically simulating turbulent smoke flows is generally computationally expensive due to intrinsic small-scale structures that require sophisticated nondissipative solvers with a relatively high resolution. To effectively preserve small-scale structures
neural networks have been recently proposed and applied. However
the common problem in previous models for upsampling fluid flow fields with added small-scale structures is that the upsampled fluid field may not be sufficiently close to the corresponding high-resolution simulations. This problem may produce visual artifacts as important features
e.g.
vortex rings that require high-resolution samples to capture can be overlooked. The difficulty behind such upsampling
which considerably differs from image upsampling
is that the flow structures between high- and low-resolution simulations can substantially differ. This structure inconsistency becomes increasingly evident when high and low resolutions differ significantly from local nonlinear vortex structures to the global shape of turbulent flow distributions. To enable upsampling with close similarity to its high-resolution simulation counterpart
local and global information should be acquired and encoded. In this study
we propose a novel dictionary-based neural network for synthesizing the high-frequency components of a turbulent smoke flow from a very low-resolution simulation. By learning a local generative scheme from a large set of patches that exist in high-resolution simulations
our network can faithfully synthesize a high-resolution smoke flow that closely resembles the corresponding high-resolution simulations
with well-preserved important features and considerably improved computing efficiency.
Method
2
First
high- and low-resolution turbulent smoke data are simulated using a high-precision numerical method. We propose a feature vector that encodes the local velocity information of each 3D patch
global position
and time. This vector can help accurately predict local high-frequency components. Then
we construct a novel neural network based on the dictionary learning framework; this network simultaneously learns the dictionary and the associated coefficients. High-resolution smoke data have more details than low-resolution smoke data; thus
the former has a more complex spatial structure. Accordingly
we add gradient loss to maintain the spatial structure
with a regularization term to prevent overfitting. The advantage of our model is that it jointly optimizes all the layer parameters from end to end. After the training process
our neural network can learn a complex mapping function to efficiently synthesize high-resolution turbulent smoke patch data. During online synthesis given a low-resolution simulation
the trained neural network is used to predict overlapping local patches in parallel
with convolution in overlapping regions to ensure smooth transition.
Result
2
On the basis of the experimental results
we propose a novel dictionary-based neural network as a small-scale structure predictor to address such upsampling problem. The proposed neural network can produce spatially and temporally consistent high-resolution flow fields from very low-resolution simulations that closely approximate the direct high-resolution simulation results
with considerably improved computational efficiency. Our method faithfully preserves small-scale structures by comparing low- and high-resolution simulations. With our learning-based fast smoke simulation method
efficiency is improved by one order of magnitude compared with direct simulations at a resolution of 200×400×200 with highly similar results.
Conclusion
2
In this study
we address the crucial problem of synthesizing a high-resolution flow field from a very low-resolution simulation to achieve efficient smoke animation. The synthesized high-resolution flows can closely approximate their simulation counterparts. To produce a high-resolution flow field
we design a novel neural network that is motivated by dictionary learning and a new feature descriptor that encodes local and global information. The neural network can be used for efficient synthesis to quickly predict flow details in high resolutions. Parallel implementations of such mechanisms are realized on a GPU
with comparisons with numerical simulations to highlight the advantages of our method.
Aharon M, Elad M and Bruckstein A. 2006. K-SVD:an algorithm for designing overcomplete dictionaries for sparse representation. IEEE Transactions on Signal Processing, 54(11):4311-4322[DOI:10.1109/TSP.2006.881199]
Chu M Y and Thuerey N. 2017. Data-driven synthesis of smoke flows with CNN-based feature descriptors. ACM Transactions on Graphics (TOG), 36(4):#69[DOI:10.1145/3072959.3073643]
Daubechies I, Defrise M and De Mol C. 2004. An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Communications on Pure and Applied Mathematics, 57(11):1413-1457[DOI:10.1002/cpa.20042]
Donoho D L. 2006. For most large underdetermined systems of linear equations the minimal l 1 -norm solution is also the sparsest solution. Communications on Pure and Applied Mathematics, 59(6):797-829[DOI:10.1002/cpa.20132]
Fedkiw R, Stam J and Jensen H W. 2001. Visual simulation of smoke//Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques. New York, USA: ACM: 15-22[DOI: 10.1145/383259.383260 http://dx.doi.org/10.1145/383259.383260 ]
Gregor K and LeCun Y. 2010. Learning fast approximations of sparse coding//Proceedings of the 27th International Conference on International Conference on Machine Learning. Madison, USA: Omnipress: 399-406
Kamilov U S and Mansour H. 2016. Learning optimal nonlinearities for iterative thresholding algorithms. IEEE Signal Processing Letters, 23(5):747-751[DOI:10.1109/LSP.2016.2548245]
Kim T, Thürey N, James D and Gross M. 2008. Wavelet turbulence for fluid simulation. ACM Transactions on Graphics (TOG), 27(3):#50[DOI:10.1145/1399504.1360649]
Lentine M, Zheng W and Fedkiw R. 2010. A novel algorithm for incompressible flow using only a coarse grid projection. ACM Transactions on Graphics (TOG), 29(4):#114[DOI:10.1145/1833351.1778851]
Lian Q S, Shi B S and Chen S Z. 2015. Research advances on dictionary learning models, algorithms and applications. Acta Automatica Sinica, 41(2):240-260
练秋生, 石保顺, 陈书贞. 2015.字典学习模型、算法及其应用研究进展.自动化学报, 41(2):240-260[DOI:10.16383/j.aas.2015.c140252]
Mairal J, Bach F, Ponce J and Sapiro G. 2010. Online learning for matrix factorization and sparse coding. Journal of Machine Learning Research, 11:19-60[DOI:10.1145/1756006.1756008]
McAdams A, Sifakis E and Teran J. 2010. A parallel multigrid Poisson solver for fluids simulation on large grids//Proceedings of 2010 ACM SIGGRAPH/Eurographics Symposium on Computer Animation. Goslar, Germany: Eurographics Association: 65-74[DOI: 10.2312/SCA/SCA10/065-073 http://dx.doi.org/10.2312/SCA/SCA10/065-073 ]
Pfaff T, Thuerey N, Selle A and Gross M. 2009. Synthetic turbulence using artificial boundary layers. ACM Transactions on Graphics (TOG), 28(5):#121[DOI:10.1145/1661412.1618467]
Selle A, Fedkiw R, Kim B, Liu Y J and Rossignac J. 2008. An unconditionally stable MacCormack method. Journal of Scientific Computing, 35(2/3):350-371[DOI:10.1007/s10915-007-9166-4]
Tong R F, Chen L J and Wang G Z. 1999. A method for quick smoke simulation. Journal of Software, 10(6):647-651
童若锋, 陈凌钧, 汪国昭. 1999.烟雾的快速模拟.软件学报, 10(6):647-651
Tropp J A. 2004. Greed is good:algorithmic results for sparse approximation. IEEE Transactions on Information Theory, 50(10):2231-2242[DOI:10.1109/tit.2004.834793]
Xie Y, Franz E, Chu M Y and Thuerey N. 2018. tempoGAN:a temporally coherent, volumetric GAN for super-resolution fluid flow. ACM Transactions on Graphics (TOG), 37(4):#95[DOI:10.1145/3197517.3201304]
Zhang X X, Li M C and Bridson R. 2016. Resolving fluid boundary layers with particle strength exchange and weak adaptivity. ACM Transactions on Graphics (TOG), 35(4):#76[DOI:10.1145/2897824.2925910]
相关作者
相关机构
京公网安备11010802024621