Lei Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Lei Zhang has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
Aqing Yang
Guangdong Polytechnic Normal University
3 shared publications- Jing Zhang
School of Information Science and Engineering, University of Jinan, Jinan 250022, China
2 shared publications Mingxiang Wang
2 shared publications- Na Han
School of Computer Science, Guangdong Polytechnic Normal University, Guangzhou, China
2 shared publications Tongyi Yu
Guangdong Polytechnic Normal University
2 shared publicationsXian Zhang
School of Computer Science, Guangdong Polytechnic Normal University, Guangzhou, China
2 shared publications
Latest Publications
- Open Access
- 7 August 2026
- Published by Springer Nature in Complex & Intelligent Systems
- Vol. 12 (12)
Broad graph convolutional network: a novel graph convolutional network paradigm without hidden layer
Graph convolutional networks (GCNs) have shown promising performance in real-world applications involving graph-structured data. To enhance the model’s ability to integrate information from neighbor nodes, GCNs typically expand the receptive field by stacking more layers, which can lead to the problem of over-smoothing. To address this limitation, high-order graph convolutional networks (HGCNs) such as Mixhop have been proposed. These high-order models, however, introduce the risk of overfitting due to the increased number of parameters required for designing different order convolutions, which in turn can degrade classification performance. To overcome these issues, we first provide a theoretical analysis of the bottlenecks in conventional GCNs and establish that an effective graph convolutional model should integrate multi-hop neighborhood information in a unified manner. Inspired by this, we propose a novel broad graph convolutional network (BGCN) paradigm, which completely eliminates hidden layers and instead expands the receptive field through network width. We introduce four specific BGCN architectures and provide a detailed analysis of their computational complexity and parameter efficiency. A number of experiments on citation networks demonstrate that the proposed methods achieve state-of-the-art performance in terms of both classification accuracy and stability. In particular, our BGCN with simple attention mechanism ( $$\text {BGCN}_{\text {SA}}$$ ) achieves top performance on the Citeseer, Cora, and Pubmed datasets, with accuracies of 73.3%, 83.5%, and 81.1%, respectively. The main advantage of this work lies in offering a robust, efficient, and scalable alternative for graph representation learning, effectively circumventing the inherent limitations of over-smoothing and overfitting in existing deep and high-order GCN models.- 7 August 2026
- Published by Springer Nature in Complex & Intelligent Systems
- Vol. 12 (12)
Open AccessBroad graph convolutional network: a novel graph convolutional network paradigm without hidden layer
Graph convolutional networks (GCNs) have shown promising performance in real-world applications involving graph-structured data. To enhance the model’s ability to integrate information from neighbor nodes, GCNs typically expand the receptive field by stacking more layers, which can lead to the problem of over-smoothing. To address this limitation, high-order graph convolutional networks (HGCNs) such as Mixhop have been proposed. These high-order models, however, introduce the risk of overfitting due to the increased number of parameters required for designing different order convolutions, which in turn can degrade classification performance. To overcome these issues, we first provide a theoretical analysis of the bottlenecks in conventional GCNs and establish that an effective graph convolutional model should integrate multi-hop neighborhood information in a unified manner. Inspired by this, we propose a novel broad graph convolutional network (BGCN) paradigm, which completely eliminates hidden layers and instead expands the receptive field through network width. We introduce four specific BGCN architectures and provide a detailed analysis of their computational complexity and parameter efficiency. A number of experiments on citation networks demonstrate that the proposed methods achieve state-of-the-art performance in terms of both classification accuracy and stability. In particular, our BGCN with simple attention mechanism ( $$\text {BGCN}_{\text {SA}}$$ ) achieves top performance on the Citeseer, Cora, and Pubmed datasets, with accuracies of 73.3%, 83.5%, and 81.1%, respectively. The main advantage of this work lies in offering a robust, efficient, and scalable alternative for graph representation learning, effectively circumventing the inherent limitations of over-smoothing and overfitting in existing deep and high-order GCN models. - 11 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. PP (16) , 1
RDFDS: A Federated Learning Defense Framework in IOV with Fast Distillation Synthesis and Clustering-Based Aggregation
Federated Learning (FL) has emerged as a promising paradigm to address data silos and privacy concerns in artificial intelligence applications. It shows great potential in the Internet of Vehicles (IoV), where sensitive vehicle data must remain local. However, FL is highly vulnerable to model poisoning attacks, especially under non-IID distributions and high malicious participation. Existing defenses, most relying on gradient similarity across clients, often fail under such heterogeneous settings. To address this, we propose RDFDS, a robust defense framework for FL in IoV. RDFDS consists of two tightly coupled modules: (1) a fast distillation-based synthesis module that accelerates knowledge distillation via a lightweight preprocessing step, suitable for real-time vehicular environments; (2) a Gas-KMeans clustering aggregation module that adaptively assigns aggregation weights by identifying the benign majority through Gap Statistics, preserving reliable contributions without requiring global or cross-client reference data. Extensive experiments on MNIST, CIFAR-10, and GTSRB demonstrate that RDFDS consistently outperforms existing defenses in accuracy and robustness, particularly under extreme non-IID conditions and high malicious participation, highlighting its practicality for real-world IoV scenarios.
- 11 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. PP (16) , 1
RDFDS: A Federated Learning Defense Framework in IOV with Fast Distillation Synthesis and Clustering-Based Aggregation
Federated Learning (FL) has emerged as a promising paradigm to address data silos and privacy concerns in artificial intelligence applications. It shows great potential in the Internet of Vehicles (IoV), where sensitive vehicle data must remain local. However, FL is highly vulnerable to model poisoning attacks, especially under non-IID distributions and high malicious participation. Existing defenses, most relying on gradient similarity across clients, often fail under such heterogeneous settings. To address this, we propose RDFDS, a robust defense framework for FL in IoV. RDFDS consists of two tightly coupled modules: (1) a fast distillation-based synthesis module that accelerates knowledge distillation via a lightweight preprocessing step, suitable for real-time vehicular environments; (2) a Gas-KMeans clustering aggregation module that adaptively assigns aggregation weights by identifying the benign majority through Gap Statistics, preserving reliable contributions without requiring global or cross-client reference data. Extensive experiments on MNIST, CIFAR-10, and GTSRB demonstrate that RDFDS consistently outperforms existing defenses in accuracy and robustness, particularly under extreme non-IID conditions and high malicious participation, highlighting its practicality for real-world IoV scenarios.
- Open Access
- 3 July 2025
- Published by Springer Nature in Scientific Reports
- Vol. 15 (1) , 1-13
Self-calibrated acceleration and detail preserving for semantic segmentation of lactating sows and piglets under low-light conditions
Pixel-wise semantic segmentation of lactating sows and piglets is critical to explore maternal traits in smart livestock breeding and production. However, semantic segmentation algorithms do not yield satisfactory results under low-light conditions because these methods are highly dependent on image quality. Therefore, an efficient and detail-preserving low-light image enhancement is necessary and crucial for animal monitoring under low-light conditions. In this paper, a low-light enhancement method called self-calibrated acceleration and detail preserving (SADP) was proposed to improve the semantic segmentation performance of lactating sows and piglets. Specifically, a self-calibration acceleration module that accelerated the convergence among all stages was proposed to improve the computational efficiency and a semantic perceptual loss term was proposed for a high detail and semantic information preservation. Plenty of experiments demonstrated that SADP outperformed the existing well-known methods in both visual quality and efficiency (-0.013s in execution time from 0.0163s to 0.0033s, -0.0031 M in mode size from 0.0034 M to 0.0003 M), and even more improved the performance of semantic segmentation of lactating sows and piglets, raising the mean IOU from 0.8686 to 0.8872. Obviously, SADP also can be used to improve the performance of other high-level visual tasks. This may build a good foundation for the following visual tasks and further promote the livestock breeding and production.
- 3 July 2025
- Published by Springer Nature in Scientific Reports
- Vol. 15 (1) , 1-13
Open AccessSelf-calibrated acceleration and detail preserving for semantic segmentation of lactating sows and piglets under low-light conditions
Pixel-wise semantic segmentation of lactating sows and piglets is critical to explore maternal traits in smart livestock breeding and production. However, semantic segmentation algorithms do not yield satisfactory results under low-light conditions because these methods are highly dependent on image quality. Therefore, an efficient and detail-preserving low-light image enhancement is necessary and crucial for animal monitoring under low-light conditions. In this paper, a low-light enhancement method called self-calibrated acceleration and detail preserving (SADP) was proposed to improve the semantic segmentation performance of lactating sows and piglets. Specifically, a self-calibration acceleration module that accelerated the convergence among all stages was proposed to improve the computational efficiency and a semantic perceptual loss term was proposed for a high detail and semantic information preservation. Plenty of experiments demonstrated that SADP outperformed the existing well-known methods in both visual quality and efficiency (-0.013s in execution time from 0.0163s to 0.0033s, -0.0031 M in mode size from 0.0034 M to 0.0003 M), and even more improved the performance of semantic segmentation of lactating sows and piglets, raising the mean IOU from 0.8686 to 0.8872. Obviously, SADP also can be used to improve the performance of other high-level visual tasks. This may build a good foundation for the following visual tasks and further promote the livestock breeding and production.
- Open Access
- 24 June 2025
- Published by MDPI AG in Veterinary Sciences
- Vol. 12 (7) , 616
Motion-Status-Driven Piglet Tracking Method for Monitoring Piglet Movement Patterns Under Sow Posture Changes
Understanding how piglets move around sows during posture changes is crucial for their safety and healthy growth. Automated monitoring can reduce farm labor and help prevent accidents like piglet crushing. Current methods (called Joint Detection-and-Tracking-based, abbreviated as JDT-based) struggle with problems like misidentifying piglets or losing track of them due to crowding, occlusion, and shape changes. To solve this, we developed MSHMTracker, a smarter tracking system that introduces a motion-status hierarchical architecture to significantly improve tracking performance by adapting to piglets’ motion statuses. In MSHMTracker, a score- and time-driven hierarchical matching mechanism (STHM) was used to establish the spatio-temporal association by the motion status, helping maintain accurate tracking even in challenging conditions. Finally, piglet group aggregation or dispersion behaviors in response to sow posture changes were identified based on the tracked trajectory information. Tested on 100 videos (30,000+ images), our method achieved 93.8% tracking accuracy (MOTA) and 92.9% identity consistency (IDF1). It outperformed six popular tracking systems (e.g., DeepSort, FairMot). The mean accuracy of behavior recognition was 87.5%. In addition, the correlations (0.6 and 0.82) between piglet stress responses and sow posture changes were explored. This research showed that piglet movements are closely related to sow behavior, offering insights into sow–piglet relationships. This work has the potential to reduce farmers’ labor and improve the productivity of animal husbandry.
- 24 June 2025
- Published by MDPI AG in Veterinary Sciences
- Vol. 12 (7) , 616
Open AccessMotion-Status-Driven Piglet Tracking Method for Monitoring Piglet Movement Patterns Under Sow Posture Changes
Understanding how piglets move around sows during posture changes is crucial for their safety and healthy growth. Automated monitoring can reduce farm labor and help prevent accidents like piglet crushing. Current methods (called Joint Detection-and-Tracking-based, abbreviated as JDT-based) struggle with problems like misidentifying piglets or losing track of them due to crowding, occlusion, and shape changes. To solve this, we developed MSHMTracker, a smarter tracking system that introduces a motion-status hierarchical architecture to significantly improve tracking performance by adapting to piglets’ motion statuses. In MSHMTracker, a score- and time-driven hierarchical matching mechanism (STHM) was used to establish the spatio-temporal association by the motion status, helping maintain accurate tracking even in challenging conditions. Finally, piglet group aggregation or dispersion behaviors in response to sow posture changes were identified based on the tracked trajectory information. Tested on 100 videos (30,000+ images), our method achieved 93.8% tracking accuracy (MOTA) and 92.9% identity consistency (IDF1). It outperformed six popular tracking systems (e.g., DeepSort, FairMot). The mean accuracy of behavior recognition was 87.5%. In addition, the correlations (0.6 and 0.82) between piglet stress responses and sow posture changes were explored. This research showed that piglet movements are closely related to sow behavior, offering insights into sow–piglet relationships. This work has the potential to reduce farmers’ labor and improve the productivity of animal husbandry.
- 25 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (7) , 7749-7762
EACAS: An Efficient Anonymous Cross-Domain Authentication Scheme in Internet of Vehicles
With continuous development of the Internet of Vehicles (IoV), intelligence is gradually becoming the mainstream trend of future transportation. However, the increasing number of vehicles and their high mobility also bring greater challenges to privacy and security. Most of the current authentication schemes in IoV focus on a single domain, ignoring the cross-domain requirements brought by high mobility. To address these issues better, we propose an efficient anonymous cross-domain authentication scheme EACAS based on elliptic curve cryptography within the certificate-less cryptography. We incorporate the secret sharing with digital signature to provide the trustworthy authentication for cross-domain vehicles, and the batch verification improves the efficiency of authentication. Besides, we also propose a hierarchical pseudonym method for multidomain scenarios, allowing vehicles to update pseudonyms at arbitrary locations and can be revealed. The formal security proof and analysis demonstrate the security characteristics, and the comprehensive performance evaluation shows the efficiency.
- 25 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (7) , 7749-7762
EACAS: An Efficient Anonymous Cross-Domain Authentication Scheme in Internet of Vehicles
With continuous development of the Internet of Vehicles (IoV), intelligence is gradually becoming the mainstream trend of future transportation. However, the increasing number of vehicles and their high mobility also bring greater challenges to privacy and security. Most of the current authentication schemes in IoV focus on a single domain, ignoring the cross-domain requirements brought by high mobility. To address these issues better, we propose an efficient anonymous cross-domain authentication scheme EACAS based on elliptic curve cryptography within the certificate-less cryptography. We incorporate the secret sharing with digital signature to provide the trustworthy authentication for cross-domain vehicles, and the batch verification improves the efficiency of authentication. Besides, we also propose a hierarchical pseudonym method for multidomain scenarios, allowing vehicles to update pseudonyms at arbitrary locations and can be revealed. The formal security proof and analysis demonstrate the security characteristics, and the comprehensive performance evaluation shows the efficiency.
- Open Access
- 9 January 2024
- Published by Frontiers Media SA in Frontiers in Energy Research
- Vol. 11, 1298837
Efficient privacy protection scheme with batch verification in smart grid
Smart grids can establish two-way communication with users, collect their electricity consumption data and provide reasonable pricing, but fine-grained electricity consumption data leads to the leakage of user privacy. In order to protect the privacy of user data and the security of data transmission process, this article proposes an efficient and batch validated privacy protection scheme. In this scheme, legitimate entities transmit encrypted electricity data after mutual authentication. To ensure the correct data is received, we propose a new batch signature verification algorithm. Security analysis shows that our solution achieves user privacy and data security. The simulation experiments provided demonstrate that the efficiency of the proposed scheme can satisfy the requirements of real-time communication.
- 9 January 2024
- Published by Frontiers Media SA in Frontiers in Energy Research
- Vol. 11, 1298837
Open AccessEfficient privacy protection scheme with batch verification in smart grid
Smart grids can establish two-way communication with users, collect their electricity consumption data and provide reasonable pricing, but fine-grained electricity consumption data leads to the leakage of user privacy. In order to protect the privacy of user data and the security of data transmission process, this article proposes an efficient and batch validated privacy protection scheme. In this scheme, legitimate entities transmit encrypted electricity data after mutual authentication. To ensure the correct data is received, we propose a new batch signature verification algorithm. Security analysis shows that our solution achieves user privacy and data security. The simulation experiments provided demonstrate that the efficiency of the proposed scheme can satisfy the requirements of real-time communication.
- Open Access
Performance Evaluation of Data Utility for a Differential Privacy Scheme Supporting Fault Tolerance
The evolution of smart grids improves the sustainability, controllability, stability, and efficiency of traditional power grids. There is a challenging issue in smart grids with protecting users’ privacy while collecting and controlling individual fine-grained data. To ensure data integrity and address the privacy issue, differential privacy protection is an efficient method to resist differential attacks on aggregated data. However, due to differential noise and faulty smart meters, the problem of differential noise deviation has a great impact on the utility of aggregated data. In this paper, we further supplement the previous work by improving the prediction method, forming a relatively complete DP protection scheme (DPP-UFT) with fault tolerance, and providing a detailed performance evaluation process. The experimental results show that the proposed method of adding differential noise based on the estimated failure rate is related to the estimated failure rate and the noise factor. Compared with several other related literature, it has achieved a higher data utilization effect.
Open AccessPerformance Evaluation of Data Utility for a Differential Privacy Scheme Supporting Fault Tolerance
The evolution of smart grids improves the sustainability, controllability, stability, and efficiency of traditional power grids. There is a challenging issue in smart grids with protecting users’ privacy while collecting and controlling individual fine-grained data. To ensure data integrity and address the privacy issue, differential privacy protection is an efficient method to resist differential attacks on aggregated data. However, due to differential noise and faulty smart meters, the problem of differential noise deviation has a great impact on the utility of aggregated data. In this paper, we further supplement the previous work by improving the prediction method, forming a relatively complete DP protection scheme (DPP-UFT) with fault tolerance, and providing a detailed performance evaluation process. The experimental results show that the proposed method of adding differential noise based on the estimated failure rate is related to the estimated failure rate and the noise factor. Compared with several other related literature, it has achieved a higher data utilization effect.
- Open Access
- 8 September 2023
- Published by Springer Nature in Research Square
Efficient Privacy Protection Scheme with Batch Verification in Smart Grid
Smart grids can establish two-way communication with users, collect their electricity consumption data and provide reasonable pricing, but fine-grained electricity consumption data leads to the leakage of user privacy. In order to protect the privacy of user data and the security of data transmission process, this article proposes an efficient and batch validated privacy protection scheme. In this scheme, legitimate entities transmit encrypted electricity data after mutual authentication. To ensure the correct data is received, we propose a new batch signature verification algorithm. Security analysis shows that our solution achieves user privacy and data security. The simulation experiments provided demonstrate that the efficiency of the proposed scheme can satisfy the requirements of real-time communication.
- 8 September 2023
- Published by Springer Nature in Research Square
Open AccessEfficient Privacy Protection Scheme with Batch Verification in Smart Grid
Smart grids can establish two-way communication with users, collect their electricity consumption data and provide reasonable pricing, but fine-grained electricity consumption data leads to the leakage of user privacy. In order to protect the privacy of user data and the security of data transmission process, this article proposes an efficient and batch validated privacy protection scheme. In this scheme, legitimate entities transmit encrypted electricity data after mutual authentication. To ensure the correct data is received, we propose a new batch signature verification algorithm. Security analysis shows that our solution achieves user privacy and data security. The simulation experiments provided demonstrate that the efficiency of the proposed scheme can satisfy the requirements of real-time communication.
- Open Access
- 6 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 28372-28382
A Privacy-Preserving Distributed Smart Metering Temporal and Spatial Aggregation Scheme
A distributed temporal and spatial aggregation scheme for privacy-preserving smart metering is presented. This scheme preserves the privacy of fine-grained utility usage data of individual users while reporting (a) spatially aggregated utility usage data of a community at fine-grained time steps (e.g. minutes), and (b) temporally aggregated utility usage data of individual users to the utility company over a billing period (e.g. a month). Each meter privately partitions the fine-grained utility data into k partitions and sends them to (homomorphically encrypted) k–1 pairwise smart meters in the community, while keeping the remaining for itself. A smart meter will report to the aggregator a locally aggregated usage amount of its own and of all its pairwise nodes at the fine-grained time scale allowing community-wide spatial aggregation at the aggregator without revealing individual fine-grained usage data. A smart meter will temporally aggregate usage data from each of its pairwise nodes and transmit it to the aggregator where the overall temporal aggregation will be performed by each smart meter. Our scheme not only can prevent privacy theft from external attackers but also is resilient to internal attacks by a subset of smart meters, or even colluding gateway aggregator and the control center. This is a distinct advantage of our scheme over existing works without incurring any computation and communication overheads.
- 6 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 28372-28382
Open AccessA Privacy-Preserving Distributed Smart Metering Temporal and Spatial Aggregation Scheme
A distributed temporal and spatial aggregation scheme for privacy-preserving smart metering is presented. This scheme preserves the privacy of fine-grained utility usage data of individual users while reporting (a) spatially aggregated utility usage data of a community at fine-grained time steps (e.g. minutes), and (b) temporally aggregated utility usage data of individual users to the utility company over a billing period (e.g. a month). Each meter privately partitions the fine-grained utility data into k partitions and sends them to (homomorphically encrypted) k–1 pairwise smart meters in the community, while keeping the remaining for itself. A smart meter will report to the aggregator a locally aggregated usage amount of its own and of all its pairwise nodes at the fine-grained time scale allowing community-wide spatial aggregation at the aggregator without revealing individual fine-grained usage data. A smart meter will temporally aggregate usage data from each of its pairwise nodes and transmit it to the aggregator where the overall temporal aggregation will be performed by each smart meter. Our scheme not only can prevent privacy theft from external attackers but also is resilient to internal attacks by a subset of smart meters, or even colluding gateway aggregator and the control center. This is a distinct advantage of our scheme over existing works without incurring any computation and communication overheads.