Yirong Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yirong Chen has a total of 47 co-authors. Here are the top co-authors by number of shared publications:
- Jian Cao
Shanghai Jiao Tong University
3 shared publications - Jie Wang
Stanford University
3 shared publications - Man-On Pun
School of Science and Engineering, The Chinese University of Hong Kong, Shenzhen, China
3 shared publications - Maonan Wang
School of Science and Engineering, The Chinese University of Hong Kong, Shenzhen, China
3 shared publications - Shiyou Qian
Shanghai Jiao Tong University
3 shared publications Han Han
Big Data Department, Xiangdao Chuxing, Shanghai, China
2 shared publications
Latest Publications
- Open Access
- 29 September 2026
- Published by Wiley in Advanced Science
- p. e78019
A Generalizable Multimodal Model for Treatment‐Stratified Risk and Survival Assessment under Real‐World Constraints: A Multi‐Center Study of Colorectal Cancer
Integrating histopathology, genomic, and clinical phenotypes holds promise for improving prognostic patient stratification, including within treatment‐defined subgroups, in colorectal cancer (CRC). However, ensuring the availability of all modalities in routine clinical practice remains challenging. Comprehensive molecular profiling is often constrained by cost and turnaround time, leaving histopathology as the most consistently available modality across institutions. In addition, variability in staining protocols, scanning devices, patient demographics, and outcome distributions across centers undermines the generalizability of models trained under controlled conditions with complete inputs. To address these challenges, we developed the Domain‐Adaptive Incomplete Multimodal Stratification framework (DAIMS). DAIMS leverages paired histopathology, genomic, and clinical data during training to learn generalizable disease representations and uses histology‐derived surrogate latent representations when auxiliary modalities are unavailable, enabling flexible histology‐only inference. Trained on TCGA samples and validated on two independent European and East Asian cohorts comprising 842 patients, DAIMS consistently outperformed state‐of‐the‐art methods. Adapted DAIMS improved the C‐index by 5.6%–13.9% on F1CRC and 4.1%–9.0% on SURGEN compared with baseline methods. DAIMS improved within‐cohort prognostic discrimination and localized prognostically relevant morphological patterns that remained stable across institutions. Our evaluation showed that DAIMS achieved generalizable survival stratification across disease stages, molecular subgroups, and treatment‐defined patient groups.
- 29 September 2026
- Published by Wiley in Advanced Science
- p. e78019
Open AccessA Generalizable Multimodal Model for Treatment‐Stratified Risk and Survival Assessment under Real‐World Constraints: A Multi‐Center Study of Colorectal Cancer
Integrating histopathology, genomic, and clinical phenotypes holds promise for improving prognostic patient stratification, including within treatment‐defined subgroups, in colorectal cancer (CRC). However, ensuring the availability of all modalities in routine clinical practice remains challenging. Comprehensive molecular profiling is often constrained by cost and turnaround time, leaving histopathology as the most consistently available modality across institutions. In addition, variability in staining protocols, scanning devices, patient demographics, and outcome distributions across centers undermines the generalizability of models trained under controlled conditions with complete inputs. To address these challenges, we developed the Domain‐Adaptive Incomplete Multimodal Stratification framework (DAIMS). DAIMS leverages paired histopathology, genomic, and clinical data during training to learn generalizable disease representations and uses histology‐derived surrogate latent representations when auxiliary modalities are unavailable, enabling flexible histology‐only inference. Trained on TCGA samples and validated on two independent European and East Asian cohorts comprising 842 patients, DAIMS consistently outperformed state‐of‐the‐art methods. Adapted DAIMS improved the C‐index by 5.6%–13.9% on F1CRC and 4.1%–9.0% on SURGEN compared with baseline methods. DAIMS improved within‐cohort prognostic discrimination and localized prognostically relevant morphological patterns that remained stable across institutions. Our evaluation showed that DAIMS achieved generalizable survival stratification across disease stages, molecular subgroups, and treatment‐defined patient groups.
- 12 September 2026
- Published by Springer Nature
- p. 248-265
Interpretation-Oriented Cloud Removal via Observation-Anchored Residual Flow with Geo-Contextual Alignment
- 12 September 2026
- Published by Springer Nature
- p. 248-265
Interpretation-Oriented Cloud Removal via Observation-Anchored Residual Flow with Geo-Contextual Alignment
- 6 July 2026
- Published by Elsevier in Medical Image Analysis
- Vol. 113, 104196
OmniPathoVQA: Benchmarking pathology vision–language models with Encyclopedia-scale knowledge
- 6 July 2026
- Published by Elsevier in Medical Image Analysis
- Vol. 113, 104196
OmniPathoVQA: Benchmarking pathology vision–language models with Encyclopedia-scale knowledge
- 7 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 26 (4) , 4633-4646
MPF: A Multi-Noise Perception Framework to Enhance Online Map Matching Algorithms
Map matching is crucial to facilitating location-based services, and recent advancements in map matching have demonstrated excellent performance with high-quality data. However, the use of low-precision devices often introduces high measurement noise, and the slow update rate of maps may result in errors in digital maps. Consequently, multiple types of noise significantly impact the performance of map matching algorithms. To tackle this issue, this paper presents a novel multi-noise perception framework, named MPF, aiming to enhance the performance and robustness of existing map matching algorithms. The main challenge lies in detecting anomalies during map matching, identifying the root causes, and devising appropriate solutions. Firstly, we propose a matching quality assessment (MQA) method that assesses abnormal variance in matching probability. Secondly, we introduce a multiple noise discrimination (MND) mechanism to effectively differentiate between measurement noise and map errors. Thirdly, we present a missing segment generation (MSG) scheme that dynamically fills in map gaps to prevent significant detours. To validate the effectiveness of MPF, we conduct experiments using real-world taxi trajectories from four cities, covering a total distance of 79,670.6 km. MPF is compare with seven online map matching algorithms and is used to optimize their performance. The experiments show that MPF outperforms the top baselines by 15.6%-26.9% and enhances their performance by 18.7%-38.2%.
- 7 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 26 (4) , 4633-4646
MPF: A Multi-Noise Perception Framework to Enhance Online Map Matching Algorithms
Map matching is crucial to facilitating location-based services, and recent advancements in map matching have demonstrated excellent performance with high-quality data. However, the use of low-precision devices often introduces high measurement noise, and the slow update rate of maps may result in errors in digital maps. Consequently, multiple types of noise significantly impact the performance of map matching algorithms. To tackle this issue, this paper presents a novel multi-noise perception framework, named MPF, aiming to enhance the performance and robustness of existing map matching algorithms. The main challenge lies in detecting anomalies during map matching, identifying the root causes, and devising appropriate solutions. Firstly, we propose a matching quality assessment (MQA) method that assesses abnormal variance in matching probability. Secondly, we introduce a multiple noise discrimination (MND) mechanism to effectively differentiate between measurement noise and map errors. Thirdly, we present a missing segment generation (MSG) scheme that dynamically fills in map gaps to prevent significant detours. To validate the effectiveness of MPF, we conduct experiments using real-world taxi trajectories from four cities, covering a total distance of 79,670.6 km. MPF is compare with seven online map matching algorithms and is used to optimize their performance. The experiments show that MPF outperforms the top baselines by 15.6%-26.9% and enhances their performance by 18.7%-38.2%.
- Open Access
- 16 January 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 19 (2) , 1-26
PREFER: A Pre-trained Model Recommendation Framework for Edge Computing Enabled Traffic Flow Prediction
The recent years have witnessed a surge in the development of traffic flow prediction methods, often deployed on cloud platforms to offer predictive services for entire transportation networks. However, the processes of training and executing a model for the entire traffic network are both time-consuming and computationally expensive. As a result, the utilization of edge servers for local sub-network prediction services has gained prominence. Nevertheless, training prediction models for numerous sub-networks within the extensive traffic network remains a time-intensive and computing resource-consuming task. To tackle this challenge, this article introduces the Pre-trained model REcommendation Framework for Edge computing enabled tRaffic flow prediction (PREFER). PREFER trains a set of traffic flow prediction models on selected sub-networks, then recommends optimal pre-trained models for edge servers. The recommendation is specifically based on performance prediction, integrating neural collaborative filtering and traffic flow characteristics. Experiments conducted on real datasets reveal that the pre-trained models recommended by PREFER perform close to the actual optimal ones and significantly outperform existing recommendation algorithms.
- 16 January 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 19 (2) , 1-26
Open AccessPREFER: A Pre-trained Model Recommendation Framework for Edge Computing Enabled Traffic Flow Prediction
The recent years have witnessed a surge in the development of traffic flow prediction methods, often deployed on cloud platforms to offer predictive services for entire transportation networks. However, the processes of training and executing a model for the entire traffic network are both time-consuming and computationally expensive. As a result, the utilization of edge servers for local sub-network prediction services has gained prominence. Nevertheless, training prediction models for numerous sub-networks within the extensive traffic network remains a time-intensive and computing resource-consuming task. To tackle this challenge, this article introduces the Pre-trained model REcommendation Framework for Edge computing enabled tRaffic flow prediction (PREFER). PREFER trains a set of traffic flow prediction models on selected sub-networks, then recommends optimal pre-trained models for edge servers. The recommendation is specifically based on performance prediction, integrating neural collaborative filtering and traffic flow characteristics. Experiments conducted on real datasets reveal that the pre-trained models recommended by PREFER perform close to the actual optimal ones and significantly outperform existing recommendation algorithms.
- 26 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (12) , 20085-20104
Traffic Signal Cycle Control With Centralized Critic and Decentralized Actors Under Varying Intervention Frequencies
Traffic congestion in urban areas is a significant problem, leading to prolonged travel times, reduced efficiency, and increased environmental concerns. Effective traffic signal control (TSC) is a key strategy for reducing congestion. Unlike most TSC systems that rely on high-frequency control, this study introduces an innovative joint phase traffic signal cycle control method that operates effectively with varying control intervals. Our method features an adjust all phases action design, enabling simultaneous phase changes within the signal cycle, which fosters both immediate stability and sustained TSC effectiveness, especially at lower frequencies. The approach also integrates decentralized actors to handle the complexity of the action space, with a centralized critic to ensure coordinated phase adjusting. Extensive testing on both synthetic and real-world data across different intersection types and signal setups shows that our method significantly outperforms other popular techniques, particularly at high control intervals. Case studies of policies derived from traffic data further illustrate the robustness and reliability of our proposed method.
- 26 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (12) , 20085-20104
Traffic Signal Cycle Control With Centralized Critic and Decentralized Actors Under Varying Intervention Frequencies
Traffic congestion in urban areas is a significant problem, leading to prolonged travel times, reduced efficiency, and increased environmental concerns. Effective traffic signal control (TSC) is a key strategy for reducing congestion. Unlike most TSC systems that rely on high-frequency control, this study introduces an innovative joint phase traffic signal cycle control method that operates effectively with varying control intervals. Our method features an adjust all phases action design, enabling simultaneous phase changes within the signal cycle, which fosters both immediate stability and sustained TSC effectiveness, especially at lower frequencies. The approach also integrates decentralized actors to handle the complexity of the action space, with a centralized critic to ensure coordinated phase adjusting. Extensive testing on both synthetic and real-world data across different intersection types and signal setups shows that our method significantly outperforms other popular techniques, particularly at high control intervals. Case studies of policies derived from traffic data further illustrate the robustness and reliability of our proposed method.
- Open Access
- 22 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Vehicular Technology
- Vol. 5, 330-343
Scalable Reinforcement Learning Framework for Traffic Signal Control Under Communication Delays
Vehicle-to-everything (V2X) technology is pivotal for enhancing road safety, traffic efficiency, and energy conservation through the communication of vehicles with their surrounding entities such as other vehicles, pedestrians, roadside infrastructure, and networks. Among these, traffic signal control (TSC) plays a significant role in roadside infrastructure for V2X. However, most existing works on TSC design assume that real-time traffic flow information is accessible, which does not hold in real-world deployment. This study proposes a two-stage framework to address this issue. In the first stage, a scene prediction module and a scene context encoder are utilized to process historical and current traffic data to generate preliminary traffic signal actions. In the second stage, an action refinement module, informed by human-defined traffic rules and real-time traffic metrics, adjusts the preliminary actions to account for the latency in observations. This modular design allows device deployment with varying computational resources while facilitating system customization, ensuring both adaptability and scalability, particularly in edge-computing environments. Through extensive simulations on the SUMO platform, the proposed framework demonstrates robustness and superior performance in diverse traffic scenarios under varying communication delays. The related code is available at https://github.com/Traffic-Alpha/TSC-DelayLight .
- 22 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Vehicular Technology
- Vol. 5, 330-343
Open AccessScalable Reinforcement Learning Framework for Traffic Signal Control Under Communication Delays
Vehicle-to-everything (V2X) technology is pivotal for enhancing road safety, traffic efficiency, and energy conservation through the communication of vehicles with their surrounding entities such as other vehicles, pedestrians, roadside infrastructure, and networks. Among these, traffic signal control (TSC) plays a significant role in roadside infrastructure for V2X. However, most existing works on TSC design assume that real-time traffic flow information is accessible, which does not hold in real-world deployment. This study proposes a two-stage framework to address this issue. In the first stage, a scene prediction module and a scene context encoder are utilized to process historical and current traffic data to generate preliminary traffic signal actions. In the second stage, an action refinement module, informed by human-defined traffic rules and real-time traffic metrics, adjusts the preliminary actions to account for the latency in observations. This modular design allows device deployment with varying computational resources while facilitating system customization, ensuring both adaptability and scalability, particularly in edge-computing environments. Through extensive simulations on the SUMO platform, the proposed framework demonstrates robustness and superior performance in diverse traffic scenarios under varying communication delays. The related code is available at https://github.com/Traffic-Alpha/TSC-DelayLight .
- 23 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 24 (5) , 5039-5051
AMM: An Adaptive Online Map Matching Algorithm
Online map matching is essential for some location-based services, such as car navigation. However, due to GPS measurement errors and/or the lack of sufficient information, the performance of most existing online algorithms will degrade in the increasingly complex traffic environment. In this paper, we propose an adaptive online map matching algorithm called AMM. The basic idea is that AMM should be able to calibrate GPS observation data for various measurement errors and under complex urban conditions. First, we establish a collaborative evaluation model between GPS points and candidate points to effectively filter low-quality GPS measurement points, dynamically set the weights of different features and comprehensively select the best candidate points. Second, we propose a retrospective correction mechanism to correct the previous matching results when more information is available, which will help improve the accuracy of future GPS points. Furthermore, we define parameter self-tuning rules for AMM to enhance its portability by avoiding time-consuming parameter tuning steps. We conduct extensive experiments to evaluate the performance of AMM on real vehicle trajectory datasets. The experiment results show that AMM outperforms its counterparts by up to 32% in terms of accuracy and its performance in different traffic conditions is more stable.
- 23 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 24 (5) , 5039-5051
AMM: An Adaptive Online Map Matching Algorithm
Online map matching is essential for some location-based services, such as car navigation. However, due to GPS measurement errors and/or the lack of sufficient information, the performance of most existing online algorithms will degrade in the increasingly complex traffic environment. In this paper, we propose an adaptive online map matching algorithm called AMM. The basic idea is that AMM should be able to calibrate GPS observation data for various measurement errors and under complex urban conditions. First, we establish a collaborative evaluation model between GPS points and candidate points to effectively filter low-quality GPS measurement points, dynamically set the weights of different features and comprehensively select the best candidate points. Second, we propose a retrospective correction mechanism to correct the previous matching results when more information is available, which will help improve the accuracy of future GPS points. Furthermore, we define parameter self-tuning rules for AMM to enhance its portability by avoiding time-consuming parameter tuning steps. We conduct extensive experiments to evaluate the performance of AMM on real vehicle trajectory datasets. The experiment results show that AMM outperforms its counterparts by up to 32% in terms of accuracy and its performance in different traffic conditions is more stable.