Yuqi Li

Yuqi Li

Auto-generated profile, based on publicly available information

Yuqi Li

CUNY City College, New York, USA

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
25 March 2025 in Knowledge-Based Systems
Verified
Journal Article
Open access
HZHansheng Zeng
Hansheng Zeng
YLYuqi Li
Yuqi Li
RNRuize Niu
Ruize Niu
CYChuanguang Yang
Chuanguang Yang
Shiping WenShiping Wen
Shiping Wen

20 December 2024 in IEEE Transactions on Cognitive Communications and Networking
Verified
Journal Article
Closed access
YLYao Lu
Yao Lu
YZYutao Zhu
Yutao Zhu
YLYuqi Li
Yuqi Li
DXDongwei Xu
Dongwei Xu
Yun LinYun Lin
Yun Lin
XYXiaoniu Yang
Xiaoniu Yang
With the successful application of deep learning in communications systems, deep neural networks are becoming the preferred method for Automatic Modulation Recognition (AMR). Although these AMR models yield impressive results, they often come with high computational complexity and large model sizes, which hinders their practical deployment in communication systems. To address this challenge, we propose a novel layer pruning method, PSR. Specifically, we decompose the AMR model into several consecutive blocks, each containing consecutive layers with similar semantics. Then, we identify layers that need to be preserved within each block based on their contribution. Finally, we reassemble the pruned blocks and fine-tune the compact model. Extensive experiments on five datasets demonstrate the efficiency and effectiveness of PSR over a variety of state-of-the-art baselines, including layer pruning and channel pruning methods.

30 June 2025
Verified
Conference Paper
Open access
YLYuqi Li
Yuqi Li
QLQingqing Long
Qingqing Long
YZYihang Zhou
Yihang Zhou
RZRan Zhang
Ran Zhang
ZNZhiyuan Ning
Zhiyuan Ning
Meng XiaoMeng Xiao
Meng Xiao

25 March 2024 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
ZMZeyu Ma
Zeyu Ma
YLYuqi Li
Yuqi Li
YLYizhi Luo
Yizhi Luo
XLXiao Luo
Xiao Luo
JLJinxing Li
Jinxing Li
GLGuangming Lu
Guangming Lu
Domain adaptive hashing has received increasing attention since it is capable of enhancing the performance of retrieval if the target domain for testing meets domain shift. However, owing to data security and transmission constraints nowadays, abundant source data is often not available. Towards this end, this paper investigates a novel yet practical problem named test-time adaptive hashing, which aims to enhance the performance of hashing models without access to the source domain data when tested on the target domain with domain shift. This problem is challenging due to both fugacious domain shift and label scarcity on the target domain. In this paper, we propose a novel hashing approach named Di screpancy and S tructure-based C ontrast (DISC) for effective test-time adaptive retrieval. In particular, DISC first trains the hashing model using the source domain data and stores the distribution of each class in the hidden space. During test-time adaptation, we generate simulated source features based on stored distributions and compare class-specific distributions across domains using maximum mean discrepancy (MMD) to overcome potential domain shift. Furthermore, to tackle the label scarcity, we estimate the graph structure using deep features on the target domain, which guides effective hashing contrastive learning for generating discriminative and domain-invariant hash codes. Extensive experiments on various benchmark datasets validate the superiority of our proposed DISC compared with a range of competing baselines.

15 July 2025 in Information Sciences
Verified
Journal Article
Closed access
YLYuqi Li
Yuqi Li
YLYanli Li
Yanli Li
KZKai Zhang
Kai Zhang
FZFuyan Zhang
Fuyan Zhang
CYChuanguang Yang
Chuanguang Yang
THTingwen Huang
Tingwen Huang

11 November 2025 in IEEE Transactions on Emerging Topics in Computational Intelligence
Verified
Journal Article
Closed access
YLYuqi Li
Yuqi Li
HZHansheng Zeng
Hansheng Zeng
FZFuyan Zhang
Fuyan Zhang
CYChuanguang Yang
Chuanguang Yang
YLYan Li
Yan Li
Weiping DingWeiping Ding
Weiping Ding
Magnetic Resonance Imaging (MRI) excels in medical diagnostics with its superior soft tissue contrast and detailed anatomical visualization, providing critical support for precise medical image segmentation. However, traditional full K-space sampling is time-consuming, limiting efficiency in clinical settings. To address this challenge, we propose a novel method leveraging Reinforcement Learning (RL) to adaptively sample K-space, optimizing both MRI acquisition efficiency and segmentation accuracy. Our approach features an RL-driven policy network that strategically selects the most informative K-space samples, substantially reducing scan times while maintaining critical anatomical details. By integrating segmentation performance into the reward model, our method directly aligns the sampling process with accurate pathological segmentation. Furthermore, sparse K-space data are reconstructed into high-quality images, ensuring precise inputs for segmentation networks. Experiments on ACDC, AMOS, M&Ms-2, CHAOS and MSD datasets demonstrate that our approach not only accelerates MRI processing but also significantly enhances segmentation accuracy, showcasing its potential for clinical applications where speed and precision are paramount.