Combinatorics reduction for target recognition in ATR applications

Kashi Rao

doi:10.1117/12.138292

16 September 1992 Combinatorics reduction for target recognition in ATR applications

Kashi Rao

Proceedings Volume 1700, Automatic Object Recognition II; (1992) https://doi.org/10.1117/12.138292
Event: Aerospace Sensing, 1992, Orlando, FL, United States

Abstract

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.

Citation Download Citation

Kashi Rao "Combinatorics reduction for target recognition in ATR applications", Proc. SPIE 1700, Automatic Object Recognition II, (16 September 1992); https://doi.org/10.1117/12.138292

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available