Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). We apologize for the inconvenience.
By Topic

Performance Guarantees of the Thresholding Algorithm for the Cosparse Analysis Model

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
$31 $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

2 Author(s)
Peleg, T. ; Dept. of Electr. Eng., Technion - Israel Inst. of Technol., Haifa, Israel ; Elad, M.

The cosparse analysis model for signals assumes that the signal of interest can be multiplied by an analysis dictionary , leading to a sparse outcome. This model stands as an interesting alternative to the more classical synthesis-based sparse representation model. In this paper, we propose a theoretical study of the performance guarantee of the thresholding algorithm for the pursuit problem in the presence of noise. Our analysis reveals two significant properties of Ω, which govern the pursuit performance: the first is the degree of linear dependencies between sets of rows in Ω, depicted by the cosparsity level. The second property, termed the restricted orthogonal projection property, is the level of independence between such dependent sets and other rows in Ω. We show how these dictionary properties are meaningful and useful, both in the theoretical bounds derived and in a series of experiments that are shown to align well with the theoretical prediction.

Published in:

Information Theory, IEEE Transactions on  (Volume:59 ,  Issue: 3 )