Searcharxiv⌕ Search

arXiv subjects

Jeremie Houssineau

Publications and source records attributed to Jeremie Houssineau.

At least 37 records · Page 2Linked to original sources

On a representation of partially-distinguishable populations

A representation of heterogeneous stochastic populations that are composed of sub-populations with different levels of distinguishability is introduced together with an analysis of its properties. It is demonstrated that any instance of this representation where individuals are independent can be related to a point process on the set of probability measures on the individual state space. The introduction of the proposed representation is fully constructive which ensures the meaningfulness of the approach.

math.PR↗

Target tracking in the framework of possibility theory: The possibilistic Bernoulli filter

The Bernoulli filter is a Bayes filter for joint detection and tracking of a target in the presence of false and miss detections. This paper presents a mathematical formulation of the Bernoulli filter in the framework of possibility theory, where uncertainty is represented using {\em possibility} functions, rather than {\em probability} distributions. Possibility functions model the uncertainty in a non-additive manner, and have the capacity to deal with partial (incomplete) problem specification. Thus, the main advantage of the possibilistic Bernoulli filter, derived in this paper, is that it can operate even in the absence of precise measurement and/or dynamic model parameters. This feature of the proposed filter is demonstrated in the context of target tracking using multi-static Doppler shifts as measurements.

cs.IT↗

Robust TMA using the possibility particle filter

The problem is target motion analysis (TMA), where the objective is to estimate the state of a moving target from noise corrupted bearings-only measurements. The focus is on recursive TMA, traditionally solved using the Bayesian filters (e.g. the extended or unscented Kalman filters, particle filters). The TMA is a difficult problem and may cause the algorithms to diverge, especially when the measurement noise model is imperfect or mismatched. As a robust alternative to the Bayesian filters for TMA, we propose the recently introduced possibility filter. This filter is implemented in the sequential Monte Carlo framework, and referred to as the possibility particle filter. The paper demonstrates its superior performance against the standard particle filter in the presence of a model mismatch, and equal performance in the case of the exact model match.

cs.CE↗

Multilevel Monte Carlo for Smoothing via Transport Methods

In this article we consider recursive approximations of the smoothing distribution associated to partially observed stochastic differential equations (SDEs), which are observed discretely in time. Such models appear in a wide variety of applications including econometrics, finance and engineering. This problem is notoriously challenging, as the smoother is not available analytically and hence require numerical approximation. This usually consists by applying a time-discretization to the SDE, for instance the Euler method, and then applying a numerical (e.g. Monte Carlo) method to approximate the smoother. This has lead to a vast literature on methodology for solving such problems, perhaps the most popular of which is based upon the particle filter (PF) e.g. [9]. In the context of filtering for this class of problems, it is well-known that the particle filter can be improved upon in terms of cost to achieve a given mean squared error (MSE) for estimates. This in the sense that the computational effort can be reduced to achieve this target MSE, by using multilevel (ML) methods [12, 13, 18], via the multilevel particle filter (MLPF) [16, 20, 21]. For instance, to obtain a MSE of $\mathcal{O}(ε^2)$ for some $ε> 0$ when approximating filtering distributions associated with Euler-discretized diffusions with constant diffusion coefficients, the cost of the PF is $\mathcal{O}(ε^{-3})$ while the cost of the MLPF is $\mathcal{O}(ε^{-2}\log(ε)^2)$. In this article we consider a new approach to replace the particle filter, using transport methods in [27]. In the context of filtering, one expects that the proposed method improves upon the MLPF by yielding, under assumptions, a MSE of $\mathcal{O}(ε^2)$ for a cost of $\mathcal{O}(ε^{-2})$. This is established theoretically in an "ideal" example and numerically in numerous examples.

stat.ME↗

Sequential Monte Carlo algorithms for a class of outer measures

Closed-form stochastic filtering equations can be derived in a general setting where probability distributions are replaced by some specific outer measures. In this article, we study how the principles of the sequential Monte Carlo method can be adapted for the purpose of practical implementation of these equations. In particular, we explore how sampling can be used to provide support points for the approximation of these outer measures. This step enables practical algorithms to be derived in the spirit of particle filters. The performance of the obtained algorithms is demonstrated in simulations and their versatility is illustrated through various examples.

stat.ME↗

Smoothing and filtering with a class of outer measures

