{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/image-restoration-by-iterative-denoising-and","title":"Image Restoration by Iterative Denoising and Backward Projections","arxiv_id":"1710.06647","date":"2017-10-18","proceeding":null,"authors":["Tom Tirer","Raja Giryes"],"abstract":"Inverse problems appear in many applications, such as image deblurring and\ninpainting. The common approach to address them is to design a specific\nalgorithm for each problem. The Plug-and-Play (P&P) framework, which has been\nrecently introduced, allows solving general inverse problems by leveraging the\nimpressive capabilities of existing denoising algorithms. While this fresh\nstrategy has found many applications, a burdensome parameter tuning is often\nrequired in order to obtain high-quality results. In this work, we propose an\nalternative method for solving inverse problems using off-the-shelf denoisers,\nwhich requires less parameter tuning. First, we transform a typical cost\nfunction, composed of fidelity and prior terms, into a closely related, novel\noptimization problem. Then, we propose an efficient minimization scheme with a\nplug-and-play property, i.e., the prior term is handled solely by a denoising\noperation. Finally, we present an automatic tuning mechanism to set the\nmethod's parameters. We provide a theoretical analysis of the method, and\nempirically demonstrate its competitiveness with task-specific techniques and\nthe P&P approach for image inpainting and deblurring.","url_abs":"http://arxiv.org/abs/1710.06647v4","url_pdf":"http://arxiv.org/pdf/1710.06647v4.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"image-restoration-by-iterative-denoising-and","repo_url":"https://github.com/tomtirer/IDBP","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"image-restoration-by-iterative-denoising-and","repo_url":"https://github.com/tirer-lab/ddpg","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"deblurring","task_name":"Deblurring"},{"task_slug":"denoising","task_name":"Denoising"},{"task_slug":"image-deblurring","task_name":"Image Deblurring"},{"task_slug":"image-inpainting","task_name":"Image Inpainting"},{"task_slug":"image-restoration","task_name":"Image Restoration"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"tomtirer/IDBP","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"tirer-lab/ddpg","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2312.16519"],"harvested_for_calls":[{"arxiv_id":"2312.16519","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2312.16519"},"call":"get_harvested_code_for_paper(arxiv_id=\"2312.16519\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"ab7ca21c91433bbcb39718576b06732f71f07d49c3d546f389a3d04474087418","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}