Searcharxiv⌕ Search

arXiv subjects

Mahdi Barzegar Khalilsarai

Publications and source records attributed to Mahdi Barzegar Khalilsarai.

20 records · Page 2Linked to original sources

Compressive Estimation of a Stochastic Process with Unknown Autocorrelation Function

In this paper, we study the prediction of a circularly symmetric zero-mean stationary Gaussian process from a window of observations consisting of finitely many samples. This is a prevalent problem in a wide range of applications in communication theory and signal processing. Due to stationarity, when the autocorrelation function or equivalently the power spectral density (PSD) of the process is available, the Minimum Mean Squared Error (MMSE) predictor is readily obtained. In particular, it is given by a linear operator that depends on autocorrelation of the process as well as the noise power in the observed samples. The prediction becomes, however, quite challenging when the PSD of the process is unknown. In this paper, we propose a blind predictor that does not require the a priori knowledge of the PSD of the process and compare its performance with that of an MMSE predictor that has a full knowledge of the PSD. To design such a blind predictor, we use the random spectral representation of a stationary Gaussian process. We apply the well-known atomic-norm minimization technique to the observed samples to obtain a discrete quantization of the underlying random spectrum, which we use to predict the process. Our simulation results show that this estimator has a good performance comparable with that of the MMSE estimator.

cs.IT↗

Matrix Coherency Graph: A Tool for Improving Sparse Coding Performance

Exact recovery of a sparse solution for an underdetermined system of linear equations implies full search among all possible subsets of the dictionary, which is computationally intractable, while l1 minimization will do the job when a Restricted Isometry Property holds for the dictionary. Yet, practical sparse recovery algorithms may fail to recover the vector of coefficients even when the dictionary deviates from the RIP only slightly. To enjoy l1 minimization guarantees in a wider sense, a method based on a combination of full-search and l1 minimization is presented. The idea is based on partitioning the dictionary into atoms which are in some sense well-conditioned and those which are ill-conditioned. Inspired by that, a matrix coherency graph is introduced which is a tool extracted by the structure of the dictionary. This tool can be used for decreasing the greediness of sparse coding algorithms so that recovery will be more reliable. We have modified the IRLS algorithm by applying the proposed method on it and simulation results show that the modified version performs quite better than the original algorithm.

cs.IT↗