Abstract
Greedy algorithm is introduced to select the statistical features of narrowband RCS sequences. A novel cost function for Greedy algorithm is proposed. The experiment results demonstrate the rationality of the novel cost function and the effectiveness of Greedy algorithm.
Original language | English |
---|---|
Title of host publication | Proceedings of 2011 IEEE CIE International Conference on Radar, RADAR 2011 |
Pages | 1664-1667 |
Number of pages | 4 |
DOIs | |
Publication status | Published - 2011 |
Event | 6th International Conference on Radar, RADAR 2011 - Chengdu, China Duration: 24 Oct 2011 → 27 Oct 2011 |
Publication series
Name | Proceedings of 2011 IEEE CIE International Conference on Radar, RADAR 2011 |
---|---|
Volume | 2 |
Conference
Conference | 6th International Conference on Radar, RADAR 2011 |
---|---|
Country/Territory | China |
City | Chengdu |
Period | 24/10/11 → 27/10/11 |
Keywords
- Cost function
- Feature selection
- Greedy algorithm
- Narrowband RCS sequence
- Target recognition
Fingerprint
Dive into the research topics of 'Statistical feature selection of narrowband RCS sequence based on greedy algorithm'. Together they form a unique fingerprint.Cite this
Lei, X., Fu, X., Wang, C., & Gao, M. (2011). Statistical feature selection of narrowband RCS sequence based on greedy algorithm. In Proceedings of 2011 IEEE CIE International Conference on Radar, RADAR 2011 (pp. 1664-1667). Article 6159886 (Proceedings of 2011 IEEE CIE International Conference on Radar, RADAR 2011; Vol. 2). https://doi.org/10.1109/CIE-Radar.2011.6159886