Unscented Kalman Filter for Brain-Machine Interfaces

Brain machine interfaces (BMIs) are devices that convert neural signals into commands to directly control artificial actuators, such as limb prostheses. Previous real-time methods applied to decoding behavioral commands from the activity of populations of neurons have generally relied upon linear models of neural tuning and were limited in the way they used the abundant statistical information contained in the movement profiles of motor tasks. Here, we propose an n-th order unscented Kalman filter which implements two key features: (1) use of a non-linear (quadratic) model of neural tuning which describes neural activity significantly better than commonly-used linear tuning models, and (2) augmentation of the movement state variables with a history of n-1 recent states, which improves prediction of the desired command even before incorporating neural activity information and allows the tuning model to capture relationships between neural activity and movement at multiple time offsets simultaneously. This new filter was tested in BMI experiments in which rhesus monkeys used their cortical activity, recorded through chronically implanted multielectrode arrays, to directly control computer cursors. The 10th order unscented Kalman filter outperformed the standard Kalman filter and the Wiener filter in both off-line reconstruction of movement trajectories and real-time, closed-loop BMI operation

Widely Linear State Space Filtering of Improper Complex Signals

Complex signals are the backbone of many modern applications, such as power systems, communication systems, biomedical sciences and military technologies. However, standard complex valued signal processing approaches are suited to only a subset of complex signals known as proper, and are inadequate of the generality of complex signals, as they do not fully exploit the available information. This is mainly due to the inherent blindness of the algorithms to the complete second order statistics of the signals, or due to under-modelling of the underlying system. The aim of this thesis is to provide enhanced complex valued, state space based, signal processing solutions for the generality of complex signals and systems. This is achieved based on the recent advances in the so called augmented complex statistics and widely linear modelling, which have brought to light the limitations of conventional statistical complex signal processing approaches. Exploiting these developments, we propose a class of widely linear adaptive state space estimation techniques, which provide a unified framework and enhanced performance for the generality of complex signals, compared with conventional approaches. These include the linear and nonlinear Kalman and particle filters, whereby it is shown that catering for the complete second order information and system models leads to significant performance gains. The proposed techniques are also extended to the case of cooperative distributed estimation, where nodes in a network collaborate locally to estimate signals, under a framework that caters for general complex signals, as well as the cross-correlations between observation noises, unlike earlier solutions. The analysis of the algorithms are supported by numerous case studies, including frequency estimation in three phase power systems, DIFAR sonobuoy underwater target tracking, and real-world wind modeling and prediction.Open Acces

Real-time flutter identification

The techniques and a FORTRAN 77 MOdal Parameter IDentification (MOPID) computer program developed for identification of the frequencies and damping ratios of multiple flutter modes in real time are documented. Physically meaningful model parameterization was combined with state of the art recursive identification techniques and applied to the problem of real time flutter mode monitoring. The performance of the algorithm in terms of convergence speed and parameter estimation error is demonstrated for several simulated data cases, and the results of actual flight data analysis from two different vehicles are presented. It is indicated that the algorithm is capable of real time monitoring of aircraft flutter characteristics with a high degree of reliability

Finite Impulse Response Filtering Algorithm with Adaptive Horizon Size Selection and Its Applications

It is known, that unlike the Kalman filter (KF) finite impulse response (FIR) filters allow to avoid the divergence and unsatisfactory object tracking connected with temporary perturbations and abrupt object changes. The main challenge is to provide the appropriate choice of a sliding window size for them. In this paper, the new finite impulse response (FIR) filtering algorithm with the adaptive horizon size selection is proposed. The algorithm uses the receding horizon optimal (RHOFIR) filter which receives estimates, an abrupt change detector and an adaptive recurrent mechanism for choosing the window size. Monotonicity and asymptotic properties of the estimation error covariance matrix and the RHOFIR filter gain are established. These results form a solid foundation for justifying the principal possibility to tune the filter gain using them and the developed adaptation mechanism. The proposed algorithm (the ARHOFIR filter) allows reducing the impact of disturbances by varying adaptively the sliding window size. The possibility of this follows from the fact that the window size affects the filter characteristics in different ways. The ARHOFIR filter chooses a large horizon size in the absence of abrupt disturbances and a little during the time intervals of their action. Due to this, it has better transient characteristics compared to the KF and RHOFIR filter at intervals where there is temporary uncertainty and may provide the same accuracy of estimates as the KF in their absence. By simulation, it is shown that the ARHOFIR filter is more robust than the KF and RHOFIR filter for the temporarily uncertain systems

Radar data smoothing filter study

The accuracy of the current Wallops Flight Facility (WFF) data smoothing techniques for a variety of radars and payloads is examined. Alternative data reduction techniques are given and recommendations are made for improving radar data processing at WFF. A data adaptive algorithm, based on Kalman filtering and smoothing techniques, is also developed for estimating payload trajectories above the atmosphere from noisy time varying radar data. This algorithm is tested and verified using radar tracking data from WFF

