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

04/25/2019
by   Arya Bangun, et al.
0

In this paper, the goal is to design random or regular samples on the sphere or the rotation group and, thereby, construct sensing matrices for sparse recovery of band-limited functions. It is first shown that random sensing matrices, which consists of random samples of Wigner D-functions, satisfy the Restricted Isometry Property (RIP) with a proper preconditioning and can be used for sparse recovery on the rotation group. The mutual coherence, however, is used to assess the performance of deterministic and regular sensing matrices. We show that many of widely used regular sampling patterns yield sensing matrices with the worst possible mutual coherence, and therefore are undesirable for sparse recovery. Using tools from angular momentum analysis in quantum mechanics, we provide a new expression for the mutual coherence, which encourages the use of regular elevation samples. We construct low coherence deterministic matrices by fixing the regular samples on the elevation and minimizing the mutual coherence over the azimuth-polarization choice. It is shown that once the elevation sampling is fixed, the mutual coherence has a lower bound that depends only on the elevation samples. This lower bound, however, can be achieved for spherical harmonics, which leads to new sensing matrices with better coherence than other representative regular sampling patterns. This is reflected as well in our the numerical experiments where our proposed sampling patterns match perfectly the phase transition of random sampling patterns.

READ FULL TEXT
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
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
10/06/2021

A Weighted Generalized Coherence Approach for Sensing Matrix Design

As compared to using randomly generated sensing matrices, optimizing the...
research
03/28/2019

An Improved Lower Bound for Sparse Reconstruction from Subsampled Hadamard Matrices

We give a short argument that yields a new lower bound on the number of ...
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/28/2018

Signal Recovery under Cumulative Coherence

This paper considers signal recovery in the framework of cumulative cohe...
research
01/09/2019

The Use of Mutual Coherence to Prove ℓ^1/ℓ^0-Equivalence in Classification Problems

We consider the decomposition of a signal over an overcomplete set of ve...

Please sign up or login with your details

Forgot password? Click here to reset