Reducing the dimensionality effect in importance sampling simulations

The dimensionality effect is avoided by the use of sufficient statistics in event probability estimators realised by importance sampling. If the system function is not a sufficient statistic, an approach is proposed to reduce the dimensionality effect in the estimators. Simulation results of false-alarm probability estimations, applied to radar detection, confirm a clear concordance with the theoretical results

Sampling associated with resolvent-type kernels and lagrange-type interpolation series

In this paper a new class of Kramer kernels is introduced, motivated by the resolvent of a symmetric operator with compact resolvent. The article gives a necessary and sufficient condition to ensure that the associ- ated sampling formula can be expressed as a Lagrange-type interpolation series. Finally, an illustrative example, taken from the Hamburger moment problem theory, is included.

The Kramer sampling theorem revisited

The classical Kramer sampling theorem provides a method for obtaining orthogonal sampling formulas. Besides, it has been the cornerstone for a significant mathematical literature on the topic of sampling theorems associated with differential and difference problems. In this work we provide, in an unified way, new and old generalizations of this result corresponding to various different settings; all these generalizations are illustrated with examples. All the different situations along the paper share a basic approach: the functions to be sampled are obtaining by duality in a separable Hilbert space H through an H -valued kernel K defined on an appropriate domain.

On some sampling-related frames in U-invariant spaces

This paper concerns the characterization as frames of some sequences in U-invariant spaces of a separable Hilbert space H where U denotes an unitary operator defined on H ; besides, the dual frames having the same form are also found. This general setting includes, in particular, shift-invariant or modulation-invariant subspaces in L2 (R), where these frames are intimately related to the generalized sampling problem. We also deal with some related perturbation problems. In so doing, we need that the unitary operator U belongs to a continuous group of unitary operators.

Generalized sampling in U-invariant subspaces

In this work we carry out some results in sampling theory for U-invariant subspaces of a separable Hilbert space H, also called atomic subspaces. These spaces are a generalization of the well-known shift- invariant subspaces in L2 (R); here the space L2 (R) is replaced by H, and the shift operator by U. Having as data the samples of some related operators, we derive frame expansions allowing the recovery of the elements in Aa. Moreover, we include a frame perturbation-type result whenever the samples are affected with a jitter error.

Sampling strategies using the "accumulation chamber" for monitoring geological storage of CO2

Fundación Ciudad de la Energía (CIUDEN) is carrying out a project of geological storage of CO2, where CO2 injection tests are planned in saline aquifers at a depth of 1500 m for scientific objectives and project demonstration. Before any CO2 is stored, it is necessary to determine the baseline flux of CO2 in order to detect potential leakage during injection and post-injection monitoring. In November 2009 diffuse flux measurements of CO2 using an accumulation chamber were made in the area selected by CIUDEN for geological storage, located in Hontomin province of Burgos (Spain). This paper presents the tests carried out in order to establish the optimum sampling methodology and the geostatistical analyses performed to determine the range, with which future field campaigns will be planned.

On-road visual vehicle tracking using Markov chain Monte Carlo with metropolis sampling

In this study, a method for vehicle tracking through video analysis based on Markov chain Monte Carlo (MCMC) particle filtering with metropolis sampling is proposed. The method handles multiple targets with low computational requirements and is, therefore, ideally suited for advanced-driver assistance systems that involve real-time operation. The method exploits the removed perspective domain given by inverse perspective mapping (IPM) to define a fast and efficient likelihood model. Additionally, the method encompasses an interaction model using Markov Random Fields (MRF) that allows treatment of dependencies between the motions of targets. The proposed method is tested in highway sequences and compared to state-of-the-art methods for vehicle tracking, i.e., independent target tracking with Kalman filtering (KF) and joint tracking with particle filtering. The results showed fewer tracking failures using the proposed method.

Spatial sampling methods for improved communication for wireless relay robots

Having reliable wireless communication in a network of mobile robots is an ongoing challenge, especially when the mobile robots are given tasks in hostile or harmful environments such as radiation environments in scientific facilities, tunnels with large metallic components and complicated geometries as found at CERN. In this paper, we propose a decentralised method for improving the wireless network throughput by optimizing the wireless relay robot position to receive the best wireless signal strength using implicit spatial diversity concepts and gradient-search algorithms. We experimentally demonstrate the effectiveness of the proposed solutions with a KUKA Youbot omni-directional mobile robot. The performance of the algorithms is compared under various scenarios in an underground scientific facility at CERN.

Independent doubly Adaptive Rejection Metropolis Sampling

Adaptive Rejection Metropolis Sampling (ARMS) is a wellknown MCMC scheme for generating samples from onedimensional target distributions. ARMS is widely used within Gibbs sampling, where automatic and fast samplers are often needed to draw from univariate full-conditional densities. In this work, we propose an alternative adaptive algorithm (IA2RMS) that overcomes the main drawback of ARMS (an uncomplete adaptation of the proposal in some cases), speeding up the convergence of the chain to the target. Numerical results show that IA2RMS outperforms the standard ARMS, providing a correlation among samples close to zero.