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

10/05/2020
by   Arya Bangun, et al.
0

Many practical sampling patterns for function approximation on the rotation group utilizes regular samples on the parameter axes. In this paper, we relate the mutual coherence analysis for sensing matrices that correspond to a class of regular patterns to angular momentum analysis in quantum mechanics and provide simple lower bounds for it. The products of Wigner d-functions, which appear in coherence analysis, arise in angular momentum analysis in quantum mechanics. We first represent the product as a linear combination of a single Wigner d-function and angular momentum coefficients, otherwise known as the Wigner 3j symbols. Using combinatorial identities, we show that under certain conditions on the bandwidth and number of samples, the inner product of the columns of the sensing matrix at zero orders, which is equal to the inner product of two Legendre polynomials, dominates the mutual coherence term and fixes a lower bound for it. In other words, for a class of regular sampling patterns, we provide a lower bound for the inner product of the columns of the sensing matrix that can be analytically computed. We verify numerically our theoretical results and show that the lower bound for the mutual coherence is larger than Welch bound. Besides, we provide algorithms that can achieve the lower bound for spherical harmonics.

READ FULL TEXT

page 9

page 10

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

A Weighted Generalized Coherence Approach for Sensing Matrix Design

As compared to using randomly generated sensing matrices, optimizing the...
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/08/2019

Sharp uniform lower bounds for the Schur product theorem

By a result of Schur [J. Reine Angew. Math. 1911], the entrywise product...
research
11/19/2019

Guarantees for the Kronecker Fast Johnson-Lindenstrauss Transform Using a Coherence and Sampling Argument

In the recent paper [Jin, Kolda Ward, arXiv:1909.04801], it is prove...
research
10/29/2021

Equiangular lines and regular graphs

In 1973, Lemmens and Seidel posed the problem of determining N_α(r), the...
research
12/23/2015

Latent Variable Modeling with Diversity-Inducing Mutual Angular Regularization

Latent Variable Models (LVMs) are a large family of machine learning mod...

Please sign up or login with your details

Forgot password? Click here to reset