EDBT 2026 Demo / reviewers in the wild / expert
Ivo Kondapaneni
dblp:21/269
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2019
0000-0003-2600-4416ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer graphics and multimedia
2 papers |
Rendering · 100% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Rendering
light transport |
0.4 | 1 | 2019 | Optimal multiple importance sampling · ACM Trans. Graph. 2019 |
Rendering
monte carlo rendering |
0.4 | 1 | 2019 | Optimal multiple importance sampling · ACM Trans. Graph. 2019 |
Rendering › sampling
multiple importance sampling |
0.4 | 1 | 2019 | Optimal multiple importance sampling · ACM Trans. Graph. 2019 |
Rendering › light transport
direct lighting |
0.3 | 1 | 2018 | Bayesian online regression for adaptive direct illumination sampling · ACM Trans. Graph. 2018 |
Rendering
monte carlo integration |
0.3 | 1 | 2018 | Bayesian online regression for adaptive direct illumination sampling · ACM Trans. Graph. 2018 |
Rendering › monte carlo rendering
variance reduction |
0.3 | 1 | 2018 | Bayesian online regression for adaptive direct illumination sampling · ACM Trans. Graph. 2018 |
Rendering
physically based rendering |
0.1 | 1 | 2018 | Bayesian online regression for adaptive direct illumination sampling · ACM Trans. Graph. 2018 |
Rendering
progressive rendering |
0.1 | 1 | 2018 | Bayesian online regression for adaptive direct illumination sampling · ACM Trans. Graph. 2018 |
Methods — techniques the papers use, named apart from their topics
control variates · 0.7variance analysis · 0.4light clustering · 0.3bayesian regression · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Optimal multiple importance samplingabstractMultiple Importance Sampling (MIS) is a key technique for achieving robustness of Monte Carlo estimators in computer graphics and other fields. We derive optimal weighting functions for MIS that provably minimize the variance of an MIS estimator, given a set of sampling techniques. We show that the resulting variance reduction over the balance heuristic can be higher than predicted by the variance bounds derived by Veach and Guibas, who assumed only non-negative weights in their proof. We theoretically analyze the variance of the optimal MIS weights and show the relation to the variance of the balance heuristic. Furthermore, we establish a connection between the new weighting functions and control variates as previously applied to mixture sampling. We apply the new optimal weights to integration problems in light transport and show that they allow for new design considerations when choosing the appropriate sampling techniques for a given integration problem. Ivo Kondapaneni, Petr Vévoda, Pascal Grittmann, Tomás Skrivan, Philipp Slusallek, Jaroslav Krivánek |
ACM Trans. Graph. | 1 |
| 2018 | Bayesian online regression for adaptive direct illumination samplingabstractDirect illumination calculation is an important component of any physically-based Tenderer with a substantial impact on the overall performance. We present a novel adaptive solution for unbiased Monte Carlo direct illumination sampling, based on online learning of the light selection probability distributions. Our main contribution is a formulation of the learning process as Bayesian regression, based on a new, specifically designed statistical model of direct illumination. The net result is a set of regularization strategies to prevent over-fitting and ensure robustness even in early stages of calculation, when the observed information is sparse. The regression model captures spatial variation of illumination, which enables aggregating statistics over relatively large scene regions and, in turn, ensures a fast learning rate. We make the method scalable by adopting a light clustering strategy from the Lightcuts method, and further reduce variance through the use of control variates. As a main design feature, the resulting algorithm is virtually free of any preprocessing, which enables its use for interactive progressive rendering, while the online learning still enables super-linear convergence. Petr Vévoda, Ivo Kondapaneni, Jaroslav Krivánek |
ACM Trans. Graph. | 2 |