Long-Biao Chen

Dr. Long-Biao Chen

Fujian Key Laboratory of Sensing and Computing for Smart City, Xiamen University, Xiamen 361005, China

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
8 September 2021 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
ZJZhihan Jiang
Zhihan Jiang
HZHang Zhu
Hang Zhu
BZBinbin Zhou
Binbin Zhou
CLChenhui Lu
Chenhui Lu
MSMingfei Sun
Mingfei Sun
Long-Biao ChenLong-Biao Chen
Long-Biao Chen
Traffic violations have become one of the major threats to urban transportation systems, undermining human safety and causing economic losses. To alleviate this problem, crowd-based patrol forces including traffic police and voluntary participants have been employed in many cities. To adaptively optimize patrol routes with limited manpower, it is essential to be aware of traffic violation hotspots. Traditionally, traffic violation hotspots are directly inferred from experiences, and existing patrol routes are usually fixed. In this paper, we propose a mobile crowdsensing-based framework to dynamically infer traffic violation hotspots and adaptively schedule crowd patrol routes. Specifically, we first extract traffic violation-prone locations from heterogeneous crowd-sensed data and propose a spatiotemporal context-aware self-adaptive learning model (CSTA) to infer traffic violation hotspots. Then, we propose a tensor-based integer linear problem modeling method (TILP) to adaptively find optimal patrol routes under human labor constraints. Experiments on real-world data from two Chinese cities (Xiamen and Chengdu) show that our approach accurately infers traffic violation hotspots with F1-scores above 90% in both cities, and generates patrol routes with relative coverage ratios above 85%, significantly outperforming baseline methods.

4 February 2020 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
Long-Biao ChenLong-Biao Chen
Long-Biao Chen
TNThi-Mai-Trang Nguyen
Thi-Mai-Trang Nguyen
DYDingqi Yang
Dingqi Yang
MNMichele Nogueira
Michele Nogueira
Cheng WangCheng Wang
Cheng Wang
DZDaqing Zhang
Daqing Zhang
The surging traffic volumes and dynamic user mobility patterns pose great challenges for cellular network operators to reduce operational costs and ensure service quality. Cloud-radio access network (C-RAN) aims to address these issues by handling traffic and mobility in a centralized manner, separating baseband units (BBUs) from base stations (RRHs) and sharing BBUs in a pool. The key problem in C-RAN optimization is to dynamically allocate BBUs and map them to RRHs under cost and quality constraints, since real-world traffic and mobility are difficult to predict, and there are enormous numbers of candidate RRH-BBU mapping schemes. In this work, we propose a data-driven framework for C-RAN optimization. First, we propose a deep-learning-based Multivariate long short term memory (MuLSTM) model to capture the spatiotemporal patterns of traffic and mobility for accurate prediction. Second, we formulate RRH-BBU mapping with cost and quality objectives as a set partitioning problem, and propose a resource-constrained label-propagation (RCLP) algorithm to solve it. We show that the greedy RCLP algorithm is monotone suboptimal with worst-case approximation guarantee to optimal. Evaluations with real-world datasets from Ivory Coast and Senegal show that our framework achieves a BBU utilization above 85.2 percent, with over 82.3 percent of mobility events handled with high quality, outperforming the traditional and the state-of-the-art baselines.

30 April 2023
Verified
Conference Paper
Open access
CZChuanpan Zheng
Chuanpan Zheng
XFXiaoliang Fan
Xiaoliang Fan
CWCheng Wang
Cheng Wang
JQJianzhong Qi
Jianzhong Qi
Chaochao ChenChaochao Chen
Chaochao Chen
Long-Biao ChenLong-Biao Chen
Long-Biao Chen
Spatio-temporal kriging is an important problem in web and social applications, such as Web or Internet of Things, where things (e.g., sensors) connected into a web often come with spatial and temporal properties. It aims to infer knowledge for (the things at) unobserved locations using the data from (the things at) observed locations during a given time period of interest. This problem essentially requires inductive learning. Once trained, the model should be able to perform kriging for different locations including newly given ones, without retraining. However, it is challenging to perform accurate kriging results because of the heterogeneous spatial relations and diverse temporal patterns. In this paper, we propose a novel inductive graph representation learning model for spatio-temporal kriging. We first encode heterogeneous spatial relations between the unobserved and observed locations by their spatial proximity, functional similarity, and transition probability. Based on each relation, we accurately aggregate the information of most correlated observed locations to produce inductive representations for the unobserved locations, by jointly modeling their similarities and differences. Then, we design relation-aware gated recurrent unit (GRU) networks to adaptively capture the temporal correlations in the generated sequence representations for each relation. Finally, we propose a multi-relation attention mechanism to dynamically fuse the complex spatio-temporal information at different time steps from multiple relations to compute the kriging output. Experimental results on three real-world datasets show that our proposed model outperforms state-of-the-art methods consistently, and the advantage is more significant when there are fewer observed locations. Our code is available at https://github.com/zhengchuanpan/INCREASE.

