Yiling Wu

Dr. Yiling Wu

orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
9 October 2024 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
YLYabo Liu
Yabo Liu
JWJinghua Wang
Jinghua Wang
Chao HuangChao Huang
Chao Huang
YWYiling Wu
Yiling Wu
YXYong Xu
Yong Xu
XCXiaochun Cao
Xiaochun Cao
Object detection methods have achieved remarkable performances when the training and testing data satisfy the assumption of i.i.d. However, the training and testing data may be collected from different domains, and the gap between the domains can significantly degrade the detectors. Test Time Adaptive Object Detection (TTA-OD) is a novel online approach that aims to adapt detectors quickly and make predictions during the testing procedure. TTA-OD is more realistic than the existing unsupervised domain adaptation and source-free unsupervised domain adaptation approaches. For example, self-driving cars need to improve their perception of new environments in the TTA-OD paradigm during driving. To address this, we propose a multi-level feature alignment (MLFA) method for TTA-OD, which is able to adapt the model online based on the steaming target domain data. For a more straightforward adaptation, we select informative foreground and background features from image feature maps and capture their distributions using probabilistic models. Our approach includes: i) global-level feature alignment to align all informative feature distributions, thereby encouraging detectors to extract domain-invariant features, and ii) cluster-level feature alignment to match feature distributions for each category cluster across different domains. Through the multi-level alignment, we can prompt detectors to extract domain-invariant features, as well as align the category-specific components of image features from distinct domains. We conduct extensive experiments to verify the effectiveness of our proposed method. Our code is accessible at https://github.com/yaboliudotug/MLFA.

28 October 2024
Verified
Conference Paper
Open access
XHXiao Han
Xiao Han
ZZZhenduo Zhang
Zhenduo Zhang
YWYiling Wu
Yiling Wu
XZXinfeng Zhang
Xinfeng Zhang
ZWZhe Wu
Zhe Wu
With the development of deep learning, traffic forecasting technology has made significant progress and is being applied in many practical scenarios. However, various events held in cities, such as sporting events, exhibitions, concerts, etc., have a significant impact on traffic patterns of surrounding areas, causing current advanced prediction models to fail in this case. In this paper, to broaden the applicable scenarios of traffic forecasting, we focus on modeling the impact of events on traffic patterns and propose an event traffic forecasting problem with multimodal inputs. We outline the main challenges of this problem: diversity and sparsity of events, as well as insufficient data. To address these issues, we first use textual modal data containing rich semantics to describe the diverse characteristics of events. Then, we propose a simple yet effective multi-modal event traffic forecasting model that uses pre-trained text and traffic encoders to extract the embeddings and fuses the two embeddings for prediction. Encoders pre-trained on large-scale data have powerful generalization abilities to cope with the challenge of sparse data. Next, we design an efficient large language model-based event description text generation pipeline to build multi-modal event traffic forecasting datasets, ShenzhenCEC and SuzhouIEC. Experiments on two real-world datasets show that our method achieves state-of-the-art performance compared with eight baselines, reducing mean absolute error during the event peak period by 4.26%. Code is available at: https://github.com/2448845600/EventTrafficForecasting.

18 September 2024 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
YWYiling Wu
Yiling Wu
YZYingping Zhao
Yingping Zhao
XZXinfeng Zhang
Xinfeng Zhang
YWYaowei Wang
Yaowei Wang
Traffic demand prediction has been drawing increasing research interest due to its critical role in intelligent transportation systems. However, conventional deep learning methods for traffic demand forecast ignore the correlations between the pick-up and drop-off demands, thus not fully exploring the patterns of demand evolution. In this work, the pick-up and drop-off demands are treated as two modalities, and an architecture is designed to explicitly model the interactions between the pick-up and drop-off demands both spatially and temporally. Specifically, the self-attention mechanism is adopted to automatically discover spatio-temporal patterns without manual designation for each demand. Then, the cross-attention mechanism is utilized to let the two demands attend to each other, resulting in information exchange between the two demands. The self-attention and cross-attention are combined to capture spatio-temporal correlations simultaneously. Finally, experiments are carried out on three real-world datasets, NYC Citi Bike, NYC Taxi, and BJ Subway, and the results show that this newly proposed method outperforms the state-of-the-art methods.

