Dynamic inverse problem solution considering non-homogeneous source distribution with frequency spatio temporal constraints applied to brain activity reconstruction

Para reconstruir la actividad cerebral es necesario estimular la ubicación de las fuentes activas del cerebro. El método de localización de fuentes usando electroencefalogramas es usado para esta tarea por su alta resolución temporal. Este método de resolver un problema inverso mal planteado, el cual no tiene una solución única debido al que el números de variables desconocidas es mas grande que el numero de variables conocidas. por lo tanto el método presenta una baja resolución espacial..

Carrier frequency offset recovery for zero-IF OFDM receivers

As trends in broadband wireless communications applications demand faster development cycles, smaller sizes, lower costs, and ever increasing data rates, engineers continually seek new ways to harness evolving technology. The zero intermediate frequency receiver architecture has now become popular as it has both economic and size advantages over the traditional superheterodyne architecture. Orthogonal Frequency Division Multiplexing (OFDM) is a popular multi-carrier modulation technique with the ability to provide high data rates over echo ladened channels. It has excellent robustness to impairments caused by multipath, which includes frequency selective fading. Unfortunately, OFDM is very sensitive to the carrier frequency offset (CFO) that is introduced by the downconversion process. The objective of this thesis is to develop and to analyze an algorithm for blind CFO recovery suitable for use with a practical zero-Intermediate Frequency (zero-IF) OFDM telecommunications system. A blind CFO recovery algorithm based upon characteristics of the received signal's power spectrum is proposed. The algorithm's error performance is mathematically analyzed, and the theoretical results are verified with simulations. Simulation shows that the performance of the proposed algorithm agrees with the mathematical analysis. A number of other CFO recovery techniques are compared to the proposed algorithm. The proposed algorithm performs well in comparison and does not suffer from many of the disadvantages of existing blind CFO recovery techniques. Most notably, its performance is not significantly degraded by noisy, frequency selective channels

Overview of Recent Flight Flutter Testing Research at NASA Dryden

In response to the concerns of the aeroelastic community, NASA Dryden Flight Research Center, Edwards, California, is conducting research into improving the flight flutter (including aeroservoelasticity) test process with more accurate and automated techniques for stability boundary prediction. The important elements of this effort so far include the following: (1) excitation mechanisms for enhanced vibration data to reduce uncertainty levels in stability estimates; (2) investigation of a variety of frequency, time, and wavelet analysis techniques for signal processing, stability estimation, and nonlinear identification; and (3) robust flutter boundary prediction to substantially reduce the test matrix for flutter clearance. These are critical research topics addressing the concerns of a recent AGARD Specialists' Meeting on Advanced Aeroservoelastic Testing and Data Analysis. This paper addresses these items using flight test data from the F/A-18 Systems Research Aircraft and the F/A-18 High Alpha Research Vehicle

Adaptive filtering algorithms for quaternion-valued signals

Advances in sensor technology have made possible the recoding of three and four-dimensional signals which afford a better representation of our actual three-dimensional world than the ``flat view'' one and two-dimensional approaches. Although it is straightforward to model such signals as real-valued vectors, many applications require unambiguous modeling of orientation and rotation, where the division algebra of quaternions provides crucial advantages over real-valued vector approaches. The focus of this thesis is on the use of recent advances in quaternion-valued signal processing, such as the quaternion augmented statistics, widely-linear modeling, and the HR-calculus, in order to develop practical adaptive signal processing algorithms in the quaternion domain which deal with the notion of phase and frequency in a compact and physically meaningful way. To this end, first a real-time tracker of quaternion impropriety is developed, which allows for choosing between strictly linear and widely-linear quaternion-valued signal processing algorithms in real-time, in order to reduce computational complexity where appropriate. This is followed by the strictly linear and widely-linear quaternion least mean phase algorithms that are developed for phase-only estimation in the quaternion domain, which is accompanied by both quantitative performance assessment and physical interpretation of operations. Next, the practical application of state space modeling of three-phase power signals in smart grid management and control systems is considered, and a robust complex-valued state space model for frequency estimation in three-phase systems is presented. Its advantages over other available estimators are demonstrated both in an analytical sense and through simulations. The concept is then expanded to the quaternion setting in order to make possible the simultaneous estimation of the system frequency and its voltage phasors. Furthermore, a distributed quaternion Kalman filtering algorithm is developed for frequency estimation over power distribution networks and collaborative target tracking. Finally, statistics of stable quaternion-valued random variables, that include quaternion-valued Gaussian random variables as a special case, is investigated in order to develop a framework for the modeling and processing of heavy-tailed quaternion-valued signals.Open Acces

Técnicas baseadas em subespaços e aplicações

Doutoramento em Engenharia ElectrónicaEste trabalho focou-se no estudo de técnicas de sub-espaço tendo em vista as aplicações seguintes: eliminação de ruído em séries temporais e extracção de características para problemas de classificação supervisionada. Foram estudadas as vertentes lineares e não-lineares das referidas técnicas tendo como ponto de partida os algoritmos SSA e KPCA. No trabalho apresentam-se propostas para optimizar os algoritmos, bem como uma descrição dos mesmos numa abordagem diferente daquela que é feita na literatura. Em qualquer das vertentes, linear ou não-linear, os métodos são apresentados utilizando uma formulação algébrica consistente. O modelo de subespaço é obtido calculando a decomposição em valores e vectores próprios das matrizes de kernel ou de correlação/covariância calculadas com um conjunto de dados multidimensional. A complexidade das técnicas não lineares de subespaço é discutida, nomeadamente, o problema da pre-imagem e a decomposição em valores e vectores próprios de matrizes de dimensão elevada. Diferentes algoritmos de préimagem são apresentados bem como propostas alternativas para a sua optimização. A decomposição em vectores próprios da matriz de kernel baseada em aproximações low-rank da matriz conduz a um algoritmo mais eficiente- o Greedy KPCA. Os algoritmos são aplicados a sinais artificiais de modo a estudar a influência dos vários parâmetros na sua performance. Para além disso, a exploração destas técnicas é extendida à eliminação de artefactos em séries temporais biomédicas univariáveis, nomeadamente, sinais EEG.This work focuses on the study of linear and non-linear subspace projective techniques with two intents: noise elimination and feature extraction. The conducted study is based on the SSA, and Kernel PCA algorithms. Several approaches to optimize the algorithms are addressed along with a description of those algorithms in a distinct approach from the one made in the literature. All methods presented here follow a consistent algebraic formulation to manipulate the data. The subspace model is formed using the elements from the eigendecomposition of kernel or correlation/covariance matrices computed on multidimensional data sets. The complexity of non-linear subspace techniques is exploited, namely the preimage problem and the kernel matrix dimensionality. Different pre-image algorithms are presented together with alternative proposals to optimize them. In this work some approximations to the kernel matrix based on its low rank approximation are discussed and the Greedy KPCA algorithm is introduced. Throughout this thesis, the algorithms are applied to artificial signals in order to study the influence of the several parameters in their performance. Furthermore, the exploitation of these techniques is extended to artefact removal in univariate biomedical time series, namely, EEG signals.FCT - SFRH/BD/28404/200

On Kalman smoothing with random packet loss

The abstract is included in the text

Measurements, Models, Systems and Design

531 s.

Coherent multi-dimensional segmentation of multiview images using a variational framework and applications to image based rendering

Image Based Rendering (IBR) and in particular light field rendering has attracted a lot of attention for interpolating new viewpoints from a set of multiview images. New images of a scene are interpolated directly from nearby available ones, thus enabling a photorealistic rendering. Sampling theory for light fields has shown that exact geometric information in the scene is often unnecessary for rendering new views. Indeed, the band of the function is approximately limited and new views can be rendered using classical interpolation methods. However, IBR using undersampled light fields suffers from aliasing effects and is difficult particularly when the scene has large depth variations and occlusions. In order to deal with these cases, we study two approaches: New sampling schemes have recently emerged that are able to perfectly reconstruct certain classes of parametric signals that are not bandlimited but characterized by a finite number of parameters. In this context, we derive novel sampling schemes for piecewise sinusoidal and polynomial signals. In particular, we show that a piecewise sinusoidal signal with arbitrarily high frequencies can be exactly recovered given certain conditions. These results are applied to parametric multiview data that are not bandlimited. We also focus on the problem of extracting regions (or layers) in multiview images that can be individually rendered free of aliasing. The problem is posed in a multidimensional variational framework using region competition. In extension to previous methods, layers are considered as multi-dimensional hypervolumes. Therefore the segmentation is done jointly over all the images and coherence is imposed throughout the data. However, instead of propagating active hypersurfaces, we derive a semi-parametric methodology that takes into account the constraints imposed by the camera setup and the occlusion ordering. The resulting framework is a global multi-dimensional region competition that is consistent in all the images and efficiently handles occlusions. We show the validity of the approach with captured light fields. Other special effects such as augmented reality and disocclusion of hidden objects are also demonstrated