Juanjuan Zhao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Juanjuan Zhao has a total of 63 co-authors. Here are the top co-authors by number of shared publications:
- Cheng-Zhong Xu
State Key Laboratory of IoTSC, University of Macau, Macau, Macao
20 shared publications - Kejiang Ye
Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences
15 shared publications Fan Zhang
Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences
13 shared publications- Xitong Gao
Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences
11 shared publications Kejiang Ye
10 shared publicationsJiexia Ye
Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Shenzhen, China
6 shared publications
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 72  (4) , 12047-12060
Individual Travel Trajectory Imputation Through Cross-Network Unified User Identification
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 72  (4) , 12047-12060
Individual Travel Trajectory Imputation Through Cross-Network Unified User Identification
- 30 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 26  (11) , 19626-19644
Urban Transport Mode Split Prediction: A Hybrid Deep Learning Framework Considering Spatiotemporal Dependency
Transport Mode Split (TMS) represents the distribution of trips among transport modes between city regions. Accurate TMS prediction is crucial for urban planning and traffic management. Traditional methods, such as curve models and discrete choice models, often fail to capture user travel mode pReferences due to dataset limitations and inadequate spatiotemporal modeling. While deep learning models have been applied in related domains such as ride-sharing and traffic prediction, they typically focus on a single transport mode and do not model the competitive relationships between modes. We propose a novel Deep Learning-based Framework for Transport Mode Split Prediction (DMSP), integrating restricted-route (bus/subway) and free-route (taxi) data. It introduces two key innovations: 1) efficient extraction of TMS samples from sparse raw data, enriched with spatiotemporal context, and 2) a prediction model extending discrete choice theory via maximum utility principles. Mode utilities are estimated using CNNs for travel mode-specific effects and GNN for spatiotemporal dependencies. Experiments on six months of Shenzhen data show that DMSP reduces MAPE by over 4% compared to existing methods.
- 30 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 26  (11) , 19626-19644
Urban Transport Mode Split Prediction: A Hybrid Deep Learning Framework Considering Spatiotemporal Dependency
Transport Mode Split (TMS) represents the distribution of trips among transport modes between city regions. Accurate TMS prediction is crucial for urban planning and traffic management. Traditional methods, such as curve models and discrete choice models, often fail to capture user travel mode pReferences due to dataset limitations and inadequate spatiotemporal modeling. While deep learning models have been applied in related domains such as ride-sharing and traffic prediction, they typically focus on a single transport mode and do not model the competitive relationships between modes. We propose a novel Deep Learning-based Framework for Transport Mode Split Prediction (DMSP), integrating restricted-route (bus/subway) and free-route (taxi) data. It introduces two key innovations: 1) efficient extraction of TMS samples from sparse raw data, enriched with spatiotemporal context, and 2) a prediction model extending discrete choice theory via maximum utility principles. Mode utilities are estimated using CNNs for travel mode-specific effects and GNN for spatiotemporal dependencies. Experiments on six months of Shenzhen data show that DMSP reduces MAPE by over 4% compared to existing methods.
- Open Access
- 30 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1118-1127
On the Adversarial Robustness of Visual-Language Chat Models
- 30 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1118-1127
Open AccessOn the Adversarial Robustness of Visual-Language Chat Models
- 20 June 2025
- Published by Springer Nature
- p. 457-470
Offline Map Matching Based on Localization Error Distribution Modeling
- 20 June 2025
- Published by Springer Nature
- p. 457-470
Offline Map Matching Based on Localization Error Distribution Modeling
- Open Access
Offline Map Matching Based on Localization Error Distribution Modeling
Offline map matching involves aligning historical trajectories of mobile objects, which may have positional errors, with digital maps. This is essential for applications in intelligent transportation systems (ITS), such as route analysis and traffic pattern mining. Existing methods have two main limitations: (i) they assume a uniform Localization Error Distribution (LED) across urban areas, neglecting environmental factors that lead to suboptimal path search ranges, and (ii) they struggle to efficiently handle local non-shortest paths and detours. To address these issues, we propose a novel offline map matching method for sparse trajectories, called LNSP, which integrates LED modeling and non-shortest path detection. Key innovations include: (i) leveraging public transit trajectories with fixed routes to model LED in finer detail across different city regions, optimizing path search ranges, and (ii) scoring paths using sub-region dependency LED and a sliding window, which reduces global map matching errors. Experimental results using real-world bus and taxi trajectory datasets demonstrate that the LNSP algorithm significantly outperforms existing methods in both efficiency and matching accuracy.
Open AccessOffline Map Matching Based on Localization Error Distribution Modeling
Offline map matching involves aligning historical trajectories of mobile objects, which may have positional errors, with digital maps. This is essential for applications in intelligent transportation systems (ITS), such as route analysis and traffic pattern mining. Existing methods have two main limitations: (i) they assume a uniform Localization Error Distribution (LED) across urban areas, neglecting environmental factors that lead to suboptimal path search ranges, and (ii) they struggle to efficiently handle local non-shortest paths and detours. To address these issues, we propose a novel offline map matching method for sparse trajectories, called LNSP, which integrates LED modeling and non-shortest path detection. Key innovations include: (i) leveraging public transit trajectories with fixed routes to model LED in finer detail across different city regions, optimizing path search ranges, and (ii) scoring paths using sub-region dependency LED and a sliding window, which reduces global map matching errors. Experimental results using real-world bus and taxi trajectory datasets demonstrate that the LNSP algorithm significantly outperforms existing methods in both efficiency and matching accuracy.
- 7 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 26  (8) , 12661-12675
An Online Map Matching Algorithm for Path-Free Trajectories by Integrating Path-Constrained Trajectories
Online map matching (MM) aligns real-time GPS trajectories with digital road networks, playing a vital role in vehicle navigation, route planning, and traffic analysis. Hidden Markov Models (HMMs) are widely used for their interpretability and ability to handle low GPS sampling rates. However, in urban scenarios characterized by complex road networks, significant GPS localization error, and dynamic traffic conditions, existing HMM-based methods face challenges such as large road search spaces due to uniform GPS localization error distributions (GLED) and inaccurate route accessibility estimates stemming from inadequate consideration of real-time traffic conditions. This paper proposes an improved HMM-based MM method, recognizing that urban vehicle trajectories can be categorized into two types: path-free (e.g., taxis, private cars) and path-constrained (e.g., buses). Analyzing path-constrained trajectories helps estimate fine-grained GLED and real-time traffic states of path-free vehicles more precisely. The novelty of our approach lies in two aspects: i) Using a hierarchical spectral clustering algorithm based on GPS localization errors of path-constrained bus trajectories, a city is divided into fine-grained sub-regions with consistent GLED. This enables the HMM an adaptive road search scopes, improving online MM efficiency. ii) Gradient boosting trees, known for their interpretability, estimate free-flow speeds by integrating path-constrained trajectories with the factors like road attributes and time, optimizing HMM state transition probabilities for path-free trajectory MM. Experiments on real-world data demonstrate that the optimized HMM methods, leveraging different trajectory types, significantly enhance MM efficiency and accuracy compared to baseline models.The codebase of our methods and datasets are available at https://github.com/jacklee018/onlineMM-IPCT.
- 7 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 26  (8) , 12661-12675
An Online Map Matching Algorithm for Path-Free Trajectories by Integrating Path-Constrained Trajectories
Online map matching (MM) aligns real-time GPS trajectories with digital road networks, playing a vital role in vehicle navigation, route planning, and traffic analysis. Hidden Markov Models (HMMs) are widely used for their interpretability and ability to handle low GPS sampling rates. However, in urban scenarios characterized by complex road networks, significant GPS localization error, and dynamic traffic conditions, existing HMM-based methods face challenges such as large road search spaces due to uniform GPS localization error distributions (GLED) and inaccurate route accessibility estimates stemming from inadequate consideration of real-time traffic conditions. This paper proposes an improved HMM-based MM method, recognizing that urban vehicle trajectories can be categorized into two types: path-free (e.g., taxis, private cars) and path-constrained (e.g., buses). Analyzing path-constrained trajectories helps estimate fine-grained GLED and real-time traffic states of path-free vehicles more precisely. The novelty of our approach lies in two aspects: i) Using a hierarchical spectral clustering algorithm based on GPS localization errors of path-constrained bus trajectories, a city is divided into fine-grained sub-regions with consistent GLED. This enables the HMM an adaptive road search scopes, improving online MM efficiency. ii) Gradient boosting trees, known for their interpretability, estimate free-flow speeds by integrating path-constrained trajectories with the factors like road attributes and time, optimizing HMM state transition probabilities for path-free trajectory MM. Experiments on real-world data demonstrate that the optimized HMM methods, leveraging different trajectory types, significantly enhance MM efficiency and accuracy compared to baseline models.The codebase of our methods and datasets are available at https://github.com/jacklee018/onlineMM-IPCT.
- 3 December 2024
- Published by Springer Nature
- p. 461-477
GCompletor: A Graph-Based Deep Learning Method for Traffic State Imputation on Urban Road Networks
- 3 December 2024
- Published by Springer Nature
- p. 461-477
GCompletor: A Graph-Based Deep Learning Method for Traffic State Imputation on Urban Road Networks
- 7 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25  (11) , 15614-15627
A Heterogeneous Graph Convolution Based Method for Short-Term OD Flow Completion and Prediction in a Metro System
Short-term OD flow (i.e. the number of passenger traveling between stations) prediction is crucial to traffic management in metro systems. The delayed effect in latest complete OD flow collection and complex spatiotemporal correlations of OD flows in high dimension make it challengeable to predict short-term OD flow. Existing methods need to be improved due to not fully utilizing the real-time passenger mobility data and not sufficiently modeling the implicit correlation of the mobility patterns between stations. In this paper, we propose a Completion based Adaptive Heterogeneous Graph Convolution Spatiotemporal Predictor. The novelty is mainly reflected in two aspects. The first is to model real-time mobility evolution by establishing the implicit correlation between observed OD flows and the prediction target OD flows in high dimension based on a key data-driven insight: the destination distributions of the passengers departing from a station are correlated with other stations sharing similar attributes (e.g. geographical location, region function). The second is to complete the latest incomplete OD flows by estimating the destination distribution of unfinished trips through considering the real-time mobility evolution and the time cost between stations, which is the base of time series prediction and can improve the model’s dynamic adaptability. Extensive experiments on two real world metro datasets demonstrate the superiority of our model over other competitors with the biggest model performance improvement being nearly 4%. In addition, the data complete framework we propose can be integrated into other models to improve their performance up to 2.1%.
- 7 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25  (11) , 15614-15627
A Heterogeneous Graph Convolution Based Method for Short-Term OD Flow Completion and Prediction in a Metro System
Short-term OD flow (i.e. the number of passenger traveling between stations) prediction is crucial to traffic management in metro systems. The delayed effect in latest complete OD flow collection and complex spatiotemporal correlations of OD flows in high dimension make it challengeable to predict short-term OD flow. Existing methods need to be improved due to not fully utilizing the real-time passenger mobility data and not sufficiently modeling the implicit correlation of the mobility patterns between stations. In this paper, we propose a Completion based Adaptive Heterogeneous Graph Convolution Spatiotemporal Predictor. The novelty is mainly reflected in two aspects. The first is to model real-time mobility evolution by establishing the implicit correlation between observed OD flows and the prediction target OD flows in high dimension based on a key data-driven insight: the destination distributions of the passengers departing from a station are correlated with other stations sharing similar attributes (e.g. geographical location, region function). The second is to complete the latest incomplete OD flows by estimating the destination distribution of unfinished trips through considering the real-time mobility evolution and the time cost between stations, which is the base of time series prediction and can improve the model’s dynamic adaptability. Extensive experiments on two real world metro datasets demonstrate the superiority of our model over other competitors with the biggest model performance improvement being nearly 4%. In addition, the data complete framework we propose can be integrated into other models to improve their performance up to 2.1%.
- 25 April 2024
- Published by Springer Nature
- p. 322-335
GSPM: An Early Detection Approach to Sudden Abnormal Large Outflow in a Metro System
- 25 April 2024
- Published by Springer Nature
- p. 322-335
GSPM: An Early Detection Approach to Sudden Abnormal Large Outflow in a Metro System