This paper deals with the blind separation of nonstation-ary sources and direction-of-arrival (DOA) estimation in the under-determined case, when there are more sources than sensors. We assume the sources to be time...This paper deals with the blind separation of nonstation-ary sources and direction-of-arrival (DOA) estimation in the under-determined case, when there are more sources than sensors. We assume the sources to be time-frequency (TF) disjoint to a certain extent. In particular, the number of sources presented at any TF neighborhood is strictly less than that of sensors. We can identify the real number of active sources and achieve separation in any TF neighborhood by the sparse representation method. Compared with the subspace-based algorithm under the same sparseness assumption, which suffers from the extra noise effect since it can-not estimate the true number of active sources, the proposed algorithm can estimate the number of active sources and their cor-responding TF values in any TF neighborhood simultaneously. An-other contribution of this paper is a new estimation procedure for the DOA of sources in the underdetermined case, which combines the TF sparseness of sources and the clustering technique. Sim-ulation results demonstrate the validity and high performance of the proposed algorithm in both blind source separation (BSS) and DOA estimation.展开更多
Text event mining,as an indispensable method of text mining processing,has attracted the extensive attention of researchers.A modeling method for knowledge graph of events based on mutual information among neighbor do...Text event mining,as an indispensable method of text mining processing,has attracted the extensive attention of researchers.A modeling method for knowledge graph of events based on mutual information among neighbor domains and sparse representation is proposed in this paper,i.e.UKGE-MS.Specifically,UKGE-MS can improve the existing text mining technology's ability of understanding and discovering high-dimensional unmarked information,and solves the problems of traditional unsupervised feature selection methods,which only focus on selecting features from a global perspective and ignoring the impact of local connection of samples.Firstly,considering the influence of local information of samples in feature correlation evaluation,a feature clustering algorithm based on average neighborhood mutual information is proposed,and the feature clusters with certain event correlation are obtained;Secondly,an unsupervised feature selection method based on the high-order correlation of multi-dimensional statistical data is designed by combining the dimension reduction advantage of local linear embedding algorithm and the feature selection ability of sparse representation,so as to enhance the generalization ability of the selected feature items.Finally,the events knowledge graph is constructed by means of sparse representation and l1 norm.Extensive experiments are carried out on five real datasets and synthetic datasets,and the UKGE-MS are compared with five corresponding algorithms.The experimental results show that UKGE-MS is better than the traditional method in event clustering and feature selection,and has some advantages over other methods in text event recognition and discovery.展开更多
The purpose of unsupervised domain adaptation is to use the knowledge of the source domain whose data distribution is different from that of the target domain for promoting the learning task in the target domain.The k...The purpose of unsupervised domain adaptation is to use the knowledge of the source domain whose data distribution is different from that of the target domain for promoting the learning task in the target domain.The key bottleneck in unsupervised domain adaptation is how to obtain higher-level and more abstract feature representations between source and target domains which can bridge the chasm of domain discrepancy.Recently,deep learning methods based on autoencoder have achieved sound performance in representation learning,and many dual or serial autoencoderbased methods take different characteristics of data into consideration for improving the effectiveness of unsupervised domain adaptation.However,most existing methods of autoencoders just serially connect the features generated by different autoencoders,which pose challenges for the discriminative representation learning and fail to find the real cross-domain features.To address this problem,we propose a novel representation learning method based on an integrated autoencoders for unsupervised domain adaptation,called IAUDA.To capture the inter-and inner-domain features of the raw data,two different autoencoders,which are the marginalized autoencoder with maximum mean discrepancy(mAE)and convolutional autoencoder(CAE)respectively,are proposed to learn different feature representations.After higher-level features are obtained by these two different autoencoders,a sparse autoencoder is introduced to compact these inter-and inner-domain representations.In addition,a whitening layer is embedded for features processed before the mAE to reduce redundant features inside a local area.Experimental results demonstrate the effectiveness of our proposed method compared with several state-of-the-art baseline methods.展开更多
Unmanned Aerial Vehicle(UAV)equipped with uniform linear array has been applied to multiple emitters localization.Meanwhile,nested linear array enables to enhance localization resolution and achieve under-determined D...Unmanned Aerial Vehicle(UAV)equipped with uniform linear array has been applied to multiple emitters localization.Meanwhile,nested linear array enables to enhance localization resolution and achieve under-determined Direction of Arrival(DOA)estimation.In this paper,we propose a new system structure for emitters localization that combines the UAV with nested linear array,which is capable of significantly increasing the positioning accuracy of interested targets.Specifically,a localization scheme is designed to obtain the paired two-dimensional DOA(2D-DOA,i.e.azimuth and elevation angles)estimates of emitters by nested linear array with UAV.Furthermore,we propose an improved DOA estimation algorithm for emitters localization that utilizes Discrete Fourier Transform(DFT)method to obtain coarse DOA estimates,subsequently,achieve the fine DOA estimates by sparse representation.The proposed algorithm has lower computational complexity because the coarse DOA estimates enable to shrink the range of over-complete dictionary of sparse representation.In addition,compared to traditional uniform linear array,improved 2D-DOA estimation performance of emitters can be obtained with a nested linear array.Extensive simulation results testify the effectiveness of the proposed method.展开更多
Various types of interference signals limit the practical application of transform domain communication systems(TDCSs)in the severe electromagnetic field,an orthogonal basis learning method of transformation analysis(...Various types of interference signals limit the practical application of transform domain communication systems(TDCSs)in the severe electromagnetic field,an orthogonal basis learning method of transformation analysis(OBL-TA)is proposed to effectively address the problem of obtaining an optimal transform domain based on sparse representation.Then,the sparse availability is utilized to obtain the optimal transformation analysis by the iterative methods,which yields the sparse representation for transform domain(SRTD)in unrestricted form.In addition,the iterative version of SRTD(I-SRTD)in unrestricted form is obtained by decomposing the SRTD problem into three sub-problems and each sub-problem is iteratively solved by learning the best orthogonal basis.Furthermore,orthogonal basis learning via cost function minimization process is conducted by stochastic descent,which is assured to converge to a local minimum at least.Finally,the optimal transformation analysis is developed by the effectiveness of different transform domains according to the accuracy of the sparse representation and an optimal transformation analysis separately(OPTAS)is applied to the synthesized signal forms with conic alternatives,dualization,and smoothing.Simulation results demonstrate that the superiorities of the proposed methods achieve the optimal recovery and separation more rapidly and accurately than conventional methods.展开更多
为满足未来无人系统通信智能抗干扰的实际需要,针对传统变换域通信系统(transform domain communication system,TDCS)自身开放性有限、干扰应对能力不足等问题,设计了基于认知引擎驱动的智能系统架构,并针对各认知引擎驱动子模块提出了...为满足未来无人系统通信智能抗干扰的实际需要,针对传统变换域通信系统(transform domain communication system,TDCS)自身开放性有限、干扰应对能力不足等问题,设计了基于认知引擎驱动的智能系统架构,并针对各认知引擎驱动子模块提出了3种改进方法,包括基于稀疏逼近的未知干扰处理、基于稀疏表示的变换学习干扰识别以及针对性的干扰变换稀疏分析方法。实验结果表明,识别子模块与传统的分类器相比,整体的干扰识别率提高了5.2%,并且可实现无监督的学习;同时,针对典型干扰的重构精度在90%以上,实现了不同干扰类型的最优变换处理,显著提高了系统的抗干扰性能,传输误码率逼近理想水平。展开更多
基金supported by the National Natural Science Foundation of China(61072120)
文摘This paper deals with the blind separation of nonstation-ary sources and direction-of-arrival (DOA) estimation in the under-determined case, when there are more sources than sensors. We assume the sources to be time-frequency (TF) disjoint to a certain extent. In particular, the number of sources presented at any TF neighborhood is strictly less than that of sensors. We can identify the real number of active sources and achieve separation in any TF neighborhood by the sparse representation method. Compared with the subspace-based algorithm under the same sparseness assumption, which suffers from the extra noise effect since it can-not estimate the true number of active sources, the proposed algorithm can estimate the number of active sources and their cor-responding TF values in any TF neighborhood simultaneously. An-other contribution of this paper is a new estimation procedure for the DOA of sources in the underdetermined case, which combines the TF sparseness of sources and the clustering technique. Sim-ulation results demonstrate the validity and high performance of the proposed algorithm in both blind source separation (BSS) and DOA estimation.
基金This study was funded by the International Science and Technology Cooperation Program of the Science and Technology Department of Shaanxi Province,China(No.2021KW-16)the Science and Technology Project in Xi’an(No.2019218114GXRC017CG018-GXYD17.11),Thesis work was supported by the special fund construction project of Key Disciplines in Ordinary Colleges and Universities in Shaanxi Province,the authors would like to thank the anonymous reviewers for their helpful comments and suggestions.
文摘Text event mining,as an indispensable method of text mining processing,has attracted the extensive attention of researchers.A modeling method for knowledge graph of events based on mutual information among neighbor domains and sparse representation is proposed in this paper,i.e.UKGE-MS.Specifically,UKGE-MS can improve the existing text mining technology's ability of understanding and discovering high-dimensional unmarked information,and solves the problems of traditional unsupervised feature selection methods,which only focus on selecting features from a global perspective and ignoring the impact of local connection of samples.Firstly,considering the influence of local information of samples in feature correlation evaluation,a feature clustering algorithm based on average neighborhood mutual information is proposed,and the feature clusters with certain event correlation are obtained;Secondly,an unsupervised feature selection method based on the high-order correlation of multi-dimensional statistical data is designed by combining the dimension reduction advantage of local linear embedding algorithm and the feature selection ability of sparse representation,so as to enhance the generalization ability of the selected feature items.Finally,the events knowledge graph is constructed by means of sparse representation and l1 norm.Extensive experiments are carried out on five real datasets and synthetic datasets,and the UKGE-MS are compared with five corresponding algorithms.The experimental results show that UKGE-MS is better than the traditional method in event clustering and feature selection,and has some advantages over other methods in text event recognition and discovery.
基金supported by the National Natural Science Foundation of China(Grant Nos.61906060,62076217,62120106008)the Yangzhou University Interdisciplinary Research Foundation for Animal Husbandry Discipline of Targeted Support(yzuxk202015)+1 种基金the Opening Foundation of Key Laboratory of Huizhou Architecture in Anhui Province(HPJZ-2020-02)the Open Project Program of Joint International Research Laboratory of Agriculture and AgriProduct Safety(JILAR-KF202104).
文摘The purpose of unsupervised domain adaptation is to use the knowledge of the source domain whose data distribution is different from that of the target domain for promoting the learning task in the target domain.The key bottleneck in unsupervised domain adaptation is how to obtain higher-level and more abstract feature representations between source and target domains which can bridge the chasm of domain discrepancy.Recently,deep learning methods based on autoencoder have achieved sound performance in representation learning,and many dual or serial autoencoderbased methods take different characteristics of data into consideration for improving the effectiveness of unsupervised domain adaptation.However,most existing methods of autoencoders just serially connect the features generated by different autoencoders,which pose challenges for the discriminative representation learning and fail to find the real cross-domain features.To address this problem,we propose a novel representation learning method based on an integrated autoencoders for unsupervised domain adaptation,called IAUDA.To capture the inter-and inner-domain features of the raw data,two different autoencoders,which are the marginalized autoencoder with maximum mean discrepancy(mAE)and convolutional autoencoder(CAE)respectively,are proposed to learn different feature representations.After higher-level features are obtained by these two different autoencoders,a sparse autoencoder is introduced to compact these inter-and inner-domain representations.In addition,a whitening layer is embedded for features processed before the mAE to reduce redundant features inside a local area.Experimental results demonstrate the effectiveness of our proposed method compared with several state-of-the-art baseline methods.
基金Postgraduate Research&Practice Innovation Program of Jiangsu Province(SJCX18_0103,KYCX18_0293)China NSF Grants(61371169,61601167,61601504)+2 种基金Jiangsu NSF(BK20161489)the open research fund of State Key Laboratory of Millimeter Waves,Southeast University(No.K201826)the Fundamental Research Funds for the Central Universities(NO.NE2017103).
文摘Unmanned Aerial Vehicle(UAV)equipped with uniform linear array has been applied to multiple emitters localization.Meanwhile,nested linear array enables to enhance localization resolution and achieve under-determined Direction of Arrival(DOA)estimation.In this paper,we propose a new system structure for emitters localization that combines the UAV with nested linear array,which is capable of significantly increasing the positioning accuracy of interested targets.Specifically,a localization scheme is designed to obtain the paired two-dimensional DOA(2D-DOA,i.e.azimuth and elevation angles)estimates of emitters by nested linear array with UAV.Furthermore,we propose an improved DOA estimation algorithm for emitters localization that utilizes Discrete Fourier Transform(DFT)method to obtain coarse DOA estimates,subsequently,achieve the fine DOA estimates by sparse representation.The proposed algorithm has lower computational complexity because the coarse DOA estimates enable to shrink the range of over-complete dictionary of sparse representation.In addition,compared to traditional uniform linear array,improved 2D-DOA estimation performance of emitters can be obtained with a nested linear array.Extensive simulation results testify the effectiveness of the proposed method.
基金supported by the University Cooperation Project Foundation of the Key Laboratory for Aerospace Information Technology(KX162600022).
文摘Various types of interference signals limit the practical application of transform domain communication systems(TDCSs)in the severe electromagnetic field,an orthogonal basis learning method of transformation analysis(OBL-TA)is proposed to effectively address the problem of obtaining an optimal transform domain based on sparse representation.Then,the sparse availability is utilized to obtain the optimal transformation analysis by the iterative methods,which yields the sparse representation for transform domain(SRTD)in unrestricted form.In addition,the iterative version of SRTD(I-SRTD)in unrestricted form is obtained by decomposing the SRTD problem into three sub-problems and each sub-problem is iteratively solved by learning the best orthogonal basis.Furthermore,orthogonal basis learning via cost function minimization process is conducted by stochastic descent,which is assured to converge to a local minimum at least.Finally,the optimal transformation analysis is developed by the effectiveness of different transform domains according to the accuracy of the sparse representation and an optimal transformation analysis separately(OPTAS)is applied to the synthesized signal forms with conic alternatives,dualization,and smoothing.Simulation results demonstrate that the superiorities of the proposed methods achieve the optimal recovery and separation more rapidly and accurately than conventional methods.
文摘为满足未来无人系统通信智能抗干扰的实际需要,针对传统变换域通信系统(transform domain communication system,TDCS)自身开放性有限、干扰应对能力不足等问题,设计了基于认知引擎驱动的智能系统架构,并针对各认知引擎驱动子模块提出了3种改进方法,包括基于稀疏逼近的未知干扰处理、基于稀疏表示的变换学习干扰识别以及针对性的干扰变换稀疏分析方法。实验结果表明,识别子模块与传统的分类器相比,整体的干扰识别率提高了5.2%,并且可实现无监督的学习;同时,针对典型干扰的重构精度在90%以上,实现了不同干扰类型的最优变换处理,显著提高了系统的抗干扰性能,传输误码率逼近理想水平。