Combinatorics reduction for target recognition in ATR applications
Kashi Rao · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1992
Object recognition is by nature a combinatorially explosive problem, and the combinatorics is especially worse when recognizing a 3-D object from a single 2-D image. This is because of the large search space consisting of all the possible viewing angles, translation parameters and object models. Thus there is a need to develop methods to reduce the search combinatorics. Towards this end we have developed methods to reduce search combinatorics in target recognition in ATR applications. Some of these methods make use of domain specific information leading to what are called strong search methods in artificial intelligence. Other methods use more general methods leading to what are called weak methods. In this paper we discuss one of the strong methods we have developed.