Abstract
Multiple-target tracking in high target density situations can be posed as a multi-hypothesis decision problem. The complete solution of such problems on a real time basis requires that the computations be carried out in a computer-efficient manner. This paper discusses a formulation of the tracking problem based on 0-1 integer programming which can markedly reduce Computer time requirements.

This publication has 0 references indexed in Scilit: