{"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/patch-ordering-as-a-regularization-for","title":"Patch-Ordering as a Regularization for Inverse Problems in Image Processing","arxiv_id":"1602.08510","date":"2016-02-26","proceeding":null,"authors":["Gregory Vaksman","Michael Zibulevsky","Michael Elad"],"abstract":"Recent work in image processing suggests that operating on (overlapping)\npatches in an image may lead to state-of-the-art results. This has been\ndemonstrated for a variety of problems including denoising, inpainting,\ndeblurring, and super-resolution. The work reported in [1,2] takes an extra\nstep forward by showing that ordering these patches to form an approximate\nshortest path can be leveraged for better processing. The core idea is to apply\na simple filter on the resulting 1D smoothed signal obtained after the\npatch-permutation. This idea has been also explored in combination with a\nwavelet pyramid, leading eventually to a sophisticated and highly effective\nregularizer for inverse problems in imaging. In this work we further study the\npatch-permutation concept, and harness it to propose a new simple yet effective\nregularization for image restoration problems. Our approach builds on the\nclassic Maximum A'posteriori probability (MAP), with a penalty function\nconsisting of a regular log-likelihood term and a novel permutation-based\nregularization term. Using a plain 1D Laplacian, the proposed regularization\nforces robust smoothness (L1) on the permuted pixels. Since the permutation\noriginates from patch-ordering, we propose to accumulate the smoothness terms\nover all the patches' pixels. Furthermore, we take into account the found\ndistances between adjacent patches in the ordering, by weighting the Laplacian\noutcome. We demonstrate the proposed scheme on a diverse set of problems: (i)\nsevere Poisson image denoising, (ii) Gaussian image denoising, (iii) image\ndeblurring, and (iv) single image super-resolution. In all these cases, we use\nrecent methods that handle these problems as initialization to our scheme. This\nis followed by an L-BFGS optimization of the above-described penalty function,\nleading to state-of-the-art results, and especially so for highly ill-posed\ncases.","url_abs":"http://arxiv.org/abs/1602.08510v1","url_pdf":"http://arxiv.org/pdf/1602.08510v1.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":"patch-ordering-as-a-regularization-for","repo_url":"https://github.com/grishavak/Patch_Ordering_as_a_Regularization_for_Inverse_Problems_in_Image_Processing","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"deblurring","task_name":"Deblurring"},{"task_slug":"denoising","task_name":"Denoising"},{"task_slug":"image-deblurring","task_name":"Image Deblurring"},{"task_slug":"image-denoising","task_name":"Image Denoising"},{"task_slug":"image-restoration","task_name":"Image Restoration"},{"task_slug":"image-super-resolution","task_name":"Image Super-Resolution"},{"task_slug":"super-resolution","task_name":"Super-Resolution"}],"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":"grishavak/Patch_Ordering_as_a_Regularization_for_Inverse_Problems_in_Image_Processing","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"fa9d28ab050a5b917ab15e02ca0d9e08f7c4e9f8cc2ea1e6b96af85672219929","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}