Fei Song
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
Fei Song has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Limeng Dong
School of Electronics and Information, Northwestern Polytechnical University, Xian, China
2 shared publications - Wei Cheng
Northwestern Polytechnical University
2 shared publications - Yong Li
School of Electronics and Information, Northwestern Polytechnical University, Xi’an 710072, China
2 shared publications - Boyao Zhou
Department of Automation, Tsinghua University, Beijing, P.R.China
1 shared publication - Junfang Li
School of Electrical and Information Engineering, Xihang University, Xi’an 710077, China
1 shared publication Limeng Dong
School of Electronic Information, Northwestern Polytechnical University, Xi’an, China
1 shared publication
Latest Publications
- Open Access
- 19 May 2023
- Published by Springer Nature in EURASIP Journal on Advances in Signal Processing
- Vol. 2023 (1) , 1-18
An improved dynamic programming tracking-before-detection algorithm based on LSTM network
The detection and tracking of small and weak maneuvering radar targets in complex electromagnetic environments is still a difficult problem to effectively solve. To address this problem, this paper proposes a dynamic programming tracking-before-detection method based on a long short-term memory (LSTM) network (LSTM-DP-TBD). With the predicted target motion state provided by the LSTM network, the state transition range of the traditional DP-TBD algorithm can be updated in real time, and the detection and tracking effect achieved for maneuvering small and weak targets is also improved. Utilizing the LSTM network to model the moving state of the target, the moving features of the maneuvering target can be learned from the noisy input data. By incorporating these features into the traditional DP-TBD algorithm, the state transition set can be adjusted in time with the changes in the moving state of the target so that the new algorithm is capable of effectively recursively accumulating the movement trend of the maneuvering small and weak target. Simulation results show that the new algorithm is able to effectively accomplish the task of detecting and tracking maneuvering small and weak targets, and it achieves improved detection and tracking probabilities.
- 19 May 2023
- Published by Springer Nature in EURASIP Journal on Advances in Signal Processing
- Vol. 2023 (1) , 1-18
Open AccessAn improved dynamic programming tracking-before-detection algorithm based on LSTM network
The detection and tracking of small and weak maneuvering radar targets in complex electromagnetic environments is still a difficult problem to effectively solve. To address this problem, this paper proposes a dynamic programming tracking-before-detection method based on a long short-term memory (LSTM) network (LSTM-DP-TBD). With the predicted target motion state provided by the LSTM network, the state transition range of the traditional DP-TBD algorithm can be updated in real time, and the detection and tracking effect achieved for maneuvering small and weak targets is also improved. Utilizing the LSTM network to model the moving state of the target, the moving features of the maneuvering target can be learned from the noisy input data. By incorporating these features into the traditional DP-TBD algorithm, the state transition set can be adjusted in time with the changes in the moving state of the target so that the new algorithm is capable of effectively recursively accumulating the movement trend of the maneuvering small and weak target. Simulation results show that the new algorithm is able to effectively accomplish the task of detecting and tracking maneuvering small and weak targets, and it achieves improved detection and tracking probabilities.
- Open Access
- 15 February 2023
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2023, 1-9
Learning to Track Multiple Radar Targets with Long Short-Term Memory Networks
Radar multitarget tracking in a dense clutter environment remains a complex problem to be solved. Most existing solutions still rely on complex motion models and prior distribution knowledge. In this paper, a new online tracking method based on a long short-term memory (LSTM) network is proposed. It combines state prediction, measurement association, and trajectory management functions in an end-to-end manner. We employ LSTM networks to model target motion and trajectory associations, relying on their strong learning ability to learn target motion properties and long-term dependence of trajectory associations from noisy data. Moreover, to address the problem of missing appearance information of radar targets, we propose an architecture based on the LSTM network to calculate similarity function by extracting long-term motion features. And the similarity is applied to trajectory associations to improve their robustness. Our proposed method is validated in simulation scenarios and achieves good results.
- 15 February 2023
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2023, 1-9
Open AccessLearning to Track Multiple Radar Targets with Long Short-Term Memory Networks
Radar multitarget tracking in a dense clutter environment remains a complex problem to be solved. Most existing solutions still rely on complex motion models and prior distribution knowledge. In this paper, a new online tracking method based on a long short-term memory (LSTM) network is proposed. It combines state prediction, measurement association, and trajectory management functions in an end-to-end manner. We employ LSTM networks to model target motion and trajectory associations, relying on their strong learning ability to learn target motion properties and long-term dependence of trajectory associations from noisy data. Moreover, to address the problem of missing appearance information of radar targets, we propose an architecture based on the LSTM network to calculate similarity function by extracting long-term motion features. And the similarity is applied to trajectory associations to improve their robustness. Our proposed method is validated in simulation scenarios and achieves good results.
- Open Access
- 1 January 2022
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2022 (1)
An Improved Kalman Filter Based on Long Short‐Memory Recurrent Neural Network for Nonlinear Radar Target Tracking
The target tracking of nonlinear maneuvering radar in dense clutter environments is still an important but difficult problem to be solved effectively. Traditional solutions often rely on motion models and prior distributions. This paper presents a novel improved architecture of Kalman filter based on a recursive neural network, which combines the sequence learning of recurrent neural networks with the precise prediction of Kalman filter in an end‐to‐end manner. We employ three LSTM networks to model nonlinear motion equation, motion noise, and measurement noise, respectively, and learn their long‐term dependence from a large amount of training data. They are then applied to the prediction and update process of Kalman filter to calculate the estimated target state. Our approach is able to address the tracking problem of nonlinear maneuvering radar target online end‐to‐end and does not require the motion models and prior distributions. Experimental results show that our method is more effective and faster than the traditional methods and more accurate than the method with LSTM network alone.
- 1 January 2022
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2022 (1)
Open AccessAn Improved Kalman Filter Based on Long Short‐Memory Recurrent Neural Network for Nonlinear Radar Target Tracking
The target tracking of nonlinear maneuvering radar in dense clutter environments is still an important but difficult problem to be solved effectively. Traditional solutions often rely on motion models and prior distributions. This paper presents a novel improved architecture of Kalman filter based on a recursive neural network, which combines the sequence learning of recurrent neural networks with the precise prediction of Kalman filter in an end‐to‐end manner. We employ three LSTM networks to model nonlinear motion equation, motion noise, and measurement noise, respectively, and learn their long‐term dependence from a large amount of training data. They are then applied to the prediction and update process of Kalman filter to calculate the estimated target state. Our approach is able to address the tracking problem of nonlinear maneuvering radar target online end‐to‐end and does not require the motion models and prior distributions. Experimental results show that our method is more effective and faster than the traditional methods and more accurate than the method with LSTM network alone.
- 9 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1886-1891
Transfer Learning for Gene Ranking across Cancers
Understanding the mechanisms of the disease and discovering the underlying pathogenic genes is very important for human health and applications. Therefore, it is vital to rank potential genes and find out the interrelationships between diseases and genes. Current algorithms rely heavily on different types of biological networks, which come from biological experiments and related literature. As a result, they will get unsatisfactory results when similar diseases’ information is insufficient. To overcome this problem, we propose the Transfer Learning for Gene Ranking across Cancers algorithm (called GRTL). Specifically, GRTL decomposes the source and target gene expression data jointly. The feature matrices are also decomposed into the shared part and the special part. We also constrain the special part with label information and let them orthogonal to ensure diversity. Then, GRTL automatically learns an affinity graph via common knowledge. Finally, we prioritize genes with gene ranking algorithm. Experimental results demonstrate that the proposed algorithm is more accurate than state-of-the-art methods on the mutation and cancer dataset. The proposed model provides a novel way to find new interrelationships between genes and similar diseases.
- 9 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1886-1891
Transfer Learning for Gene Ranking across Cancers
Understanding the mechanisms of the disease and discovering the underlying pathogenic genes is very important for human health and applications. Therefore, it is vital to rank potential genes and find out the interrelationships between diseases and genes. Current algorithms rely heavily on different types of biological networks, which come from biological experiments and related literature. As a result, they will get unsatisfactory results when similar diseases’ information is insufficient. To overcome this problem, we propose the Transfer Learning for Gene Ranking across Cancers algorithm (called GRTL). Specifically, GRTL decomposes the source and target gene expression data jointly. The feature matrices are also decomposed into the shared part and the special part. We also constrain the special part with label information and let them orthogonal to ensure diversity. Then, GRTL automatically learns an affinity graph via common knowledge. Finally, we prioritize genes with gene ranking algorithm. Experimental results demonstrate that the proposed algorithm is more accurate than state-of-the-art methods on the mutation and cancer dataset. The proposed model provides a novel way to find new interrelationships between genes and similar diseases.
- Open Access
- 27 August 2018
- Published by Association for Computing Machinery (ACM)
- p. 1-5
Anomaly Detection and Explanation Discovery on Event Streams
- 27 August 2018
- Published by Association for Computing Machinery (ACM)
- p. 1-5
Open AccessAnomaly Detection and Explanation Discovery on Event Streams