Pith. sign in

REVIEW 4 cited by

MCVD: Masked Conditional Video Diffusion for Prediction, Generation, and Interpolation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2205.09853 v4 pith:CBQIJZKS submitted 2022-05-19 cs.CV cs.AIcs.LG

MCVD: Masked Conditional Video Diffusion for Prediction, Generation, and Interpolation

classification cs.CV cs.AIcs.LG
keywords framesvideofuturepastmaskedpredictioninterpolationconditional
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Video prediction is a challenging task. The quality of video frames from current state-of-the-art (SOTA) generative models tends to be poor and generalization beyond the training data is difficult. Furthermore, existing prediction frameworks are typically not capable of simultaneously handling other video-related tasks such as unconditional generation or interpolation. In this work, we devise a general-purpose framework called Masked Conditional Video Diffusion (MCVD) for all of these video synthesis tasks using a probabilistic conditional score-based denoising diffusion model, conditioned on past and/or future frames. We train the model in a manner where we randomly and independently mask all the past frames or all the future frames. This novel but straightforward setup allows us to train a single model that is capable of executing a broad range of video tasks, specifically: future/past prediction -- when only future/past frames are masked; unconditional generation -- when both past and future frames are masked; and interpolation -- when neither past nor future frames are masked. Our experiments show that this approach can generate high-quality frames for diverse types of videos. Our MCVD models are built from simple non-recurrent 2D-convolutional architectures, conditioning on blocks of frames and generating blocks of frames. We generate videos of arbitrary lengths autoregressively in a block-wise manner. Our approach yields SOTA results across standard video prediction and interpolation benchmarks, with computation times for training models measured in 1-12 days using $\le$ 4 GPUs. Project page: https://mask-cond-video-diffusion.github.io ; Code : https://github.com/voletiv/mcvd-pytorch

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Phenaki: Variable Length Video Generation From Open Domain Textual Description

    cs.CV 2022-10 unverdicted novelty 7.0

    Phenaki generates arbitrary-length videos from sequences of text prompts by tokenizing videos with causal temporal attention and generating tokens with a text-conditioned masked transformer, trained jointly on images ...

  2. Generating synthetic evolution of turbulent flames with an experimental data-based spatiotemporal diffusion model

    physics.flu-dyn 2026-07 conditional novelty 6.0

    A spatiotemporal diffusion model generates realistic multi-modal flame sequences and user-controlled liftoff/reattachment transitions from experimental OH-PLIF/PIV data.

  3. Inferring Dynamic Physical Properties from Video Foundation Models

    cs.CV 2025-10 unverdicted novelty 6.0

    Video foundation models infer dynamic physical properties such as elasticity, viscosity, and friction from videos at levels close to classical oracles while outperforming current MLLMs with suitable prompting.

  4. Latent Video Diffusion Models for High-Fidelity Long Video Generation

    cs.CV 2022-11 unverdicted novelty 6.0

    Latent-space hierarchical diffusion models with targeted error-correction techniques generate realistic videos exceeding 1000 frames while using less compute than prior pixel-space approaches.