“LightSlice: matrix slice sampling for the many-lights problem”
Conference:
Type(s):
Title:
- LightSlice: matrix slice sampling for the many-lights problem
Session/Category Title: Light Transport
Presenter(s)/Author(s):
Abstract:
Recent work has shown that complex lighting effects can be well approximated by gathering the contribution of hundreds of thousands of virtual point lights (VPLs). This final gathering step is known as the many-lights problem. Due to the large number of VPLs, computing all the VPLs’ contribution is not feasible. This paper presents LightSlice, an algorithm that efficiently solves the many-lights problem for large environments with complex lighting. As in prior work, we derive our algorithm from a matrix formulation of the many-lights problem, where the contribution of each VPL corresponds to a column, and computing the final image amounts to computing the sum of all matrix columns. We make the observation that if we cluster similar surface samples together, the slice of the matrix corresponding to these surface samples has significantly lower rank than the original matrix. We exploit this observation by deriving a two-step algorithm where we first globally cluster all lights, to capture the global structure of the matrix, and then locally refine these clusters to determine the most important lights for each slice. We then reconstruct a final image from only these locally-important lights. Compared to prior work, our algorithm has the advantage of discovering and exploiting the global as well as local matrix structure, giving us a speedup of between three and six times compared to state-of-the-art algorithms.
References:
1. Cheslack-Postava, E., Wang, R., Akerlund, O., and Pellacini, F. 2008. Fast, realistic lighting and material design using nonlinear cut approximation. ACM Transactions on Graphics 27, 5 (Dec.), 128:1–128:10. Google ScholarDigital Library
2. Christensen, P. H. 2008. Point-based approximate color bleeding. Tech. Rep. 08-01, Pixar Animation Studios.Google Scholar
3. Davidovič, T., Křivánek, J., Hašan, M., Slusallek, P., and Bala, K. 2010. Combining global and local virtual lights for detailed glossy illumination. ACM Transactions on Graphics 29, 8 (Dec.), 143:1–143:8. Google ScholarDigital Library
4. Hašan, M., Pellacini, F., and Bala, K. 2006. Direct-to-indirect transfer for cinematic relighting. ACM Transactions on Graphics 25, 3 (July), 1089–1097. Google ScholarDigital Library
5. Hašan, M., Pellacini, F., and Bala, K. 2007. Matrix row-column sampling for the many-light problem. ACM Transactions on Graphics 26, 3 (July), 26:1–26:10. Google ScholarDigital Library
6. Hašan, M., Velázquez-Armendáriz, E., Pellacini, F., and Bala, K. 2008. Tensor clustering for rendering many-light animations. Computer Graphics Forum 27, 4 (June), 1105–1114. Google ScholarDigital Library
7. Hašan, M., Křivánek, J., Walter, B., and Bala, K. 2009. Virtual spherical lights for many-light rendering of glossy scenes. ACM Transactions on Graphics 28, 5 (Dec.), 143:1–143:6. Google ScholarDigital Library
8. Huang, F., and Ramamoorthi, R. 2010. Sparsely precomputing the light transport matrix for real-time rendering. In Computer Graphics Forum, vol. 29, Wiley-Blackwell, 1335–1345. Google ScholarDigital Library
9. Keller, A. 1997. Instant radiosity. In Proceedings of SIGGRAPH 97, Computer Graphics Proceedings, Annual Conference Series, 49–56. Google ScholarDigital Library
10. Křivánek, J., Ferwerda, J. A., and Bala, K. 2010. Effects of global illumination approximations on material appearance. ACM Transactions on Graphics 29, 4 (July), 112:1–112:10. Google ScholarDigital Library
11. Mahajan, D., Shlizerman, I. K., Ramamoorthi, R., and Belhumeur, P. 2007. A theory of locally low dimensional light transport. ACM Transactions on Graphics 26, 3 (July), 62:1–62:10. Google ScholarDigital Library
12. Pharr, M., and Humphreys, G. 2010. Physically Based Rendering, Second Edition: From Theory To Implementation, 2nd ed. Morgan Kaufmann Publishers Inc. Google ScholarDigital Library
13. Ritschel, T., Grosch, T., Kim, M. H., Seidel, H.-P., Dachsbacher, C., and Kautz, J. 2008. Imperfect shadow maps for efficient computation of indirect illumination. ACM Transactions on Graphics 27, 5 (Dec.), 129:1–129:8. Google ScholarDigital Library
14. Ritschel, T., Engelhardt, T., Grosch, T., Seidel, H.-P., Kautz, J., and Dachsbacher, C. 2009. Micro-rendering for scalable, parallel final gathering. ACM Transactions on Graphics 28, 5 (Dec.), 132:1–132:8. Google ScholarDigital Library
15. Sloan, P.-P., Hall, J., Hart, J., and Snyder, J. 2003. Clustered principal components for precomputed radiance transfer. ACM Transactions on Graphics 22, 3 (July), 382–391. Google ScholarDigital Library
16. Walter, B., Fernandez, S., Arbree, A., Bala, K., Donikian, M., and Greenberg, D. P. 2005. Lightcuts: a scalable approach to illumination. ACM Transactions on Graphics 24, 3 (Aug.), 1098–1107. Google ScholarDigital Library
17. Walter, B., Arbree, A., Bala, K., and Greenberg, D. P. 2006. Multidimensional lightcuts. ACM Transactions on Graphics 25, 3 (July), 1081–1088. Google ScholarDigital Library
