Deriving RIP sensing matrices for sparsifying dictionaries

07/12/2022
by   Jinn Ho, et al.
0

Compressive sensing involves the inversion of a mapping SD ∈ℝ^m × n, where m < n, S is a sensing matrix, and D is a sparisfying dictionary. The restricted isometry property is a powerful sufficient condition for the inversion that guarantees the recovery of high-dimensional sparse vectors from their low-dimensional embedding into a Euclidean space via convex optimization. However, determining whether SD has the restricted isometry property for a given sparisfying dictionary is an NP-hard problem, hampering the application of compressive sensing. This paper provides a novel approach to resolving this problem. We demonstrate that it is possible to derive a sensing matrix for any sparsifying dictionary with a high probability of retaining the restricted isometry property. In numerical experiments with sensing matrices for K-SVD, Parseval K-SVD, and wavelets, our recovery performance was comparable to that of benchmarks obtained using Gaussian and Bernoulli random sensing matrices for sparse vectors.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset