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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Fujia Su

dblp:326/3593 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2024
0000-0003-2347-0825ORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 2 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 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Rendering › ray tracing › path tracing
bidirectional path tracing
1.322024
Proxy Tracing: Unbiased Reciprocal Estimation for Optimized Sampling in BDPT · ACM Trans. Graph. 2024
SPCBPT: subspace-based probabilistic connections for bidirectional path tracing · ACM Trans. Graph. 2022
Rendering
global illumination
1.322024
Proxy Tracing: Unbiased Reciprocal Estimation for Optimized Sampling in BDPT · ACM Trans. Graph. 2024
SPCBPT: subspace-based probabilistic connections for bidirectional path tracing · ACM Trans. Graph. 2022
Rendering
monte carlo integration
1.322024
Proxy Tracing: Unbiased Reciprocal Estimation for Optimized Sampling in BDPT · ACM Trans. Graph. 2024
SPCBPT: subspace-based probabilistic connections for bidirectional path tracing · ACM Trans. Graph. 2022
Rendering › monte carlo rendering
unbiased estimation
0.812024
Proxy Tracing: Unbiased Reciprocal Estimation for Optimized Sampling in BDPT · ACM Trans. Graph. 2024
Rendering › sampling
multiple importance sampling
0.612022
SPCBPT: subspace-based probabilistic connections for bidirectional path tracing · ACM Trans. Graph. 2022

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

reciprocal probability density estimation · 0.8proxy sampling · 0.8multiple importance sampling · 0.8variance upper bound minimization · 0.6two-stage sampling · 0.6subspace sampling · 0.6
YearPublicationVenuePosition
2024 Proxy Tracing: Unbiased Reciprocal Estimation for Optimized Sampling in BDPT
abstract
Robust light transport algorithms, particularly bidirectional path tracing (BDPT), face significant challenges when dealing with specular or highly glossy involved paths. BDPT constructs the full path by connecting sub-paths traced individually from the light source and camera. However, it remains difficult to sample by connecting vertices on specular and glossy surfaces with narrow-lobed BSDF, as it poses severe constraints on sampling in the feasible direction. To address this issue, we propose a novel approach, called proxy sampling , that enables efficient sub-path connection of these challenging paths. When a low-contribution specular/glossy connection occurs, we drop out the problematic neighboring vertex next to this specular/glossy vertex from the original path, then retrace an alternative sub-path as a proxy to complement this incomplete path. This newly constructed complete path ensures that the connection adheres to the constraint of the narrow lobe within the BSDF of the specular/glossy surface. Unbiased reciprocal estimation is the key to our method to obtain a probability density function (PDF) reciprocal to ensure unbiased rendering. We derive the reciprocal estimation method and provide an efficiency-optimized setting for efficient sampling and connection. Our method provides a robust tool for substituting problematic paths with favorable alternatives while ensuring unbiasedness. We validate this approach in the probabilistic connections BDPT for addressing specular-involved difficult paths. Experimental results have proved the effectiveness and efficiency of our approach, showcasing high-performance rendering capabilities across diverse settings.
Fujia Su, Qingyang Yin, Yanchen Zhang, Sheng Li 0008
ACM Trans. Graph.1
2022 SPCBPT: subspace-based probabilistic connections for bidirectional path tracing
abstract
Bidirectional path tracing (BDPT) can be accelerated by selecting appropriate light sub-paths for connection. However, existing algorithms need to perform frequent distribution reconstruction and have expensive overhead. We present a novel approach, SPCBPT, for probabilistic connections that constructs the light selection distribution in sub-path space. Our approach bins the sub-paths into multiple subspaces and keeps the sub-paths in the same subspace of low discrepancy, wherein the light sub-paths can be selected by a subspace-based two-stage sampling method, i.e., first sampling the light subspace and then resampling the light sub-paths within this subspace. The subspace-based distribution is free of reconstruction and provides efficient light selection at a very low cost. We also propose a method that considers the Multiple Importance Sampling (MIS) term in the light selection and thus obtain an MIS-aware distribution that can minimize the upper bound of variance of the combined estimator. Prior methods typically omit this MIS weights term. We evaluate our algorithm using various benchmarks, and the results show that our approach has superior performance and can significantly reduce the noise compared with the state-of-the-art method.
Fujia Su, Sheng Li 0008
ACM Trans. Graph.1