Filtering and smoothing with a generalised representation of uncertainty is considered. Here, uncertainty is represented using a class of outer measures. It is shown how this representation of uncertainty can be propagated using outer-measure-type versions of Markov kernels and generalised Bayesian-like update equations. This leads to a system of generalised smoothing and filtering equations where integrals are replaced by supremums and probability density functions are replaced by positive functions with supremum equal to one. Interestingly, these equations retain most of the structure found in the classical Bayesian filtering framework. It is additionally shown that the Kalman filter recursion can be recovered from weaker assumptions on the available information on the corresponding hidden Markov model.

stat.ME↗

On Large Lag Smoothing for Hidden Markov Models

In this article we consider the smoothing problem for hidden Markov models (HMM). Given a hidden Markov chain $\{X_n\}_{n\geq 0}$ and observations $\{Y_n\}_{n\geq 0}$, our objective is to compute $\mathbb{E}[φ(X_0,\dots,X_k)|y_{0},\dots,y_n]$ for some real-valued, integrable functional $φ$ and $k$ fixed, $k \ll n$ and for some realisation $(y_0,\dots,y_n)$ of $(Y_0,\dots,Y_n)$. We introduce a novel application of the multilevel Monte Carlo (MLMC) method with a coupling based on the Knothe-Rosenblatt rearrangement. We prove that this method can approximate the afore-mentioned quantity with a mean square error (MSE) of $\mathcal{O}(ε^2)$, for arbitrary $ε>0$ with a cost of $\mathcal{O}(ε^{-2})$. This is in contrast to the same direct Monte Carlo method, which requires a cost of $\mathcal{O}(nε^{-2})$ for the same MSE. The approach we suggest is, in general, not possible to implement, so the optimal transport methodology of \cite{span} is used, which directly approximates our strategy. We show that our theoretical improvements are achieved, even under approximation, in several numerical examples.

stat.ME↗

On the loss of Fisher information in some multi-object tracking observation models

The concept of Fisher information can be useful even in cases where the probability distributions of interest are not absolutely continuous with respect to the natural reference measure on the underlying space. Practical examples where this extension is useful are provided in the context of multi-object tracking statistical models. Upon defining the Fisher information without introducing a reference measure, we provide remarkably concise proofs of the loss of Fisher information in some widely used multi-object tracking observation models.

math.ST↗

Physics and Human-Based Information Fusion for Improved Resident Space Object Tracking

Maintaining a catalog of Resident Space Objects (RSOs) can be cast in a typical Bayesian multi-object estimation problem, where the various sources of uncertainty in the problem - the orbital mechanics, the kinematic states of the identified objects, the data sources, etc. - are modeled as random variables with associated probability distributions. In the context of Space Situational Awareness, however, the information available to a space analyst on many uncertain components is scarce, preventing their appropriate modeling with a random variable and thus their exploitation in a RSO tracking algorithm. A typical example are human-based data sources such as Two-Line Elements (TLEs), which are publicly available but lack any statistical description of their accuracy. In this paper, we propose the first exploitation of uncertain variables in a RSO tracking problem, allowing for a representation of the uncertain components reflecting the information available to the space analyst, however scarce, and nothing more. In particular, we show that a human-based data source and a physics-based data source can be embedded in a unified and rigorous Bayesian estimator in order to track a RSO. We illustrate this concept on a scenario where real TLEs queried from the U.S. Strategic Command are fused with realistically simulated radar observations in order to track a Low-Earth Orbit satellite.

stat.AP↗

Unbiased Multi-index Monte Carlo

We introduce a new class of Monte Carlo based approximations of expectations of random variables such that their laws are only available via certain discretizations. Sampling from the discretized versions of these laws can typically introduce a bias. In this paper, we show how to remove that bias, by introducing a new version of multi-index Monte Carlo (MIMC) that has the added advantage of reducing the computational effort, relative to i.i.d. sampling from the most precise discretization, for a given level of error. We cover extensions of results regarding variance and optimality criteria for the new approach. We apply the methodology to the problem of computing an unbiased mollified version of the solution of a partial differential equation with random coefficients. A second application concerns the Bayesian inference (the smoothing problem) of an infinite dimensional signal modelled by the solution of a stochastic partial differential equation that is observed on a discrete space grid and at discrete times. Both applications are complemented by numerical simulations.

stat.CO↗

Identification of multi-object dynamical systems: consistency and Fisher information

Learning the model parameters of a multi-object dynamical system from partial and perturbed observations is a challenging task. Despite recent numerical advancements in learning these parameters, theoretical guarantees are extremely scarce. In this article, we study the identifiability of these parameters and the consistency of the corresponding maximum likelihood estimate (MLE) under assumptions on the different components of the underlying multi-object system. In order to understand the impact of the various sources of observation noise on the ability to learn the model parameters, we study the asymptotic variance of the MLE through the associated Fisher information matrix. For example, we show that specific aspects of the multi-target tracking (MTT) problem such as detection failures and unknown data association lead to a loss of information which is quantified in special cases of interest.

