Algorithms for the Construction of Incoherent Frames Under Various Design Constraints

01/30/2018
by   Cristian Rusu, et al.
0

Unit norm finite frames are extensions of orthonormal bases with many applications in signal processing. An important property of a frame is its coherence, a measure of how close any two vectors of the frame are to each other. Low coherence frames are useful in compressed sensing applications. When used as the measurement matrices, they successfully recover highly sparse solutions to linear inverse problems. This paper describes algorithms for the design of various low coherence frame types: real, complex, unital (constant magnitude) complex, sparse real and complex, nonnegative real and complex, and harmonic (selection of rows from Fourier matrices). The proposed methods are based on solving a sequence of convex optimization problems that update each vector of the frame. This update reduces the coherence with the other frame vectors, while other constraints on its entries are also imposed. Numerical experiments show the effectiveness of the methods compared to the Welch bound, as well as other competing algorithms, in compressed sensing applications.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/14/2018

Low coherence unit norm tight frames

Equiangular tight frames (ETFs) have found significant applications in s...
research
07/19/2022

A coherence parameter characterizing generative compressed sensing with Fourier measurements

In Bora et al. (2017), a mathematical framework was developed for compre...
research
03/20/2021

Spark Deficient Gabor Frame Provides a Novel Analysis Operator for Compressed Sensing

The analysis sparsity model is a very effective approach in modern Compr...
research
10/13/2021

Spark Deficient Gabor Frames for Inverse Problems

In this paper, we apply star-Digital Gabor Transform in analysis Compres...
research
01/14/2018

Compressed Neighbour Discovery using Sparse Kerdock Matrices

We study the network-wide neighbour discovery problem in wireless networ...
research
01/14/2018

Frame Moments and Welch Bound with Erasures

The Welch Bound is a lower bound on the root mean square cross correlati...
research
09/19/2018

Analog Coding Frame-work

Analog coding is a low-complexity method to combat erasures, based on li...

Please sign up or login with your details

Forgot password? Click here to reset