Optimization of multiframe target detection schemes

We optimize the performance of multiframe target detection (MFTD) schemes under extended Neyman-Pearson (NP) criteria. Beyond the per-track detection performance for a specific target path in conventional MFTD studies, we optimize the overall detection performance which is averaged over all the potential target paths. It is shown that the overall MFTD performance is limited by the mobility of a target and also that optimality of MFTD performance depends on how fully one ran exploit the information about the target dynamics. We assume a single target situation and then present systematic optimization by formulating the MFTD problems as binary composite hypotheses testing problems. The resulting optimal solutions suggest computationally efficient implementation algorithms which are similar to the Viterbi algorithm for trellis search. The optimal performances for some typical types of target dynamics are evaluated via Monte-Carlo simulation