Classification of Complex Power Quality Disturbances Based on Lissajous Trajectory and Lightweight DenseNet
Abstract
1. Introduction
1.1. Background and Motivation
1.2. Literature Review
1.3. Research Objectives and Contributions
- (1)
- A rapid one-dimensional sequence visualization method is proposed, which is built upon the new concept of LT. Once a disturbance occurs, the shape of LT will change significantly according to the disturbance type, generating a clear and distinguishable characteristic trajectory. Meanwhile, the LT synthesis process is very concise. It only requires the construction of a simple ideal reference signal to be completed, which can meet the real-time data conversion requirements in the context of a sharp increase in monitoring data.
- (2)
- Leveraging the dense connectivity feature extraction mechanism of DenseNet, a lightweight image recognition network (L-DenseNet) with both classification accuracy and streamlined architecture is developed as the skeleton model for the PQD classification task. This model includes two primary modules: the dense connected learning module and the classification module. To further enhance the model’s deep feature extraction capability, the convolutional block attention module (CBAM) is introduced between the two modules of L-DenseNet to enhance its ability to focus on and capture fine-grained feature information. By integrating L-DenseNet with the CBAM module, high-precision PQD classification performance is achieved while significantly reducing the model’s parameter count and computational complexity.
- (3)
- The integrated classification framework combining LT and lightweight L-DenseNet-CBAM can effectively extract nonlinear fluctuation feature information from complex PQD signals, enhancing classification accuracy under both noise-free and noisy conditions while significantly reducing computation time. Extensive experiments are conducted based on the simulation dataset generated according to the IEEE std1159 and real-world measured data monitored by the power grid substation to evaluate the performance of the proposed algorithm against several state-of-the-art classification techniques. Compared with the eight existing mainstream PQD classification methods, the proposed algorithm achieves the best comprehensive performance in terms of classification accuracy and efficiency.
2. PQD Signal Visualization Processing Based on Lissajous Trajectory
2.1. Model Construction of PQDs
2.2. Sequence Visualization via Lissajous Trajectory
3. PQD Classification Model Based on Lightweight DenseNet
3.1. Fundamental Principles of DenseNet
3.2. Design of Lightweight DenseNet Architecture
3.3. Attention Mechanism
3.4. Overall Framework Construction for PQD Classification
- (1)
- Signal visualization module: Firstly, the ideal reference signal UISP is constructed using (1). The values of the UISP and the PQD temporal sequence sampling signal at the same time point serve as the horizontal and vertical coordinates in a Cartesian coordinate system, respectively, for curve synthesis, thereby generating the LT representation corresponding to the target PQD signal. Then, the synthesized LT is mapped onto a fixed-size image space and normalized using a unified coordinate range to generate a two-dimensional image with a resolution of 128 × 128 pixels and three RGB channels. This method indirectly enhances the classification accuracy of PQDs at the data representation level by generating two-dimensional trajectory images with clear and distinguishable features.
- (2)
- Dense connected learning module: This module comprises DBs and transition layers. RGB feature maps undergo convolution and dimension reduction via convolution layers and max-pooling layers to extract shallow feature information. Following feature extraction, the feature information needs to traverse three sets of DBs, with a transition layer connecting every two sets of DBs. When passing through DBs, feature reuse is performed on feature maps from different layers in the channel dimension based on a dense connection mechanism, which is conducive to the extraction of deeper feature information and the combination of shallow- and deep-layer information in the network, which greatly improves feature utilization. Meanwhile, transition layers are introduced to reduce feature dimensions, which reduces network parameter redundancy and enhances the overall efficiency of the model’s learning and computation.
- (3)
- Attention mechanism module: Adding the CBAM attention module between the dense connection learning module and the classification module of DenseNet-S can effectively enhance the network’s recognition precision, as evidenced by extensive experimentation. The feature map, , output by Dense Block 3 enters the CAM module, where max-pooling and average-pooling operations are performed, resulting in two one-dimensional feature vectors. Then, the two feature vectors are sent into the full connection layer for calculation and the sum operation. After the activation operation, the CAM module generates channel attention weights, , which are then multiplied with the feature map, , to derive , which is the input feature map for the SAM module. In the SAM module, the feature map, , undergoes separate max-pooling and average-pooling operations according to spatial position, and the two results are spliced to generate an feature map. Subsequently, this map undergoes dimensional reduction through a 1-channel convolution layer. The spatial attention weight, , is then obtained via Sigmoid function activation. Ultimately, the feature obtained by multiplying the weights, , with the input feature map, , represents the feature enhanced by CBAM.
- (4)
- Classification module: This module consists of an adaptive average-pooling layer, two fully connected layers, and a Softmax classifier. Firstly, the feature maps enhanced by CBAM are converted into one-dimensional feature vectors using adaptive average pooling, which are then input into the fully connected layer. Then, the feature information output from the fully connected layer is input into the Softmax classifier. The Softmax function is used to calculate the probability value of each PQD type corresponding to the LT feature image, and the category with the maximum value is output as the classification result to achieve the identification of the PQD type.
4. Case Studies: Part I: Simulation Analysis
4.1. Experimental Environment and Data Preparation
4.2. Hyperparameter Settings and Performance Evaluation Metrics
4.3. Classification Performance Evaluation of the Lightweight L-DenseNet-CBAM
4.4. Performance Comparison with Advanced PQD Classification Methods
4.4.1. Performance Comparison with Advanced Image Recognition Models
4.4.2. Performance Comparison with Advanced PQD Classification Algorithms
4.5. Noise Robustness Performance Evaluation
5. Case Studies: Part II: Real-World Measured Data Analysis
5.1. Engineering Effectiveness Analysis of the Proposed PQD Classification Algorithm
5.2. Comprehensive Performance Comparison with the Existing PQD Classification Algorithms
6. Conclusions
Author Contributions
Funding
Institutional Review Board Statement
Informed Consent Statement
Data Availability Statement
Acknowledgments
Conflicts of Interest
References
- Chakraborty, S.; Modi, G.; Singh, B. A Cost Optimized-Reliable-Resilient-Realtime- Rule-Based Energy Management Scheme for a SPV-BES-Based Microgrid for Smart Building Applications. IEEE Trans. Smart Grid 2023, 14, 2572–2581. [Google Scholar] [CrossRef]
- Vasquez, J.; Jaramillo, M.; Carrión, D. An Intelligent Framework for Multiscale Detection of Power System Events Using Hilbert–Huang Decomposition and Neural Classifiers. Appl. Sci. 2025, 15, 6404. [Google Scholar] [CrossRef]
- Mendia, J. Power Quality Monitoring Part 1: The importance of standards compliant power quality measurements. Analog. Dialogue 2022, 56, 1–4. [Google Scholar]
- IEEE Std 2938 TM-2023; IEEE Guide for Economic Loss Evaluation of Sensitive Industrial Customers Caused by Voltage Sags. IEEE Power and Energy Society: Piscataway, NJ, USA, 2023.
- Ptak, T.; Brooks, J.; Stock, R. A systematic review and typology of power outage literature: Critical infrastructure, climate change and social impacts. Renew. Sustain. Energy Rev. 2025, 218, 115778. [Google Scholar] [CrossRef]
- Borras, M.; Bravo, J.; Montano, J. Disturbance ratio for optimal multi-event classification in power distribution networks. IEEE Trans. Ind. Electron. 2016, 63, 3117–3124. [Google Scholar] [CrossRef]
- Reddy, V.; Sodhi, R. A modified S-transform and random forests-based power quality assessment framework. IEEE Trans. Instrum. Meas. 2018, 67, 78–89. [Google Scholar] [CrossRef]
- Mishra, S.; Mallick, R.K.; Gadanayak, D.A.; Nayak, P.; Sharma, R.; Panda, G.; Al-Numay, M.S.; Siano, P. Real time intelligent detection of PQ disturbances with variational mode energy features and hybrid optimized light GBM classifier. IEEE Access 2024, 12, 47155–47172. [Google Scholar] [CrossRef]
- Xu, W.; Duan, C.; Wang, X.; Dai, J. Power Quality Disturbance Identification Method Based on Improved Fully Convolutional Network. In Proceedings of the 2022 5th Asia Conference on Energy and Electrical Engineering (ACEEE), Kuala Lumpur, Malaysia, 8–10 July 2022; pp. 1–6. [Google Scholar]
- Wang, S.; Chen, H. A novel deep learning method for the classification of power quality disturbances using deep convolutional neural network. Appl. Energy 2019, 235, 1126–1140. [Google Scholar] [CrossRef]
- Shukla, J.; Panigrahi, B.; Ray, P. Power quality disturbances classification based on Gramian angular summation field method and convolutional neural networks. Int. Trans. Electr. Energy Syst. 2021, 31, e13222. [Google Scholar] [CrossRef]
- Lan, M.; Liu, Y.; Jin, T.; Gong, Z.; Liu, Z. An improved recognition method based on visual trajectory circle and ResNet18 for complex power quality disturbances. Proc. CSEE 2022, 42, 6274–6285. [Google Scholar]
- Yuan, D.; Liu, Y.; Hu, H.; Lan, M.; Jin, T.; Mohamed, M. A Novel Recognition Method for Complex Power Quality Disturbances Based on Visualization Trajectory Circle and Machine Vision. IEEE Trans. Instrum. Meas. 2022, 71, 1–13. [Google Scholar] [CrossRef]
- IEEE Std 1159 TM-2019; IEEE Recommended Practice for Monitoring Electric Power Quality. IEEE: Washington, DC, USA, 2019.
- Karacor, D.; Nazlibilek, S.; Sazli, M.; Akarsu, E. Discrete Lissajous figures and applications. IEEE Trans. Instrum. Meas. 2014, 63, 2963–2972. [Google Scholar] [CrossRef]
- Abu-Siada, A.; Mir, S. A new on-line technique to identify fault location within long transmission lines. Eng. Fail. Anal. 2019, 105, 52–64. [Google Scholar] [CrossRef]
- Izad, M.; Mohsenian-Rad, H. A Synchronized Lissajous-Based Method to Detect and Classify Events in Synchro-Waveform Measurements in Power Distribution Networks. IEEE Trans. Smart Grid 2022, 13, 2170–2184. [Google Scholar] [CrossRef]
- Huang, G.; Liu, Z.; LAURENS, V. Densely connected convolutional networks. In Proceedings of the 2017 IEEE Conference on Computer Vision and Pattern Recognition(CVPR), Honolulu, HI, USA, 21–26 July 2017; pp. 2261–2269. [Google Scholar]
- Woo, S.; Park, J.; LEE, J. CBAM: Convolutional block attention module. In Proceedings of the 15th European Conference on Computer Vision (ECCV), Munich, Germany, 8–14 September 2018; pp. 3–19. [Google Scholar]
- Takiddin, A.; Ismail, M.; Zafar, U.; Serpedin, E. Deep autoencoder based anomaly detection of electricity theft cyberattacks in smart grids. IEEE Syst. J. 2022, 16, 4106–4117. [Google Scholar] [CrossRef]
Label | Type of PQDs | Mathematical Model | Parameters |
---|---|---|---|
C0 | Normal | ||
C1 | Sag | ||
C2 | Swell | ||
C3 | Interruption | ||
C4 | Harmonic | ||
C5 | Oscillatory transient | ||
C6 | Pulse | ||
C7 | Flicker | ||
C8 | Notch | ||
C9 | Spike |
Layer | Module Composition (Growth Rate k = 32) | Output Dimensions |
---|---|---|
Convolutional | 7 × 7 Conv, stride = 2 | 64 × 64 × 64 |
Pooling | 3 × 3 Max pooling, stride = 2 | 32 × 32 × 64 |
DB1 | 32 × 32 × 160 | |
Transition | 1 × 1 Conv | 16 × 16 × 80 |
2 × 2 Average pooling, stride = 2 | ||
DB2 | 16 × 16 × 336 | |
Transition | 1 × 1 Conv | 8 × 8 × 168 |
2 × 2 Average pooling, stride = 2 | ||
DB3 | 8 × 8 × 552 | |
Classification | Adaptive average pooling | 1 × 1 × 552 |
Fully connected, Softmax | 1 × 1 × 41 |
Configuration | Parameter | Configuration | Parameter |
---|---|---|---|
OS | Win10 64bit | Python | 3.9 |
CPU | Ryzen 3970X | Pyts | 0.12.0 |
GPU | RTX 3090 | Pytorch | 1.12.1 |
RAM | DDR4 128G | CUDA | 11.6 |
Model | Overall Classification Accuracy | |||
---|---|---|---|---|
0 dB | 60 dB | 40 dB | 20 dB | |
L-DenseNet | 95.38 | 94.70 | 92.45 | 89.94 |
L-DenseNet-CBAM | 98.83 | 98.05 | 96.18 | 93.86 |
Model | Overall Classification Accuracy | |||
---|---|---|---|---|
0 dB | 60 dB | 40 dB | 20 dB | |
CNN [11] | 87.45 | 86.22 | 84.96 | 81.17 |
ResNet-18 [12] | 96.52 | 95.85 | 94.51 | 91.22 |
ResNet-50 [13] | 97.25 | 96.68 | 94.87 | 92.53 |
L-DenseNet-CBAM | 98.83 | 98.05 | 96.18 | 93.86 |
Model | Hyperparameters | ||
---|---|---|---|
Item | Range | Values | |
SVM | Kernel | linear, poly, rbf, sigmoid | rbf |
Regulation parameter c | 0.5, 1, 10, 100 | 1 | |
Gamma | Scale, auto | scale | |
RF | Criterion | gini, entropy | gini |
Decision tree number | 400, 500, 600, 700 | 600 | |
The max depth | None, 5, 10, 20 | None | |
LGBM | Estimator court | 100, 200, 300, 400 | 200 |
Max tree depth | 1, 20, 50, 80 | 20 | |
Leave number | 100, 200, 300, 400 | 100 | |
lambda | 0, 100, 200, 300 | 200 | |
FCN-LSTM | Batch size | 16, 32, 64, 128 | 128 |
Convolutional kernel size | (1,1), (3,3), (5,5) | (3,3) | |
Number of neurons | 128, 256, 512, 1024 | 512 | |
Optimizer | SGD, Adam, Nadam | Adam | |
Dropout rate | 0, 0.2, 0.4, 0.6 | 0.4 | |
Hidden activation function | ReLU, Tanh, Sigmoid | ReLU | |
DNN | Batch size | 16, 32, 64, 128 | 32 |
Convolutional kernel size | (1,1), (3,3), (5,5) | (3,3) | |
Activation function | ReLU, Tanh, Sigmoid | Tanh | |
BN layer | With or without | With | |
Fully connected layer number | 1, 2, 3, 4 | 3 | |
Optimizer | SGD, Adam, Nadam | Nadam | |
Dropout rate | 0, 0.2, 0.4, 0.6 | 0 | |
CNN | Batch size | 16, 32, 64, 128 | 64 |
Convolutional kernel Size | (1,1), (3,3), (5,5) | (5,5) | |
Activation function | ReLU, Tanh, Sigmoid | ReLU | |
Fully connected layer number | 1, 2, 3, 4 | 1 | |
Optimizer | SGD, Adam, Nadam | Adam | |
ResNet18 | Batch size | 16, 32, 64, 128 | 64 |
Activation function | ReLU, Tanh, Sigmoid | ReLU | |
The optimizer | SGD, Adam, Nadam | SGD | |
ResNet50 | Batch size | 16, 32, 64, 128 | 64 |
Activation function | ReLU, Tanh, Sigmoid | ReLU | |
The optimizer | SGD, Adam, Nadam | SGD | |
Proposal | Batch size | 16, 32, 64, 128 | 64 |
Activation function | ReLU, Tanh, Sigmoid | ReLU | |
Optimizer | SGD, Adam, Nadam | Adam |
Algorithm | Params (M) | Size (MB) | FLOPs (G) | Time (ms) | Accuracy | |
---|---|---|---|---|---|---|
Signal Processing (ms) | Model Classification (ms) | |||||
DWT&SVM [6] | 10.92 | 85.65 | 32.72 | 16.83 | 13.82 | 88.75 |
ST&RF [7] | / | 1014.17 | / | 59.44 | 29.38 | 84.91 |
VMD&LGBM [8] | / | 7.29 | / | 24.26 | 11.94 | 89.28 |
FCN-LSTM [9] | 1.72 | 6.58 | 0.54 | / | 18.37 | 77.51 |
DNN [10] | 0.17 | 0.64 | 0.11 | / | 16.43 | 90.23 |
GAF&CNN [11] | 1.53 | 5.83 | 0.13 | 109.93 | 9.64 | 91.56 |
TC&ResNet18 [12] | 11.19 | 42.73 | 1.82 | 34.75 | 41.90 | 95.63 |
ITC&ResNet50 [13] | 23.57 | 90.11 | 4.13 | 57.71 | 74.33 | 96.78 |
Proposed | 1.88 | 6.94 | 0.22 | 12.26 | 11.06 | 98.05 |
Label | Type | Accuracy | Label | Type | Accuracy |
---|---|---|---|---|---|
C0 | Normal | 98.5% | C21 | Interr + Oscill | 100% |
C1 | Sag | 90% | C22 | Interr + Notch | 100% |
C2 | Swell | 97.5% | C23 | Har + Flicker | 87.5% |
C3 | Interruption | 95% | C24 | Har + Oscill | 99.5% |
C4 | Harmonic | 95% | C25 | Pulse + Flicker | 100% |
C5 | Oscillatory transient | 97% | C26 | Sag + Pulse + Flicker | 99.5% |
C6 | Pulse | 97.5% | C27 | Sag + Har + Oscill | 100% |
C7 | Flicker | 91.5% | C28 | Sag + Har + Flicker | 66.5% |
C8 | Notch | 95.5% | C29 | Swell + Pulse + Flicker | 99.5% |
C9 | Spike | 94% | C30 | Swell + Har + Oscill | 100% |
C10 | Sag + Har | 97.5% | C31 | Swell + Har + Flicker | 62.5% |
C11 | Sag + Oscil | 100% | C32 | Interr + Pulse + Flicker | 99.5% |
C12 | Sag + Pulse | 91.5% | C33 | Interr + Har + Oscill | 100% |
C13 | Sag + Notch | 96.5% | C34 | Har + Pulse + Flicker | 100% |
C14 | Sag + Spike | 91.5% | C35 | Har + Oscill + Flicker | 94.5% |
C15 | Swell + Har | 96% | C36 | Sag + Har + Oscill + Flicker | 61% |
C16 | Swell + Oscill | 99.5% | C37 | Sag + Har + Pulse + Flicker | 96.5% |
C17 | Swell + Pulse | 90.5% | C38 | Swell + Har + Oscill + Flicker | 87.5% |
C18 | Swell + Notch | 99.5% | C39 | Swell + Har + Pulse + Flicker | 96% |
C19 | Swell + Spike | 95% | C40 | Interr + Har + Pulse + Flicker | 95.5% |
C20 | Interr + Har | 93.5% | Overall Accuracy | 93.86% |
Label | Type of PQDs | Number of Samples | Classification Results |
---|---|---|---|
C1 | Sag | 68 | C1: 61/C3: 2/C1 + C5: 4/C1 + C8: 1 |
C2 | Swell | 25 | C2: 25 |
C3 | Interruption | 3 | C3: 3 |
C4 | Harmonic | 24 | C4: 23/C4 + C5: 1 |
C6 | Pulse | 5 | C6: 5 |
C7 | Flicker | 34 | C7: 30/C4 + C7: 3/C6 + C7: 1 |
C1 + C4 | Sag + Har | 18 | C1 + C4: 16/C1: 2 |
C1 + C5 | Sag + Oscill | 12 | C1 + C5: 9/C1 + C4: 2/C1 + C4 + C5: 1 |
C6 + C7 | Pulse + Flicker | 5 | C6 + C7: 5 |
C2 + C9 | Swell + Spike | 5 | C2 + C9: 5 |
C1 + C4 + C7 | Sag + Har + Flicker | 5 | C1 + C4 + C7: 5 |
C3 + C4 + C5 | Interr + Har + Oscill | 3 | C3 + C4 + C5: 2/C1 + C4: 1 |
Algorithm | Visualization Conversion Time | Model Classification Time | Accuracy |
---|---|---|---|
GAF + CNN [11] | 109.55 ms | 9.76 ms | 67.63% |
TC + ResNet18 [12] | 34.58 ms | 41.95 ms | 78.81% |
ITC + ResNet50 [13] | 57.78 ms | 73.05 ms | 84.54% |
Proposal | 12.26 ms | 11.22 ms | 91.30% |
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
Share and Cite
Zhang, X.; Zheng, J.; Mei, F.; Miao, H. Classification of Complex Power Quality Disturbances Based on Lissajous Trajectory and Lightweight DenseNet. Appl. Sci. 2025, 15, 8021. https://doi.org/10.3390/app15148021
Zhang X, Zheng J, Mei F, Miao H. Classification of Complex Power Quality Disturbances Based on Lissajous Trajectory and Lightweight DenseNet. Applied Sciences. 2025; 15(14):8021. https://doi.org/10.3390/app15148021
Chicago/Turabian StyleZhang, Xi, Jianyong Zheng, Fei Mei, and Huiyu Miao. 2025. "Classification of Complex Power Quality Disturbances Based on Lissajous Trajectory and Lightweight DenseNet" Applied Sciences 15, no. 14: 8021. https://doi.org/10.3390/app15148021
APA StyleZhang, X., Zheng, J., Mei, F., & Miao, H. (2025). Classification of Complex Power Quality Disturbances Based on Lissajous Trajectory and Lightweight DenseNet. Applied Sciences, 15(14), 8021. https://doi.org/10.3390/app15148021