GMG: A Guaranteed, Efficient Global Optimization Algorithm for Remote Sensing.

D' ; Helon, CD

Oak Ridge National Laboratory

关键词: Remote Sensing;    36 Materials Science;    Targets;    Optimization;    Algorithms;   

DOI  :  10.2172/885863
RP-ID  :  ORNL/TM-2004/94
RP-ID  :  DE-AC05-00OR22725
RP-ID  :  885863

美国|英语

来源: UNT Digital Library

【 摘 要 】

The monocular passive ranging (MPR) problem in remote sensing consists of identifying the precise range of an airborne target (missile, plane, etc.) from its observed radiance. This inverse problem may be set as a global optimization problem (GOP) whereby the difference between the observed and model predicted radiances is minimized over the possible ranges and atmospheric conditions. Using additional information about the error function between the predicted and observed radiances of the target, we developed GMG, a new algorithm to find the Global Minimum with a Guarantee. The new algorithm transforms the original continuous GOP into a discrete search problem, thereby guaranteeing to find the position of the global minimum in a reasonably short time. The algorithm is first applied to the golf course problem, which serves as a litmus test for its performance in the presence of both complete and degraded additional information. GMG is further assessed on a set of standard benchmark functions and then applied to various realizations of the MPR problem.