Researcher profile

Wenbo Li

Wenbo Li contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
20works
0followers
14topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

20 published item(s)

preprint2026arXiv

Teacher-Feature Drifting: One-Step Diffusion Distillation with Pretrained Diffusion Representations

Sampling from pretrained diffusion and flow-matching models typically requires many forward passes to generate diverse and high-fidelity images. Existing distillation methods often rely on multiple auxiliary networks, carefully designed training stages, or complex optimization pipelines. In this work, we revisit the recently proposed Drifting Model objective and show that a single drifting loss can be directly used to simplify one step distillation. A key observation is that the pretrained diffusion teacher itself already provides a strong representation space. Unlike the original Drifting Model, which relies on an additional pretrained feature extractor, we use intermediate hidden states of the pretrained teacher model as the feature representation. This removes the need for training or introducing an extra representation network while preserving a semantically meaningful feature geometry for drifting. Furthermore, we introduce a lightweight mode coverage loss to mitigate mode collapse during distillation and encourage the student generator to cover diverse teacher-supported regions. Extensive experiments on ImageNet and SDXL demonstrate that our method achieves efficient one step generation with competitive image quality and diversity, achieving FID scores of 1.58 on ImageNet-64$\times$64 and 18.4 on SDXL, while substantially simplifying the overall distillation framework.

preprint2022arXiv

Convergent, with rates, methods for normalized infinity Laplace, and related, equations

We propose a monotone, and consistent numerical scheme for the approximation of the Dirichlet problem for the normalized Infinity Laplacian, which could be related to the family of so--called two--scale methods. We show that this method is convergent, and prove rates of convergence. These rates depend not only on the regularity of the solution, but also on whether or not the right hand side vanishes. Some extensions to this approach, like obstacle problems and symmetric Finsler norms are also considered.

preprint2022arXiv

Exploring Motion Ambiguity and Alignment for High-Quality Video Frame Interpolation

For video frame interpolation (VFI), existing deep-learning-based approaches strongly rely on the ground-truth (GT) intermediate frames, which sometimes ignore the non-unique nature of motion judging from the given adjacent frames. As a result, these methods tend to produce averaged solutions that are not clear enough. To alleviate this issue, we propose to relax the requirement of reconstructing an intermediate frame as close to the GT as possible. Towards this end, we develop a texture consistency loss (TCL) upon the assumption that the interpolated content should maintain similar structures with their counterparts in the given frames. Predictions satisfying this constraint are encouraged, though they may differ from the pre-defined GT. Without the bells and whistles, our plug-and-play TCL is capable of improving the performance of existing VFI frameworks. On the other hand, previous methods usually adopt the cost volume or correlation map to achieve more accurate image/feature warping. However, the O(N^2) ({N refers to the pixel count}) computational complexity makes it infeasible for high-resolution cases. In this work, we design a simple, efficient (O(N)) yet powerful cross-scale pyramid alignment (CSPA) module, where multi-scale information is highly exploited. Extensive experiments justify the efficiency and effectiveness of the proposed strategy.

preprint2022arXiv

Fractional Elliptic Problems on Lipschitz Domains: Regularity and Approximation

This survey hinges on the interplay between regularity and approximation for linear and quasi-linear fractional elliptic problems on Lipschitz domains. For the linear Dirichlet integral Laplacian, after briefly recalling Hölder regularity and applications, we discuss novel optimal shift theorems in Besov spaces and their Sobolev counterparts. These results extend to problems with finite horizon and are instrumental for the subsequent error analysis. Moreover, we dwell on extensions of Besov regularity to the fractional $p$-Laplacian, and review the regularity of fractional minimal graphs and stickiness. We discretize these problems using continuous piecewise linear finite elements and derive global and local error estimates for linear problems, thereby improving some existing error estimates for both quasi-uniform and graded meshes. We also present a BPX preconditioner which turns out to be robust with respect to both the fractional order and the number of levels. We conclude with the discretization of fractional quasi-linear problems and their error analysis. We illustrate the theory with several illuminating numerical experiments.

preprint2022arXiv

MAT: Mask-Aware Transformer for Large Hole Image Inpainting

Recent studies have shown the importance of modeling long-range interactions in the inpainting problem. To achieve this goal, existing approaches exploit either standalone attention techniques or transformers, but usually under a low resolution in consideration of computational cost. In this paper, we present a novel transformer-based model for large hole inpainting, which unifies the merits of transformers and convolutions to efficiently process high-resolution images. We carefully design each component of our framework to guarantee the high fidelity and diversity of recovered images. Specifically, we customize an inpainting-oriented transformer block, where the attention module aggregates non-local information only from partial valid tokens, indicated by a dynamic mask. Extensive experiments demonstrate the state-of-the-art performance of the new model on multiple benchmark datasets. Code is released at https://github.com/fenglinglwb/MAT.

