Jian Yang
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
Research Subjects
Jian Yang has a total of 94 co-authors. Here are the top co-authors by number of shared publications:
Jian Lu
96921 Troops of the Chinese People’s Liberation Army
10 shared publications- Jian Lu
School of Engineering, Rocket Force University of Engineering, Xi’an 710025, China
7 shared publications Guangbin Liu
School of Engineering Rocket Force University of Engineering Xi’an People’s Republic of China
6 shared publicationsZhicheng Yao
Rocket Force University of Engineering
5 shared publicationsYue Zhang
National Key Laboratory of Science and Technology on Automatic Target Recognition, National University of Defense Technology, Changsha, China
4 shared publicationsZhi Geng
Logistics Information Center, Former Joint Logistics Department of Chengdu Command
4 shared publications
Latest Publications
- Open Access
- 14 July 2026
- Published by MDPI AG in Remote Sensing
- Vol. 18 (14) , 2344
IC-EWH: Energy-Weighted Hough Transform with Iterative Curvature Compensation for Squint Angle Estimation of Highly Squinted SAR
Accurate estimation of the Doppler centroid is a prerequisite for achieving high-quality Synthetic Aperture Radar imaging. In highly squinted working scenarios, traditional frequency-domain methods depend on antenna pattern fitting. They are easily affected by pattern mismatch and strong scatterer interference. In addition, these methods cannot directly determine the Doppler ambiguity number. The range envelope-based Hough transform can correct linear range walk. It further realizes Doppler centroid estimation without ambiguity. However, range curvature hinders its estimation accuracy. To solve the above problem, this paper proposes a novel squint angle estimation scheme. The scheme organically combines closed-loop iterative range curvature compensation and energy-weighted Hough transform. Within a closed-loop iterative architecture comprising curvature compensation, line feature extraction, direction measurement, and angle refinement, the presented method progressively rectifies curved trajectories, yields robust squint angle estimates, and further derives the unambiguous Doppler centroid indirectly. Both simulated datasets and real airborne SAR measurements demonstrate the effectiveness and robustness of the proposed method.
- 14 July 2026
- Published by MDPI AG in Remote Sensing
- Vol. 18 (14) , 2344
Open AccessIC-EWH: Energy-Weighted Hough Transform with Iterative Curvature Compensation for Squint Angle Estimation of Highly Squinted SAR
Accurate estimation of the Doppler centroid is a prerequisite for achieving high-quality Synthetic Aperture Radar imaging. In highly squinted working scenarios, traditional frequency-domain methods depend on antenna pattern fitting. They are easily affected by pattern mismatch and strong scatterer interference. In addition, these methods cannot directly determine the Doppler ambiguity number. The range envelope-based Hough transform can correct linear range walk. It further realizes Doppler centroid estimation without ambiguity. However, range curvature hinders its estimation accuracy. To solve the above problem, this paper proposes a novel squint angle estimation scheme. The scheme organically combines closed-loop iterative range curvature compensation and energy-weighted Hough transform. Within a closed-loop iterative architecture comprising curvature compensation, line feature extraction, direction measurement, and angle refinement, the presented method progressively rectifies curved trajectories, yields robust squint angle estimates, and further derives the unambiguous Doppler centroid indirectly. Both simulated datasets and real airborne SAR measurements demonstrate the effectiveness and robustness of the proposed method.
- Open Access
- 21 February 2026
- Published by Springer Nature in Complex & Intelligent Systems
- Vol. 12 (3)
CF-STAR: Highly compressible adapters for model merging via centralized task vectors
Model merging offers a training-free solution to the prohibitive storage costs of the one-model-per-task paradigm. However, current merging techniques present a difficult trade-off. Creating a single model is storage-efficient but hurts performance, while adapter-based methods perform well but introduce a new storage burden. This work introduces CF-STAR, a framework that resolves this dilemma by creating highly compressible adapters. Our approach redefines the adapter itself. Instead of representing the deviation from a pre-trained model, our adapter is defined by the deviation from the multi-task average. We call this new representation the centralized task vector (CTV). This CTV represents a purer form of task-specific knowledge within the merging context, making it fundamentally more compressible. CF-STAR exploits this with a novel low-rank plus sparse decomposition tailored to this representation, capturing both global structure and critical details. Furthermore, the entire pipeline is designed to be synergistic with low-bit quantization, further enabling extreme compression. On diverse benchmarks spanning image classification, NLP, and dense prediction, CF-STAR sets a new state of the art on the accuracy-storage Pareto frontier, achieving up to $$40\times $$ adapter compression over strong baselines while maintaining competitive performance.- 21 February 2026
- Published by Springer Nature in Complex & Intelligent Systems
- Vol. 12 (3)
Open AccessCF-STAR: Highly compressible adapters for model merging via centralized task vectors
Model merging offers a training-free solution to the prohibitive storage costs of the one-model-per-task paradigm. However, current merging techniques present a difficult trade-off. Creating a single model is storage-efficient but hurts performance, while adapter-based methods perform well but introduce a new storage burden. This work introduces CF-STAR, a framework that resolves this dilemma by creating highly compressible adapters. Our approach redefines the adapter itself. Instead of representing the deviation from a pre-trained model, our adapter is defined by the deviation from the multi-task average. We call this new representation the centralized task vector (CTV). This CTV represents a purer form of task-specific knowledge within the merging context, making it fundamentally more compressible. CF-STAR exploits this with a novel low-rank plus sparse decomposition tailored to this representation, capturing both global structure and critical details. Furthermore, the entire pipeline is designed to be synergistic with low-bit quantization, further enabling extreme compression. On diverse benchmarks spanning image classification, NLP, and dense prediction, CF-STAR sets a new state of the art on the accuracy-storage Pareto frontier, achieving up to $$40\times $$ adapter compression over strong baselines while maintaining competitive performance. - 24 January 2026
- Published by Elsevier in Measurement
- Vol. 267
Research on hierarchical fusion optimization algorithm for dynamic allocation of multi-UAV radar resources
- 24 January 2026
- Published by Elsevier in Measurement
- Vol. 267
Research on hierarchical fusion optimization algorithm for dynamic allocation of multi-UAV radar resources
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 25, 19342-19354
Joint Information and Jamming Beamforming for Simultaneous Proactive Eavesdropping and Communication Systems
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 25, 19342-19354
Joint Information and Jamming Beamforming for Simultaneous Proactive Eavesdropping and Communication Systems
- Open Access
From Parameter to Representation: A Closed-Form Approach for Controllable Model Merging
Model merging combines expert models for multitask performance but faces challenges from parameter interference. This has sparked recent interest in controllable model merging, giving users the ability to explicitly balance performance trade-offs. Existing approaches employ a compile-then-query paradigm, performing a costly offline multi-objective optimization to enable fast, preference-aware model generation. This offline stage typically involves iterative search or dedicated training, with complexity that grows exponentially with the number of tasks. To overcome these limitations, we shift the perspective from parameter-space optimization to a direct correction of the model's final representation. Our approach models this correction as an optimal linear transformation, yielding a closed-form solution that replaces the entire offline optimization process with a single-step, architecture-agnostic computation. This solution directly incorporates user preferences, allowing a Pareto-optimal model to be generated on-the-fly with complexity that scales linearly with the number of tasks. Experimental results show our method generates a superior Pareto front with more precise preference alignment and drastically reduced computational cost.
Open AccessFrom Parameter to Representation: A Closed-Form Approach for Controllable Model Merging
Model merging combines expert models for multitask performance but faces challenges from parameter interference. This has sparked recent interest in controllable model merging, giving users the ability to explicitly balance performance trade-offs. Existing approaches employ a compile-then-query paradigm, performing a costly offline multi-objective optimization to enable fast, preference-aware model generation. This offline stage typically involves iterative search or dedicated training, with complexity that grows exponentially with the number of tasks. To overcome these limitations, we shift the perspective from parameter-space optimization to a direct correction of the model's final representation. Our approach models this correction as an optimal linear transformation, yielding a closed-form solution that replaces the entire offline optimization process with a single-step, architecture-agnostic computation. This solution directly incorporates user preferences, allowing a Pareto-optimal model to be generated on-the-fly with complexity that scales linearly with the number of tasks. Experimental results show our method generates a superior Pareto front with more precise preference alignment and drastically reduced computational cost.
- Open Access
- 10 September 2025
- Published by MDPI AG in Micromachines
- Vol. 16 (9) , 1038
Optimized Design of Sparse Antenna Array for 2D Subarrays Based on GA-PSO Algorithm and Ambiguity Function
A sparse antenna array of subarrays can effectively reduce the digital channels of array antennas, system complexities, and hardware cost while simultaneously increasing the antenna aperture. In this study, a new optimal design is proposed for a sparse antenna array of subarrays in the full-phased multiple input multiple output (FPMIMO) operation mode based on genetic algorithm–particle swarm optimization (GA–PSO) and ambiguity functions. The proposed algorithm can adaptively adjust the number of optimization iterations for yielding the optimization results of the PSO algorithm and GA to ensure the global optimization performance of algorithms and combine ambiguity functions to determine the final optimized sparse antenna array of subarrays. The effectiveness of the proposed algorithm is verified via simulation tests.
- 10 September 2025
- Published by MDPI AG in Micromachines
- Vol. 16 (9) , 1038
Open AccessOptimized Design of Sparse Antenna Array for 2D Subarrays Based on GA-PSO Algorithm and Ambiguity Function
A sparse antenna array of subarrays can effectively reduce the digital channels of array antennas, system complexities, and hardware cost while simultaneously increasing the antenna aperture. In this study, a new optimal design is proposed for a sparse antenna array of subarrays in the full-phased multiple input multiple output (FPMIMO) operation mode based on genetic algorithm–particle swarm optimization (GA–PSO) and ambiguity functions. The proposed algorithm can adaptively adjust the number of optimization iterations for yielding the optimization results of the PSO algorithm and GA to ensure the global optimization performance of algorithms and combine ambiguity functions to determine the final optimized sparse antenna array of subarrays. The effectiveness of the proposed algorithm is verified via simulation tests.
- Open Access
- 29 January 2025
- Published by Institution of Engineering and Technology (IET) in IET Communications
- Vol. 19 (1)
Real‐world UAV recognition based on radio frequency fingerprinting with transformer
Many unmanned aerial vehicles (UAVs) require the installation of automatic dependent surveillance‐broadcast (ADS‐B) transponders to facilitate their daily management. However, since ADS‐B transponders do not have a good security mechanism, they introduce problems including impersonation, spoofing, and private changing of the registration number, making UAV surveillance inconvenient. Radio frequency fingerprinting (RFF) recognition is carried out by utilizing the fact that different electronic devices in a given transponder will affect the transmitted signals, resulting in the formation of RFF features that are unique to the transponder and difficult to forge. Therefore, in this work, a deep learning architecture is proposed to classify UAVs based on ADS‐B signals, and a multi‐head self‐attention RFF recognition model is constructed using variational mode decomposition (VMD) of the preamble data and a transformer encoder for validation. The model achieves better results in terms of noise, Doppler shifting, and multipath effect interference. This method demonstrates that the transformer architecture of natural language processing, combined with appropriate data preprocessing methods, can also be used for RFF recognition, and provides advantages in accuracy and robustness (67.83% vs. 64.17%).
- 29 January 2025
- Published by Institution of Engineering and Technology (IET) in IET Communications
- Vol. 19 (1)
Open AccessReal‐world UAV recognition based on radio frequency fingerprinting with transformer
Many unmanned aerial vehicles (UAVs) require the installation of automatic dependent surveillance‐broadcast (ADS‐B) transponders to facilitate their daily management. However, since ADS‐B transponders do not have a good security mechanism, they introduce problems including impersonation, spoofing, and private changing of the registration number, making UAV surveillance inconvenient. Radio frequency fingerprinting (RFF) recognition is carried out by utilizing the fact that different electronic devices in a given transponder will affect the transmitted signals, resulting in the formation of RFF features that are unique to the transponder and difficult to forge. Therefore, in this work, a deep learning architecture is proposed to classify UAVs based on ADS‐B signals, and a multi‐head self‐attention RFF recognition model is constructed using variational mode decomposition (VMD) of the preamble data and a transformer encoder for validation. The model achieves better results in terms of noise, Doppler shifting, and multipath effect interference. This method demonstrates that the transformer architecture of natural language processing, combined with appropriate data preprocessing methods, can also be used for RFF recognition, and provides advantages in accuracy and robustness (67.83% vs. 64.17%).
- Open Access
- 1 January 2025
- Published by Institution of Engineering and Technology (IET) in IET Communications
- Vol. 19 (1)
Parallel Double‐Loop Particle Swarm Optimisation for Offloading Strategy in Blockchain Based Cloud‐Edge‐End Collaborative Computation
Computing offloading strategies have emerged as a pivotal topic in IoT research, serving as a strategic approach to minimising latency and energy consumption in edge computing. Nevertheless, these advancements have also introduced new challenges, especially in the context of computationally intensive tasks and increasing data privacy requirements in IoT applications. Addressing these challenges requires innovative solutions, with blockchain technology emerging as a highly promising tool. Our work explores the integration of blockchain into IoT edge computing, specifically focusing on computing offloading. We have devised a system architecture that seamlessly integrates edge computing with blockchain technologies, aiming to tackle both optimisation and security concerns. By framing the offloading problem as a multi‐objective optimisation issue, we developed a Parallel Double‐Loop Particle Swarm Optimisation algorithm. This algorithm introduces a dual‐loop subpopulation structure based on broadcast feedback, which enhances information exchange between subpopulations and increases population diversity, thereby mitigating the risk of premature convergence to local optima. Moreover, an innovative collaborative mechanism is introduced, allowing multiple generations of updated particles to iterate simultaneously, significantly boosting the search efficiency of the population. Simulation results demonstrate that the PDPSO algorithm not only achieves significantly faster update speeds but also excels at identifying optimal solutions for the objective function. When compared to other existing algorithms, it offers superior overall performance and holds significant potential for addressing multidimensional constraints such as system delay and local energy consumption. Our findings suggest that this approach could be transformative for future IoT edge computing systems, providing a robust framework for efficient and secure task offloading.
- 1 January 2025
- Published by Institution of Engineering and Technology (IET) in IET Communications
- Vol. 19 (1)
Open AccessParallel Double‐Loop Particle Swarm Optimisation for Offloading Strategy in Blockchain Based Cloud‐Edge‐End Collaborative Computation
Computing offloading strategies have emerged as a pivotal topic in IoT research, serving as a strategic approach to minimising latency and energy consumption in edge computing. Nevertheless, these advancements have also introduced new challenges, especially in the context of computationally intensive tasks and increasing data privacy requirements in IoT applications. Addressing these challenges requires innovative solutions, with blockchain technology emerging as a highly promising tool. Our work explores the integration of blockchain into IoT edge computing, specifically focusing on computing offloading. We have devised a system architecture that seamlessly integrates edge computing with blockchain technologies, aiming to tackle both optimisation and security concerns. By framing the offloading problem as a multi‐objective optimisation issue, we developed a Parallel Double‐Loop Particle Swarm Optimisation algorithm. This algorithm introduces a dual‐loop subpopulation structure based on broadcast feedback, which enhances information exchange between subpopulations and increases population diversity, thereby mitigating the risk of premature convergence to local optima. Moreover, an innovative collaborative mechanism is introduced, allowing multiple generations of updated particles to iterate simultaneously, significantly boosting the search efficiency of the population. Simulation results demonstrate that the PDPSO algorithm not only achieves significantly faster update speeds but also excels at identifying optimal solutions for the objective function. When compared to other existing algorithms, it offers superior overall performance and holds significant potential for addressing multidimensional constraints such as system delay and local energy consumption. Our findings suggest that this approach could be transformative for future IoT edge computing systems, providing a robust framework for efficient and secure task offloading.