Guobin Wu

Guobin Wu

Auto-generated profile, based on publicly available information

Guobin Wu

Didi Chuxing, Beijing, China

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 May 2024 in IEEE Transactions on Intelligent Vehicles
Verified
Journal Article
Closed access
SLSheng Luo
Sheng Luo
WCWei Chen
Wei Chen
WTWanxin Tian
Wanxin Tian
RLRui Liu
Rui Liu
LHLuanxuan Hou
Luanxuan Hou
GWGuobin Wu
Guobin Wu
Foundation models have indeed made a profound impact on various fields, emerging as pivotal components that significantly shape the capabilities of intelligent systems. In the context of intelligent vehicles, leveraging the power of foundation models has proven to be transformative, offering notable advancements in visual understanding. Equipped with multi-modal and multi-task learning capabilities, multi-modal multi-task visual understanding foundation models (MM-VUFMs) effectively process and fuse data from diverse modalities and simultaneously handle various driving-related tasks with powerful adaptability, contributing to a more holistic understanding of the surrounding scene. In this survey, we present a systematic analysis of MM-VUFMs specifically designed for road scenes. Our objective is not only to provide a comprehensive overview of common practices, referring to task-specific models, unified multi-modal models, unified multi-task models, and foundation model prompting techniques, but also to highlight their advanced capabilities in diverse learning paradigms. These paradigms include open-world understanding, efficient transfer for road scenes, continual learning, interactive and generative capability. Moreover, we provide insights into key challenges and future trends, such as closed-loop driving systems, interpretability, low-resource conditions, embodied driving agents, and world models. To facilitate researchers in staying abreast of the latest developments in MM-VUFMs for road scenes, we have established a continuously updated repository at https://github.com/rolsheng/MM-VUFM4DS .

29 September 2022 in Sustainability
Verified
Journal Article
Open access
PDF file
LZLingyu Zhang
Lingyu Zhang
XGXu Geng
Xu Geng
ZQZhiwei Qin
Zhiwei Qin
HWHongjun Wang
Hongjun Wang
XWXiao Wang
Xiao Wang
YWYunhai Wang
Yunhai Wang
Graph convolution network-based approaches have been recently used to model region-wise relationships in region-level prediction problems in urban computing. Each relationship represents a kind of spatial dependency, such as region-wise distance or functional similarity. To incorporate multiple relationships into a spatial feature extraction, we define the problem as a multi-modal machine learning problem on multi-graph convolution networks. Leveraging the advantage of multi-modal machine learning, we propose to develop modality interaction mechanisms for this problem in order to reduce the generalization error by reinforcing the learning of multi-modal coordinated representations. In this work, we propose two interaction techniques for handling features in lower layers and higher layers, respectively. In lower layers, we propose grouped GCN to combine the graph connectivity from different modalities for a more complete spatial feature extraction. In higher layers, we adapt multi-linear relationship networks to GCN by exploring the dimension transformation and freezing part of the covariance structure. The adapted approach, called multi-linear relationship GCN, learns more generalized features to overcome the train–test divergence induced by time shifting. We evaluated our model on a ride-hailing demand forecasting problem using two real-world datasets. The proposed technique outperforms state-of-the art baselines in terms of prediction accuracy, training efficiency, interpretability and model robustness.

