Zheng Zeng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Zheng Zeng has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Ling-Qi Yan
Mohamed bin Zayed University of Artificial Intelligence, Abu Dhabi, United Arab Emirates
5 shared publications - Lu Wang
Shandong University
4 shared publications - Lifan Wu
NVIDIA, Redmond, USA
2 shared publications - Miloš Hašan
Nvidia, San Jose, USA
2 shared publications - Anton Kaplanyan
Intel Corporation, Bellevue, Washington, USA
1 shared publication - Beibei Wang
Nanjing University, Nanjing, China
1 shared publication
Latest Publications
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-11
VideoNeuMat: Neural Material Extraction from Generative Video Models
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Open AccessVideoNeuMat: Neural Material Extraction from Generative Video Models
- Open Access
- 14 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-10
Diffusion-Guided Relighting for Single-Image SVBRDF Estimation
- 14 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-10
Open AccessDiffusion-Guided Relighting for Single-Image SVBRDF Estimation
- Open Access
- 14 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-11
ReSTIR PG: Path Guiding with Spatiotemporally Resampled Paths
- 14 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Open AccessReSTIR PG: Path Guiding with Spatiotemporally Resampled Paths
- 24 July 2025
- Published by Wiley in Computer Graphics Forum
- Vol. 44 (4)
Reshadable Impostors with Level‐of‐Detail for Real‐Time Distant Objects Rendering
We propose a new image‐based representation for real‐time distant objects rendering: Reshadable Impostors with Level‐of‐Detail (RiLoD). By storing compact geometric and material information captured from a few reference views, RiLoD enables reliable forward mapping to generate target views under dynamic lighting and edited material attributes. In addition, it supports seamless transitions across different levels of detail. To support reshading and LoD simultaneously while maintaining a minimal memory footprint and bandwidth requirement, our key design is a compact yet efficient representation that encodes and compresses the necessary material and geometric information in each reference view. To further improve the visual fidelity, we use a reliable forward mapping technique combined with a hole‐filling filtering strategy to ensure geometric completeness and shading consistency. We demonstrate the practicality of RiLoD by integrating it into a modern real‐time renderer. RiLoD delivers fast performance across a variety of test scenes, supports smooth transitions between levels of detail as the camera moves closer or farther, and avoids the typical artifacts of impostor techniques that result from neglecting the underlying geometry.
- 24 July 2025
- Published by Wiley in Computer Graphics Forum
- Vol. 44 (4)
Reshadable Impostors with Level‐of‐Detail for Real‐Time Distant Objects Rendering
We propose a new image‐based representation for real‐time distant objects rendering: Reshadable Impostors with Level‐of‐Detail (RiLoD). By storing compact geometric and material information captured from a few reference views, RiLoD enables reliable forward mapping to generate target views under dynamic lighting and edited material attributes. In addition, it supports seamless transitions across different levels of detail. To support reshading and LoD simultaneously while maintaining a minimal memory footprint and bandwidth requirement, our key design is a compact yet efficient representation that encodes and compresses the necessary material and geometric information in each reference view. To further improve the visual fidelity, we use a reliable forward mapping technique combined with a hole‐filling filtering strategy to ensure geometric completeness and shading consistency. We demonstrate the practicality of RiLoD by integrating it into a modern real‐time renderer. RiLoD delivers fast performance across a variety of test scenes, supports smooth transitions between levels of detail as the camera moves closer or farther, and avoids the typical artifacts of impostor techniques that result from neglecting the underlying geometry.
- Open Access
- 13 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-11
RGB↔X: Image decomposition and synthesis using material- and lighting-aware diffusion models
The three areas of realistic forward rendering, per-pixel inverse rendering, and generative image synthesis may seem like separate and unrelated sub-fields of graphics and vision. However, recent work has demonstrated improved estimation of per-pixel intrinsic channels (albedo, roughness, metallicity) based on a diffusion architecture; we call this the RGB → X problem. We further show that the reverse problem of synthesizing realistic images given intrinsic channels, X → RGB, can also be addressed in a diffusion framework. Focusing on the image domain of interior scenes, we introduce an improved diffusion model for RGB → X, which also estimates lighting, as well as the first diffusion X → RGB model capable of synthesizing realistic images from (full or partial) intrinsic channels. Our X → RGB model explores a middle ground between traditional rendering and generative models: We can specify only certain appearance properties that should be followed, and give freedom to the model to hallucinate a plausible version of the rest. This flexibility allows using a mix of heterogeneous training datasets that differ in the available channels. We use multiple existing datasets and extend them with our own synthetic and real data, resulting in a model capable of extracting scene properties better than previous work and of generating highly realistic images of interior scenes.
- 13 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Open AccessRGB↔X: Image decomposition and synthesis using material- and lighting-aware diffusion models
The three areas of realistic forward rendering, per-pixel inverse rendering, and generative image synthesis may seem like separate and unrelated sub-fields of graphics and vision. However, recent work has demonstrated improved estimation of per-pixel intrinsic channels (albedo, roughness, metallicity) based on a diffusion architecture; we call this the RGB → X problem. We further show that the reverse problem of synthesizing realistic images given intrinsic channels, X → RGB, can also be addressed in a diffusion framework. Focusing on the image domain of interior scenes, we introduce an improved diffusion model for RGB → X, which also estimates lighting, as well as the first diffusion X → RGB model capable of synthesizing realistic images from (full or partial) intrinsic channels. Our X → RGB model explores a middle ground between traditional rendering and generative models: We can specify only certain appearance properties that should be followed, and give freedom to the model to hallucinate a plausible version of the rest. This flexibility allows using a mix of heterogeneous training datasets that differ in the available channels. We use multiple existing datasets and extend them with our own synthetic and real data, resulting in a model capable of extracting scene properties better than previous work and of generating highly realistic images of interior scenes.
- Open Access
- 10 December 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-11
ExtraSS: A Framework for Joint Spatial Super Sampling and Frame Extrapolation
We introduce ExtraSS, a novel framework that combines spatial super sampling and frame extrapolation to enhance real-time rendering performance. By integrating these techniques, our approach achieves a balance between performance and quality, generating temporally stable and high-quality, high-resolution results. Leveraging lightweight modules on warping and the ExtraSSNet for refinement, we exploit spatial-temporal information, improve rendering sharpness, handle moving shadings accurately, and generate temporally stable results. Computational costs are significantly reduced compared to traditional rendering methods, enabling higher frame rates and alias-free high resolution results. Evaluation using Unreal Engine demonstrates the benefits of our framework over conventional individual spatial or temporal super sampling methods, delivering improved rendering speed and visual quality. With its ability to generate temporally stable high-quality results, our framework creates new possibilities for real-time rendering applications, advancing the boundaries of performance and photo-realistic rendering in various domains.
- 10 December 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Open AccessExtraSS: A Framework for Joint Spatial Super Sampling and Frame Extrapolation
We introduce ExtraSS, a novel framework that combines spatial super sampling and frame extrapolation to enhance real-time rendering performance. By integrating these techniques, our approach achieves a balance between performance and quality, generating temporally stable and high-quality, high-resolution results. Leveraging lightweight modules on warping and the ExtraSSNet for refinement, we exploit spatial-temporal information, improve rendering sharpness, handle moving shadings accurately, and generate temporally stable results. Computational costs are significantly reduced compared to traditional rendering methods, enabling higher frame rates and alias-free high resolution results. Evaluation using Unreal Engine demonstrates the benefits of our framework over conventional individual spatial or temporal super sampling methods, delivering improved rendering speed and visual quality. With its ability to generate temporally stable high-quality results, our framework creates new possibilities for real-time rendering applications, advancing the boundaries of performance and photo-realistic rendering in various domains.
- Open Access
- 26 July 2023
- Published by Wiley in Computer Graphics Forum
- Vol. 42 (4)
Ray‐aligned Occupancy Map Array for Fast Approximate Ray Tracing
We present a new software ray tracing solution that efficiently computes visibilities in dynamic scenes. We first introduce a novel scene representation: ray‐aligned occupancy map array (ROMA) that is generated by rasterizing the dynamic scene once per frame. Our key contribution is a fast and low‐divergence tracing method computing visibilities in constant time, without constructing and traversing the traditional intersection acceleration data structures such as BVH. To further improve accuracy and alleviate aliasing, we use a spatiotemporal scheme to stochastically distribute the candidate ray samples. We demonstrate the practicality of our method by integrating it into a modern real‐time renderer and showing better performance compared to existing techniques based on distance fields (DFs). Our method is free of the typical artifacts caused by incomplete scene information, and is about 2.5×–10× faster than generating and tracing DFs at the same resolution and equal storage.
- 26 July 2023
- Published by Wiley in Computer Graphics Forum
- Vol. 42 (4)
Open AccessRay‐aligned Occupancy Map Array for Fast Approximate Ray Tracing
We present a new software ray tracing solution that efficiently computes visibilities in dynamic scenes. We first introduce a novel scene representation: ray‐aligned occupancy map array (ROMA) that is generated by rasterizing the dynamic scene once per frame. Our key contribution is a fast and low‐divergence tracing method computing visibilities in constant time, without constructing and traversing the traditional intersection acceleration data structures such as BVH. To further improve accuracy and alleviate aliasing, we use a spatiotemporal scheme to stochastically distribute the candidate ray samples. We demonstrate the practicality of our method by integrating it into a modern real‐time renderer and showing better performance compared to existing techniques based on distance fields (DFs). Our method is free of the typical artifacts caused by incomplete scene information, and is about 2.5×–10× faster than generating and tracing DFs at the same resolution and equal storage.
- 1 May 2021
- Published by Wiley in Computer Graphics Forum
- Vol. 40 (2) , 79-90
Temporally Reliable Motion Vectors for Real‐time Ray Tracing
Real‐time ray tracing (RTRT) is being pervasively applied. The key to RTRT is a reliable denoising scheme that reconstructs clean images from significantly undersampled noisy inputs, usually at 1 sample per pixel as limited by current hardware's computing power. The state of the art reconstruction methods all rely on temporal filtering to find correspondences of current pixels in the previous frame, described using per‐pixel screen‐space motion vectors. While these approaches are demonstrated powerful, they suffer from a common issue that the temporal information cannot be used when the motion vectors are not valid, i.e. when temporal correspondences are not obviously available or do not exist in theory.We introduce temporally reliable motion vectors that aim at deeper exploration of temporal coherence, especially for the generally‐believed difficult applications on shadows, glossy reflections and occlusions, with the key idea to detect and track the cause of each effect. We show that our temporally reliable motion vectors produce significantly better temporal results on a variety of dynamic scenes when compared to the state of the art methods, but with negligible performance overhead.
- 1 May 2021
- Published by Wiley in Computer Graphics Forum
- Vol. 40 (2) , 79-90
Temporally Reliable Motion Vectors for Real‐time Ray Tracing
Real‐time ray tracing (RTRT) is being pervasively applied. The key to RTRT is a reliable denoising scheme that reconstructs clean images from significantly undersampled noisy inputs, usually at 1 sample per pixel as limited by current hardware's computing power. The state of the art reconstruction methods all rely on temporal filtering to find correspondences of current pixels in the previous frame, described using per‐pixel screen‐space motion vectors. While these approaches are demonstrated powerful, they suffer from a common issue that the temporal information cannot be used when the motion vectors are not valid, i.e. when temporal correspondences are not obviously available or do not exist in theory.We introduce temporally reliable motion vectors that aim at deeper exploration of temporal coherence, especially for the generally‐believed difficult applications on shadows, glossy reflections and occlusions, with the key idea to detect and track the cause of each effect. We show that our temporally reliable motion vectors produce significantly better temporal results on a variety of dynamic scenes when compared to the state of the art methods, but with negligible performance overhead.