A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Proceedings of the Fifth Distributed Memory Computing Conference, 1990.
The problem of tra.cking 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 mc :hod is first derived for the two-dimensional (s latial/ temporal) case, and then generalized t o the multidimensional case. The complexity grows linearly with the number of targets. Computerdoi:10.1109/dmcc.1990.555365 fatcat:uvqq2tuxpneirnof5tkhiauceu