Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published July 1990 | Published
Book Section - Chapter Open

A nonconvex cost optimization approach to tracking multiple targets

Abstract

The problem of tracking multiple targets in the presence of displacement noise and clutter is formulated as a nonconvex optimization problem. The form of the suggested cost function is shown to be suitable for the Graduated Non-Convexity algorithm, which can be viewed as deterministic annealing. The method is first derived for the two-dimensional (spatial/temporal) case, and then generalized to the multi-dimensional case. The complexity grows linearly with the number of targets. Computer simulations show the performance with crossing trajectories.

Additional Information

© 1990 IEEE.

Attached Files

Published - 00262365.pdf

Files

00262365.pdf
Files (538.2 kB)
Name Size Download all
md5:28214ee59710e3bf0c51e4d060764d59
538.2 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 26, 2023