Chenyan Xue
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Chenyan Xue has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Daiyin Zhu
Key Laboratory of Radar Imaging and Microwave Photonics, Ministry of Education, School of Electronic Information Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, China
4 shared publications - Ling Wang
Key Laboratory of Radar Imaging and Microwave Photonics of the Ministry of Education, Nanjing University of Aeronautics and Astronautics, Nanjing, China
4 shared publications - Changyu Hu
School of Electronic Information Engineering, Wuxi University, Wuxi 214063, China
1 shared publication Daiyin Zhu
Key Laboratory of Radar Imaging and Microwave Photonics of the Ministry of Education, Nanjing University of Aeronautics and Astronautics, Nanjing, China
1 shared publication- Difei Wang
College of Economics and Management, Nanjing University of Aeronautics and Astronautics, Nanjing, China
1 shared publication - Fengyuan Cao1 shared publication
Latest Publications
- Open Access
Resource Optimization for Multi-Unmanned Aerial Vehicle Formation Communication Based on an Improved Deep Q-Network
With the widespread application of unmanned aerial vehicle (UAV) formation technology, it is very important to maintain good communication quality with the limited power and spectrum resources that are available. To maximize the transmission rate and increase the successful data transfer probability simultaneously, the convolutional block attention module (CBAM) and value decomposition network (VDN) algorithm were introduced on the basis of a deep Q-network (DQN) for a UAV formation communication system. To make full use of the frequency, this manuscript considers both the UAV-to-base station (U2B) and the UAV-to-UAV (U2U) links, and the U2B links can be reused by the U2U communication links. In the DQN, the U2U links, which are treated as agents, can interact with the system and they intelligently learn how to choose the best power and spectrum. The CBAM affects the training results along both the channel and spatial aspects. Moreover, the VDN algorithm was introduced to solve the problem of partial observation in one UAV using distributed execution by decomposing the team q-function into agent-wise q-functions through the VDN. The experimental results showed that the improvement in data transfer rate and the successful data transfer probability was obvious.
Open AccessResource Optimization for Multi-Unmanned Aerial Vehicle Formation Communication Based on an Improved Deep Q-Network
With the widespread application of unmanned aerial vehicle (UAV) formation technology, it is very important to maintain good communication quality with the limited power and spectrum resources that are available. To maximize the transmission rate and increase the successful data transfer probability simultaneously, the convolutional block attention module (CBAM) and value decomposition network (VDN) algorithm were introduced on the basis of a deep Q-network (DQN) for a UAV formation communication system. To make full use of the frequency, this manuscript considers both the UAV-to-base station (U2B) and the UAV-to-UAV (U2U) links, and the U2B links can be reused by the U2U communication links. In the DQN, the U2U links, which are treated as agents, can interact with the system and they intelligently learn how to choose the best power and spectrum. The CBAM affects the training results along both the channel and spatial aspects. Moreover, the VDN algorithm was introduced to solve the problem of partial observation in one UAV using distributed execution by decomposing the team q-function into agent-wise q-functions through the VDN. The experimental results showed that the improvement in data transfer rate and the successful data transfer probability was obvious.
- Open Access
Joint Aperture and Power Allocation Strategy for a Radar Network Localization System Based on Low Probability of Interception Optimization
In the process of using the Distributed Radar Network Localization System (DRNLS) further to improve the survivability of a carrier platform, the random characteristics of the system’s Aperture Resource Allocation (ARA) and Radar Cross Section (RCS) are often not fully considered. However, the random characteristics of the system’s ARA and RCS will affect the power resource allocation of the DRNLS to a certain extent, and the allocation result is an essential factor determining the performance of the DRNLS’s Low Probability of Intercept (LPI). Therefore, a DRNLS still has some limitations in practical application. In order to solve this problem, a joint allocation scheme of aperture and power for the DRNLS based on LPI optimization (JA scheme) is proposed. In the JA scheme, the fuzzy random Chance Constrained Programmin model for radar antenna aperture resource management (RAARM-FRCCP model) can minimize the number of elements under the given pattern parameters. The random Chance Constrained Programmin model for minimizing Schleher Intercept Factor (MSIF-RCCP model) built on this basis can be used to achieve DRNLS optimal control of LPI performance on the premise of ensuring system tracking performance requirements. The results show that when RCS has some randomness, its corresponding uniform power distribution result is not necessarily the optimal scheme. Under the condition of meeting the same tracking performance, the required number of elements and power will be reduced to a certain extent compared with the number of elements in the whole array and the power corresponding to the uniform distribution. The lower the confidence level is, the more times the threshold is allowed to pass, and the lower the power is, so that the DRNLS can have better LPI performance.
Open AccessJoint Aperture and Power Allocation Strategy for a Radar Network Localization System Based on Low Probability of Interception Optimization
In the process of using the Distributed Radar Network Localization System (DRNLS) further to improve the survivability of a carrier platform, the random characteristics of the system’s Aperture Resource Allocation (ARA) and Radar Cross Section (RCS) are often not fully considered. However, the random characteristics of the system’s ARA and RCS will affect the power resource allocation of the DRNLS to a certain extent, and the allocation result is an essential factor determining the performance of the DRNLS’s Low Probability of Intercept (LPI). Therefore, a DRNLS still has some limitations in practical application. In order to solve this problem, a joint allocation scheme of aperture and power for the DRNLS based on LPI optimization (JA scheme) is proposed. In the JA scheme, the fuzzy random Chance Constrained Programmin model for radar antenna aperture resource management (RAARM-FRCCP model) can minimize the number of elements under the given pattern parameters. The random Chance Constrained Programmin model for minimizing Schleher Intercept Factor (MSIF-RCCP model) built on this basis can be used to achieve DRNLS optimal control of LPI performance on the premise of ensuring system tracking performance requirements. The results show that when RCS has some randomness, its corresponding uniform power distribution result is not necessarily the optimal scheme. Under the condition of meeting the same tracking performance, the required number of elements and power will be reduced to a certain extent compared with the number of elements in the whole array and the power corresponding to the uniform distribution. The lower the confidence level is, the more times the threshold is allowed to pass, and the lower the power is, so that the DRNLS can have better LPI performance.
- Open Access
- 25 February 2023
- Published by MDPI AG in Remote Sensing
- Vol. 15 (5) , 1267
An Extended Robust Chance-Constrained Power Allocation Scheme for Multiple Target Localization of Digital Array Radar in Strong Clutter Environments
The traditional power allocation method for multi-target localization adopts the Robust Chance Constrained Power Allocation Scheme (RCC-PA), which does not consider the strong clutter characteristics in the current radar detection environment. However, how to reasonably allocate the power required for the radar to locate the target in the strong clutter is a fundamental challenge for improving the combat capability of the radar. Since Simultaneous Multi-beam Digital Array Radar (SM-DAR) can provide high-resolution information on targets in strong clutter, this paper extends the RCC-PA scheme to strong clutter and introduce an extended target model suitable for high-resolution SM-DAR. At the same time, the Gamma distribution is used to reflect the statistical characteristics of the Radar Cross Section (RCS) so that the extended RCC-PA scheme (ERCC-PA) can be suitable for all the scatterers whose RCS belong to Gamma distribution families. In the ERCC-PA scheme, the Strong Clutter Information Reduction Factor (SCIRF) of the extended target is first derived. Then, a Gamma Chance-constraint Programming Model (-CCP model) is constructed to optimize the power allocation for locating multiple extended targets in strong clutter. The extended dichotomy method for power allocation is also given. Theoretical analysis shows that the power of multi-target localization in strong clutter can still be reasonably allocated under the target with multi-measurement characteristics. In addition, the power distribution of multi-target localization in the strong clutter is negatively correlated with the shape parameter of the Gamma distribution. Specifically, the larger the shape parameter characterizes the larger individual strong scatterer, resulting in the SM-DAR requiring less positioning power. The experimental results verify the theoretical analysis and show that the ERCC-PA scheme can improve the utilization of power compared with the benchmark and has the advantage of robustness to the fluctuation of the target RCS.- 25 February 2023
- Published by MDPI AG in Remote Sensing
- Vol. 15 (5) , 1267
Open AccessAn Extended Robust Chance-Constrained Power Allocation Scheme for Multiple Target Localization of Digital Array Radar in Strong Clutter Environments
The traditional power allocation method for multi-target localization adopts the Robust Chance Constrained Power Allocation Scheme (RCC-PA), which does not consider the strong clutter characteristics in the current radar detection environment. However, how to reasonably allocate the power required for the radar to locate the target in the strong clutter is a fundamental challenge for improving the combat capability of the radar. Since Simultaneous Multi-beam Digital Array Radar (SM-DAR) can provide high-resolution information on targets in strong clutter, this paper extends the RCC-PA scheme to strong clutter and introduce an extended target model suitable for high-resolution SM-DAR. At the same time, the Gamma distribution is used to reflect the statistical characteristics of the Radar Cross Section (RCS) so that the extended RCC-PA scheme (ERCC-PA) can be suitable for all the scatterers whose RCS belong to Gamma distribution families. In the ERCC-PA scheme, the Strong Clutter Information Reduction Factor (SCIRF) of the extended target is first derived. Then, a Gamma Chance-constraint Programming Model (-CCP model) is constructed to optimize the power allocation for locating multiple extended targets in strong clutter. The extended dichotomy method for power allocation is also given. Theoretical analysis shows that the power of multi-target localization in strong clutter can still be reasonably allocated under the target with multi-measurement characteristics. In addition, the power distribution of multi-target localization in the strong clutter is negatively correlated with the shape parameter of the Gamma distribution. Specifically, the larger the shape parameter characterizes the larger individual strong scatterer, resulting in the SM-DAR requiring less positioning power. The experimental results verify the theoretical analysis and show that the ERCC-PA scheme can improve the utilization of power compared with the benchmark and has the advantage of robustness to the fluctuation of the target RCS. - 6 October 2022
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 608
An extended scale-free network evolution model based on star-like coupling motif embedding
- 6 October 2022
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 608
An extended scale-free network evolution model based on star-like coupling motif embedding
- Open Access
Slow-Time Code Design for Space-Time Adaptive Processing in Airborne Radar
Space-time adaptive processing (STAP) techniques have been motivated as a key enabling technology for advanced airborne radar applications. In this paper, a slow-time code design is considered for the STAP technique in airborne radar, and the principle for improving signal-to-clutter and noise ratio (SCNR) based on slow-time coding is given. We present two algorithms for the optimization of transmitted codes under the energy constraint on a predefined area of spatial-frequency and Doppler-frequency plane. The proposed algorithms are constructed based on convex optimization (CVX) and alternating direction (AD), respectively. Several criteria regarding parameter selection are also given for the optimization process. Numerical examples show the feasibility and effectiveness of the proposed methods.
Open AccessSlow-Time Code Design for Space-Time Adaptive Processing in Airborne Radar
Space-time adaptive processing (STAP) techniques have been motivated as a key enabling technology for advanced airborne radar applications. In this paper, a slow-time code design is considered for the STAP technique in airborne radar, and the principle for improving signal-to-clutter and noise ratio (SCNR) based on slow-time coding is given. We present two algorithms for the optimization of transmitted codes under the energy constraint on a predefined area of spatial-frequency and Doppler-frequency plane. The proposed algorithms are constructed based on convex optimization (CVX) and alternating direction (AD), respectively. Several criteria regarding parameter selection are also given for the optimization process. Numerical examples show the feasibility and effectiveness of the proposed methods.
- Open Access
Dwell Time Allocation Algorithm for Multiple Target Tracking in LPI Radar Network Based on Cooperative Game
To solve the problem of dwell time management for multiple target tracking in Low Probability of Intercept (LPI) radar network, a Nash bargaining solution (NBS) dwell time allocation algorithm based on cooperative game theory is proposed. This algorithm can achieve the desired low interception performance by optimizing the allocation of the dwell time of each radar under the constraints of the given target detection performance, minimizing the total dwell time of radar network. By introducing two variables, dwell time and target allocation indicators, we decompose the dwell time and target allocation into two subproblems. Firstly, combining the Lagrange relaxation algorithm with the Newton iteration method, we derive the iterative formula for the dwell time of each radar. The dwell time allocation of the radars corresponding to each target is obtained. Secondly, we use the fixed Hungarian algorithm to determine the target allocation scheme based on the dwell time allocation results. Simulation results show that the proposed algorithm can effectively reduce the total dwell time of the radar network, and hence, improve the LPI performance.
Open AccessDwell Time Allocation Algorithm for Multiple Target Tracking in LPI Radar Network Based on Cooperative Game
To solve the problem of dwell time management for multiple target tracking in Low Probability of Intercept (LPI) radar network, a Nash bargaining solution (NBS) dwell time allocation algorithm based on cooperative game theory is proposed. This algorithm can achieve the desired low interception performance by optimizing the allocation of the dwell time of each radar under the constraints of the given target detection performance, minimizing the total dwell time of radar network. By introducing two variables, dwell time and target allocation indicators, we decompose the dwell time and target allocation into two subproblems. Firstly, combining the Lagrange relaxation algorithm with the Newton iteration method, we derive the iterative formula for the dwell time of each radar. The dwell time allocation of the radars corresponding to each target is obtained. Secondly, we use the fixed Hungarian algorithm to determine the target allocation scheme based on the dwell time allocation results. Simulation results show that the proposed algorithm can effectively reduce the total dwell time of the radar network, and hence, improve the LPI performance.
- 17 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Geoscience and Remote Sensing Letters
- Vol. 16 (12) , 1849-1853
Subspace Learning Network: An Efficient ConvNet for PolSAR Image Classification
Land cover classification is an important part of the polarimetric synthetic aperture radar (PolSAR) image interpretation. The convolutional neural network (CNN) has been utilized to improve the classification accuracy recently. However, how to efficiently train the classification model with limited training samples while keeping the generalization performance is still a challenge. In this letter, we devise a subspace learning network (SSLNet) for PolSAR image classification, which can be trained more efficiently. First, a third-order polarimetric feature tensor is constructed using five-target decompositions to make full use of the prior knowledge. The tensor is then fed into a two-layer CNN in which the principal component analysis (PCA) is employed to learn the convolutional filters. Finally, the output features of the network are obtained by binary hashing and block-wise histograms, followed by the nearest neighbor (NN) classifier to complete the classification. Due to the simple learning strategy, the proposed SSLNet can be easily designed and efficiently trained. Experimental results on benchmark PolSAR data reveal that the SSLNet can achieve higher classification accuracy with limited training samples than the conventional CNN method.
- 17 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Geoscience and Remote Sensing Letters
- Vol. 16 (12) , 1849-1853
Subspace Learning Network: An Efficient ConvNet for PolSAR Image Classification
Land cover classification is an important part of the polarimetric synthetic aperture radar (PolSAR) image interpretation. The convolutional neural network (CNN) has been utilized to improve the classification accuracy recently. However, how to efficiently train the classification model with limited training samples while keeping the generalization performance is still a challenge. In this letter, we devise a subspace learning network (SSLNet) for PolSAR image classification, which can be trained more efficiently. First, a third-order polarimetric feature tensor is constructed using five-target decompositions to make full use of the prior knowledge. The tensor is then fed into a two-layer CNN in which the principal component analysis (PCA) is employed to learn the convolutional filters. Finally, the output features of the network are obtained by binary hashing and block-wise histograms, followed by the nearest neighbor (NN) classifier to complete the classification. Due to the simple learning strategy, the proposed SSLNet can be easily designed and efficiently trained. Experimental results on benchmark PolSAR data reveal that the SSLNet can achieve higher classification accuracy with limited training samples than the conventional CNN method.