HyperAIHyperAI

Command Palette

Search for a command to run...

LongE2V: 장기 지평선 이벤트 기반 비디오 재구성, 예측 및 프레임 보간을 위한 비디오 확산 모델

Cheng-De Fan Chun-Wei Tuan Mu Chen-Wei Chang Chin-Yang Lin Kun-Ru Wu Yu-Chee Tseng Yu-Lun Liu

초록

희소 이벤트 스트림으로부터 고품질 비디오를 복원하는 것은 어려운 과제이다. 회귀 기반 방법은 종종 텍스처를 흐리게 만들고, 기존 생성 모델은 장기적 안정성에 어려움을 겪는다. 본 연구에서는 사전 훈련된 비디오 확산 사전 정보를 활용하여 이벤트 기반 비디오 재구성, 예측 및 프레임 보간을 통합적으로 처리하는 새로운 접근법인 LongE2V를 제안한다. 기초 비디오 모델을 미세 조정함으로써 높은 데이터 효율성과 우수한 지각 품질을 달성한다. 극도로 긴 시퀀스에서의 시간적 드리프트를 완화하기 위해 Autoregressive Unrolling과 Adaptive Context Switching을 도입한다. 또한 프레임 보간 중 정밀한 양방향 일관성을 보장하기 위해 Cross Residual Correction을 통한 Reencoding Alignment를 제안한다. 나아가 Event Voxel Density Augmentation은 다양한 센서 해상도에서의 강건성을 보장한다. 실제 벤치마크에 대한 광범위한 실험을 통해 LongE2V가 세 가지 작업 모두에서 최신 방법을 능가하며, 탁월한 시간적 일관성과 제로샷 일반화를 보여줌을 입증한다.

One-sentence Summary

LongE2V, proposed by researchers at National Yang Ming Chiao Tung University, jointly addresses event-based video reconstruction, prediction, and frame interpolation by fine-tuning pre-trained video diffusion priors, and introduces Autoregressive Unrolling, Adaptive Context Switching, Reencoding Alignment with Cross Residual Correction, and Event Voxel Density Augmentation to mitigate temporal drift and ensure bidirectional consistency, thereby achieving state-of-the-art performance and zero-shot generalization on real-world benchmarks.

Key Contributions

  • LongE2V fine-tunes a pre-trained video diffusion model to jointly handle event-based video reconstruction, prediction, and frame interpolation, achieving high perceptual quality and data efficiency on real-world benchmarks.
  • Autoregressive Unrolling and Adaptive Context Switching are introduced to mitigate temporal drift in extremely long sequences by dynamically updating the generation context instead of relying on fixed schedules.
  • For frame interpolation, Reencoding Alignment with Cross Residual Correction resolves temporal misalignment in the 3D VAE, ensuring precise bidirectional consistency between generated frames.

Introduction

Event cameras capture high-speed dynamics with microsecond resolution and high dynamic range, but their sparse, intensity-free output makes video reconstruction an ill-posed problem. Prior methods often produce blurry textures, drift during long-term prediction, or ghosting artifacts in interpolation, and they typically require separate architectures for each task. The authors introduce LongE2V, a unified framework that leverages pre-trained video diffusion models to perform event-based reconstruction, prediction, and frame interpolation. To ensure stability, they propose autoregressive unrolling with adaptive context switching; for interpolation, reencoding alignment and cross residual correction resolve temporal misalignments. Event voxel density augmentation further enables robust generalization across sensor resolutions, outperforming state-of-the-art methods in perceptual quality and zero-shot transfer.

Method

The authors leverage CogVideoX I2V as the base video diffusion model, which encodes video into latents Z0Z_0Z0 using a 3D VAE with 4x temporal and 8x spatial compression. The Diffusion Transformer (DiT) is trained to minimize the denoising objective: L=EZ0,t,C,ϵ[ϵϵθ(Zt,t,C)22]\mathcal{L} = \mathbb{E}_{Z_0, t, C, \epsilon} \left[ \|\epsilon - \epsilon_\theta(Z_t, t, C)\|_2^2 \right]L=EZ0,t,C,ϵ[ϵϵθ(Zt,t,C)22] where ZtZ_tZt are the noisy latents and CCC denotes conditioning signals. During inference, the model iteratively denoises random Gaussian noise to synthesize clean latents, which are decoded back to pixel space. For event representation, event cameras capture asynchronous streams {ei}i=1N\{e_i\}_{i=1}^N{ei}i=1N where ei=(xi,yi,ti,pi)e_i = (x_i, y_i, t_i, p_i)ei=(xi,yi,ti,pi). To enable frame-based processing, these events are discretized into a voxel grid VRB×H×WV \in \mathbb{R}^{B \times H \times W}VRB×H×W by accumulating polarity pi{±1}p_i \in \{\pm 1\}pi{±1} into BBB temporal bins via linear interpolation: V(t,y,x)=ipimax(0,1tti)δ(xxi,yyi)V(t, y, x) = \sum_{i} p_i \max(0, 1 - |t - t_i^*|) \delta(x - x_i, y - y_i)V(t,y,x)=ipimax(0,1tti)δ(xxi,yyi) where δ\deltaδ is the Kronecker delta and ti[0,B1]t_i^* \in [0, B-1]ti[0,B1] represents the normalized timestamp relative to duration Δt\Delta tΔt. In experiments, B=3B=3B=3.

To align asynchronous events with discrete frames X={x0,,xF1}X = \{x_0, \ldots, x_{F-1}\}X={x0,,xF1}, the event stream is partitioned into time windows. The event voxel vkv_kvk corresponds to frame xkx_kxk at timestamp tkt_ktk by aggregating events within the interval [tk1,tk)[t_{k-1}, t_k)[tk1,tk). This yields a synchronized event sequence V={v1,,vF1}V = \{v_1, \dots, v_{F-1}\}V={v1,,vF1}.

To mitigate error accumulation and artifact propagation in long video generation, the authors employ context frames and context event voxels as history conditions. However, conditioning on history introduces a domain gap between training and inference. To bridge this gap, an Autoregressive Unrolling training strategy is proposed. Initially, the model is trained with Ground Truth context frames until convergence. Subsequently, the unrolling mechanism is activated where predictions generated on the training set are substituted as context frames for subsequent finetuning. This iterative unrolling forces the model to adapt to its own prediction errors and effectively aligns the training distribution with inference behavior.

To enhance robustness against sensor variations, an Event Voxel Density Augmentation strategy is introduced. Event voxels are randomly resized while preserving the aspect ratio, bounded within a dynamic range [Smin,Smax][S_{min}, S_{max}][Smin,Smax]. The lower bound SminS_{min}Smin is set slightly larger than the network input to facilitate random cropping, while SmaxS_{max}Smax is capped at 2x the original resolution. Normalization is based on the statistics of non-zero values to preserve sparsity. Identical geometric transformations are synchronously applied to the first frame, context frames, and current video frames to maintain spatial alignment.

Following spatial and temporal alignment, all inputs are encoded via a frozen 3D VAE. The final input latents are constructed by concatenating three temporally-aligned sequences along the channel dimension: (1) context latents with the zero-padded first-frame latent Zx0Z_{x_0}Zx0, (2) context latents with the noise latents ZtZ_tZt, and (3) context event latents with the current event latents. To accommodate the additional event condition, the first projection layer within the patchify module is augmented, extending the weights WinRD×2Cvae×K×K\mathbf{W}_{in} \in \mathbb{R}^{D \times 2C_{vae} \times K \times K}WinRD×2Cvae×K×K to WinRD×3Cvae×K×K\mathbf{W}_{in}^* \in \mathbb{R}^{D \times 3C_{vae} \times K \times K}WinRD×3Cvae×K×K. During training, this expanded layer is fully fine-tuned, and LoRA is employed for the DiT blocks. The loss is calculated exclusively on the ZtZ_tZt component.

