Approximate Bayesian algorithms for multiple target tracking with binary sensors
Abstract: In this paper, we propose an approximate Bayesian computation approach to perform a multiple target tracking within a binary sensor network. The nature of the binary sensors (getting closer - moving away information) do not allow the use of the classical tools (e.g. Kalman Filter, Particle Filer), because the exact likelihood is intractable. To overcome this, we use the particular feature of the likelihood-free algorithms to produce an efficient multiple target tracking methodology.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.