{"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/vidosat-high-dimensional-sparsifying","title":"VIDOSAT: High-dimensional Sparsifying Transform Learning for Online Video Denoising","arxiv_id":"1710.00947","date":"2017-10-03","proceeding":null,"authors":["Bihan Wen","Saiprasad Ravishankar","Yoram Bresler"],"abstract":"Techniques exploiting the sparsity of images in a transform domain have been\neffective for various applications in image and video processing. Transform\nlearning methods involve cheap computations and have been demonstrated to\nperform well in applications such as image denoising and medical image\nreconstruction. Recently, we proposed methods for online learning of\nsparsifying transforms from streaming signals, which enjoy good convergence\nguarantees, and involve lower computational costs than online synthesis\ndictionary learning. In this work, we apply online transform learning to video\ndenoising. We present a novel framework for online video denoising based on\nhigh-dimensional sparsifying transform learning for spatio-temporal patches.\nThe patches are constructed either from corresponding 2D patches in successive\nframes or using an online block matching technique. The proposed online video\ndenoising requires little memory, and offers efficient processing. Numerical\nexperiments compare the performance to the proposed video denoising scheme but\nfixing the transform to be 3D DCT, as well as prior schemes such as dictionary\nlearning-based schemes, and the state-of-the-art VBM3D and VBM4D on several\nvideo data sets, demonstrating the promising performance of the proposed\nmethods.","url_abs":"http://arxiv.org/abs/1710.00947v1","url_pdf":"http://arxiv.org/pdf/1710.00947v1.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":"vidosat-high-dimensional-sparsifying","repo_url":"https://github.com/wenbihan/vidosat_icip2015","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"denoising","task_name":"Denoising"},{"task_slug":"dictionary-learning","task_name":"Dictionary Learning"},{"task_slug":"image-denoising","task_name":"Image Denoising"},{"task_slug":"image-reconstruction","task_name":"Image Reconstruction"},{"task_slug":"video-denoising","task_name":"Video Denoising"},{"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":"wenbihan/vidosat_icip2015","kind":"listed","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":"ccb3d83ab6914c0a127a7fcae707dd8ad4dc5bcfc7a224ef6201f4edafff1793","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}