DCACO: an algorithm for designing incoherent redundant matrices

Cites Work

Properties of real and complex ETFs and their application to the design of low coherence frames
A mathematical introduction to compressive sensing
Two are better than one: fundamental parameters of frame coherence
Finite frames. Theory and applications.
Steiner equiangular tight frames
On the construction of equiangular frames from graphs
Equiangular tight frames from Paley tournaments
On the existence of equiangular tight frames
Grassmannian frames with applications to coding and communication
An introduction to finite tight frames
DC programming and DCA: thirty years of developments
A first-order primal-dual algorithm for convex problems with applications to imaging
On the search for tight frames of low coherence
Equiangular Tight Frames From Hyperovals
Construction of Incoherent Unit Norm Tight Frames With Application to Compressed Sensing
Graph Implementations for Nonsmooth Convex Programs
Greed is Good: Algorithmic Results for Sparse Approximation
Designing structured tight frames via an alternating projection method
Achieving the Welch Bound With Difference Sets
Sparse and Redundant Representations
Lower bounds on the maximum cross correlation of signals (Corresp.)
An inequality for the trace of the product of two symmetric matrices
Optimized Projections for Compressed Sensing
Coherence Optimization and Best Complex Antipodal Spherical Codes
Designing Incoherent Frames Through Convex Techniques for Optimized Compressed Sensing
Kirkman Equiangular Tight Frames and Codes
Convex analysis and monotone operator theory in Hilbert spaces
Quantized frame expansions with erasures

This page was built for publication: DCACO: an algorithm for designing incoherent redundant matrices