Multiple objects tracking in fluorescence microscopy

Many processes in cell biology are connected to the movement of compact entities: intracellular vesicles and even single molecules. The tracking of individual objects is important for understanding cellular dynamics. Here we describe the tracking algorithms which have been developed in the non-biological fields and successfully applied to object detection and tracking in biological applications. The characteristics features of the different algorithms are compared.     

Towards Active Tracking of Beating Heart Motion in the Presence of Arrhythmia for Robotic Assisted Beating Heart Surgery

In robotic assisted beating heart surgery, the control architecture for heart motion tracking has stringent requirements in terms of bandwidth of the motion that needs to be tracked. In order to achieve sufficient tracking accuracy, feed-forward control algorithms, which rely on estimations of upcoming heart motion, have been proposed in the literature. However, performance of these feed-forward motion control algorithms under heart rhythm variations is an important concern. In their past work, the authors have demonstrated the effectiveness of a receding horizon model predictive control-based algorithm, which used generalized adaptive predictors, under constant and slowly varying heart rate conditions. This paper extends these studies to the case when the heart motion statistics change abruptly and significantly, such as during arrhythmias. A feasibility study is carried out to assess the motion tracking capabilities of the adaptive algorithms in the occurrence of arrhythmia during beating heart surgery. Specifically, the tracking performance of the algorithms is evaluated on prerecorded motion data, which is collected in vivo and includes heart rhythm irregularities. The algorithms are tested using both simulations and bench experiments on a three degree-of-freedom robotic test bed. They are also compared with a position-plus-derivative controller as well as a receding horizon model predictive controller that employs an extended Kalman filter algorithm for predicting future heart motion.     

Cell Tracking Accuracy Measurement Based on Comparison of Acyclic Oriented Graphs

Tracking motile cells in time-lapse series is challenging and is required in many biomedical applications. Cell tracks can be mathematically represented as acyclic oriented graphs. Their vertices describe the spatio-temporal locations of individual cells, whereas the edges represent temporal relationships between them. Such a representation maintains the knowledge of all important cellular events within a captured field of view, such as migration, division, death, and transit through the field of view. The increasing number of cell tracking algorithms calls for comparison of their performance. However, the lack of a standardized cell tracking accuracy measure makes the comparison impracticable. This paper defines and evaluates an accuracy measure for objective and systematic benchmarking of cell tracking algorithms. The measure assumes the existence of a ground-truth reference, and assesses how difficult it is to transform a computed graph into the reference one. The difficulty is measured as a weighted sum of the lowest number of graph operations, such as split, delete, and add a vertex and delete, add, and alter the semantics of an edge, needed to make the graphs identical. The measure behavior is extensively analyzed based on the tracking results provided by the participants of the first Cell Tracking Challenge hosted by the 2013 IEEE International Symposium on Biomedical Imaging. We demonstrate the robustness and stability of the measure against small changes in the choice of weights for diverse cell tracking algorithms and fluorescence microscopy datasets. As the measure penalizes all possible errors in the tracking results and is easy to compute, it may especially help developers and analysts to tune their algorithms according to their needs.     

A Novel Tracking Algorithm via Feature Points Matching

Visual target tracking is a primary task in many computer vision applications and has been widely studied in recent years. Among all the tracking methods, the mean shift algorithm has attracted extraordinary interest and been well developed in the past decade due to its excellent performance. However, it is still challenging for the color histogram based algorithms to deal with the complex target tracking. Therefore, the algorithms based on other distinguishing features are highly required. In this paper, we propose a novel target tracking algorithm based on mean shift theory, in which a new type of image feature is introduced and utilized to find the corresponding region between the neighbor frames. The target histogram is created by clustering the features obtained in the extraction strategy. Then, the mean shift process is adopted to calculate the target location iteratively. Experimental results demonstrate that the proposed algorithm can deal with the challenging tracking situations such as: partial occlusion, illumination change, scale variations, object rotation and complex background clutter. Meanwhile, it outperforms several state-of-the-art methods.     

Quantitative comparison of algorithms for tracking single fluorescent particles

Single particle tracking has seen numerous applications in biophysics, ranging from the diffusion of proteins in cell membranes to the movement of molecular motors. A plethora of computer algorithms have been developed to monitor the sub-pixel displacement of fluorescent objects between successive video frames, and some have been claimed to have "nanometer" resolution. To date, there has been no rigorous comparison of these algorithms under realistic conditions. In this paper, we quantitatively compare specific implementations of four commonly used tracking algorithms: cross-correlation, sum-absolute difference, centroid, and direct Gaussian fit. Images of fluorescent objects ranging in size from point sources to 5 microm were computer generated with known sub-pixel displacements. Realistic noise was added and the above four algorithms were compared for accuracy and precision. We found that cross-correlation is the most accurate algorithm for large particles. However, for point sources, direct Gaussian fit to the intensity distribution is the superior algorithm in terms of both accuracy and precision, and is the most robust at low signal-to-noise. Most significantly, all four algorithms fail as the signal-to-noise ratio approaches 4. We judge direct Gaussian fit to be the best algorithm when tracking single fluorophores, where the signal-to-noise is frequently near 4.     

Bayesian inference for improved single molecule fluorescence tracking

Single molecule tracking is widely used to monitor the change in position of lipids and proteins in living cells. In many experiments in which molecules are tagged with a single or small number of fluorophores, the signal/noise ratio may be limiting, the number of molecules is not known, and fluorophore blinking and photobleaching can occur. All these factors make accurate tracking over long trajectories difficult and hence there is still a pressing need to develop better algorithms to extract the maximum information from a sequence of fluorescence images. We describe here a Bayesian-based inference approach, based on a trans-dimensional sequential Monte Carlo method that utilizes both the spatial and temporal information present in the image sequences. We show, using model data, where the real trajectory of the molecule is known, that our method allows accurate tracking of molecules over long trajectories even with low signal/noise ratio and in the presence of fluorescence blinking and photobleaching. The method is then applied to real experimental data.     

Tracking cells in Life Cell Imaging videos using topological alignments

Background  

With the increasing availability of live cell imaging technology, tracking cells and other moving objects in live cell videos has become a major challenge for bioimage informatics. An inherent problem for most cell tracking algorithms is over- or under-segmentation of cells – many algorithms tend to recognize one cell as several cells or vice versa.     

Diatrack particle tracking software: Review of applications and performance evaluation

Object tracking is an instrumental tool supporting studies of cellular trafficking. There are three challenges in object tracking: the identification of targets; the precise determination of their position and boundaries; and the assembly of correct trajectories. This last challenge is particularly relevant when dealing with densely populated images with low signal‐to‐noise ratios—conditions that are often encountered in applications such as organelle tracking, virus particle tracking or single‐molecule imaging. We have developed a set of methods that can handle a wide variety of signal complexities. They are compiled into a free software package called Diatrack. Here we review its main features and utility in a range of applications, providing a survey of the dynamic imaging field together with recommendations for effective use. The performance of our framework is shown to compare favorably to a wide selection of custom‐developed algorithms, whether in terms of localization precision, processing speed or correctness of tracks.      

Direct comparison of kinematic data collected using an electromagnetic tracking system versus a digital optical system

The purpose of this study was to quantify the dynamic accuracy of kinematics measured by a digital optical motion analysis system in a gait analysis laboratory (capture volume approximately 20m(3)) compared to a standard range direct-current electromagnetic (EM) tracking device (capture volume approximately 1m(3)). This is a subset of a larger effort to establish an appropriate marker set for the optical system to quantify upperlimb kinematics simultaneously with gait, in comparison to previous studies of isolated upperlimb movements that have employed EM tracking devices. Rigid clusters of spherical reflective markers and EM sensors were attached to a mechanical articulator that mimicked three-dimensional joint rotations, similar to the elbow. As the articulator was moved through known ranges of motion (i.e. gold standard), kinematic data were collected simultaneously using both tracking systems. Both systems were tended to underestimate the range of motion; however, the application of post hoc smoothing and least-squares correction algorithms reduced these effects. When smoothing and correction algorithms were used, the magnitude of the mean difference between the gold standard and either the EM or optical system did not exceed 2 degrees for any of the compound motions performed. This level of agreement suggests that the measurements obtained from either system are clinically comparable, provided appropriate smoothing and correction algorithms are employed.     

Optimization algorithm performance in determining optimal controls in human movement analyses

The objective of this study was to evaluate the performance of different multivariate optimization algorithms by solving a "tracking" problem using a forward dynamic model of pedaling. The tracking problem was defined as solving for the muscle controls (muscle stimulation onset, offset, and magnitude) that minimized the error between experimentally collected kinetic and kinematic data and the simulation results of pedaling at 90 rpm and 250 W. Three different algorithms were evaluated: a downhill simplex method, a gradient-based sequential quadratic programming algorithm, and a simulated annealing global optimization routine. The results showed that the simulated annealing algorithm performed for superior to the conventional routines by converging more rapidly and avoiding local minima.     

Algorithms for energy efficient mobile object tracking in wireless sensor networks

Wireless sensor networks have found more and more applications in a variety of pervasive computing environments, in their functions as data acquisition in pervasive applications. However, how to get better performance to support data acquisition of pervasive applications over WSNs remains to be a nontrivial and challenging task. The network lifetime and application requirement are two fundamental, yet conflicting, design objectives in wireless sensor networks for tracking mobile objects. The application requirement is often correlated to the delay time within which the application can send its sensing data back to the users in tracking networks. In this paper we study the network lifetime maximization problem and the delay time minimization problem together. To make both problems tractable, we have the assumption that each sensor node keeps working since it turns on. And we formulate the network lifetime maximization problem as maximizing the number of sensor nodes who don’t turn on, and the delay time minimization problem as minimizing the routing path length, after achieving the required tracking tasks. Since we prove the problems are NP-complete and APX-complete, we propose three heuristic algorithms to solve them. And we present several experiments to show the advantages and disadvantages referring to the network lifetime and the delay time among these three algorithms on three models, random graphs, grids and hypercubes. Furthermore, we implement the distributed version of these algorithms.     

Static and dynamic error of a biplanar videoradiography system using marker-based and markerless tracking techniques

The use of biplanar videoradiography technology has become increasingly popular for evaluating joint function in vivo. Two fundamentally different methods are currently employed to reconstruct 3D bone motions captured using this technology. Marker-based tracking requires at least three radio-opaque markers to be implanted in the bone of interest. Markerless tracking makes use of algorithms designed to match 3D bone shapes to biplanar videoradiography data. In order to reliably quantify in vivo bone motion, the systematic error of these tracking techniques should be evaluated. Herein, we present new markerless tracking software that makes use of modern GPU technology, describe a versatile method for quantifying the systematic error of a biplanar videoradiography motion capture system using independent gold standard instrumentation, and evaluate the systematic error of the W.M. Keck XROMM Facility's biplanar videoradiography system using both marker-based and markerless tracking algorithms under static and dynamic motion conditions. A polycarbonate flag embedded with 12 radio-opaque markers was used to evaluate the systematic error of the marker-based tracking algorithm. Three human cadaveric bones (distal femur, distal radius, and distal ulna) were used to evaluate the systematic error of the markerless tracking algorithm. The systematic error was evaluated by comparing motions to independent gold standard instrumentation. Static motions were compared to high accuracy linear and rotary stages while dynamic motions were compared to a high accuracy angular displacement transducer. Marker-based tracking was shown to effectively track motion to within 0.1?mm and 0.1 deg under static and dynamic conditions. Furthermore, the presented results indicate that markerless tracking can be used to effectively track rapid bone motions to within 0.15 deg for the distal aspects of the femur, radius, and ulna. Both marker-based and markerless tracking techniques were in excellent agreement with the gold standard instrumentation for both static and dynamic testing protocols. Future research will employ these techniques to quantify in vivo joint motion for high-speed upper and lower extremity impacts such as jumping, landing, and hammering.     

Influence of device accuracy and choice of algorithm for species distribution modelling of seabirds: a case study using black‐browed albatrosses

Species distribution models (SDM) based on tracking data from different devices are used increasingly to explain and predict seabird distributions. However, different tracking methods provide different data resolutions, ranging from < 10 m to > 100 km. To better understand the implications of this variation, we modeled the potential distribution of black‐browed albatrosses Thalassarche melanophris from South Georgia that were simultaneously equipped with a platform terminal transmitter (PTT) (high resolution) and a global location sensor (GLS) logger (coarse resolution), and measured the overlap of the respective potential distribution for a total of nine different SDM algorithms. We found slightly better model fits for the PTT than for GLS data (AUC values 0.958 ± 0.048 vs 0.95 ± 0.05) across all algorithms. The overlaps of the predicted distributions were higher between device types for the same algorithm, than among algorithms for either device type. Uncertainty arising from coarse‐resolution location data is therefore lower than that associated with the modeling technique. Consequently, the choice of an appropriate algorithm appears to be more important than device type when applying SDMs to seabird tracking data. Despite their low accuracy, GLS data appear to be effective for analyzing the habitat preferences and distribution patterns of pelagic species.     

A novel validation algorithm allows for automated cell tracking and the extraction of biologically meaningful parameters

Automated microscopy is currently the only method to non-invasively and label-free observe complex multi-cellular processes, such as cell migration, cell cycle, and cell differentiation. Extracting biological information from a time-series of micrographs requires each cell to be recognized and followed through sequential microscopic snapshots. Although recent attempts to automatize this process resulted in ever improving cell detection rates, manual identification of identical cells is still the most reliable technique. However, its tedious and subjective nature prevented tracking from becoming a standardized tool for the investigation of cell cultures. Here, we present a novel method to accomplish automated cell tracking with a reliability comparable to manual tracking. Previously, automated cell tracking could not rival the reliability of manual tracking because, in contrast to the human way of solving this task, none of the algorithms had an independent quality control mechanism; they missed validation. Thus, instead of trying to improve the cell detection or tracking rates, we proceeded from the idea to automatically inspect the tracking results and accept only those of high trustworthiness, while rejecting all other results. This validation algorithm works independently of the quality of cell detection and tracking through a systematic search for tracking errors. It is based only on very general assumptions about the spatiotemporal contiguity of cell paths. While traditional tracking often aims to yield genealogic information about single cells, the natural outcome of a validated cell tracking algorithm turns out to be a set of complete, but often unconnected cell paths, i.e. records of cells from mitosis to mitosis. This is a consequence of the fact that the validation algorithm takes complete paths as the unit of rejection/acceptance. The resulting set of complete paths can be used to automatically extract important biological parameters with high reliability and statistical significance. These include the distribution of life/cycle times and cell areas, as well as of the symmetry of cell divisions and motion analyses. The new algorithm thus allows for the quantification and parameterization of cell culture with unprecedented accuracy. To evaluate our validation algorithm, two large reference data sets were manually created. These data sets comprise more than 320,000 unstained adult pancreatic stem cells from rat, including 2592 mitotic events. The reference data sets specify every cell position and shape, and assign each cell to the correct branch of its genealogic tree. We provide these reference data sets for free use by others as a benchmark for the future improvement of automated tracking methods.     

Optimal Appearance Model for Visual Tracking

Many studies argue that integrating multiple cues in an adaptive way increases tracking performance. However, what is the definition of adaptiveness and how to realize it remains an open issue. On the premise that the model with optimal discriminative ability is also optimal for tracking the target, this work realizes adaptiveness and robustness through the optimization of multi-cue integration models. Specifically, based on prior knowledge and current observation, a set of discrete samples are generated to approximate the foreground and background distribution. With the goal of optimizing the classification margin, an objective function is defined, and the appearance model is optimized by introducing optimization algorithms. The proposed optimized appearance model framework is embedded into a particle filter for a field test, and it is demonstrated to be robust against various kinds of complex tracking conditions. This model is general and can be easily extended to other parameterized multi-cue models.     

Prediction methods for synchronization of scanned ion beam tracking

Beam tracking as a mitigation technique for treatment of intra-fractionally moving organs requires prediction to overcome latencies in the adaptation process. We implemented and experimentally tested a prediction method for scanned carbon beam tracking. Beam tracking parameters, i.e. the shift of the Bragg peak position in 3D, are determined prior to treatment in 4D treatment planning and applied during treatment delivery in dependence on the motion state of the target as well as on the scanning spot in the target. Hence, prediction is required for the organ motion trajectory as well as the scanning progress to achieve maximal performance. Prediction algorithms to determine beam displacements that overcome these latencies were implemented. Prediction times of 25 ms for target spot prediction were required for ～6 mm water-equivalent longitudinal beam shifts. The experimental tests proved feasibility of the implemented prediction algorithm.     

High-throughput feature counting and measurement of roots

