Shuang Zhao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Shuang Zhao has a total of 86 co-authors. Here are the top co-authors by number of shared publications:
- Lifan Wu
NVIDIA, Redmond, USA
6 shared publications - Feng Xu
Tsinghua University, Beijing, China
4 shared publications - Chris Wyman
NVIDIA, Redmond, USA
3 shared publications - Ioannis Gkioulekas
Carnegie Mellon University
3 shared publications - Jingwang Ling
School of Software and BNRist, Tsinghua University, Beijing, China
3 shared publications - Kai Yan
University of California Irvine, Irvine, USA
3 shared publications
Latest Publications
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-9
Adaptive Ray Marching for Rendering Gaussian Process Implicit Surfaces
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-9
Open AccessAdaptive Ray Marching for Rendering Gaussian Process Implicit Surfaces
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-8
Real-Time Level-of-Detail rendering with ReSTIR
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-8
Open AccessReal-Time Level-of-Detail rendering with ReSTIR
- Open Access
- 3 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (4) , 1-12
Robust Computation of Boundary Path Integrals Using Kernel-Density Estimation
To enable differentiation with respect to object geometries, boundary path integrals—central to physics-based differentiable rendering—must be estimated numerically. Although their mathematical formulation is well established, designing efficient and robust numerical estimators remains challenging. Most state-of-the-art boundary sampling methods rely on primary-sample-space guiding, which tends to break down on finely tessellated geometries; reparameterization-based alternatives, meanwhile, often incur high variance and/or significant computational overhead. In this paper, we introduce a simple, robust, and consistent solution to this problem. At the core of our approach is a novel formulation of the boundary integral based on kernel-density estimation. Much like photon mapping, we slightly expand the measure-zero domain of integration with a kernel, sidestepping the need to sample directly on a delta-function region in path space. To our knowledge, this is the first such application of kernel-density methods for boundary integral evaluation. We validate our method by comparing its derivative estimates against finite differences (FD), and further demonstrate its practical utility by benchmarking against several state-of-the-art baselines in synthetic inverse-rendering scenarios.
- 3 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (4) , 1-12
Open AccessRobust Computation of Boundary Path Integrals Using Kernel-Density Estimation
To enable differentiation with respect to object geometries, boundary path integrals—central to physics-based differentiable rendering—must be estimated numerically. Although their mathematical formulation is well established, designing efficient and robust numerical estimators remains challenging. Most state-of-the-art boundary sampling methods rely on primary-sample-space guiding, which tends to break down on finely tessellated geometries; reparameterization-based alternatives, meanwhile, often incur high variance and/or significant computational overhead. In this paper, we introduce a simple, robust, and consistent solution to this problem. At the core of our approach is a novel formulation of the boundary integral based on kernel-density estimation. Much like photon mapping, we slightly expand the measure-zero domain of integration with a kernel, sidestepping the need to sample directly on a delta-function region in path space. To our knowledge, this is the first such application of kernel-density methods for boundary integral evaluation. We validate our method by comparing its derivative estimates against finite differences (FD), and further demonstrate its practical utility by benchmarking against several state-of-the-art baselines in synthetic inverse-rendering scenarios.
- Open Access
- 3 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (4) , 1-15
Sample Matching for Joint Extinction Gradient Estimation in Differentiable Volume Rendering
Differentiable volume rendering enables gradient-based optimization of volumetric scenes, but unbiased estimators suffer from high gradient variance. We observe that the extinction gradients split into two components on structurally different integration domains: a scattering term evaluated at a single path vertex, and a transmittance term integrated along the ray segment. Because the domains are mismatched, existing estimators sample the two components at different locations, leaving the negative correlation between their opposite-signed contributions unexploited. We expose this overlooked correlation and exploit it through a principle we call sample matching : evaluate both components at shared sample locations. To enable this, we derive the first reformulation of the differential path integral that couples the two contributions within a single integrand, yielding an unbiased Monte Carlo estimator that ties them together by construction. For efficiency, the estimator reuses partially sampled light paths and amortizes in-scattering cost by evaluating gradients at multiple probe points per segment. On voxel-grid reconstruction, our estimator reduces gradient variance by up to 80% over differential ratio tracking (DRT), yielding faster convergence and higher reconstruction quality.
- 3 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (4) , 1-15
Open AccessSample Matching for Joint Extinction Gradient Estimation in Differentiable Volume Rendering
Differentiable volume rendering enables gradient-based optimization of volumetric scenes, but unbiased estimators suffer from high gradient variance. We observe that the extinction gradients split into two components on structurally different integration domains: a scattering term evaluated at a single path vertex, and a transmittance term integrated along the ray segment. Because the domains are mismatched, existing estimators sample the two components at different locations, leaving the negative correlation between their opposite-signed contributions unexploited. We expose this overlooked correlation and exploit it through a principle we call sample matching : evaluate both components at shared sample locations. To enable this, we derive the first reformulation of the differential path integral that couples the two contributions within a single integrand, yielding an unbiased Monte Carlo estimator that ties them together by construction. For efficiency, the estimator reuses partially sampled light paths and amortizes in-scattering cost by evaluating gradients at multiple probe points per segment. On voxel-grid reconstruction, our estimator reduces gradient variance by up to 80% over differential ratio tracking (DRT), yielding faster convergence and higher reconstruction quality.
- Open Access
- 3 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (4) , 1-11
Gradient Domain Reconstruction for Monte Carlo PDE Solvers
Grid-free Monte Carlo methods are capable of solving Poisson equations on highly complex domains. However, existing methods operate solely in the primal domain and can converge slowly due to high variance. Inspired by gradient-domain rendering, we introduce a gradient-domain framework for Poisson problems. Specifically, we devise a new Monte Carlo estimator that directly targets differences of the solution between spatially varying query locations. Further, we adopt state-of-the-art reconstruction techniques originated in gradient-domain rendering to allow efficient reconstruction of the solutions without incurring additional bias. We demonstrate the effectiveness of our technique by comparing solutions obtained using our method and several state-of-the-art baselines.
- 3 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (4) , 1-11
Open AccessGradient Domain Reconstruction for Monte Carlo PDE Solvers
Grid-free Monte Carlo methods are capable of solving Poisson equations on highly complex domains. However, existing methods operate solely in the primal domain and can converge slowly due to high variance. Inspired by gradient-domain rendering, we introduce a gradient-domain framework for Poisson problems. Specifically, we devise a new Monte Carlo estimator that directly targets differences of the solution between spatially varying query locations. Further, we adopt state-of-the-art reconstruction techniques originated in gradient-domain rendering to allow efficient reconstruction of the solutions without incurring additional bias. We demonstrate the effectiveness of our technique by comparing solutions obtained using our method and several state-of-the-art baselines.
- Open Access
- 10 April 2026
- Published by Wiley in Computer Graphics Forum
PBR‐Inspired Controllable Diffusion for Image Generation
Despite recent advances in text‐to‐image generation, controlling geometric layout and PBR material properties in synthesized scenes remains challenging. We present a pipeline that first produces a G‐buffer (albedo, normals, depth, roughness, shading, and metallic) from a text prompt and then renders a final image through a PBR‐inspired branch network. This intermediate representation enables fine‐grained control: users can copy and paste within specific G‐buffer channels to insert or reposition objects, or apply masks to the irradiance channel to adjust lighting locally. As a result, real objects can be seamlessly integrated into virtual scenes. By separating user‐friendly scene description from image rendering, our method offers a practical balance between detailed post‐generation control and efficient text‐driven synthesis. We demonstrate its effectiveness through quantitative evaluations and a user study with 156 participants, showing consistent human preference over strong baselines and confirming that G‐buffer control extends the flexibility of text‐guided image generation.
- 10 April 2026
- Published by Wiley in Computer Graphics Forum
Open AccessPBR‐Inspired Controllable Diffusion for Image Generation
Despite recent advances in text‐to‐image generation, controlling geometric layout and PBR material properties in synthesized scenes remains challenging. We present a pipeline that first produces a G‐buffer (albedo, normals, depth, roughness, shading, and metallic) from a text prompt and then renders a final image through a PBR‐inspired branch network. This intermediate representation enables fine‐grained control: users can copy and paste within specific G‐buffer channels to insert or reposition objects, or apply masks to the irradiance channel to adjust lighting locally. As a result, real objects can be seamlessly integrated into virtual scenes. By separating user‐friendly scene description from image rendering, our method offers a practical balance between detailed post‐generation control and efficient text‐driven synthesis. We demonstrate its effectiveness through quantitative evaluations and a user study with 156 participants, showing consistent human preference over strong baselines and confirming that G‐buffer control extends the flexibility of text‐guided image generation.
- 10 April 2026
- Published by Wiley in Computer Graphics Forum
- p. e70328
Gradient‐Domain ReSTIR Path Tracing
Gradient‐domain rendering accelerates realistic image synthesis by also estimating pixel color differences, which helps reconstruct high frequencies in the image domain. Converged images still require many samples per pixel even with denoising, and to this date, no real‐time gradient‐domain rendering methods have been proposed. We enable gradient‐domain methods in real‐time rendering by spatiotemporal sample reuse with a novel path space extension in gradient image rendering. We further explore this concept by implementing ReSTIR G‐PT, ReSTIR gradient‐domain path tracing, and find that relative sparsity of the gradient image allows highly selective spatial reuse and real‐time frame rates. Our method outperforms the baseline methods visually and statistically.
- 10 April 2026
- Published by Wiley in Computer Graphics Forum
- p. e70328
Gradient‐Domain ReSTIR Path Tracing
Gradient‐domain rendering accelerates realistic image synthesis by also estimating pixel color differences, which helps reconstruct high frequencies in the image domain. Converged images still require many samples per pixel even with denoising, and to this date, no real‐time gradient‐domain rendering methods have been proposed. We enable gradient‐domain methods in real‐time rendering by spatiotemporal sample reuse with a novel path space extension in gradient image rendering. We further explore this concept by implementing ReSTIR G‐PT, ReSTIR gradient‐domain path tracing, and find that relative sparsity of the gradient image allows highly selective spatial reuse and real‐time frame rates. Our method outperforms the baseline methods visually and statistically.
- Open Access
- 4 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (6) , 1-16
Robust Derivative Estimation with Walk on Stars
Monte Carlo methods based on the walk on spheres (WoS) algorithm offer a parallel, progressive, and output-sensitive approach for solving partial differential equations (PDEs) in complex geometric domains. Building on this foundation, the walk on stars (WoSt) method generalizes WoS to support mixed Dirichlet, Neumann, and Robin boundary conditions. However, accurately computing spatial derivatives of PDE solutions remains a major challenge: existing methods exhibit high variance and bias near the domain boundary, especially in Neumann-dominated problems. We address this limitation with a new extension of WoSt specifically designed for derivative estimation. Our method reformulates the boundary integral equation (BIE) for Poisson PDEs by directly leveraging the harmonicity of spatial derivatives. Combined with a tailored random-walk sampling scheme and an unbiased early termination strategy, we achieve significantly improved accuracy in derivative estimates near the Neumann boundary. We further demonstrate the effectiveness of our approach across various tasks, including recovering the non-unique solution to a pure Neumann problem with reduced bias and variance, constructing divergence-free vector fields, and optimizing parametrically defined boundaries under PDE constraints.
- 4 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (6) , 1-16
Open AccessRobust Derivative Estimation with Walk on Stars
Monte Carlo methods based on the walk on spheres (WoS) algorithm offer a parallel, progressive, and output-sensitive approach for solving partial differential equations (PDEs) in complex geometric domains. Building on this foundation, the walk on stars (WoSt) method generalizes WoS to support mixed Dirichlet, Neumann, and Robin boundary conditions. However, accurately computing spatial derivatives of PDE solutions remains a major challenge: existing methods exhibit high variance and bias near the domain boundary, especially in Neumann-dominated problems. We address this limitation with a new extension of WoSt specifically designed for derivative estimation. Our method reformulates the boundary integral equation (BIE) for Poisson PDEs by directly leveraging the harmonicity of spatial derivatives. Combined with a tailored random-walk sampling scheme and an unbiased early termination strategy, we achieve significantly improved accuracy in derivative estimates near the Neumann boundary. We further demonstrate the effectiveness of our approach across various tasks, including recovering the non-unique solution to a pure Neumann problem with reduced bias and variance, constructing divergence-free vector fields, and optimizing parametrically defined boundaries under PDE constraints.
- Open Access
- 27 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Image-space Adaptive Sampling for Fast Inverse Rendering
- 27 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Open AccessImage-space Adaptive Sampling for Fast Inverse Rendering
- Open Access
- 27 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-12
Guiding-Based Importance Sampling for Walk on Stars
- 27 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-12
Open AccessGuiding-Based Importance Sampling for Walk on Stars