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

@article{Bangun2021TightBO,
  title={Tight bounds on the mutual coherence of sensing matrices for Wigner D-functions on regular grids},
  author={Arya Bangun and Arash Behboodi and Rudolf Mathar},
  journal={ArXiv},
  year={2021},
  volume={abs/2010.02344}
}
Many practical sampling patterns for function approximation on the rotation group utilizes regular samples on the parameter axes. In this paper, we analyze the mutual coherence 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… 
Optimizing Sensing Matrices for Spherical Near-Field Antenna Measurements
TLDR
This article addresses the problem of reducing the number of required samples for Spherical Near-Field Antenna Measurements (SNF) by using Compressed Sensing (CS) by proposing sampling points that minimize the mutual coherence of the respective sensing matrix by using augmented Lagrangian method.

References

SHOWING 1-10 OF 32 REFERENCES
Sensing Matrix Design and Sparse Recovery on the Sphere and the Rotation Group
TLDR
The goal is to design deterministic sampling patterns on the sphere and the rotation group and, thereby, construct sensing matrices for sparse recovery of band-limited functions and provides a new expression for the mutual coherence, which encourages the use of regular elevation samples.
Coherence Bounds for Sensing Matrices in Spherical Harmonics Expansion
TLDR
It will be shown that for a class of sampling patterns, the mutual coherence would be at its maximum, yielding the worst performance, and the sampling strategy is proposed to achieve the derived lower bound.
The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
TLDR
It is confirmed by showing that for a given matrix A and positive integer k, computing the best constants for which the RIP or NSP hold is, in general, NP-hard.
On the Minimum Number of Samples for Sparse Recovery in Spherical Antenna Near-Field Measurements
TLDR
The resulting modified phase transition diagrams (PTDs) show that a reconstruction by the quadratically constraint basis pursuit strategy is sufficiently stable and robust for practical purposes to reduce the number of measurement samples with predictable accuracy, when the sparsity level is known.
A Compressed Sampling for Spherical Near-Field Measurements
TLDR
A novel sampling strategy is proposed and is combined with compressed-sensing techniques, such as basis pursuit solvers, to retrieve the sparse SMC, which are then used to obtain the AUT's far-field radiation.
Weighted Eigenfunction Estimates with Applications to Compressed Sensing
TLDR
Using tools from semiclassical analysis, weighted L^\infty estimates for eigenfunctions of strictly convex surfaces of revolution are given and imply that any function having an s-sparse expansion in the first N spherical harmonics can be efficiently recovered from its values at m > s N^(1/6) log^4(N) sampling points.
Sparse Legendre expansions via l1-minimization
Spatiospectral Concentration on a Sphere
TLDR
In the asymptotic limit of a small spatial region and a large spherical harmonic bandwidth, the spherical concentration problem reduces to its planar equivalent, which exhibits self-similarity when the Shannon number is kept invariant.
...
...