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

  title={Sensing Matrix Design and Sparse Recovery on the Sphere and the Rotation Group},
  author={Arya Bangun and Arash Behboodi and Rudolf Mathar},
  journal={IEEE Transactions on Signal Processing},
In this article, 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. It is first shown that random sensing matrices, which consists of random samples of Wigner D-functions, satisfy the Restricted Isometry Property (RIP) with proper preconditioning and can be used for sparse recovery on the rotation group. The mutual coherence, however, is used to assess the performance… 
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.
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
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
Modified Gram Schmidt Based Chaotic Matrix for Compressive Sensing in Cognitive Radio
A sensing matrix using Modified Gram Schmidt (MGS) algorithm based on chaotic matrix created from logistic map is proposed that has low reconstruction error, high compression ratio, and high immunity to attackers from outside the network.
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.
A new chaotic matrix based on Chebyshev map and modified gram Schmidt (MGS) is proposed and applied for sensing real TV signal as a PU and it has low Re and high Pd under low SNR values and has low MSE with high compression.
Optimizing Sensing Matrices for Spherical Near-Field Antenna Measurements
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.
Restricted Domain Compressive Sensing for Antenna Metrology
In this paper, we prove a compressive sensing guarantee for restricted measurement domains in spherical nearfield to far-field transformations for antenna metrology. We do so by first defining
Compressive sensing based on novel chaotic matrix for cognitive radio
A new 1‐D chaotic map is proposed for constructing a novel SM that has simple structure, wide range chaotic behavior, and high security, and the results show that it has low Abserr, MSE, and mutual coherence at low SNR with high compression.


Sparse signal recovery on the sphere: Optimizing the sensing matrix through sampling
This work proposes a method for constructing a spherical harmonic sensing matrix that can be used to effectively recover a sparse signal on the sphere from limited measurements and shows that the success rate in near exact recovery of a sparse coefficient vector with the spiral scheme is superior to that of the regular scheme over a range of SNRs.
Coherence Bounds for Sensing Matrices in Spherical Harmonics Expansion
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.
On the Minimum Number of Samples for Sparse Recovery in Spherical Antenna Near-Field Measurements
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.
Compressed Sensing Matrices From Fourier Matrices
Using Katz' character sum estimation, a deterministic procedure to select rows from a Fourier matrix to form a good CS matrix for sparse recovery is designed, which yields an approximately mutually unbiased bases from Fourier matrices which is of particular interest to quantum information theory.
Sparse recovery on sphere via probabilistic compressed sensing
This paper incorporates a preconditioning technique into the probabilistic approach to derive a slightly improved bound on the order of measurements for accurate recovery of spherical harmonic expansions.
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.
On sparse reconstruction from Fourier and Gaussian measurements
This paper improves upon best‐known guarantees for exact reconstruction of a sparse signal f from a small universal sample of Fourier measurements by showing that there exists a set of frequencies Ω such that one can exactly reconstruct every r‐sparse signal f of length n from its frequencies in Ω, using the convex relaxation.
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.
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.
Message-passing algorithms for compressed sensing
A simple costless modification to iterative thresholding is introduced making the sparsity–undersampling tradeoff of the new algorithms equivalent to that of the corresponding convex optimization procedures, inspired by belief propagation in graphical models.