亚洲免费av电影一区二区三区,日韩爱爱视频,51精品视频一区二区三区,91视频爱爱,日韩欧美在线播放视频,中文字幕少妇AV,亚洲电影中文字幕,久久久久亚洲av成人网址,久久综合视频网站,国产在线不卡免费播放

        ?

        Improved de-interleaving algorithm of radar pulses based on dual fuzzy vigilance ART

        2020-04-28 13:06:42JIANGWenFUXiongjunandCHANGJiayun

        JIANG Wen,FU Xiongjun,and CHANG Jiayun

        School of Information and Electronics,Beijing Institute of Technology,Beijing 100081,China

        Abstract: As a core part of the electronic warfare (EW) system,de-interleaving is used to separate interleaved radar signals. The de-interleaving algorithm based on the fuzzy adaptive resonance theory(fuzzy ART)is plagued by the problems of premature saturation and performance improving dilemma. This study proposes a dual fuzzy vigilance ART(DFV-ART)algorithm to address these problems and make the following improvements. Firstly, a correction method is introduced to prevent the network from prematurely saturating;then,the fuzzy vigilance models(FVM)are constructed to replace the conventional vigilance parameter, reducing the error probability in the overlapping region; finally, a dual vigilance mechanism is introduced to solve the performance improving dilemma. Simulation results show that the proposed algorithm could improve the clustering accuracy(quantization error dropped 60%) and the de-interleaving performance (clustering quality increased by 10%) while suppressing the excessive proliferation of categories.

        Keywords: fuzzy adaptive resonance theory (fuzzy ART), deinterleaving,dual vigilance mechanism.

        1.Introduction

        The main purpose of the electronic warfare (EW) system is to intercept emission signals, de-interleave the intercepted signals and identify surrounding threatening emitters. With the development of EW environment, intercepted signals are interleaved into complex pulse trains.In order to separate the pulse train effectively, the advanced de-interleaving theory becomes very critical.

        De-interleaving approaches in literature can be divided into two categories: pulse repetition interval(PRI) analysis and feature clustering.Methods based on the PRI analysis include the PRI training method [1], cumulative differences of PRI histograms(CDIF) [2], sequential differences of PRI histograms (SDIF) [3], and hidden Markov models[4–7].As for clustering-based approaches,the improved algorithm was proposed by Liu and Zhang[8]using clustering and SDIF,and by Guo[9]and Bradley[10]using K-means.Notably,a two-stage clustering technique proposed by Gencol[11]also achieves good results.

        Compared with the conventional clustering methods,the fuzzy adaptive resonance theory(fuzzy ART) [12,13]has great advantages in automatic processing and intelligent learning. These advantages make the algorithm suit for automatic de-interleaving of radar pulses [14]. However,the applications of the fuzzy ART to de-interleaving process are still limited. In [14], authors demonstrated that the fuzzy ART suits for radar pulse de-interleaving. On this basis,Ata’a and Abdullah[15]realized the clustering of radar features, including pulse width (PW), pulse frequency (PF) and angle-of-arrival (AOA), using the fuzzy ART network.In[16],Gencol et al.proposed a pulse amplitude(PA)tracking algorithm and used the estimated PA as a fourth information source incorporating with other parameters to assist the clustering of radar features.

        The studies mentioned above all focus on how to use the fuzzy ART to de-interleave radar signals,ignoring the improvement of the algorithm itself. Since the mechanisms of the ART network are triggered by a vigilance test under the control of a stable vigilance parameter,it is very difficult for ART systems to address the problems of premature saturation[17] and performance improving dilemma [18]during the de-interleaving process. This paper augments the fuzzy ART de-interleaving systems by making the following improvements: first, a correction method is introduced to prevent the network from prematurely saturating and improve clustering accuracy;then,fuzzy vigilance models(FVM)are constructed to replace the conventional vigilance parameter,reducing the error probability in overlapping region; finally, a dual vigilance mechanism is introduced to address the performance improving dilemma.Simulation results show that the proposed algorithm could improve the clustering accuracy and address the dilemma in the fuzzy ART de-interleaving systems.

        2.Related work

        The fuzzy ART is widely used for a variety of issues,such as clustering [19,20], vector quantization [21–23]and classification [24–27]. In this section, we briefly introduce the algorithm of the fuzzy ART and the mathematical model of Type-2 fuzzy sets (T2-FSs), paving the way for the subsequent research.

        2.1 Fuzzy ART

        The fuzzy ART consists of the following three layers:F0,F1, andF2, as shown in Fig. 1.F0is used to normalize and complement-code the inputs.F1is used for calculating the membership between the input and the neurons in layerF2. The fuzzy ART selects the winning neuron by comparing neurons’memberships and updates the weight of the winner.Finally,the outputs of layerF2are the active categories.

        Fig.1 Fuzzy ART architecture

        The algorithm proceeds as follows:

        (i) Present normalized and complement-coded inputItoF1and calculate the choice functionTjfor categoryjinF2:

        whereI= (a,ac),ais the original input beforeF0-layer processing;wjis the adaptive weight vector of categoryj;αis the choice parameter; andNis the number of the categories in layerF2.

        (ii)Select the winnerJby using a winner-take-all competition:(iii)Perform a vigilance check by using the match criterion:

        (iv) IfJsatisfies the match criterion, then update its weights:

        (v)IfJfails, then reset it and repeat(ii)until a winner passes. If no existing category succeeds, then a new category should be created.

        2.2 T2-FSs

        The T2-FSs [28–30] in a universe of discourseX, denoted as,are characterized by Type-2 membership functionwherex ∈Xandμ ∈JX ?[0,1]:

        Fig. 2(a) illustrates a Gaussian T2-FSs with the fixed mean and uncertain standard deviation[29].The distribution of the primary membership,called the footprint of uncertainty(FOU),is shown in the yellow area and the FOU is bounded by lower membership function(LMF)and upper membership function(UMF).The secondary membership,shown in Fig.2(b),can be obtained by taking a vertical slice ofred line in Fig.2(a).

        Fig.2 Gaussian T2-FS

        For these T2-FSs,the centroid[30]of the FOU could be fully characterized by its left and right endpoints[30].It is worth pointing out that the centroid in the fuzzy vigilance model constructed in this paper is precisely the distribution center of vigilance parameters. Therefore, the calculation of the centroid is of great significance.

        3.Problem statement

        3.1 Premature saturation

        The fuzzy ART network has the characteristic of fast convergence. The network will be saturated after a small amount of training, making weight vectors no longer update with the input data.Since weight vectors represent the clusters of the ART network,premature saturation will affect the accuracy of clusters. In order to improve the clustering accuracy,it is very important to prevent the network from prematurely saturating.

        3.2 Performance improving dilemma

        In the fuzzy ART model, categories in layer F2overlap each other,as shown in Fig.3(a),making higher error probability in the overlapping region,as shown in Fig.3(b).

        Since the mechanisms of the model are controlled by a stable vigilance parameter ρ, it needs to increase the value of ρ to reduce the error probability.However,the increased ρ will cause the proliferation problem,as shown in Fig.3(c),resulting in a decrease in sorting performance.

        Therefore, the conventional vigilance becomes a double-edged sword for improving the sorting performance,and it is very critical for ART de-interleaving systems to choose a new vigilance model with adaptive characteristics to replace the conventional vigilance parameter.

        Fig.3 Performance improving dilemma

        4.DFV-ART algorithm

        To solve the problems mentioned above,a dual fuzzy vigilance ART(DFV-ART)algorithm is proposed by referencing the T2-FSs[28–31]and the dual vigilance theory[32].Compared with the traditional fuzzy ART, the advantages and innovations of the DFV-ART are shown as follows.

        (i) The DFV-ART prevents the ART network from prematurely saturating. Through the proposed correction method, the utilization of different features is obviously increased, and the clustering accuracy improves significantly.

        (ii) The DFV-ART uses the adaptive vigilance threshold to replace the traditional fixed vigilance parameter,reducing the error probability in the overlapping region.Through the construction of new vigilance models, presented as the FVM, the DFV-ART selects different and appropriate vigilance thresholds for different signal categories.

        (iii) The DFV-ART overcomes the performance bottleneck of the fuzzy ART de-interleaving systems. Through the introduction of the dual vigilance mechanism, the DFV-ART suppresses the excessive proliferation and addresses the performance improving dilemma.

        4.1 Correction method

        In the fuzzy ART sorting systems, the similarity of two radar feature vectors is measured by using fuzzy operations.However,fuzzy operations have the following limitations.(i)When a feature is far greater than the others,this feature, called the super factor (SF), will make other features lose the contribution to category difference in fuzzy operating.(ii)The greater the number of the SF is,the easier it is for the fuzzy ART to saturate prematurely.To break these limitations and improve the clustering accuracy, a correction method is introduced to reduce the differences among the features.

        For a more intuitive analysis, we build the following scenario: a = (a1,...,aM) is the input radar feature vector and M is its dimension; a1,a2,...,akare the SF,whose values are all 100a (a > 0); the values of the rest are all a(for example,the value of the PF,in MHz, is often 100 times larger than the PW,inμs).After the normalization of a, the normalized SF bi(i = 1,...,k) can be expressed as follows:

        Since the 1-norm of I = (a,ac) is M after the complement-coding,the proportion of the SF in the accu-mulation is

        Since M is a fixed value,the value of k determines the size of δ.As k → 0.5M,δ → 1.In this condition,the SF makes it very difficult for other features to affect the result of vigilance check.As k → 0,δ → 0.5.At this time,each feature in I contributes to distinguish the category differences. Therefore, it is an effective method to prevent the fuzzy ART from prematurely saturating by reducing the differences among the features.To achieve this goal,a correction method is proposed and the method is divided into two steps.

        (i)First,correct the dynamic range of each feature.

        Assuming that the standard deviation of the ith feature is σi,the initially corrected input can be expressed as follows:

        (ii)Second,correct the magnitude of each feature.

        Assuming that the mean of the ith feature is μi,the correction criterion μ can be obtained by

        The correcting factor can be obtained by using the correction criterion μ:

        4.2 FVM

        (i)Construction of the FVM

        The parameters of the FVM are set as follows: I =(I1,...,I2M) is corrected, normalized and complementcoded input,[m1,m2]is the range of the fuzzifier m[31],J is the winning category and wJis the adaptive weight vector of J.

        The FVM is a kind of T2-FSs, obtained by fuzzy processing of the distance between I and wJ. This type of T2-FSs is used to show the distribution of vigilance parameters, and the distribution, yellow region in Fig. 4, is bounded by the LMFand the UMFwhich can be expressed as follows:

        where d = |wJ?I| is a distance vector between I and wJ.

        (ii)Calculation of the vigilance threshold

        When the input is I and the winner is J,the distribution center ρ?can be obtained by calculating the centroid of the FVM:

        At this point,the vigilance threshold ρ?, the red line in Fig.4,is constructed as follows:

        Fig.4 FVM

        The two figures in Fig.4 show the distribution of vigilance parameters.When the categories of the input and the winner are the same, in Fig. 4(a), the vigilance threshold is reduced to 0.593.When the categories are different, in Fig. 4(b), the vigilance threshold is raised to 0.986. The comparison results illustrate that the FVM improves the structure of the fuzzy ART by choosing different and suitable thresholds for different categories.

        4.3 Dual vigilance mechanism

        To address the performance improving dilemma,vigilance thresholds should be further adjusted according to the category difference between the input and the winner.For this goal, another vigilance, presented as the category vigilance,is introduced to predict the status of the fuzzy ART network and assist the adjustment of vigilance thresholds.

        The dual vigilance mechanism is proceeded as follows.

        (i) First, initialize the category vigilanceρj(j=1,...,N).

        If the categoryjis sorted for the first time,ρjis initialized to

        (ii)Second,predict the status of the fuzzy ART system.

        The prediction uses the following match criterion:

        (iii)Finally,adjust the category vigilanceρjand get the optimal vigilance parameterρ.

        If the match criterion is satisfied, the ART system will trigger resonant state after the vigilance check.In this condition,ρjshould be updated in advance to

        The optimal vigilance parameterρpredicted by this paper is

        If the match criterion fails,the ART system will trigger the reset state and the predictedρcan be obtained by

        4.4 Flowchart

        The flowchart of the DFV-ART is shown in Fig.5.

        5.Simulation and discussion

        In the following section, we present the assessment results for the DFV-ART algorithm applied to radar pulse de-interleaving.In this sense,a comparative study with the fuzzy ART [16],Type-1 fuzzy ART(T1-FA)[31]and the DFV-ART is accomplished. The evaluation involves the clustering quality(CQ)[16],quantization error(QE)[16]of clusters, number of training pulses and the quantity of categories created by ART systems.It is worth pointing out that each experiment in the comparative study is repeated 100 times under the condition that the order of the input presentation is random. The result of each experiment is the mean of 100 repetitions.

        In these experiments,αandβare set to 0.1 and 0.6 respectively,and a grid search is used for parameter tuning.The [0, 1] interval with a step size of 0.001 is used for searching the vigilance parameterρof the fuzzy ART.Finally,the fuzzifiermin T1-FA is set to 2 000 and the range[m1,m2]for DT2-FA is set to[700,800].

        5.1 Experimental data

        The experimental data include 13 kinds of radar signals,and the parameters of the signals are shown in Table 1.The parameters contain AOA, PW, PF and their codes of complement.

        Table 1 13 radars’parameters

        The distribution of normalized radar features is shown in Fig.6. To make the image more clear, only four of the 13 signals are shown.

        Fig.6 Distribution of radar features

        5.2 Result and discussion

        Fig. 7 and Fig. 8 show the simulation results of the comparative study. It is worth pointing out that the deinterleaving performance of the fuzzy ART without correcting the input is shown in Fig.7(a).As for the simulations in other figures,the input feature vectors all are corrected by using the proposed method.

        Fig.7 Performance of fuzzy ART

        The results in Fig. 7(a) illustrate that the fuzzy ART without the input correction has poor performance. The QE of clusters fluctuates around 1.2×106and the clustering quality is 50%.Since the dynamic ranges of different features are significantly different before the correction, the fuzzy ART is more sensitive to features with a large dynamic range,ignoring the influence of the others.Therefore,without the correction,the de-interleaving performance of the fuzzy ART is seriously affected.

        After using the correction method, from Fig. 7(b) to Fig. 8(c), the fuzzy ART takes advantages of all the features to get the network fully trained before it saturates.Therefore,the QE is rapidly reduced and the CQ is significantly improved.The comparison results illustrate that the proposed method could improve the clustering accuracy effectively. The de-interleaving performance of the fuzzy ART with different ρ is shown in Fig.7(c),where ρ is set to 0.98 and 0.999 respectively. The results illustrate that ρ becomes a double-edged sword for improving the deinterleaving performance. When the value of ρ increases from 0.98 to 0.999, the CQ is increased from 78.63% to 94.4%, and the QE is reduced from 10.62 to 3.6. However, the increased ρ causes an excessive proliferation of clusters,the red curve in Fig.7(b),making the number of clusters much higher than the quantity of signal categories.

        Therefore,the traditional vigilance parameter becomes an unfavorable factor that limites the performance improving of the fuzzy ART, and it is very critical for ART systems to choose a new vigilance model to replace the conventional vigilance parameter.

        The T1-FA and DFV-ART both constructe a vigilance model with adaptive characteristics, and the performance of the two algorithms are shown in Fig.8.

        The CQ of T1-FA reaches 82.8%while the QE decreasing to 7.158,as shown in Fig.8(c).Since the vigilance parameter could be adaptively adjusted,the clusters of T1-FA do not proliferate as the training pulses increase, the blue curve in Fig. 8(b),making the quantity of the active categories gradually stabilize to 11. The results illustrate that the T1-FA can suppress the excessive proliferation and has a better sorting effect than the fuzzy ART. However, the performance of the T1-FA is limited by the fuzzifier, as shown in Fig. 8(a), resulting in an upper limit on the improvement of sorting performance.

        The DFV-ART proposed by this paper breaks this limitation and obtains the optimal sorting performance.Due to the construction of the fuzzy vigilance model, the DFVART selectes different and appropriate vigilance thresholds for different signal categories.It not only further improves the clustering performance,but also makes the algorithm more stable.

        Fig.8 Performance of T1-FA and DFV-ART

        The stability of the DFV-ART makes clusters’ number stabilize at 13, as shown by the black line in Fig. 8(b),which is equal to the quantity of signal categories. The performance comparison of the DFV-ART and T1-FA is shown in Fig. 8(c). Due to the mechanism of dual vigi-lance, the DFV-ART breaks the limitation of the performance improving. The mechanism makes the input data gradually approach the clustering centers, resulting in the gradual aggregation of the similar data. Therefore, comparing with the T1-FA,the CQ of the DFV-ART increases from 82%to 97%, and the performance improves significantly.

        Compared with the other algorithms, the proposed algorithm can correctly sort all 13 types of the input signals while suppressing the excessive proliferation. Therefore,the algorithm proposed by this paper achieves the optimal effect.

        The de-interleaving performance is analyzed above,and then we will further analyze the computational complexity of the three algorithms. The computational complexity is derived from four parts(the symbols in parentheses represent the amount of calculation for this part): data initialization(CI),membership calculation(N×CM),vigilance check(CV)and weights update(CU).Therefore,the computational complexity of the three algorithms is shown in Table 2.

        Table 2 Computational complexity

        The membership calculation part needs to calculate the membership between the input and N categories in layer F2, as shown in (1). Each time the winning category is searched,the membership calculation part needs to be calculated repeatedly N times, while the other parts are calculated only once.Therefore,the membership calculation part has the largest amount of calculation(more than 50%),and the calculation amount is related to the number N of categories in layer F2. Due to the proliferation problem,shown in Fig. 7, the categories’ number N1of the fuzzy ART is larger than that of T1-FA (N2) and DFV-ART(N3).Therefore,the fuzzy ART has the highest complexity.Due to the introduction of correction methods and dual vigilance mechanisms,the calculation amount of the DFVART is twice larger than that of the T1-FA in the parts of data initialization and vigilance check.Therefore,the computational complexity of the DFV-ART is slightly higher than that of the T1-FA while the performance is improved significantly.

        In view of the above advantages, the DFV-ART has great advantages in clustering and vector quantization,which makes it suitable for de-interleaving similar signals.With the development of modern EW,emission signals become complex and variable,making the signals intercepted by the EW systems interleave into complex pulse trains.To separate the pulse trains effectively,it needs the advanced de-interleaving algorithm, and the DFV-ART has a huge advantage in this respect. Therefore, the research on the DFV-ART is very promising.

        6.Conclusions

        This work presents the idea of correcting the input and using new vigilance models to replace the conventional vigilance parameter, which is shown in the DFV-ART, and improves the clustering accuracy and addresses the performance improving dilemma. It is accomplished by correcting the input feature vectors, calculating the vigilance threshold from the FVM and using the dual vigilance mechanism to adjust the threshold. Simulation results show that the proposed algorithm can improve the clustering accuracy and address the dilemma in fuzzy ART de-interleaving systems.

        日日噜噜夜夜狠狠久久丁香五月| 日本道免费精品一区二区| 丝袜人妻无码中文字幕综合网 | 亚洲碰碰人人av熟女天堂| 日韩av二区三区一区| 日韩视频午夜在线观看| 国产激情久久久久久熟女老人| 人人爽人人爽人人爽人人片av| 手机看片1024精品国产| 中文字幕av人妻一区二区| 中文字幕av长濑麻美| 亚洲精品久久久久成人2007| 四虎国产精品永久在线无码| 国产杨幂AV在线播放| 亚洲sm另类一区二区三区| 亚洲第一最快av网站| 豆国产95在线 | 亚洲| 日韩午夜在线视频观看| av中文字幕一区人妻| 精品久久人妻av中文字幕| 久久精品国产日本波多麻结衣| 国产免费三级三级三级| 手机久草视频福利在线观看| 午夜精品久久久久久毛片| 欧美精品中文| 丝袜美腿诱惑一二三区| 欧美国产激情18| 精品无码人妻一区二区三区| 美女视频很黄很a免费国产| 精品人妻少妇丰满久久久免| 亚洲av成人噜噜无码网站| 97se在线观看| 亚洲黄片av在线免费观看| 午夜福利理论片在线观看播放| 国产精品免费大片| 亚洲AV无码成人精品区日韩密殿| 97青草超碰久久国内精品91| 国产女人的高潮国语对白| 天天躁日日躁狠狠躁一区| 亚洲一区在线二区三区| 国产成人无码精品久久久露脸|