{"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/on-learning-optimized-reaction-diffusion","title":"On learning optimized reaction diffusion processes for effective image restoration","arxiv_id":"1503.05768","date":"2015-03-19","proceeding":"CVPR 2015 6","authors":["Yunjin Chen","Wei Yu","Thomas Pock"],"abstract":"For several decades, image restoration remains an active research topic in\nlow-level computer vision and hence new approaches are constantly emerging.\nHowever, many recently proposed algorithms achieve state-of-the-art performance\nonly at the expense of very high computation time, which clearly limits their\npractical relevance. In this work, we propose a simple but effective approach\nwith both high computational efficiency and high restoration quality. We extend\nconventional nonlinear reaction diffusion models by several parametrized linear\nfilters as well as several parametrized influence functions. We propose to\ntrain the parameters of the filters and the influence functions through a loss\nbased approach. Experiments show that our trained nonlinear reaction diffusion\nmodels largely benefit from the training of the parameters and finally lead to\nthe best reported performance on common test datasets for image restoration.\nDue to their structural simplicity, our trained models are highly efficient and\nare also well-suited for parallel computation on GPUs.","url_abs":"http://arxiv.org/abs/1503.05768v2","url_pdf":"http://arxiv.org/pdf/1503.05768v2.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":"on-learning-optimized-reaction-diffusion","repo_url":"https://github.com/VLOGroup/mri-variationalnetwork","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"on-learning-optimized-reaction-diffusion","repo_url":"https://github.com/VLOGroup/tensorflow-icg","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"on-learning-optimized-reaction-diffusion","repo_url":"https://github.com/jplumail/learning-image-restoration","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"computational-efficiency","task_name":"Computational Efficiency"},{"task_slug":"image-restoration","task_name":"Image Restoration"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1503.05768","atlas_url":"https://app.syntology.ai/?focus=1503.05768","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1503.05768"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1503.05768\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1503.05768"},"call":"get_concepts_for_paper(arxiv_id=\"1503.05768\")"}],"by_repo":[{"repo":"VLOGroup/mri-variationalnetwork","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1702.02505"],"harvested_for_calls":[{"arxiv_id":"1702.02505","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1702.02505"},"call":"get_harvested_code_for_paper(arxiv_id=\"1702.02505\")"}]},{"repo":"VLOGroup/tensorflow-icg","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1702.02505"],"harvested_for_calls":[{"arxiv_id":"1702.02505","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1702.02505"},"call":"get_harvested_code_for_paper(arxiv_id=\"1702.02505\")"}]},{"repo":"jplumail/learning-image-restoration","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"7b52246ba9e203753f2f88e007f90d0851e602d242f3bf4ee20fa7018149f159","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}