Making Imperfect Shadow Maps View‐Adaptive: High‐Quality Global Illumination in Large Dynamic Scenes

Ritschel, Tobias; Eisemann, Elmar; Ha, Inwoo; Kim, James Dokyoon; Seidel, Hans‐Peter

doi:10.1111/j.1467-8659.2011.01998.x

Cited by 38 publications

(40 citation statements)

References 36 publications

(66 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We also shortly cover temporal ltering, a method unrelated to Instant Radiosity that also Moving fewer VPLs. Both Prutkin et al [2012] and Barák et al [2013] extend the real-time importance sampling method by Ritschel et al [2011] to minimize the movement of VPLs between frames.…”

Section: Previous Workmentioning

confidence: 99%

“…They minimize the movement of VPLs by seeding the clustering algorithm using the VPLs from the last frame. Barák et al [2013] use a dierent importance sampling algorithm to select VPLs, as the analytic inversion method used by Ritschel et al [2011] is sensitive to local changes, even if the pseudo-random number generator is initialized the same way every frame. Instead they sample the VPLs using a variant of the MetropolisHastings method with independent proposals.…”

Section: Previous Workmentioning

confidence: 99%

“…These issues become more prominent in larger and heavily occluded scenes where only a few of the light sources actually bring indirect light to the image. This implies that methods that deposit VPLs in a more intelligent fashion will not only result in higher quality images without increasing the VPL budget, but also become necessary to cope with larger scenes [Georgiev and Slusallek, 2010, Ritschel et al, 2011, Segovia et al, 2006a.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Sequential Monte Carlo Instant Radiosity

Hedman

Karras²,

Lehtinen³

2017

IEEE Trans. Visual. Comput. Graphics

View full text Add to dashboard Cite

The focus of this thesis is to accelerate the synthesis of physically accurate images using computers.Such images are generated by simulating how light ows in the scene using unbiased Monte Carlo algorithms. To date, the eciency of these algorithms has been too low for real-time rendering of error-free images. This limits the applicability of physically accurate image synthesis in interactive contexts, such as pre-visualization or video games.We focus on the well-known Instant Radiosity algorithm by Keller [1997], that approximates the indirect light eld using virtual point lights (VPLs). This approximation is unbiased and has the characteristic that the error is spread out over large areas in the image. This low-frequency noise manifests as an unwanted ickering eect in image sequences if not kept temporally coherent.Currently, the limited VPL budget imposed by running the algorithm at interactive rates results in images which may noticeably dier from the ground-truth.We introduce two new algorithms that alleviate these issues. The rst, clustered hierarchical importance sampling, reduces the overall error by increasing the VPL budget without incurring a signicant performance cost. It uses an unbiased Monte Carlo estimator to estimate the sensor response caused by all VPLs. We reduce the variance of this estimator with an ecient hierarchical importance sampling method. The second, sequential Monte Carlo Instant Radiosity, generates the VPLs using heuristic sampling and employs non-parametric density estimation to resolve their probability densities. As a result the algorithm is able to reduce the number of VPLs that move between frames, while also placing them in regions where they bring light to the image. This increases the quality of the individual frames while keeping the noise temporally coherent and less noticeable between frames.When combined, the two algorithms form a rendering system that performs favourably against traditional path tracing methods, both in terms of performance and quality. Unlike prior VPLbased methods, our system does not suer from the objectionable lack of temporal coherence in highly occluded scenes.

show abstract

Section: Previous Workmentioning

confidence: 99%

Section: Previous Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Sequential Monte Carlo Instant Radiosity

Hedman

Karras²,

Lehtinen³

2017

IEEE Trans. Visual. Comput. Graphics

View full text Add to dashboard Cite

show abstract

“…Interactive global illumination algorithms were surveyed by Ritschel et al [10]. For a comprehensive survey of VPL-based rendering, we refer the readers to Dachsbacher et al [11].…”

Section: Real-time Global Illuminationmentioning

confidence: 99%

Modified filtered importance sampling for virtual spherical Gaussian lights

Tokuyoshi¹

2016

Comp. Visual Media

View full text Add to dashboard Cite

This paper proposes a modification of the filtered importance sampling method, and improves the quality of virtual spherical Gaussian light (VSGL)-based real-time glossy indirect illumination using this modification. The original filtered importance sampling method produces large overlaps of and gaps between filtering kernels for high-frequency probability density functions (PDFs). This is because the size of the filtering kernel is determined using the PDF at the sampled center of the kernel. To reduce those overlaps and gaps, this paper determines the kernel size using the integral of the PDF within the filtering kernel. Our key insight is that these integrals are approximately constant, if kernel centers are sampled using stratified sampling. Therefore, an appropriate kernel size can be obtained by solving this integral equation. Using the proposed kernel size for filtered importance samplingbased VSGL generation, undesirable artifacts are significantly reduced with a negligibly small overhead.

show abstract

“…Ritschel et al [2008] speed up the visibility computations using imperfect shadow maps (ISM), allowing visibility tests from hundreds of points and thereby enabling interactive computation of multiple indirect bounces. View-dependent optimizations of ISM even allow large dynamic scenes [Ritschel et al 2011]. Dong et al [2009] perform a VPL-clustering to reduce the number of visibility tests.…”

Section: Related Workmentioning

confidence: 99%

Fast light-map computation with virtual polygon lights

Luksch

Tobler

Habel

et al. 2013

Proceedings of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games

View full text Add to dashboard Cite

Scene illuminated from 9 light sources rendered with a 16MP light map computed from 5,300 virtual lights in 30s. AbstractWe propose a new method for the fast computation of light maps using a many-light global-illumination solution. A complete scene can be light mapped on the order of seconds to minutes, allowing fast and consistent previews for editing or even generation at loading time. In our method, virtual point lights are clustered into a set of virtual polygon lights, which represent a compact description of the illumination in the scene. The actual light-map generation is performed directly on the GPU. Our approach degrades gracefully, avoiding objectionable artifacts even for very short computation times.

show abstract

Making Imperfect Shadow Maps View‐Adaptive: High‐Quality Global Illumination in Large Dynamic Scenes

Cited by 38 publications

References 36 publications

Sequential Monte Carlo Instant Radiosity

Sequential Monte Carlo Instant Radiosity

Modified filtered importance sampling for virtual spherical Gaussian lights

Fast light-map computation with virtual polygon lights

Contact Info

Product

Resources

About