Abstract

We investigate the complexity of template-based ATR algorithms using SAR imagery as an example. Performance measures (such as Pid) of such algorithms typically improve with increasing number of stored reference templates. This presumes, of course, that the training templates contain adequate statistical sampling of the range of observed or test templates. The tradeoff of improved performance is that computational complexity and the expense of algorithm development training template generation (synthetic and/or experimental) increases as well. Therefore, for practical implementations it is useful to characterize ATR problem complexity and to identify strategies to mitigate it. We adopt for this problem a complexity metric defined simply as the size of the minimal subset of stored templates drawn from an available training population that yields a specified Pid. Straightforward enumeration and testing of all possible template sets leads to a combinatorial explosion. Here we consider template selection strategies that are far more practical and apply these to a SAR- and template-based target identification problem. Our database of training templates consists of targets viewed at 3-degree increments in pose (azimuth). The template selection methods we investigate include uniform sampling, sequential forward search (also known as greedy selection), and adaptive floating search. The numerical results demonstrate that the complexity metric increases with intrinsic problem difficulty, and that template sets selected using the greedy method significantly outperform uniformly sampled template sets of the same size. The adaptive method, which is far more computationally expensive, selects template sets that outperform those selected by the greedy technique, but the small reduction in template set size was not significant for the specific examples considered here.© (2001) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.