TY - JOUR
T1 - Piecewise-Stationary Motion Modeling and Iterative Smoothing to Track Heterogeneous Particle Motions in Dense Environments
AU - Roudot, Philippe
AU - Ding, Liya
AU - Jaqaman, Khuloud
AU - Kervrann, Charles
AU - Danuser, Gaudenz
N1 - Funding Information:
Manuscript received January 13, 2016; revised September 12, 2016 and March 7, 2017; accepted May 3, 2017. Date of publication June 2, 2017; date of current version September 1, 2017. This work was supported in part by NIH under Grant P01 GM096971, in part by the Matisse Graduate School, Inria, in part by the France-BioImaging infrastructure through the French National Research Agency (Investments for the future) under Grant ANR-10-INBS-04-07, in part by CPRIT recruitment under Award R1216, in part by the Human Frontier Science Program under Grant LT000954/2015, and in part by the UTSW Endowed Scholars Program. The associate editor coordinating the review of this manuscript and approving it for publication was Prof. Gustavo K. Rohde. (Corresponding author: Philippe Roudot.) P. Roudot and G. Danuser are with the UT Southwestern Medical Center, Lyda Hill Department of Bioinformatics, Dallas, TX 75390 USA (e-mail: philippe.roudot@utsouthwestern.edu; gaudenz.danuser@utsouthwestern.edu).
Publisher Copyright:
© 1992-2012 IEEE.
PY - 2017/11
Y1 - 2017/11
N2 - One of the major challenges in multiple particle tracking is the capture of extremely heterogeneous movements of objects in crowded scenes. The presence of numerous assignment candidates in the expected range of particle motion makes the tracking ambiguous and induces false positives. Lowering the ambiguity by reducing the search range, on the other hand, is not an option, as this would increase the rate of false negatives. We propose here a piecewise-stationary motion model (PMM) for the particle transport along an iterative smoother that exploits recursive tracking in multiple rounds in forward and backward temporal directions. By fusing past and future information, our method, termed PMMS, can recover fast transitions from freely or confined diffusive to directed motions with linear time complexity. To avoid false positives, we complemented recursive tracking with a robust inline estimator of the search radius for assignment (a.k.a. gating), where past and future information are exploited using only two frames at each optimization step. We demonstrate the improvement of our technique on simulated data especially the impact of density, variation in frame to frame displacements, and motion switching probability. We evaluated our technique on the 2D particle tracking challenge dataset published by Chenouard et al. in 2014. Using high SNR to focus on motion modeling challenges, we show superior performance at high particle density. On biological applications, our algorithm allows us to quantify the extremely small percentage of motor-driven movements of fluorescent particles along microtubules in a dense field of unbound, diffusing particles. We also show with virus imaging that our algorithm can cope with a strong reduction in recording frame rate while keeping the same performance relative to methods relying on fast sampling.
AB - One of the major challenges in multiple particle tracking is the capture of extremely heterogeneous movements of objects in crowded scenes. The presence of numerous assignment candidates in the expected range of particle motion makes the tracking ambiguous and induces false positives. Lowering the ambiguity by reducing the search range, on the other hand, is not an option, as this would increase the rate of false negatives. We propose here a piecewise-stationary motion model (PMM) for the particle transport along an iterative smoother that exploits recursive tracking in multiple rounds in forward and backward temporal directions. By fusing past and future information, our method, termed PMMS, can recover fast transitions from freely or confined diffusive to directed motions with linear time complexity. To avoid false positives, we complemented recursive tracking with a robust inline estimator of the search radius for assignment (a.k.a. gating), where past and future information are exploited using only two frames at each optimization step. We demonstrate the improvement of our technique on simulated data especially the impact of density, variation in frame to frame displacements, and motion switching probability. We evaluated our technique on the 2D particle tracking challenge dataset published by Chenouard et al. in 2014. Using high SNR to focus on motion modeling challenges, we show superior performance at high particle density. On biological applications, our algorithm allows us to quantify the extremely small percentage of motor-driven movements of fluorescent particles along microtubules in a dense field of unbound, diffusing particles. We also show with virus imaging that our algorithm can cope with a strong reduction in recording frame rate while keeping the same performance relative to methods relying on fast sampling.
KW - Multiple particle tracking (MPT)
KW - adaptive gating
KW - cell biology
KW - interacting multiple model
KW - kalman smoothing
UR - http://www.scopus.com/inward/record.url?scp=85029175283&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85029175283&partnerID=8YFLogxK
U2 - 10.1109/TIP.2017.2707803
DO - 10.1109/TIP.2017.2707803
M3 - Article
C2 - 29388914
AN - SCOPUS:85029175283
SN - 1057-7149
VL - 26
SP - 5395
EP - 5410
JO - IEEE Transactions on Image Processing
JF - IEEE Transactions on Image Processing
IS - 11
M1 - 7938386
ER -