The authors formulate event-based video reconstruction, prediction, and frame interpolation as tasks of event-based video generation by adjusting input conditions. For Video Reconstruction, the model recovers photometric details solely from events. For Video Prediction, given the start frame, event stream, and context, the model generates subsequent video frames. For Video Frame Interpolation, given the start and end frames as boundary conditions, the model synthesizes intermediate frames by leveraging both forward and backward event streams.

To mitigate error accumulation during autoregressive generation, an Adaptive Context Switch is introduced. The denoised latents Z^0\hat{Z}_0Z^0 are re-input into the DiT to extract the attention map AAA and compute the average attention weight μattn\mu_{attn}μattn of current tokens attending to context tokens: μattn=1L×H×Ncurrl=1Lh=1HiCurrentjContextAi,j(l,h)\mu_{attn} = \frac{1}{L \times H \times N_{curr}} \sum_{l=1}^{L} \sum_{h=1}^{H} \sum_{i \in \text{Current}} \sum_{j \in \text{Context}} A_{i,j}^{(l,h)}μattn=L×H×Ncurr1l=1Lh=1HiCurrentjContextAi,j(l,h) where LLL is the number of layers, HHH is the number of Attention Heads, and NcurrN_{curr}Ncurr is the number of Current Tokens. If μattnτ\mu_{attn} \ge \tauμattnτ, the existing context is retained. If μattn<τ\mu_{attn} < \tauμattn<τ, indicating low relevance, a Context Switch is triggered: the current generation is discarded, the context is updated to the immediate predecessor, and the chunk is regenerated.

For zero-shot interpolation, Reencoding Alignment is proposed to rectify temporal misalignment caused by the non-commutativity of latent and pixel space operations in 3D VAEs. The predicted clean latents Z^0\hat{Z}_0Z^0 are decoded, flipped in pixel space, and re-encoded: Z~0fwd=E(Flippix(D(Z^0fwd))),Z~0bwd=E(Flippix(D(Z^0bwd)))\tilde{Z}_0^{fwd} = \mathcal{E}(\text{Flip}_{pix}(\mathcal{D}(\hat{Z}_0^{fwd}))), \quad \tilde{Z}_0^{bwd} = \mathcal{E}(\text{Flip}_{pix}(\mathcal{D}(\hat{Z}_0^{bwd})))Z~0fwd=E(Flippix(D(Z^0fwd))),Z~0bwd=E(Flippix(D(Z^0bwd))) This ensures precise temporal alignment between the bidirectional branches. To compensate for reconstruction loss induced by the extra Decode-Encode loop, Cross Residual Correction is introduced. The residual between the original Z^0\hat{Z}_0Z^0 and re-encoded Zˉ0=E(D(Z^0))\bar{Z}_0 = \mathcal{E}(\mathcal{D}(\hat{Z}_0))Zˉ0=E(D(Z^0)) latents is computed: ΔZ^0fwd=Z^0fwdZˉ0fwd,ΔZ^0bwd=Z^0bwdZˉ0bwd\Delta \hat{Z}_0^{fwd} = \hat{Z}_0^{fwd} - \bar{Z}_0^{fwd}, \quad \Delta \hat{Z}_0^{bwd} = \hat{Z}_0^{bwd} - \bar{Z}_0^{bwd}ΔZ^0fwd=Z^0fwdZˉ0fwd,ΔZ^0bwd=Z^0bwdZˉ0bwd The opposing residual is then injected into the aligned latents: Z0bwd=Z~0bwd+ΔZ^0fwd,Z0fwd=Z~0fwd+ΔZ^0bwdZ_0^{\prime bwd} = \tilde{Z}_0^{bwd} + \Delta \hat{Z}_0^{fwd}, \quad Z_0^{\prime fwd} = \tilde{Z}_0^{fwd} + \Delta \hat{Z}_0^{bwd}Z0bwd=Z~0bwd+ΔZ^0fwd,Z0fwd=Z~0fwd+ΔZ^0bwd This recovers high-frequency details and promotes Temporal Consensus. Finally, the corrected latents are fused via alpha blending and re-noised for the subsequent loop.

Experiment