preprint2022arXiv

Multi-task Driver Steering Behaviour Modeling Using Time-Series Transformer

Human intention prediction provides an augmented solution for the design of assistants and collaboration between the human driver and intelligent vehicles. In this study, a multi-task sequential learning framework is developed to predict future steering torques and steering postures based on the upper limb neuromuscular Electromyography (EMG) signals. A single-right-hand driving mode is particularly studied. For this driving mode, three different driving postures are also evaluated. Then, a multi-task time-series transformer network (MTS-Trans) is developed to predict the steering torques and driving postures. To evaluate the multi-task learning performance, four different frameworks are assessed. Twenty-one participants are involved in the driving simulator-based experiment. The proposed model achieved accurate prediction results on the future steering torque prediction and driving postures recognition for single-hand driving modes. The proposed system can contribute to the development of advanced driver steering assistant systems and ensure mutual understanding between human drivers and intelligent vehicles.

preprint2022arXiv

On Efficient Transformer-Based Image Pre-training for Low-Level Vision

Pre-training has marked numerous state of the arts in high-level computer vision, while few attempts have ever been made to investigate how pre-training acts in image processing systems. In this paper, we tailor transformer-based pre-training regimes that boost various low-level tasks. To comprehensively diagnose the influence of pre-training, we design a whole set of principled evaluation tools that uncover its effects on internal representations. The observations demonstrate that pre-training plays strikingly different roles in low-level tasks. For example, pre-training introduces more local information to higher layers in super-resolution (SR), yielding significant performance gains, while pre-training hardly affects internal feature representations in denoising, resulting in limited gains. Further, we explore different methods of pre-training, revealing that multi-related-task pre-training is more effective and data-efficient than other alternatives. Finally, we extend our study to varying data scales and model sizes, as well as comparisons between transformers and CNNs-based architectures. Based on the study, we successfully develop state-of-the-art models for multiple low-level tasks. Code is released at https://github.com/fenglinglwb/EDT.

preprint2022arXiv

Towards Efficient and Scale-Robust Ultra-High-Definition Image Demoireing

With the rapid development of mobile devices, modern widely-used mobile phones typically allow users to capture 4K resolution (i.e., ultra-high-definition) images. However, for image demoireing, a challenging task in low-level vision, existing works are generally carried out on low-resolution or synthetic images. Hence, the effectiveness of these methods on 4K resolution images is still unknown. In this paper, we explore moire pattern removal for ultra-high-definition images. To this end, we propose the first ultra-high-definition demoireing dataset (UHDM), which contains 5,000 real-world 4K resolution image pairs, and conduct a benchmark study on current state-of-the-art methods. Further, we present an efficient baseline model ESDNet for tackling 4K moire images, wherein we build a semantic-aligned scale-aware module to address the scale variation of moire patterns. Extensive experiments manifest the effectiveness of our approach, which outperforms state-of-the-art methods by a large margin while being much more lightweight. Code and dataset are available at https://xinyu-andy.github.io/uhdm-page.

preprint2022arXiv

Video Demoireing with Relation-Based Temporal Consistency

