Unsupervised Texture Segmentation using Active Contours and Local Distributions of Gaussian Markov Random Field Parameters

In this paper, local distributions of low order Gaussian Markov Random Field (GMRF) model parameters are proposed as texture features for unsupervised texture segmentation.Instead of using model parameters as texture features, we exploit the variations in parameter estimates found by model fitting in local region around the given pixel. Thespatially localized estimation process is carried out by maximum likelihood method employing a moderately small estimation window which leads to modeling of partial texturecharacteristics belonging to the local region. Hence significant fluctuations occur in the estimates which can be related to texture pattern complexity. The variations occurred in estimates are quantified by normalized local histograms. Selection of an accurate window size for histogram calculation is crucial and is achieved by a technique based on the entropy of textures. These texture features expand the possibility of using relativelylow order GMRF model parameters for segmenting fine to very large texture patterns and offer lower computational cost. Small estimation windows result in better boundarylocalization. Unsupervised segmentation is performed by integrated active contours, combining the region and boundary information. Experimental results on statistical and structural component textures show improved discriminative ability of the features compared to some recent algorithms in the literature

Inverse Problems and Data Assimilation

These notes are designed with the aim of providing a clear and concise introduction to the subjects of Inverse Problems and Data Assimilation, and their inter-relations, together with citations to some relevant literature in this area. The first half of the notes is dedicated to studying the Bayesian framework for inverse problems. Techniques such as importance sampling and Markov Chain Monte Carlo (MCMC) methods are introduced; these methods have the desirable property that in the limit of an infinite number of samples they reproduce the full posterior distribution. Since it is often computationally intensive to implement these methods, especially in high dimensional problems, approximate techniques such as approximating the posterior by a Dirac or a Gaussian distribution are discussed. The second half of the notes cover data assimilation. This refers to a particular class of inverse problems in which the unknown parameter is the initial condition of a dynamical system, and in the stochastic dynamics case the subsequent states of the system, and the data comprises partial and noisy observations of that (possibly stochastic) dynamical system. We will also demonstrate that methods developed in data assimilation may be employed to study generic inverse problems, by introducing an artificial time to generate a sequence of probability measures interpolating from the prior to the posterior

Measuring Measurement: Theory and Practice

Recent efforts have applied quantum tomography techniques to the calibration and characterization of complex quantum detectors using minimal assumptions. In this work we provide detail and insight concerning the formalism, the experimental and theoretical challenges and the scope of these tomographical tools. Our focus is on the detection of photons with avalanche photodiodes and photon number resolving detectors and our approach is to fully characterize the quantum operators describing these detectors with a minimal set of well specified assumptions. The formalism is completely general and can be applied to a wide range of detectorsComment: 22 pages, 27 figure

Nonlinear Gaussian Filtering : Theory, Algorithms, and Applications

By restricting to Gaussian distributions, the optimal Bayesian filtering problem can be transformed into an algebraically simple form, which allows for computationally efficient algorithms. Three problem settings are discussed in this thesis: (1) filtering with Gaussians only, (2) Gaussian mixture filtering for strong nonlinearities, (3) Gaussian process filtering for purely data-driven scenarios. For each setting, efficient algorithms are derived and applied to real-world problems

Poisson Multi-Bernoulli Mixtures for Multiple Object Tracking

Multi-object tracking (MOT) refers to the process of estimating object trajectories of interest based on sequences of noisy sensor measurements obtained from multiple sources. Nowadays, MOT has found applications in numerous areas, including, e.g., air traffic control, maritime navigation, remote sensing, intelligent video surveillance, and more recently environmental perception, which is a key enabling technology in automated vehicles. This thesis studies Poisson multi-Bernoulli mixture (PMBM) conjugate priors for MOT. Finite Set Statistics provides an elegant Bayesian formulation of MOT based on random finite sets (RFSs), and a significant trend in RFSs-based MOT is the development of conjugate distributions in Bayesian probability theory, such as the PMBM distributions. Multi-object conjugate priors are of great interest as they provide families of distributions that are suitable to work with when seeking accurate approximations to the true posterior distributions. Many RFS-based MOT approaches are only concerned with multi-object filtering without attempting to estimate object trajectories. An appealing approach to building trajectories is by computing the multi-object densities on sets of trajectories. This leads to the development of many multi-object filters based on sets of trajectories, e.g., the trajectory PMBM filters. In this thesis, [Paper A] and [Paper B] consider the problem of point object tracking where an object generates at most one measurement per time scan. In [Paper A], a multi-scan implementation of trajectory PMBM filters via dual decomposition is presented. In [Paper B], a multi-trajectory particle smoother using backward simulation is presented for computing the multi-object posterior for sets of trajectories using a sequence of multi-object filtering densities and a multi-object dynamic model. [Paper C] and [Paper D] consider the problem of extended object tracking where an object may generate multiple measurements per time scan. In [Paper C], an extended object Poisson multi-Bernoulli (PMB) filter is presented, where the PMBM posterior density after the update step is approximated as a PMB. In [Paper D], a trajectory PMB filter for extended object tracking using belief propagation is presented, where the efficient PMB approximation is enabled by leveraging the PMBM conjugacy and the factor graph formulation