Coherence Bounds for Sensing Matrices in Spherical Harmonics Expansion

  title={Coherence Bounds for Sensing Matrices in Spherical Harmonics Expansion},
  author={Arya Bangun and Arash Behboodi and Rudolf Mathar},
  journal={2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)},
The mutual coherence provides a basis for deriving recovery guarantees in compressed sensing. In this paper, the mutual coherence of spherical harmonics sensing matrices is examined for a class of sensing patterns common in practice and is used as a figure of merit for designing sensing matrices. We will show that for each sampling pattern, the coherence is lower bounded by the inner product of two Legendre polynomials with different degrees. In some practical situation, it is desirable to have… 

Figures from this paper

Tight bounds on the mutual coherence of sensing matrices for Wigner D-functions on regular grids
This paper analyzes the mutual coherence for sensing matrices that correspond to a class of regular patterns to angular momentum analysis in quantum mechanics and provides simple lower bounds for it and provides algorithms that can achieve the lower bound for spherical harmonics.
Sensing Matrix Design and Sparse Recovery on the Sphere and the Rotation Group
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.
On Grid Compressive Sensing for Spherical Field Measurements in Acoustics
We derive a theoretically guaranteed compressive sensing method for acoustic field reconstructions using spherical field measurements on a predefined grid. This method can be used to reconstruct sparse
Signal Recovery from Phaseless Measurements of Spherical Harmonics Expansion
This work will numerically show that recovery can be achieved by carefully choosing the appropriate sampling patterns for spherical harmonics coefficients from phaseless measurements and evaluate the empirical performance of several well-known algorithms.
Adaptive Sampling for Compressed Spherical Near-Field Measurements
To improve the probability of the acquired samples resulting in linearly independent equations while allowing for a fast acquisition, a compressed sampling scheme based on the minimum mutual coherence of the sampling matrix for an equidistant distribution on elevation is chosen.
A Modified Minimum-Coherence Sampling for Fast Spherical Near-Field Measurements
A modified compressed sampling based on minimal mutual coherence for spherical near-field measurements is proposed. After defining the sampling points for minimal coherence, more sampling points
A Compressed Sampling for Spherical Near-Field Measurements
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.
On the Influence of the Transformation Matrix in Compressed Spherical Near-Field Measurements
The radiation characteristics of an object are represented by the coefficients vector of a Wigner-D expansion. For most physical antennas and with appropriate choice of the expansion’s center, the
Practical Considerations in Compressed Spherical Near-Field Measurements
Results from a sparse data acquisition performed with a physical system are reported, demonstrating the viability of this method to accelerate SNF measurements and pave the way for further research.
Fast Spherical Near-Field Measurements on Arbitrary Surfaces by Application of Pointwise Probe Correction to Compressed Sampling Schemes
The major disadvantage of Spherical Near-Field (SNF) measurements is their long acquisition time. To calculate the Antenna Under Test’s (AUT) far-field radiation characteristics, a sphere containing


Optimized Projections for Compressed Sensing
  • Michael Elad
  • Computer Science
    IEEE Transactions on Signal Processing
  • 2007
This paper considers the optimization of compressed sensing projections, and targets an average measure of the mutual coherence of the effective dictionary, and shows that this leads to better CS reconstruction performance.
Designing Incoherent Frames Through Convex Techniques for Optimized Compressed Sensing
This paper gives a detailed analysis of the optimization problem at the heart of this approach and proposes a new method that substantially outperforms the initial approach and all current methods in the literature for all types of frames, with low and high redundancy.
Weighted Eigenfunction Estimates with Applications to Compressed Sensing
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.
The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
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.
Coherence Optimization and Best Complex Antipodal Spherical Codes
Using methods used to find best spherical codes in the real-valued Euclidean space, the proposed approach aims to find BCASCs, and thereby, a complex-valued vector set with minimal coherence.
Fast Antenna Far-Field Characterization via Sparse Spherical Harmonic Expansion
A procedure is proposed to significantly reduce the amount of time to characterize 3-D antenna far-field patterns. The measured far field is expanded into spherical harmonics, and a sparse recovery
Analysis and design of spherical microphone arrays
  • B. Rafaely
  • Physics
    IEEE Transactions on Speech and Audio Processing
  • 2005
Alternative spatial sampling schemes for the positioning of microphones on a sphere are presented, and the errors introduced by finite number of microphones, spatial aliasing, inaccuracies in microphone positioning, and measurement noise are investigated both theoretically and by using simulations.
Grassmannian beamforming for multiple-input multiple-output wireless systems
A codebook design method for quantized versions of maximum ratio transmission, equal gain transmission, and generalized selection diversity with maximum ratio combining at the receiver is presented and systems using the beamforming codebooks are shown to have a diversity order of the product of the number of transmit and thenumber of receive antennas.
A Mathematical Introduction to Compressive Sensing
A Mathematical Introduction to Compressive Sensing gives a detailed account of the core theory upon which the field is build and serves as a reliable resource for practitioners and researchers in these disciplines who want to acquire a careful understanding of the subject.
Can matrix coherence be efficiently and accurately estimated?
A novel sampling-based algorithm for estimating coherence is introduced, associated estimation guarantees are presented and the results of extensive experiments for coherence estimation are reported, revealing the extent to which coherence assumptions made in a number of recent machine learning publications are testable.