Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Ömercan Yazici

dblp:326/3612 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2024
0000-0003-0306-757XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 since 2021

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 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Rendering
light transport
1.322024
MARS: Multi-sample Allocation through Russian roulette and Splitting · SIGGRAPH Asia 2024
Efficiency-aware multiple importance sampling for bidirectional rendering algorithms · ACM Trans. Graph. 2022
Rendering › sampling
multiple importance sampling
1.322024
MARS: Multi-sample Allocation through Russian roulette and Splitting · SIGGRAPH Asia 2024
Efficiency-aware multiple importance sampling for bidirectional rendering algorithms · ACM Trans. Graph. 2022
Rendering
monte carlo integration
0.812024
MARS: Multi-sample Allocation through Russian roulette and Splitting · SIGGRAPH Asia 2024
Rendering › ray tracing
path tracing
0.812024
MARS: Multi-sample Allocation through Russian roulette and Splitting · SIGGRAPH Asia 2024
Rendering › ray tracing › path tracing
russian roulette and splitting
0.812024
MARS: Multi-sample Allocation through Russian roulette and Splitting · SIGGRAPH Asia 2024
Rendering › light transport
path guiding
0.212024
MARS: Multi-sample Allocation through Russian roulette and Splitting · SIGGRAPH Asia 2024
Rendering › ray tracing › path tracing
bidirectional path tracing
0.212022
Efficiency-aware multiple importance sampling for bidirectional rendering algorithms · ACM Trans. Graph. 2022

Methods — techniques the papers use, named apart from their topics

russian roulette and splitting · 0.8multiple importance sampling · 0.8monte carlo integration · 0.6efficiency estimation · 0.6
YearPublicationVenuePosition
2024 MARS: Multi-sample Allocation through Russian roulette and Splitting
abstract
Multiple importance sampling (MIS) is an indispensable tool in rendering that constructs robust sampling strategies by combining the respective strengths of individual distributions. Its efficiency can be greatly improved by carefully selecting the number of samples drawn from each distribution, but automating this process remains a challenging problem. Existing works are mostly limited to mixture sampling, in which only a single sample is drawn in total, and the works that do investigate multi-sample MIS only optimize the sample counts at a per-pixel level, which cannot account for variations beyond the first bounce. Recent work on Russian roulette and splitting has demonstrated how fixed-point schemes can be used to spatially vary sample counts to optimize image efficiency but is limited to choosing the same number of samples across all sampling strategies. Our work proposes a highly flexible sample allocation strategy that bridges the gap between these areas of work. We show how to iteratively optimize the sample counts to maximize the efficiency of the rendered image using a lightweight data structure, which allows us to make local and individual decisions per technique. We demonstrate the benefits of our approach in two applications, path guiding and bidirectional path tracing, in both of which we achieve consistent and substantial speedups over the respective previous state-of-the-art.
Joshua Meyer 0001, Alexander Rath, Ömercan Yazici, Philipp Slusallek
SIGGRAPH Asia3
2022 Efficiency-aware multiple importance sampling for bidirectional rendering algorithms
abstract
Multiple importance sampling (MIS) is an indispensable tool in light-transport simulation. It enables robust Monte Carlo integration by combining samples from several techniques. However, it is well understood that such a combination is not always more efficient than using a single sampling technique. Thus a major criticism of complex combined estimators, such as bidirectional path tracing, is that they can be significantly less efficient on common scenes than simpler algorithms like forward path tracing. We propose a general method to improve MIS efficiency: By cheaply estimating the efficiencies of various technique and sample-count combinations, we can pick the best one. The key ingredient is a numerically robust and efficient scheme that uses the samples of one MIS combination to compute the efficiency of multiple other combinations. For example, we can run forward path tracing and use its samples to decide which subset of VCM to enable, and at what sampling rates. The sample count for each technique can be controlled per-pixel or globally. Applied to VCM, our approach enables robust rendering of complex scenes with caustics, without compromising efficiency on simpler scenes.
Pascal Grittmann, Ömercan Yazici, Iliyan Georgiev, Philipp Slusallek
ACM Trans. Graph.2