Joint MAP bias estimation and data association: simulations

Scott Danford; Bret Kragel; Aubrey Poore

doi:10.1117/12.735225

21 September 2007 Joint MAP bias estimation and data association: simulations

Scott Danford, Bret Kragel, Aubrey Poore

Proceedings Volume 6699, Signal and Data Processing of Small Targets 2007; 669915 (2007) https://doi.org/10.1117/12.735225
Event: Optical Engineering + Applications, 2007, San Diego, California, United States

Abstract

The problem of joint maximum a posteriori (MAP) bias estimation and data association belongs to a class of nonconvex mixed integer nonlinear programming problems. These problems are difficult to solve due to both the combinatorial nature of the problem and the nonconvexity of the objective function or constraints. Algorithms for this class of problems have been developed in a companion paper of the authors. This paper presents simulations that compare the "all-pairs" heuristic, the k-best heuristic, and a partial A*-based branch and bound algorithm. The combination of the latter two algorithms is an excellent candidate for use in a realtime system. For an optimal algorithm that also computes the k-best solutions of the joint MAP bias estimation problem and data association problem, we investigate a branch and bound framework that employs either a depth-first algorithm or an A*-search procedure. In addition, we demonstrate the improvements due to a new gating procedure.

Citation Download Citation

Scott Danford, Bret Kragel, and Aubrey Poore "Joint MAP bias estimation and data association: simulations", Proc. SPIE 6699, Signal and Data Processing of Small Targets 2007, 669915 (21 September 2007); https://doi.org/10.1117/12.735225

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