{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/disentangling-propagation-and-generation-for","title":"Disentangling Propagation and Generation for Video Prediction","arxiv_id":"1812.00452","date":"2018-12-02","proceeding":"ICCV 2019 10","authors":["Hang Gao","Huazhe Xu","Qi-Zhi Cai","Ruth Wang","Fisher Yu","Trevor Darrell"],"abstract":"A dynamic scene has two types of elements: those that move fluidly and can be predicted from previous frames, and those which are disoccluded (exposed) and cannot be extrapolated. Prior approaches to video prediction typically learn either to warp or to hallucinate future pixels, but not both. In this paper, we describe a computational model for high-fidelity video prediction which disentangles motion-specific propagation from motion-agnostic generation. We introduce a confidence-aware warping operator which gates the output of pixel predictions from a flow predictor for non-occluded regions and from a context encoder for occluded regions. Moreover, in contrast to prior works where confidence is jointly learned with flow and appearance using a single network, we compute confidence after a warping step, and employ a separate network to inpaint exposed regions. Empirical results on both synthetic and real datasets show that our disentangling approach provides better occlusion maps and produces both sharper and more realistic predictions compared to strong baselines.","url_abs":"https://arxiv.org/abs/1812.00452v2","url_pdf":"https://arxiv.org/pdf/1812.00452v2.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":"disentangling-propagation-and-generation-for","repo_url":"https://github.com/NagabhushanSN95/DPG-Video-Prediction","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"predict-future-video-frames","task_name":"Predict Future Video Frames"},{"task_slug":"prediction","task_name":"Prediction"},{"task_slug":"video-prediction","task_name":"Video Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":"https://app.syntology.ai/?focus=1812.00452","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.00452"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/NagabhushanSN95/DPG-Video-Prediction","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":2},"by_repo_kind":{"listed":{"samples":2,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"13f0fa2935647605","entry":"get_all_pred_frame_nums","repo":"NagabhushanSN95/DPG-Video-Prediction","repo_kind":"listed","path":"src/OursBlenderTester03.py","file_url":"https://github.com/NagabhushanSN95/DPG-Video-Prediction/blob/HEAD/src/OursBlenderTester03.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"13f0fa2935647605"}},{"code_sha256_prefix":"58fc604171d0699b","entry":"get_data_loader","repo":"NagabhushanSN95/DPG-Video-Prediction","repo_kind":"listed","path":"src/data_loaders/DataLoaderFactory.py","file_url":"https://github.com/NagabhushanSN95/DPG-Video-Prediction/blob/HEAD/src/data_loaders/DataLoaderFactory.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"58fc604171d0699b"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}