math.ST↗

A second-order PHD filter with mean and variance in target number

The Probability Hypothesis Density (PHD) and Cardinalized PHD (CPHD) filters are popular solutions to the multi-target tracking problem due to their low complexity and ability to estimate the number and states of targets in cluttered environments. The PHD filter propagates the first-order moment (i.e. mean) of the number of targets while the CPHD propagates the cardinality distribution in the number of targets, albeit for a greater computational cost. Introducing the Panjer point process, this paper proposes a second-order PHD filter, propagating the second-order moment (i.e. variance) of the number of targets alongside its mean. The resulting algorithm is more versatile in the modelling choices than the PHD filter, and its computational cost is significantly lower compared to the CPHD filter. The paper compares the three filters in statistical simulations which demonstrate that the proposed filter reacts more quickly to changes in the number of targets, i.e., target births and target deaths, than the CPHD filter. In addition, a new statistic for multi-object filters is introduced in order to study the correlation between the estimated number of targets in different regions of the state space, and propose a quantitative analysis of the spooky effect for the three filters.

stat.ME↗

Bayesian data assimilation based on a family of outer measures

A flexible representation of uncertainty that remains within the standard framework of probabilistic measure theory is presented along with a study of its properties. This representation relies on a specific type of outer measure that is based on the measure of a supremum, hence combining additive and highly sub-additive components. It is shown that this type of outer measure enables the introduction of intuitive concepts such as pullback and general data assimilation operations.

cs.IT↗

Multi-object filtering with stochastic populations

While the design of automated knowledge-based sensor scheduling is relevant to many multi-target detection and tracking problems, tracking algorithms are rarely built for this purpose and their outputs provide little flexibility for the design of sensor policies. In this paper, we present an estimation framework for stochastic populations in the context of multi-target estimation problems. Fully probabilistic in nature, it allows for the evaluation of the population of targets through statistical moments, as well as the assessment of sensor observations through information-theoretical gain functions. We present a principled solution derived from this framework addressing challenging multi-target scenarios involving missed detections and false alarms, the filter for Distinguishable and Independent Stochastic Populations, which propagates information on previously-detected targets as well as yet-to-be-detected targets while maintaining track continuity.

stat.AP↗

Spawning Models for the CPHD Filter

In its classical form, the Cardinalized Probability Hypothesis Density (CPHD) filter does not model the appearance of new targets through spawning, yet there are applications for which spawning models more appropriately account for newborn objects when compared to spontaneous birth models. In this paper, we propose a principled derivation of the CPHD filter with spawning from the Finite Set Statistics framework. A Gaussian Mixture implementation of the CPHD filter with spawning is then presented, illustrated with three applicable spawning models on a simulated scenario involving two parent targets spawning a total of five objects. Results show that filter implementations with spawn models provide more accurate results when compared to a birth model implementation.

stat.ME↗

A few calculus rules for chain differentials

This paper summarizes the core definitions and results regarding the chain differential for functions in locally convex topological vector spaces. In addition, it provides a few elementary calculus rules of practical interest, notably for the differentiation of characteristic functionals in various domains of physical science and engineering.

math.FA↗

A unified approach for multi-object triangulation, tracking and camera calibration

Object triangulation, 3-D object tracking, feature correspondence, and camera calibration are key problems for estimation from camera networks. This paper addresses these problems within a unified Bayesian framework for joint multi-object tracking and sensor registration. Given that using standard filtering approaches for state estimation from cameras is problematic, an alternative parametrisation is exploited, called disparity space. The disparity space-based approach for triangulation and object tracking is shown to be more effective than non-linear versions of the Kalman filter and particle filtering for non-rectified cameras. The approach for feature correspondence is based on the Probability Hypothesis Density (PHD) filter, and hence inherits the ability to update without explicit measurement association, to initiate new targets, and to discriminate between target and clutter. The PHD filtering approach then forms the basis of a camera calibration method from static or moving objects. Results are shown on simulated data.

cs.CV↗

Notes of the Summer School on Finite Set Statistics

This document contains the notes of some of the lectures given at the first summer school on Finite Set Statistics held in Edinburgh from July 22, 2013 to July 26, 2013. The notes are mostly self contained and are accessible to everyone.

math.PR↗