Performance of order statistic clutter MAP CFAR

Tao Shan, Ran Tao, Yue Wang, Siyong Zhou

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

7 Citations (Scopus)

Abstract

Cell average clutter map CFAR (CACM-CFAR) is analyzed at first. CACM-CFAR has better performance in the inhomogeneous clutter environment, but is affected by interference and self-masking[1] which will cause the low probability of detection. To solve these problems, a novel algorithm named order statistic clutter map CFAR (OSCM-CFAR) is proposed, in which the clutter map is updated by the k-th ranked cell in the clutter map cell. The performance analysis shows that the probability of detection for slow moving targets will be increased by using OSCM-CFAR algorithm. And the same case occurs in multi-target environment when the new method is used.

Original languageEnglish
Title of host publicationICSP 2002 - 2002 6th International Conference on Signal Processing, Proceedings
EditorsXiaofang Tang, Baozong Yuan
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1572-1575
Number of pages4
ISBN (Electronic)0780374886
DOIs
Publication statusPublished - 2002
Event6th International Conference on Signal Processing, ICSP 2002 - Beijing, China
Duration: 26 Aug 200230 Aug 2002

Publication series

NameInternational Conference on Signal Processing Proceedings, ICSP
Volume2

Conference

Conference6th International Conference on Signal Processing, ICSP 2002
Country/TerritoryChina
CityBeijing
Period26/08/0230/08/02

Keywords

  • Clutter map
  • Order statistic

Fingerprint

Dive into the research topics of 'Performance of order statistic clutter MAP CFAR'. Together they form a unique fingerprint.

Cite this