Guoqing Ruan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Guoqing Ruan has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Qiang Guo
College of Information and Communication Engineering, Harbin Engineering University, Harbin, China
6 shared publications - Jian Wan
College of Information and Communication Engineering, Harbin Engineering University, Harbin 150001, China
2 shared publications - Chen Li
College of Information and Communication Engineering, Harbin Engineering University, Harbin 150001, China
1 shared publication - Huihui Yue
College of Information and Communication Engineering, Harbin Engineering University, Harbin 150001, China
1 shared publication - Jianhong Xiang
College of Information and Communication Engineering, Harbin Engineering University, Harbin, China
1 shared publication Jingpeng Gao
College of Information and Communication Engineering Harbin Engineering University Harbin China
1 shared publication
Latest Publications
- Open Access
LPI Radar Waveform Recognition Based on Deep Convolutional Neural Network Transfer Learning
Low Probability of Intercept (LPI) radar waveform recognition is not only an important branch of the electronic reconnaissance field, but also an important means to obtain non-cooperative radar information. To solve the problems of LPI radar waveform recognition rate, difficult feature extraction and large number of samples needed, an automatic classification and recognition system based on Choi-Williams distribution (CWD) and depth convolution neural network migration learning is proposed in this paper. First, the system performs CWD time-frequency transform on the LPI radar waveform to obtain a 2-D time-frequency image. Then the system preprocesses the original time-frequency image. In addition, then the system sends the pre-processed image to the pre-training model (Inception-v3 or ResNet-152) of the deep convolution network for feature extraction. Finally, the extracted features are sent to a Support Vector Machine (SVM) classifier to realize offline training and online recognition of radar waveforms. The simulation results show that the overall recognition rate of the eight LPI radar signals (LFM, BPSK, Costas, Frank, and T1–T4) of the ResNet-152-SVM system reaches 97.8%, and the overall recognition rate of the Inception-v3-SVM system reaches 96.2% when the SNR is −2 dB.
Open AccessLPI Radar Waveform Recognition Based on Deep Convolutional Neural Network Transfer Learning
Low Probability of Intercept (LPI) radar waveform recognition is not only an important branch of the electronic reconnaissance field, but also an important means to obtain non-cooperative radar information. To solve the problems of LPI radar waveform recognition rate, difficult feature extraction and large number of samples needed, an automatic classification and recognition system based on Choi-Williams distribution (CWD) and depth convolution neural network migration learning is proposed in this paper. First, the system performs CWD time-frequency transform on the LPI radar waveform to obtain a 2-D time-frequency image. Then the system preprocesses the original time-frequency image. In addition, then the system sends the pre-processed image to the pre-training model (Inception-v3 or ResNet-152) of the deep convolution network for feature extraction. Finally, the extracted features are sent to a Support Vector Machine (SVM) classifier to realize offline training and online recognition of radar waveforms. The simulation results show that the overall recognition rate of the eight LPI radar signals (LFM, BPSK, Costas, Frank, and T1–T4) of the ResNet-152-SVM system reaches 97.8%, and the overall recognition rate of the Inception-v3-SVM system reaches 96.2% when the SNR is −2 dB.
- Open Access
A New Radar Signal Recognition Method Based on Optimal Classification Atom and IDCQGA
Radar electronic reconnaissance is an important part of modern and future electronic warfare systems and is the primary method to obtain non-cooperative intelligence information. As the task requirement of radar electronic reconnaissance, it is necessary to identify the non-cooperative signals from the mixed signals. However, with the complexity of battlefield electromagnetic environment, the performance of traditional recognition system is seriously affected. In this paper, a new recognition method based on optimal classification atom and improved double chains quantum genetic algorithm (IDCQGA) is researched, optimal classification atom is a new feature for radar signal recognition, IDCQGA with symmetric coding performance can be applied to the global optimization algorithm. The main contributions of this paper are as follows: Firstly, in order to measure the difference of multi-class signals, signal separation degree based on distance criterion is proposed and established according to the inter-class separability and intra-class aggregation of the signals. Then, an IDCQGA is proposed to select the best atom for classification under the constraint of distance criterion, and the inner product of the signal and the best atom for classification is taken as the eigenvector. Finally, the extreme learning machine (ELM) is introduced as classifier to complete the recognition of signals. Simulation results show that the proposed method can improve the recognition rate of multi-class signals and has better processing ability for overlapping eigenvector parameters.
Open AccessA New Radar Signal Recognition Method Based on Optimal Classification Atom and IDCQGA
Radar electronic reconnaissance is an important part of modern and future electronic warfare systems and is the primary method to obtain non-cooperative intelligence information. As the task requirement of radar electronic reconnaissance, it is necessary to identify the non-cooperative signals from the mixed signals. However, with the complexity of battlefield electromagnetic environment, the performance of traditional recognition system is seriously affected. In this paper, a new recognition method based on optimal classification atom and improved double chains quantum genetic algorithm (IDCQGA) is researched, optimal classification atom is a new feature for radar signal recognition, IDCQGA with symmetric coding performance can be applied to the global optimization algorithm. The main contributions of this paper are as follows: Firstly, in order to measure the difference of multi-class signals, signal separation degree based on distance criterion is proposed and established according to the inter-class separability and intra-class aggregation of the signals. Then, an IDCQGA is proposed to select the best atom for classification under the constraint of distance criterion, and the inner product of the signal and the best atom for classification is taken as the eigenvector. Finally, the extreme learning machine (ELM) is introduced as classifier to complete the recognition of signals. Simulation results show that the proposed method can improve the recognition rate of multi-class signals and has better processing ability for overlapping eigenvector parameters.
- Open Access
A Reweighted Symmetric Smoothed Function Approximating L0-Norm Regularized Sparse Reconstruction Method
Sparse-signal recovery in noisy conditions is a problem that can be solved with current compressive-sensing (CS) technology. Although current algorithms based on regularization can solve this problem, the regularization mechanism cannot promote signal sparsity under noisy conditions, resulting in low recovery accuracy. Based on this, we propose a regularized reweighted composite trigonometric smoothed -norm minimization (RRCTSL0) algorithm in this paper. The main contributions of this paper are as follows: (1) a new smoothed symmetric composite trigonometric (CT) function is proposed to fit the -norm; (2) a new reweighted function is proposed; and (3) a new regularization objective function framework is constructed based on the idea of regularization. In the new objective function framework, Contributions (1) and (2) are combined as sparsity regularization terms, and errors as deviation terms. Furthermore, the conjugate-gradient (CG) method is used to optimize the objective function, so as to achieve accurate recovery of sparse signal and image under noisy conditions. The numerical experiments on both the simulated and real data verify that the proposed algorithm is superior to other state-of-the-art algorithms, and achieves advanced performance under noisy conditions.Open AccessA Reweighted Symmetric Smoothed Function Approximating L0-Norm Regularized Sparse Reconstruction Method
Sparse-signal recovery in noisy conditions is a problem that can be solved with current compressive-sensing (CS) technology. Although current algorithms based on regularization can solve this problem, the regularization mechanism cannot promote signal sparsity under noisy conditions, resulting in low recovery accuracy. Based on this, we propose a regularized reweighted composite trigonometric smoothed -norm minimization (RRCTSL0) algorithm in this paper. The main contributions of this paper are as follows: (1) a new smoothed symmetric composite trigonometric (CT) function is proposed to fit the -norm; (2) a new reweighted function is proposed; and (3) a new regularization objective function framework is constructed based on the idea of regularization. In the new objective function framework, Contributions (1) and (2) are combined as sparsity regularization terms, and errors as deviation terms. Furthermore, the conjugate-gradient (CG) method is used to optimize the objective function, so as to achieve accurate recovery of sparse signal and image under noisy conditions. The numerical experiments on both the simulated and real data verify that the proposed algorithm is superior to other state-of-the-art algorithms, and achieves advanced performance under noisy conditions. - 8 May 2018
- Published by Wiley in Transactions on Emerging Telecommunications Technologies
- Vol. 29 (9)
Novel underdetermined blind source separation algorithm based on compressed sensing and K‐SVD
In this paper, a novel two‐stage underdetermined blind source separation (UBSS) algorithm based on eigenvalue decomposition and compressed sensing (CS) is proposed. UBSS techniques can separate the complex mixed signals into multiple single signal components, which are widely applied in the field of electronic surveillance, spectrum management, radar applications, etc. Our major contributions are summarized as follows: (1) deriving a single source points detection algorithm based on eigenvalue decomposition; (2) proposing a novel hierarchical coupling dictionary training method based on K‐means singular value decomposition; and (3) using the two‐stage method to realize the separation of radar signals under the condition of unknown prior information. In the first stage, we present a single source point detection method involving eigenvalue decomposition to estimate the unknown mixing matrix. In this method, the eigenvector corresponding to the maximum eigenvalue is estimated and clustered as a vector of mixing matrix. The second stage is the recovery of sources from the observed signals utilizing the mixing matrix estimated by the first step. In the second stage, we first build the unified model of UBSS and CS, thus the reconstruction algorithm in the CS field can be applied to UBSS. Then, a hierarchical coupling dictionary training method based on K‐means singular value decomposition is proposed. The dictionary training method obtains the prior training signals by pre‐separation and employs the hierarchical coupling idea to train the dictionary efficiently. Simulations illustrate the validity of the method and show that the proposed method outperforms the traditional methods in source separation, especially in real‐world noncooperative cases without prior knowledge.
- 8 May 2018
- Published by Wiley in Transactions on Emerging Telecommunications Technologies
- Vol. 29 (9)
Novel underdetermined blind source separation algorithm based on compressed sensing and K‐SVD
In this paper, a novel two‐stage underdetermined blind source separation (UBSS) algorithm based on eigenvalue decomposition and compressed sensing (CS) is proposed. UBSS techniques can separate the complex mixed signals into multiple single signal components, which are widely applied in the field of electronic surveillance, spectrum management, radar applications, etc. Our major contributions are summarized as follows: (1) deriving a single source points detection algorithm based on eigenvalue decomposition; (2) proposing a novel hierarchical coupling dictionary training method based on K‐means singular value decomposition; and (3) using the two‐stage method to realize the separation of radar signals under the condition of unknown prior information. In the first stage, we present a single source point detection method involving eigenvalue decomposition to estimate the unknown mixing matrix. In this method, the eigenvector corresponding to the maximum eigenvalue is estimated and clustered as a vector of mixing matrix. The second stage is the recovery of sources from the observed signals utilizing the mixing matrix estimated by the first step. In the second stage, we first build the unified model of UBSS and CS, thus the reconstruction algorithm in the CS field can be applied to UBSS. Then, a hierarchical coupling dictionary training method based on K‐means singular value decomposition is proposed. The dictionary training method obtains the prior training signals by pre‐separation and employs the hierarchical coupling idea to train the dictionary efficiently. Simulations illustrate the validity of the method and show that the proposed method outperforms the traditional methods in source separation, especially in real‐world noncooperative cases without prior knowledge.
- 8 March 2018
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 37 (8) , 3206-3226
A Complex-Valued Mixing Matrix Estimation Algorithm for Underdetermined Blind Source Separation
- 8 March 2018
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 37 (8) , 3206-3226
A Complex-Valued Mixing Matrix Estimation Algorithm for Underdetermined Blind Source Separation
- Open Access
Mixing Matrix Estimation of Underdetermined Blind Source Separation Based on Data Field and Improved FCM Clustering
In modern electronic warfare, multiple input multiple output (MIMO) radar has become an important tool for electronic reconnaissance and intelligence transmission because of its anti-stealth, high resolution, low intercept and anti-destruction characteristics. As a common MIMO radar signal, discrete frequency coding waveform (DFCW) has a serious overlap of both time and frequency, so it cannot be directly used in the current radar signal separation problems. The existing fuzzy clustering algorithms have problems in initial value selection, low convergence rate and local extreme values which will lead to the low accuracy of the mixing matrix estimation. Consequently, a novel mixing matrix estimation algorithm based on data field and improved fuzzy C-means (FCM) clustering is proposed. First of all, the sparsity and linear clustering characteristics of the time–frequency domain MIMO radar signals are enhanced by using the single-source principal value of complex angular detection. Secondly, the data field uses the potential energy information to analyze the particle distribution, thus design a new clustering number selection scheme. Then the particle swarm optimization algorithm is introduced to improve the iterative clustering process of FCM, and finally get the estimated value of the mixing matrix. The simulation results show that the proposed algorithm improves both the estimation accuracy and the robustness of the mixing matrix.
Open AccessMixing Matrix Estimation of Underdetermined Blind Source Separation Based on Data Field and Improved FCM Clustering
In modern electronic warfare, multiple input multiple output (MIMO) radar has become an important tool for electronic reconnaissance and intelligence transmission because of its anti-stealth, high resolution, low intercept and anti-destruction characteristics. As a common MIMO radar signal, discrete frequency coding waveform (DFCW) has a serious overlap of both time and frequency, so it cannot be directly used in the current radar signal separation problems. The existing fuzzy clustering algorithms have problems in initial value selection, low convergence rate and local extreme values which will lead to the low accuracy of the mixing matrix estimation. Consequently, a novel mixing matrix estimation algorithm based on data field and improved fuzzy C-means (FCM) clustering is proposed. First of all, the sparsity and linear clustering characteristics of the time–frequency domain MIMO radar signals are enhanced by using the single-source principal value of complex angular detection. Secondly, the data field uses the potential energy information to analyze the particle distribution, thus design a new clustering number selection scheme. Then the particle swarm optimization algorithm is introduced to improve the iterative clustering process of FCM, and finally get the estimated value of the mixing matrix. The simulation results show that the proposed algorithm improves both the estimation accuracy and the robustness of the mixing matrix.
- Open Access
A Sparse Signal Reconstruction Method Based on Improved Double Chains Quantum Genetic Algorithm
This paper proposes a novel method of sparse signal reconstruction, which combines the improved double chains quantum genetic algorithm (DCQGA) and the orthogonal matching pursuit algorithm (OMP). Firstly, aiming at the problems of the slow convergence speed and poor robustness of traditional DCQGA, we propose an improved double chains quantum genetic algorithm (IDCQGA). The main innovations contain three aspects: (1) a high density quantum encoding method is presented to reduce the searching space and increase the searching density of the algorithm; (2) the adaptive step size factor is introduced in the chromosome updating, which changes the step size with the gradient of the objective function at the search points; (3) the quantum -gate is proposed in chromosome mutation to overcome the deficiency of the traditional NOT-gate mutation with poor performance to increase the diversity of the population. Secondly, for the problem of the OMP algorithm not being able to reconstruct precisely the effective sparse signal in noisy environments, a fidelity orthogonal matching pursuit (FOMP) algorithm is proposed. Finally, the IDCQGA-based OMP and FOMP algorithms are applied to the sparse signal decomposition, and the simulation results show that the proposed algorithms can improve the convergence speed and reconstruction precision compared with other methods in the experiments.Open AccessA Sparse Signal Reconstruction Method Based on Improved Double Chains Quantum Genetic Algorithm
This paper proposes a novel method of sparse signal reconstruction, which combines the improved double chains quantum genetic algorithm (DCQGA) and the orthogonal matching pursuit algorithm (OMP). Firstly, aiming at the problems of the slow convergence speed and poor robustness of traditional DCQGA, we propose an improved double chains quantum genetic algorithm (IDCQGA). The main innovations contain three aspects: (1) a high density quantum encoding method is presented to reduce the searching space and increase the searching density of the algorithm; (2) the adaptive step size factor is introduced in the chromosome updating, which changes the step size with the gradient of the objective function at the search points; (3) the quantum -gate is proposed in chromosome mutation to overcome the deficiency of the traditional NOT-gate mutation with poor performance to increase the diversity of the population. Secondly, for the problem of the OMP algorithm not being able to reconstruct precisely the effective sparse signal in noisy environments, a fidelity orthogonal matching pursuit (FOMP) algorithm is proposed. Finally, the IDCQGA-based OMP and FOMP algorithms are applied to the sparse signal decomposition, and the simulation results show that the proposed algorithms can improve the convergence speed and reconstruction precision compared with other methods in the experiments. - Open Access
A Time-Frequency Domain Underdetermined Blind Source Separation Algorithm for MIMO Radar Signals
This paper considers the underdetermined blind separation of multiple input multiple output (MIMO) radar signals that are insufficiently sparse in both time and frequency domains under noisy conditions, while traditional algorithms are usually applied in the ideal sparse environment. An effective separation method based on single source point (SSP) identification and time-frequency smoothed norm (TF-SL0) is proposed. Firstly, a preprocessing step of the moving average filter and a novel argument-based time-frequency SSPs detection are employed to improve the signal-to-noise ratio and signal sparsity of the observed signals, respectively. Then, the mixing matrix is obtained by using clustering algorithms. Secondly, to obtain the optimal solution of underdetermined sparse component analysis, the smoothed norm (SL0) is introduced to preliminarily achieve signal separation in the time-frequency domain. Finally, time-frequency ridge estimation is proposed to jointly enhance the reconstruction accuracy of the MIMO radar signals, and the time domain waveforms are recovered by the model of the signals. Simulations illustrate the validity of the method and show that the proposed method outperforms the traditional methods in source separation, especially in the non-cooperative electromagnetic case where the prior information is unknown.Open AccessA Time-Frequency Domain Underdetermined Blind Source Separation Algorithm for MIMO Radar Signals
This paper considers the underdetermined blind separation of multiple input multiple output (MIMO) radar signals that are insufficiently sparse in both time and frequency domains under noisy conditions, while traditional algorithms are usually applied in the ideal sparse environment. An effective separation method based on single source point (SSP) identification and time-frequency smoothed norm (TF-SL0) is proposed. Firstly, a preprocessing step of the moving average filter and a novel argument-based time-frequency SSPs detection are employed to improve the signal-to-noise ratio and signal sparsity of the observed signals, respectively. Then, the mixing matrix is obtained by using clustering algorithms. Secondly, to obtain the optimal solution of underdetermined sparse component analysis, the smoothed norm (SL0) is introduced to preliminarily achieve signal separation in the time-frequency domain. Finally, time-frequency ridge estimation is proposed to jointly enhance the reconstruction accuracy of the MIMO radar signals, and the time domain waveforms are recovered by the model of the signals. Simulations illustrate the validity of the method and show that the proposed method outperforms the traditional methods in source separation, especially in the non-cooperative electromagnetic case where the prior information is unknown. - 21 February 2017
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 36 (11) , 4453-4467
Underdetermined Mixing Matrix Estimation Algorithm Based on Single Source Points
- 21 February 2017
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 36 (11) , 4453-4467
Underdetermined Mixing Matrix Estimation Algorithm Based on Single Source Points