A Weighted Generalized Coherence Approach for Sensing Matrix Design

10/06/2021
by   Ameya Anjarlekar, et al.
0

As compared to using randomly generated sensing matrices, optimizing the sensing matrix w.r.t. a carefully designed criterion is known to lead to better quality signal recovery given a set of compressive measurements. In this paper, we propose generalizations of the well-known mutual coherence criterion for optimizing sensing matrices starting from random initial conditions. We term these generalizations as bi-coherence or tri-coherence and they are based on a criterion that discourages any one column of the sensing matrix from being close to a sparse linear combination of other columns. We also incorporate training data to further improve the sensing matrices through weighted coherence, weighted bi-coherence, or weighted tri-coherence criteria, which assign weights to sensing matrix columns as per their importance. An algorithm is also presented to solve the optimization problems. Finally, the effectiveness of the proposed algorithm is demonstrated through empirical results.

READ FULL TEXT

page 4

page 5

page 6

page 7

research
04/25/2019

Sensing Matrix Design and Sparse Recovery on the Sphere and the Rotation Group

In this paper, the goal is to design random or regular samples on the sp...
research
08/09/2014

Matrix Coherence and the Nystrom Method

The Nystrom method is an efficient technique used to speed up large-scal...
research
10/05/2020

Tight bounds on the mutual coherence of sensing matrices for Wigner D-functions on regular grids

Many practical sampling patterns for function approximation on the rotat...
research
09/22/2017

A preconditioning approach for improved estimation of sparse polynomial chaos expansions

Compressive sampling has been widely used for sparse polynomial chaos (P...
research
06/05/2022

Optimizing Sensing Matrices for Spherical Near-Field Antenna Measurements

In this article, we address the problem of reducing the number of requir...
research
09/17/2019

Coherence Statistics of Structured Random Ensembles and Support Detection Bounds for OMP

A structured random matrix ensemble that maintains constant modulus entr...
research
05/25/2021

Hashing embeddings of optimal dimension, with applications to linear least squares

The aim of this paper is two-fold: firstly, to present subspace embeddin...

Please sign up or login with your details

Forgot password? Click here to reset