{"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/fast-high-dimensional-bilateral-and-nonlocal","title":"Fast High-Dimensional Bilateral and Nonlocal Means Filtering","arxiv_id":"1811.02363","date":"2018-11-06","proceeding":null,"authors":["Pravin Nair","Kunal. N. Chaudhury"],"abstract":"Existing fast algorithms for bilateral and nonlocal means filtering mostly\nwork with grayscale images. They cannot easily be extended to high-dimensional\ndata such as color and hyperspectral images, patch-based data, flow-fields,\netc. In this paper, we propose a fast algorithm for high-dimensional bilateral\nand nonlocal means filtering. Unlike existing approaches, where the focus is on\napproximating the data (using quantization) or the filter kernel (via analytic\nexpansions), we locally approximate the kernel using weighted and shifted\ncopies of a Gaussian, where the weights and shifts are inferred from the data.\nThe algorithm emerging from the proposed approximation essentially involves\nclustering and fast convolutions, and is easy to implement. Moreover, a variant\nof our algorithm comes with a guarantee (bound) on the approximation error,\nwhich is not enjoyed by existing algorithms. We present some results for\nhigh-dimensional bilateral and nonlocal means filtering to demonstrate the\nspeed and accuracy of our proposal. Moreover, we also show that our algorithm\ncan outperform state-of-the-art fast approximations in terms of accuracy and\ntiming.","url_abs":"http://arxiv.org/abs/1811.02363v1","url_pdf":"http://arxiv.org/pdf/1811.02363v1.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":"fast-high-dimensional-bilateral-and-nonlocal","repo_url":"https://github.com/pravin1390/FastHDFilter","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"quantization","task_name":"Quantization"},{"task_slug":"high","task_name":"Vocal Bursts Intensity Prediction"}],"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":"pravin1390/FastHDFilter","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":"e47698a2c6881b148d3773fc1943e52e76d49d56f7c9d83a952f94152ce3412b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}