19 March 2024 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
XHXiao Han
Xiao Han
XZXinfeng Zhang
Xinfeng Zhang
YWYiling Wu
Yiling Wu
ZZZhenduo Zhang
Zhenduo Zhang
TZTianyu Zhang
Tianyu Zhang
YWYaowei Wang
Yaowei Wang
Traffic forecasting is a critical task in intelligent transportation systems. In recent years, lots of methods have been proposed and achieved significant progress in modeling highly nonlinear and complex spatiotemporal pattern for traffic forecasting. However, most methods neglect the specific internal and external factors of the traffic system, such as the road connections, buildings surrounding each place, transfer stations, etc. The main challenges of utilizing the diverse knowledge from internal and external factors are to represent and fuse the impact of various factors. Few works use distance-based adjacency matrices to represent factors and the element-wise multiplication to fuse them, which may lead to even worse performances. In this paper, we propose to utilize knowledge graph to represent traffic system factors and design a novel neural network to exploit them for traffic foresting. First, we model the relations between factors and traffic conditions from the perspective of the knowledge graph and express them as unified triplets. Then, we generate multi-hop path features with embeddings learned from the knowledge representation model and multi-hop paths searched from the graph structure. Next, we present a knowledge-based multi-hop network (KMHNet) that uses an attention-based module to learn the correlation from multi-hop path features. Finally, to evaluate the performance of the proposed method, we build two real-world datasets both containing a traffic condition sub-dataset and a traffic knowledge graph. Experiments on two datasets demonstrate that our proposed KMHNet outperforms eight well-known methods. The code is publicly available at https://github.com/2448845600/KMHNet.

21 October 2023
Verified
Conference Paper
Open access
YWYiling Wu
Yiling Wu
XZXinfeng Zhang
Xinfeng Zhang
YWYaowei Wang
Yaowei Wang
This paper studies the problem of spatial-temporal modeling for traffic demand forecasting. In practice, the temporal-spatial dependencies are complex. Conventional methods using graph convolutional networks and gated recurrent units cannot fully explore the patterns of demand evolution. Therefore, we propose Adaptive Graph Neural Diffusion (AGND) for spatial-temporal graph modeling. Specifically, complex spatial relations are modeled with a diffusion process by the graph neural diffusion. The spatial attention mechanism and a data-driven semantic adjacency matrix are used to describe the diffusivity function in the graph neural diffusion, which provides both local and global spatial information. Long-term temporal dependencies are modeled by the temporal attention mechanism. The proposed method is applied to two real-world datasets, and the results show that the proposed method outperforms state-of-the-art methods.

27 November 2023 in Urban Rail Transit
Verified
Journal Article
Open access
PDF file
YZYingping Zhao
Yingping Zhao
YWYiling Wu
Yiling Wu
XZXinfeng Zhang
Xinfeng Zhang
YWYaowei Wang
Yaowei Wang
ZZZhenduo Zhang
Zhenduo Zhang
Dongfang MaDongfang Ma
Dongfang Ma
The emergence of dockless shared bikes (DSB) has led to their use as an important transfer mode to urban rail transit (URT) stations. However, in highly populated areas such as subway stations in peak hours, there is increasing concern about the imbalance between the demand and supply of shared bikes. To promote smoother subway transfer trips using shared bikes, it is very important to estimate the DSB demand, especially the disparity in the volume of bike pick-up and drop-off demand around subway stations. This research first utilizes the Shenzhen metro usage data and DSB usage data, analyzes data regarding subway and shared bike usage, discusses their potential transfer uses, and finds great disparity in DSB demand between different subway stations. The catchment area method is used to estimate bike usage as a potential transfer mode to the subway, where the catchment area is defined as a radius of 150 m from the subway station center. The DSB trip demand is categorized into two types: pick-up and drop-off. The most recent deep learning method, adaptive graph convolutional recurrent network (AGCRN), is used to predict the DSB demand more accurately because of its ability in enabling the modeling of relationships between entities in a self-adapted graph, and the prediction is compared with long short-term memory (LSTM), spatiotemporal neural network (STNN), diffusion convolutional recurrent neural network (DCRNN), and Graph WaveNet. Results show that methods with graphs (STNN, DCRNN, Graph WaveNet, and AGCRN) perform better than LSTM, and methods with adaptive graphs (Graph WaveNet and AGCRN) outperform methods with static graphs in terms of mean absolute error (MAE), root-mean-square error (RMSE), and mean absolute percentage error (MAPE). DSB prediction results show that AGCRN performs the best in this study. More data, particularly land use data and URT station volume data, are expected to improve the predictive accuracy of the method due to potentially improved graph representation of station characteristics and subway station volume correlations. And with more accurate prediction results, it will be possible to achieve a better balancing strategy for bike operation optimization for better bike usage, and thus for a higher transfer rate of DSB to subway.