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

monte carlo methods for volumetric light transport monte
SMART_READER_LITE
LIVE PREVIEW

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


slide-1
SLIDE 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

slide-2
SLIDE 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

slide-3
SLIDE 3

Dwivedi sampling Dwivedi sampling

regular path tracing random walk tends to get lost inside a volume bounded by a shape

3

slide-4
SLIDE 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

slide-5
SLIDE 5

Dwivedi sampling Dwivedi sampling

random walk biased towards light source aims to exit towards light [MHD16]

5

slide-6
SLIDE 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

slide-7
SLIDE 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

slide-8
SLIDE 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 evaluate path for a stratified set of wavelengths at the same time

  • ptimally weighted combination via MIS (balance heuristic)

limited to regular tracking because it requires explicit evaluation of PDF

λ0 λi f( , ) x ¯ λi p( , ) ∑j x ¯ λj

8

slide-9
SLIDE 9

spectral tracking via MIS spectral tracking via MIS

image comparison 64spp image comparison 64spp

skin material with 1 wavelength

9

slide-10
SLIDE 10

spectral tracking via MIS spectral tracking via MIS

image comparison 64spp image comparison 64spp

skin material with 4 wavelengths (SSE)

10

slide-11
SLIDE 11

spectral tracking via MIS spectral tracking via MIS

image comparison 64spp image comparison 64spp

skin material with 8 wavelengths (AVX)

11

slide-12
SLIDE 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 , , pick by maximum over pick by average weighted by spectral path throughput history

0.0 0.2 0.4 0.6 0.8 1.0

distance

2 3 4 5 6

extinction

µ.red µ.green µ.blue

RGB medium

0.0 0.2 0.4 0.6 0.8 1.0

distance

1 2 3 4 5

throughput.red throughput.green throughput.blue

Maximum

0.0 0.2 0.4 0.6 0.8 1.0

distance

1 2 3 4 5

max throughput

throughput.red throughput.green throughput.blue

History-aware avg.

μ ¯ (λ) μn (λ) μs (λ) μa λi

12

slide-13
SLIDE 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 , , pick by maximum over pick by average weighted by spectral path throughput history results in different noise patterns:

μ ¯ (λ) μn (λ) μs (λ) μa λi

13

slide-14
SLIDE 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

slide-15
SLIDE 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

slide-16
SLIDE 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

slide-17
SLIDE 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

  • n fine levels to sample collision type

μ ¯ (λ), (λ) μs μa

17

slide-18
SLIDE 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!

distance density distance density

18

slide-19
SLIDE 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!

distance density distance density

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

slide-20
SLIDE 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

slide-21
SLIDE 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

slide-22
SLIDE 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

slide-23
SLIDE 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

slide-24
SLIDE 24

end of content end of content

up next: up next:

summary and open research problems

24

slide-25
SLIDE 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

slide-26
SLIDE 26
  • pen research problems
  • pen 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

slide-27
SLIDE 27
  • pen research problems
  • pen 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

slide-28
SLIDE 28
  • pen research problems
  • pen research problems

joint handling of surfaces and geometry joint handling of surfaces and geometry

still oen surface transport is handled separately makes inclusion of all interreflections hard custom-cut algorithms increase maintenance cost

28

slide-29
SLIDE 29
  • pen research problems
  • pen 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

slide-30
SLIDE 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