%0 Journal Article
%@ 1070-9908
%A Rusu, Cristian
%D 2013
%F eprints:1608
%I IEEE
%J IEEE Signal Processing Letters
%K Grassmannian frames; Sparse representations
%N 7
%P 673-676
%T Design of Incoherent Frames via Convex Optimization
%U http://eprints.imtlucca.it/1608/
%V 20
%X 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.