“Efficient random walk strategy with particle filter”

  • ©Shinya Kitaoka

  • ©Shinya Kitaoka




    Efficient random walk strategy with particle filter



    Global illumination is becoming more and more important in re- cent graphics. It is based on the rendering equation, and there is  much literature devoted to solve a solution of the equation using Monte Carlo random walk strategy. However, all of these strategies are sometimes redundant and tend to produce noisy results because they evaluate a radiance of a pixel from results obtained by tracing only one path several times while determining termination, splitting and joining paths (e.g., [Szirmay-Kalos et al. 2005]). Therefore, we propose a new random walk strategy to reduce estimating variance to achieve an efficient and accurate rendering algorithm.  


    1. Szirmay-Kalos, L., Antal, G., and Sbert, M. 2005. Go with the winners strategy in path tracing. In WSCG (Journal Papers).
    2. Talbot, J. F., Cline, D., and Egbert, P. K. 2005. Importance resampling for global illumination. In Rendering Techniques 2005 Eurographics Symposium on Rendering, 139–146.

Additional Images:

©Shinya Kitaoka ©Shinya Kitaoka

ACM Digital Library Publication:

Overview Page: