pith. sign in

arxiv: 1404.7408 · v4 · pith:LHI562OPnew · submitted 2014-04-29 · 🧮 math.PR

Multi-target filtering with linearised complexity

classification 🧮 math.PR
keywords multi-targetalgorithmcomplexityestimationlinearmethodsnumberobservations
0
0 comments X
read the original abstract

An algorithm for the estimation of multiple targets from partial and corrupted observations is introduced based on the concept of partially-distinguishable multi-target system. It combines the advantages of engineering solutions like MHT with the rigour of point-process-based methods. It is demonstrated that under intuitive assumptions and approximations, the complexity of the proposed multi-target estimation algorithm can be made linear in the number of tracks and linear in the number of observations, while naturally preserving distinct tracks for detected targets, unlike point-process-based methods.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.