eprintid: 1608
rev_number: 5
eprint_status: archive
userid: 6
dir: disk0/00/00/16/08
datestamp: 2013-06-10 08:02:44
lastmod: 2013-06-10 08:02:44
status_changed: 2013-06-10 08:02:44
type: article
metadata_visibility: show
creators_name: Rusu, Cristian
creators_id: cristian.rusu@imtlucca.it
title: Design of Incoherent Frames via Convex Optimization
ispublished: pub
subjects: QA76
divisions: CSA
full_text_status: none
keywords: Grassmannian frames; Sparse representations
abstract: 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.
date: 2013-07
date_type: published
publication: IEEE Signal Processing Letters
volume: 20
number: 7
publisher: IEEE
pagerange: 673-676
id_number: 10.1109/LSP.2013.2263280
refereed: TRUE
issn: 1070-9908
official_url: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6516525&isnumber=6515149
citation:   Rusu, Cristian  Design of Incoherent Frames via Convex Optimization.  IEEE Signal Processing Letters, 20 (7).  pp. 673-676.  ISSN 1070-9908      (2013)