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 Liu 0029

dblp:10/2639-29 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
3since 2021 · last 2025
0009-0000-4720-1342ORCID · conflict

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

Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 first-author · 3 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 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.

Artificial intelligence
1 paper
Generative modeling · 50% Deep learning architectures and training · 50%
Computer graphics and multimedia
1 paper
Rendering · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training › neural differential equations
neural ordinary differential equations
0.912025
Generative Video Bi-Flow · ICCV 2025
Machine learning › Generative modeling
video generation
0.912025
Generative Video Bi-Flow · ICCV 2025
Rendering
appearance modeling
0.812024
Neural Differential Appearance Equations · ACM Trans. Graph. 2024
Rendering
neural rendering
0.812024
Neural Differential Appearance Equations · ACM Trans. Graph. 2024

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

noise injection · 0.9bilinear objective · 0.9neural ordinary differential equation · 0.8BRDF · 0.8
YearPublicationVenuePosition
2025 Generative Video Bi-Flow
abstract
We propose a novel generative video model to robustly learn temporal change as a neural Ordinary Differential Equation (ODE) flow with a bilinear objective which combines two aspects: The first is to map from the past into future video frames directly. Previous work has mapped the noise to new frames, a more computationally expensive process. Unfortunately, starting from the previous frame, instead of noise, is more prone to drifting errors. Hence, second, we additionally learn how to remove the accumulated errors as the joint objective by adding noise during training. We demonstrate unconditional video generation in a streaming manner for various video datasets, all at competitive quality compared to a conditional diffusion baseline but with higher speed, i.e., fewer ODE solver steps.
Chen Liu 0029, Tobias Ritschel 0001
ICCV1
2024 Neural Differential Appearance Equations
abstract
We propose a method to reproduce dynamic appearance textures with space-stationary but time-varying visual statistics. While most previous work decomposes dynamic textures into static appearance and motion, we focus on dynamic appearance that results not from motion but variations of fundamental properties, such as rusting, decaying, melting, and weathering. To this end, we adopt the neural ordinary differential equation (ODE) to learn the underlying dynamics of appearance from a target exemplar. We simulate the ODE in two phases. At the "warm-up" phase, the ODE diffuses a random noise to an initial state. We then constrain the further evolution of this ODE to replicate the evolution of visual feature statistics in the exemplar during the generation phase. The particular innovation of this work is the neural ODE achieving both denoising and evolution for dynamics synthesis, with a proposed temporal training scheme. We study both relightable (BRDF) and non-relightable (RGB) appearance models. For both we introduce new pilot datasets, allowing, for the first time, to study such phenomena: For RGB we provide 22 dynamic textures acquired from free online sources; For BRDFs, we further acquire a dataset of 21 flash-lit videos of time-varying materials, enabled by a simple-to-construct setup. Our experiments show that our method consistently yields realistic and coherent results, whereas prior works falter under pronounced temporal appearance variations. A user study confirms our approach is preferred to previous work for such exemplars.
Chen Liu 0029, Tobias Ritschel 0001
ACM Trans. Graph.1
2023 Learning to Learn and Sample BRDFs
abstract
Abstract We propose a method to accelerate the joint process of physically acquiring and learning neural Bi‐directional Reflectance Distribution Function (BRDF) models. While BRDF learning alone can be accelerated by meta‐learning, acquisition remains slow as it relies on a mechanical process. We show that meta‐learning can be extended to optimize the physical sampling pattern, too. After our method has been meta‐trained for a set of fully‐sampled BRDFs, it is able to quickly train on new BRDFs with up to five orders of magnitude fewer physical acquisition samples at similar quality. Our approach also extends to other linear and non‐linear BRDF models, which we show in an extensive evaluation.
Chen Liu 0029, Michael Fischer 0011, Tobias Ritschel 0001
Comput. Graph. Forum1