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

Chen Wang 0149

dblp:82/4206-149 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
4since 2021 · last 2025
0000-0002-1783-818XORCID · conflict

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

Graphics, computer vision, multimedia, augmented reality and games · 4 · 4 since 2021Artificial intelligence and machine learning · 3 · 2 since 2021Software engineering, systems software and programming languages · 1

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
4 papers
Rendering · 75% Computer animation and physical simulation · 12% Visual content generation and editing · 10%
Artificial intelligence
1 paper
Efficient and distributed learning · 100%

Topics — the 10 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Rendering
monte carlo rendering
1.722025
Bernstein Bounds for Caustics · ACM Trans. Graph. 2025
Real-Time Neural Denoising with Render-Aware Knowledge Distillation · AAAI 2025
Machine learning › Efficient and distributed learning › model compression
knowledge distillation
0.912025
Real-Time Neural Denoising with Render-Aware Knowledge Distillation · AAAI 2025
Machine learning › Efficient and distributed learning
model compression
0.912025
Real-Time Neural Denoising with Render-Aware Knowledge Distillation · AAAI 2025
Rendering › global illumination
caustics rendering
0.912025
Bernstein Bounds for Caustics · ACM Trans. Graph. 2025
Rendering › monte carlo rendering
monte carlo denoising
0.912025
Real-Time Neural Denoising with Render-Aware Knowledge Distillation · AAAI 2025
Rendering › appearance acquisition
material appearance acquisition
0.812024
Practical Measurements of Translucent Materials with Inter-Pixel Translucency Prior · CVPR 2024
Computer animation and physical simulation › physically-based modeling
material modeling
0.812024
Practical Measurements of Translucent Materials with Inter-Pixel Translucency Prior · CVPR 2024
Visual content generation and editing › image editing
image compositing
0.712023
ShadowMover: Automatically Projecting Real Shadows onto Virtual Object · IEEE Trans. Vis. Comput. Graph. 2023
Rendering
shadow rendering
0.712023
ShadowMover: Automatically Projecting Real Shadows onto Virtual Object · IEEE Trans. Vis. Comput. Graph. 2023
Virtual and augmented reality
augmented reality
0.212023
ShadowMover: Automatically Projecting Real Shadows onto Virtual Object · IEEE Trans. Vis. Comput. Graph. 2023

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

