Improved Interference Aware Precoding for Cellular Network-MIMO Systems

This proceeding at: The 22nd European Signal Processing Conference (EUSIPCO), took place 2014, September, 01-05 in Lisbon (Portugal).An interference aware precoding scheme based on limited channel state information at the transmitter (CSIT) is consid-ered for its use in the downlink of a cellular system. The transmitter precoder used is based on an MMSE-ZF criterion in order to maximize the user rate while the interference to other users is reduced. The proposed scheme also exploits the network topology, so that each BS can categorize the users into two groups, according to the level of interference that the BS is introducing in those users. On the receiver end, each user makes use of the whole channel state information at the receiver (CSIR) by employing an MMSE filter. This approach enables a reduction in the complexity of the system, while improving the performance of the whole network.This work has been partially funded by research projects COMONSENS (CSD2008-00010), and GRE3N (TEC2011-29006-C03-03.Publicad

New results in nonlinear state estimation using extended unbiased fir filtering

This paper discusses two algorithms of extended unbiased FIR (EFIR) filtering of nonlinear discrete-time state-space models used in tracking and state estimation. The basic algorithm employs the extended nonlinear state and observation equations. The modified algorithm utilizes the nonlinear-to-linear conversion of the observation equation which is provided using a batch EFIR filter having small memory. Unlike the extended Kalman filter (EKF), both EFIR algorithms ignore the noise statistics and demonstrate better robustness against temporary model uncertainties. These algorithms require an optimal horizon in order to minimize the mean square error. Applications are given for robot indoor self-localization utilizing radio frequency identification tags

Fusion of multispectral and hyperspectral images based on sparse representation

National audienceThis paper presents an algorithm based on sparse representation for fusing hyperspectral and multispectral images. The observed images are assumed to be obtained by spectral or spatial degradations of the high resolution hyperspectral image to be recovered. Based on this forward model, the fusion process is formulated as an inverse problem whose solution is determined by optimizing an appropriate criterion. To incorporate additional spatial information within the objective criterion, a regularization term is carefully designed,relying on a sparse decomposition of the scene on a set of dictionaryies. The dictionaries and the corresponding supports of active coding coef�cients are learned from the observed images. Then, conditionally on these dictionaries and supports, the fusion problem is solved by iteratively optimizing with respect to the target image (using the alternating direction method of multipliers) and the coding coefcients. Simulation results demonstrate the ef�ciency of the proposed fusion method when compared with the state-of-the-art

Bayesian Lower Bounds for Dense or Sparse (Outlier) Noise in the RMT Framework

Robust estimation is an important and timely research subject. In this paper, we investigate performance lower bounds on the mean-square-error (MSE) of any estimator for the Bayesian linear model, corrupted by a noise distributed according to an i.i.d. Student's t-distribution. This class of prior parametrized by its degree of freedom is relevant to modelize either dense or sparse (accounting for outliers) noise. Using the hierarchical Normal-Gamma representation of the Student's t-distribution, the Van Trees' Bayesian Cram\'er-Rao bound (BCRB) on the amplitude parameters is derived. Furthermore, the random matrix theory (RMT) framework is assumed, i.e., the number of measurements and the number of unknown parameters grow jointly to infinity with an asymptotic finite ratio. Using some powerful results from the RMT, closed-form expressions of the BCRB are derived and studied. Finally, we propose a framework to fairly compare two models corrupted by noises with different degrees of freedom for a fixed common target signal-to-noise ratio (SNR). In particular, we focus our effort on the comparison of the BCRBs associated with two models corrupted by a sparse noise promoting outliers and a dense (Gaussian) noise, respectively

Semi-local Total Variation for Regularization of Inverse Problems

International audienceWe propose the discrete semi-local total variation (SLTV) as a new regularization functional for inverse problems in imaging. The SLTV favors piecewise linear images; so the main drawback of the total variation (TV), its clustering effect, is avoided. Recently proposed primal-dual methods allow to solve the corresponding optimization problems as easily and efficiently as with the classical TV

Efficient recovery algorithm for discrete valued sparse signals using an ADMM approach

Motivated by applications in wireless communications, in this paper we propose a reconstruction algorithm for sparse signals whose values are taken from a discrete set, using a limited number of noisy observations. Unlike conventional compressed sensing algorithms, the proposed approach incorporates knowledge of the discrete valued nature of the signal in the detection process. This is accomplished through the alternating direction method of the multipliers which is applied as a heuristic to decompose the associated maximum likelihood detection problem in order to find candidate solutions with a low computational complexity order. Numerical results in different scenarios show that the proposed algorithm is capable of achieving very competitive recovery error rates when compared with other existing suboptimal approaches.info:eu-repo/semantics/publishedVersio

Analysis and Evaluation of the Family of Sign Adaptive Algorithms

In this thesis, four novel sign adaptive algorithms proposed by the author were analyzed and evaluated for floating-point arithmetic operations. These four algorithms include Sign Regressor Least Mean Fourth (SRLMF), Sign Regressor Least Mean Mixed-Norm (SRLMMN), Normalized Sign Regressor Least Mean Fourth (NSRLMF), and Normalized Sign Regressor Least Mean Mixed-Norm (NSRLMMN). The performance of the latter three algorithms has been analyzed and evaluated for real-valued data only. While the performance of the SRLMF algorithm has been analyzed and evaluated for both cases of real- and complex-valued data. Additionally, four sign adaptive algorithms proposed by other researchers were also analyzed and evaluated for floating-point arithmetic operations. These four algorithms include Sign Regressor Least Mean Square (SRLMS), Sign-Sign Least Mean Square (SSLMS), Normalized Sign-Error Least Mean Square (NSLMS), and Normalized Sign Regressor Least Mean Square (NSRLMS). The performance of the latter three algorithms has been analyzed and evaluated for both cases of real- and complex-valued data. While the performance of the SRLMS algorithm has been analyzed and evaluated for complex-valued data only. The framework employed in this thesis relies on energy conservation approach. The energy conservation framework has been applied uniformly for the evaluation of the performance of the aforementioned eight sign adaptive algorithms proposed by the author and other researchers. In other words, the energy conservation framework stands out as a common theme that runs throughout the treatment of the performance of the aforementioned eight algorithms. Some of the results from the performance evaluation of the four novel sign adaptive algorithms proposed by the author, namely SRLMF, SRLMMN, NSRLMF, and NSRLMMN are as follows. It was shown that the convergence performance of the SRLMF and SRLMMN algorithms for real-valued data was similar to those of the Least Mean Fourth (LMF) and Least Mean Mixed-Norm (LMMN) algorithms, respectively. Moreover, it was also shown that the NSRLMF and NSRLMMN algorithms exhibit a compromised convergence performance for realvalued data as compared to the Normalized Least Mean Fourth (NLMF) and Normalized Least Mean Mixed-Norm (NLMMN) algorithms, respectively. Some misconceptions among biomedical signal processing researchers concerning the implementation of adaptive noise cancelers using the Sign-Error Least Mean Fourth (SLMF), Sign-Sign Least Mean Fourth (SSLMF), and their variant algorithms were also removed. Finally, three of the novel sign adaptive algorithms proposed by the author, namely SRLMF, SRLMMN, and NSRLMF have been successfully employed by other researchers and the author in applications ranging from power quality improvement in the distribution system and multiple artifacts removal from various physiological signals such as ElectroCardioGram (ECG) and ElectroEncephaloGram (EEG)

Human action recognition in stereoscopic videos based on bag of features and disparity pyramids

Publication in the conference proceedings of EUSIPCO, Lisbon, Portugal, 201