The model is trained on the BS-ERGB dataset and evaluated on real-world event sequences from ECD, MVSEC, and HQF for reconstruction and prediction, and on BS-ERGB and HQF for frame interpolation. Comparisons show that it consistently outperforms prior state-of-the-art methods in both short- and long-term reconstruction and prediction, and even surpasses dedicated interpolation models in a zero-shot setting, producing sharper and more coherent outputs. Ablation studies confirm the importance of the pretrained diffusion prior, context mechanisms, and autoregressive training for stability, while for interpolation, reencoding alignment, cross residual correction, and event voxel augmentation are essential to avoid artifacts. Additionally, the model can leverage its text-guided generation backbone to perform event video colorization from textual prompts.

The proposed method achieves the best perceptual quality in reconstruction, attaining the lowest LPIPS scores across all three datasets and outperforming regression-based baselines. For prediction, it significantly surpasses VDM-EVFI on every metric and dataset, demonstrating robust long-term generation capabilities. These findings are consistent on ECD, MVSEC, and HQF. The method consistently yields the lowest LPIPS in reconstruction, indicating superior perceptual quality compared to regression-based approaches. It significantly outperforms VDM-EVFI across all metrics and datasets in the prediction task, validating its long-term generation strength.

A zero-shot generative method for event-based video frame interpolation surpasses dedicated supervised baselines in perceptual quality and generalization. On the HQF dataset it achieves the best PSNR, SSIM, and LPIPS, while on ERGB it delivers comparable fidelity metrics with substantially sharper textures. Unlike regression approaches that sacrifice detail for higher PSNR, this method preserves high-frequency structures and avoids ghosting or misalignment. The zero-shot model achieves the lowest LPIPS on both datasets, and on HQF it also attains the highest PSNR and SSIM, demonstrating strong generalization without fine-tuning. Qualitative comparisons show the method reconstructs clear, readable text and maintains structural integrity, whereas supervised baselines produce blur, ghosting, and color artifacts.

Omitting the pretrained prior prevents convergence and leads to extremely low reconstruction quality. Adding context, autoregressive unrolling, and an adaptive context switch progressively reduces error accumulation, with the full configuration attaining the highest fidelity across all metrics. Without a pretrained prior, the model fails to converge and produces near-noise outputs. Incorporating context and autoregressive unrolling substantially improves PSNR, SSIM, and LPIPS. The adaptive context switch provides a final refinement, yielding the best scores on all metrics.

Removing Reencoding Alignment causes severe blur, confirming its role in structural fidelity. Cross Residual Correction markedly improves perceptual quality, lowering LPIPS by 0.037, while Event Voxel Density Augmentation increases robustness to density mismatch. The full combination of all three components delivers the highest PSNR, SSIM, and lowest LPIPS. Enabling Cross Residual Correction alongside Reencoding Alignment substantially increases PSNR and reduces LPIPS, mitigating ghosting and semi-transparent artifacts. Adding Event Voxel Density Augmentation yields the lowest LPIPS (0.124) and prevents color deviations and black stripe artifacts caused by density mismatch.

The evaluation covers event-based video reconstruction and prediction across multiple datasets, comparing the proposed method against regression-based and dedicated supervised baselines. The method consistently achieves superior perceptual quality, with its zero-shot generative variant generalizing strongly to produce sharp, artifact-free outputs. Ablation studies confirm that a pretrained prior is essential for convergence, while autoregressive unrolling, adaptive context switching, and alignment corrections progressively reduce error accumulation and structural distortions, yielding the highest fidelity in long-term generation.


AI로 AI 구축

아이디어에서 출시까지 — 무료 AI 코코딩, 즉시 사용 가능한 환경, 최적의 GPU 가격으로 AI 개발을 가속화하세요.

AI 협업 코딩
바로 사용 가능한 GPU
최적의 가격

HyperAI Newsletters

최신 정보 구독하기
한국 시간 매주 월요일 오전 9시 에 이번 주의 최신 업데이트를 메일로 발송합니다
이메일 서비스 제공: MailChimp