基于VPL的绘制中光传输的稀疏采样与完成
Sparse Sampling and Completion for Light Transport in VPL-based Rendering
摘要:
多光源公式提供了一个通用框架,用于使用数十万个虚拟点光源(VPL)渲染各种照明效果。为了有效地收集VPL的贡献,lightcuts及其扩展对VPL进行聚类,这隐式地用类似于矢量量化的一些代表性块来近似照明矩阵。在本文中,我们提出了一个新的近似方法的基础上,以前的光切方法和低秩矩阵分解模型。正如许多研究人员指出的那样,照明矩阵是低秩的,这意味着它可以从一小部分已知条目中完成。首先生成一个误差有界的保守全局光割,然后利用光切片的方法,根据曲面点的坐标和法线将光照矩阵进行切片。然后,我们对每个矩阵切片执行两次随机采样。在第一遍中,对均匀分布的随机条目进行采样以粗化全局光切割,进一步聚类切片的空间局部化表面点的相似光。在第二遍中,根据从第一采样结果估计的可能性分布函数对更多条目进行采样。然后,每个矩阵切片被分解成由采样条目约束的两个较小的低秩矩阵的乘积,这提供了照明矩阵的完整性。因式分解的形式提供了一个额外的加速加起来的矩阵列,这是更GPU友好。与以往的基于光切的方法相比,我们通过因子分解的方法,用一些信号专用基来近似光照矩阵。实验结果表明,我们可以实现显着的加速比最先进的多光方法。
英文摘要:
The many-light formulation provides a general framework for rendering various illumination effects using hundreds of thousands of virtual point lights (VPLs). To efficiently gather the contributions of the VPLs, lightcuts and its extensions cluster the VPLs, which implicitly approximates the lighting matrix with some representative blocks similar to vector quantization. In this paper, we propose a new approximation method based on the previous lightcut method and a low-rank matrix factorization model. As many researchers pointed out, the lighting matrix is low rank, which implies that it can be completed from a small set of known entries. We first generate a conservative global light cut with bounded error and partition the lighting matrix into slices by the coordinate and normal of the surface points using the method of lightslice. Then we perform two passes of randomly sampling on each matrix slice. In the first pass, uniformly distributed random entries are sampled to coarsen the global light cut, further clustering the similar light for the spatially localized surface points of the slices. In the second pass, more entries are sampled according to the possibility distribution function estimated from the first sampling result. Then each matrix slice is factorized into a product of two smaller low-rank matrices constrained by the sampled entries, which delivers a completion of the lighting matrix. The factorized form provides an additional speedup for adding up the matrix columns which is more GPU friendly. Compared with the previous lightcut based methods, we approximate the lighting matrix with some signal specialized bases via factorization. The experimental results shows that we can achieve significant acceleration than the state of the art many-light methods.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。