An analysis of object designation performance using GNN and GNP correlation
暂无分享,去创建一个
Many tracking systems have the requirement to transfer information about a particular tracked object between two systems. The general approach to this involves generation of an object map by the system designating the particular track followed by receipt of the map and correlation to the local track picture of the second system. Correlation performance is in general limited by a number of factors: random track errors added by each system, miss-registration of the two systems' coordinate frames, and miss-match between the numbers of objects tracked by the two systems. Two correlation algorithms are considered for this problem: Global Nearest Neighbor (GNN) and Global Nearest Pattern (GNP). Four basic failure modes are identified for the GNP formulation, and three of these explain failures in the GNN formulation. Analytic expressions are derived for each of these modes, and a comparison of each to Monte-Carlo experiment is provided to demonstrate overall validity.
[1] A. Volgenant,et al. A shortest augmenting path algorithm for dense and sparse linear assignment problems , 1987, Computing.
[2] Dimitri P. Bertsekas,et al. The Auction Algorithm for Assignment and Other Network Flow Problems: A Tutorial , 1990 .
[3] Mark Levedahl. Explicit pattern matching assignment algorithm , 2002, SPIE Defense + Commercial Sensing.