<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">EE</journal-id>
<journal-id journal-id-type="nlm-ta">EE</journal-id>
<journal-id journal-id-type="publisher-id">EE</journal-id>
<journal-title-group>
<journal-title>Energy Engineering</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-0118</issn>
<issn pub-type="ppub">0199-8595</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">29295</article-id>
<article-id pub-id-type="doi">10.32604/ee.2023.029295</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Optical Fibre Communication Feature Analysis and Small Sample Fault Diagnosis Based on VMD-FE and Fuzzy Clustering</article-title>
<alt-title alt-title-type="left-running-head">Optical Fibre Communication Feature Analysis and Small Sample Fault Diagnosis Based on VMD-FE and Fuzzy Clustering</alt-title>
<alt-title alt-title-type="right-running-head">Optical Fibre Communication Feature Analysis and Small Sample Fault Diagnosis Based on VMD-FE and Fuzzy Clustering</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Li</surname><given-names>Xiangqun</given-names></name><xref ref-type="aff" rid="aff-1">1</xref><email>akpower957@163.com</email></contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Liang</surname><given-names>Jiawen</given-names></name><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Zhu</surname><given-names>Jinyu</given-names></name><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western"><surname>Shi</surname><given-names>Shengping</given-names></name><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-5" contrib-type="author">
<name name-style="western"><surname>Ding</surname><given-names>Fangyu</given-names></name><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-6" contrib-type="author">
<name name-style="western"><surname>Sun</surname><given-names>Jianpeng</given-names></name><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-7" contrib-type="author">
<name name-style="western"><surname>Liu</surname><given-names>Bo</given-names></name><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<aff id="aff-1"><label>1</label><institution>Gannan Power Supply Company of State Grid Gansu Electric Power Supply Company</institution>, <addr-line>Hezuo, 747000</addr-line>, <country>China</country></aff>
<aff id="aff-2"><label>2</label><institution>Digital Communication Department, Gannan Power Supply Company of State Grid Gansu Electric Power Supply Company</institution>, <addr-line>Hezuo, 747000</addr-line>, <country>China</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Xiangqun Li. Email: <email>akpower957@163.com</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic"><year>2023</year></pub-date>
<pub-date date-type="pub" publication-format="electronic"><day>27</day><month>12</month><year>2023</year></pub-date>
<volume>121</volume>
<issue>1</issue>
<fpage>203</fpage>
<lpage>219</lpage>
<history>
<date date-type="received"><day>11</day><month>2</month><year>2023</year></date>
<date date-type="accepted"><day>06</day><month>4</month><year>2023</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2024 Li et al.</copyright-statement>
<copyright-year>2024</copyright-year>
<copyright-holder>Li et al.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_EE_29295.pdf"></self-uri>
<abstract>
<p>To solve the problems of a few optical fibre line fault samples and the inefficiency of manual communication optical fibre fault diagnosis, this paper proposes a communication optical fibre fault diagnosis model based on variational modal decomposition (VMD), fuzzy entropy (FE) and fuzzy clustering (FC). Firstly, based on the OTDR curve data collected in the field, VMD is used to extract the different modal components (IMF) of the original signal and calculate the fuzzy entropy (FE) values of different components to characterize the subtle differences between them. The fuzzy entropy of each curve is used as the feature vector, which in turn constructs the communication optical fibre feature vector matrix, and the fuzzy clustering algorithm is used to achieve fault diagnosis of faulty optical fibre. The VMD-FE combination can extract subtle differences in features, and the fuzzy clustering algorithm does not require sample training. The experimental results show that the model in this paper has high accuracy and is relevant to the maintenance of communication optical fibre when compared with existing feature extraction models and traditional machine learning models.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Optical fibre fault diagnosis</kwd>
<kwd>OTDR curve</kwd>
<kwd>variational mode decomposition</kwd>
<kwd>fuzzy entropy</kwd>
<kwd>fuzzy clustering</kwd>
</kwd-group>
<funding-group>
<award-group id="awg1">
<funding-source>State Grid Gansu Electric Power Company Science and Technology Project</funding-source>
<award-id>20220515003</award-id>
</award-group>
</funding-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>Optical fibre communication has the characteristics of a wide transmission band, fine wire diameter, lightweight and low loss [<xref ref-type="bibr" rid="ref-1">1</xref>&#x2013;<xref ref-type="bibr" rid="ref-3">3</xref>], which is the primary way of communication transmission. With the rapid development of optical fibre technology in the communications industry, the stable and efficient operation of optical fibre has become an essential guarantee for safe communications [<xref ref-type="bibr" rid="ref-4">4</xref>]. The fibre cable line is the main body of optical transmission, and the faults in the communication optical fibre have a great impact on the normal operation of the communication network. The timely diagnosis and location of optical fibre faults are a prerequisite for rapid repair.</p>
<p>In recent years, scholars at home and abroad have conducted some research on intelligent fault diagnosis methods of communication optical fibre and proposed many practical diagnosis algorithms [<xref ref-type="bibr" rid="ref-5">5</xref>&#x2013;<xref ref-type="bibr" rid="ref-8">8</xref>], but these methods have certain limitations. Reference [<xref ref-type="bibr" rid="ref-5">5</xref>] used chaotic light to detect the breakpoint of the reference signal and the detection signal of the optical channel to obtain the fault location value, but this method is applicable to limited fault types. Reference [<xref ref-type="bibr" rid="ref-6">6</xref>] was based on data-driven to accurately and quickly detect, diagnose and locate optical fibre anomalies, but when the fault data is insufficient, the diagnosis effect is not ideal. Reference [<xref ref-type="bibr" rid="ref-7">7</xref>] proposed a method to detect optical fibre faults using a multi-level split light method, which can detect optical fibre faults distributed in multiple optical fibre channels, however, this method cannot distinguish micro-differential faults and diagnose them as similar ones. To address these limitations, optical time domain reflectometry (OTDR) has been applied to diagnose faults in optical fibre. OTDR is a non-destructive photoelectric integrated measuring instrument widely used in the construction, maintenance, and fault diagnosis of communication optical fibre [<xref ref-type="bibr" rid="ref-8">8</xref>&#x2013;<xref ref-type="bibr" rid="ref-12">12</xref>]. References [<xref ref-type="bibr" rid="ref-13">13</xref>,<xref ref-type="bibr" rid="ref-14">14</xref>] analyzed the relationship between power and distance in the OTDR curve to determine various faults in optical fibre circuits and their accurate location. References [<xref ref-type="bibr" rid="ref-15">15</xref>,<xref ref-type="bibr" rid="ref-16">16</xref>] discussed applying wavelet analysis to ODTR analysis. Experimental results demonstrated that the performance of OTDR was significantly improved under strong noise, but the model analysis was insufficient, and the algorithm was too complex. The above methods are suitable for optical fibre fault diagnosis through simple analysis of the OTDR curve. In fact, some OTDR state curves are slightly different. Due to insufficient feature extraction, the methods mentioned above cannot distinguish these subtle differences, and the fault diagnosis accuracy is low.</p>
<p>To realize the fault diagnosis of communication optical fibre, extracting the characteristics of the OTDR curve is the primary problem. As for the feature extraction method, Reference [<xref ref-type="bibr" rid="ref-17">17</xref>] proposed a signal modal recognition algorithm based on the BP neural network, which extracted the variance, Fourier transform, disturbance time, and other characteristics of the fault curve and applied the fault data for training to achieve fault recognition. However, BP neural network training requires a large amount of data, the convergence speed is slow, and the accuracy is not high. References [<xref ref-type="bibr" rid="ref-18">18</xref>,<xref ref-type="bibr" rid="ref-19">19</xref>] proposed a feature extraction and recognition algorithm based on LMD decomposition, which has adaptive characteristics and can effectively identify different optical fibre fault types. But in the signal decomposition process, the signal noise reduction effect is easily reduced, and the effective components of the signal are lost due to the modal blending and singular value selection.</p>
<p>To solve the above problems, a method combining variational modal decomposition (VMD) and fuzzy entropy (FE) is used to extract the characteristic information of non-stationary signals. Modal decomposition using VMD can extract the corresponding frequency band more accurately than traditional modal decomposition methods (including DWT and WPT) [<xref ref-type="bibr" rid="ref-20">20</xref>]. At the same time, fuzzy entropy can also identify the subtle features of the signal, so that the subtle features of multiple dimensions of the original signal can be obtained as the characteristic parameters under various optical fibre faults. After fault feature extraction, fault classification needs to be carried out according to the feature. A support vector machine (SVM) based faulty optical fibre fault diagnosis method was proposed in the reference [<xref ref-type="bibr" rid="ref-21">21</xref>] to solve the optical fibre fault feature classification problem, but it requires training on a large number of data samples. However, OTDR fault data is small, which can not meet the requirements of SVM diagnosis. The fuzzy clustering algorithm uses different confidence factors to construct a dynamic clustering map, thus intuitively representing the fault classification. As it does not require training, it is mostly used for real-time evaluation and analysis. This paper, therefore, uses a fuzzy clustering algorithm to classify the fault states without the need for training on the feature vector matrix.</p>
<p>Through the above analysis, this paper proposes a communication optical fibre fault diagnosis model based on VMD-FE feature extraction and fuzzy clustering algorithm based on OTDR measurement data. First, the optical fibre is detected using OTDR, and the VMD and fuzzy entropy calculation are performed on the optical fibre OTDR curve to obtain the feature vector; then, the fuzzy clustering algorithm is used to select the feature vectors of the optical fibre in different states to construct a fuzzy matrix, and the fuzzy equivalence matrix is calculated using the transfer closure method to generate a dynamic clustering map with the change of the confidence factor (<inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:mi>&#x03BB;</mml:mi></mml:math></inline-formula>), so as to achieve the diagnosis of the fault of the communication optical fibre. The model is verified by examples to diagnose optical fibre faults without training accurately yet with practical value.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Optical Fibre Communication and OTDR Technology</title>
<sec id="s2_1">
<label>2.1</label>
<title>Optical Fibre Communication</title>
<p>Total reflection is the basis of optical fibre communication, that is when light is injected from one medium into another medium, the optical line will reflect and refract. The so-called optical fibre communication is to transmit the light wave with information through optical fibre, so that the light wave can reach the destination, and then the information can be transmitted through total reflection. <xref ref-type="fig" rid="fig-1">Fig. 1</xref> shows the schematic diagram of optical fibre propagation.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Schematic diagram of optical fibre propagation</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_29295-fig-1.tif"/>
</fig>
<p>When the incident light is incident into the optical fibre at an angle <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:mi>&#x03B8;</mml:mi></mml:math></inline-formula>, the numerical aperture <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:mi>N</mml:mi><mml:mi>A</mml:mi></mml:math></inline-formula> indicates the optical fibre capacity that can accept light at the core of the incident section of the optical fibre, and <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:mi mathvariant="normal">&#x03A6;</mml:mi></mml:math></inline-formula> indicates the maximum angle of incidence of the optical fibre, and their calculation formulas are as follows:</p>
<p><disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mi>N</mml:mi><mml:mi>A</mml:mi><mml:mo>=</mml:mo><mml:msqrt><mml:msubsup><mml:mi>n</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>n</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup></mml:msqrt></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi mathvariant="normal">&#x03A6;</mml:mi><mml:mo>=</mml:mo><mml:mi>arcsin</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msqrt><mml:msubsup><mml:mi>n</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>n</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup></mml:msqrt><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula>where <bold><italic>n</italic></bold><sub><bold>1</bold></sub> and <bold><italic>n</italic></bold><sub><bold>2</bold></sub> are the refractive index of the fibre core propagation medium and the refractive index of the cladding material. When the incident angle of light <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:mi>&#x03B8;</mml:mi></mml:math></inline-formula> greater than <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:mi mathvariant="normal">&#x03A6;</mml:mi></mml:math></inline-formula>, it cannot propagate stably in the optical fibre.</p>
<p>In recent years, optical fibre communication has developed rapidly due to its characteristics of large bandwidth and low communication loss, but it has also been decided that optical fibre communication will be the focus of communication line maintenance. Optical fibre is made of brittle glass susceptible to environmental influences affecting its transmission performance. As optical fibre communication networks become more complex, the number of faults in optical fibre is increasing yearly. Relying on manual fault diagnosis for communication optical fibre no longer meets the current requirements for smooth communication.</p>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>OTDR Working Principle</title>
<p>OTDR, an optical time domain reflectometer, is a precision optoelectronic integrated instrument. The principle of operation is similar to that of radar: the OTDR injects the laser pulse used for testing into the tested optical fibre at a suitable angle, and then the OTDR captures the backscattered signal of the pulse at the transmitting end of the pulse. As the pulse propagates in the optical fibre, it is reflected and scattered due to the inherent nature of the optical fibre itself, or when it encounters optical fibre connectors, fusion joints, excessive bending or other event points, and this information will be captured by OTDR.</p>
</sec>
<sec id="s2_3">
<label>2.3</label>
<title>Optical Fibre OTDR Curve Analysis</title>
<sec id="s2_3_1">
<label>2.3.1</label>
<title>Optical Fibre OTDR Curve in Normal State</title>
<p>As shown in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>, <bold><italic>f</italic></bold><sub><bold>0</bold></sub> is the curve obtained using the OTDR instrument to test the optical fibre line under normal conditions. Set the two cursors as A and B, where cursor A is set at the back edge of the first Fresnel reflection, and cursor B is set at the front edge of the second Fresnel reflection. Cursor A is the start of the optical fibre line under test, and the part before cursor A is the test blind zone of the OTDR instrument. After cursor A, the normal recording of the optical fibre line test data starts, and cursor B is the end of the optical fibre line under test. The distance between cursors A and B is the length of the line under test.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Optical fibre OTDR curve in normal state</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_29295-fig-2.tif"/>
</fig>
</sec>
<sec id="s2_3_2">
<label>2.3.2</label>
<title>Optical Fibre OTDR Curve in Fault State</title>
<p>According to the field results, <xref ref-type="fig" rid="fig-3">Fig. 3</xref> shows the OTDR curves obtained when the optical fibre is in some typical fault states.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Optical fibre OTDR curves in fault state</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_29295-fig-3.tif"/>
</fig>
<p>The curve <bold><italic>f</italic></bold><sub><bold>1</bold></sub> is initially with signal, then suddenly drop to disappear. OTDR should be able to emit light source normally, otherwise the curve will not have signal initially, but the subsequent signal suddenly disappears. The fibre maybe is broken. First, check whether the fibre is under test and whether it is connected properly; next, check whether the fibre connectors are the same type and cleaned. After checking, if the test signal is still in an abnormal state, it indicates a break in the fibre, and if the break is too close to the test point, it means the OTDR cannot be recognized.</p>
<p>The optical power value of point C in curve <bold><italic>f</italic></bold><sub><bold>2</bold></sub> shows a step decrease, and the slope of the curve at both ends is basically the same, which should be the optical power decrease due to fibre line transmission loss, and can be judged as a normal fibre fusion point. The optical power value at point D shows a slope decline, and the slope of the curve at both ends is different, and the slope of the curve at the back section is obviously larger than that at the front section, which can be judged as an abnormal optical power decrease at point D. The reason should be the optical fibre construction process or maintenance process due to improper construction of the fibre bending angle which resulted in the bending loss.</p>
<p>In curve <bold><italic>f</italic></bold><sub><bold>3</bold></sub>, there is a high Fresnel peak at the end of the curve, but the slope of the curve is different at both ends. It can be judged that points E and F are active connectors, which is a normal event in OTDR fibre testing. Since the peak Fresnel reflection at point G is significantly higher than that at points E and F, and the slope of the latter section is significantly larger than that of the former section, it can be judged that point G is a fibre breakpoint.</p>
<p>The initial end of curve <bold><italic>f</italic></bold><sub><bold>4</bold></sub> is normal, but the end of the curve does not have the Fresnel reflection peak phenomenon. We can determine the initial end of the fibre but can not determine the end of the fibre, and we can not confirm the fibre length and loss. First, check the end of the fibre to determine whether the end surface is dirty and the OTDR can not detect the reflected light signal. Then clean the end face of the fibre and retest. If the fault still exists, the end face of the fibre may be of poor quality.</p>
<p>Curve <bold><italic>f</italic></bold><sub><bold>5</bold></sub> before and after the curve is smooth and normal, the middle part of the curve appears with irregular changes, and the entire fibre line optical attenuation indicators are basically normal. First of all, the parts are cleaned and retested to check whether the cause is fibre cleaning. Also adjust the wavelength setting to see if the fibre attenuation slope is back to normal. After excluding the above factors, it is confirmed that the cause of the failure of the fibre bending radius is too small.</p>
<p>In the optical fibre monitoring system, OTDR is used to test the optical fibre, and analyse the curves to locate the location of fault points, splice losses and fibre lengths. However, the event point cannot be determined automatically, and the curves need to be analysed, after which the type of various events in the optical fibre line can be accurately determined.</p>
</sec>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Fault Diagnosis Model of Communication Optical Fibre</title>
<sec id="s3_1">
<label>3.1</label>
<title>Variational Modal Decomposition</title>
<p>VMD (variational modal decomposition) is an adaptive signal decomposition method proposed by Dragomiretskiy et al. in 2014 [<xref ref-type="bibr" rid="ref-22">22</xref>]. The original signal sequence is decomposed into several &#x201C;intrinsic modal function&#x201D; by iteratively searching for the optimal solution of the modal under constraints, thus to determine the modal components&#x2019; central frequency and finite bandwidth. The algorithm consists of two main steps.</p>
<sec id="s3_1_1">
<label>3.1.1</label>
<title>Construct Variational Constraint Problem</title>
<p>Assume that VMD decomposes the original signal <italic>f</italic>(<italic>t</italic>) to obtain <bold><italic>K</italic></bold> modal components, it is necessary to minimise the sum of the finite bandwidths of each modal component while ensuring that all modal components <italic>u</italic><sub><italic>k</italic></sub>(<italic>t</italic>) are added up to <italic>f</italic>(<italic>t</italic>).</p>
<p>For each modal component <italic>u</italic><sub><italic>k</italic></sub>(<italic>t</italic>), its one-sided spectrum is obtained by Hilbert transform and converted to the fundamental band by an estimated central frequency <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:msup><mml:mrow><mml:mtext>e</mml:mtext></mml:mrow><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>j</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula>:</p>
<p><disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03B4;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mfrac><mml:mi>j</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03C0;</mml:mi></mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:mfrac><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:msup><mml:mrow><mml:mtext>e</mml:mtext></mml:mrow><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>j</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msup></mml:math></disp-formula></p>
<p>The finite bandwidth of the modal component <italic>u</italic><sub><italic>k</italic></sub>(<italic>t</italic>) is estimated by squaring the norm of the gradient of the fundamental band above. The expression for the variational constraint problem is:</p>
<p><disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:munder><mml:mo form="prefix">min</mml:mo><mml:mrow><mml:mrow><mml:mo>{</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>}</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:munder><mml:mrow><mml:mo>{</mml:mo><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:munder><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03B4;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mi>j</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03C0;</mml:mi></mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:msup><mml:mrow><mml:mtext>e</mml:mtext></mml:mrow><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>j</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>}</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>s</mml:mi><mml:mo>.</mml:mo><mml:mi>t</mml:mi><mml:mo>.</mml:mo><mml:munder><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:munder><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>f</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula></p>
</sec>
<sec id="s3_1_2">
<label>3.1.2</label>
<title>Solve Variational Constraint Problems</title>
<p>Introduct the Lagrangian operator <italic>&#x03BB;</italic>(<italic>t</italic>) and the quadratic penalty factor <bold><italic>&#x03B1;</italic></bold>, the constrained problem is transformed into an unconstrained problem, and the expression becomes:</p>
<p><disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd><mml:mi>L</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>}</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>}</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi>&#x03BB;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mi></mml:mi><mml:mo>=</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:munder><mml:msubsup><mml:mrow><mml:mo symmetric="true">&#x2016;</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03B4;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mfrac><mml:mi>j</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03C0;</mml:mi></mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:mfrac><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:msup><mml:mrow><mml:mtext>e</mml:mtext></mml:mrow><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>j</mml:mi><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msup><mml:mo symmetric="true">&#x2016;</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup></mml:mtd></mml:mtr><mml:mtr><mml:mtd /><mml:mtd><mml:mi></mml:mi><mml:mspace width="1em" /><mml:mo>+</mml:mo><mml:msubsup><mml:mrow><mml:mo symmetric="true">&#x2016;</mml:mo><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:munder><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo symmetric="true">&#x2016;</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:mrow><mml:mo>&#x27E8;</mml:mo><mml:mi>&#x03BB;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:munder><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x27E9;</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>Update and iterating <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:msubsup><mml:mrow><mml:mover><mml:mi>u</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:mi>w</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:msubsup><mml:mi>w</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:mi>w</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> by the alternating direction method of the multiplicative operator, and the expressions are as follows:<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:msubsup><mml:mrow><mml:mover><mml:mi>u</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:mi>w</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mrow><mml:mover><mml:mi>f</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>w</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2260;</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:munder><mml:msub><mml:mrow><mml:mover><mml:mi>u</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>w</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mrow><mml:mover><mml:mi>&#x03BB;</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>w</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:mfrac></mml:mstyle></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mn>2</mml:mn><mml:mi>&#x03B1;</mml:mi><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>w</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p><disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:msubsup><mml:mi>w</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:mi>w</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msubsup><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x221E;</mml:mi></mml:mrow></mml:msubsup><mml:mi>w</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>u</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>w</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:msup><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mi>d</mml:mi><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:msubsup><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x221E;</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>u</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>w</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:msup><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mi>d</mml:mi><mml:mi>w</mml:mi></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
</sec>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Fuzzy Entropy Algorithm</title>
<p>The fuzzy entropy (FE) reflects the slight variations between modal components (IMF) and thus characterises the subtle differences between different OTDR curves. For a certain IMF sequence <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:mi>X</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mi>x</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi><mml:mo>}</mml:mo></mml:mrow></mml:math></inline-formula>, set the number of embedded modes to <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:mi>m</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>m</mml:mi><mml:mo>&#x2264;</mml:mo><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>2</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, the fuzzy entropy is calculated as follows:</p>
<fig id="fig-13">
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_29295-fig-13.tif"/>
</fig>
<p>Through the above steps, the fuzzy entropy values of different IMF components of optical fibre OTDR signals are extracted, and the arranged entropy sequences are taken as the feature vectors of optical fibre signals and as the inputs of the subsequent clustering algorithm.</p>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Fuzzy Clustering Algorithm</title>
<p>Fuzzy clustering (FC) is a division-based clustering idea that takes a series of samples of an unknown class and divides them into subsets according to rules that maximise the similarity of objects in the same cluster and minimise the similarity between different clusters. The main steps of the algorithm implementation are as follows:</p>
<sec id="s3_3_1">
<label>3.3.1</label>
<title>Build the Fuzzy Matrix X</title>
<p>Denote <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:mi>X</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>}</mml:mo></mml:mrow></mml:math></inline-formula> as the set of <bold><italic>n</italic></bold> data to be measured and each data <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> as an m-dimensional feature vector. Then the fuzzy matrix can be constructed as:</p>
<p><disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mtable columnalign="center center center center" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>11</mml:mn></mml:mrow></mml:msub></mml:mtd><mml:mtd><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>12</mml:mn></mml:mrow></mml:msub></mml:mtd><mml:mtd><mml:mo>&#x22EF;</mml:mo></mml:mtd><mml:mtd><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>21</mml:mn></mml:mrow></mml:msub></mml:mtd><mml:mtd><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>22</mml:mn></mml:mrow></mml:msub></mml:mtd><mml:mtd><mml:mo>&#x22EF;</mml:mo></mml:mtd><mml:mtd><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mi>m</mml:mi></mml:mrow></mml:msub></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:mtd><mml:mo>&#x22EE;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mtd><mml:mtd><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mtd><mml:mtd><mml:mo>&#x22EF;</mml:mo></mml:mtd><mml:mtd><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>Maximum value specification for <bold><italic>X</italic></bold></p>
<p><disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msub><mml:mi>M</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mo movablelimits="true" form="prefix">max</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mi></mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>M</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mfrac></mml:mstyle></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula></p>
</sec>
<sec id="s3_3_2">
<label>3.3.2</label>
<title>Establish the Fuzzy Similarity Matrix R</title>
<p>By using a similarity coefficient to measure the similarity between samples, the fuzzy similarity matrix <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:mi>R</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is calculated as follows:</p>
<p><disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2227;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2228;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
</sec>
<sec id="s3_3_3">
<label>3.3.3</label>
<title>Establish the Fuzzy Equivalence Matrix <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow></mml:msup></mml:math></inline-formula></title>
<p>The matrix obtained in <xref ref-type="disp-formula" rid="eqn-9">Eq. (9)</xref> is not transitive. The transitive closure method is used to calculate the fuzzy equivalence matrix from the matrix <bold><italic>R</italic>.</bold> Compute <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mn>8</mml:mn></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo></mml:math></inline-formula>. When the formula <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> is valid for any natural number <bold><italic>l</italic></bold> greater than <bold><italic>k</italic></bold>, <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:mi>t</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>R</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> is denoted as transitive closure and taken as fuzzy equivalence matrix <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow></mml:msup></mml:math></inline-formula>.</p>
</sec>
<sec id="s3_3_4">
<label>3.3.4</label>
<title>Generate the Dynamic Clustering Map</title>
<p>Calculate the <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:mi>&#x03BB;</mml:mi></mml:math></inline-formula>&#x2212;cut matrix of the fuzzy equivalence matrix <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow></mml:msup></mml:math></inline-formula>, and the calculation process is as follows:</p>
<p><disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03BB;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mn>1</mml:mn><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2265;</mml:mo><mml:mi>&#x03BB;</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>&#x003C;</mml:mo><mml:mi>&#x03BB;</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>Select each column element of behavior 1 in the Boolean matrix, and its corresponding samples should be clustered into a class. Clustering results will be different when <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:mi>&#x03BB;</mml:mi></mml:math></inline-formula> takes different values. With the gradual decrease of <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:mi>&#x03BB;</mml:mi></mml:math></inline-formula>, the number of cluster types will decrease correspondingly, resulting in a dynamic clustering map.</p>
</sec>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Fault Diagnosis Model of Communication Optical Fibre</title>
<p>Communication optical fibre has been widely used in various industries today, and fault diagnosis of communication optical fibre can effectively improve manual maintenance. In this paper, we propose a fuzzy entropy algorithm based on variational modal decomposition to extract the features of the optical fibre OTDR curves, and then use fuzzy clustering to diagnose its state. The flows of the algorithm are shown in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Flow chart of communication optical fibre fault diagnosis</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_29295-fig-4.tif"/>
</fig>
<sec id="s4_1">
<label>4.1</label>
<title>Signal Acquisition</title>
<p>The selection of wavelength is very important in the OTDR curve test. The signal wavelength in optical fibre communication is 1310 or 1550 nm. According to the theory of Rayleigh scattering, the power of Rayleigh scattering is related to the wavelength of the transmitted laser signal. The power is weaker if the wavelength is longer, and vice versa. The backscattering power of the 1550 nm laser signal is weaker than that of the 1310 nm signal. Rayleigh scattering will be reduced at a high wavelength, but infrared attenuation will occur at a high wavelength, which will lead to an increase in the attenuation value of the whole fibre. Therefore, 1550 nm is the lowest attenuation wavelength, so 1550 nm was selected as the test signal wavelength. In <xref ref-type="fig" rid="fig-5">Fig. 5</xref>, the field staff is collecting optical fibre OTDR data.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Optical fibre OTDR curve acquisition</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_29295-fig-5.tif"/>
</fig>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Feature Vector Extraction</title>
<p>Perform VMD on the collected data samples, where the decomposition level <bold><italic>K</italic></bold> is set to 5, the penalty factor <bold><italic>&#x03B1;</italic></bold> is set to 2000, and the rest are the default values. The 5 IMF components are obtained by VMD, then the fuzzy entropy algorithm is used to extract the FE of each IMF component, and the aligned FEs are used as the feature vector of this sample. Taking the OTDR curve when the optical fibre had broken as an example, the VMD was performed on it to obtain the IMF components, as shown in <xref ref-type="fig" rid="fig-6">Fig. 6</xref>.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>IMF components of OTDR curve when optical fibre had broken</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_29295-fig-6.tif"/>
</fig>
</sec>
<sec id="s4_3">
<label>4.3</label>
<title>Fault Diagnosis</title>
<p>Take the OTDR curves of typical fault optical fibre diagnosed by experts on-site as the sample set, after feature vector extraction, combine the curves to be tested to build a fuzzy matrix, then the fuzzy clustering algorithm is used to cluster them to generate a dynamic clustering map, so as to realize the matching clustering between the curves to be tested and their corresponding fault types, and finally realize the fault diagnosis of communication optical fibre. When the dynamic clustering map clusters the different fault types in the sample set into the same class, the situation is considered a misclassification. In this case, experts need to carry out on-site diagnosis. If there are the unknown type of faults in the curves to be tested, the curves will be recorded for the update of the sample set in the future.</p>
</sec>
<sec id="s4_4">
<label>4.4</label>
<title>Fault Summary</title>
<p>When an unknown fault occurs, the fault information, including the burial environment of the faulty fibre, the deformation of the fibre and the OTDR curve of the faulty fibre, is collected to analyze the correlation between it and the cause of the fault. For OTDR curve data that have been grouped into fault types, we will select the most representative ones to be added to the standard sample set so that they can be accurately identified when similar faults occur in the future.</p>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Model Validation and Analysis</title>
<p>To verify the feasibility of the model, OTDR fault curves collected randomly from the site were selected as an example, and each curve was processed with a maximum of 900 sampling points, as shown in <xref ref-type="fig" rid="fig-7">Fig. 7</xref>. The signal in curve <bold><italic>d</italic></bold><sub><bold>0</bold></sub> has a cliff drop subsequent to no signal response, so first the fibre connection and the model of the fibre connector are checked, then the connector is cleaned. If the fault is still not eliminated, check whether it is the same type of fault as <bold><italic>f</italic></bold><sub><bold>1</bold></sub>. Curve <bold><italic>d</italic></bold><sub><bold>1</bold></sub> in the last slope point, after the slope of the curve is significantly greater than the slope of the curve in the previous section, there is an abnormal optical power drop, after repair found that the fibre bending angle is large, and <bold><italic>f</italic></bold><sub><bold>2</bold></sub> for the same type of fault.</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>OTDR curves of optical fibre to be tested</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_29295-fig-7.tif"/>
</fig>
<p>Feature vector extraction for curves <bold><italic>d</italic></bold><sub><bold>0</bold></sub> and <bold><italic>d</italic></bold><sub><bold>1</bold></sub> is performed. Firstly, different IMF components are obtained through VMD, as shown in <xref ref-type="fig" rid="fig-8">Fig. 8</xref>.</p>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>IMF components of OTDR curves of optical fibre to be tested</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_29295-fig-8.tif"/>
</fig>
<p>The FEs of the components IMF1&#x007E;IMF5 are extracted and then they are arranged to obtain the feature vector. At the same time, the OTDR curve of typical fault optical fibre verified by experts is taken as a comparison, and the feature vector library is established, as shown in <xref ref-type="table" rid="table-1">Table 1</xref>.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Optical fibre feature vector library</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>OTDR curve</th>
<th>FE1</th>
<th>FE2</th>
<th>FE3</th>
<th>FE4</th>
<th>FE5</th>
</tr>
</thead>
<tbody>
<tr>
<td><bold><italic>f</italic></bold><sub><bold>1</bold></sub></td>
<td>0.7555</td>
<td>0.7795</td>
<td>0.7270</td>
<td>0.3896</td>
<td>0.3293</td>
</tr>
<tr>
<td><bold><italic>d</italic></bold><sub><bold>0</bold></sub></td>
<td>0.7774</td>
<td>0.7567</td>
<td>0.7489</td>
<td>0.3424</td>
<td>0.2710</td>
</tr>
<tr>
<td><bold><italic>f</italic></bold><sub><bold>2</bold></sub></td>
<td>0.7681</td>
<td>0.8092</td>
<td>0.6208</td>
<td>0.4037</td>
<td>0.1159</td>
</tr>
<tr>
<td><bold><italic>d</italic></bold><sub><bold>1</bold></sub></td>
<td>0.8268</td>
<td>0.7958</td>
<td>0.6499</td>
<td>0.4396</td>
<td>0.1614</td>
</tr>
<tr>
<td><bold><italic>f</italic></bold><sub><bold>3</bold></sub></td>
<td>0.8587</td>
<td>0.6332</td>
<td>0.4802</td>
<td>0.4281</td>
<td>0.2368</td>
</tr>
<tr>
<td><bold><italic>f</italic></bold><sub><bold>4</bold></sub></td>
<td>0.8354</td>
<td>0.7588</td>
<td>0.5801</td>
<td>0.4426</td>
<td>0.0362</td>
</tr>
<tr>
<td><bold><italic>f</italic></bold><sub><bold>5</bold></sub></td>
<td>0.7008</td>
<td>0.8302</td>
<td>0.8105</td>
<td>0.5031</td>
<td>0.4058</td>
</tr>
<tr>
<td><bold><italic>f</italic></bold><sub><bold>0</bold></sub></td>
<td>0.8199</td>
<td>0.6234</td>
<td>0.5944</td>
<td>0.3704</td>
<td>0.1913</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>In the experimental part of this paper, eight data are selected for fuzzy clustering, which contains typical fault curves commonly found in the field and also ensures fault diagnosis at a faster rate. The feature vector matrix is constructed according to <xref ref-type="table" rid="table-1">Table 1</xref>, the steps in <xref ref-type="disp-formula" rid="eqn-8">Eq. (8)</xref> are taken and the feature vector matrix to get the fuzzy matrix <bold><italic>X</italic></bold> is standardized:</p>

<p><disp-formula id="ueqn-11"><mml:math id="mml-ueqn-11" display="block"><mml:mi>X</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mtable columnalign="center center center center center" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mn>0.8799</mml:mn></mml:mtd><mml:mtd><mml:mn>0.9389</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8970</mml:mn></mml:mtd><mml:mtd><mml:mn>0.7744</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8113</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0.9053</mml:mn></mml:mtd><mml:mtd><mml:mn>0.9114</mml:mn></mml:mtd><mml:mtd><mml:mn>0.9240</mml:mn></mml:mtd><mml:mtd><mml:mn>0.6806</mml:mn></mml:mtd><mml:mtd><mml:mn>0.6678</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0.8946</mml:mn></mml:mtd><mml:mtd><mml:mn>0.9747</mml:mn></mml:mtd><mml:mtd><mml:mn>0.7659</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8023</mml:mn></mml:mtd><mml:mtd><mml:mn>0.2855</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0.9629</mml:mn></mml:mtd><mml:mtd><mml:mn>0.9586</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8018</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8738</mml:mn></mml:mtd><mml:mtd><mml:mn>0.3977</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>1</mml:mn></mml:mtd><mml:mtd><mml:mn>0.7627</mml:mn></mml:mtd><mml:mtd><mml:mn>0.5925</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8508</mml:mn></mml:mtd><mml:mtd><mml:mn>0.5834</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0.9729</mml:mn></mml:mtd><mml:mtd><mml:mn>0.9139</mml:mn></mml:mtd><mml:mtd><mml:mn>0.7157</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8797</mml:mn></mml:mtd><mml:mtd><mml:mn>0.0893</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0.8161</mml:mn></mml:mtd><mml:mtd><mml:mn>1</mml:mn></mml:mtd><mml:mtd><mml:mn>1</mml:mn></mml:mtd><mml:mtd><mml:mn>1</mml:mn></mml:mtd><mml:mtd><mml:mn>1</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0.9549</mml:mn></mml:mtd><mml:mtd><mml:mn>0.7508</mml:mn></mml:mtd><mml:mtd><mml:mn>0.7334</mml:mn></mml:mtd><mml:mtd><mml:mn>0.7361</mml:mn></mml:mtd><mml:mtd><mml:mn>0.4713</mml:mn></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>The <bold> <italic>X</italic></bold> is Processed according to <xref ref-type="disp-formula" rid="eqn-9">Eq. (9)</xref> to obtain the fuzzy similarity matrix <bold><italic>R</italic></bold>:</p>
<p><disp-formula id="ueqn-12"><mml:math id="mml-ueqn-12" display="block"><mml:mi>R</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mtable columnalign="center center center center center center center center" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mn>1</mml:mn></mml:mtd><mml:mtd><mml:mn>0.9271</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8321</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8422</mml:mn></mml:mtd><mml:mtd><mml:mn>0.7988</mml:mn></mml:mtd><mml:mtd><mml:mn>0.7496</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8684</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8160</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0.9271</mml:mn></mml:mtd><mml:mtd><mml:mn>1</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8278</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8427</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8095</mml:mn></mml:mtd><mml:mtd><mml:mn>0.7577</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8154</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8444</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0.8321</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8278</mml:mn></mml:mtd><mml:mtd><mml:mn>1</mml:mn></mml:mtd><mml:mtd><mml:mn>0.9242</mml:mn></mml:mtd><mml:mtd><mml:mn>0.7995</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8807</mml:mn></mml:mtd><mml:mtd><mml:mn>0.7446</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8567</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0.8422</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8427</mml:mn></mml:mtd><mml:mtd><mml:mn>0.9242</mml:mn></mml:mtd><mml:mtd><mml:mn>1</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8457</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8865</mml:mn></mml:mtd><mml:mtd><mml:mn>0.7754</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8782</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0.7988</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8095</mml:mn></mml:mtd><mml:mtd><mml:mn>0.7995</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8457</mml:mn></mml:mtd><mml:mtd><mml:mn>1</mml:mn></mml:mtd><mml:mtd><mml:mn>0.7986</mml:mn></mml:mtd><mml:mtd><mml:mn>0.7211</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8919</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0.7496</mml:mn></mml:mtd><mml:mtd><mml:mn>0.7577</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8807</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8865</mml:mn></mml:mtd><mml:mtd><mml:mn>0.7986</mml:mn></mml:mtd><mml:mtd><mml:mn>1</mml:mn></mml:mtd><mml:mtd><mml:mn>0.6867</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8176</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0.8684</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8154</mml:mn></mml:mtd><mml:mtd><mml:mn>0.7446</mml:mn></mml:mtd><mml:mtd><mml:mn>0.7754</mml:mn></mml:mtd><mml:mtd><mml:mn>0.7211</mml:mn></mml:mtd><mml:mtd><mml:mn>0.6867</mml:mn></mml:mtd><mml:mtd><mml:mn>1</mml:mn></mml:mtd><mml:mtd><mml:mn>0.7079</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0.8160</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8444</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8567</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8782</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8919</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8176</mml:mn></mml:mtd><mml:mtd><mml:mn>0.7079</mml:mn></mml:mtd><mml:mtd><mml:mn>1</mml:mn></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>The square of <bold><italic>R</italic></bold> is calculated by using the transfer closure method until two identical terms appeared, and took it as the fuzzy equivalence matrix <bold><italic>R</italic></bold>&#x002A;:<disp-formula id="ueqn-13"><mml:math id="mml-ueqn-13" display="block"><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mtable columnalign="center center center center center center center center" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mn>1</mml:mn></mml:mtd><mml:mtd><mml:mn>0.9271</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8444</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8444</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8444</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8444</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8684</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8444</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0.9271</mml:mn></mml:mtd><mml:mtd><mml:mn>1</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8444</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8444</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8444</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8444</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8684</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8444</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0.8444</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8444</mml:mn></mml:mtd><mml:mtd><mml:mn>1</mml:mn></mml:mtd><mml:mtd><mml:mn>0.9242</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8782</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8865</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8444</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8782</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0.8444</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8444</mml:mn></mml:mtd><mml:mtd><mml:mn>0.9242</mml:mn></mml:mtd><mml:mtd><mml:mn>1</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8782</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8865</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8444</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8782</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0.8444</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8444</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8782</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8782</mml:mn></mml:mtd><mml:mtd><mml:mn>1</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8782</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8444</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8919</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0.8444</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8444</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8865</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8865</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8782</mml:mn></mml:mtd><mml:mtd><mml:mn>1</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8444</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8782</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0.8684</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8684</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8444</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8444</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8444</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8444</mml:mn></mml:mtd><mml:mtd><mml:mn>1</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8444</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0.8444</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8444</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8782</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8782</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8919</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8782</mml:mn></mml:mtd><mml:mtd><mml:mn>0.8444</mml:mn></mml:mtd><mml:mtd><mml:mn>1</mml:mn></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>The <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:mi>&#x03BB;</mml:mi></mml:math></inline-formula>&#x2212;cut matrix of the fuzzy equivalence matrix <bold><italic>R</italic></bold>&#x002A; is calculated to get the dynamic clustering map as it increased, as shown in <xref ref-type="fig" rid="fig-9">Fig. 9</xref>. The number on the curve was the value of the confidence factor <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:mi>&#x03BB;</mml:mi></mml:math></inline-formula>. When <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:mi>&#x03BB;</mml:mi></mml:math></inline-formula> &#x003D; 0.9242, curve <bold><italic>d</italic></bold><sub><bold>0</bold></sub> to be tested and curves <bold><italic>f</italic></bold><sub><bold>1</bold></sub> were grouped into the same class, curve <bold><italic>d</italic></bold><sub><bold>1</bold></sub> to be tested and curves <bold><italic>f</italic></bold><sub><bold>2</bold></sub> were grouped into the same class, and other curves were grouped into the same class. Clustering results were consistent with the field detection results.</p>
<fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>Clustering results</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_29295-fig-9.tif"/>
</fig>
</sec>
<sec id="s6">
<label>6</label>
<title>Model Comparison</title>
<p>To verify the effectiveness of using VMD-FE for OTDR feature extraction of communication optical fibre, four common feature extraction models, EMD-FE, LMD-FE, VMD-PE and VMD-SE, were selected and compared in this paper. The clustering results are shown in <xref ref-type="fig" rid="fig-10">Fig. 10</xref>. Only the VMD-PE clustering result is correct, but when <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:mi>&#x03BB;</mml:mi></mml:math></inline-formula> &#x003D; 0.9295, the curve <bold><italic>f</italic></bold><sub><bold>3</bold></sub> is grouped with <bold><italic>f</italic></bold><sub><bold>2</bold></sub> and <bold><italic>d</italic></bold><sub><bold>1</bold></sub>.</p>
<fig id="fig-10">
<label>Figure 10</label>
<caption>
<title>Clustering results using different feature extraction models: (a) EMD-FE; (b) LMD-FE; (c)&#x2002;VMD-PE; (d) VMD-SE</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_29295-fig-10.tif"/>
</fig>
<p>To test the accuracy of the above models in the fault diagnosis of communication optical fibre, 50 sets of data collected on-site were selected for fault diagnosis experiments. Each set of data consisted of 8 curves with the fault type already detected, and the fault type distribution is shown in <xref ref-type="fig" rid="fig-11">Fig. 11</xref>. The experimental accuracy of each model is shown in <xref ref-type="table" rid="table-2">Table 2</xref>. The results show that the feature extraction model proposed in this paper is superior to the other four models.</p>
<fig id="fig-11">
<label>Figure 11</label>
<caption>
<title>Fault type distribution diagram</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_29295-fig-11.tif"/>
</fig><table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Diagnostic accuracy of different feature extraction models</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Model type</th>
<th>Model 1</th>
<th>Model 2</th>
<th>Model 3</th>
<th>Model 4</th>
<th>Model 5</th>
</tr>
</thead>
<tbody>
<tr>
<td>Structure</td>
<td>EMD-FE</td>
<td>LMD-FE</td>
<td>VMD-FE</td>
<td>VMD-PE</td>
<td>VMD-SE</td>
</tr>
<tr>
<td>Accuracy</td>
<td>82.5%</td>
<td>85%</td>
<td>95%</td>
<td>90%</td>
<td>82.5%</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Fault type 1: the optical fibre breaks and the breakpoint is too close to the test point; Fault type 2: the bending angle of the optical fibre is too large to produce bending loss; Fault type 3: the optical fibre breaks; Fault type 4: poor manufacturing quality of optical fibre end; Fault type 5: the bending radius of the optical fibre is too small.</p>
<p>At the same time, this paper compared it with four common classifiers, SVM, DNN, CNN and LSTM. The result of classification using SVM is shown in <xref ref-type="fig" rid="fig-12">Fig. 12</xref>. The experimental accuracy of each model is shown in <xref ref-type="table" rid="table-3">Table 3</xref>. The results show that the traditional machine learning algorithms are unsuitable for communication fibre optical due to their demand for a certain number of training samples, which are not easily accessible to fault data. Also, direct clustering of the raw data is not ideal, as the fault data may contain minute features.</p>
<fig id="fig-12">
<label>Figure 12</label>
<caption>
<title>SVM clustering results</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_29295-fig-12.tif"/>
</fig><table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>Diagnostic accuracy of different classifiers</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Model type</th>
<th>Model 5</th>
<th>Model 6</th>
<th>Model 7</th>
<th>Model 8</th>
</tr>
</thead>
<tbody>
<tr>
<td>Structure</td>
<td>SVM</td>
<td>DNN</td>
<td>CNN</td>
<td>LSTM</td>
</tr>
<tr>
<td>Accuracy</td>
<td>83.25%</td>
<td>80.25%</td>
<td>77.25%</td>
<td>85.25%</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s7">
<label>7</label>
<title>Conclusion</title>
<p><list list-type="order">
<list-item>
<p>To realize the fault diagnosis of communication optical fibre, combining with the typical fault optical fibre OTDR curves and the OTDR curves collected on-site, for the nonlinear and unstable characteristics of the curves, variational modal decomposition and fuzzy entropy algorithm were combined for the feature extraction of OTDR curve. According to the feature vector library, to build the fuzzy matrix, use the fuzzy clustering algorithm to generate a dynamic clustering map. With the change of confidence factor, the optical fibre of the same fault type can be gathered together.</p></list-item>
<list-item>
<p>Considering the situation of sparse optical fibre fault data, the VMD-FE-FC communication optical fibre fault diagnosis model proposed in this paper can effectively achieve optical fibre fault diagnosis due to its small sample and no training characteristics, which can help reduce the maintenance cost of communication optical fibre and improve the efficiency of field staff to overhaul optical fibre equipment.</p></list-item>
<list-item>
<p>Due to the complexity and diversity of factors such as the environment in which the optical cables is buried and the length of optical cables in the actual situation, it is necessary to take the optical fibres with similar situations as the clustering objects in the faults diagnosis of communication fibre. At the same time, there are various causes of fibre optical communication failures. It is impossible to make accurate judgments on all the failures that occur, so when there are unknown failures in fibre optical communication, the curve data and the actual situation must be summarized and organized. Then the corresponding maintenance process and troubleshooting measures are recorded. It can narrow the troubleshooting scope and improve the efficiency of troubleshooting.</p></list-item>
</list></p>
</sec>
</body>
<back>
<ack><p>This paper does not have an author&#x2019;s Acknowledgement.</p></ack>
<sec><title>Funding Statement</title>
<p>This paper is supported by State Grid Gansu Electric Power Company Science and Technology Project (20220515003).</p></sec>
<sec><title>Author Contributions</title>
<p>The authors confirm contribution to the paper as follows: study conception and design: Xiangqun Li; data collection: Jianpeng Sun, Bo Liu; analysis and interpretation of results: Jiawen Liang; draft manuscript preparation: Shengping Shi, Fangyu Ding. All authors reviewed the results and approved the final version of the manuscript.</p></sec>
<sec sec-type="data-availability"><title>Availability of Data and Materials</title>
<p>The data that support the findings of this study are available on request from the corresponding author, Li, upon reasonable request.</p></sec>
<sec sec-type="COI-statement"><title>Conflicts of Interest</title>
<p>The authors declare that they have no conflicts of interest to report regarding the present study.</p>
</sec>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>1.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Zin</surname>, <given-names>A. M.</given-names></string-name>, <string-name><surname>Bongsu</surname>, <given-names>M. S.</given-names></string-name>, <string-name><surname>Idrus</surname>, <given-names>S. M.</given-names></string-name>, <string-name><surname>Zulkifli</surname>, <given-names>N.</given-names></string-name></person-group> (<year>2010</year>). <article-title>An overview of radio-over-fiber network technology</article-title>. <conf-name>International Conference on Photonics</conf-name>, pp. <fpage>1</fpage>&#x2013;<lpage>3</lpage>. <publisher-loc>Langkawi, Malaysia</publisher-loc>.</mixed-citation></ref>
<ref id="ref-2"><label>2.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Chen</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Cai</surname>, <given-names>S.</given-names></string-name></person-group> (<year>2018</year>). <article-title>High power budget coherent free space optical communication system based on fiber laser phased array</article-title>. <conf-name>2018 Asia Communications and Photonics Conference (ACP)</conf-name>, pp. <fpage>1</fpage>&#x2013;<lpage>3</lpage>. <publisher-loc>Hangzhou, China</publisher-loc>.</mixed-citation></ref>
<ref id="ref-3"><label>3.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Zhou</surname>, <given-names>H. Y.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Long</surname>, <given-names>S. Y.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>R. C.</given-names></string-name></person-group> (<year>2015</year>). <article-title>A novel fiber with ultra-low-loss and large-effective-area for the next generation communication</article-title>. <conf-name>International Conference on Optical Communications and Networks</conf-name>, pp. <fpage>1</fpage>&#x2013;<lpage>3</lpage>. <publisher-loc>Nanjing, China</publisher-loc>.</mixed-citation></ref>
<ref id="ref-4"><label>4.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Law</surname>, <given-names>C. T.</given-names></string-name>, <string-name><surname>Bhattarai</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>David</surname>, <given-names>C. Y.</given-names></string-name></person-group> (<year>2008</year>). <article-title>Fiber-optics-based fault detection in power systems</article-title>. <source>IEEE Transactions on Power Delivery</source><italic>,</italic> <volume>23</volume><italic>(</italic><issue>3</issue><italic>),</italic> <fpage>1271</fpage>&#x2013;<lpage>1279</lpage>. <pub-id pub-id-type="doi">10.1109/TPWRD.2008.919233</pub-id></mixed-citation></ref>
<ref id="ref-5"><label>5.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Dou</surname>, <given-names>X. Y.</given-names></string-name>, <string-name><surname>Yin</surname>, <given-names>H. X.</given-names></string-name>, <string-name><surname>Hao</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Yue</surname>, <given-names>H. H.</given-names></string-name>, <string-name><surname>Qi</surname>, <given-names>X. Y.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2015</year>). <article-title>Demonstration of chaotic-laser based WDM-PON secure optical communication and real-time online fiber-fault detection and location</article-title>. <conf-name>Opto Electronics Communications Conference (OECC)</conf-name>, pp. <fpage>1</fpage>&#x2013;<lpage>3</lpage>. <publisher-loc>Shanghai, China</publisher-loc>.</mixed-citation></ref>
<ref id="ref-6"><label>6.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Abdelli</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Cho</surname>, <given-names>J. Y.</given-names></string-name>, <string-name><surname>Azendorf</surname>, <given-names>F.</given-names></string-name>, <string-name><surname>Griesser</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Tropschug</surname>, <given-names>C.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2022</year>). <article-title>Machine-learning- based anomaly detection in optical fiber monitoring</article-title>. <source>Journal of Optical Communications and Networking</source><italic>,</italic> <volume>14</volume><italic>(</italic><issue>5</issue><italic>),</italic> <fpage>365</fpage>&#x2013;<lpage>375</lpage>. <pub-id pub-id-type="doi">10.1364/JOCN.451289</pub-id></mixed-citation></ref>
<ref id="ref-7"><label>7.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Dou</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Yue</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Zhou</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Yin</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Wu</surname>, <given-names>C.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2014</year>). <article-title>A novel method of the fiber-link fault detection and location with multi-channel and multi-fiber based on chaotic light theory</article-title>. <conf-name>7th International Conference on Biomedical Engineering and Informatics</conf-name>, pp. <fpage>960</fpage>&#x2013;<lpage>964</lpage>. <publisher-loc>Dalian, China</publisher-loc>.</mixed-citation></ref>
<ref id="ref-8"><label>8.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Urban</surname>, <given-names>P. J.</given-names></string-name>, <string-name><surname>Getaneh</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>von der Weid</surname>, <given-names>J. P.</given-names>, </string-name>, <string-name><surname>Temporao</surname>, <given-names>G. P.</given-names></string-name>, <string-name><surname>Vall-Ilosera</surname>, <given-names>G.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2013</year>). <article-title>Detection of fiber faults in passive optical networks</article-title>. <source>Journal of Optical Communications and Networking</source><italic>,</italic> <volume>5</volume><italic>(</italic><issue>11</issue><italic>),</italic> <fpage>1111</fpage>&#x2013;<lpage>1121</lpage>. <pub-id pub-id-type="doi">10.1364/JOCN.5.001111</pub-id></mixed-citation></ref>
<ref id="ref-9"><label>9.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Qian</surname>, <given-names>H. M.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>Z. L.</given-names></string-name>, <string-name><surname>Ma</surname>, <given-names>J. C.</given-names></string-name></person-group> (<year>2008</year>). <article-title>Fiber optical gyro fault diagnosis based on wavelet transform and neural network</article-title>. <conf-name>IEEE/ASME International Conference on Mechatronic and Embedded Systems and Applications</conf-name>, pp. <fpage>608</fpage>&#x2013;<lpage>611</lpage>. <publisher-loc>Beijing, China</publisher-loc>.</mixed-citation></ref>
<ref id="ref-10"><label>10.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Chen</surname>, <given-names>M. M.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>M. J.</given-names></string-name>, <string-name><surname>Chen</surname>, <given-names>S. X.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>J. G.</given-names></string-name>, <string-name><surname>Yan</surname>, <given-names>S. L.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2020</year>). <article-title>Health monitoring of long-haul fiber communication system using chaotic OTDR</article-title>. <source>China Communications</source><italic>,</italic> <volume>17</volume><italic>(</italic><issue>5</issue><italic>),</italic> <fpage>1</fpage>&#x2013;<lpage>11</lpage>. <pub-id pub-id-type="doi">10.23919/JCC.2020.05.001</pub-id></mixed-citation></ref>
<ref id="ref-11"><label>11.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Dong</surname>, <given-names>X. Y.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>A. B.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>J. G.</given-names></string-name>, <string-name><surname>Han</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Zhao</surname>, <given-names>T.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2015</year>). <article-title>Combined attenuation and high-resolution fault measurements using chaos-OTDR</article-title>. <source>IEEE Photonics Journal</source><italic>,</italic> <volume>7</volume><italic>(</italic><issue>6</issue><italic>),</italic> <fpage>6</fpage>. <pub-id pub-id-type="doi">10.1109/JPHOT.2015.2501650</pub-id></mixed-citation></ref>
<ref id="ref-12"><label>12.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Feng</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Qiu</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Wei</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Li</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Liu</surname>, <given-names>G. N.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2009</year>). <article-title>Coherent OTDR used for fibre faults detection</article-title>. <conf-name>2009 Asia Communications and Photonics Conference and Exhibition (ACP)</conf-name>, pp. <fpage>1</fpage>&#x2013;<lpage>5</lpage>. <publisher-loc>Shanghai, China</publisher-loc>.</mixed-citation></ref>
<ref id="ref-13"><label>13.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>El-Sayed</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Ibrahim</surname>, <given-names>P. J.</given-names></string-name>, <string-name><surname>Gunzer</surname>, <given-names>F.</given-names></string-name></person-group> (<year>2010</year>). <article-title>Investigation of the precision regarding fiber fault location with a commercial optical time domain reflectometer</article-title>. <conf-name>7th International Symposium on High-Capacity Optical Networks and Enabling Technologies</conf-name>, pp. <fpage>237</fpage>&#x2013;<lpage>241</lpage>. <publisher-loc>Cairo, Egypt</publisher-loc>.</mixed-citation></ref>
<ref id="ref-14"><label>14.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Lalam</surname>, <given-names>N.</given-names></string-name>, <string-name><surname>Westbrook</surname>, <given-names>P. S.</given-names></string-name>, <string-name><surname>Li</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Lu</surname>, <given-names>P.</given-names></string-name>, <string-name><surname>Buric</surname>, <given-names>M. P.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Phase-sensitive optical time domain reflectometry with Rayleigh enhanced optical fiber</article-title>. <source>IEEE Access</source><italic>,</italic> <volume>9</volume><italic>,</italic> <fpage>114428</fpage>&#x2013;<lpage>114434</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2021.3105334</pub-id></mixed-citation></ref>
<ref id="ref-15"><label>15.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Zhang</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Liu</surname>, <given-names>R.</given-names></string-name></person-group> (<year>2009</year>). <article-title>Application of wavelet analysis technique in the faults diagnosis of optical fiber fusion</article-title>. <conf-name>International Conference on Wireless Networks and Information Systems</conf-name>, pp. <fpage>226</fpage>&#x2013;<lpage>229</lpage>. <publisher-loc>Shanghai, China</publisher-loc>.</mixed-citation></ref>
<ref id="ref-16"><label>16.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Gu</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Sablatash</surname>, <given-names>M.</given-names></string-name></person-group> (<year>1994</year>). <article-title>Estimation and detection in OTDR using analyzing wavelets</article-title>. <conf-name>Proceedings of IEEE-SP International Symposium on Time-Frequency and Time-Scale Analysis</conf-name>, pp. <fpage>353</fpage>&#x2013;<lpage>356</lpage>. <publisher-loc>Philadelphia, USA</publisher-loc>, <publisher-name>IEEE</publisher-name>.</mixed-citation></ref>
<ref id="ref-17"><label>17.</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Shan</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Liu</surname>, <given-names>Y. J.</given-names></string-name>, <string-name><surname>Guan</surname>, <given-names>F. J.</given-names></string-name></person-group> (<year>2015</year>). <chapter-title>The Application of BP neural network algorithm in optical fiber fault diagnosis</chapter-title>. <source>International Symposium Distributed Computing and Applications Business Engineering and Science</source>, pp. <fpage>509</fpage>&#x2013;<lpage>512</lpage>. <publisher-loc>Guiyang, China</publisher-loc>.</mixed-citation></ref>
<ref id="ref-18"><label>18.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Chen</surname>, <given-names>B. J.</given-names></string-name>, <string-name><surname>Chen</surname>, <given-names>X. F.</given-names></string-name>, <string-name><surname>He</surname>, <given-names>Z. J.</given-names></string-name>, <string-name><surname>Tan</surname>, <given-names>J. Y.</given-names></string-name></person-group> (<year>2009</year>). <article-title>Mechanical fault diagnosis based on local mean decomposition method</article-title>. <conf-name>International Conference on Measuring Technology and Mechatronics Automation</conf-name>, <publisher-loc>Zhangjiajie, China</publisher-loc>.</mixed-citation></ref>
<ref id="ref-19"><label>19.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yu</surname>, <given-names>J. B.</given-names></string-name>, <string-name><surname>Lv</surname>, <given-names>J. X.</given-names></string-name></person-group> (<year>2017</year>). <article-title>Weak fault feature extraction of rolling bearings using local mean decomposition-based multilayer hybrid denoising</article-title>. <source>IEEE Transactions on Instrumentation and Measurement</source><italic>,</italic> <volume>66</volume><italic>(</italic><issue>12</issue><italic>),</italic> <fpage>3148</fpage>&#x2013;<lpage>3159</lpage>. <pub-id pub-id-type="doi">10.1109/TIM.2017.2751878</pub-id></mixed-citation></ref>
<ref id="ref-20"><label>20.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Liu</surname>, <given-names>S. Y.</given-names></string-name>, <string-name><surname>Dong</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Liao</surname>, <given-names>X. Z.</given-names></string-name>, <string-name><surname>Cao</surname>, <given-names>X. D.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>X. X.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2019</year>). <article-title>Application of the variational mode decomposition-based time and time-frequency domain analysis on series DC Arc fault detection of photovoltaic arrays</article-title>. <source>IEEE Access</source><italic>,</italic> <volume>7</volume><italic>,</italic> <fpage>126177</fpage>&#x2013;<lpage>126190</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2019.2938979</pub-id></mixed-citation></ref>
<ref id="ref-21"><label>21.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Zhang</surname>, <given-names>H. P.</given-names></string-name>, <string-name><surname>He</surname>, <given-names>H. Y.</given-names></string-name>, <string-name><surname>Gu</surname>, <given-names>M. X.</given-names></string-name></person-group> (<year>2014</year>). <article-title>Research of fiber-optical fault diagnosis based on support vector machine (SVM) mining</article-title>. <conf-name>5th International Conference on Intelligent Systems Design and Engineering Applications (ISDEA)</conf-name>, pp. <fpage>803</fpage>&#x2013;<lpage>807</lpage>. <publisher-loc>Zhangjiajie, China</publisher-loc>.</mixed-citation></ref>
<ref id="ref-22"><label>22.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Dragomiretskiy</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Zosso</surname>, <given-names>D.</given-names></string-name></person-group> (<year>2014</year>). <article-title>Variational mode decomposition</article-title>. <source>IEEE Transactions on Signal Processing</source><italic>,</italic> <volume>62</volume><italic>(</italic><issue>3</issue><italic>),</italic> <fpage>531</fpage>&#x2013;<lpage>544</lpage>. <pub-id pub-id-type="doi">10.1109/TSP.2013.2288675</pub-id></mixed-citation></ref>
</ref-list>
</back></article>