Statistical feature selection of narrowband RCS sequence based on greedy algorithm

Xuehui Lei, Xiongjun Fu*, Cai Wang, Meiguo Gao

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

15 Citations (Scopus)

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 languageEnglish
Title of host publicationProceedings of 2011 IEEE CIE International Conference on Radar, RADAR 2011
Pages1664-1667
Number of pages4
DOIs
Publication statusPublished - 2011
Event6th International Conference on Radar, RADAR 2011 - Chengdu, China
Duration: 24 Oct 201127 Oct 2011

Publication series

NameProceedings of 2011 IEEE CIE International Conference on Radar, RADAR 2011
Volume2

Conference

Conference6th International Conference on Radar, RADAR 2011
Country/TerritoryChina
CityChengdu
Period24/10/1127/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