By Topic

On the use of a priori information for sparse signal approximations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
O. Divorra Escoda ; Ecole Polytech. Fed. de Lausanne, Switzerland ; L. Granai ; P. Vandergheynst

Recent results have underlined the importance of incoherence in redundant dictionaries for a good behavior of decomposition algorithms like matching and basis pursuit. However, appropriate dictionaries for a given application may not be able to meet the incoherence condition. In such a case, decomposition algorithms may completely fail in the retrieval of the sparsest approximation. This paper studies the effect of introducing a priori knowledge when recovering sparse approximations over redundant dictionaries. Theoretical results show how the use of reliable a priori information (which in this paper appears under the form of weights) can improve the performances of standard approaches such as greedy algorithms and relaxation methods. Our results reduce to the classical case when no prior information is available. Examples validate and illustrate our theoretical statements. EDICS: 2-NLSP

Published in:

IEEE Transactions on Signal Processing  (Volume:54 ,  Issue: 9 )