1. Introduction
Disturbances occurring in power system voltage or current can lead to equipment failure or maloperation, making effective monitoring essential. To develop strategies for protection and disturbance correction, it is necessary to analyze power system voltage or current data. In many cases, this data must be transmitted to data centres for storage and future analysis. However, the large volume of such data requires efficient storage with minimal memory usage and no loss of information. Conventional signal processing techniques often demand high memory capacity. To address this challenge, sparse decomposition techniques can be used to represent signals thereby reducing memory requirement. The core idea is to represent a power signal using as few nonzero coefficients as possible from a chosen dictionary, often enabling compression, denoising, and feature extraction. Common frameworks include sparse coding with
l0 and
l1 regularizations, greedy algorithms (Matching Pursuit, Orthogonal Matching Pursuit), and convex relaxation algorithms (LASSO, Basis Pursuit) [
1,
2,
3].
Signal representation in sparse form using overcomplete dictionaries were introduced in [
4,
5,
6,
7] for image processing applications. In power system signals, especially in situations, where sparsity exists, the sparse representations will reduce the number of measurements or processing time. Its application can improve system efficiency, save costs, and support more intelligent power management systems. In [
1], Manikantan M.S. et al. investigated the effect of diverse dictionaries for representation of power signals, with Orthogonal Matching Pursuit (OMP) algorithm for obtaining the sparse form. Further investigation revealed that other greedy algorithms, such as Least Squares–Orthogonal Matching Pursuit (LS-OMP), Matching Pursuit (MP), and Thresholding algorithms, are also effective for obtaining sparse representations of signals [
8,
9,
10,
11,
12,
13,
14,
15,
16]. Matching Pursuit has been established as a powerful tool for analyzing power signals containing harmonics, transients, and nonstationary phenomena. By leveraging sparse decomposition and overcomplete dictionaries, MP-based techniques offer superior time-frequency resolution and component isolation compared to traditional Fourier-based approaches [
17]. Although the MP algorithm was used extensively for power signal representation, the other techniques like LS-OMP and Thresholding have received less attention in the literature. But these methods offer several advantages and therefore warrant further investigation. Least squares-enhanced variants of Orthogonal Matching Pursuit—including the LS-OMP algorithm—extend the standard greedy pursuit framework by integrating least squares error minimization directly into the atom selection process. These algorithms offer improved support recovery, better noise robustness, and potentially stronger performance when dictionary atoms are correlated—making them promising for the sparse decomposition of power quality disturbance signals such as harmonics and transients [
18]. The Thresholding algorithm can perform sparse signal recovery at a faster rate, but with lesser accuracy [
1].
Greedy algorithms are used to approximate the solution of
l0 norm minimization problem, which is NP hard (non-deterministic polynomial-time hard). An NP hard problem refers to a class of problems for which no polynomial time solution is known, making them computationally difficult to solve. In this context, minimizing the number of non-zero elements in a vector is such a problem. To address this, relaxation methods based on l
1 norm have been introduced in [
19,
20], providing a more computationally feasible alternative. Among the relaxation algorithms, Basis Pursuit (BP) has emerged as a powerful and theoretically sound approach for sparse decomposition of power signals. Its ability to provide high-resolution, noise-robust representations makes it particularly suitable for harmonic analysis, power quality assessment, transient detection, and compressed sensing applications. While computational challenges remain, ongoing advances in optimization and computing continue to expand BP’s applicability in power system signal processing [
21].
A review of recent advances in Sparse Signal Decomposition (SSD) techniques was conducted, which identified algorithms such as BAT-OMP in the literature [
22,
23]. In particular, Ref. [
23] introduces Adaptive Evolutionary Atomic Sparse Decomposition (AEA-SD), a sophisticated method for extracting nonstationary signals from complex background noise. This approach claims to improve computational speed and precision by integrating the Bat algorithm, thereby accelerating convergence and eliminating the need for redundant data structures. In addition, a study on improving Maximum Power Point Tracking (MPPT) using Particle Swarm Optimization (PSO) and Grey Wolf Optimization (GWO) was reported in [
24]. However, the Mean Square Error (MSE) performance and computational time in these studies are not significantly better than those achievable using conventional techniques.
The review was further extended to advanced signal decomposition techniques for the classification of power quality disturbances [
25,
26,
27,
28,
29,
30,
31]. These approaches involve the development of machine learning models and the application of artificial intelligence methods for power signal classification. However, such techniques typically require large memory resources and involve additional computational complexity, which can be avoided by using conventional SSD techniques.
Despite these developments, a systematic comparison of Sparse Signal Decomposition (SSD) techniques for the sparse representation of power quality disturbance signals remains limited. In particular, the relative performance of different SSD methods and the influence of dictionary selection have not been comprehensively analyzed. To address this gap, this paper presents a detailed investigation of various SSD techniques using diverse dictionaries for representing power quality disturbance signals.
The Orthogonal Matching Pursuit (OMP) algorithm and its effectiveness in representing power quality disturbance signals using diverse dictionaries were discussed in our earlier work [
32]. That study focused on identifying the most suitable dictionary for signal representation under disturbances, with OMP employed as the sparse decomposition technique. The results in [
32] demonstrated that Orthogonal Hybrid Dictionaries (OHD), which are widely used in the existing literature, are less effective compared to individual dictionaries such as DCT, DST, and impulse dictionaries.
Building on this, the present work extends the analysis by developing alternative sparse decomposition techniques through suitable modifications to the OMP algorithm. The objective is to identify a technique that can represent a wide range of signals with high precision while minimizing storage requirements. Ultimately, this enables the development of a framework for selecting the most effective sparse decomposition technique along with an optimal dictionary for achieving efficient sparse representation. The performance of the proposed methods is validated using the same evaluation metrics as in our previous work [
32].
The scientific contributions of this paper are as follows:
The methodology adopted for signal representation, the operational principles of the algorithms, and the performance evaluation of the SSD techniques are discussed in the subsequent sections.
2. Methodology
The study focuses on the identification of the most suitable sparse decomposition technique and the dictionary for optimum representation of power quality disturbance signals. The overall methodology consists of data acquisition, data segmentation, implementation of SSD methods with dictionaries and performance evaluation.
Power quality disturbance signals like sag, swell, transients, harmonics and random disturbances are generated using mathematical formulations. The power signal procured from the system (global signal) is partitioned into multiple segments (stripes) as proposed in [
21,
33] to reduce the computational complexity. Subsequently, the SSD technique is applied to each stripe or segmented portion of the signal to obtain sparse representations. Then, they are merged to form the global sparse matrix (X). This sparse matrix is multiplied with an appropriate dictionary to obtain the global reconstructed signal. This reconstructed signal is compared with the actual power signal for testing the effectiveness of the SSD technique and the dictionary used. Diverse dictionaries like DCT, DST and impulse dictionaries are considered for each of the SSD techniques.
The sparse representation problem can be written as an
l0 minimization problem, as given in Equation (1), where the objective is to determine a sparse matrix ‘X’, with the minimum number of non-zero elements such that the product of the dictionary ‘D’ and the sparse matrix ‘X’ approximates the original signal ‘Y’. The signal obtained from the product of D and X is considered as the reconstructed signal ‘Y1’.
The optimization problem considered here is the problem, since the difference between Y and DX is restricted to be less than a small positive constant ε and not zero. This enables us to get a solution for the optimization problem, as a stringent restriction may not provide an answer to the problem.
The comparison of different SSD methods with diverse dictionaries is done based on reconstruction accuracy, memory requirements, and speed of computation. Accuracy is evaluated using Mean Square Error (MSE) and the A/R ratio as given in Equations (2) and (3) [
34,
35,
36]:
where N is the number of points considered;
Yi is the actual signal at the instant I;
Y1i is the reconstructed signal from sparse representation at instant i.
Smaller MSE and A/R ratio implies that the reconstructed signal closely resembles the original signal. Storage requirements are analyzed in terms of sparsity, which is related to the number of zero elements in the representation. Higher sparsity implies fewer non-zero values and thus lower storage requirements.
3. Sparse Signal Decomposition Techniques
A detailed discussion on various greedy and relaxation algorithms for obtaining sparse representations of power quality disturbance signals is presented in this section.
Figure 1 illustrates the algorithm of LS-OMP. The working of the algorithm may be explained as:
The residue (re) is assigned as the first column of Y; the normalized squared mean (R) is taken and is compared with the product of sparse error constant (S) and a positive constant (eb); this product is represented by α.
If residue is less than α, then the iteration stops, and the residue is assigned to the next column of Y.
If the normalized residue (R) is greater than α, then the residue is multiplied with the transposed dictionary and its absolute value is calculated. The dictionary column which will contribute the maximum for the representation of the signal is identified and its column number is added to the index (indx) and the column is added to the temporary dictionary (Dh). The updated dictionary is used to calculate the temporary column of the sparse matrix (Xht). The iterations provide all the non-sparse elements of Xht, which are added to the intermediate sparse matrix (Xh) at appropriate positions.
Figure 1.
Flow chart for LS-OMP algorithm.
Figure 1.
Flow chart for LS-OMP algorithm.
Unlike the OMP algorithm, the residue ‘re’ is used only as a stopping criterion and not for sparse signal generation. Instead, the error between the actual signal and reconstructed signal is calculated at every iteration and is used for sparse signal generation. This makes LS-OMP slower than OMP, but more accurate. In Matching Pursuit (MP), the sparse signal calculation is modified as shown in
Figure 2. In this method, the column from the dictionary that contributes the maximum to the representation of the signal is directly chosen for sparse representation. The error is not calculated in each iteration.
In the Thresholding algorithm as shown in
Figure 3, the columns of the dictionary which contributes a maximum for the representation of the actual signal are ordered in descending order. Then, each such column is utilized for the sparse representation in the corresponding step.
The Basis Pursuit is not based on
l0 norm, it uses
l1 norm for solving Equation (1), i.e., Basis Pursuit minimizes the first norm of the sparse matrix (X), as shown in Equation (4), with the
condition.
where
is the
l1 norm. The problem is to minimize the first norm of X, such that the second norm of Y − DX is less than or equal to a small positive constant ε. The implementation of Basis Pursuit using Iterative Reweighted Least Squares (IRLS) is shown in
Figure 4. The diagonal weight matrix W
k is calculated from X as shown in Equation (5):
Here d1 is a small positive constant to avoid division by zero. X will be updated in each step until m steps, where m is the number of columns of Y. L is a small positive constant, which is considered in the constrained least squares problem.
4. Simulation Results
The efficacy of the SSD techniques discussed in the previous sections were evaluated based on accuracy and speed of computation. The techniques with higher accuracy and faster computation speed were considered more suitable for the sparse representation. The stripe representation of the signal was used for computation, as it reduces the dimension of the sparse matrix (X) as compared to treating the signal as a single data set.
In our earlier work [
32], a comparative analysis of diverse dictionaries was carried out using OMP as the sole Sparse Signal Decomposition (SSD) technique. The study showed that individual dictionaries, particularly impulse dictionaries, provide better performance than hybrid dictionaries. In addition, an analysis of the sparsity constant—representing the number of columns selected for signal representation—was conducted, and a value of 0.01 was found to yield the best results in terms of accuracy.
Building on these findings, the optimal sparsity constant and individual dictionaries identified in [
32] are used for the current analysis. This work focuses on identifying the most effective SSD technique for representing various power quality disturbances with high precision and minimal non-sparse components. The analysis is performed on signals with a fundamental frequency of 50 Hz, with disturbances introduced between 10 s and 50 s.
Figure 5 illustrates a power system signal with a swell disturbance (actual signal) along with reconstructed signals obtained using various Sparse Signal Decomposition (SSD) techniques, namely LS-OMP, MP, Thresholding, BP, and OMP with an impulse dictionary. From the figure, it is evident that the reconstructed signals using LS-OMP, BP, and OMP closely match the actual signal, whereas the MP and Thresholding techniques show comparatively poorer reconstruction performance.
Table 1 presents the reconstruction accuracy and the percentage sparsity of the stored matrix for each method. The results indicate that LS-OMP and OMP achieve perfect reconstruction, with zero A/R ratio and Mean Square Error (MSE) and a reasonably good percentage sparsity of 82%. Although MP attains the highest sparsity of 87%, its A/R ratio and MSE are significantly higher, indicating reduced reconstruction quality.
Figure 6 and
Figure 7 present the comparison of various SSD techniques for representing swell disturbance using DCT and DST dictionaries, respectively, while
Table 2 and
Table 3 summarize the corresponding performance metrics. The observations are consistent with those obtained using the impulse dictionary (
Figure 5 and
Table 1). In both cases, LS-OMP and OMP yield comparable performance, achieving near-zero A/R ratio and MSE with good sparsity (82%). MP, however, provides the highest sparsity (87%) at the expense of increased reconstruction error.
The results presented in
Figure 5,
Figure 6 and
Figure 7 and
Table 1,
Table 2 and
Table 3, indicate that OMP and LS-OMP, with the impulse dictionary, provide the best performance for swell disturbance. A similar comparative study was carried out to reconstruct signals affected by other disturbances such as sag, harmonics, and transients using the same set of algorithms and dictionaries.
Figure 8,
Figure 9 and
Figure 10 illustrate the reconstruction results for sag disturbance, while
Table 4,
Table 5 and
Table 6 present the corresponding performance metrics in terms of MSE and A/R ratio. As in the case with swell disturbance, the best performance is exhibited by OMP and LS-OMP. The performance of Basis Pursuit, Thresholding and MP is comparatively inferior to LS-OMP and OMP. MP exhibits higher MSE and greater deviation from the actual signal, whereas Thresholding performs better than MP in terms of accuracy but remains less effective than Basis Pursuit and LS-OMP. Basis Pursuit exhibits good accuracy, even though inferior to LS-OMP and OMP, but the main disadvantage is its percentage sparsity. BP has the lowest sparsity (78%) as compared with all the techniques.
Figure 8,
Figure 9 and
Figure 10 and
Table 4,
Table 5 and
Table 6 further confirm that LS-OMP and OMP, when used with the impulse dictionary, provide the best reconstruction performance for sag disturbance. Basis Pursuit (BP) also yields good results, though with slightly lower accuracy and sparsity compared to LS-OMP and OMP.
The analysis was then extended to harmonic disturbances, as illustrated in
Figure 11,
Figure 12 and
Figure 13 and
Table 7,
Table 8 and
Table 9. For harmonics, although LS-OMP and OMP remain the most effective SSD techniques, their combination with the DCT dictionary produces better results compared to the impulse dictionary.
An analysis of the signal with transient disturbance was also conducted, as shown in
Figure 14,
Figure 15 and
Figure 16 and
Table 10,
Table 11 and
Table 12. The results are consistent with those observed for sag and swell disturbances, where LS-OMP and OMP, along with the impulse dictionary, provide the best accuracy with reasonably good sparsity.
From the analysis, it is found that the choice of dictionary has a significant role on the accuracy of sparse representation. The LS-OMP and OMP with impulse dictionary is found to be the best option for representing all disturbance signals except harmonics. DCT dictionary provided better accuracy for signals with harmonics. An analysis on time of computation of techniques were also done as shown in
Figure 17. All the techniques had similar time of computation, which was around 0.3 s, with LS-OMP having a slightly higher computation time.
The analysis presented in the previous section was carried out using synthetic data generated from mathematical models of power quality disturbances. To validate these results, power quality disturbance signals were also generated using a MATLAB/Simulink (R2023b) model, as shown in
Figure 18. The model, adopted from [
37], represents a standard power system configuration that produces a voltage sag disturbance when the transformer is switched on. The resulting voltage signal was exported and analyzed using different SSD techniques.
The results represented in
Figure 19 indicate that LS-OMP and OMP provide accurate reconstruction of the signal, with near-zero MSE and A/R ratio. The corresponding performance metrics are presented in
Table 13. Since the Simulink-generated signals exhibit accuracy and memory requirements comparable to those obtained with synthetic data, these results serve as a validation of the findings of this study.
The performance of sparse decomposition techniques in the analysis proved that all the power signals, even with disturbances, can be represented in sparse form with precision by suitably choosing the sparse decomposition technique, with the appropriate dictionary. This could contribute to developing a framework that will store signal data in the most precise and efficient way.
5. Conclusions
This paper examined different Sparse Signal Decomposition techniques to identify the most suitable method for representing power quality disturbance signals with high accuracy and reduced data size. The results show that for disturbances such as sag, swell, and transients, both OMP and LS-OMP perform well when used with an impulse dictionary. These combinations provide high reconstruction accuracy along with lower memory requirements due to better sparsity.
When computation time is also considered, OMP has a clear advantage over LS-OMP, making it the more efficient choice overall. Therefore, for achieving a good balance of accuracy, sparsity, and computation speed, OMP with an impulse dictionary is found to be the most effective approach for most disturbance types.
However, for harmonic signals, the results indicate that the DCT dictionary performs better than the impulse dictionary for greedy algorithms. The relaxation algorithm (Basis Pursuit) along with impulse dictionary provided better accuracy for representing signals with harmonics. This signifies the requirement for choosing the apt technique for representing the signal, depending on the type of disturbances.
The study highlights that both the choice of sparse recovery technique and the selection of dictionary is important for the optimized representation of the power quality disturbance signal. Choosing the right combination based on the type of disturbance can lead to efficient and accurate signal representation. This could aid in developing a framework that can store power signal data with maximum precision and minimum memory requirements. These data can then be sent to monitoring centres, so that they can take appropriate action effectively and easily, as the data they have to process will be less.