Moire patterns, appearing as color distortions, severely degrade image and video qualities when filming a screen with digital cameras. Considering the increasing demands for capturing videos, we study how to remove such undesirable moire patterns in videos, namely video demoireing. To this end, we introduce the first hand-held video demoireing dataset with a dedicated data collection pipeline to ensure spatial and temporal alignments of captured data. Further, a baseline video demoireing model with implicit feature space alignment and selective feature aggregation is developed to leverage complementary information from nearby frames to improve frame-level video demoireing. More importantly, we propose a relation-based temporal consistency loss to encourage the model to learn temporal consistency priors directly from ground-truth reference videos, which facilitates producing temporally consistent predictions and effectively maintains frame-level qualities. Extensive experiments manifest the superiority of our model. Code is available at \url{https://daipengwa.github.io/VDmoire_ProjectPage/}.

preprint2021arXiv

Quasisymmetric embeddings of slit Sierpiński carpets

We study the problem of quasisymmetrically embedding spaces homeomorphic to the Sierpiński carpet into the plane. In the case of so called dyadic slit carpets, several characterizations are obtained. One characterization is in terms of a Transboundary Loewner Property (TLP) which is a transboundary analogue of the Loewner property of Heinonen and Koskela. We show that a dyadic slit carpet can be quasisymmetrically embedded into the plane if and only if it is TLP. Moreover, every dyadic slit carpet $X$ can be associated to a "pillowcase sphere" $\widehat{X}$ which is a metric space homeomorphic to the sphere $\mathbb{S}^2$. We show that $X$ quasisymmetrically embeds into the plane if and only if $\widehat{X}$ is quasisymmetric to $\mathbb{S}^2$ if and only if $\widehat{X}$ is Ahlfors $2$-regular.

preprint2021arXiv

Time fractional gradient flows: Theory and numerics

We develop the theory of fractional gradient flows: an evolution aimed at the minimization of a convex, l.s.c.~energy, with memory effects. This memory is characterized by the fact that the negative of the (sub)gradient of the energy equals the so-called Caputo derivative of the state. We introduce the notion of energy solutions, for which we provide existence, uniqueness and certain regularizing effects. We also consider Lipschitz perturbations of this energy. For these problems we provide an a posteriori error estimate and show its reliability. This estimate depends only on the problem data, and imposes no constraints between consecutive time-steps. On the basis of this estimate we provide an a priori error analysis that makes no assumptions on the smoothness of the solution.

preprint2020arXiv

A Spontaneous Driver Emotion Facial Expression (DEFE) Dataset for Intelligent Vehicles

In this paper, we introduce a new dataset, the driver emotion facial expression (DEFE) dataset, for driver spontaneous emotions analysis. The dataset includes facial expression recordings from 60 participants during driving. After watching a selected video-audio clip to elicit a specific emotion, each participant completed the driving tasks in the same driving scenario and rated their emotional responses during the driving processes from the aspects of dimensional emotion and discrete emotion. We also conducted classification experiments to recognize the scales of arousal, valence, dominance, as well as the emotion category and intensity to establish baseline results for the proposed dataset. Besides, this paper compared and discussed the differences in facial expressions between driving and non-driving scenarios. The results show that there were significant differences in AUs (Action Units) presence of facial expressions between driving and non-driving scenarios, indicating that human emotional expressions in driving scenarios were different from other life scenarios. Therefore, publishing a human emotion dataset specifically for the driver is necessary for traffic safety improvement. The proposed dataset will be publicly available so that researchers worldwide can use it to develop and examine their driver emotion analysis methods. To the best of our knowledge, this is currently the only public driver facial expression dataset.

preprint2020arXiv

Convolution Neural Network Architecture Learning for Remote Sensing Scene Classification

Remote sensing image scene classification is a fundamental but challenging task in understanding remote sensing images. Recently, deep learning-based methods, especially convolutional neural network-based (CNN-based) methods have shown enormous potential to understand remote sensing images. CNN-based methods meet with success by utilizing features learned from data rather than features designed manually. The feature-learning procedure of CNN largely depends on the architecture of CNN. However, most of the architectures of CNN used for remote sensing scene classification are still designed by hand which demands a considerable amount of architecture engineering skills and domain knowledge, and it may not play CNN's maximum potential on a special dataset. In this paper, we proposed an automatically architecture learning procedure for remote sensing scene classification. We designed a parameters space in which every set of parameters represents a certain architecture of CNN (i.e., some parameters represent the type of operators used in the architecture such as convolution, pooling, no connection or identity, and the others represent the way how these operators connect). To discover the optimal set of parameters for a given dataset, we introduced a learning strategy which can allow efficient search in the architecture space by means of gradient descent. An architecture generator finally maps the set of parameters into the CNN used in our experiments.

preprint2020arXiv

Finite element discretizations of nonlocal minimal graphs: convergence

In this paper, we propose and analyze a finite element discretization for the computation of fractional minimal graphs of order~$s \in (0,1/2)$ on a bounded domain $Ω$. Such a Plateau problem of order $s$ can be reinterpreted as a Dirichlet problem for a nonlocal, nonlinear, degenerate operator of order $s + 1/2$. We prove that our numerical scheme converges in $W^{2r}_1(Ω)$ for all $r<s$, where $W^{2s}_1(Ω)$ is closely related to the natural energy space. Moreover, we introduce a geometric notion of error that, for any pair of $H^1$ functions, in the limit $s \to 1/2$ recovers a weighted $L^2$-discrepancy between the normal vectors to their graphs. We derive error bounds with respect to this novel geometric quantity as well. In spite of performing approximations with continuous, piecewise linear, Lagrangian finite elements, the so-called {\em stickiness} phenomenon becomes apparent in the numerical experiments we present.

preprint2020arXiv

Incubation Induced Light Concentration Beyond the Diffraction Limit for High-Resolution Glass Printing

In the past two decades, tremendous efforts have been exerted to understand and control the delivery of ultrashort laser pulses into various types of transparent materials ranging from glass and crystal to polymer and even bio-materials. This approach opens up the route toward determinative and highly localized modification within the transparent materials, enabling three-dimensional (3D) micromachining of the materials into sophisticated structures and devices with the extreme geometrical flexibility. Owing to the linear diffraction and nonlinear self-focusing effects, the focal volume typically exhibits an asymmetric profile stretching along the longitudinal direction. This effect becomes more severe when focusing deeply into the transparent substrates for printing objects of large heights. In this work a new laser-material interaction regime is identified with the exceptional incubation effect originating from self-regulated multiple-pulse interactions with accumulated material changes. Our finding reveals a focal-volume-invariant modification deeply inside the fused silica glass, in striking contrary to the traditional believes that the geometrical shape of the laser induced modification follows the intensity distribution of the inscription laser. A macro-scale geometrically complex glass sculpture is successfully manufactured with the incubation assisted ultrashort laser inscription at uniform micrometer resolutions in all three dimensions.

preprint2020arXiv

MuCAN: Multi-Correspondence Aggregation Network for Video Super-Resolution

Video super-resolution (VSR) aims to utilize multiple low-resolution frames to generate a high-resolution prediction for each frame. In this process, inter- and intra-frames are the key sources for exploiting temporal and spatial information. However, there are a couple of limitations for existing VSR methods. First, optical flow is often used to establish temporal correspondence. But flow estimation itself is error-prone and affects recovery results. Second, similar patterns existing in natural images are rarely exploited for the VSR task. Motivated by these findings, we propose a temporal multi-correspondence aggregation strategy to leverage similar patches across frames, and a cross-scale nonlocal-correspondence aggregation scheme to explore self-similarity of images across scales. Based on these two new modules, we build an effective multi-correspondence aggregation network (MuCAN) for VSR. Our method achieves state-of-the-art results on multiple benchmark datasets. Extensive experiments justify the effectiveness of our method.

preprint2020arXiv

Novel Human-Object Interaction Detection via Adversarial Domain Generalization

We study in this paper the problem of novel human-object interaction (HOI) detection, aiming at improving the generalization ability of the model to unseen scenarios. The challenge mainly stems from the large compositional space of objects and predicates, which leads to the lack of sufficient training data for all the object-predicate combinations. As a result, most existing HOI methods heavily rely on object priors and can hardly generalize to unseen combinations. To tackle this problem, we propose a unified framework of adversarial domain generalization to learn object-invariant features for predicate prediction. To measure the performance improvement, we create a new split of the HICO-DET dataset, where the HOIs in the test set are all unseen triplet categories in the training set. Our experiments show that the proposed framework significantly increases the performance by up to 50% on the new split of HICO-DET dataset and up to 125% on the UnRel dataset for auxiliary evaluation in detecting novel HOIs.

preprint2020arXiv

Quantitative Stability and Error Estimates for Optimal Transport Plans

Optimal transport maps and plans between two absolutely continuous measures $μ$ and $ν$ can be approximated by solving semi-discrete or fully-discrete optimal transport problems. These two problems ensue from approximating $μ$ or both $μ$ and $ν$ by Dirac measures. Extending an idea from [Gigli, On Hölder continuity-in-time of the optimal transport map towards measures along a curve], we characterize how transport plans change under perturbation of both $μ$ and $ν$. We apply this insight to prove error estimates for semi-discrete and fully-discrete algorithms in terms of errors solely arising from approximating measures. We obtain weighted $L^2$ error estimates for both types of algorithms with a convergence rate $O(h^{1/2})$. This coincides with the rate in [Berman, Convergence rates for discretized Monge--Ampère equations and quantitative stability of Optimal Transport, Theorem 5.4] for semi-discrete methods, but the error notion is different.

preprint2020arXiv

Reinforcement Learning-Enabled Decision-Making Strategies for a Vehicle-Cyber-Physical-System in Connected Environment

As a typical vehicle-cyber-physical-system (V-CPS), connected automated vehicles attracted more and more attention in recent years. This paper focuses on discussing the decision-making (DM) strategy for autonomous vehicles in a connected environment. First, the highway DM problem is formulated, wherein the vehicles can exchange information via wireless networking. Then, two classical reinforcement learning (RL) algorithms, Q-learning and Dyna, are leveraged to derive the DM strategies in a predefined driving scenario. Finally, the control performance of the derived DM policies in safety and efficiency is analyzed. Furthermore, the inherent differences of the RL algorithms are embodied and discussed in DM strategies.

preprint2019arXiv

A compact and efficient three-dimensional microfluidic mixer

Microfluidic mixing is a fundamental functionality in most lab on a chip (LOC) systems,whereas realization of efficient mixing is challenging in microfluidic channels due to the small Reynolds numbers. Here, we design and fabricate a compact three-dimensional (3D) micromixer to enable efficient mixing at various flow rates. The performance of the fabricated micromixer was examined using blue and red inks. The extreme flexibility in fabricating microfluidic structures of arbitrary 3D geometries using femtosecond laser micromachining allows us to tackle the major disadvantageous effects for optimizing the mixing efficiency.