Papers › Depth-Aware Video Frame Interpolation

Depth-Aware Video Frame Interpolation

1 Apr 2019CVPR 2019 6arXiv:1904.00830archive 2025-07-28

Wenbo Bao, Wei-Sheng Lai, Chao Ma, Xiaoyun Zhang, Zhiyong Gao, Ming-Hsuan Yang

Video frame interpolation aims to synthesize nonexistent frames in-between the original frames. While significant advances have been made from the recent deep convolutional neural networks, the quality of interpolation is often reduced due to large object motion or occlusion. In this work, we propose a video frame interpolation method which explicitly detects the occlusion by exploring the depth information. Specifically, we develop a depth-aware flow projection layer to synthesize intermediate flows that preferably sample closer objects than farther ones. In addition, we learn hierarchical features to gather contextual information from neighboring pixels. The proposed model then warps the input frames, depth maps, and contextual features based on the optical flow and local interpolation kernels for synthesizing the output frame. Our model is compact, efficient, and fully differentiable. Quantitative and qualitative results demonstrate that the proposed model performs favorably against state-of-the-art frame interpolation methods on a wide variety of datasets.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1904.00830")

Code

Syntology Ran 3 of 15 code samples harvested from 2 repositories linked to this paper; 12 have no recorded run. Of those that ran: 3 ran · our draft was wrong.

By repository: official repository: 8 samples from 1 repository, 3 ran; community (archive-listed): 7 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

baowenbo/DAIN officialmentioned in papermentioned on GitHubpytorchMIT report
jcao216/DAIN_Modified mentioned on GitHubpytorchMIT report
nihui/dain-ncnn-vulkan mentioned on GitHubMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

15 samples harvested; 3 ran; 0 honoured the contract we drafted; 12 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

3ran · our draft was wrong
12unverified

Licence: 0 of the 15 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: 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. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

conv baowenbo/DAIN/PWCNet/PWCNet.py official repository ran · our draft was wrong MIT (permissive) · 2d0cae2c772e2af4 · report
deconv baowenbo/DAIN/PWCNet/PWCNet.py official repository ran · our draft was wrong MIT (permissive) · dc4fb7628379691e · report
predict_flow baowenbo/DAIN/PWCNet/PWCNet.py official repository ran · our draft was wrong MIT (permissive) · c3f23a008d953af5 · report
HourGlass baowenbo/DAIN/MegaDepth/MegaDepth_model.py official repository unverified MIT (permissive) · 47c6e6923b56791c · report
charbonier_loss baowenbo/DAIN/loss_function.py official repository unverified MIT (permissive) · d053ab43d6014513 · report
conv3x3 baowenbo/DAIN/S2D_models/S2DF.py official repository unverified MIT (permissive) · b2f0d358d3c74e41 · report
negPSNR_loss baowenbo/DAIN/loss_function.py official repository unverified MIT (permissive) · 431365efdc2a851d · report
tv_loss baowenbo/DAIN/loss_function.py official repository unverified MIT (permissive) · d93b052c92e848d4 · report
CalculatePad BurguerJohn/Dain-App/my_DAIN_class.py community (archive-listed) unverified MIT (permissive) · 92484377cde11dff · report
EasyIn BurguerJohn/Dain-App/MotionBlur.py community (archive-listed) unverified MIT (permissive) · 0ee54575fa5db780 · report
EasyOut BurguerJohn/Dain-App/MotionBlur.py community (archive-listed) unverified MIT (permissive) · 52a706d3224aeed4 · report
NumpyResultAsList BurguerJohn/Dain-App/my_DAIN_class.py community (archive-listed) unverified MIT (permissive) · 29df27c27daad03e · report
conv BurguerJohn/Dain-App/PWCNet/PWCNet.py community (archive-listed) unverified MIT (permissive) · 6a0f5326d2269254 · report
get_line BurguerJohn/Dain-App/MotionBlur.py community (archive-listed) unverified MIT (permissive) · 3831870debe48ce2 · report
lerp BurguerJohn/Dain-App/my_DAIN_class.py community (archive-listed) unverified MIT (permissive) · ec5d5402f5021210 · report

Tasks

Optical Flow EstimationVideo Frame Interpolation

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Video Frame Interpolation Middlebury DAIN Interpolation Error 4.86 #5 of 11 Archive leaderboard report
Video Frame Interpolation UCF101 DAIN PSNR 34.99 #16 of 19 Archive leaderboard report
Video Frame Interpolation UCF101 DAIN SSIM 0.9683 #16 of 19 Archive leaderboard report
Video Frame Interpolation Vimeo90K DAIN PSNR 34.71 #18 of 23 Archive leaderboard report
Video Frame Interpolation Vimeo90K DAIN SSIM 0.9756 #18 of 23 Archive leaderboard report
Video Frame Interpolation Vimeo90K DAIN PSNR 34.71 #19 of 23 Archive leaderboard report
Video Frame Interpolation X4K1000FPS DAIN_f PSNR 27.52 #15 of 20 Archive leaderboard report
Video Frame Interpolation X4K1000FPS DAIN_f SSIM 0.821 #15 of 20 Archive leaderboard report
Video Frame Interpolation X4K1000FPS DAIN_f tOF 3.47 #15 of 20 Archive leaderboard report
Video Frame Interpolation X4K1000FPS DAIN PSNR 26.78 #16 of 20 Archive leaderboard report
Video Frame Interpolation X4K1000FPS DAIN SSIM 0.807 #16 of 20 Archive leaderboard report
Video Frame Interpolation X4K1000FPS DAIN tOF 3.83 #16 of 20 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections