Browse > Article

Sample thread based real-time BRDF rendering  

Kim, Soon-Hyun (Ajou University)
Kyung, Min-Ho (Ajou University)
Lee, Joo-Haeng (ETRI)
Abstract
In this paper, we propose a novel noiseless method of BRDF rendering on a GPU in real-time. Illumination at a surface point is formulated as an integral of BRDF producted with incident radiance over the hemi-sphere domain. The most popular method to compute the integral is the Monte Carlo method, which needs a large number of samples to achieve good image quality. But, it leads to increase of rendering time. Otherwise, a small number of sample points cause serious image noise. The main contribution of our work is a new importance sampling scheme producing a set of incoming ray samples varying continuously with respect to the eye ray. An incoming ray is importance-based sampled at different latitude angles of the eye ray, and then the ray samples are linearly connected to form a curve, called a thread. These threads give continuously moving incident rays for eye ray change, so they do not make image noise. Since even a small number of threads can achieve a plausible quality and also can be precomputed before rendering, they enable real-time BRDF rendering on the GPU.
Keywords
BRDF rendering; importance sampling; sample thread; probability density function;
Citations & Related Records
연도 인용수 순위
  • Reference
1 J. Lawrence, R. Ramamoorthi, and S. Rusinkiewicz, "Efficient brdf importance sampling using a factored representation," in ACM SIGGRAPH, 2004, pp. 496-505. [Online]. Available: http://graphics.cs.berkeley.edu/papers/Lawrence-EBI-2004-07/
2 M. Pharr and G. Humphreys, Physically Based Rendering: From Theory to Implementation. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 2004.
3 K. Dana, B. Van-Ginneken, S. Nayar, and J. Korenderink, "Reflectance and Texture of Real World Surfaces," ACM Transactions on Graphics (TOG), vol. 18, no. 1, pp. 1-34, Jan 1999.   DOI
4 X. D. He, K. E, Torrance, F. X. Sillion, and D. P. Greenberg, "A comprehensive physical model for light reflection," SIGGRAPH Computer. Graph., vol. 25, no. 4, pp. 175-186, 1991.   DOI
5 G. J. Ward, "Measuring and modeling anisotropic reflection," SIGGRAPH Computer. Graph., vol. 26, no. 2, pp. 265-272, 1992.   DOI
6 Z. Wang, A. C. Bovik, H. R. Sheikh, S. Member, E. P. Simoncelli, and S. Member, "Image quality assessment: Form error visibility to structural similarity," IEEE Transactions on Image Processing, vol. 13, pp. 600-612, 2004.   DOI   ScienceOn
7 W. Matusik, H. Pfister, M. Brand, and L. McMillan, "A data-driven reflectance model," ACM Transactions on Graphics, vol. 22, no. 3, pp. 759-769, July 2003.   DOI   ScienceOn
8 E. Veach, "Robust monte carlo methods for light transport simulation," Ph.D. dissertation, Stanford, CA, USA, 1998, adviser-Guibas, Leonidas J.
9 E. P. F. Lafortune, S.-C. Foo, K. E. Torrance, and D. P. Greenberg, "Non-linear approximation of reflectance function," in SIGGRAPH '97 : Proceedings of the 24th annual conference on Computer graphics and interactive techniques. New York, NY, USA: ACM Press/Addison-Wesley Publishing Co., 1997, pp. 117-126.
10 M. Colbert and J. Krivanek, "Real-time shading with filtered importance sampling," in SIGGRAPH '07: ACM SIGGRAPH 2007 sketches. New York, NY, USA: ACM, 2007, p. 71.
11 P. Shirley, C. Wang, and K. Zimmerman, "Monte carlo techniques for direct lighting calculation," ACM Trans. Grapgh., vol. 15, no. 1, pp. 1-36, 1996.   DOI
12 J. Kautz and M. D. McCool, "Interactive rendering with arbitrary brdfs using separable approximations," in IN EURO-GRAPHICS RENDERING WORKSHOP, 1999, pp. 281-292.
13 M. D. McCool, J. Ang, and A. Ahmad, "Homomorphic factorization of brdfs for high-performance rendering," in SIGGRAPH '01: Proceedings of the 28th annual conference on Computer graphics and interactive techniques. New York, NY, USA: ACM, 2001, pp. 171-178.
14 J. F. Blinn, "Models of light reflection for computer synthe-sized pictures," SIGGRAPH Comput. Graph., vol. 11, no. 2, pp. 192-198, 1977.   DOI
15 R. L. Cook and K. E. Torrance, "A reflectance model for computer graphics," ACM Trans. Graph., vol. 1, no. 1, pp. 7-24, 1982.
16 J. F. Talbot, D. Cline, and P. K. Egbert, "Importance resampling for global illumination," in Rendering Techniques 2005 Eurographics Symposium on Rendering, K. Bala and P. dutre, Eds. Aire-la-Ville, Switzerland: Eurographics Association, 2005, pp. 139-146.
17 B. T. Phong, "Illumination for computer generated pictures," Commun. ACM, vol. 18, no. 6, pp. 311-317, 1975.   DOI   ScienceOn
18 D. Burke, A. Ghosh, and W. Heidrich, "Bidirectional importance sampling for direct illumination," in Rendering Techniques 2005: 16th Eurographics Workshop on Rendering, June 2005, pp. 147-156.
19 P. Clarberg, W. Jarosz, T. Akenine-Moller, and H. W. Jensen, "Wavlet imprtance sampling: Efficiently evaluating products of complex functions," in Proceedings of ACM SIGGRAPH 2005, 2005.
20 S. Agarwal, R. Ramamoorthi, S. Belongie, and H. W. Jensen, "Structured importance sampling of environment maps," ACM Trans. Graph., vol. 22. no. 3, pp. 605-612, 2003.   DOI   ScienceOn