TY  - JOUR
Y1  - 2013/07//
SN  - 1070-9908
JF  - IEEE Signal Processing Letters
N2  - This paper describes a new procedure for the design of incoherent frames used in the field of sparse representations. We present an efficient algorithm for the design of incoherent frames that works well even when applied to the construction of relatively large frames. The main advantage of the proposed method is that it uses a convex optimization formulation that operates directly on the frame, and not on its Gram matrix. Solving a sequence of convex optimization problems allows for the introduction of constraints on the frame that were previously considered impossible or very hard to include, such as non-negativity. Numerous experimental results validate the approach.
A1  - Rusu, Cristian
SP  - 673
VL  - 20
EP  - 676
PB  - IEEE
KW  - Grassmannian frames; Sparse representations
IS  - 7
UR  - http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6516525&isnumber=6515149
TI  - Design of Incoherent Frames via Convex Optimization
ID  - eprints1608
AV  - none
ER  -