• 沒有找到結果。

SURE-based Optimization for Adaptive Sampling and Reconstruction

N/A
N/A
Protected

Academic year: 2022

Share "SURE-based Optimization for Adaptive Sampling and Reconstruction"

Copied!
73
0
0

加載中.... (立即查看全文)

全文

(1)

SURE-based Optimization for Adaptive Sampling and

Reconstruction

Tzu-Mao Li, Yu-Ting Wu, Yung-Yu Chuang

National Taiwan University

(2)

Monte Carlo ray tracing

( �, � ) =

Ω

( �, � , � ) �� ≈ 1

�=1

� (� , � ,�

)

 

(3)

Depth of field Glossy reflection Global illumination

Soft shadow Participating media

Monte Carlo ray tracing

Motion blur

(4)

68 samples per pixel

~890 seconds

8192 samples per pixel

~1 day 4 hours

Noise of Monte Carlo

(5)

Avg. 64 samples per pixel

~890 seconds

8192 samples per pixel

~1 day 4 hours

Noise of Monte Carlo

(6)

• Image space methods

– Mitchell [1987, 1991], Bala et al. [2003], Overbeck et al. [2009], Chen et al. [2011], Rousselle et al. [2011], Sen and Darabi [2012]

– Handle general effects, usually more computationally efficient and use less memory

Previous work

(7)

Previous work

• Image space methods

– Mitchell [1987, 1991], Bala et al. [2003], Overbeck et al. [2009], Chen et al. [2011], Rousselle et al. [2011], Sen and Darabi [2012]

– Handle general effects, usually more computationally efficient and use less memory

• Multidimensional methods

– Hachisuka et al. [2008], Soler et al. [2009], Egan et al.

[2009, 2011], Lehtinen et al. [2011, 2012]

– May eliminate the noise using fewer samples, but often limited to a few effects

(8)

• Image space methods

– Mitchell [1987, 1991], Bala et al. [2003], Overbeck et al. [2009], Chen et al. [2011], Rousselle et al. [2011], Sen and Darabi [2012]

– Handle general effects, usually more computationally efficient and use less memory

• Multidimensional methods

– Hachisuka et al. [2008], Soler et al. [2009], Egan et al.

[2009, 2011], Lehtinen et al. [2011, 2012]

– May eliminate the noise using fewer samples, but often limited to a few effects

Previous work

+ Ours

(9)

GEM [Rousselle et al. 2011]

(10)

GEM [Rousselle et al. 2011]

Renderer

Mean Var

Color

(11)

GEM [Rousselle et al. 2011]

Renderer

Mean Var

Color Filterbank

(12)

GEM [Rousselle et al. 2011]

Renderer

Mean Var

Color Filterbank

(13)

GEM [Rousselle et al. 2011]

Renderer

Mean Var

Color Filterbank

(14)

GEM [Rousselle et al. 2011]

Renderer

Mean Var

Color Filterbank

(15)

GEM [Rousselle et al. 2011]

Renderer

Mean Var

Color Filterbank

Error Estimator

(16)

GEM [Rousselle et al. 2011]

Renderer

Mean Var

Color Filterbank

Error Estimator Filter

Scale

(17)

GEM [Rousselle et al. 2011]

Renderer

Mean Var

Color Filterbank

Error Estimator Filter

Scale Sample

Density

(18)

GEM [Rousselle et al. 2011]

Renderer

Mean Var

Color Filterbank

Error Estimator Filter

Scale Sample

Density Finish

?

No

Yes

(19)

GEM [Rousselle et al. 2011]

Renderer

Mean Var

Color Filterbank

Error Estimator Filter

Scale Sample

Density Finish

?

No

Yes

Isotropic

Filters Only!

(20)

Isotropic filters cannot adapt to scene features well!

GEM [Rousselle et al. 2011]

(21)

Bilateral filters

[Tomasi and Manduchi 1998]

• Preventing Gaussian filters from blurring image

edges.

(22)

Bilateral filters

[Tomasi and Manduchi 1998]

• Preventing Gaussian filters from blurring image edges.

��

=exp ⁡(− ‖

2

2

2

)

 

Position Noisy

Gaussian

(23)

Bilateral filters

[Tomasi and Manduchi 1998]

• Preventing Gaussian filters from blurring image edges.

��

=exp ⁡(− ‖

2

2

2

) exp ⁡(−

2

2

2

)

 

Position Noisy

Bilateral

Color

(24)

Cross bilateral filters

[Eisemann and Durand 2004]

•  

Position Color Scene Features

(25)

Estimating filter error

(26)

Estimating filter error

(27)

Estimating filter error

 

Mean

(28)

Estimating filter error

 

Variance

Mean

 

(29)

Estimating filter error

Converged

 

Variance Mean

 

 

(30)

Estimating filter error

Converged

Variance

Mean

 

 

 

(31)

Converged

Variance Mean

Estimating filter error

�(�

 

)

Filtered

 

 

 

 

(32)

Estimating filter error

Want to estimate:

�[( � (

)

)

2

]

 

(33)

Estimating filter error

Want to estimate:

�[( � (

)

)

2

]

 

Don’t know!

(34)

Estimating filter error

Want to estimate:

�[( � (

)

)

2

]= � [���� ( � (� ))]

 

Stein’s Unbiased Risk Estimator!

(35)

Estimating filter error

Want to estimate:

 

�[( � (

)

)

2

]= � [���� ( � (� ))]

 

(36)

Estimating filter error

Want to estimate:

Analytically derived for cross bilateral filters.

 