17 May 2021 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
YDYudi Dai
Yudi Dai
Chenglu WenChenglu Wen
Chenglu Wen
HWHai Wu
Hai Wu
YGYulan Guo
Yulan Guo
Long-Biao ChenLong-Biao Chen
Long-Biao Chen
Cheng WangCheng Wang
Cheng Wang
3D human trajectory reconstruction in an indoor scene is critical in various applications, such as indoor navigation and human activity recognition. This task is challenging due to occlusion and clutters of indoor scenes, flexible human body joints, and severe lack of relevant datasets. Although several methods have been proposed to reconstruct a 3D human trajectory, they either can recover only 2D positions or require human initiative cooperation. In this paper, we propose a novel framework for 3D human trajectory reconstruction in an indoor scene using monocular surveillance videos and static point clouds without any initiative cooperation. The proposed framework consists of three modules: 3D pose estimation, depth regression, and trajectory reconstruction. We first estimate 3D pose from videos. Especially, we reconstruct a half-body 3D pose to deal with the occlusion problem. Then, we propose a depth regression approach to iteratively regress the depth of a 3D pose. Unlike data-driven approaches, our depth regression approach does not require training data and can be integrated into any 3D pose model. Finally, we exploit the geometric constraints from the point cloud to optimize the 3D trajectory. We evaluated the 3D pose estimation and depth regression modules on the H3.6M datasets. Due to the lack of evaluation datasets, we also built a trajectory dataset to evaluate the trajectory reconstruction performance. Empirical evaluation shows that our framework achieves accurate trajectory reconstruction results on real-world videos.

18 August 2022 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
Long-Biao ChenLong-Biao Chen
Long-Biao Chen
XHXin He
Xin He
XZXiantao Zhao
Xiantao Zhao
HLHan Li
Han Li
YHYunyi Huang
Yunyi Huang
Cheng WangCheng Wang
Cheng Wang
Recent years have witnessed rapid advances in autonomous driving technologies. Autonomous vehicles are more likely to be accepted if they drive comfortably to avoid potholes, bumps, and other road damage conditions, especially when there are elderly and disabled passengers on board. Traditionally, sensing road damage conditions is either labor-intensive by field investigation and reporting, or inaccurate by surveillance cameras and driving recorders due to limited perspective. In this paper, we propose GoComfort, a crowdsensing-based framework to provide low-cost and fine-grained comfortable navigation for autonomous vehicles with road damage identification leveraging high-precision road sensing data. First, we propose to exploit city-wide autonomous vehicle fleets as crowdsensing participants, and employ an edge-cloud-hybrid computing paradigm to efficiently collect high-precision road damage-related data, including 3D LiDAR point clouds and street view images. Second, we design an accurate road damage identification model fusing spatial structures of point clouds and texture features of street view images, and use an active learning-based method to address the sparse labels issue. Finally, we devise two comfortable navigation scenarios, i.e., fine-grained road damage avoidance and coarse-grained city-wide navigation, and propose a hierarchical road damage assessment diagram for comfortable route planning. Experiments using real-world road sensing data in Xiamen, China show that our approach identifies road damage conditions with an accuracy of 87.5%, and achieves a user acceptance rate of 93.8% in riding comfort evaluation, outperforming the state-of-the-art baselines.

25 January 2022 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
HZHang Zhu
Hang Zhu
TSTieqi Shou
Tieqi Shou
RGRuiying Guo
Ruiying Guo
ZJZhihan JIANG
Zhihan JIANG
ZWZeyu Wang
Zeyu Wang
Long-Biao ChenLong-Biao Chen
Long-Biao Chen
Bike-sharing systems have been deployed globally. One of the key issues for high-quality bike-sharing systems is to rebalance city-wide stations to maintain bike availability. Traditional strategies, such as repositioning bikes by trucks and volunteers based on historical riding records, usually operate in fixed paths and limited capacities, lacking the flexibility to cope with the highly dynamic and context dependent riding demands, and usually suffer from high costs and long delays. In this work, we propose RedPacketBike, an incentive-driven, crowd-based station rebalancing framework to effectively recruit participants from hybrid fleets (e.g., volunteer riders and hired trucks) based on the accurate forecast of bike demand leveraging deep learning techniques. First, we propose a spatiotemporal clustering method to extract bike demand hotspots from fluctuating bike usage data. Then, we build a context-aware deep neural network named BikeNet to forecast the trends of bike demand hotspots, simultaneously modeling the spatial correlations by graph convolution networks (GCN), the temporal dependencies by long short-term memory networks (RNN), and the contextual factors by autoencoders (AE). Finally, we propose a reinforcement-learning-based method to find optimal station rebalancing schemes by generating station rebalancing tasks with an integer linear programming (ILP) algorithm and allocating tasks to participants from hybrid fleets with dynamic incentive designs and reward expectations. Experiments using real-world bike-sharing system data collected from Citi Bike in New York City and Mobike in Xiamen City validate the performance of our framework, achieving a demand forecast error below 4.171 measured in MAE, and a 17.2% improvement of station availability by simulations with real-world parameter settings, outperforming the state-of-the-art baselines.