Inference in particle tracking experiments by passing messages between images

Abstract

Methods to extract information from the tracking of mobile objects/particles have broad interest in biological and physical sciences. Techniques based on simple criteria of proximity in time-consecutive snapshots are useful to identify the trajectories of the particles. However, they become problematic as the motility and/or the density of the particles increases due to uncertainties on the trajectories that particles followed during the images' acquisition time. Here, we report an efficient method for learning parameters of the dynamics of the particles from their positions in time-consecutive images. Our algorithm belongs to the class of message-passing algorithms, known in computer science, information theory and statistical physics as Belief Propagation (BP). The algorithm is distributed, thus allowing parallel implementation suitable for computations on multiple machines without significant inter-machine overhead. We test our method on the model example of particle tracking in turbulent flows, which is particularly challenging due to the strong transport that those flows produce. Our numerical experiments show that the BP algorithm compares in quality with exact Markov Chain Monte-Carlo algorithms, yet BP is far superior in speed. We also suggest and analyze a random-distance model that provides theoretical justification for BP accuracy. Methods developed here systematically formulate the problem of particle tracking and provide fast and reliable tools for its extensive range of applications.

18 pages, 9 figures

References in corpus (3)

• Interaction Ruling Animal Collective Behaviour Depends on Topological rather than Metric Distance: Evidence from a Field Study
• Inferring maps of forces inside cell membrane microdomains
• Exactness of Belief Propagation for Some Graphical Models with Loops

Cited by in corpus (13)

• A Scalable Algorithm for Tracking an Unknown Number of Targets Using Multiple Sensors
• Approximate evaluation of marginal association probabilities with belief propagation
• Inferring flow parameters and turbulent configuration with physics-informed data-assimilation and spectral nudging
• The Bethe Permanent of a Non-Negative Matrix
• Synchronizing subgrid scale models of turbulence to data
• Belief Propagation and Loop Calculus for the Permanent of a Non-Negative Matrix
• Approximating the Permanent with Fractional Belief Propagation
• Recovery thresholds in the sparse planted matching problem
• The planted $k$-factor problem
• Graphical model approximations of random finite set filters
• Loop Calculus and Bootstrap-Belief Propagation for Perfect Matchings on Arbitrary Graphs
• The planted matching problem: Sharp threshold and infinite-order phase transition
• Planted matching problems on random hypergraphs