�[( � (

)

)

2

]= � [���� ( � (� ))]

 

(37)

Our framework

Renderer

SURE

MSE Estimator Filter

Scale Sample

Density Finish

?

No

Yes

Mean Var

Color

(38)

Our framework

Renderer

(Cross Bilateral) Filterbank

SURE

MSE Estimator Filter

Scale Sample

Density Finish

?

No

Yes

Mean Var

Color

(39)

Our framework

Renderer

Mean Var

Color (Cross

Bilateral) Filterbank

SURE

MSE Estimator Filter

Scale Sample

Density Finish

?

No

Yes

Scene Features

Var Mean

(40)

Variance of the error estimator

• has its own variance!

•  

(41)

Variance of the error estimator

• has its own variance!

• We need to filter the estimated error.

– We use a fixed size cross bilateral filter to filter the estimated error.

•  

Before Filter After Filter

(42)

Results

(43)

Results Monte Carlo – 82 spp (60sec)

(44)

Results Our – 40 spp (60 sec)

(45)

Results

• Compare with GEM [Rousselle et al. 2011] and

RPF [Sen and Darabi 2012]

(46)

Results

• Compare with GEM [Rousselle et al. 2011] and RPF [Sen and Darabi 2012]

– GEM selects from a discrete filter set similar to our algorithm, but is limited to isotropic filters.

(47)

Results

• Compare with GEM [Rousselle et al. 2011] and RPF [Sen and Darabi 2012]

– GEM selects from a discrete filter set similar to our algorithm, but is limited to isotropic filters.

– RPF is an advanced cross bilateral filter operating on Monte Carlo samples.

(48)

Comparison to GEM

GEM

Average 52 spp

~60 sec

Our

Average 40 spp

~60 sec

Reference 4096 spp

~3000 sec

(49)

Comparison to GEM

Reference 4096 spp

~3000 sec

(50)

Comparison to GEM

GEM

Average 40 spp

~140 sec

Our

Average 27 spp

~140 sec

Reference 4096 spp

~13000 sec

(51)

Comparison to GEM

Reference 4096 spp

~13000 sec

(52)

Comparison to RPF

RPF 8 spp

~370 sec

Our 8 spp

~40 sec

Reference 4096 spp

~5000 sec

(53)

Reference 4096 spp

~5000 sec RPF

8 spp

~370 sec

Comparison to RPF

Our

Avg 289 spp

~370 sec

(54)

Comparison to RPF

RPF 16 spp

~1700 sec

Our 16 spp

~270 sec

Reference 8192 spp

~100000 sec

(55)

RPF 16 spp

~1700 sec

Comparison to RPF

Our

Avg 133 spp

~1700 sec

Reference 8192 spp

~100000 sec

(56)

Gaussian filters

GEM Our

Filtered Image

Filter Selection Map

(57)

Non-local means filters

Single NLM filter Reference

(58)

Non-local means filters

Reference

Combining all NLM filters

(59)

Discussion

• Our method inherits most of the advantages and disadvantages of the image space methods.

– Advantages:

• It does not assume any specific effects

• The computation and memory complexity only relate to the number of pixels

(60)

Discussion

• Our method inherits most of the advantages and disadvantages of the image space methods.

– Advantages:

• It does not assume any specific effects

• The computation and memory complexity only relate to the number of pixels

– Disadvantages:

• Oversmoothing

• Not considering high dimensional information

(61)

Discussion

– Disadvantages:

• Oversmoothing

• Not considering high dimensional information

Image-space Methods Multidimensional Methods

Image from

[Hachisuka et al. 2008]

(62)

Conclusion and future work

• We have presented a SURE-based

Adaptive Sampling and Reconstruction framework.

– Allow to use almost arbitrary filters.

• Future Work

– Implementation on GPUs for interactive applications

– Animation rendering

– More rendering applications using SURE

(63)

Conclusion and future work

• Rousselle et al. [2012] introduces an advanced non-local means filter designed for rendering task.

• Incorporate SURE and scene features buffer into

their method?

(64)

Acknowledgements

• Anonymous reviewers

• Funding agencies: NSC and NTU

• Model creators: Pedro Caparros, RenderHere,  Unity Development, Tippy, Skipper25, jotijoti,  ShareCG.com, dogbite1066, Tiago Crisostomo,  Marko Dabrovic and Crytek GmbH, Marko 

Dabrovic and Mihovil Odak, Andrew Kensler. 

(65)

參考文獻

相關文件

We present numerical results for Algorithm Elastic-Inexact applied to a set of 18 MPECs, showing the outcomes for each problem and analyzing whether exact complementarity,

In Section 3, we propose a GPU-accelerated discrete particle swarm optimization (DPSO) algorithm to find the optimal designs over irregular experimental regions in terms of the

Bootstrapping is a general approach to statistical in- ference based on building a sampling distribution for a statistic by resampling from the data at hand.. • The

The underlying idea was to use the power of sampling, in a fashion similar to the way it is used in empirical samples from large universes of data, in order to approximate the

Primal-dual approach for the mixed domination problem in trees Although we have presented Algorithm 3 for finding a minimum mixed dominating set in a tree, it is still desire to

In this section, we consider a solution of the Ricci flow starting from a compact manifold of dimension n 12 with positive isotropic curvature.. Our goal is to establish an analogue

Numerical experiments are done for a class of quasi-convex optimization problems where the function f (x) is a composition of a quadratic convex function from IR n to IR and

To facilitate the Administrator to create student accounts, a set of procedures is prepared for the Administrator to extract the student accounts from WebSAMS. For detailed