24 August 2024
Verified
Conference Paper
Open access
ZYZhaoxing Yang
Zhaoxing Yang
HJHaiming Jin
Haiming Jin
GFGuiyun Fan
Guiyun Fan
MLMin Lu
Min Lu
YLYiran Liu
Yiran Liu
JGJiecheng Guo
Jiecheng Guo
Achieving optimal order dispatching has been a long-standing challenge for online ride-hailing platforms. Early methods would make shortsighted matchings as they only consider order prices alone as the edge weights in the driver-order bipartite graph, thus harming the platform's revenue. To address this problem, recent works evaluate the value of the order's destination region to be the long-term income a driver could obtain in average in such region and incorporate it into the order's edge weight to influence the matching results. However, they often result in insufficient driver supplies in many regions, as the values evaluated in different regions vary greatly, mainly because the impact of one region's value on the future number of drivers and revenue in other regions is overlooked. This paper models such impact within a cooperative Markov game, which involves each value's impact over the platform's revenue with the goal to find the optimal region values for revenue maximization. To solve this game, our work proposes a novelgoal-reaching collaboration (GRC) algorithm that realizes credit assignment from a novel goal-reaching perspective, addressing the difficulty for accurate credit assignment with large-scale agents of previous methods and resolving the conflict between credit assignment and offline reinforcement learning. Specifically, during training, GRC predicts the city's future state through an environment model and utilizes a scoring model to rate the predicted states to judge their levels of profitability, where high-scoring states are regarded as the goal states. Then, the policies in the game are updated to promote the city to stay in the goal states for as long as possible. To evaluate GRC, we deploy a baseline policy online in several cities for three weeks to collect real-world dataset. Training and testing results on the collected dataset indicate that our GRC consistently outperforms the baselines in different cities and peak periods.

7 August 2023 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
SGShuxin Ge
Shuxin Ge
XZXiaobo Zhou
Xiaobo Zhou
Tie QiuTie Qiu
Tie Qiu
GWGuobin Wu
Guobin Wu
XWXiaotong Wang
Xiaotong Wang
Mobility on demand (MoD) systems utilize ridesharing, i.e., multiple orders with high associating utility share a single vehicle, to reduce carbon footprint and alleviate traffic pressure. Existing methods mainly promote ridesharing by flocking multiple orders to the minimum required vehicles. However, supply-demand variations may aggregate undersupply in the long run and affect the order completion rate. Meanwhile, it is difficult to accurately estimate associating utility among ridesharing orders with lane-level features, such as traffic flow. To fill this gap, we propose ERShare, an elastic order dispatching algorithm to maximize the order completion rate in the MoD system. First, the ridesharing order dispatching problem is formulated as an offline optimization problem, and then it is proved that the order completion rate is maximized when the MoD system achieves long-term supply-demand equilibrium. Next, a dummy order/vehicle generation method is proposed to generate dummies as a spinner to achieve supply-demand equilibrium elastically. Also, a lane-level ridesharing rule is designed to accurately estimate the associating utility based on an order association graph. Subsequently, a dummy-based order dispatching algorithm is proposed to find the optimal dispatching decisions. Finally, the simulations on real-world data validate the superiority of ERShare over state-of-the-art solutions regarding order completion rate.

28 September 2024 in Accident Analysis & Prevention
Verified
Journal Article
Closed access
NXNing Xie
Ning Xie
RYRongjie Yu
Rongjie Yu
WSWeili Sun
Weili Sun
SQShi Qiu
Shi Qiu
KZKailun Zhong
Kailun Zhong
YYYi Yang
Yi Yang

7 May 2025 in IEEE Signal Processing Letters
Verified
Journal Article
Closed access
JWJia Wang
Jia Wang
SXShuhan Xia
Shuhan Xia
CZChen Zou
Chen Zou
GWGuobin Wu
Guobin Wu
He ZhaofengHe Zhaofeng
He Zhaofeng
In this paper, we propose FreqFormer, a frequency-enhanced framework for face super-resolution (FSR) that synergizes spectral decomposition and dynamic feature modulation to address Transformers' inherent low-frequency bias. Unlike existing methods, FreqFormer leverages Empirical Mode Decomposition (EMD) to decompose high-resolution (HR) images into hierarchical Intrinsic Mode Functions (IMFs), providing explicit frequency anchors for progressive high-frequency recovery. Simultaneously, a lightweight prompt module dynamically injects degradation-aware textures into Transformer blocks through learnable feature interaction, compensating for real-world distortions. This work establishes a novel framework that bridges spectral fidelity and adaptive learning, significantly advancing FSR toward high-frequency-accurate restoration. Experiments on CelebA and Helen datasets demonstrate FreqFormer's superiority, which achieves 22.42 dB PSNR on $16\times$ SR ($8\times 8 \rightarrow 128\times 128$) with higher high-frequency energy preservation than state-of-the-art methods. The framework's parameter efficiency and real-time performance enable practical deployment in security and biometric systems.