Cost-Driven Multiple Importance Sampling for Monte-Carlo Rendering

Information

• Publication Type: Technical Report
• Workgroup(s)/Project(s): not specified
• Date: October 2001
• Number: TR-186-2-01-19
• Keywords: random walk., stochastic iteration, Multiple importance sampling

Abstract

The global illumination or transport problems can also be considered as a sequence of integrals, while its Monte-Carlo solutions as different sampling techniques. Multiple importance sampling takes advantage of different sampling strategies and combines the results obtained with them. In this paper we propose the combination of very different global illumination algorithms in a way that their strengths can be preserved. To do this, we generalize the fundamental theory of multiple importance sampling for sequences of integrals and also take into account the computational cost associated with individual sampling techniques. The theoretical results are used to combine bi-directional path tracing and ray-bundles based stochastic iteration.

Additional Files and Images

Weblinks

No further information available.

BibTeX

@techreport{Szirmay-2001-CDMI,
  title =      "Cost-Driven Multiple Importance Sampling for Monte-Carlo
               Rendering",
  author =     "Ferenc Csonka and L\'{a}szl\'{o} Szirmay-Kalos and Gyorgy
               Antal",
  year =       "2001",
  abstract =   "The global illumination or transport problems can also be
               considered as a sequence of integrals, while its Monte-Carlo
               solutions as different sampling techniques. Multiple
               importance sampling takes advantage of different sampling
               strategies and combines the results obtained with them. In
               this paper we propose the combination of very different
               global illumination algorithms in a way that their strengths
               can be preserved. To do this, we generalize the fundamental
               theory of multiple importance sampling for sequences of
               integrals and also take into account the computational cost
               associated with individual sampling techniques. The
               theoretical results are used to combine bi-directional path
               tracing and ray-bundles                   based stochastic
               iteration.",
  month =      oct,
  number =     "TR-186-2-01-19",
  address =    "Favoritenstrasse 9-11/E193-02, A-1040 Vienna, Austria",
  institution = "Institute of Computer Graphics and Algorithms, Vienna
               University of Technology ",
  note =       "human contact: technical-report@cg.tuwien.ac.at",
  keywords =   "random walk., stochastic iteration, Multiple importance
               sampling",
  URL =        "https://www.cg.tuwien.ac.at/research/publications/2001/Szirmay-2001-CDMI/",
}