<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article article-type="research-article" dtd-version="2.3" xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Energy Res.</journal-id>
<journal-title>Frontiers in Energy Research</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Energy Res.</abbrev-journal-title>
<issn pub-type="epub">2296-598X</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">874351</article-id>
<article-id pub-id-type="doi">10.3389/fenrg.2022.874351</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Energy Research</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Power Quality Data Compression and Disturbances Recognition Based on Deep CS-BiLSTM Algorithm With Cloud-Edge Collaboration</article-title>
<alt-title alt-title-type="left-running-head">Xia et al.</alt-title>
<alt-title alt-title-type="right-running-head">Power Quality Compression and Recognition</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname>Xia</surname>
<given-names>Xin</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<xref ref-type="fn" rid="fn1">
<sup>&#x2020;</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1737953/overview"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>He</surname>
<given-names>Chuanliang</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<xref ref-type="fn" rid="fn1">
<sup>&#x2020;</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1737961/overview"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Lv</surname>
<given-names>Yingjie</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1737965/overview"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Zhang</surname>
<given-names>Bo</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1737959/overview"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Wang</surname>
<given-names>ShouZhi</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1737963/overview"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Chen</surname>
<given-names>Chen</given-names>
</name>
<xref ref-type="aff" rid="aff3">
<sup>3</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1737878/overview"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Chen</surname>
<given-names>Haipeng</given-names>
</name>
<xref ref-type="aff" rid="aff4">
<sup>4</sup>
</xref>
<xref ref-type="corresp" rid="c001">&#x2a;</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1097568/overview"/>
</contrib>
</contrib-group>
<aff id="aff1">
<sup>1</sup>
<institution>State Grid Laboratory of Power Line Communication Application Technology, Beijing Smart-Chip Microelectronics Technology Co., Ltd.</institution>, <addr-line>Beijing</addr-line>, <country>China</country>
</aff>
<aff id="aff2">
<sup>2</sup>
<institution>Beijing Electric Power Science and Smart Chip Technology Company Limited</institution>, <addr-line>Beijing</addr-line>, <country>China</country>
</aff>
<aff id="aff3">
<sup>3</sup>
<institution>College of Instrumentation and Electrical Engineering</institution>, <institution>Jilin University</institution>, <addr-line>Changchun</addr-line>, <country>China</country>
</aff>
<aff id="aff4">
<label>
<sup>4</sup>
</label>
<institution>Department of Electrical Engineering</institution>, <institution>Northeast Electric Power University</institution>, <addr-line>Jilin</addr-line>, <country>China</country>
</aff>
<author-notes>
<fn fn-type="edited-by">
<p>
<bold>Edited by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1375074/overview">Tinghui Ouyang</ext-link>, National Institute of Advanced Industrial Science and Technology (AIST), Japan</p>
</fn>
<fn fn-type="edited-by">
<p>
<bold>Reviewed by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1677812/overview">Jiang Li</ext-link>, Shanghai University of Electric Power, China</p>
<p>
<ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1681315/overview">Chunxu Qin</ext-link>, Inner Mongolia University of Technology, China</p>
</fn>
<corresp id="c001">&#x2a;Correspondence: Haipeng Chen, <email>haipeng0704@126.com</email>
</corresp>
<fn fn-type="equal" id="fn1">
<label>
<sup>&#x2020;</sup>
</label>
<p>These authors have contributed equally to this work and share first authorship</p>
</fn>
<fn fn-type="other">
<p>This article was submitted to Smart Grids, a section of the journal Frontiers in Energy Research</p>
</fn>
</author-notes>
<pub-date pub-type="epub">
<day>26</day>
<month>04</month>
<year>2022</year>
</pub-date>
<pub-date pub-type="collection">
<year>2022</year>
</pub-date>
<volume>10</volume>
<elocation-id>874351</elocation-id>
<history>
<date date-type="received">
<day>12</day>
<month>02</month>
<year>2022</year>
</date>
<date date-type="accepted">
<day>14</day>
<month>03</month>
<year>2022</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2022 Xia, He, Lv, Zhang, Wang, Chen and Chen.</copyright-statement>
<copyright-year>2022</copyright-year>
<copyright-holder>Xia, He, Lv, Zhang, Wang, Chen and Chen</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p>
</license>
</permissions>
<abstract>
<p>The current disturbance classification of power quality data often has the problem of low disturbance recognition accuracy due to its large volume and difficult feature extraction. This paper proposes a hybrid model based on distributed compressive sensing and a bi-directional long-short memory network to classify power quality disturbances. A cloud-edge collaborative framework is first established with distributed compressed sensing as an edge-computing algorithm. With the uploading of dictionary atoms of compressed sensing, the data transmission and feature extraction of power quality is achieved to compress power quality measurements. In terms of data transmission and feature extraction, the dictionary atoms and measurements uploaded at the edge are analyzed in the cloud by building a cloud-edge collaborative framework with distributed compressed sensing as the edge algorithm so as to achieve compressed storage of power quality data. For power disturbance identification, a new network structure is designed to improve the classification accuracy and reduce the training time, and the training parameters are optimized using the Deep Deterministic Policy Gradient algorithm in reinforcement learning to analyze the noise immunity of the model under different scenarios. Finally, the simulation analysis of 10 common power quality disturbance signals and 13 complex composite disturbance signals with random noise shows that the proposed method solves the problem of inadequate feature selection by traditional classification algorithms, improves the robustness of the model, and reduces the training time to a certain extent.</p>
</abstract>
<kwd-group>
<kwd>distributed compressed sensing</kwd>
<kwd>power quality disturbance classification</kwd>
<kwd>bidirectional long-short memory network</kwd>
<kwd>edge algorithm and cloud edge collaboration</kwd>
<kwd>parameter optimization</kwd>
<kwd>DDPG algorithm</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<title>1 Introduction</title>
<p>The emergence of new communication technologies has led to an increase in the size and complexity of the power quality data that must be processed by power companies when implementing information systems and intelligent interconnection technologies (<xref ref-type="bibr" rid="B8">Jin et al., 2019</xref>). Therefore, advanced technologies and algorithms are needed to provide support for the storage, transmission, and management of power quality data in the era of the energy Internet (<xref ref-type="bibr" rid="B5">Elphick et al., 2017a</xref>). However, the existing measuring instruments are difficult to identify the disturbance accurately, so the power system&#x2019;s relay protection and automatic devices may have false-action, which threatens the stable operation of the power system. Managing and storing massive power quality data, digging the intrinsic value contained in the power quality data, and utilizing the collected power quality data to analyze and identify the disturbances have become urgent problems to be solved (<xref ref-type="bibr" rid="B23">Yin et al., 2017</xref>). Efficient collection and evaluation of power quality data are significant to load prediction, operation status evaluation and early warning, power quality monitoring, and evaluation, effective operation of the power network, and distribution network planning (<xref ref-type="bibr" rid="B14">Negnevitsky et al., 2000</xref>; <xref ref-type="bibr" rid="B4">Chen, 2003</xref>).</p>
<p>When the sampling of power quality data still follows the Nyquist-Shannon sampling theorem (<xref ref-type="bibr" rid="B6">Elphick et al., 2017b</xref>), in conjunction with the acquisition-compression-storage-transmission-detection-identification process (<xref ref-type="bibr" rid="B18">Song et al., 2012</xref>), it will naturally result in a large amount of sampled data, and as the amount of data increases, the processing time for the data also increases, significantly increasing the cost of storage and transmission (<xref ref-type="bibr" rid="B16">Noland, 2016</xref>). The Fourier transform method for power quality data acquisition and analysis has advantages in the frequency domain analysis of signals but lacks the ability of time-domain analysis (<xref ref-type="bibr" rid="B17">Pei et al., 2006</xref>). The compression performance of the Fourier transform method is therefore not optimal. Power quality signal compression is proposed in reference (<xref ref-type="bibr" rid="B2">Bravo-Rodr&#xed;guez et al., 2020</xref>) based on the One-Class Support Vector Machine (OCSVM) and normalized distance measure, which has excellent compression performance and has a low compression ratio for different kinds of signals. In reference (<xref ref-type="bibr" rid="B1">Berutu and Chen, 2020</xref>), the method of multi-wavelet threshold transformation combined with lossless and lossy compression is adopted for power-quality data compression. Meanwhile, the Set Partitioning in Hierarchical Trees (SPIHT) lossy compression algorithm is used for the high-frequency wavelet coefficient matrix, and the LZ77 lossless compression algorithm is used for the low-frequency part of the wavelet coefficient matrix. However, wavelet transforms have a problem selecting a wavelet basis, and the algorithm is not particularly adaptable. The Compressed Sensing (CS) method (<xref ref-type="bibr" rid="B9">Li et al., 2020</xref>) can sample the signal with much fewer observations than the Nyquist sampling theorem and preserve the original characteristics as much as possible. However, the basic compressed sensing theory can only handle a single signal; it cannot exploit correlations between signals to optimize the reconstruction accuracy or speed of the compression model. To take advantage of the correlation between data and within data, the distributed compressed sensing (DCS) theory is proposed based on CS theory. DCS can be regarded as a theory that combines distributed source coding (DSC) and compressed sensing (<xref ref-type="bibr" rid="B17">Pei et al., 2006</xref>). This theory compresses different signals separately but performs joint reconstruction. When the same parts of different signals account for a large proportion, DCS can significantly reduce the number of observations, so the complexity of recovering signals on the decoding side is significantly reduced. This feature is essential for distributed applications with low complexity requirements at the decoder. DCS theory has been widely used in the fields of audio and video processing, image fusion, and multi-transmitter multi-receiver channel estimation (<xref ref-type="bibr" rid="B21">von Gladi&#xdf; et al., 2015</xref>), laying a good research foundation for its application in the field of electrical engineering data processing.</p>
<p>The power quality disturbance classification method extracts feature of power quality signal as the input of a recognizer through digital signal processing methods and machine learning algorithms (<xref ref-type="bibr" rid="B7">Gibbon et al., 2009</xref>). Currently, the recognition methods mainly include: neural network (<xref ref-type="bibr" rid="B3">Cai et al., 2019</xref>), support vector machine (<xref ref-type="bibr" rid="B19">Tang et al., 2020</xref>), decision tree (<xref ref-type="bibr" rid="B25">Zhao et al., 2019</xref>) etc. (<xref ref-type="bibr" rid="B22">Xin et al., 2020</xref>) converts the input of Power Quality Disturbances (PQDs) data into a two-dimensional matrix which is similar to image data, and then uses a two-dimensional Convolutional Neural Network (CNN) to identify the type of PQDs. However, PQDs data is a one-dimensional time series, and two-dimensional CNN is made for image recognition. Therefore, it is not completely appropriate for PQDs. In (<xref ref-type="bibr" rid="B11">Lu et al., 2020</xref>), several common CNNs and RNNs are examined in the context of PQDs classification, but the training time, parameter numbers, model size, and anti-noise ability of these CNNs are not considered. PQDs classification by deep learning neural network is prone to long network training time and limited classification accuracy for a large amount of power quality data (<xref ref-type="bibr" rid="B20">U&#xe7;kun et al., 2020</xref>). The combination of neural networks and compressed sensing significantly minimizes the amount of processed data, effectively shortens the recognition time, achieves or even exceeds the original recognition accuracy, and reduces hardware performance requirements.</p>
<p>The combination of traditional methods utilizing digital signal processing to extract features and machine learning as classifiers to achieve disturbance classification becomes unsuitable for generalization; For another thing, the rise of deep learning methods provides new ideas for power quality disturbance identification by directly utilizing raw data to extract and classify disturbance signal features. Deep learning methods combine feature extraction and classification into a single model, which compensates for traditional methods&#x2019; relatively independent feature extraction and classification. As a result, the application of deep learning methods to detect disturbances will gradually become a research focus for academics. Deep learning methods automatically extract features from the original signal, and traditional Nyquist sampling used to obtain electrical energy signal data is too large, putting excessive strain on transmission and storage, obtaining the signal via CS theory and combining it with deep learning methods to achieve disturbance classification is critical for practical applications.</p>
<p>Meanwhile, the power system put forward new requirements for the classification of disturbances that affect the power quality of the distribution network. The classification of PQDs needs higher timeliness and accuracy. These conditions serve as a scenario-based basis for applying the PQD classification method proposed in this article.</p>
<p>As a consequence of the advent of new scenarios, the traditional disturbance recognition method employing digital signal processing to extract features and machine learning to recognize disturbances has shown its limitations (<xref ref-type="bibr" rid="B24">Zhang et al., 2021</xref>; <xref ref-type="bibr" rid="B10">Li et al., 2022</xref>). Emerging artificial intelligence methods such as deep learning offer a new direction for PQD classification. Deep learning methods based on compressed sensing theory can ensure the safe operation of the system and quickly and accurately classify PQDs. This is an important step in solving power quality problems. Through the gradual development of communication technology, the proposed combination of compressed sensing and deep learning can also serve as technical support for edge computing in cloud edge collaborations. The research on PQD classification based on compressed sensing and deep learning, therefore, has both theoretical and practical significance.</p>
<p>The main contributions of this paper are as follows: 1) a distributed compression storage method of power quality is proposed, which can be used for cloud edge collaboration, and the design of its dictionary matrix. 2) a combined method of compressed sensing and deep learning for power quality data disturbance recognition is proposed, which reduces the model&#x2019;s training speed and improves the accuracy of PQD recognition. 3) The Deep Deterministic Policy Gradient (DDPG) is employed to optimize the neural network parameters so that the constructed neural network can maintain good convergence ability in different scenarios. 4) The proposed method is aimed at a forward-looking new power system with a high proportion of renewable energy.</p>
</sec>
<sec id="s2">
<title>2 Distributed Compressed Sensing</title>
<sec id="s2-1">
<title>2.1 Distributed Compressed Sensing Theory</title>
<p>DCS is developed to deal with the set of related signals. The model can take into account the internal correlations among power quality signals as well as the correlations between signals. When the signal aggregation is highly correlated, joint sparse and joint reconstruction can be performed.</p>
<p>Assuming that there are <inline-formula id="inf1">
<mml:math id="m1">
<mml:mi>j</mml:mi>
</mml:math>
</inline-formula> signals, <inline-formula id="inf2">
<mml:math id="m2">
<mml:mi>x</mml:mi>
</mml:math>
</inline-formula> represents the joint signal composed of multiple target signals <inline-formula id="inf3">
<mml:math id="m3">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mi>R</mml:mi>
<mml:mi>N</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>, and <inline-formula id="inf4">
<mml:math id="m4">
<mml:mi>y</mml:mi>
</mml:math>
</inline-formula> represents the joint signal composed of the observed values <inline-formula id="inf5">
<mml:math id="m5">
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mi>R</mml:mi>
<mml:mi>M</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> corresponding to each target signal, the joint signal can be expressed as follows:<disp-formula id="e1">
<mml:math id="m6">
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>&#x22ef;</mml:mo>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mi>T</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
<label>(1)</label>
</disp-formula>
<disp-formula id="e2">
<mml:math id="m7">
<mml:mrow>
<mml:mi>y</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>&#x22ef;</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mi>T</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
<label>(2)</label>
</disp-formula>
<disp-formula id="e3">
<mml:math id="m8">
<mml:mrow>
<mml:mi mathvariant="normal">&#x3a6;</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mtext>&#x3a6;</mml:mtext>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:mn>0</mml:mn>
</mml:mtd>
<mml:mtd>
<mml:mo>&#x22ef;</mml:mo>
</mml:mtd>
<mml:mtd>
<mml:mn>0</mml:mn>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mn>0</mml:mn>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mtext>&#x3a6;</mml:mtext>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:mo>&#x22ef;</mml:mo>
</mml:mtd>
<mml:mtd>
<mml:mn>0</mml:mn>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mo>&#x22ee;</mml:mo>
</mml:mtd>
<mml:mtd>
<mml:mo>&#x22ee;</mml:mo>
</mml:mtd>
<mml:mtd>
<mml:mo>&#x22f1;</mml:mo>
</mml:mtd>
<mml:mtd>
<mml:mo>&#x22ee;</mml:mo>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mn>0</mml:mn>
</mml:mtd>
<mml:mtd>
<mml:mn>0</mml:mn>
</mml:mtd>
<mml:mtd>
<mml:mo>&#x22ef;</mml:mo>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mtext>&#x3a6;</mml:mtext>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(3)</label>
</disp-formula>
</p>
<p>Then <inline-formula id="inf6">
<mml:math id="m9">
<mml:mi>y</mml:mi>
</mml:math>
</inline-formula> can be expressed as:<disp-formula id="e4">
<mml:math id="m10">
<mml:mrow>
<mml:mi>y</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mtext>&#x3a6;</mml:mtext>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:math>
<label>(4)</label>
</disp-formula>
</p>
<p>Due to the fact that compressed sensing is the foundation of DCS, the premise of both two methods is that the signals must be sparse. Although many power quality signals do not have sparsity, the sparsity of these signals can be reflected in a certain sparse base. Assuming that <inline-formula id="inf7">
<mml:math id="m11">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c8;</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is a sparse matrix and <inline-formula id="inf8">
<mml:math id="m12">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is a sparse coefficient vector, <inline-formula id="inf9">
<mml:math id="m13">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>&#x3c8;</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> the signal acquisition model of DCS is as follow:<disp-formula id="e5">
<mml:math id="m14">
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mtext>&#x3a6;</mml:mtext>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:msub>
<mml:mi>&#x3c8;</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
<label>(5)</label>
</disp-formula>
</p>
</sec>
<sec id="s2-2">
<title>2.2 Construction Steps of Learning Dictionary for Distributed Compressed Sensing</title>
<p>DCS of power quality data relies heavily on sparse representation of the signal, and the key factor is the design of an efficient and simple sparse matrix. The continuous updating and optimization of dictionary learning methods is the main reason for the superior performance of sparse representation in compressive reconstruction and type recognition. The sparse decomposition and construction steps of the learning dictionary of distributed compressed sensing are shown in <xref ref-type="fig" rid="F1">Figure 1</xref>.<list list-type="simple">
<list-item>
<p>1) The model of power quality signals&#x2019; training sample set <inline-formula id="inf10">
<mml:math id="m15">
<mml:mrow>
<mml:mi>E</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mi>R</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mi>M</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf11">
<mml:math id="m16">
<mml:mrow>
<mml:mi>G</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mi>R</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mi>M</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> are established, where <inline-formula id="inf12">
<mml:math id="m17">
<mml:mi>E</mml:mi>
</mml:math>
</inline-formula> means the public sample set, <inline-formula id="inf13">
<mml:math id="m18">
<mml:mi>G</mml:mi>
</mml:math>
</inline-formula> means the feature sample set, <inline-formula id="inf14">
<mml:math id="m19">
<mml:mi>W</mml:mi>
</mml:math>
</inline-formula> stands for the number of training samples and <inline-formula id="inf15">
<mml:math id="m20">
<mml:mi>M</mml:mi>
</mml:math>
</inline-formula> denotes the number of sampling points for training sample. The training sample is expressed as follows:</p>
</list-item>
</list>
<disp-formula id="e6">
<mml:math id="m21">
<mml:mrow>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x22ef;</mml:mo>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mi>R</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mi>M</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
<label>(6)</label>
</disp-formula>
<disp-formula id="e7">
<mml:math id="m22">
<mml:mrow>
<mml:msub>
<mml:mi>G</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>g</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>g</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mn>...</mml:mn>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>g</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mi>R</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mi>M</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
<label>(7)</label>
</disp-formula>Where <inline-formula id="inf16">
<mml:math id="m23">
<mml:mrow>
<mml:msub>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mi>R</mml:mi>
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> represents class <inline-formula id="inf17">
<mml:math id="m24">
<mml:mi>i</mml:mi>
</mml:math>
</inline-formula>, <inline-formula id="inf18">
<mml:math id="m25">
<mml:mi>j</mml:mi>
</mml:math>
</inline-formula> training samples in a common sample set, <inline-formula id="inf19">
<mml:math id="m26">
<mml:mrow>
<mml:msub>
<mml:mi>g</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mi>R</mml:mi>
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> represents class <inline-formula id="inf20">
<mml:math id="m27">
<mml:mi>i</mml:mi>
</mml:math>
</inline-formula>, <inline-formula id="inf21">
<mml:math id="m28">
<mml:mi>j</mml:mi>
</mml:math>
</inline-formula> training samples in feature sample sets, <inline-formula id="inf22">
<mml:math id="m29">
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1,2</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>...</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1,2</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>...</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>n</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>M</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> represents the sample dimension, <inline-formula id="inf23">
<mml:math id="m30">
<mml:mi>R</mml:mi>
</mml:math>
</inline-formula> represents the set of real numbers.<list list-type="simple">
<list-item>
<p>2) Initialize the public and the feature dictionaries, respectively. For example, in feature dictionary, <inline-formula id="inf24">
<mml:math id="m31">
<mml:mi>Q</mml:mi>
</mml:math>
</inline-formula> training samples of the feature sample set <inline-formula id="inf25">
<mml:math id="m32">
<mml:mi>G</mml:mi>
</mml:math>
</inline-formula> is randomly selected to initialize the dictionary <inline-formula id="inf26">
<mml:math id="m33">
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mi>R</mml:mi>
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>Q</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>, then two&#x2014;norm normalization is executed for each column of <inline-formula id="inf27">
<mml:math id="m34">
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>: <inline-formula id="inf28">
<mml:math id="m35">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mrow>
<mml:mo>&#x2016;</mml:mo>
<mml:mrow>
<mml:msubsup>
<mml:mi>D</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mn>0</mml:mn>
</mml:mrow>
<mml:mi>j</mml:mi>
</mml:msubsup>
</mml:mrow>
<mml:mo>&#x2016;</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, among <inline-formula id="inf29">
<mml:math id="m36">
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1,2</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>...</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>Q</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>, the objective function of dictionary initialization is:</p>
</list-item>
</list>
<disp-formula id="e8">
<mml:math id="m37">
<mml:mrow>
<mml:msub>
<mml:mi>J</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>arg</mml:mi>
<mml:munder>
<mml:mrow>
<mml:mi>min</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mrow>
<mml:mo>&#x2016;</mml:mo>
<mml:mrow>
<mml:mi>G</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo>&#x2016;</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mn>2</mml:mn>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>&#x3bb;</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mrow>
<mml:mo>&#x2016;</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo>&#x2016;</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
</mml:munder>
</mml:mrow>
</mml:math>
<label>(8)</label>
</disp-formula>
<disp-formula id="e9">
<mml:math id="m38">
<mml:mrow>
<mml:msubsup>
<mml:mi>G</mml:mi>
<mml:mn>0</mml:mn>
<mml:mrow>
<mml:msup>
<mml:mi>j</mml:mi>
<mml:mi>L</mml:mi>
</mml:msup>
</mml:mrow>
</mml:msubsup>
<mml:msubsup>
<mml:mi>G</mml:mi>
<mml:mn>0</mml:mn>
<mml:mi>j</mml:mi>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
<label>(9)</label>
</disp-formula>Where <inline-formula id="inf30">
<mml:math id="m39">
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the sparse representation matrix found by optimizing the objective function on the initial feature dictionary <inline-formula id="inf31">
<mml:math id="m40">
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> in the sample set <inline-formula id="inf32">
<mml:math id="m41">
<mml:mi>G</mml:mi>
</mml:math>
</inline-formula>, and <inline-formula id="inf33">
<mml:math id="m42">
<mml:mi>&#x3bb;</mml:mi>
</mml:math>
</inline-formula> is the regularization parameter to balance the reconstruction error and the sparsity of the sparse matrix; the iterations&#x2019; initial value is set to <inline-formula id="inf34">
<mml:math id="m43">
<mml:mrow>
<mml:mi>L</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>. In terms of the basic atomic characteristics of the initialized dictionary and the experimental simulation, the total iteration number <inline-formula id="inf35">
<mml:math id="m44">
<mml:mi>m</mml:mi>
</mml:math>
</inline-formula> and the tolerance of error <inline-formula id="inf36">
<mml:math id="m45">
<mml:mrow>
<mml:msub>
<mml:mi>J</mml:mi>
<mml:mi>s</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> are selected.<list list-type="simple">
<list-item>
<p>3) Finally, the KSVD algorithm is employed to optimize the objective function. It firstly holds the feature dictionary <inline-formula id="inf37">
<mml:math id="m46">
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> constant after the <inline-formula id="inf38">
<mml:math id="m47">
<mml:mi>i</mml:mi>
</mml:math>
</inline-formula>
<sup>th</sup> iteration:</p>
</list-item>
</list>
<disp-formula id="e10">
<mml:math id="m48">
<mml:mrow>
<mml:msub>
<mml:mi>J</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>arg</mml:mi>
<mml:munder>
<mml:mrow>
<mml:mi>min</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:munder>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mrow>
<mml:mo>&#x2016;</mml:mo>
<mml:mrow>
<mml:mi>G</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>&#x2016;</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mn>2</mml:mn>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>&#x3bb;</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mrow>
<mml:mo>&#x2016;</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>&#x2016;</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(10)</label>
</disp-formula>
</p>
<fig id="F1" position="float">
<label>FIGURE 1</label>
<caption>
<p>Sparse decomposition.</p>
</caption>
<graphic xlink:href="fenrg-10-874351-g001.tif"/>
</fig>
<p>Then, hold the sparse representation matrix <inline-formula id="inf39">
<mml:math id="m49">
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> constant after the last iteration and optimize the base atom in the feature dictionary <inline-formula id="inf40">
<mml:math id="m50">
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> separately. And the objective function can still be simplified. The update can be made as follows:<disp-formula id="e11">
<mml:math id="m51">
<mml:mrow>
<mml:msub>
<mml:mi>J</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>arg</mml:mi>
<mml:munder>
<mml:mrow>
<mml:mi>min</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:munder>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mrow>
<mml:mo>&#x2016;</mml:mo>
<mml:mrow>
<mml:mi>G</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:msubsup>
<mml:mi>G</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:msubsup>
<mml:msubsup>
<mml:mi>T</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:msup>
<mml:mi>j</mml:mi>
<mml:mi>L</mml:mi>
</mml:msup>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mstyle>
</mml:mrow>
<mml:mo>&#x2016;</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mn>2</mml:mn>
<mml:mn>2</mml:mn>
</mml:msubsup>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mrow>
<mml:mo>&#x2016;</mml:mo>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>G</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mstyle displaystyle="true">
<mml:munder>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x2260;</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:munder>
<mml:mrow>
<mml:msubsup>
<mml:mi>G</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:msubsup>
<mml:msubsup>
<mml:mi>T</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:msup>
<mml:mi>j</mml:mi>
<mml:mi>L</mml:mi>
</mml:msup>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mstyle>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:msubsup>
<mml:mi>D</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:msubsup>
<mml:msubsup>
<mml:mi>T</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:msup>
<mml:mi>k</mml:mi>
<mml:mi>L</mml:mi>
</mml:msup>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
<mml:mo>&#x2016;</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mn>2</mml:mn>
<mml:mn>2</mml:mn>
</mml:msubsup>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mrow>
<mml:mo>&#x2016;</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>G</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msubsup>
<mml:mi>G</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>k</mml:mi>
</mml:msubsup>
<mml:msubsup>
<mml:mi>T</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:msup>
<mml:mi>k</mml:mi>
<mml:mi>L</mml:mi>
</mml:msup>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
<mml:mo>&#x2016;</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mn>2</mml:mn>
<mml:mn>2</mml:mn>
</mml:msubsup>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(11)</label>
</disp-formula>Where <inline-formula id="inf41">
<mml:math id="m52">
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1,2</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>...</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>N</mml:mi>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> <inline-formula id="inf42">
<mml:math id="m53">
<mml:mrow>
<mml:msub>
<mml:mi>G</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> are real error items, the SVD algorithm is used to decompose <inline-formula id="inf43">
<mml:math id="m54">
<mml:mrow>
<mml:msub>
<mml:mi>G</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, and the base atom <inline-formula id="inf44">
<mml:math id="m55">
<mml:mrow>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> that needs to be updated is the feature vector corresponding to the maximum eigenvalue, which can be computed by the least-square method. Then, the optimal feature dictionary <inline-formula id="inf45">
<mml:math id="m56">
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is obtained, and the public dictionary <inline-formula id="inf46">
<mml:math id="m57">
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>g</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is attained by the same method. The DCS learning dictionary <inline-formula id="inf47">
<mml:math id="m58">
<mml:mi>D</mml:mi>
</mml:math>
</inline-formula> is obtained by cascading <inline-formula id="inf48">
<mml:math id="m59">
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>g</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf49">
<mml:math id="m60">
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> together. Therefore, the DCS learning dictionary can be expressed as follow:<disp-formula id="e12">
<mml:math id="m61">
<mml:mrow>
<mml:mi>D</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>g</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:mn>0</mml:mn>
</mml:mtd>
<mml:mtd>
<mml:mo>&#x22ef;</mml:mo>
</mml:mtd>
<mml:mtd>
<mml:mn>0</mml:mn>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>g</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:mn>0</mml:mn>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:mo>&#x22ef;</mml:mo>
</mml:mtd>
<mml:mtd>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mo>&#x22ef;</mml:mo>
</mml:mtd>
<mml:mtd>
<mml:mo>&#x22ef;</mml:mo>
</mml:mtd>
<mml:mtd>
<mml:mo>&#x22ef;</mml:mo>
</mml:mtd>
<mml:mtd>
<mml:mo>&#x22ef;</mml:mo>
</mml:mtd>
<mml:mtd>
<mml:mn>0</mml:mn>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>g</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:mn>0</mml:mn>
</mml:mtd>
<mml:mtd>
<mml:mo>&#x22ef;</mml:mo>
</mml:mtd>
<mml:mtd>
<mml:mn>0</mml:mn>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(12)</label>
</disp-formula>
</p>
</sec>
<sec id="s2-3">
<title>2.3 Data Storage Based on Cloud Edge Collaboration</title>
<p>Under the cloud-edge collaborative architecture (<xref ref-type="bibr" rid="B15">Ning et al., 2021</xref>), the DCS-OMP edge algorithm is used to compress and collect the power quality data of <italic>s</italic> nodes in a distribution system at the same time, the power quality data of each node in the distribution system share the same dictionary atoms, set the data length of each node as n and the number of uploaded dictionary atoms as &#x3c4;, the corresponding formula is as follow:<disp-formula id="e13">
<mml:math id="m62">
<mml:mrow>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">Y</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>s</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mtext>&#x2003;</mml:mtext>
<mml:msub>
<mml:mi mathvariant="bold-italic">D</mml:mi>
<mml:mrow>
<mml:mi>&#x3c4;</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mi>C</mml:mi>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mo>&#x2212;</mml:mo>
</mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>O</mml:mi>
<mml:mi>M</mml:mi>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>s</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi mathvariant="bold">&#x3a8;</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mtext mathvariant="bold">&#x3a6;</mml:mtext>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>&#x3c4;</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>S</mml:mi>
<mml:mi>N</mml:mi>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mrow>
<mml:mtext>d</mml:mtext>
<mml:mtext>e</mml:mtext>
<mml:mtext>f</mml:mtext>
<mml:mo>?</mml:mo>
<mml:mo>&#xa0;</mml:mo>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(13)</label>
</disp-formula>
<inline-formula id="inf50">
<mml:math id="m63">
<mml:mrow>
<mml:msub>
<mml:mi>Y</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>s</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the measured value of each node; <inline-formula id="inf51">
<mml:math id="m64">
<mml:mrow>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>s</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the original signal of each node, <inline-formula id="inf52">
<mml:math id="m65">
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mrow>
<mml:mi>&#x3c4;</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the uploaded dictionary atoms to the cloud. By reducing the length <italic>m</italic> of the measurement matrix and the number &#x3c4; of the uploaded cloud dictionary atoms, the memory capacity of the measured values uploaded to the cloud, and the dictionary atoms can be reduced. In addition, in order to ensure that cloud data can be called accurately and quickly, the cloud integrates the dictionary atoms uploaded by each edge to generate a complete dictionary <inline-formula id="inf53">
<mml:math id="m66">
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, where <italic>k</italic> is the total number of atoms in the complete dictionary. When calling data in this partition, the sparse representation coefficient corresponding to the partition data is calculated by the <xref ref-type="disp-formula" rid="e13">Eq. 13</xref>.<disp-formula id="e14">
<mml:math id="m67">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">&#x3b8;</mml:mi>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>s</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>S</mml:mi>
<mml:mi>O</mml:mi>
<mml:mi>M</mml:mi>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">Y</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>s</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi mathvariant="bold-italic">D</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mtext mathvariant="bold">&#x3a8;</mml:mtext>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(14)</label>
</disp-formula>
</p>
<p>Then the original signal <inline-formula id="inf54">
<mml:math id="m68">
<mml:mrow>
<mml:msub>
<mml:msup>
<mml:mi>X</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>s</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> of the partition is recovered through <xref ref-type="disp-formula" rid="e13">Eq. 13</xref> as follow:<disp-formula id="e15">
<mml:math id="m69">
<mml:mrow>
<mml:msub>
<mml:msup>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>s</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>l</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mtext mathvariant="bold">&#x3a6;</mml:mtext>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mi mathvariant="bold-italic">&#x3b8;</mml:mi>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>s</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(15)</label>
</disp-formula>
</p>
<p>By establishing a complete dictionary in the cloud center, each edge only needs to upload the measurement values to realize compression storage of power quality data, which reduces the storage space of cloud data. The steps for constructing a complete dictionary are as follows:<list list-type="simple">
<list-item>
<p>1) Calculate the correlation <inline-formula id="inf55">
<mml:math id="m70">
<mml:mrow>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> between the newly uploaded dictionary atom <bold>
<italic>d</italic>
</bold>
<italic>i</italic> of the edge node and the <italic>k</italic>th atom <italic>D</italic>
<sub>
<italic>k</italic>
</sub> in the initial sparse dictionary <inline-formula id="inf56">
<mml:math id="m71">
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> in the cloud. The formula is as follow:</p>
</list-item>
</list>
<disp-formula id="e16">
<mml:math id="m72">
<mml:mrow>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>cov</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">d</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:msqrt>
<mml:mrow>
<mml:mi>var</mml:mi>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">d</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
<mml:mi>var</mml:mi>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msqrt>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
<label>(16)</label>
</disp-formula>
</p>
<p>Suppose the value of each generated is lower than a certain threshold. In that case, the overall correlation between the dictionary atom <bold>
<italic>d</italic>
</bold>
<italic>i</italic> uploaded to the cloud and the cloud dictionary <inline-formula id="inf57">
<mml:math id="m73">
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is relatively weak. Therefore, the dictionary atom is added to the sparse cloud dictionary.<list list-type="simple">
<list-item>
<p>2) Combine the dictionary atoms uploaded in each partition into an over-complete sparse dictionary, and regularization is performed to reduce the correlation between the dictionary atoms.</p>
</list-item>
</list>
<disp-formula id="e17">
<mml:math id="m74">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">D</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">d</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi mathvariant="bold-italic">d</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x22ef;</mml:mo>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi mathvariant="bold-italic">d</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>}</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(17)</label>
</disp-formula>
<disp-formula id="e18">
<mml:math id="m75">
<mml:mrow>
<mml:msub>
<mml:msup>
<mml:mi mathvariant="bold-italic">d</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
<mml:mi mathvariant="bold-italic">k</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi mathvariant="bold-italic">d</mml:mi>
<mml:mi mathvariant="bold-italic">k</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">d</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:msup>
<mml:mi mathvariant="bold-italic">d</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:msup>
<mml:mi mathvariant="bold-italic">d</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:msup>
<mml:mi mathvariant="bold-italic">d</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
</mml:mfrac>
<mml:msub>
<mml:msup>
<mml:mi mathvariant="bold-italic">d</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">d</mml:mi>
<mml:mi mathvariant="bold-italic">k</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:msup>
<mml:mi mathvariant="bold-italic">d</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:msup>
<mml:mi mathvariant="bold-italic">d</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:msup>
<mml:mi mathvariant="bold-italic">d</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:mrow>
</mml:mfrac>
<mml:msub>
<mml:msup>
<mml:mi mathvariant="bold-italic">d</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mo>&#x22ef;</mml:mo>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">d</mml:mi>
<mml:mi mathvariant="bold-italic">k</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:msup>
<mml:mi mathvariant="bold-italic">d</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
<mml:mrow>
<mml:mi mathvariant="bold-italic">k</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:msup>
<mml:mi mathvariant="bold-italic">d</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
<mml:mrow>
<mml:mi mathvariant="bold-italic">k</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:msup>
<mml:mi mathvariant="bold-italic">d</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
<mml:mrow>
<mml:mi mathvariant="bold-italic">k</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
<mml:msub>
<mml:msup>
<mml:mi mathvariant="bold-italic">d</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
<mml:mrow>
<mml:mi mathvariant="bold-italic">k</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
<label>(18)</label>
</disp-formula>
<list list-type="simple">
<list-item>
<p>3) Normalizes the over-complete dictionaries to update dictionary atoms.</p>
</list-item>
</list>
<disp-formula id="e19">
<mml:math id="m76">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">d</mml:mi>
<mml:mi mathvariant="bold-italic">k</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:msup>
<mml:mi mathvariant="bold-italic">d</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
<mml:mi mathvariant="bold-italic">k</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:msup>
<mml:mi mathvariant="bold-italic">d</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
<mml:mi mathvariant="bold-italic">k</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
<label>(19)</label>
</disp-formula>
<list list-type="simple">
<list-item>
<p>4) Combined with the over-complete sparse dictionary, recover the original data from the measured values uploaded by the DCS algorithm to verify the recoverability of the stored data and the corresponding sparse coefficient <bold>
<italic>&#x3b8;</italic>
</bold>
<sub>
<italic>j</italic>
</sub>, <italic>j</italic>&#x2208;[1,<italic>s</italic>] of each node is obtained. Finally, the compressed storage of power quality data of each node is realized.</p>
</list-item>
</list>
</p>
<p>Cloud computing is a type of technology that enables the analysis of large amounts of data (<xref ref-type="bibr" rid="B12">Luo, 2022</xref>). It is not required to maintain computing hardware, data storage, or associated software on-premises. However, because of the physical separation between the cloud platform and each terminal, response times are frequently slow.</p>
<p>Edge computing is introduced as a novel technique for augmenting cloud computing systems (<xref ref-type="bibr" rid="B13">Ma et al., 2021</xref>). Because the edge is located close to the terminal equipment, it can reduce not only the network delay associated with data processing, but also the bandwidth required to transfer the original data to the storage center. As a result of the cloud platform and edge platform collaborating, the system&#x2019;s performance will be significantly improved.</p>
<p>In this paper, based on the cloud-edge collaboration framework shown in <xref ref-type="fig" rid="F2">Figure 2</xref>, the edge acquisition algorithm based on DCS-SOMP algorithm is compiled on the MATLAB simulation platform to collect the power quality data generated in PSCAD, and the sparse dictionary atoms and measured values generated in the reconstruction process are uploaded to the cloud server by establishing a connection with the remote cloud. There are three main operations in the cloud: 1) compressed storage of power quality data of distribution network; 2) Construction of complete sparse dictionary; 3) Analysis and calculation of power quality data. The cloud server sends the result of dynamic partition to the edge in time. The edge algorithm obtains the new partition information, adjusts the computing resources, and collects the power quality contained in the new partition, and uploads it to the cloud server again. So as to realize the mutual cooperation between &#x201c;cloud&#x201d; and &#x201c;edge&#x201d;.</p>
<fig id="F2" position="float">
<label>FIGURE 2</label>
<caption>
<p>Cloud-edge collaboration framework.</p>
</caption>
<graphic xlink:href="fenrg-10-874351-g002.tif"/>
</fig>
</sec>
</sec>
<sec id="s3">
<title>3 Power Quality Data Classification</title>
<sec id="s3-1">
<title>3.1 Classification of Power Quality Disturbance Signals</title>
<p>The PQD classification model first extracts the characteristics of the disturbance signals and then designs a classifier to recognize different disturbances. According to the different characteristics of amplitude, frequency, and phase of the disturbance signal, the single disturbance is defined as voltage sag, voltage swell, short interruption, harmonic, transient oscillation, pulse, and flicker. The three disturbances of voltage sag, voltage swell, and short interruption are short-term root mean square fluctuations. And the harmonic, transient oscillation, pulse, and flicker are long-term root mean square fluctuation or high-frequency impact disturbance. In addition to the above single disturbance, disturbance usually occurs simultaneously in the actual situation, which is called composite disturbance. The composite disturbance is compounded by two or more single disturbances, which is difficult to analyze. Referring to the IEEE standard and previous literature, six types of single disturbances and four types of composite disturbances are analyzed in this paper.</p>
</sec>
<sec id="s3-2">
<title>3.2 Basic Principle of Power Disturbance Classification Based on CS-DL</title>
<sec id="s3-2-1">
<title>3.2.1 The Framework of CS-DL Network</title>
<p>A Deep Neural Network (DNN) is the basis of deep learning, which is a multi-layer expression algorithm for learning the implicit distribution of data. Specifically, DNN first employs unsupervised learning to pre-train each layer to learn the characteristics of layers. Training one layer at a time, using the results as the input to the next layer, and then using supervised learning to fine-tune the model from top to bottom. The feature learning process is illustrated in <xref ref-type="fig" rid="F3">Figure 3</xref>.</p>
<fig id="F3" position="float">
<label>FIGURE 3</label>
<caption>
<p>Structure of CS-DL network.</p>
</caption>
<graphic xlink:href="fenrg-10-874351-g003.tif"/>
</fig>
<p>The feature of the constructed CNN is the feature extractor composed of the convolution layer and the sub-sampling layer. The CS-DL network uses a local connection, which only connects one neuron with a few peripheral neurons. The convolution layer of CNN contains multiple differentiated feature planes, each of which consists of some rectangularly arranged neurons, and the neurons on the same feature plane share weight with each other. CNN sub-sampling is a special convolution process and reduces the number of model parameters. In summary, CNN uses the convolution layer and sub-sampling layer, as well as the corresponding local connection and weight sharing rules to enhance feature extraction&#x2019;s self-learning and characterization capacity and finally realizes the classification of direct power quality signal inputs.</p>
</sec>
<sec id="s3-2-2">
<title>3.2.2 Structures of CNN-BiLSTM and CS-BiLSTM Networks</title>
<p>PQD signal is a typical time-series signal, but CNN does not consider the timing characteristics of the signals in the process of feature extraction. Meanwhile, the bidirectional long short-term memory (BiLSTM) model is a kind of Recurrent Neural Network (RNN) suitable for time-series signal analysis. Therefore, a mixed CNN-BiLSTM model based on the classification of PQD signals by the CNN model is proposed. Firstly, features of disturbing signals are extracted automatically by CNN. Then, the features are further processed by BiLSTM. The proposed CNN-BiLSTM model enhances the feature extraction ability of the model, speeds up the convergence rate of training, further improves the accuracy of disturbance classification, and has high noise immunity. In order to deal with the time-consuming defect and classification problem of composite disturbance, an improved CS-BiLSTM is proposed, which utilizes the CS method to transmit signal characteristics quickly, accurately, and effectively so as to improve the efficiency and timeliness of the PQD classification process.</p>
<p>The Structures of CS-BiLSTM Networks are illustrated in <xref ref-type="fig" rid="F4">Figure 4</xref>.</p>
<fig id="F4" position="float">
<label>FIGURE 4</label>
<caption>
<p>Structure of CS-BiLSTM.</p>
</caption>
<graphic xlink:href="fenrg-10-874351-g004.tif"/>
</fig>
</sec>
</sec>
<sec id="s3-3">
<title>3.3 Parameter Optimization Based on DDPG</title>
<sec id="s3-3-1">
<title>3.3.1 Concept of Reinforcement Learning</title>
<p>Reinforcement learning achieves global optimization of the objective function through the feedback of the reward function. The main parts of the DDPG reinforcement learning algorithm are as follows:</p>
<p>Agent: The agent that needs to be controlled, corresponding to the parameter optimizer in this paper.</p>
<p>State s: The agent&#x2019;s current state, corresponding to the current value of the key parameters such as learning rate, minibatch number, etc.</p>
<p>Action a: The actions that the agent can take, corresponding to the variation of the parameters.</p>
<p>Reward r: The feedback value of the environment, and the evaluation value of the previous action, corresponding to the accuracy in this paper.</p>
<p>
<inline-formula id="inf58">
<mml:math id="m77">
<mml:mi>&#x3c0;</mml:mi>
</mml:math>
</inline-formula> The agent&#x2019;s action to move from the current state to the next state.</p>
<p>Value: The reward value of the agent&#x2019;s long-term actions, as distinguished from the short-term reward represented by Reward r.</p>
<p>Environment: The environment in which the agent is placed.</p>
</sec>
<sec id="s3-3-2">
<title>3.3.2 Concept of Deterministic Policy Gradient</title>
<p>Deterministic Policy Gradient (DPG) is an improved algorithm based on AC (Action and Critic) structure. It utilizes the PG (Policy Gradient)&#x2019;s advantage in continuous space and changes the randomized strategy to a deterministic strategy. The corresponding formula is shown in (20):<disp-formula id="e20">
<mml:math id="m78">
<mml:mrow>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x223c;</mml:mo>
<mml:msub>
<mml:mi>&#x3c0;</mml:mi>
<mml:mi>&#x3b8;</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>&#x7c;</mml:mo>
<mml:mrow>
<mml:msup>
<mml:mi>&#x3b8;</mml:mi>
<mml:mi>&#x3c0;</mml:mi>
</mml:msup>
</mml:mrow>
</mml:mrow>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(20)</label>
</disp-formula>
</p>
<p>The DPG method can reduce the sampling size of data. For randomized strategy, policy gradient needs to integrate state and action simultaneously, and determine strategy only needs to integrate the state, which greatly improves the algorithm&#x2019;s efficiency. The formulas of deterministic strategy and the gradient expression are as follows:<disp-formula id="e21">
<mml:math id="m79">
<mml:mrow>
<mml:msub>
<mml:mi>J</mml:mi>
<mml:mi>&#x3b2;</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>&#x3bc;</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mo>&#x223c;</mml:mo>
<mml:msup>
<mml:mi>&#x3c1;</mml:mi>
<mml:mi>&#x3b2;</mml:mi>
</mml:msup>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:msup>
<mml:mi>Q</mml:mi>
<mml:mi>&#x3bc;</mml:mi>
</mml:msup>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>&#x3bc;</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>s</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(21)</label>
</disp-formula>
<disp-formula id="e22">
<mml:math id="m80">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="normal">&#x2207;</mml:mi>
<mml:mi>&#x3b8;</mml:mi>
</mml:msub>
<mml:mi>J</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>&#x3bc;</mml:mi>
<mml:mi>&#x3b8;</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mo>&#x223c;</mml:mo>
<mml:msup>
<mml:mi>&#x3c1;</mml:mi>
<mml:mi>&#x3b2;</mml:mi>
</mml:msup>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mrow>
<mml:mrow>
<mml:mi mathvariant="normal">&#x2207;</mml:mi>
<mml:mi>&#x3b8;</mml:mi>
<mml:msub>
<mml:mi>&#x3bc;</mml:mi>
<mml:mi>&#x3b8;</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>s</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:msup>
<mml:mi>Q</mml:mi>
<mml:mi>&#x3bc;</mml:mi>
</mml:msup>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>a</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>&#x7c;</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>&#x3bc;</mml:mi>
<mml:mi>&#x3b8;</mml:mi>
</mml:msub>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(22)</label>
</disp-formula>Where: <inline-formula id="inf59">
<mml:math id="m81">
<mml:mi>&#x3bc;</mml:mi>
</mml:math>
</inline-formula> represents the determined strategy adopted by DDPG, <inline-formula id="inf60">
<mml:math id="m82">
<mml:mrow>
<mml:msup>
<mml:mi>&#x3c1;</mml:mi>
<mml:mi>&#x3b2;</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> represents the distribution of a balanced exploration and utilization process. In the DPG algorithm, the Critic network is a linear function approximator, and the Actor updates the parameters in the direction of the Critic&#x2019;s action-value function.</p>
<p>The DDPG algorithm is improved by the following details: the updating methods of the target network&#x2019;s parameters, the regularization method of the samples, and the exploration noise of action. Compared with DQN (Deep Q network), which updates the parameters of the target network at regular time intervals, DDPG adopts a soft update method, which transfers the parameters both before and after updating to the target network. In order to prevent gradient disappearance or exploding gradient, the input and output of ANN are normalized in batches. Moreover, the DDPG algorithm adds a Gaussian noise to the determined action to improve the diversity of samples.</p>
</sec>
</sec>
<sec id="s3-4">
<title>3.4 CS-BILSTM Model Based on DDPG Optimization</title>
<p>The complexity of PQD classification is prone to result in no convergence and poor training effects for the classification model. Therefore, the DDPG method is introduced to optimize the parameters during the training process. The DDPG algorithm based on artificial intelligence has the characteristics of self-organization, self-adaptation, and self-learning, has high robustness, and is easy to parallel. The detailed parameter of the DDPG network is set as follows. The inputs of the Actor network are normally <italic>N</italic> &#xd7; 2 sequences with two hidden layers which has 256 and 32 neurons respectively. The activation function of the Actor network is tanh, the loss function is MSE, and the optimization method RMSprop is introduced here. The input of Critic network consists of two parts: the first part is the state observed by the agent; The second part is the corresponding actions taken by the agent. The hidden layer includes two layers, the number of neurons is 256 and 32 respectively, and the number of neurons in the output layer is 1, which indicates the Q value obtained by the critical network taking some action in this state. Except for the output layer, other activation functions use tanh, and the activation function of the output layer is Relu. After obtaining the Q value, the probability of generating random action is &#x3b5; Strategy, i.e., probability 1- &#x3b5; chooses <inline-formula id="inf61">
<mml:math id="m83">
<mml:mrow>
<mml:msup>
<mml:mi>&#x3c0;</mml:mi>
<mml:mo>&#x2217;</mml:mo>
</mml:msup>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>s</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>arg</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi>max</mml:mi>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>a</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>. Meanwhile, the value of random action follows the normal distribution , <inline-formula id="inf62">
<mml:math id="m84">
<mml:mrow>
<mml:mi>&#x3c3;</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>a</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>arg</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi>max</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>a</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>. The related Param-eter setting and description of DDPG algorithm is shown in <xref ref-type="app" rid="app1">APPENDIX</xref> part.</p>
<p>It is widely used in the optimization of multimodal functions. The traditional stacked denoising autoencoder adopts SGD in the fine-tuning stage. The SGD updates each sample with a fast update rate, which can automatically pick out the inferior local optimtbal points. However, on account of the many update times, the cost function may experience acute fluctuation with inferior convergence performance, which affects the classification effect of the encoder. Therefore, this paper improves the traditional DAE. Adam is used to updating the network weights and bias during the fine-tuning stage instead of SGD. The flow chart of PQD classification by the improved CS-BiLSTM algorithm based on DDPG parameter optimization is illustrated in <xref ref-type="fig" rid="F5">Figure 5</xref>.</p>
<fig id="F5" position="float">
<label>FIGURE 5</label>
<caption>
<p>Schematic diagram of the CS-BILSTM model optimized by DDPG algorithm.</p>
</caption>
<graphic xlink:href="fenrg-10-874351-g005.tif"/>
</fig>
</sec>
</sec>
<sec id="s4">
<title>4 Simulation Results and Analysis</title>
<p>The proposed power quality signal compression technique and PQD classification are evaluated in this section via the comparative experiments with four simulation tests. The simulation software are respectively Matlab2019b and Python3.6.5 with its advanced tool pytorch1.2.0. As for the computer configuration, the Intel Core CPU i3-8100 and internal storage 16G with the 1T hard disk storage device.</p>
<p>This paper uses the WAMS (Wide Area Measurement System) data collected from the actual power grid in a province of China in 2020 to form a data set. The data set is the power quality data that has been manually verified, including 2000 pieces of data. In order to form the enough training set, some power quality data is generated with the MATLAB simulation.</p>
<p>A series of power quality signals are generated by mathematical modeling simulation, and the sampling frequency is set to 3200&#xa0;Hz based on the actual sampling frequency of power equipment in the power system. Also, the power quality signal sampling length is 18 cycles.</p>
<p>Then, the Gaussian white noise is added in the generation of the PQD signal to simulate the random noise in the power system. The signal-to-noise ratio (SNR) ranges from 20&#xa0;dB to 40&#xa0;dB.</p>
<p>The generated power quality signals include six categories of single disturbance and four types of composite disturbance such as voltage sag, harmonic, voltage flicker, harmonic with voltage sag, harmonic with voltage interruption, voltage sag with voltage flicker, etc. They are all labeled with the number from 1 to 10, respectively.</p>
<p>MATLAB is used to generate 20,000 sets of PQD signals, where 18,000 sets are chosen as the training set, and the last 2000 sets are selected as the testing set. The 10-fold cross-validation is adopted to select the suitable training set and validation set in this step. <xref ref-type="fig" rid="F7">Figure 7</xref> demonstrates the experiment result.</p>
<sec id="s4-1">
<title>4.1 Comparison Results of Reconstruction Algorithms</title>
<p>As shown in <xref ref-type="fig" rid="F6">Figure 6</xref>, Orthogonal Matching Pursuit, Generalized Orthogonal Matching Pursuit (Generalized OMP, GOMP), Regularized Matching Pursuit (Regularized OMP, ROMP), and Stage Orthogonal Matching Pursuit (StagewiseOMP, StOMP), Compressive Sampling Matching Pursuit (CompressiveSamplingMP, CoSaMP), and DCS-SOMP algorithms are adopted to perform compressive sampling of PQD signals in the power grid, while the sparsity of the PQD signal of each node is assumed as 10. The comparison of the signal-to-noise ratios (SNR) of reconstructed power quality signals under different compression ratios is carried out between the above algorithms. <xref ref-type="fig" rid="F5">Figure 5</xref> demonstrates that except for the DCS-SOMP algorithm, the signal-to-noise ratio of other algorithms&#x2019; reconstructed power quality signals decreases with the increase of compression ratio. In the subfigure (a) of <xref ref-type="fig" rid="F5">Figure 5</xref>, the reconstructed power quality signals of the ROMP and CoSaMP algorithms show distortion when the compression ratio rises to 40. Additionally, in the process of power quality data compression and storage, the sparsity of PQD signals under the sparse dictionary has an important impact on the power quality data&#x2019;s upload speed to the cloud. The sparser the data, the fewer sparse dictionary atoms, thus, the smaller data sizes. By contrast, the DCS-SOMP reconstruction algorithm overperform other algorithms, like OMP, ROMP, etc. It is clearly more accurate for the compressed acquisition of power quality data.</p>
<fig id="F6" position="float">
<label>FIGURE 6</label>
<caption>
<p>Comparison of reconstruction effects. <bold>(A)</bold> Compression ratio of 10&#xa0;dB, <bold>(B)</bold> Compression ratio of 20&#xa0;dB, and <bold>(C)</bold> Compression ratio of 30&#xa0;dB.</p>
</caption>
<graphic xlink:href="fenrg-10-874351-g006.tif"/>
</fig>
</sec>
<sec id="s4-2">
<title>4.2 Reconstruction and Demonstration of Different Power Quality Disturbances</title>
<p>After determining the transform domain, the measurement matrix, and the reconstruction algorithm, the compression-reconstruction simulation of 6 types of PQD signals is carried out, and the compression rate represents the ratio of the observation points&#x2019; number to the signal length, which is set as 25%. In order to reduce the reconstruction error, the sparsity value of different disturbance signals in <xref ref-type="table" rid="T1">Table 1</xref> is determined through a large number of experiments. Moreover, <xref ref-type="table" rid="T1">Table 1</xref> shows the error values between the original signal and the reconstructed PQD signal obtained by compressed sensing and reconstructing of randomly generated PQD signals. <xref ref-type="fig" rid="F7">Figure 7</xref> shows the simulation diagrams of the original signals, the reconstruction signals, and the error waveform of the two kinds of PQD signals. Finally, we use mean square error to evaluate the reconstruction signals.</p>
<table-wrap id="T1" position="float">
<label>TABLE 1</label>
<caption>
<p>Reconstruction error of power quality disturbance signal.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">Power quality disturbance</th>
<th align="center">Sparsity (K)</th>
<th align="center">Reconstruction error (%)</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">Voltage sag</td>
<td align="char" char=".">10</td>
<td align="char" char=".">1.12</td>
</tr>
<tr>
<td align="left">Voltage swell</td>
<td align="char" char=".">10</td>
<td align="char" char=".">1.47</td>
</tr>
<tr>
<td align="left">Harmonic</td>
<td align="char" char=".">10</td>
<td align="char" char=".">3.29</td>
</tr>
<tr>
<td align="left">Voltage flicker</td>
<td align="char" char=".">10</td>
<td align="char" char=".">3.99</td>
</tr>
<tr>
<td align="left">Pulse</td>
<td align="char" char=".">10</td>
<td align="char" char=".">1.02</td>
</tr>
<tr>
<td align="left">Transient oscillation</td>
<td align="char" char=".">10</td>
<td align="char" char=".">6.15</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="F7" position="float">
<label>FIGURE 7</label>
<caption>
<p>Simulation waveform of the original signal and reconstructed signal.</p>
</caption>
<graphic xlink:href="fenrg-10-874351-g007.tif"/>
</fig>
</sec>
<sec id="s4-3">
<title>4.3 Comparison of Application of CS-DL in Power Quality Disturbance Classification</title>
<sec id="s4-3-1">
<title>4.3.1 Results of Power Quality Disturbance Classification</title>
<p>It can be seen from <xref ref-type="fig" rid="F8">Figure 8</xref> that the classification accuracy of PQD signals is still relatively low in the initial stage of training. Then, the loss value is quickly reduced to less than 0.1 after about 850 epochs of training. Also, the classification accuracy is improved to about 94% and remains stable, which indicates that the network converges after about 850 training epochs. Moreover, the training accuracy and test accuracy are almost equal after about 950 epochs of training, and the total classification accuracy of PQD signals in the test set is 99.7%. In order to obtain better network performance, the setting of the network parameters is necessary, in which the setting of the learning rate is critical. In this paper, the dynamic setting method of learning rate is adopted. The initial learning rate is set to 0.001; after 200 iterations, it drops to 0.0001. This setting can further improve the classification accuracy of PQD signals.</p>
<fig id="F8" position="float">
<label>FIGURE 8</label>
<caption>
<p>Training loss and classification accuracy of CS-BiLSTM model.</p>
</caption>
<graphic xlink:href="fenrg-10-874351-g008.tif"/>
</fig>
<p>It can be seen from <xref ref-type="fig" rid="F9">Figure 9</xref>, <xref ref-type="fig" rid="F10">Figure 10</xref>, and <xref ref-type="table" rid="T2">Table 2</xref> that the CS-BiLSTM method we proposed has a superior performance compared with the CNN-BiLSTM method in the classification of PQD. Although the CS-BiLSTM model has lower classification accuracy for voltage flicker and transient oscillation than the CNN-BiLSTM model, the CS-BiLSTM has higher classification accuracy in the other eight types of PQD and average classification accuracy. Meanwhile, the CS-BiLSTM model&#x2019;s training time is only 59.12% of the CNN-BiLSTM model&#x2019;s training time. Since the voltage sags, voltage swells, and harmonics account for more than 70% of the PQD types, in reality, the ten types of PQD samples are also created in proportion.</p>
<fig id="F9" position="float">
<label>FIGURE 9</label>
<caption>
<p>Comparison of training time.</p>
</caption>
<graphic xlink:href="fenrg-10-874351-g009.tif"/>
</fig>
<fig id="F10" position="float">
<label>FIGURE 10</label>
<caption>
<p>Classification results of non-noise power quality disturbance signals.</p>
</caption>
<graphic xlink:href="fenrg-10-874351-g010.tif"/>
</fig>
<table-wrap id="T2" position="float">
<label>TABLE 2</label>
<caption>
<p>Classification accuracy of the reconstructed signal.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th rowspan="2" align="left">Power quality disturbance</th>
<th colspan="2" align="center">Classification accuracy (%)</th>
</tr>
<tr>
<th align="center">CNN-BiLSTM</th>
<th align="center">CS-BiLSTM</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">Voltage sag</td>
<td align="char" char=".">96.0</td>
<td align="char" char=".">96.8</td>
</tr>
<tr>
<td align="left">Voltage swell</td>
<td align="char" char=".">96.0</td>
<td align="char" char=".">98.4</td>
</tr>
<tr>
<td align="left">Harmonic</td>
<td align="char" char=".">94.4</td>
<td align="char" char=".">98.4</td>
</tr>
<tr>
<td align="left">Voltage flicker</td>
<td align="char" char=".">98.4</td>
<td align="char" char=".">96.8</td>
</tr>
<tr>
<td align="left">Pulse</td>
<td align="char" char=".">98.4</td>
<td align="char" char=".">100</td>
</tr>
<tr>
<td align="left">Transient oscillation</td>
<td align="char" char=".">98.4</td>
<td align="char" char=".">96.8</td>
</tr>
<tr>
<td align="left">Harmonic &#x2b; voltage sag</td>
<td align="char" char=".">96.0</td>
<td align="char" char=".">97.6</td>
</tr>
<tr>
<td align="left">Harmonic &#x2b; voltage swell</td>
<td align="char" char=".">94.2</td>
<td align="char" char=".">96.8</td>
</tr>
<tr>
<td align="left">Voltage flicker &#x2b; transient oscillation</td>
<td align="char" char=".">96.8</td>
<td align="char" char=".">98.4</td>
</tr>
<tr>
<td align="left">Voltage flicker &#x2b; voltage sag</td>
<td align="char" char=".">96.0</td>
<td align="char" char=".">98.4</td>
</tr>
<tr>
<td align="left">Average value</td>
<td align="char" char=".">96.43</td>
<td align="char" char=".">97.6</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>In the case of identifying 1,000 groups of voltage sag disturbance data, 730 groups are classified as voltage sags, 80 groups are identified as oscillation with voltage sags, 20 groups are identified as voltage flicker with voltage sags, and 180 groups are identified as harmonic with voltage sags. Furthermore, we analyze the 180 groups of signals that are identified as composite disturbances of harmonic with voltage sags. The analysis shows that there exist harmonic components in these signals, which meet the requirements of IEEE standard for harmonic definition. In addition, it indicates that the label of some original data is inaccurate. Meanwhile, the result demonstrates that the proposed method has high classification accuracy for composite disturbances, which is normally neglected in the previous study. The total classification time of the CS-BiLSTM model for the 1,000 groups of voltage sags data is 15&#xa0;s, with an average classification time of 0.15&#xa0;s per sample.</p>
</sec>
<sec id="s4-3-2">
<title>4.3.2 Results of Parameter Optimization Based on DDPG Method</title>
<p>Three Gaussian white noises were added to the initial signal to verify the noise immunity of the algorithm before training, and the SNR is 20&#xa0;dB, 30&#xa0;dB, and 40&#xa0;dB, respectively, after adding the Gaussian noise. As shown in <xref ref-type="fig" rid="F11">Figure 11</xref>, the accuracy rate of PQD classification increases rapidly in the initial stage of training. After about 400 rounds of training and learning, the loss value decreases rapidly to less than 0.2. The classification accuracy rate increases to about 95% and then remains stable, indicating that the network has converged. Compared with the traditional method, the proposed method has a superior performance of PQD classification both under simple situations and in the case of complex PQD.</p>
<fig id="F11" position="float">
<label>FIGURE 11</label>
<caption>
<p>Training loss and classification accuracy of the optimized CS-BiLSTM model.</p>
</caption>
<graphic xlink:href="fenrg-10-874351-g011.tif"/>
</fig>
<p>It can be seen from <xref ref-type="fig" rid="F12">Figure 12</xref> and <xref ref-type="table" rid="T3">Table 3</xref> that with the increase of noise, the average classification accuracy of the two methods for PQD is gradually reduced. When the noise intensity is 40 and 30&#xa0;dB, the average classification accuracy of the CS-BiLSTM model is 97.49 and 96.76%, respectively. When the noise intensity is further strengthened to 20&#xa0;dB, the classification accuracy is significantly reduced to 96.07% but remains high. Compared with the CNN-BiLSTM model, the CS-BiLSTM hybrid model performs a higher classification accuracy obviously for all types of PQDs. The experimental results fully prove that the proposed hybrid model possesses a good classification ability of PQD signals and has promising anti-noise capability.</p>
<fig id="F12" position="float">
<label>FIGURE 12</label>
<caption>
<p>Classification results of power quality disturbance signals with 20&#xa0;dB compression ratio.</p>
</caption>
<graphic xlink:href="fenrg-10-874351-g012.tif"/>
</fig>
<table-wrap id="T3" position="float">
<label>TABLE 3</label>
<caption>
<p>Classification results of multiple disturbances.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th rowspan="2" align="left">Power quality disturbance</th>
<th colspan="4" align="center">SNR</th>
</tr>
<tr>
<th align="center">20&#xa0;dB</th>
<th align="center">30&#xa0;dB</th>
<th align="center">40&#xa0;dB</th>
<th align="center">Non-noise</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">Voltage interruption and harmonic</td>
<td align="char" char="(">96 (88)</td>
<td align="char" char="(">97 (86)</td>
<td align="char" char="(">97 (87)</td>
<td align="char" char="(">98 (88)</td>
</tr>
<tr>
<td align="left">Voltage swell and harmonic</td>
<td align="char" char="(">94 (81)</td>
<td align="char" char="(">94 (80)</td>
<td align="char" char="(">93 (83)</td>
<td align="char" char="(">95 (81)</td>
</tr>
<tr>
<td align="left">Voltage sag and transient oscillation</td>
<td align="char" char="(">100 (88)</td>
<td align="char" char="(">100 (89)</td>
<td align="char" char="(">99 (90)</td>
<td align="char" char="(">100 (88)</td>
</tr>
<tr>
<td align="left">Pulse and harmonic</td>
<td align="char" char="(">95 (89)</td>
<td align="char" char="(">99 (86)</td>
<td align="char" char="(">97 (87)</td>
<td align="char" char="(">97 (89)</td>
</tr>
<tr>
<td align="left">Transient oscillation and harmonic</td>
<td align="char" char="(">95 (89)</td>
<td align="char" char="(">96 (88)</td>
<td align="char" char="(">93 (82)</td>
<td align="char" char="(">95 (89)</td>
</tr>
<tr>
<td align="left">Voltage flicker and harmonic</td>
<td align="char" char="(">91 (82)</td>
<td align="char" char="(">93 (81)</td>
<td align="char" char="(">95 (82)</td>
<td align="char" char="(">93 (82)</td>
</tr>
<tr>
<td align="left">Transient oscillation and pulse</td>
<td align="char" char="(">100 (88)</td>
<td align="char" char="(">98 (89)</td>
<td align="char" char="(">100 (90)</td>
<td align="char" char="(">100 (88)</td>
</tr>
<tr>
<td align="left">Voltage flicker and pulse</td>
<td align="char" char="(">92 (87)</td>
<td align="char" char="(">98 (88)</td>
<td align="char" char="(">100 (90)</td>
<td align="char" char="(">100 (87)</td>
</tr>
<tr>
<td align="left">Voltage flicker and transient oscillation</td>
<td align="char" char="(">98 (82)</td>
<td align="char" char="(">96 (89)</td>
<td align="char" char="(">100 (88)</td>
<td align="char" char="(">100 (82)</td>
</tr>
<tr>
<td align="left">Harmonic and transient oscillation and pulse</td>
<td align="char" char="(">98 (87)</td>
<td align="char" char="(">96 (90)</td>
<td align="char" char="(">99 (90)</td>
<td align="char" char="(">99 (87)</td>
</tr>
<tr>
<td align="left">Harmonic and pulse and voltage flicker</td>
<td align="char" char="(">93 (83)</td>
<td align="char" char="(">94 (83)</td>
<td align="char" char="(">94 (84)</td>
<td align="char" char="(">95 (83)</td>
</tr>
<tr>
<td align="left">Transient oscillation and pulse and voltage flicker</td>
<td align="char" char="(">97 (86)</td>
<td align="char" char="(">99 (89)</td>
<td align="char" char="(">100 (89)</td>
<td align="char" char="(">100 (86)</td>
</tr>
<tr>
<td align="left">Voltage sag and transient oscillation and pulse and voltage Flicker</td>
<td align="char" char="(">100 (92)</td>
<td align="char" char="(">98 (89)</td>
<td align="char" char="(">100 (90)</td>
<td align="char" char="(">100 (93)</td>
</tr>
<tr>
<td align="left">Average value</td>
<td align="char" char="(">96.07 (86.15)</td>
<td align="char" char="(">96.76 (86.77)</td>
<td align="char" char="(">97.49 (87.15)</td>
<td align="char" char="(">97.85 (87.69)</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<fn>
<p>(The recognition rate of traditional methods in parentheses).</p>
</fn>
</table-wrap-foot>
</table-wrap>
</sec>
</sec>
</sec>
<sec id="s5">
<title>5 Conclusion</title>
<p>This paper presents a power quality disturbance classification and classification method based on DCS and deep learning. Through this method, the efficient compression and accurate reconstruction of power quality data of each node in the power grid can be realized. Moreover, the identification and classification of PQDs in the power grid can be realized, which provides a new reference for the governance of power grid harmonics and the storage of power quality data. The main conclusions of this paper are as follows:<list list-type="simple">
<list-item>
<p>1) Based on the SOMP algorithm and K-SVD dictionary learning algorithm, a DCS algorithm called DCS-OMP is proposed, which realizes efficient compression and accurate reconstruction of power quality data in distribution network under low measurement value and high compression ratio.</p>
</list-item>
<list-item>
<p>2) Based on the CNN-BiLSTM model, a CS-BiLSTM hybrid model is built, and a comparison is carried out between the two models. The average recognition rate of CS-BiLSTM hybrid model is 97.85% without noise, and 97.49, 96.76, and 96.07% with 40, 30, and 20&#xa0;dB noise, respectively. Compared with the CNN-BiLSTM model, the recognition rate of the CS-BiLSTM hybrid model is increased by 10.15, 10.30, 10.00, and 9.23% in the case of no noise, 40&#xa0;dB noise, 30&#xa0;dB noise, and 20&#xa0;dB noise, respectively. The recognition rate in high-intensity noise interference is improved significantly. According to the results, the proposed CS-BiLSTM hybrid model has a higher recognition rate and better noise immunity.</p>
</list-item>
<list-item>
<p>3) DDPG algorithm is employed to optimize the parameters in the training process of the CS-BiLSTM hybrid model, which ensures the convergence of training and the effectiveness of results.</p>
</list-item>
</list>
</p>
<p>The proposed method CS-BiLSTM is more efficient to solve the problems of high sampling rate, high cost of hardware implementation when performing the disturbance recognition of power quality data. It helps improve the related theory and algorithm of power quality analysis and detection. However, the application of parameters optimization via reinforcement learning will inevitably encounter spending much time training the network. In the future, we would like to further adjust the parameters to make the experiment converge, speed up the convergence speed of the network, reduce the time spent on training and improving the computing efficiency of the algorithm.</p>
</sec>
</body>
<back>
<sec id="s6">
<title>Data Availability Statement</title>
<p>The original contributions presented in the study are included in the article/Supplementary Material, further inquiries can be directed to the corresponding author.</p>
</sec>
<sec id="s7">
<title>Author Contributions</title>
<p>XX: Drafting the manuscript, CH: experimental analysis, HC: Review and Supervision, YL: Methodology and Formal analysis, BZ: Conceptualization and Revised, SW: Data Curation and Resources, CC: Software.</p>
</sec>
<sec id="s8">
<title>Funding</title>
<p>This work is supported by The Laboratory Open Fund of Beijing Smart-chip Microelectronics Technology Co., Ltd.</p>
</sec>
<sec sec-type="COI-statement" id="s9">
<title>Conflict of Interest</title>
<p>Authors XX and CH were employed by Beijing Smart-Chip Microelectronics Technology Co., Ltd Authors YL, BZ, and SW were employed by Beijing Electric Power Science and Smart Chip Technology Company Limited.</p>
<p>The authors declare that this study received funding from The Laboratory Open Fund of Beijing Smart-chip Microelectronics Technology Co., Ltd. The funder had the following involvement in the study: data collection, experiment analysis.</p>
</sec>
<sec sec-type="disclaimer" id="s10">
<title>Publisher&#x2019;s Note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Berutu</surname>
<given-names>S. S.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>Y. C.</given-names>
</name>
</person-group> (<year>2020</year>). &#x201c;<article-title>Power Quality Disturbances Classification Based on Wavelet Compression and Deep Convolutional Neural Network</article-title>,&#x201d; in <conf-name>2020 International Symposium on Computer, Consumer and Control (IS3C).IEEE</conf-name>, <conf-loc>Taichung City, Taiwan</conf-loc>, <conf-date>13-16 Nov. 2020</conf-date>, <fpage>327</fpage>&#x2013;<lpage>330</lpage>. </citation>
</ref>
<ref id="B2">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bravo-Rodr&#xed;guez</surname>
<given-names>J. C.</given-names>
</name>
<name>
<surname>Torres</surname>
<given-names>F. J.</given-names>
</name>
<name>
<surname>Borr&#xe1;s</surname>
<given-names>M. D.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Hybrid Machine Learning Models for Classifying Power Quality Disturbances: A Comparative Study</article-title>. <source>Energies</source> <volume>11</volume> (<issue>13</issue>), <fpage>2761</fpage>&#x2013;<lpage>2768</lpage>. <pub-id pub-id-type="doi">10.3390/en13112761</pub-id> </citation>
</ref>
<ref id="B3">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Cai</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Cao</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Aarniovuori</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Pang</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Lin</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Classification of Power Quality Disturbances Using Wigner-Ville Distribution and Deep Convolutional Neural Networks</article-title>. <source>IEEE Access</source> <volume>7</volume> (<issue>1</issue>), <fpage>119099</fpage>&#x2013;<lpage>119109</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2019.2937193</pub-id> </citation>
</ref>
<ref id="B4">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chen</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2003</year>). <article-title>A Quantitative Analysis of the Data Acquisition Requirements for Measuring Power Quality Phenomena</article-title>. <source>IEEE Trans. Power Deliv.</source> <volume>18</volume> (<issue>4</issue>), <fpage>1575</fpage>&#x2013;<lpage>1577</lpage>. <pub-id pub-id-type="doi">10.1109/TPWRD.2003.817521</pub-id> </citation>
</ref>
<ref id="B5">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Elphick</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Ciufo</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Drury</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Smith</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Perera</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Gosbell</surname>
<given-names>V.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>Large Scale Proactive Power-Quality Monitoring: An Example from Australia</article-title>. <source>IEEE Trans. Power Deliv.</source> <volume>32</volume> (<issue>2</issue>), <fpage>881</fpage>&#x2013;<lpage>889</lpage>. <pub-id pub-id-type="doi">10.1109/TPWRD.2016.2562680</pub-id> </citation>
</ref>
<ref id="B6">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Elphick</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Gosbell</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Smith</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Perera</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Ciufo</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Drury</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>Methods for Harmonic Analysis and Reporting in Future Grid Applications</article-title>. <source>IEEE Trans. Power Deliv.</source> <volume>32</volume> (<issue>2</issue>), <fpage>989</fpage>&#x2013;<lpage>995</lpage>. <pub-id pub-id-type="doi">10.1109/TPWRD.2016.2586963</pub-id> </citation>
</ref>
<ref id="B7">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gibbon</surname>
<given-names>T. B.</given-names>
</name>
<name>
<surname>Yu</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Monroy</surname>
<given-names>I. T.</given-names>
</name>
</person-group> (<year>2009</year>). <article-title>Photonic Ultra-wideband 781.25-Mb/s Signal Generation and Transmission Incorporating Digital Signal Processing Detection</article-title>. <source>IEEE Photon. Technol. Lett.</source> <volume>21</volume> (<issue>15</issue>), <fpage>1060</fpage>&#x2013;<lpage>1062</lpage>. <pub-id pub-id-type="doi">10.1109/LPT.2009.2022503</pub-id> </citation>
</ref>
<ref id="B8">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Jin</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Haosong</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Zhongping</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Ting</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Shuai</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Yutong</surname>
<given-names>W.</given-names>
</name>
<etal/>
</person-group> (<year>2019</year>). &#x201c;<article-title>Research on Wide-Area Distributed Power Quality Data Fusion Technology of Power Grid</article-title>,&#x201d; in <conf-name>2019 IEEE 4th International Conference on Cloud Computing and Big Data Analysis (ICCCBDA)</conf-name>, <conf-loc>Chengdu, China</conf-loc>, <conf-date>12-15 April 2019</conf-date>, <fpage>185</fpage>&#x2013;<lpage>188</lpage>. <pub-id pub-id-type="doi">10.1109/icccbda.2019.8725668</pub-id> </citation>
</ref>
<ref id="B9">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>He</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Spatiotemporal Remote-Sensing Image Fusion with Patch-Group Compressed Sensing</article-title>. <source>IEEE Access</source> <volume>8</volume>, <fpage>209199</fpage>&#x2013;<lpage>209211</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2020.3011258</pub-id> </citation>
</ref>
<ref id="B10">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>C.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>A Deep-Learning Intelligent System Incorporating Data Augmentation for Short-Term Voltage Stability Assessment of Power Systems</article-title>. <source>Appl. Energ.</source> <volume>308</volume>, <fpage>118347</fpage>. <pub-id pub-id-type="doi">10.1016/j.apenergy.2021.118347</pub-id> </citation>
</ref>
<ref id="B11">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Lu</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Wei</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Yuan</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Deng</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Song</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Tractor Assistant Driving Control Method Based on EEG Combined with RNN-TL Deep Learning Algorithm</article-title>. <source>IEEE Access</source> <volume>8</volume>, <fpage>163269</fpage>&#x2013;<lpage>163279</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2020.3021051</pub-id> </citation>
</ref>
<ref id="B12">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Luo</surname>
<given-names>F.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Data-Driven Energy Demand Side Management Techniques</article-title>. <source>Front. Energ. Res.</source>, <volume>24</volume>. <pub-id pub-id-type="doi">10.3389/fenrg.2022.849031</pub-id> </citation>
</ref>
<ref id="B13">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ma</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Dong</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Mao</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Zhou</surname>
<given-names>Y.</given-names>
</name>
<etal/>
</person-group> (<year>2021</year>). <article-title>Edge Intelligent Perception Method for Power Grid Icing Condition Based on Multi-Scale Feature Fusion Target Detection and Model Quantization</article-title>. <source>Front. Energ. Res.</source> <volume>9</volume>, <fpage>591</fpage>. <pub-id pub-id-type="doi">10.3389/fenrg.2021.754335</pub-id> </citation>
</ref>
<ref id="B14">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Negnevitsky</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Faybisovich</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Santoso</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Powers</surname>
<given-names>E. J.</given-names>
</name>
<name>
<surname>Grady</surname>
<given-names>W. M.</given-names>
</name>
<name>
<surname>Parsons</surname>
<given-names>A. C.</given-names>
</name>
</person-group> (<year>2000</year>). <article-title>Discussion of "Power Quality Disturbance Waveform Recognition Using Wavelet-Based Neural Classifier-Part 1: Theoretical Foundation</article-title>. <source>IEEE Trans. Power Deliv.</source> <volume>15</volume> (<issue>4</issue>), <fpage>1347</fpage>&#x2013;<lpage>1348</lpage>. <pub-id pub-id-type="doi">10.1109/61.891571</pub-id> </citation>
</ref>
<ref id="B15">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ning</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Si</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Nian</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Fei</surname>
<given-names>Z.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Network Reconfiguration Based on Edge-Cloud-Coordinate Framework and Load Forecasting</article-title>. <source>Front. Energ. Res.</source> <volume>9</volume>, <fpage>525</fpage>. <pub-id pub-id-type="doi">10.3389/fenrg.2021.679275</pub-id> </citation>
</ref>
<ref id="B16">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Noland</surname>
<given-names>K. C.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>High Frame Rate Television: Sampling Theory, the Human Visual System, and Why the Nyquist&#x2013;Shannon Theorem Does Not Apply</article-title>. <source>SMPTE Motion Imaging J.</source> <volume>125</volume> (<issue>3</issue>), <fpage>46</fpage>&#x2013;<lpage>52</lpage>. <pub-id pub-id-type="doi">10.5594/JMI.2016.2531998</pub-id> </citation>
</ref>
<ref id="B17">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Pei</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Hsue</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Ding</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2006</year>). <article-title>Discrete Fractional Fourier Transform Based on New Nearly Tridiagonal Commuting Matrices</article-title>. <source>IEEE Trans. Signal Process.</source> <volume>54</volume> (<issue>10</issue>), <fpage>3815</fpage>&#x2013;<lpage>3828</lpage>. <pub-id pub-id-type="doi">10.1109/TSP.2006.879313</pub-id> </citation>
</ref>
<ref id="B18">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Song</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Pang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Hou</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>X.</given-names>
</name>
</person-group> (<year>2012</year>). <article-title>An Improved Nyquist&#x2013;Shannon Irregular Sampling Theorem from Local Averages</article-title>. <source>IEEE Trans. Inf. Theor.</source> <volume>58</volume> (<issue>9</issue>), <fpage>6093</fpage>&#x2013;<lpage>6100</lpage>. <pub-id pub-id-type="doi">10.1109/TIT.2012.2199959</pub-id> </citation>
</ref>
<ref id="B19">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Tang</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Qiu</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Zhou</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Classification of Complex Power Quality Disturbances Using Optimized S-Transform and Kernel SVM</article-title>. <source>IEEE Trans. Ind. Electro.</source> <volume>67</volume> (<issue>61</issue>), <fpage>9715</fpage>&#x2013;<lpage>9723</lpage>. <pub-id pub-id-type="doi">10.1109/TIE.2019.2952823</pub-id> </citation>
</ref>
<ref id="B20">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>U&#xe7;kun</surname>
<given-names>F. A.</given-names>
</name>
<name>
<surname>&#xd6;zer</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Nurba&#x15f;</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Onat</surname>
<given-names>E.</given-names>
</name>
</person-group> (<year>2020</year>). &#x201c;<article-title>Direction Finding Using Convolutional Neural Networks and Convolutional Recurrent Neural Networks</article-title>,&#x201d; in <conf-name>2020 28th Signal Processing and Communications Applications Conference (SIU)</conf-name>, <conf-loc>Gaziantep, Turkey</conf-loc>, <conf-date>5-7 Oct. 2020</conf-date>, <fpage>1</fpage>&#x2013;<lpage>4</lpage>. <pub-id pub-id-type="doi">10.1109/SIU49456.2020.9302448</pub-id> </citation>
</ref>
<ref id="B21">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>von Gladi&#xdf;</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Ahlborg</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Knopp</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Buzug</surname>
<given-names>T. M.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>Compressed Sensing of the System Matrix and Sparse Reconstruction of the Particle Concentration in Magnetic Particle Imaging</article-title>. <source>IEEE Trans. Magnetics</source> <volume>51</volume> (<issue>2</issue>), <fpage>1</fpage>&#x2013;<lpage>4</lpage>. <pub-id pub-id-type="doi">10.1109/TMAG.2014.2326432</pub-id> </citation>
</ref>
<ref id="B22">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xin</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Shao</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Complex Network Classification with Convolutional Neural Network</article-title>. <source>Tsinghua Sci. Technol.</source> <volume>25</volume> (<issue>4</issue>), <fpage>447</fpage>&#x2013;<lpage>457</lpage>. <pub-id pub-id-type="doi">10.26599/TST.2019.9010055</pub-id> </citation>
</ref>
<ref id="B23">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yin</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Shen</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Dong</surname>
<given-names>Z. Y.</given-names>
</name>
<name>
<surname>Zou</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>Turbine Stability-Constrained Available Wind Power of Variable Speed Wind Turbines for Active Power Control</article-title>. <source>IEEE Trans. Power Syst.</source> <volume>32</volume> (<issue>3</issue>), <fpage>2487</fpage>&#x2013;<lpage>2488</lpage>. <pub-id pub-id-type="doi">10.1109/TPWRS.2016.2605012</pub-id> </citation>
</ref>
<ref id="B24">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>R.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Deep Learning for Short-Term Voltage Stability Assessment of Power Systems</article-title>. <source>IEEE Access</source> <volume>9</volume>, <fpage>29711</fpage>&#x2013;<lpage>29718</lpage>. <pub-id pub-id-type="doi">10.1109/access.2021.3057659</pub-id> </citation>
</ref>
<ref id="B25">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhao</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Shang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Sun</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Power Quality Disturbance Classification Based on Time-Frequency Domain Multi-Feature and Decision Tree</article-title>. <source>Prot. Control. Mod. Power Syst.</source> <volume>4</volume> (<issue>1</issue>), <fpage>1</fpage>&#x2013;<lpage>6</lpage>. <pub-id pub-id-type="doi">10.1186/s41601-019-0139-z</pub-id> </citation>
</ref>
</ref-list>
<app-group>
<app id="app1">
<title>Appendix</title>
<table-wrap id="TA1" position="float">
<label>TABLE A1</label>
<caption>
<p>Parameter setting and description of DDPG algorithm.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">Parameter</th>
<th align="center">Definition</th>
<th align="center">Value</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">Tau<sub>1</sub>
</td>
<td align="left">Smoothing coefficient of target network in the actor and critic networks</td>
<td align="char" char=".">0.001</td>
</tr>
<tr>
<td align="left">Tau<sub>2</sub>
</td>
<td align="left">The smoothing coefficient of exploring network</td>
<td align="char" char=".">0.002</td>
</tr>
<tr>
<td align="left">
<italic>&#x3b1;</italic>
<sub>1</sub>
</td>
<td align="left">Learning rate of actor and critic network</td>
<td align="char" char=".">0.001</td>
</tr>
<tr>
<td align="left">
<italic>&#x3b1;</italic>
<sub>
<italic>2</italic>
</sub>
</td>
<td align="left">Learning rate of <italic>&#x3b5;</italic> control network</td>
<td align="char" char=".">0.002</td>
</tr>
<tr>
<td align="left">Batch_size</td>
<td align="left">Number of samples drawn from the experience pool per training</td>
<td align="char" char=".">64</td>
</tr>
<tr>
<td align="left">Capacity</td>
<td align="left">Size of experience pool</td>
<td align="char" char=".">10,000</td>
</tr>
<tr>
<td align="left">
<italic>&#x3a3;</italic>
</td>
<td align="left">Control the initial value of the variance of the exploration range</td>
<td align="char" char=".">1</td>
</tr>
<tr>
<td align="left">
<italic>&#x393;</italic>
</td>
<td align="left">Discount factor</td>
<td align="char" char=".">95</td>
</tr>
</tbody>
</table>
</table-wrap>
</app>
</app-group>
</back>
</article>