{"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/switchable-temporal-propagation-network","title":"Switchable Temporal Propagation Network","arxiv_id":"1804.08758","date":"2018-04-23","proceeding":"ECCV 2018 9","authors":["Sifei Liu","Guangyu Zhong","Shalini De Mello","Jinwei Gu","Varun Jampani","Ming-Hsuan Yang","Jan Kautz"],"abstract":"Videos contain highly redundant information between frames. Such redundancy\nhas been extensively studied in video compression and encoding, but is less\nexplored for more advanced video processing. In this paper, we propose a\nlearnable unified framework for propagating a variety of visual properties of\nvideo images, including but not limited to color, high dynamic range (HDR), and\nsegmentation information, where the properties are available for only a few\nkey-frames. Our approach is based on a temporal propagation network (TPN),\nwhich models the transition-related affinity between a pair of frames in a\npurely data-driven manner. We theoretically prove two essential factors for\nTPN: (a) by regularizing the global transformation matrix as orthogonal, the\n\"style energy\" of the property can be well preserved during propagation; (b)\nsuch regularization can be achieved by the proposed switchable TPN with\nbi-directional training on pairs of frames. We apply the switchable TPN to\nthree tasks: colorizing a gray-scale video based on a few color key-frames,\ngenerating an HDR video from a low dynamic range (LDR) video and a few HDR\nframes, and propagating a segmentation mask from the first frame in videos.\nExperimental results show that our approach is significantly more accurate and\nefficient than the state-of-the-art methods.","url_abs":"http://arxiv.org/abs/1804.08758v2","url_pdf":"http://arxiv.org/pdf/1804.08758v2.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":"switchable-temporal-propagation-network","repo_url":"https://github.com/Liusifei/UVC","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"video-compression","task_name":"Video Compression"}],"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":"Liusifei/UVC","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1909.11895"],"harvested_for_calls":[{"arxiv_id":"1909.11895","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1909.11895"},"call":"get_harvested_code_for_paper(arxiv_id=\"1909.11895\")"}]}],"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":"5563b3de16fa488fb9c7c4a5049f3bd2668221206885514b4097a459ea01a9a8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}