Published April 1990
| Published
Book Section - Chapter
Open
A Nonconvex Cost Optimization Approach to Tracking Multiple Targets by a Parallel Computational Network
- Creators
- Rose, Kenneth
- Gurewitz, Eitan
- Fox, Geoffrey
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 - 00555365.pdf
Files
00555365.pdf
Files
(629.6 kB)
Name | Size | Download all |
---|---|---|
md5:afb4afcf3ff96fbc4a467d4d580a8e92
|
629.6 kB | Preview Download |
Additional details
- Eprint ID
- 78681
- Resolver ID
- CaltechAUTHORS:20170628-173206820
- Created
-
2017-06-29Created from EPrint's datestamp field
- Updated
-
2021-11-15Created from EPrint's last_modified field