monte carlo methods for volumetric light transport monte
play

Monte Carlo methods for volumetric light transport Monte Carlo - PowerPoint PPT Presentation

Monte Carlo methods for volumetric light transport Monte Carlo methods for volumetric light transport simulation simulation STAR at EG 2018 STAR at EG 2018 Advanced methods and acceleration data structures Advanced methods and acceleration


  1. Monte Carlo methods for volumetric light transport Monte Carlo methods for volumetric light transport simulation simulation STAR at EG 2018 STAR at EG 2018 Advanced methods and acceleration data structures Advanced methods and acceleration data structures Johannes Hanika Lehrstuhl für Computergrafik Karlsruhe Institute of Technology 1

  2. contents contents selection of advanced methods: Dwivedi sampling / zero variance random walks spectral tracking acceleration data structures for regular tracking inside these: null collision based emissive media 2

  3. Dwivedi sampling Dwivedi sampling regular path tracing random walk tends to get lost inside a volume bounded by a shape 3

  4. Dwivedi sampling Dwivedi sampling random walk biased to exit bounded volume as quickly as possible assumes constant illumination from the outside [Kd14] assume homogeneous slab with isotropic phase function approximate closed-form solution of transport using this simplified setting known as zero-variance theory (term may be a bit bold) 4

  5. Dwivedi sampling Dwivedi sampling random walk biased towards light source aims to exit towards light [MHD16] 5

  6. Dwivedi sampling Dwivedi sampling random walk biased towards light source aims to exit towards light [MHD16] achieved by biasing the PDF to sample direction and distance estimator remains unbiased! 6

  7. spectral tracking spectral tracking another problem with skin: chromatic media collision coefficients depend on wavelength μ λ for instance free flight distance much longer for long wavelengths: makes path invalid for different wavelength? can we still exploit coherence? 7

  8. spectral tracking via MIS spectral tracking via MIS hero wavelength sampling [WND ∗ 14] 450 500 550 600 650 700 450 500 550 600 650 700 sample perfectly for one single wavelength λ 0 evaluate path for a stratified set of wavelengths at the same time λ i optimally weighted combination via MIS (balance heuristic) limited to regular tracking because it requires explicit evaluation of PDF f ( , x ¯ λ i ) ∑ j p ( , x ¯ λ j ) 8

  9. spectral tracking via MIS spectral tracking via MIS image comparison 64spp image comparison 64spp skin material with 1 wavelength 9

  10. spectral tracking via MIS spectral tracking via MIS image comparison 64spp image comparison 64spp skin material with 4 wavelengths (SSE) 10

  11. spectral tracking via MIS spectral tracking via MIS image comparison 64spp image comparison 64spp skin material with 8 wavelengths (AVX) 11

  12. spectral tracking without PDF [KHLN17] spectral tracking without PDF [KHLN17] sample by common majorant μ ¯ how do decide for null collision, scattering, or absorption? probability according to , , μ n ( λ ) μ s ( λ ) μ a ( λ ) pick by maximum over λ i pick by average weighted by spectral path throughput history µ.red 5 5 throughput.red throughput.red µ.green throughput.green throughput.green 6 µ.blue throughput.blue throughput.blue 4 4 5 max throughput 3 3 4 extinction 2 2 3 1 1 2 0 0 0.0 0.2 0.4 0.6 0.8 1.0 0.0 0.2 0.4 0.6 0.8 1.0 0.0 0.2 0.4 0.6 0.8 1.0 distance distance distance Maximum History-aware avg. RGB medium 12

  13. spectral tracking without PDF [KHLN17] spectral tracking without PDF [KHLN17] sample by common majorant μ ¯ how do decide for null collision, scattering, or absorption? probability according to , , μ n ( λ ) μ s ( λ ) μ a ( λ ) pick by maximum over λ i pick by average weighted by spectral path throughput history results in different noise patterns: 13

  14. speed! speed! low variance estimators are important low variance estimators are important but also, in volumes most of the run time is memory fetching 14

  15. acceleration data structures acceleration data structures grid, super voxels [SKTM11], kd-tree [YIC ∗ 11], adaptive blocks adaptivity driven by pixel footprint / camera tessellation heterogeneity / variation two-level modelling (super voxel, kd nodes) store majorants in coarse blocks μ ¯ 15

  16. acceleration data structures acceleration data structures grid, super voxels [SKTM11], kd-tree [YIC ∗ 11], adaptive blocks adaptivity driven by pixel footprint / camera tessellation heterogeneity / variation two-level modelling (super voxel, kd nodes) store majorants in coarse blocks μ ¯ perform regular tracking on coarse blocks [SKTM11] 16

  17. acceleration data structures acceleration data structures grid, super voxels [SKTM11], kd-tree [YIC ∗ 11], adaptive blocks adaptivity driven by pixel footprint / camera tessellation heterogeneity / variation two-level modelling (super voxel, kd nodes) store majorants in coarse blocks μ ¯ perform regular tracking on coarse blocks [SKTM11] access on fine levels to sample collision type μ s ( λ ), μ a ( λ ) 17

  18. acceleration data structures acceleration data structures regular tracking regular tracking needs to step through every voxel, bad for fine tessellations well chosen tessellation is a big advantage! density density distance distance 18

  19. acceleration data structures acceleration data structures null collision-based tracking null collision-based tracking is independent of tessellation and is efficient in thin media (few events) high number of events in dense media, regardless of tessellation! density density distance distance accessing the memory within the same voxel is still expensive alleviated by decomposition tracking [KHLN17] separate into sum of coarse and fine, to sample distance pick shortest (and early out!) μ also profits full regular tracking 19

  20. emissive media emissive media thin/dense media make a difference thin/dense media make a difference no event inside the medium means we cannot pick up emission: density 20

  21. emissive media emissive media thin/dense media make a difference thin/dense media make a difference following the idea of beams, collect emission along a ray particularly well suited for regular tracking, touching all voxels anyways 21

  22. emissive media emissive media thin/dense media make a difference thin/dense media make a difference direct application of MIS with NEE [VH13] introduces noise : Point + NEE Line + NEE reason: NEE cannot create paths with end point outside the medium forward scattering PDF is poor, however, and now it picks up line emision! 22

  23. emissive media emissive media thin/dense media make a difference thin/dense media make a difference need to teach next event estimation about line emission [SHZD17]: Point + NEE Line + NEE Line + FNEE 23

  24. end of content end of content up next: up next: summary and open research problems 24

  25. summary summary free flight distance sampling free flight distance sampling woodcock/delta tracking transmittance estimation transmittance estimation track-length residual ratio free flight versions path sampling path sampling path space formulation summary of advanced methods acceleration structures acceleration structures for regular tracking for null collisions (bottom-level) 25

  26. open research problems open research problems null collision algorithms and MIS null collision algorithms and MIS missing link to integrate into powerful framework for instance combine with equi-angular sampling can we estimate the PDF? expectation and division do not commute! X = f ( ) x ¯ p ( ) x ¯ 26

  27. open research problems open research problems leverage recent advances in machine learning leverage recent advances in machine learning special purpose denoising including a volume prior? path guiding for volumes? importance sampling for multiple vertices? 27

  28. open research problems open research problems joint handling of surfaces and geometry joint handling of surfaces and geometry still o�en surface transport is handled separately makes inclusion of all interreflections hard custom-cut algorithms increase maintenance cost 28

  29. open research problems open research problems generalisation to correlated scatterers generalisation to correlated scatterers core assumption of exponential path length: uncorrelated particles! particle repulsion such as in cell growth is very correlated really, no collision can be found inside the current particle (min distance) some existing work [d'Eon 2018, Bitterli et al. 2018] 29

  30. thank you! thank you! any questions? any questions? acknowledgements: acknowledgements: Peter Kutz for tracing down many of early delta tracking papers Jaroslav Křivánek & reviewers for feedback on the paper dra� Maurizio Nitti for help w/ fast forward and illustrations 30

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend