Motion patterns of subviral particles: Digital tracking, image data processing and analysis

At the Institute of Virology, Philipps-University, Marburg, Germany, currently research on the understanding of the transport mechanisms of Ebola- and Marburgvirus nucleocapsids is carried out. This research demands a profound knowledge about the various motion characteristics of the nucleocapids. The analysis of large amounts of samples by conventional manual evaluation is a laborious task and does not always lead to reproducible and comparable results. In a cooperation between the Institute of Virology, Marburg, and the Institute for Biomedical Engineering, University of Applied Sciences, Giessen, Germany, algorithms are developed and programmed that enable an automatic tracking of subviral particles in fluorescence microscopic image sequences. The algorithms form an interface between the biologic and the algorithmic domain. Furthermore, methods to automatically parameterize and classify subviral particle motions are created. Geometric and mathematical approaches, like curvature-, fractal dimension- and mean squared displacement-determination are applied. Statistical methods are used to compare the measured subviral particle motion parameters between different biological samples. In this thesis, the biological, mathematical and algorithmic basics are described and the state of the art methods of other research groups are presented and compared. The algorithms to track, parameterize, classify and statistically analyze subviral particle tracks are presented in the Methods section. All methods are evaluated with simulated data and/or compared to data validated by a virologist. The methods are applied to a set of real fluorescence microscopic image sequences of Marburgvirus infected live-cells. The Results chapter shows that subviral particle motion can be successfully analyzed using the presented tracking and analysis methods. Furthermore, differences between the subviral particle motions in the analyzed groups could be detected. However, further optimization with manually evaluated data can improve the results. The methods developed in this project enhance the knowledge about nucleocapsid transport and may be valuable for the development of effective antiviral agents to cure Ebola- and Marburgvirus diseases. The thesis concludes with a chapter Discussion and Conclusions

Exploring plenoptic properties of correlation imaging with chaotic light

In a setup illuminated by chaotic light, we consider different schemes that enable to perform imaging by measuring second-order intensity correlations. The most relevant feature of the proposed protocols is the ability to perform plenoptic imaging, namely to reconstruct the geometrical path of light propagating in the system, by imaging both the object and the focusing element. This property allows to encode, in a single data acquisition, both multi-perspective images of the scene and light distribution in different planes between the scene and the focusing element. We unveil the plenoptic property of three different setups, explore their refocusing potentialities and discuss their practical applications.Comment: 9 pages, 4 figure

Online real-time crowd behavior detection in video sequences

Automatically detecting events in crowded scenes is a challenging task in Computer Vision. A number of offline approaches have been proposed for solving the problem of crowd behavior detection, however the offline assumption limits their application in real-world video surveillance systems. In this paper, we propose an online and real-time method for detecting events in crowded video sequences. The proposed approach is based on the combination of visual feature extraction and image segmentation and it works without the need of a training phase. A quantitative experimental evaluation has been carried out on multiple publicly available video sequences, containing data from various crowd scenarios and different types of events, to demonstrate the effectiveness of the approach

Bayesian Optimization for Probabilistic Programs

We present the first general purpose framework for marginal maximum a posteriori estimation of probabilistic program variables. By using a series of code transformations, the evidence of any probabilistic program, and therefore of any graphical model, can be optimized with respect to an arbitrary subset of its sampled variables. To carry out this optimization, we develop the first Bayesian optimization package to directly exploit the source code of its target, leading to innovations in problem-independent hyperpriors, unbounded optimization, and implicit constraint satisfaction; delivering significant performance improvements over prominent existing packages. We present applications of our method to a number of tasks including engineering design and parameter optimization