You are here

ANALYSIS OF ATR PROBLEM COMPLEXITY AND SCALABILITY

Award Information
Agency: Department of Defense
Branch: Air Force
Contract: N/A
Agency Tracking Number: 40221
Amount: $99,994.00
Phase: Phase I
Program: STTR
Solicitation Topic Code: N/A
Solicitation Number: N/A
Timeline
Solicitation Year: N/A
Award Year: 1998
Award Start Date (Proposal Award Date): N/A
Award End Date (Contract End Date): N/A
Small Business Information
50 MALL ROAD
Burlington, MA 01803
United States
DUNS: N/A
HUBZone Owned: No
Woman Owned: No
Socially and Economically Disadvantaged: No
Principal Investigator
 Dr. William W. Irving
 () -
Business Contact
 ANDREW S MULLIN
Phone: () -
Research Institution
 New York University
 DAVID W. MCLAUGHLIN 
 
251 MERCER STREET
NEW YORK, NY 10012
United States

 Nonprofit College or University
Abstract

An important problem in the analysis of ATR systems is quantifying the growth of algorithm requirements, such as storage and processing cost, as the input problem l situation in classical complexity analysis, where the notion of input size is well-defined, there does not currenlty exist a clear notion of input size for the ATR problem. In this effort, we develop a measure of ATR problem size that is akin to e provides a numerical assessment of ATR problem complexity that logically orders ATR problems by intrinsic difficulty and is tractable to compute. We then establish the utility of the measure for estimating an ATR's ability to scale to larger mission probelms for which it has not been trained. Finally, as a byproduct of the effort, we provide approaches to constructing recognition algorithms which are in a certain sense minimal.

* Information listed above is at the time of submission. *

US Flag An Official Website of the United States Government