A matrix sampling-and-recovery approach for many-lights rendering
Authors:
Open Access
- 2 November 2015
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 34 (6) , 1-12
Abstract
Instead of computing on a large number of virtual point lights (VPLs), scalable many-lights rendering methods effectively simulate various illumination effects only using hundreds or thousands of representative VPLs. However, gathering illuminations from these representative VPLs, especially computing the visibility, is still a tedious and time-consuming task. In this paper, we propose a new matrix sampling-and-recovery scheme to efficiently gather illuminations by only sampling a small number of visibilities between representative VPLs and surface points. Our approach is based on the observation that the lighting matrix used in manylights rendering is of low-rank, so that it is possible to sparsely sample a small number of entries, and then numerically complete the entire matrix. We propose a three-step algorithm to explore this observation. First, we design a new VPL clustering algorithm to slice the rows and group the columns of the full lighting matrix into a number of reduced matrices, which are sampled and recovered individually. Second, we propose a novel prediction method that predicts visibility of matrix entries from sparsely and randomly sampled entries. Finally, we adapt the matrix separation technique to recover the entire reduced matrix and compute final shadings. Experimental results show that our method heavily reduces the required visibility sampling in the final gathering and achieves 3--7 times speedup compared with the state-of-the-art methods on test scenes.Keywords
Funding Information
- NSFC (61472350)
- Fundamental Research Funds for the Central Universities (2015XZZX005-05)
- 863 program of China (2012AA011902)
- 973 Program of China (2015CB352503)
This publication has 23 references indexed in Scilit:
- Robust principal component analysis?Journal of the ACM, 2011
- Combining global and local virtual lights for detailed glossy illuminationACM Transactions on Graphics, 2010
- Sparsely Precomputing The Light Transport Matrix for Real‐Time RenderingComputer Graphics Forum, 2010
- Virtual spherical lights for many-light rendering of glossy scenesACM Transactions on Graphics, 2009
- Exact Matrix Completion via Convex OptimizationFoundations of Computational Mathematics, 2009
- Imperfect shadow maps for efficient computation of indirect illuminationACM Transactions on Graphics, 2008
- Metropolis Instant RadiosityComputer Graphics Forum, 2007
- Multidimensional lightcutsACM Transactions on Graphics, 2006
- LightcutsACM Transactions on Graphics, 2005
- Clustered principal components for precomputed radiance transferACM Transactions on Graphics, 2003