parameter transfer · 1.7generative adversarial network · 1.7adversarial learning · 1.7convolutional neural network · 1.4variance optimization · 0.9stochastic sampling · 0.9bernstein basis bounding · 0.9inter-pixel translucency prior · 0.8shifted shadow map · 0.7large-scale dataset · 0.7
YearPublicationVenuePosition
2025 Real-Time Neural Denoising with Render-Aware Knowledge Distillation
abstract
Real-time Monte Carlo (MC) ray tracing with low sampling rates demands a denoising algorithm that adeptly balances the trade-off between quality and efficiency. Previous works have paid much attention on designing delicate denoising architecture while ignoring model compression. In this work, we present a render-aware knowledge distillation (RAKD) framework, specifically designed for Monte Carlo denoising. We meticulously delineate the Knowledge Distillation (KD) process within RAKD, emphasizing three pivotal techniques: the strategic incorporation of an auxiliary unlabeled dataset, the integration of adversarial learning through generative adversarial network (GAN), and the application of parameter transfer for robust model initialization. These approaches are harmoniously combined to distill knowledge effectively, enabling our student model to adeptly strike a balance between preserving high-frequency details and reducing low-frequency noise. Finally, our results demonstrate that RAKD achieves state-of-the-art quality while upholding real-time performance, successfully tackling the computational constraints faced by resource-limited devices.
Mengxun Kong, Jie Guo 0001, Chen Wang 0149, Yanwen Guo 0001
AAAI3
2025 Bernstein Bounds for Caustics
abstract
Systematically simulating specular light transport requires an exhaustive search for triangle tuples containing admissible paths. Given the extreme inefficiency of enumerating all combinations, we significantly reduce the search domain by stochastically sampling such tuples. The challenge is to design proper sampling probabilities that keep the noise level controllable. Our key insight is that by bounding the irradiance contributed by each triangle tuple at a given position, we can sample a subset of triangle tuples with potentially high contributions. Although low-contribution tuples are assigned a negligible probability, the overall variance remains low. Therefore, we derive position and irradiance bounds for caustics casted by each triangle tuple, introducing a bounding property of rational functions on a Bernstein basis. When formulating position and irradiance expressions into rational functions, we handle non-rational parts through remainder variables to maintain bounding validity. Finally, we carefully design the sampling probabilities by optimizing the upper bound of the variance, expressed only using the position and irradiance bounds. The bound-driven sampling of triangle tuples is intrinsically unbiased even without defensive sampling. It can be combined with various unbiased and biased root-finding techniques within a local triangle domain. Extensive evaluations show that our method enables the fast and reliable rendering of complex caustics effects. Yet, our method is efficient for no more than two specular vertices, where complexity grows sublinearly to the number of triangles and linearly to that of emitters, and does not consider the Fresnel and visibility terms. We also rely on parameters to control subdivisions.
Zhimin Fan 0001, Chen Wang 0149, Boxuan Li, Lingqi Yan 0001, Yanwen Guo 0001, Jie Guo 0001
ACM Trans. Graph.2
2024 Practical Measurements of Translucent Materials with Inter-Pixel Translucency Prior
abstract
Material appearance is a key component of photorealism, with a pronounced impact on human perception. Although there are many prior works targeting at measuring opaque materials using light-weight setups (e.g., consumer-level cameras), little attention is paid on acquiring the optical properties of translucent materials which are also quite common in nature. In this paper, we present a practical method for acquiring scattering properties of translucent materials, based solely on ordinary images captured with unknown lighting and camera parameters. The key to our method is an inter-pixel translucency prior which states that image pixels of a given homogeneous translucent material typically form curves (dubbed translucent curves) in the RGB space, of which the shapes are determined by the parameters of the material. We leverage this prior in a specially-designed convolutional neural network comprising multiple encoders, a translucency-aware feature fusion module and a cascaded decoder. We demonstrate, through both visual comparisons and quantitative evaluations, that high accuracy can be achieved on a wide range of real-world translucent materials.
Zhenyu Chen 0001, Jie Guo 0001, Shuichang Lai, Ruoyu Fu, Mengxun Kong, Chen Wang 0149, Hongyu Sun 0001, Zhebin Zhang, Chen Li 0062, Yanwen Guo 0001
CVPR6
2023 ShadowMover: Automatically Projecting Real Shadows onto Virtual Object
abstract
Inserting 3D virtual objects into real-world images has many applications in photo editing and augmented reality. One key issue to ensure the reality of the composite whole scene is to generate consistent shadows between virtual and real objects. However, it is challenging to synthesize visually realistic shadows for virtual and real objects without any explicit geometric information of the real scene or manual intervention, especially for the shadows on the virtual objects projected by real objects. In view of this challenge, we present, to our knowledge, the first end-to-end solution to fully automatically project real shadows onto virtual objects for outdoor scenes. In our method, we introduce the Shifted Shadow Map, a new shadow representation that encodes the binary mask of shifted real shadows after inserting virtual objects in an image. Based on the shifted shadow map, we propose a CNN-based shadow generation model named ShadowMover which first predicts the shifted shadow map for an input image and then automatically generates plausible shadows on any inserted virtual object. A large-scale dataset is constructed to train the model. Our ShadowMover is robust to various scene configurations without relying on any geometric information of the real scene and is free of manual intervention. Extensive experiments validate the effectiveness of our method.
Piaopiao Yu, Jie Guo 0001, Zhenyu Chen 0001, Chen Wang 0149, Yan Zhang 0057, Yanwen Guo 0001
IEEE Trans. Vis. Comput. Graph.5
2014 Bug Inducing Analysis to Prevent Fault Prone Bug Fixes
Chen Wang 0149, Qingkai Shi, Yang Feng 0003, Zhenyu Chen 0001
SEKE2