Multiple importance sampling revisited: breaking the bounds

被引:17
作者
Sbert, Mateu [1 ,2 ]
Havran, Vlastimil [3 ]
Szirmay-Kalos, Laszlo [4 ]
机构
[1] Tianjin Univ, Sch Comp Sci & Technol, Tianjin, Peoples R China
[2] Univ Girona, Dept Informat Appl Math & Stat, Campus Montilivi, Girona, Spain
[3] Czech Tech Univ, Fac Elect Engn, Prague, Czech Republic
[4] Budapest Tech Univ, Budapest, Hungary
关键词
Global illumination; Rendering equation analysis; Multiple importance sampling; Monte Carlo; CONVERGENCE;
D O I
10.1186/s13634-018-0531-2
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We revisit the multiple importance sampling (MIS) estimator and investigate the bound on the efficiency improvement over balance heuristic estimator with equal count of samples established in Veach's thesis. We revise the proof for this and come to the conclusion that there is no such bound and henceforth it makes sense to look for new estimators that improve on balance heuristic estimator with equal count of samples. Next, we examine a recently introduced non-balance heuristic MIS estimator that is provably better than balance heuristic with equal count of samples, and we improve it both in variance and efficiency. We then obtain an equally provably better one-sample balance heuristic estimator, and finally, we introduce a heuristic for the count of samples that can be used when the individual techniques are biased. All in all, we present three new sampling strategies to improve on both variance and efficiency on the balance heuristic using non-equal count of samples. Our scheme requires the previous knowledge of several quantities, but those can be obtained in an adaptive way. The results also show that by a careful examination of the variance and properties of the estimators, even better estimators could be discovered in the future. We present examples that support our theoretical findings.
引用
收藏
页数:15
相关论文
共 27 条
[11]  
Havran V., 2014, P 13 ACM SIGGRAPH IN, P141
[12]  
Lafortune E., 1994, CW197 KU LEUV DEP CO
[13]   Second-Order Approximation for Variance Reduction in Multiple Importance Sampling [J].
Lu, H. ;
Pacanowski, R. ;
Granier, X. .
COMPUTER GRAPHICS FORUM, 2013, 32 (07) :131-136
[14]  
Marin J.M., 2012, ARXIV12112548
[15]  
Marjanovic MM, 2007, TEACH MATH-SERB, V10, P11
[16]   An Adaptive Population Importance Sampler: Learning From Uncertainty [J].
Martino, Luca ;
Elvira, Victor ;
Luengo, David ;
Corander, Jukka .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2015, 63 (16) :4422-4437
[17]   Safe and effective importance sampling [J].
Owen, A ;
Zhou, Y .
JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 2000, 95 (449) :135-143
[18]   Representativity for Robust and Adaptive Multiple Importance Sampling [J].
Pajot, Anthony ;
Barthe, Loic ;
Paulin, Mathias ;
Poulin, Pierre .
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2011, 17 (08) :1108-1121
[19]  
Pharr M., 2010, PHYS BASED RENDERING
[20]   WEAK CONVERGENCE AND OPTIMAL SCALING OF RANDOM WALK METROPOLIS ALGORITHMS [J].
Roberts, G. O. ;
Gelman, A. ;
Gilks, W. R. .
ANNALS OF APPLIED PROBABILITY, 1997, 7 (01) :110-120