CYChengrong Yu

Chengrong Yu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Chengrong Yu has a total of 14 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Deconstructing Supervision: Rethinking Learning Signals in Class Incremental Medical Image Segmentation

    by Shengqian Zhu, Xiaogang Xu, Wenbo Qi, Chengrong Yu, Qiang Wang, Jun Wu, Jiafei Wu, Zhang Yi, Junjie Hu

  • Enhancing Exploration and Exploitation in Tumor Treatment Through Action-Guided Deep Reinforcement Learning

    by Chengrong Yu, Zhonglian Wei, Yuncheng Shen, Yingyong Yin, Zhang Yi, Ying Song, Guangjun Li, Junjie Hu

    Inverse treatment planning is pivotal in tumor treatment planning. It enables the multi-objective optimization of radiation dose delivery, ensuring precise tumor targeting while sparing surrounding healthy tissues. This process often requires frequent parameter adjustments to achieve the desired balance between objectives, making it both labor-intensive and time-consuming. Deep reinforcement learning (DRL) provides an automated, model-based planning solution, aimed at reducing reliance on human expertise and enhancing the efficiency of objective parameter optimization. However, most current approaches apply DRL to inverse planning without fully leveraging the knowledge embedded in the continuous state–action space, defined by the coupling between nonstationary planning states and continuous decision variables. This may result in insufficient exploration and exploitation, leading to inefficient optimization. This work introduces an innovative action-guided DRL (AgDRL) approach for automatic inverse planning. Our goal is to enhance exploration and exploitation by leveraging insightful guidance from reward-guided actions. The implementation of AgDRL incorporates both exploitation and exploration in the action–state space. For exploitation, high-reward actions are employed as guidance to achieve the optimal action adjustment. For exploration, low-reward actions are recommended as training resets to explore a broader range of the latent state space. Quantitative and qualitative experiments are conducted in various settings to evaluate the proposed method. The results are assessed using DRL-related metrics (e.g. reward gains) and clinical-related measurements (e.g. dose–volume histograms, DVHs). Experimental results on a real-world rectal cancer dataset empirically demonstrate that the proposed AgDRL-based approach significantly improves optimization efficiency through a high-reward strategy while enhancing exploration diversity via a low-reward strategy, consistently outperforming the MatRad treatment planning optimization platform.

  • Open Access

    PRIME: Prototype-Driven Class Incremental Learning for Medical Image Segmentation

    by Shengqian Zhu, Chengrong Yu, Wenbo Qi, Jiafei Wu, Ying Song, Guangjun Li, Zhang Yi, Xiaogang Xu, Junjie Hu


  • Open Access

    Incorporating Adaptive Sparse Graph Convolutional Neural Networks for Segmentation of Organs at Risk in Radiotherapy

    by Junjie Hu, Chengrong Yu, Shengqian Zhu, Haixian Zhang

    Precisely segmenting the organs at risk (OARs) in computed tomography (CT) plays an important role in radiotherapy’s treatment planning, aiding in the protection of critical tissues during irradiation. Renowned deep convolutional neural networks (DCNNs) and prevailing transformer-based architectures are widely utilized to accomplish the segmentation task, showcasing advantages in capturing local and contextual characteristics. Graph convolutional networks (GCNs) are another specialized model designed for processing the nongrid dataset, e.g., citation relationship. The DCNNs and GCNs are considered as two distinct models applicable to the grid and nongrid datasets, respectively. Motivated by the recently developed dynamic-channel GCN (DCGCN) that attempts to leverage the graph structure to enhance the feature extracted by the DCNNs, this paper proposes a novel architecture termed adaptive sparse GCN (ASGCN) to mitigate the inherent limitations in DCGCN from the aspect of node’s representation and adjacency matrix’s construction. For the node’s representation, the global average pooling used in the DCGCN is replaced by the learning mechanism to accommodate the segmentation task. For the adjacency matrix, an adaptive regularization strategy is leveraged to penalize the coefficient in the adjacency matrix, resulting in a sparse one that can better exploit the relationships between nodes. Rigorous experiments on multiple OARs’ segmentation tasks of the head and neck demonstrate that the proposed ASGCN can effectively improve the segmentation accuracy. Comparison between the proposed method and other prevalent architectures further confirms the superiority of the ASGCN.


  • Enhancing Robustness of Medical Image Segmentation Model with Neural Memory Ordinary Differential Equation

    by Junjie Hu, Chengrong Yu, Zhang Yi, Haixian Zhang

    Deep neural networks (DNNs) have emerged as a prominent model in medical image segmentation, achieving remarkable advancements in clinical practice. Despite the promising results reported in the literature, the effectiveness of DNNs necessitates substantial quantities of high-quality annotated training data. During experiments, we observe a significant decline in the performance of DNNs on the test set when there exists disruption in the labels of the training dataset, revealing inherent limitations in the robustness of DNNs. In this paper, we find that the neural memory ordinary differential equation (nmODE), a recently proposed model based on ordinary differential equations (ODEs), not only addresses the robustness limitation but also enhances performance when trained by the clean training dataset. However, it is acknowledged that the ODE-based model tends to be less computationally efficient compared to the conventional discrete models due to the multiple function evaluations required by the ODE solver. Recognizing the efficiency limitation of the ODE-based model, we propose a novel approach called the nmODE-based knowledge distillation (nmODE-KD). The proposed method aims to transfer knowledge from the continuous nmODE to a discrete layer, simultaneously enhancing the model’s robustness and efficiency. The core concept of nmODE-KD revolves around enforcing the discrete layer to mimic the continuous nmODE by minimizing the KL divergence between them. Experimental results on 18 organs-at-risk segmentation tasks demonstrate that nmODE-KD exhibits improved robustness compared to ODE-based models while also mitigating the efficiency limitation.