Higher-Order GPS Noise Models, with Applications to Position Inference and Vehicle Navigation

This thesis presents an experimental and theoretical investigation of GPS errors. Data from stationary GPS units were gathered from several locations and an analysis of the noise present was undertaken. Several noise models were proposed and their relative performance compared using the Akaike Information Criterion. A vehicle navigation system was implemented using a dynamical vehicle model which combined GPS, accelerometer and gyroscope measurements via a nonlinear Kalman filter to enable superior position and velocity estimation, especially during shortterm losses of GPS signal

Latent state estimation in a class of nonlinear systems

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.The problem of estimating latent or unobserved states of a dynamical system from observed data is studied in this thesis. Approximate filtering methods for discrete time series for a class of nonlinear systems are considered, which, in turn, require sampling from a partially specified discrete distribution. A new algorithm is proposed to sample from partially specified discrete distribution, where the specification is in terms of the first few moments of the distribution. This algorithm generates deterministic sigma points and corresponding probability weights, which match exactly a specified mean vector, a specified covariance matrix, the average of specified marginal skewness and the average of specified marginal kurtosis. Both the deterministic particles and the probability weights are given in closed form and no numerical optimization is required. This algorithm is then used in approximate Bayesian filtering for generation of particles and the associated probability weights which propagate higher order moment information about latent states. This method is extended to generate random sigma points (or particles) and corresponding probability weights that match the same moments. The algorithm is also shown to be useful in scenario generation for financial optimization. For a variety of important distributions, the proposed moment-matching algorithm for generating particles is shown to lead to approximation which is very close to maximum entropy approximation. In a separate, but related contribution to the field of nonlinear state estimation, a closed-form linear minimum variance filter is derived for the systems with stochastic parameter uncertainties. The expressions for eigenvalues of the perturbed filter are derived for comparison with eigenvalues of the unperturbed Kalman filter. Moment-matching approximation is proposed for the nonlinear systems with multiplicative stochastic noise

Gaussian processes for state space models and change point detection

This thesis details several applications of Gaussian processes (GPs) for enhanced time series modeling. We first cover different approaches for using Gaussian processes in time series problems. These are extended to the state space approach to time series in two different problems. We also combine Gaussian processes and Bayesian online change point detection (BOCPD) to increase the generality of the Gaussian process time series methods. These methodologies are evaluated on predictive performance on six real world data sets, which include three environmental data sets, one financial, one biological, and one from industrial well drilling. Gaussian processes are capable of generalizing standard linear time series models. We cover two approaches: the Gaussian process time series model (GPTS) and the autoregressive Gaussian process (ARGP). We cover a variety of methods that greatly reduce the computational and memory complexity of Gaussian process approaches, which are generally cubic in computational complexity. Two different improvements to state space based approaches are covered. First, Gaussian process inference and learning (GPIL) generalizes linear dynamical systems (LDS), for which the Kalman filter is based, to general nonlinear systems for nonparametric system identification. Second, we address pathologies in the unscented Kalman filter (UKF). We use Gaussian process optimization (GPO) to learn UKF settings that minimize the potential for sigma point collapse. We show how to embed mentioned Gaussian process approaches to time series into a change point framework. Old data, from an old regime, that hinders predictive performance is automatically and elegantly phased out. The computational improvements for Gaussian process time series approaches are of even greater use in the change point framework. We also present a supervised framework learning a change point model when change point labels are available in training.I would like to thank Rockwell Collins, formerly DataPath, Inc., which funded my studentship

Stochastic Signal Processing and Power Control for Wireless Communication Systems

This dissertation is concerned with dynamical modeling, estimation and identification of wireless channels from received signal measurements. Optimal power control algorithms, mobile location and velocity estimation methods are developed based on the proposed models. The ultimate performance limits of any communication system are determined by the channel it operates in. In this dissertation, we propose new stochastic wireless channel models which capture both the space and time variations of wireless systems. The proposed channel models are based on stochastic differential equations (SDEs) driven by Brownian motions. These models are more realistic than the time invariant models encountered in the literature which do not capture and track the time varying characteristics of the propagation environment. The statistics of the proposed models are shown to be time varying, and converge in steady state to their static counterparts. Cellular and ad hoc wireless channel models are developed. In urban propagation environment, the parameters of the channel models can be determined from approximating the band-limited Doppler power spectral density (DPSD) by rational transfer functions. However, since the DPSD is not available on-line, a filterbased expectation maximization algorithm and Kalman filter to estimate the channel parameters and states, respectively, are proposed. The algorithm is recursive allowing the inphase and quadrature components and parameters to be estimated on-line from received signal measurements. The algorithms are tested using experimental data, and the results demonstrate the method’s viability for both cellular and ad hoc networks. Power control increases system capacity and quality of communications, and reduces battery power consumption. A stochastic power control algorithm is developed using the so-called predictable power control strategies. An iterative distributed algorithm is then deduced using stochastic approximations. The latter only requires each mobile to know its received signal to interference ratio at the receiver