SUMMARY: The original RootTrace tool has proved successful in measuring primary root lengths across time series image data. Biologists have shown interest in using the tool to address further problems, namely counting lateral roots to use as parameters in screening studies, and measuring highly curved roots. To address this, the software has been extended to count emerged lateral roots, and the tracking model extended so that strongly curved and agravitropic roots can be now be recovered. Here, we describe the novel image analysis algorithms and user interface implemented within the RootTrace framework to handle such situations and evaluate the results. AVAILABILITY: The software is open source and available from http://sourceforge.net/projects/roottrace.     

FastTrack: An open-source software for tracking varying numbers of deformable objects

Analyzing the dynamical properties of mobile objects requires to extract trajectories from recordings, which is often done by tracking movies. We compiled a database of two-dimensional movies for very different biological and physical systems spanning a wide range of length scales and developed a general-purpose, optimized, open-source, cross-platform, easy to install and use, self-updating software called FastTrack. It can handle a changing number of deformable objects in a region of interest, and is particularly suitable for animal and cell tracking in two-dimensions. Furthermore, we introduce the probability of incursions as a new measure of a movie’s trackability that doesn’t require the knowledge of ground truth trajectories, since it is resilient to small amounts of errors and can be computed on the basis of an ad hoc tracking. We also leveraged the versatility and speed of FastTrack to implement an iterative algorithm determining a set of nearly-optimized tracking parameters—yet further reducing the amount of human intervention—and demonstrate that FastTrack can be used to explore the space of tracking parameters to optimize the number of swaps for a batch of similar movies. A benchmark shows that FastTrack is orders of magnitude faster than state-of-the-art tracking algorithms, with a comparable tracking accuracy. The source code is available under the GNU GPLv3 at https://github.com/FastTrackOrg/FastTrack and pre-compiled binaries for Windows, Mac and Linux are available at http://www.fasttrack.sh.     

Automated cell identification and tracking using nanoparticle moving-light-displays

An automated technique for the identification, tracking and analysis of biological cells is presented. It is based on the use of nanoparticles, enclosed within intra-cellular vesicles, to produce clusters of discrete, point-like fluorescent, light sources within the cells. Computational analysis of these light ensembles in successive time frames of a movie sequence, using k-means clustering and particle tracking algorithms, provides robust and automated discrimination of live cells and their motion and a quantitative measure of their proliferation. This approach is a cytometric version of the moving light display technique which is widely used for analyzing the biological motion of humans and animals. We use the endocytosis of CdTe/ZnS, core-shell quantum dots to produce the light displays within an A549, epithelial, lung cancer cell line, using time-lapse imaging with frame acquisition every 5 minutes over a 40 hour time period. The nanoparticle moving light displays provide simultaneous collection of cell motility data, resolution of mitotic traversal dynamics and identification of familial relationships allowing construction of multi-parameter lineage trees.     

CellAnimation: an open source MATLAB framework for microscopy assays

MOTIVATION: Advances in microscopy technology have led to the creation of high-throughput microscopes that are capable of generating several hundred gigabytes of images in a few days. Analyzing such wealth of data manually is nearly impossible and requires an automated approach. There are at present a number of open-source and commercial software packages that allow the user to apply algorithms of different degrees of sophistication to the images and extract desired metrics. However, the types of metrics that can be extracted are severely limited by the specific image processing algorithms that the application implements, and by the expertise of the user. In most commercial software, code unavailability prevents implementation by the end user of newly developed algorithms better suited for a particular type of imaging assay. While it is possible to implement new algorithms in open-source software, rewiring an image processing application requires a high degree of expertise. To obviate these limitations, we have developed an open-source high-throughput application that allows implementation of different biological assays such as cell tracking or ancestry recording, through the use of small, relatively simple image processing modules connected into sophisticated imaging pipelines. By connecting modules, non-expert users can apply the particular combination of well-established and novel algorithms developed by us and others that are best suited for each individual assay type. In addition, our data exploration and visualization modules make it easy to discover or select specific cell phenotypes from a heterogeneous population. AVAILABILITY: CellAnimation is distributed under the Creative Commons Attribution-NonCommercial 3.0 Unported license (http://creativecommons.org/licenses/by-nc/3.0/). CellAnimationsource code and documentation may be downloaded from www.vanderbilt.edu/viibre/software/documents/CellAnimation.zip. Sample data are available at www.vanderbilt.edu/viibre/software/documents/movies.zip. CONTACT: walter.georgescu@vanderbilt.edu SUPPLEMENTARY INFORMATION: Supplementary data available at Bioinformatics online.