Lingyun Zhu

Lingyun Zhu


Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
26 April 2017 in Sensors
Verified
Journal Article
Open access
PDF file
JTJiqiang Tang
Jiqiang Tang
WYWu Yang
Wu Yang
LZLingyun Zhu
Lingyun Zhu
DWDong Wang
Dong Wang
XFXin Feng
Xin Feng
In recent years, Wireless Sensor Networks with a Mobile Sink (WSN-MS) have been an active research topic due to the widespread use of mobile devices. However, how to get the balance between data delivery latency and energy consumption becomes a key issue of WSN-MS. In this paper, we study the clustering approach by jointly considering the Route planning for mobile sink and Clustering Problem (RCP) for static sensor nodes. We solve the RCP problem by using the minimum travel route clustering approach, which applies the minimum travel route of the mobile sink to guide the clustering process. We formulate the RCP problem as an Integer Non-Linear Programming (INLP) problem to shorten the travel route of the mobile sink under three constraints: the communication hops constraint, the travel route constraint and the loop avoidance constraint. We then propose an Imprecise Induction Algorithm (IIA) based on the property that the solution with a small hop count is more feasible than that with a large hop count. The IIA algorithm includes three processes: initializing travel route planning with a Traveling Salesman Problem (TSP) algorithm, transforming the cluster head to a cluster member and transforming the cluster member to a cluster head. Extensive experimental results show that the IIA algorithm could automatically adjust cluster heads according to the maximum hops parameter and plan a shorter travel route for the mobile sink. Compared with the Shortest Path Tree-based Data-Gathering Algorithm (SPT-DGA), the IIA algorithm has the characteristics of shorter route length, smaller cluster head count and faster convergence rate.

20 March 2025 in Scientific Reports
Verified
Journal Article
Open access
PDF file
LZLingyun Zhu
Lingyun Zhu
RZRenyan Zhao
Renyan Zhao
In the production and manufacturing of Printed Circuit Boards (PCBs), defects can arise negatively impact to both product performance and usability. To tackle the issue of false detections stemming from a high volume of small defects and complex backgrounds in PCBs, we propose SRN_Net, an innovative small object detection framework specifically designed for PCB defect identification scenarios. Firstly, an advanced Separated Global Context Attention (SGC) mechanism is introduced to enhance the model’s attention to small targets and improve the detection accuracy of the model for small targets. Furthermore, a Residual Context Aggregation (RCA) module is seamlessly integrated into the network’s neck, effectively attenuating the disruptive influence of irrelevant background noise during the fusion of small target features. Lastly, a No Stride Convolution (NSC) technique is deployed in both the trunk and neck of the network and meticulously designed to enhance small target detection accuracy by minimizing feature loss during the convolution process. Extensive experiments on the PCB dataset demonstrate that, compared to state-of-the-art algorithms, SRN_Net achieves increases of 1.1% in Precision, 1.3% in Recall, 0.6% in mAP@0.5, and 4.6% in mAP@0.5:0.95, highlighting its superior performance in defect detection. To demonstrate the efficacy of SRN_Net across other industrial datasets, we conducted an additional evaluation on the NEU surface defect dataset, achieving an mAP of 75.8%. This work contributes to advancing small object detection accuracy and robustness in practical applications. The code will be available at https://github.com/Zhaohuohuo666/SRN.

7 April 2026 in Machine Vision and Applications
Verified
Journal Article
Closed access
PDF file
LZLingyun Zhu
Lingyun Zhu
HYHongyu Yi
Hongyu Yi