Affiliation:
1. Keldysh Institute of Applied Mathematics of RAS, Moscow, Russia
Abstract
Bidirectional Monte Carlo ray tracing with photon maps is a powerful method for rendering images. But stochastic noise is inherent in it. However, this noise can be reduced using the multiple importance sampling technique which combines the weighted results of different strategies. The optimal weights allow you to minimize the noise functional and, thus, render the image of the best quality. In this paper, we determine the optimal weights using a system of integral equations derived and solved by us. This system has several qualitative differences from the case of mixing two strategies investigated previously. But further increasing the number of strategies does not change the qualitative features of the system. The system can be solved in a closed form, i.e. as an algebraic formula that includes several integrals of known functions. They can be calculated during ray tracing. Therefore, application of the optimal weights in Monte Carlo ray tracing results in faster rendering of high quality realistic images.
Publisher
Keldysh Institute of Applied Mathematics
Reference28 articles.
1. M. Šik, J. Křivánek, “Survey of Markov chain Monte Carlo methods in light transport simulation”, IEEE Trans. Visual. Comp. Graph., 26 (4), 1821–1840 (2018). doi: 10.1109/TVCG.2018.2880455
2. V.A. Frolov, A.G. Voloboy, S.V. Ershov, V.A. Galaktionov, “Light transport in realistic rendering: state-of-the-art simulation methods “, Program. Comp. Soft., 47 (4), 298–326 (2021). doi: 10.1134/S0361768821040034
3. H.W. Jensen and P. Christensen, High quality rendering using ray tracing and photon mapping, ACM SIGGRAPH 2007 Courses, Course 8, (2007). doi: 10.1145/1281500.1281593
4. J. Vorba, “Bidirectional photon mapping”, Proceedings of CESCG 2011: The 15th Central European Seminar on Computer Graphics, Prague, 25–32 (2011).
5. I. Georgiev, J. Křivánek, T. Davidovič, P. Slusallek, “Light transport simulation with vertex connection and merging”, ACM Trans. Graph., 31 (6), 192(1–10) (2012). doi: 10.1145/2366145.2366211