Iterative Hard Thresholding with Near Optimal Projection for Signal Recovery. Giryes, R. & Elad, M. In 2013. ![Iterative Hard Thresholding with Near Optimal Projection for Signal Recovery [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper abstract bibtex Recovering signals that have sparse representations under a given dictionary from a set of linear measurements got much attention in the recent decade. However, most of the work has focused on recovering the signal’s representation, forcing the dictionary to be incoherent and with no linear dependencies between small sets of its columns. A series of recent papers show that such dependencies can be allowed by aiming at recovering the signal itself. However, most of these contributions focus on the analysis framework. One exception to these is the work reported in [1], proposing a variant of the CoSaMP for the synthesis model, and showing that signal recovery is possible even in high-coherence cases. In the theoretical study of this technique the existence of an efficient near optimal projection scheme is assumed. In this paper we extend the above work, showing that under very similar assumptions, a variant of IHT can recover the signal in cases where regular IHT fails.
@inproceedings{giryes_iterative_2013,
title = {Iterative {Hard} {Thresholding} with {Near} {Optimal} {Projection} for {Signal} {Recovery}},
url = {https://www.semanticscholar.org/paper/Iterative-Hard-Thresholding-with-Near-Optimal-for-Giryes-Elad/642b3cca3f0f08c56cd1a583350c58c4f8f9f5ec},
abstract = {Recovering signals that have sparse representations under a given dictionary from a set of linear measurements got much attention in the recent decade. However, most of the work has focused on recovering the signal’s representation, forcing the dictionary to be incoherent and with no linear dependencies between small sets of its columns. A series of recent papers show that such dependencies can be allowed by aiming at recovering the signal itself. However, most of these contributions focus on the analysis framework. One exception to these is the work reported in [1], proposing a variant of the CoSaMP for the synthesis model, and showing that signal recovery is possible even in high-coherence cases. In the theoretical study of this technique the existence of an efficient near optimal projection scheme is assumed. In this paper we extend the above work, showing that under very similar assumptions, a variant of IHT can recover the signal in cases where regular IHT fails.},
language = {en},
urldate = {2023-08-07},
author = {Giryes, R. and Elad, Michael},
year = {2013},
keywords = {\#Analysis, \#Optimization, \#Representation{\textgreater}Inpainting, /unread},
}
Downloads: 0
{"_id":"iETHzfvQjKKkmCwKS","bibbaseid":"giryes-elad-iterativehardthresholdingwithnearoptimalprojectionforsignalrecovery-2013","author_short":["Giryes, R.","Elad, M."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","title":"Iterative Hard Thresholding with Near Optimal Projection for Signal Recovery","url":"https://www.semanticscholar.org/paper/Iterative-Hard-Thresholding-with-Near-Optimal-for-Giryes-Elad/642b3cca3f0f08c56cd1a583350c58c4f8f9f5ec","abstract":"Recovering signals that have sparse representations under a given dictionary from a set of linear measurements got much attention in the recent decade. However, most of the work has focused on recovering the signal’s representation, forcing the dictionary to be incoherent and with no linear dependencies between small sets of its columns. A series of recent papers show that such dependencies can be allowed by aiming at recovering the signal itself. However, most of these contributions focus on the analysis framework. One exception to these is the work reported in [1], proposing a variant of the CoSaMP for the synthesis model, and showing that signal recovery is possible even in high-coherence cases. In the theoretical study of this technique the existence of an efficient near optimal projection scheme is assumed. In this paper we extend the above work, showing that under very similar assumptions, a variant of IHT can recover the signal in cases where regular IHT fails.","language":"en","urldate":"2023-08-07","author":[{"propositions":[],"lastnames":["Giryes"],"firstnames":["R."],"suffixes":[]},{"propositions":[],"lastnames":["Elad"],"firstnames":["Michael"],"suffixes":[]}],"year":"2013","keywords":"#Analysis, #Optimization, #Representation\\textgreaterInpainting, /unread","bibtex":"@inproceedings{giryes_iterative_2013,\n\ttitle = {Iterative {Hard} {Thresholding} with {Near} {Optimal} {Projection} for {Signal} {Recovery}},\n\turl = {https://www.semanticscholar.org/paper/Iterative-Hard-Thresholding-with-Near-Optimal-for-Giryes-Elad/642b3cca3f0f08c56cd1a583350c58c4f8f9f5ec},\n\tabstract = {Recovering signals that have sparse representations under a given dictionary from a set of linear measurements got much attention in the recent decade. However, most of the work has focused on recovering the signal’s representation, forcing the dictionary to be incoherent and with no linear dependencies between small sets of its columns. A series of recent papers show that such dependencies can be allowed by aiming at recovering the signal itself. However, most of these contributions focus on the analysis framework. One exception to these is the work reported in [1], proposing a variant of the CoSaMP for the synthesis model, and showing that signal recovery is possible even in high-coherence cases. In the theoretical study of this technique the existence of an efficient near optimal projection scheme is assumed. In this paper we extend the above work, showing that under very similar assumptions, a variant of IHT can recover the signal in cases where regular IHT fails.},\n\tlanguage = {en},\n\turldate = {2023-08-07},\n\tauthor = {Giryes, R. and Elad, Michael},\n\tyear = {2013},\n\tkeywords = {\\#Analysis, \\#Optimization, \\#Representation{\\textgreater}Inpainting, /unread},\n}\n\n\n\n","author_short":["Giryes, R.","Elad, M."],"key":"giryes_iterative_2013","id":"giryes_iterative_2013","bibbaseid":"giryes-elad-iterativehardthresholdingwithnearoptimalprojectionforsignalrecovery-2013","role":"author","urls":{"Paper":"https://www.semanticscholar.org/paper/Iterative-Hard-Thresholding-with-Near-Optimal-for-Giryes-Elad/642b3cca3f0f08c56cd1a583350c58c4f8f9f5ec"},"keyword":["#Analysis","#Optimization","#Representation\\textgreaterInpainting","/unread"],"metadata":{"authorlinks":{}},"downloads":0,"html":""},"bibtype":"inproceedings","biburl":"https://bibbase.org/zotero/zzhenry2012","dataSources":["nZHrFJKyxKKDaWYM8"],"keywords":["#analysis","#optimization","#representation\\textgreaterinpainting","/unread"],"search_terms":["iterative","hard","thresholding","near","optimal","projection","signal","recovery","giryes","elad"],"title":"Iterative Hard Thresholding with Near Optimal Projection for Signal Recovery","year":2013}