paper-with-me

Papers

Covariance Estimation from Compressive Data Partitions using a Projected Gradient-based Algorithm

2021-01-11 · Jonathan Monsalve, Juan Ramirez, Iñaki Esnaola, Henry Arguello

Compressive covariance estimation has arisen as a class of techniques whose aim is to obtain second-order statistics of stochastic processes from compressive measurements. Recently, these methods have been used in various image processing and communications applications, including denoising, spectrum sensing, and compression. Notice that estimating the covariance matrix from compressive samples leads to ill-posed minimizations with severe performance loss at high compression rates. In this regard, a regularization term is typically aggregated to the cost function to consider prior information about a particular property of the covariance matrix. Hence, this paper proposes an algorithm based on the projected gradient method to recover low-rank or Toeplitz approximations of the covariance matrix from compressive measurements. The algorithm divides the compressive measurements into data subsets projected onto different subspaces and accurately estimates the covariance matrix by solving a single optimization problem assuming that each data subset contains an approximation of the signal statistics. Furthermore, gradient filtering is included at every iteration of the proposed algorithm to minimize the estimation error. The error induced by the proposed splitting approach is analytically derived along with the convergence guarantees of the proposed method. The algorithm estimates the covariance matrix of hyperspectral images from synthetic and real compressive samples. Extensive simulations show that the proposed algorithm can effectively recover the covariance matrix of hyperspectral images from compressive measurements (8-15% approx). Moreover, simulations and theoretical results show that the filtering step reduces the recovery error up to twice the number of eigenvectors. Finally, an optical implementation is proposed, and real measurements are used to validate the theoretical findings.

📄 PDF Abstract BibTeX arXiv:2101.04027

Code (1)

jams01/CovarianceImageReconstruction 공식 구현

Tasks

Compressive Sensing

Similar Papers 제목 키워드 기반

Estimation of the sample covariance matrix from compressive measurements

2015-12-30 · Farhad Pourkamali-Anaraki

This paper focuses on the estimation of the sample covariance matrix from low-dimensional random projections of data known as compressive measurements. In particular, we present an unbiased estimator to extract the covar…

Extreme Compressive Sampling for Covariance Estimation

2015-06-02 · Martin Azizyan, Akshay Krishnamurthy, Aarti Singh

This paper studies the problem of estimating the covariance of a collection of vectors using only highly compressed measurements of each vector. An estimator based on back-projections of these compressive samples is prop…

Spatial Channel Covariance Estimation for Hybrid Architectures Based on Tensor Decompositions

2019-02-17

Spatial channel covariance information can replace full instantaneous channel state information for the analog precoder design in hybrid analog/digital architectures. Obtaining spatial channel covariance estimation, howe…

Compressive SensingTensor Decomposition

Stretchy Polynomial Regression

2014-08-23 · Kar-Ann Toh

This article proposes a novel solution for stretchy polynomial regression learning. The solution comes in primal and dual closed-forms similar to that of ridge regression. Essentially, the proposed solution stretches the…

regression

Recovering Graph-Structured Activations using Adaptive Compressive Measurements

2013-05-01 · Akshay Krishnamurthy, James Sharpnack, Aarti Singh

We study the localization of a cluster of activated vertices in a graph, from adaptively designed compressive measurements. We propose a hierarchical partitioning of the graph that groups the activated vertices into few …