Detection Theory for Radar
From Optimal Detection to Adaptive Thresholding
Having formed the range-Doppler map, we must decide which cells contain targets and which are noise. The Neyman-Pearson framework (FSI Ch 01) gives the optimal detector when the noise statistics are known. In practice, the noise level varies with range, clutter, and interference — so the threshold must adapt. This is the role of CFAR (constant false alarm rate) detectors.
For imaging, detection applies per-pixel: each voxel in the reconstructed image is tested against a local noise estimate.
Definition: Neyman-Pearson Detection in Radar
Neyman-Pearson Detection in Radar
The binary hypothesis test for a single range-Doppler cell:
where is the matched filter output, is the unknown target amplitude, and .
The Neyman-Pearson detector compares the test statistic to a threshold :
where is set to achieve a desired false alarm probability: (for complex Gaussian noise with known variance ).
Definition: Cell-Averaging CFAR (CA-CFAR)
Cell-Averaging CFAR (CA-CFAR)
When the noise variance is unknown and varies with range, the CA-CFAR detector estimates it from neighboring cells.
For a cell under test (CUT) at range bin , the noise estimate uses reference cells (excluding guard cells on each side):
The detection rule is:
where the threshold multiplier for a desired is:
The guard cells prevent target energy from leaking into the noise estimate. The reference cells should contain only noise — if a strong target is in the reference window, the noise estimate is inflated and nearby weak targets are masked.
Definition: Order-Statistic CFAR (OS-CFAR)
Order-Statistic CFAR (OS-CFAR)
The OS-CFAR detector replaces the mean with an order statistic to be robust against interfering targets in the reference window.
Sort the reference cell powers: .
Choose the -th order statistic as the noise estimate:
typically with .
The detection rule is .
OS-CFAR is more robust than CA-CFAR at clutter edges and in multi-target environments, at the cost of slightly higher CFAR loss (reduced for the same ).
Theorem: Detection Probability for Swerling I Targets
For a Swerling I target (exponentially distributed RCS, constant across pulses within a CPI) with average per pulse , the single-pulse detection probability is:
For pulses with non-coherent integration (square-law combining), the detection probability increases but lacks a closed-form expression — it is computed via:
where is the CDF of a chi-squared distribution with degrees of freedom and .
Single-pulse case
Under with Swerling I, . .
Relate threshold to $P_{\text{fa}}$
Under , . , so .
Combine
.
Example: CA-CFAR Threshold Computation
A radar uses CA-CFAR with reference cells on each side and guard cells. Compute the threshold multiplier for . What is the CFAR loss compared to the ideal fixed-threshold detector?
Threshold multiplier
With total reference cells: .
CFAR loss
The CFAR loss is the additional required to achieve the same as a fixed-threshold detector with known . For , the CFAR loss is approximately dB — a modest penalty for robustness to unknown noise levels.
CFAR Detection Visualization
Apply CA-CFAR and OS-CFAR to a range profile with targets and clutter. Observe how the adaptive threshold tracks the noise floor and how targets near clutter edges are affected.
Parameters
Definition: M-out-of-N Binary Integration
M-out-of-N Binary Integration
Binary integration (also called post-detection integration) is a non-coherent technique: apply CFAR detection to each pulse independently, then declare a target present if at least out of pulses produce a detection.
For independent pulses with single-pulse detection probability and false alarm probability :
Binary integration is suboptimal compared to coherent integration but does not require pulse-to-pulse phase coherence.
Common Mistake: Target Masking in CA-CFAR
Mistake:
Using CA-CFAR when multiple targets may exist in the reference window, assuming that the noise estimate is unbiased.
Correction:
A strong target in the reference window inflates , raising the threshold and masking nearby weaker targets. This is the target masking problem.
Mitigations: (1) Use OS-CFAR, which selects an order statistic and is robust to a few outliers. (2) Use censored CA-CFAR, which removes outliers before averaging. (3) Use greatest-of (GO-CFAR) which takes the maximum of left and right reference windows, better handling clutter edges.
Historical Note: The Development of CFAR
1960s-1980sThe CFAR concept was developed in the 1960s as radar systems moved from operator-interpreted displays (where the human eye naturally adapted to varying noise levels) to automatic detection. Finn and Johnson (1968) published the first analysis of cell-averaging CFAR for exponential noise. Rohling (1983) introduced OS-CFAR to handle multi-target environments. The progression mirrors a broader theme in radar: replacing human judgment with principled statistical methods, exactly the path from visual interpretation to algorithmic reconstruction in RF imaging.
CFAR (Constant False Alarm Rate)
A detection scheme that adaptively estimates the noise power from reference cells surrounding the cell under test, maintaining a constant false alarm probability despite varying noise levels.
ROC (Receiver Operating Characteristic)
A curve plotting detection probability against false alarm probability as the decision threshold varies. Parameterized by and target model (Swerling type).
Quick Check
For a Swerling I target with and average dB (), what is the single-pulse detection probability?
.
Key Takeaway
CFAR detectors maintain constant by adaptively estimating the noise power from reference cells. CA-CFAR is optimal for homogeneous noise but suffers from target masking; OS-CFAR and GO-CFAR are more robust. For Swerling I targets, — fluctuating targets require significantly more than non-fluctuating ones.