Abstract
Results of a study of adaptive threshold target detection and map-matching algorithms are presented. Log threshold processing is shown to be preferred over linear threshold processing when the clutter data surrounding the target cell is contaminated by other targets, decoy corner reflectors, or bright clutter cells. Whereas previous studies have resorted to extensive Monte-Carlo simulations of log threshold algorithms, the results were obtained using a novel analytical approach based upon Parseval's theorem.

This publication has 7 references indexed in Scilit: