alphaFeedback

WorksComputer Science

VideoMaMa++: Temporally Consistent Video Matting via Preserve-and-Refine Token

AI contributions
Not recorded for this paper
View details

Abstract

Diffusion-based video matting has recently emerged as a leading approach, leveraging video diffusion priors from internet-scale pretraining to achieve strong zero-shot generalization from limited synthetic data. However, the heavy compute of these diffusion backbones limits inference to a short chunk of just 6 to 24 frames, so even ordinary videos span multiple chunks. Because each chunk is matted independently from coarse mask guidance, existing methods fail to maintain consistency across chunk boundaries, producing flickering edges and discontinuous transparency. We address this with a mask-guided diffusion-matting framework built on two ideas. The RGB and mask conditioning are represented as separate token streams that interact through full spatio-temporal self-attention, letting the model adaptively combine fine RGB texture with coarse mask layout rather than committing to a fixed channel-wise fusion. On top of this, we propose a novel pair of learnable embeddings, the preserve token and the refine token, that act as a per-frame conditioning interface and enable a sliding-window inference scheme in which already-generated mattes are propagated across chunk boundaries for local temporal consistency, complemented by a globally shared reference anchor at every chunk to prevent error accumulation in long sequences without any additional training. Across standard video matting benchmarks and in-the-wild long footage, our framework outperforms prior diffusion-based methods in both fine-detail accuracy and temporal consistency, and uniquely maintains consistency across chunk boundaries on long videos.

Introduction

Video matting, the task of extracting foreground objects with pixel-level precision from video, is a fundamental component of video editing applications such as background replacement [56, 12, 36], visual composition [10, 51], and relighting [4, 36, 46, 8]. Producing convincing composites in these settings requires alpha mattes that capture fine structures such as hair strands and motion-blurred edges, and that remain temporally consistent across the entire video.

Recent video matting methods leverage priors from video object segmentation models [19, 53]. However, these methods still rely on dedicated matting annotations and offer limited zero-shot generalization, with most existing methods restricted to human portraits due to the scarcity of matting labels for other categories. A more recent line of work instead leverages video diffusion priors [27, 13], transferring generative knowledge obtained from internet-scale pretraining to close the train–test gap that arises when models are trained only on synthetic matting data. In particular, VideoMaMa [27] demonstrates that a mask-to-matte diffusion model trained on synthetic data alone can generalize to non-human categories and to in-the-wild video footage.

However, applying diffusion-based matting to real videos exposes a fundamental limitation that hinders general video processing. Diffusion backbones are computationally heavy and cannot process arbitrarily long sequences in a single forward pass; existing methods are therefore chunk-based, handling only 6–24 frames at a time. As a result, even ordinary videos must be split into multiple chunks and processed sequentially. When each chunk is matted independently from its coarse mask guidance, the resulting mattes drift across chunk boundaries, producing flickering edges and discontinuous transparency, as illustrated in Figure 1 (b). The root cause is the inherent ambiguity of coarse mask guidance: a single binary mask admits many plausible fine-grained refinements at object boundaries, and independently processed chunks settle on different ones.

In this work, we present a novel mask-guided diffusion-matting framework designed for long, high-resolution video. At its core, we represent the two guidance modalities, the RGB frames and the coarse mask, as separate token streams alongside the noisy matte tokens, and let them interact through full spatio-temporal self-attention. This design replaces the channel concatenation used in prior U-Net-based diffusion matting [27] and preserves each modality’s distinct structure. The high-frequency RGB texture carries hair and edge cues, while the binary mask provides a coarse but spatially anchored foreground extent, and attention adaptively composes the two at every layer and spatial location. As a result, the model leans on RGB at object boundaries where the mask is unreliable, and on the mask in the interior where it confidently localizes the foreground. We instantiate this on a Diffusion Transformer (DiT) [34, 45] with Rotary Position Embedding (RoPE) [42], which naturally accommodates diverse resolutions and frame counts.

To resolve the chunk-boundary inconsistency described above, we introduce a novel pair of learnable token embeddings, the preserve token and the refine token, a new conditioning interface for consistent video matting. The preserve token marks a frame whose guidance is already a fine matte, previously generated or ground truth, and tells the model to keep it as a reference. The refine token marks a frame with only a coarse mask and asks the model to refine it into a fine matte consistent with the preserve-tagged references via DiT’s full self-attention. We employ these tokens in a sliding-window inference scheme in which each chunk overlaps a few preserve-tagged frames with the previous chunk, so that already-generated mattes propagate across chunk boundaries and maintain local temporal consistency. To further guard against error accumulation over long sequences, we additionally supply a globally reliable matte as a reference anchor at every chunk through the same preserve token, without any additional training.

We validate our framework through extensive experiments on standard video matting benchmarks and in-the-wild footage. Our method outperforms existing video matting approaches on VideoMatte [28], YoutubeMatte [53], and V-HIM60 [19] in both fine-detail accuracy and temporal consistency, and achieves state-of-the-art performance on long-video matting where prior diffusion-based methods fail to maintain consistency across chunk boundaries. The same preserve mechanism also gives users direct control at inference time, for example to interactively correct erroneous outputs by re-tagging specific frames as refine while keeping trusted neighbors as preserve.

Our contributions can be summarized as follows.

  • A mask-guided diffusion-matting framework with token-level guidance representation, where the RGB frames and the coarse mask are kept as separate token streams adaptively composed by full spatio-temporal self-attention, rather than fused via channel concatenation as in prior works.

  • A novel preserve and refine token mechanism that enables chunk-consistent matting through sliding-window inference with overlap-based propagation, complemented by a globally shared reference anchor that prevents error accumulation in long sequences without any additional training.

  • State-of-the-art performance on standard video matting benchmarks and in-the-wild long-video footage, with substantial gains in fine-detail accuracy and temporal consistency over prior diffusion-based methods that process video chunk-wise.

Related Work

Video matting. Video matting methods can be broadly categorized into auxiliary-free and auxiliary-guided approaches [33, 16]. Auxiliary-free methods [29, 21, 23] typically focus on portrait matting, restricting their applicability to human-centric scenarios. Auxiliary-guided approaches relax this restriction by accepting additional conditioning at the cost of an extra annotation. Trimap-guided methods [17, 40] require manual trimap annotations and cannot easily leverage modern segmentation models such as the SAM family [22, 35, 3]. More recent mask-guided methods reduce this burden by accepting only a coarse binary mask. MaGGIe [19] decouples target tracking from matting but struggles to generalize to in-the-wild videos, while MatAnyone [53, 52] propagates target-assigned mattes through a memory-augmented architecture trained on dedicated matting datasets such as VM800 [53] and VMReal [52]. Despite these advances, all of these methods remain constrained by predominantly synthetic and human-centric training data, leaving in-the-wild generalization to non-human categories largely unsolved.

Diffusion priors for perception. Diffusion priors from internet-scale pretraining have been transferred to dense perception tasks. Marigold [20] pioneered this direction by adapting Stable Diffusion [38] for depth estimation, and the same recipe extends to a range of video perception tasks [1, 41, 15, 50], with more recent works [49, 57] extending it to DiT-based backbones.

Diffusion long-video inference. Diffusion backbones, however, are computationally heavy and limited to short chunks, so applying them to long videos requires a chunk-wise inference scheme. ChronoDepth [41] and DepthCrafter [15] adopt sliding-window inference with overlapping frames between adjacent chunks for local temporal smoothness, but offer no global anchor against drift. A parallel line of work tackles this through auto-regressive generation [18, 5, 55, 30, 9, 54, 32], where each chunk is conditioned on the previous chunk via causal attention with KV-cache reuse. While effective for free-form video generation, this hidden-state propagation does not naturally compose with explicit external conditioning such as a guide mask. Our work instead propagates fully-formed reference mattes between chunks through the preserve token, keeping each chunk fully conditioned on its own user-supplied mask.

Diffusion-based video matting. In the matting domain, recent diffusion-based methods transfer video diffusion priors to video matting using only synthetic data. The auxiliary-free GVM [13] and the mask-guided VideoMaMa [27] both demonstrate that this prior generalizes to non-human categories and in-the-wild footage, but both inherit the chunk-wise inference limitation of prior diffusion-based perception models. VideoMaMa, the closest mask-guided baseline, additionally fuses RGB, mask, and noise via channel concatenation, entangling the guidance modalities and limiting fine-detail recovery. Our work departs from this design by representing the two guidance modalities as separate token streams, and by introducing the preserve and refine tokens that maintain chunk-wise consistency through globally shared reference anchors and overlap-based local smoothing.

Method

Problem Formulation and Overview

Video matting is mathematically defined by the alpha compositing equation,

It=αtFt+(1−αt)Bt,t=1,…,T,(1)I_t = \alpha_t F_t + (1-\alpha_t)B_t,\quad t=1,\ldots,T, \tag*{(1)}

where tt denotes the frame index, TT is the total number of frames in the video, ItI_t is the observed image at frame tt, FtF_t is the foreground, BtB_t is the background, and αt∈[0,1]\alpha_t \in[0,1] is the alpha matte representing pixel-level opacity. Unlike binary segmentation masks M∈{0,1}M \in\{0,1\}, alpha mattes capture fine-grained details such as hair strands, motion blur, and semi-transparent regions, which are critical for realistic video compositing.

We adopt a mask-guided formulation that decomposes video matting into two subproblems: foreground tracking and boundary refinement. Tracking a target object across a video is itself a demanding task, and entangling it with matte generation forces a single model to simultaneously localize objects and resolve pixel-level matting. By conditioning on a binary mask, we decouple these two challenges and allow our model to focus on generating fine-grained matting details such as hair strands and motion blur, while inheriting localization capabilities from off-the-shelf segmentation models [35, 3, 7, 6].

We design an end-to-end pipeline for long-video matting that takes a video and a single user prompt on the first frame as input, and produces a temporally consistent alpha matte across the entire sequence. The pipeline operates in three stages, illustrated in Figure 2. First, we obtain a per-frame foreground signal by propagating the user prompt across all frames using an off-the-shelf video segmentation model such as Segment Anything [35, 3]. Second, the resulting binary mask track is passed to our Diffusion Transformer (DiT) backbone together with the RGB frames to generate fine-grained alpha mattes (§ 3.2). Finally, long sequences are handled by a chunk-wise inference scheme equipped with preserve and refine tokens (§ 3.3), which propagates information across chunk boundaries to maintain temporal consistency throughout the video.

Overview of the VideoMaMa++ training and inference

Figure 2. Overview of the VideoMaMa++ training and inference. (Top) During training, RGB frames are paired with either a binary mask or the ground-truth alpha matte as guide input, encoded into separate token streams by a frozen VAE encoder E\mathcal{E}, and tagged with a refine token (R) or preserve token (P). The DiT processes both modes jointly within a single clip, supervised against the ground-truth matte. (Bottom) At inference, long videos are processed in a sliding-window manner. Each chunk receives the refine token on its non-overlapping frames and the preserve token on its overlap frames, which carry the previous chunk’s predicted matte. A globally selected reference anchor frame is additionally supplied as preserve input to every chunk, providing a stable anchor that prevents error accumulation across the sequence.

Repurposing Diffusion Transformer for Video Matting

Video matting annotations are scarce and limited in quantity and category coverage. Generalizing to real-world footage therefore requires a strong prior over natural video content. We build our framework on a video DiT [34, 45] backbone, which provides a rich generative prior learned from internet-scale video pretraining and offers several architectural properties well-suited to video matting.

The input video VV, the guide mask track MM, and, during training, the ground-truth alpha matte α\alpha are each encoded into the latent space by a shared, frozen VAE encoder E\mathcal{E}, producing zVz_V, zMz_M, and zαz_\alpha respectively. We sample Gaussian noise ϵ∼N(0,I)\epsilon\sim\mathcal{N}(0, I) with the same shape as zαz_\alpha, and concatenate zVz_V, zMz_M, and ϵ\epsilon along the token dimension as input to the DiT backbone:

z^α=FDiT(concat⁡(zV,zM,ϵ)),(2)\hat{z}_\alpha= \mathcal{F}_{\mathrm{DiT}}\left(\operatorname{concat}(z_V, z_M, \epsilon)\right), \tag*{(2)}

where FDiT(⋅)\mathcal{F}_{\mathrm{DiT}}(\cdot) denotes our adapted DiT and concat⁡(⋅)\operatorname{concat}(\cdot) denotes concatenation. Unlike UNet-based matting models [27, 2] that fuse the three modalities along the channel dimension, our token-level concatenation lets each modality occupy its own token stream and preserves modality-specific information throughout the network. The final alpha matte video is obtained by decoding the predicted latents through the VAE decoder, α^=D(z^α)\hat{\alpha} = \mathcal{D}(\hat{z}_\alpha). We initialize from the pretrained DiT [45] and, instead of its original flow-matching objective, supervise the decoded predictions directly in pixel space (see Appendix § 8). Although training follows the standard multi-step schedule, we find a single denoising step at inference sufficient to produce high-quality mattes, and adopt it as our default for efficiency.

Preserve and Refine Tokens

The formulation above operates on a single clip, while video matting in practice requires handling long sequences. DiT backbones are computationally heavy and cannot process long videos in a single forward pass. A natural solution is chunk-wise inference, where the video is split into fixed-length clips and each clip is processed independently. However, when each chunk is refined from its guidance in isolation, the resulting mattes drift across chunk boundaries, producing flickering edges and discontinuous transparency.

To address this, we introduce two learnable token embeddings, a preserve token and a refine token, which assign each frame a per-frame mode that determines whether its matte is carried through unchanged or generated from coarse guidance. The preserve token marks anchor frames whose alpha mattes should be retained, while the refine token marks frames that should be converted from coarse guidance into fine-grained alpha mattes. DiT’s full self-attention propagates information from preserve frames to refine frames, yielding mattes that remain consistent across chunks.

Why not auto-regressive diffusion? We chose to propagate fully-formed reference mattes through the preserve token rather than reuse the previous chunk’s key-value (KV) cache as in auto-regressive diffusion approaches [18, 55]. Hidden-state propagation implicitly turns the model into a propagation-based matting framework, where each chunk’s prediction is determined more by the previous chunk’s internal state than by its own mask guidance. This re-entangles localization and fine-detail recovery, the two subproblems we explicitly decoupled by adopting mask-guided conditioning. The preserve token instead exposes the previous chunk’s contribution as an explicit alpha matte, so each chunk remains fully grounded in its own mask guidance while still receiving long-range temporal context through self-attention.

Training. We train both tokens jointly within a single clip. For each training clip, we randomly select a subset of frames as preserve frames, replace their guide input with the ground-truth alpha matte, and add the preserve token embedding to those frames. The remaining frames receive the refine token together with the standard binary mask guide input. The model is supervised against the ground-truth matte at all frames through the pixel-level supervision, learning to reconstruct the supplied matte at preserve frames and to generate fine-grained mattes from coarse guidance at refine frames. Joint training within a single clip is essential, as it forces the DiT to learn a unified representation in which preserve and refine frames interact through self-attention, rather than treating them as two disjoint tasks.

Temporally Consistent Inference

We deploy the preserve and refine tokens at inference through two complementary mechanisms: a sliding-window scheme that propagates mattes between adjacent chunks for local consistency, and a reference anchor that supplies a globally reliable matte at every chunk to prevent long-range drift.

Sliding window. At inference, we apply a sliding-window scheme in which consecutive chunks share an overlap region. The overlapping frames receive the previous chunk’s predicted matte as input together with the preserve token, so that their mattes are passed through unchanged, while the remaining frames receive the guide signal together with the refine token. Although the preserve token is applied only to the overlap frames, DiT’s full attention allows them to condition the generation of every other frame in the chunk, transferring temporal context across the chunk boundary and producing chunk-consistent mattes.

Reference anchor. The sliding-window scheme alone is vulnerable to error accumulation, since a corrupted overlap frame, e.g., due to occlusion, tracking drift, or other video artifacts, propagates through the preserve token to all subsequent chunks and cascades local failures through the rest of the video. To prevent this, we introduce a reference anchor, a globally reliable frame whose matte is supplied as preserve input alongside the local overlap frames at every chunk, providing a stable, error-free signal that the model can attend to throughout inference while the overlap frames continue to carry short-range temporal context. Crucially, this capability emerges directly from the preserve token without any additional training: because the preserve token already learns to treat its inputs as anchors, any user-supplied matte can serve as an anchor for the rest of the video.

This design gives users explicit control over which frame anchors the inference. By default, we reuse the matte predicted at the first chunk as the reference anchor throughout the video, which we find sufficient for most sequences. When the first frame is unreliable due to heavy occlusion, motion blur, or partial visibility, the user can instead select a later frame with cleaner foreground appearance as the reference, allowing the entire sequence to be conditioned on the most informative anchor available.

Experiments

Implementation Details

We build VideoMaMa++ on top of the Wan 2.1 (1.3B) [45] model, training on a combination of image and video matting datasets. To preserve the generative prior, we adapt the DiT to the video matting task using LoRA [14] rather than fine-tuning the full backbone. Training uses 3-frame clips at 1024×10241024 \times1024 resolution, which provides sufficient capacity for both spatial detail and temporal modeling. At inference, we process the video in chunks of 6 frames with a 2-frame overlap between consecutive chunks, where one of the overlap frames is the reference anchor. Although the training and inference settings differ in both frame count and chunking behavior, the model generalizes across them due to RoPE’s [42] relative position encoding, which removes the dependence on absolute resolution and clip length present in fixed positional embeddings.

Quantitative Evaluations

We evaluate VideoMaMa++ on three benchmarks: VideoMatte240K [28], YouTubeMatte [53], and V-HIM60 (Hard) [19]. All mask-guided methods, including ours, receive identical guidance masks produced by a single procedure (Algorithm 1). The binarized first-frame ground-truth matte prompts SAM3 [3] on a duplicated first frame (frames {0,0,1,2,…}\{0,0,1,2,\ldots\}), and SAM3 propagates it across the video, so every guidance mask, including that of the first frame, is a SAM3 prediction rather than the binarized ground truth, and no method receives a privileged mask. For one YouTubeMatte sequence, a sheet of paper that belongs to the foreground enters mid-video, so all methods share a track initialized at a later frame in which the paper is visible; VideoMaMa++ remains the best method under first-frame initialization as well (Appendix § 12).

As reported in Table 1, VideoMaMa++ achieves the best performance across all metrics on every benchmark. The improvements are particularly pronounced on Gradient [37] and dtSSD [11], which respectively measure spatial boundary sharpness and temporal smoothness. The Gradient gains confirm that the DiT-based generative prior recovers fine-grained boundary detail more accurately than prior mask-guided methods, while the dtSSD improvements indicate that the preserve and refine token mechanism produces temporally consistent mattes despite chunk-wise inference. We provide a further analysis of discontinuities at chunk boundaries in Appendix § 13.

DatasetMetricsSAM3MGMMGM-IWMaGGIeMaGGIe-FTMatAnyoneMatAnyone 2VideoMaMaOurs
VideoMatte (1920×10801920 \times1080)MAD ↓\downarrow5.0511.285.014.264.444.174.044.343.86
VideoMatte (1920×10801920 \times1080)MSE ↓\downarrow0.943.230.350.270.330.270.240.270.12
VideoMatte (1920×10801920 \times1080)Grad ↓\downarrow12.026.335.013.614.533.593.134.061.79
VideoMatte (1920×10801920 \times1080)dtSSD ↓\downarrow3.112.111.381.231.351.171.131.210.82
YouTubeMatte (1920×10801920 \times1080)MAD ↓\downarrow2.353.592.411.671.521.741.521.411.15
YouTubeMatte (1920×10801920 \times1080)MSE ↓\downarrow1.110.530.380.500.370.530.440.300.23
YouTubeMatte (1920×10801920 \times1080)Grad ↓\downarrow14.634.274.255.115.367.376.464.083.27
YouTubeMatte (1920×10801920 \times1080)dtSSD ↓\downarrow3.281.571.371.461.471.561.481.311.17
V-HIM60 (Hard)MAD ↓\downarrow3.9166.312.892.722.814.044.732.301.69
V-HIM60 (Hard)MSE ↓\downarrow2.0949.020.841.031.032.292.930.750.45
V-HIM60 (Hard)Grad ↓\downarrow18.3717.534.866.056.537.046.695.042.92
V-HIM60 (Hard)dtSSD ↓\downarrow5.0812.732.743.183.124.083.702.511.98
V-HIM60 (Hard)Conn ↓\downarrow6.97114.704.084.724.847.108.063.832.72

Table 1. Quantitative comparison of video matting methods on various benchmarks.

Qualitative Evaluations

We compare VideoMaMa++ against representative video matting baselines, including MGM in-the-wild [33], MaGGIe [19], MatAnyone 2 [52], and VideoMaMa [27], on in-the-wild videos. Figure 3 shows long videos that diffusion models (VideoMaMa and ours) cannot process in a single chunk. As shown in the figure, the comparison methods either fail to capture fine-grained details or produce flickering results across chunks that are inconsistent over the full video. In contrast, VideoMaMa++ produces mattes that retain fine-grained boundary detail consistently throughout the sequence and remain stable across distant frames, demonstrating that our DiT-based generative prior, combined with the preserve and refine token mechanism, generalizes effectively to long-form footage well beyond the length seen during training. We refer the reader to the supplementary material for additional comparisons that more clearly demonstrate temporal consistency in motion.

Qualitative comparison of long-video temporal consistency across RGB input, input mask, and matting methods

Figure 3. Long-video temporal consistency. Qualitative comparison between VideoMaMa++ and other methods. The comparison methods exhibits visible flickering at chunk boundaries or struggles to capture fine-grained details, while VideoMaMa++ produces smooth transitions across chunks while still capturing fine-grained details that emerge in later chunks.

We further quantify this observation with an annotation-free test for chunk-boundary discontinuities (Appendix § 13), which detects spikes in the frame-to-frame matte change that recur at chunk seams. With both models run at identical seams, VideoMaMa’s matte change spikes at seams in-the-wild clips, whereas VideoMaMa++ stays at chance level. On YouTubeMatte, where ground truth is available, the same test detects VideoMaMa’s discontinuity and finds none in the ground-truth mattes, supporting its validity. Per clip, VideoMaMa’s seam contrast exceeds that of VideoMaMa++ at identical boundaries, and these conclusions are stable across difference statistics and detrending windows. Since the test targets only chunk-boundary discontinuities, it applies only to chunk-wise methods, which is why we compare against VideoMaMa.

Interactive refinement. The preserve and refine tokens also enable selective refinement of individual frames within a chunk. Given an initial prediction, we identify the frame with the largest error against the ground-truth matte, mark it with the refine token, and mark the remaining frames with the preserve token. Re-running the model under this configuration regenerates the marked frame while attending to the others as anchors, producing a refined matte that draws on temporal context from the rest of the chunk. As illustrated in Figure 4a, this interactive procedure consistently improves matting quality, even though no new guide signal is provided. Quantitative results for interactive refinement are reported in the appendix.

Interactive refinement examples and MAD across chunk index

Figure 4. (Left) Interactive refinement examples. (Right) MAD across chunk index.

Ablation Studies

Reference anchor. We ablate the reference anchor by comparing two sliding-window inference settings: w/o r. anchor, which uses previous chunk’s matte on the local overlap frames with preserve tokens, and w/ r. anchor, our full setting that additionally supplies the first-chunk matte as a reference anchor providing a global preserve input. As reported in Table 2, adding the reference anchor yields consistent improvements across all six metrics on both benchmarks, with the largest gains on boundary-sensitive measures such as Gradient. This confirms that propagating preserve information through local overlaps alone leaves the model vulnerable to error accumulation, and that the global anchor effectively stabilizes long-range inference while preserving the cross-chunk information transfer enabled by the preserve token.

SettingMAD ↓\downarrowMAD-T ↓\downarrowMSE ↓\downarrowGRAD ↓\downarrowCONN ↓\downarrowdtSSD ↓\downarrow
VideoMatte (1920 × 1080)
w/o r. anchor3.95054.73660.15182.23981.28170.8576
w/ r. anchor3.86334.63540.12401.78871.07550.8206
YouTubeMatte (1920 × 1080)
w/o r. anchor1.269131.69000.28614.41512.32941.1803
w/ r. anchor1.152629.46550.22883.27412.06061.1663

Table 2. Ablation study on reference anchor.

The aggregate metrics in Table 2 measure average matting quality but do not reveal how that quality evolves as the sliding window advances along the sequence. To probe error accumulation directly, we re-aggregate MAD by chunk index, and report the relative change with respect to the first chunk. As shown in Figure 4b, the w/o r. anchor variant exhibits a steadily rising curve on both benchmarks, with MAD growing markedly by the final chunk. In contrast, the w/ r. anchor variant remains substantially flatter throughout the sequence, confirming that the reference anchor effectively suppresses error propagation across long videos.

Choice and quality of the reference anchor. The first frame may not represent later frames well, for example when the subject is partially occluded or only enters the frame later. Using a random frame or the last frame of the first chunk as the anchor instead yields nearly unchanged performance across all metrics (Table 3a), indicating that any frame of the first chunk serves as an effective anchor. Re-anchoring to a recent frame every few chunks likewise matches the default setting, so a first-frame anchor does not become stale on V-HIM60 despite its substantial pose, scale, and appearance variation; refreshing nonetheless remains available for footage with more drastic changes.

(a) Anchor choice(b) Corrupted anchor frame
MetricsFirstRandomLastRefreshCleanD5D21E5E21B7B15B25Occ.
MAD ↓\downarrow1.691.701.721.701.711.711.731.731.741.741.741.751.76
MSE ↓\downarrow0.450.450.450.460.460.460.460.460.480.480.480.480.48
Grad ↓\downarrow2.922.942.952.942.952.942.942.972.953.043.053.053.06
dtSSD ↓\downarrow1.981.992.001.991.991.991.982.001.992.022.022.032.03
Conn ↓\downarrow2.722.742.76–2.752.752.782.782.812.812.812.832.84

Table 3. Reference anchor analysis. We evaluate (a) the anchor frame within the first chunk and re-anchoring every 3 chunks (Refresh), and (b) a corrupted anchor frame: dilated (D) or eroded (E) guidance mask, motion blur (B), and full occlusion (Occ.), with kernel sizes in px. In (b), the corrupted first frame is excluded from evaluation. All evaluations are performed on the V-Him60 (Hard) benchmark. The best results in (a) are highlighted.

We further corrupt the input of the anchor frame (Table 3b) with a poor guidance mask (erosion or dilation), horizontal motion blur on the RGB frame, or a real occluder composited over nearly the entire subject, whose region is also removed from the guidance mask (Appendix § 15). Because the anchor is the model’s own first-frame prediction, the degraded anchor matte propagates to all later chunks. Nevertheless, performance degrades only marginally under every corruption. Full occlusion is the most severe case, followed by motion blur and poor guidance masks, and even a fully occluded anchor leaves the model close to its clean-anchor performance.

Effect of preserve token at chunk boundaries. We design a targeted experiment to verify that the preserve and refine tokens produce consistent mattes across chunk boundaries. Using a chunk size of 6 with an overlap of 2 frames, each overlap frame is generated twice: once as part of the preceding chunk and once as part of the following chunk. We measure the discrepancy between these two predictions for the same frame, which directly reflects how much the matte drifts when the model crosses a chunk boundary. The two settings differ only in how the overlap frames are treated by the second chunk: w/o preserve regenerates them independently from the coarse mask guidance, whereas w/ preserve marks them with the preserve token and conditions on the matte produced by the preceding chunk. To isolate the effect of the preserve token, the reference anchor is disabled in both settings. As reported in Table 4, w/ preserve reduces both MAD and Gradient discrepancy by a large margin, confirming that the preserve token effectively transfers cross-chunk information and yields mattes that align across chunk boundaries rather than drifting into independently chosen refinements.

MethodMAD ↓Gradient ↓
w/o preserve0.71280.6811
w/ preserve0.25830.1235

Table 4. Chunk boundary consistency.

Robustness to mask generators. To evaluate the robustness of our model to diverse binary mask sources, we measure performance on V-HIM60 [19] using XMem [7], Cutie [6], SAM2 [35], and SAM3 [3] as binary mask generators in Table 5. The results show that the model maintains consistent performance across all mask generators, demonstrating its robustness to the choice of binary mask input. Beyond the choice of generator, the model also tolerates local mask errors: when the guidance mask is wrong on individual frames of a chunk, such as missing thin structures or drift under motion blur, cross-frame attention to neighboring frames recovers the matte. If the tracker instead locks onto a wrong object for an entire sequence, the matte follows that track, a limitation shared by all mask-guided methods.

Input MaskMAD ↓ InputMAD ↓ RefinedGradient ↓ InputGradient ↓ Refined
XMem5.55873.111917.72653.6025
Cutie3.69981.943013.53952.9448
SAM24.08441.899419.35953.2741
SAM33.91061.692418.36592.9196

Table 5. Robustness to mask generators.

Continuous guidance via SAM logits. We investigate replacing the binary guide mask with SAM’s raw logit map, which preserves the soft confidence information discarded by binarization (Figure 5). The structures most affected by this collapse, such as hair strands, thin wires, and motion-blurred edges, exhibit below-threshold logits that are removed entirely once the mask is binarized. We replace the guide mask MM in Section 3.2 with a SAM logit map, encoded by the same VAE into a latent that substitutes for zMz_M in Eq. (2), and retrain the model end-to-end with this logit conditioning rather than swapping inputs only at inference. As reported in Table 6a, the logit-conditioned variant outperforms its binary counterpart across all four metrics, confirming that soft confidence carries signals critical for fine-detail recovery. However, this gain does not transfer to in-the-wild videos, where the model overfits to SAM’s specific logit distribution. We therefore adopt binary masks as the default guidance.

SAM logit versus binary mask

Figure 5. SAM logit vs. Binary mask.

Channel vs token concatenation. We compare two strategies for combining the RGB, mask, and noise inputs: channel concatenation, which stacks all three modalities along the channel axis into a single input tensor, and token concatenation, which appends each modality as a separate token stream. The channel-concat variant uses an expanded patch embedding to ingest the stacked input while keeping the rest of the DiT backbone identical to our model. Channel concatenation reduces the token sequence length and therefore the compute cost of self-attention, but as shown in Table 6b, it consistently underperforms token concatenation across all metrics. We attribute this to the loss of modality-specific information when the inputs are collapsed into a single tensor at the input stage.

MethodMADMAD-TMSEGRADCONNDTSSD
with logit1.627240.82560.42472.90482.58431.9372
Ours1.694241.22790.44872.91962.71941.9796

Table 6. Ablation studies on video matting design choices. We evaluate the impact of our proposed components across different configurations. The ablations analyze (a) the advantage of incorporating SAM logits, and (b) channel-wise versus token-wise concatenation. All evaluations are performed on the V-Him60 (Hard) benchmark. The best results are highlighted. (a) Advantage of SAM logit

MethodMADMAD-TMSEGRADCONNDTSSD
Channel2.225354.73690.62334.71193.82872.4183
Token1.692441.91670.42342.98132.72281.9758

Table 6b. (b) Channel vs. Token concat

Number of denoising steps. We evaluate how the number of denoising steps at inference affects matting quality. Following the observation of GenPercept [48] in monocular depth estimation, we find that a single denoising step is sufficient for the diffusion model to convert a binary mask into a high-quality alpha matte. As reported in Table 7, additional denoising steps lead the model to over-refine the matte, degrading both boundary sharpness and overall accuracy. We therefore adopt single-step inference as the default, which also yields a substantial efficiency gain for large-scale video processing (Appendix § 14).

StepsMAD ↓MAD-T ↓MSE ↓GRAD ↓CONN ↓DTSSD ↓
11.668041.73540.40272.96742.67691.9546
21.722142.01930.41382.97082.73891.9479
32.726450.38290.50933.80813.33202.1253
510.757174.60952.09415.149417.56232.6155
1016.6343101.50993.91176.117531.15403.1936

Table 7. Ablation on denoising steps.

Chunk size. Table 8 evaluates chunk sizes on V-HIM60 [19], with the overlap fixed at 2 frames across all settings. A 6-frame chunk outperforms both smaller (3) and larger (12) settings. Small chunks restrict the temporal context available for DiT’s self-attention, whereas large chunks dilute the preserve frames’ influence, reducing stability. A 6-frame chunk optimally balances temporal context with an effective preserve signal, serving as our default.

ChunkMAD ↓MAD-T ↓GRAD ↓CONN ↓DTSSD ↓
32.120646.21313.57783.57762.2120
61.694241.22792.91962.71941.9796
121.790641.62903.03132.88582.0693

Table 8. Ablation on chunk size.

LoRA rank. We ablate the LoRA rank used to adapt the pretrained DiT for video matting. As reported in Table 9, performance improves monotonically as the rank increases, with rank 512 achieving the best results across all six metrics. The lower-rank variants (64 and 128) underperform on boundary-sensitive measures such as Gradient and MAD-T, indicating that mask-to-matte refinement requires sufficient adapter capacity to learn the fine-grained boundary structure absent from the input mask. We therefore adopt rank 512 as our default, which provides the best matting quality while remaining substantially lighter than full fine-tuning of the DiT backbone to preserve generative prior.

RankMAD ↓MAD-T ↓MSE ↓GRAD ↓CONN ↓DTSSD ↓
642.429456.52920.87984.21804.21802.6284
1282.301853.31000.81084.78753.94832.5732
5121.694241.22790.44872.91962.71941.9796

Table 9. Ablation on LoRA rank.

Conclusion

We introduce VideoMaMa++, a diffusion transformer model that leverages generative priors for robust video matting, overcoming data scarcity. VideoMaMa++ introduces preserve and refine tokens that enable temporally consistent matting on long videos, addressing a fundamental limitation of diffusion-based approaches confined to short clips. We demonstrate that VideoMaMa++ achieves state-of-the-art performance across diverse benchmarks while producing fine-grained, temporally consistent results on long in-the-wild videos. An annotation-free analysis further shows that our chunk-wise inference exhibits no measurable discontinuity at chunk boundaries, unlike VideoMaMa processing chunks independently. Nevertheless, VideoMaMa++ is more computationally demanding than feed-forward models and, like all mask-guided methods, depends on the upstream mask track; reducing the DiT inference cost and benchmarking temporal smoothness on real footage are promising future directions. We believe VideoMaMa++ provides a scalable framework bridging the gap between short-clip generation and real-world long-video applications.

Acknowledgments

Appendix Overview

This supplementary material provides additional details on implementation, evaluation, and qualitative results that could not be included in the main paper due to space constraints.

The document is organized as follows:

  • Section A provides additional implementation details, including the training configuration and the list of datasets used to train VideoMaMa++.

  • Section B presents qualitative results for the interactive refinement experiment, illustrating how VideoMaMa++ progressively improves its own predictions across iterations through the preserve and refine token mechanism.

  • Section C reports zero-shot evaluation of VideoMaMa++ on image matting benchmarks, demonstrating that our model generalizes effectively beyond video to single-image settings.

  • Section D discusses annotation noise in the AM-2K benchmark and explains why MAD-T provides a more reliable measure of matting quality than MAD on this dataset.

  • Section E describes the guidance-mask generation protocol shared by all mask-guided methods and reports a single evaluation exception on the YouTubeMatte static_0017 sequence, where SAM3 [3] must be re-initialized at a later frame to capture an object that enters the scene partway through the video, together with results under first-frame initialization

  • Section F introduces an annotation-free test for chunk-boundary discontinuities, which quantifies temporal consistency on in-the-wild videos without ground truth, and validates it on YouTubeMatte.

  • Section G reports the computational cost of VideoMaMa++ and prior methods, including a per-stage runtime breakdown and end-to-end throughput with mask generation.

  • Section H details the reference-anchor experiments, including the anchor-refresh setting and the corruption protocol used to test robustness to a degraded anchor.

  • Section I discusses the limitations of this work: its dependence on the upstream mask track, and the absence of a video matting benchmark that can rigorously evaluate temporal smoothness on real-world footage.

  • Section J discusses the positive and negative societal impacts of mask-guided video matting.

Additional Implementation Details

Training details. We train VideoMaMa++ with an effective batch size of 16 and a learning rate of 1×10−41 \times10^{-4} using the AdamW [31] optimizer. Rather than computing the loss in the latent space, we decode the predicted latents with the VAE decoder and supervise the resulting alpha mattes in pixel space. The training objective is a weighted sum of three terms:

L=λL1LL1+λgradLgrad+λlapLlap,(3)\mathcal{L} = \lambda_{\mathrm{L1}} \mathcal{L}_{\mathrm{L1}} + \lambda_{\mathrm{grad}} \mathcal{L}_{\mathrm{grad}} + \lambda_{\mathrm{lap}} \mathcal{L}_{\mathrm{lap}}, \tag*{(3)}

where LL1\mathcal{L}_{\mathrm{L1}} enforces pixel-wise accuracy, Lgrad\mathcal{L}_{\mathrm{grad}} penalizes differences in spatial gradients to preserve edge sharpness, and Llap\mathcal{L}_{\mathrm{lap}} is a Laplacian loss that emphasizes high-frequency structure such as fine boundaries and hair details. We set λL1=1.0\lambda_{\mathrm{L1}} = 1.0, λgrad=5.0\lambda_{\mathrm{grad}} = 5.0, and λlap=2.0\lambda_{\mathrm{lap}} = 2.0. Training is conducted on 8 NVIDIA H100 GPUs for approximately 2.5 days. A detailed list of the training datasets is provided in Table 10.

CategoryDatasets
ImageDVM [44], AM-2k [25], DAViD [39], P3M-10k [24], RefMatte [26]
VideoCRGNN [47], VideoMatte240K [28], DVM [44]
BackgroundVideoMatting108 [58], DVM [44]

Table 10. Datasets used to train VideoMaMa and SAM2-Matte.

Interactive Refinement Qualitative Results

We provide qualitative results for the interactive refinement experiment in Figure 4a, complementing the quantitative results reported in Table 11. Without modifying the input mask guidance, VideoMaMa++

Iter.MAD ↓MAD-T ↓GRAD ↓CONN ↓DTSSD ↓MSE ↓
11.692441.91672.98132.72281.97580.4234
21.668841.80642.96772.67611.95890.3992
31.663441.79272.96332.66551.95450.3949

Table 11. Ablation on interactive refinement.

progressively improves its own predictions across iterations by alternating preserve and refine assignments within each chunk. As shown in the figure, interactive refinement recovers regions missed in the initial prediction and sharpens fine-grained details along the foreground boundary, drawing on context from adjacent frames through the DiT’s self-attention. This confirms that the gains in Table 11 stem from genuine cross-frame reasoning rather than simple smoothing, and demonstrates that the preserve and refine tokens enable the model to serve as its own corrector at inference time.

Image benchmark

We further evaluate VideoMaMa++ in a zero-shot setting on P3M-10K [24] and AM-2K [25], a portrait image matting benchmark and animal matting benchmark, to assess its generalization beyond video. Guide masks are obtained from SAM3 [3] following the same procedure as in § 4.2. Image matting benchmarks emphasize fine-grained detail recovery at high resolution, posing a stringent test for pixel-level accuracy. As reported in Table 12, VideoMaMa++ achieves state-of-the-art performance against prior portrait matting methods [43, 29, 13], despite not being specifically designed for portrait matting. We note that AM-2K contains ground-truth annotation errors; our method shows inflated MAD scores on this benchmark despite producing visually superior mattes. Additional discussion on Section D.

MethodP3M-500-NPAM-2k
MAD ↓MSE ↓Grad ↓Conn ↓MAD ↓MAD-T ↓Grad ↓
Mask free methods
RVM10.896.5714.9718.81---
SparseMat11.146.3613.4718.13---
GVM8.394.8912.8914.21---
Mask guided methods
SAM35.222.3121.798.376.872993.254027.8649
MaGGIe4.681.5412.077.786.772173.569611.2396
Ours4.231.2310.006.909.168861.03248.3373

Table 12. Quantitative evaluation on P3M-500 and AM-2k datasets.

AM-2K Justification

We observe that the AM-2K [25] ground-truth annotations contain systematic errors that disproportionately penalize fine-detail predictions under the MAD metric. As illustrated in Figure 6, the AM-2K ground truth often lacks detail within foreground regions, despite the predictions correctly recovering them. Because MAD averages absolute differences over the entire image, these annotation gaps inflate the reported error even when the predicted matte is visually superior. MAD-T, by contrast, restricts the evaluation to the transition region defined by the ground-truth trimap, isolating the boundary detail where matting quality matters most. Under this more reliable metric, VideoMaMa++ achieves state-of-the-art performance against all comparison methods, indicating that the apparent MAD gap on AM-2K reflects annotation noise rather than a true performance deficit.

Annotation noise in AM-2K

Figure 6. Annotation noise in AM-2K [25]. The ground-truth alpha mattes in AM-2K often miss fine-grained internal details, that VideoMaMa++ correctly recovers. Because MAD averages pixel-wise error over the entire image, these missing details penalize accurate predictions and inflate the reported error. MAD-T, computed only within the transition region, isolates the matting quality that actually matters and avoids the bias introduced by such annotation gaps.

Algorithm 1 Guidance mask generation, shared by all mask-guided methods.

Require: Frames {It}t=0T−1\{I_t\}_{t=0}^{T-1}, ground-truth mattes {αtgt}t=0T−1\{\alpha_t^{\mathrm{gt}}\}_{t=0}^{T-1}, initialization frame ss (s=0s=0 except static_0017)

Ensure: Binary mask track {Mt}t=0T−1\{M_t\}_{t=0}^{T-1}

  1. m←1[αsgt>τ]m \leftarrow\mathbf{1}[\alpha_s^{\mathrm{gt}} > \tau] ▷ binarize the GT matte, τ=127\tau= 127

  2. J←(Is,I0,I1,…,IT−1)\mathcal{J} \leftarrow(I_s, I_0, I_1, \ldots, I_{T-1}) ▷ prepend a duplicate; s=0s=0 gives {0,0,1,2,…}\{0, 0, 1, 2, \ldots\}

  3. Initialize the SAM3 video predictor on J\mathcal{J} with mask prompt mm at index 0

  4. Propagate forward over J\mathcal{J} to obtain mask logits ℓ0,ℓ1,…,ℓT\ell_0, \ell_1, \ldots, \ell_T

  5. for t=0t = 0 to T−1T - 1 do

  6. Mt←1[ℓt+1>0]M_t \leftarrow\mathbf{1}[\ell_{t+1} > 0] ▷ discard ℓ0\ell_0, the output on the duplicate

  7. end for

  8. return {Mt}t=0T−1\{M_t\}_{t=0}^{T-1}

Guidance Mask Protocol and YouTubeMatte SAM3 Mask

Mask generation protocol. All mask-guided methods, including ours, receive the identical guidance mask track for every sequence, generated by Algorithm 1. We binarize the ground-truth alpha matte of the initialization frame and prepend a duplicate of that frame to the video; for the default first-frame initialization, SAM3 [3] thus processes the frame sequence {0,0,1,2,…}\{0, 0, 1, 2, \ldots\}. The binarized matte is given as a mask prompt on the prepended duplicate, SAM3 propagates it forward over the whole sequence, and we binarize the resulting per-frame mask logits while discarding the output on the duplicate. Every frame’s guidance mask, including that of the initialization frame itself, is therefore a SAM3 prediction rather than the binarized ground truth. The initialization frame is the first frame for every sequence, with the single exception described below. No method therefore receives a privileged mask.

Re-initialized sequence. For all evaluations, the input masks are obtained automatically without human intervention, with one exception. The static_0017 sequence from YouTubeMatte [53] presents a granularity ambiguity at the first frame: a sheet of paper that becomes part of the foreground only enters the scene partway through the video, and is therefore not visible at the moment of mask initialization. As a result, when SAM3 [3] is prompted on the first frame, the resulting mask track captures only the subject and cannot recover the paper once it appears, as shown in Figure 7. Because mask-guided matting models, including MaGGIe [19], VideoMaMa [27], and ours, faithfully follow the granularity defined by the input mask, the paper is consequently excluded from the predicted alpha matte. To resolve this without manual annotation, we initialize SAM3 on a later frame (frame 60) where both the subject and the paper are simultaneously visible, and propagate the prompt across the entire sequence. This re-initialized track is used for all mask-guided methods. We note that the MatAnyone [53, 52] series is not affected by this issue, as it does not rely on an external mask track. We report this exception in the interest of full transparency.

RGB video, ground-truth masks, and SAM3 masks for initialization on the first frame and on frame 60

Figure 7. Re-initialization of SAM3 on YouTubeMatte static_0017. Initializing SAM3 [3] on the first frame fails to track a sheet of paper that the subject begins holding mid-sequence, since the object is not yet visible at initialization. Initializing on a later frame where both are simultaneously visible recovers the correct mask track.

Results under first-frame initialization. Table 13 compares two settings on YouTubeMatte: the re-initialized track used in the main paper, and first-frame initialization for every sequence. All mask-guided methods degrade under first-frame initialization, since the sheet of paper is then missing from their guidance, and VideoMaMa++ remains the best method in both settings. The degradation itself reflects the behavior described above: the predicted matte follows the granularity of its guidance mask. Because a guidance mask is cheap to inspect and correct while a matte is not, we regard this faithful mask following as a desirable property for practical pipelines.

MetricInit.MGMMGM-IWMaGGIeMaGGIe-FTVideoMaMaOurs
MADFirst-frame3.872.872.292.301.881.61
Re-init3.592.411.671.521.411.15
MSEFirst-frame0.780.830.930.950.760.69
Re-init0.530.380.500.370.300.23
GradFirst-frame4.374.377.026.424.203.31
Re-init4.274.255.115.364.083.27
dtSSDFirst-frame1.611.401.641.581.331.20
Re-init1.571.371.461.471.311.17

Table 13. Effect of re-initializing YouTubeMatte static_0017. “Re-init”: SAM3 re-initialized at frame 60 for static_0017, as used in Table 1. “First-frame”: SAM3 initialized on the first frame for every sequence. All metrics ↓.

Annotation-free Temporal Consistency

Ground-truth alpha mattes are unavailable for long real-world footage, so reference-based temporal metrics such as dtSSD cannot be computed on in-the-wild videos (§ 16). Chunk-wise inference, however, has a characteristic failure mode that can be measured without annotation: a discontinuity where separately processed chunks meet. We therefore introduce a ground-truth-free test for such discontinuities.

Seam signal. Given a predicted matte sequence {α^t}\{\hat{\alpha}_t\}, we compute the frame-to-frame change

dt=A(∣α^t+1−α^t∣),d~t=dt−med⁡(dt−w,…,dt+w),(4)d_t = \mathcal{A}\left(\lvert\hat{\alpha}_{t+1}-\hat{\alpha}_t\rvert\right), \qquad\tilde{d}_t = d_t - \operatorname{med}\left(d_{t-w},\ldots,d_{t+w}\right), \tag*{(4)}

where A\mathcal{A} aggregates over pixels, either as the mean over foreground pixels (fg-mean) or as the maximum (MAX). Subtracting a running median removes change caused by genuine motion, so d~t\tilde{d}_t retains only spikes above the local neighborhood.

Chunk cadence. To remove any confound from the two models tiling time differently, we run VideoMaMa [27] and VideoMaMa++ with the same chunk cadence: a 6-frame first chunk followed by 4 new frames per chunk. With frames indexed from 0 and transition tt denoting the change from frame tt to frame t+1t+1, seams fall at transitions S={5,9,13,…}\mathcal{S} = \{5, 9, 13, \ldots\} for both models. A 100-frame YouTubeMatte clip thus has 99 transitions, of which 34 are seams {5,9,…,97}\{5, 9, \ldots, 97\} and 75 are interior. VideoMaMa processes each chunk without overlap, whereas VideoMaMa++ additionally conditions each chunk on its preserve-token frames.

Statistics. We test whether the spikes in d~t\tilde{d}_t recur at the chunk period with two statistics. First, we compute the autocorrelation of d~t\tilde{d}_t per clip at the seam period (lag 4) and at twice the seam period (lag 8), and average it over clips. Second, we call a clip seam-elevated if the mean of d~t\tilde{d}_t over t∈St \in\mathcal{S} exceeds its mean over interior transitions, and refer to the gap between the two as its seam contrast.

Under the null hypothesis of no chunk-boundary discontinuity, a clip is seam-elevated with probability 1/21/2, which the ground-truth control confirms empirically (Table 14). For the seam-elevated counts, we report p-values from an exact one-sided sign test against this chance level.

Table 14: Annotation-free seam test. Both models run at identical chunk seams. Left: ground-truth validation on YouTubeMatte (64 clips; 24 seam vs. 75 interior transitions per clip). Entries count clips whose mean seam transition exceeds their mean interior transition (chance: 32/64). Right: 16 in-the-wild clips (fg-mean), for which no ground truth exists. Higher autocorrelation at the seam lag and more seam-elevated clips indicate a stronger chunk-boundary discontinuity. p-values for seam-elevated clips are from an exact one-sided sign test against chance.

YouTubeMatteIn-the-wild (no GT)
ModelSeam-elevated clips: MAXSeam-elevated clips: fg-meanAutocorr.: lag 4Autocorr.: lag 8Seam-elevated clips
VideoMaMa [27]62/64<br>p=1.1×10−16p=1.1 \times10^{-16}63/64<br>p=3.5×10−18p=3.5 \times10^{-18}+0.35<br>p=5×10−3p=5 \times10^{-3}+0.34<br>p=6×10−3p=6 \times10^{-3}14/16<br>p=2.1×10−3p=2.1 \times10^{-3}
GT (no chunking)34/64<br>p=0.35p=0.3532/64<br>p=0.55p=0.55–––
VideoMaMa++ (Ours)18/64<br>p>0.99p>0.9918/64<br>p>0.99p>0.99+0.03<br>p=0.66p=0.66+0.11<br>p=0.12p=0.127/16<br>p=0.77p=0.77

Table 14. Annotation-free seam test.

Validation on YouTubeMatte. We first validate the test on YouTubeMatte, where ground truth is available (Table 14, left). VideoMaMa’s seam transitions exceed its interior transitions in nearly all clips under both summaries. As a control, we apply the identical test to the ground-truth mattes at the same transition positions. Since the ground truth involves no chunking, any elevation found there would indicate that the test responds to content rather than to chunk boundaries; it detects nothing, with counts at the chance level. VideoMaMa++ shows no seam elevation: its seams exceed its interior transitions in fewer clips than expected by chance under both summaries. Per clip, VideoMaMa’s seam contrast exceeds that of VideoMaMa++ in 62–64 of 64 clips (sign test, p<10−15p < 10^{-15}).

In-the-wild results. On the 16 in-the-wild videos (Table 14, right), the detrended signal of VideoMaMa autocorrelates at the chunk period (lags 4 and 8), and its seam transitions exceed its interior transitions in most clips. At identical seams, VideoMaMa++ shows none of this structure: neither autocorrelation is significant, and the number of seam-elevated clips is consistent with chance. These results quantitatively corroborate Figure 3: at matched boundaries, VideoMaMa exhibits a chunk-boundary discontinuity that VideoMaMa++ does not.

Robustness and scope. These conclusions are unchanged across alternative difference statistics and detrending windows of 3 to 11 frames. The test targets only discontinuities at chunk boundaries: it measures neither per-frame accuracy nor flicker within a chunk, and it applies only to methods that process video in chunks, which is why the comparison is restricted to VideoMaMa.

Computational Cost

Table 15 reports throughput, peak memory, and compute on a single H100 from 2562256^2 to 204822048^2. VideoMaMa++ is the most expensive of the compared methods: at 102421024^2 it runs at 1.17 FPS with 11.3 GB of peak memory, compared to 3.41 FPS and 7.9 GB for VideoMaMa, while the feed-forward baselines run at 15–60 FPS. Table 16 breaks down this cost by stage. At 102421024^2, the single DiT forward pass accounts for 616 ms of the 853 ms per output frame, with the VAE encoder and decoder taking 139 ms and 98 ms. SAM3 mask propagation runs once per frame at a fixed resolution and adds 45.4 ms per frame regardless of the matting resolution, giving an end-to-end rate of 1.11 FPS at 102421024^2 and 9.4 FPS at 2562256^2. Since the DiT pass dominates, single-step inference (Table 7) is essential for keeping this cost practical, as each additional denoising step would add a full DiT evaluation per window.

Table 15: Computational cost on a single H100 at resolutions 2562256^2 to 204822048^2 (1K=102421\mathrm{K}=1024^2, 2K=204822\mathrm{K}=2048^2), excluding mask generation for all methods. For VideoMaMa++, the cost of each 6-frame window is amortized over its 4 new frames, so FPS accounts for the recomputed overlap frames. MatAnyone/MatAnyone 2 and MGM/MGM-ITW share architectures and are listed once.

FPS ↑Peak memory (GB) ↓TFLOPs ↓
Method2565127681K2K2565127681K2K2565127681K2K
MGMatting66.7166.2363.5660.4418.050.580.841.371.985.410.0360.1150.2400.4111.55
MaGGIe23.219.320.015.07.50.521.182.524.8816.010.0210.0830.1870.3321.33
MatAnyone43.642.038.934.67.50.330.671.323.4322.400.0300.1240.2890.5422.94
VideoMaMa27.5613.646.063.410.714.755.366.417.8817.051.606.5515.428.9159
VideoMaMa++16.46.92.61.170.113.735.177.8611.3335.594.2524.885.42252920

Table 15.

Table 16: Per-output-frame cost of VideoMaMa++ (ms) on a single H100, including SAM3 mask propagation. Matting-stage costs are measured per 6-frame window and divided by its 4 new frames. E2E FPS = 1000 / (SAM3 + matting total).

Res.SAM3VAE Enc.DiT (1-step)VAE Dec.Matting totalMatting FPSE2E FPS
2562256^245.424.920.115.960.916.49.4
5122512^245.437.979.227.5144.66.95.3
7682768^245.478.3254.355.8388.42.62.3
102421024^245.4139.0616.197.7852.81.171.11
204822048^245.4681.07602.1448.68731.70.110.11

Table 16.

Reference Anchor Analysis Details

This section details the reference-anchor experiments of Table 3, all conducted on V-HIM60 [19].

Anchor choice and refresh. The first frame may not be representative of later frames. We therefore replace it as the anchor with a random frame or the last frame of the first chunk, which leaves performance nearly unchanged across all metrics. Because the foreground may also change in appearance over long sequences, we further re-anchor to a recent frame every 3 chunks. V-HIM60 sequences contain substantial pose, scale, and appearance variation, yet refreshing yields nearly identical quality to the default setting, so a first-frame anchor does not become stale on this benchmark. Refreshing nevertheless remains available at negligible cost for footage whose appearance changes more drastically.

Corruption protocol. We corrupt the input of the first frame, which serves as the anchor, rather than the propagated matte. Because the anchor is the model’s own first-frame prediction, a corrupted input yields a degraded anchor matte that is propagated to all later chunks. We consider three corruptions:

  • Poor guidance mask. We erode (under-segmentation, E) or dilate (over-segmentation, D) the first-frame guidance mask using grayscale morphology with a square kernel of k∈{5,21}k \in\{5,21\} px.

  • Motion blur. We apply a horizontal motion-blur kernel of k∈{7,15,25}k \in\{7,15,25\} px to the first-frame RGB (B), so the model must matte a motion-blurred appearance.

  • Occlusion. We composite a real animal foreground from AM-2K [25] over the subject using its ground-truth matte, enlarging it until at least 99% of the subject is covered, and zero the occluded region of the guidance mask so that it remains consistent with the now-invisible subject (Occ.).

We exclude the corrupted first frame from evaluation, so the metrics measure how the degraded anchor propagates to the rest of the video. This matters most under occlusion, where the input RGB and the ground-truth matte of the first frame disagree. It is also why the clean baseline in Table 3b differs slightly from the main results: the only difference is the excluded clean first frame.

Results. Across all corruptions, performance degrades only marginally relative to the clean baseline. Full occlusion is the most severe case, followed by motion blur and poor guidance masks, and larger kernels generally lead to slightly larger degradation. Even with a fully occluded anchor, the model remains close to its clean-anchor performance, indicating that a degraded anchor has only a limited effect on the rest of the video.

Limitation

Dependence on the mask track. VideoMaMa++ deliberately separates tracking, delegated to a mask generator such as SAM3 [3], from matting, so its robustness is bounded by the quality of the mask track. Errors confined to individual frames of a chunk, such as missing thin structures or drift under motion blur, can be corrected through cross-frame attention to neighboring frames or through interactive refinement (Section B). However, if the tracker locks onto the wrong object for an entire sequence, the matte follows that wrong track. This limitation is shared by all mask-guided matting methods.

Evaluating temporal smoothness on real video. A key limitation of this work, and of video matting research more broadly, is the absence of a benchmark that can rigorously evaluate temporal smoothness on real video. Existing benchmarks [28, 53, 27] are constructed by compositing per-frame foregrounds onto random backgrounds, which provides accurate per-frame ground truth but does not capture the temporal dynamics of naturally captured footage. As a result, temporal consistency on real-world videos is still largely assessed qualitatively. The annotation-free seam test of Section F quantifies one specific failure mode, discontinuities at chunk boundaries, without ground truth. However, it measures neither per-frame accuracy nor flicker within a chunk, and it applies only to methods that process video in chunks, so it cannot compare the overall temporal behavior of arbitrary methods. Developing a benchmark with reliable ground-truth temporal smoothness, ideally captured rather than composited, remains an open problem for the community.

Societal Impact

Positive Societal Impact. Our mask-guided video matting framework can substantially benefit creative industries, education, and communication. By reducing the manual effort required for high-quality video matting, the method lowers the barrier to professional-grade video production, enabling independent creators, educators, and small studios to produce polished content without specialized expertise or costly proprietary software. In film and visual effects, it can accelerate labor-intensive rotoscoping workflows, allowing artists to focus on creative decisions rather than frame-by-frame manual labeling. The technology also improves the quality of background replacement in video conferencing and virtual classrooms, supporting remote collaboration and accessibility-oriented applications such as isolating speakers or interpreters in educational content.

Negative Societal Impact. Despite these benefits, high-quality video matting can be misused. As a core component in video manipulation pipelines, improved matting may facilitate the creation of more convincing deepfakes and manipulated media, contributing to misinformation and the erosion of public trust in video evidence.

References

  1. [1]Yanrui Bin, Wenbo Hu, Haoyuan Wang, Xinya Chen, and Bing Wang. Normalcrafter: Learning temporally consistent normals from video diffusion priors. arXiv preprint arXiv:2504.11427, 2025.arxiv.org/abs/2504.11427
  2. [2]Andreas Blattmann, Tim Dockhorn, Sumith Kulal, Daniel Mendelevitch, Maciej Kilian, Dominik Lorenz, Yam Levi, Zion English, Vikram Voleti, Adam Letts, et al. Stable video diffusion: Scaling latent video diffusion models to large datasets. arXiv preprint arXiv:2311.15127, 2023.arxiv.org/abs/2311.15127
  3. [3]Nicolas Carion, Laura Gustafson, Yuan-Ting Hu, Shoubhik Debnath, Ronghang Hu, Didac Suris, Chaitanya Ryali, Kalyan Vasudev Alwala, Haitham Khedr, Andrew Huang, et al. Sam 3: Segment anything with concepts. arXiv preprint arXiv:2511.16719, 2025.arxiv.org/abs/2511.16719
  4. [4]Sumit Chaturvedi, Mengwei Ren, Yannick Hold-Geoffroy, Jingyuan Liu, Julie Dorsey, and Zhixin Shu. Synlight: Portrait relighting with diffusion model by learning to re-render synthetic faces. In Proceedings of the Computer Vision and Pattern Recognition Conference, pages 369–379, 2025.arxiv.org/abs/2501.09756
  5. [5]Boyuan Chen, Diego Martí Monsó, Yilun Du, Max Simchowitz, Russ Tedrake, and Vincent Sitzmann. Diffusion forcing: Next-token prediction meets full-sequence diffusion. Advances in Neural Information Processing Systems, 37:24081–24125, 2024.arxiv.org/abs/2407.01392
  6. [6]Ho Kei Cheng, Seoung Wug Oh, Brian Price, Joon-Young Lee, and Alexander Schwing. Putting the object back into video object segmentation. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 3151–3161, 2024.arxiv.org/abs/2310.12982
  7. [7]Ho Kei Cheng and Alexander G Schwing. Xmem: Long-term video object segmentation with an atkinson-shiffrin memory model. In European conference on computer vision, pages 640–658. Springer, 2022.arxiv.org/abs/2207.07115
  8. [8]Jun Myeong Choi, Annie Wang, Pieter Peers, Anand Bhattad, and Roni Sengupta. Scribblelight: Single image indoor relighting with scribbles. In Proceedings of the Computer Vision and Pattern Recognition Conference, pages 5720–5731, 2025.arxiv.org/abs/2411.17696
  9. [9]Justin Cui, Jie Wu, Ming Li, Tao Yang, Xiaojie Li, Rui Wang, Andrew Bai, Yuanhao Ban, and Cho-Jui Hsieh. Self-forcing++: Towards minute-scale high-quality video generation. arXiv preprint arXiv:2510.02283, 2025.arxiv.org/abs/2510.02283
  10. [10]Yusuf Dalva, Yijun Li, Qing Liu, Nanxuan Zhao, Jianming Zhang, Zhe Lin, and Pinar Yanardag. Layerfusion: Harmonized multi-layer text-to-image generation with generative priors. arXiv preprint arXiv:2412.04460, 2024.arxiv.org/abs/2412.04460
  11. [11]Mikhail Erofeev, Yury Gitman, Dmitriy S Vatolin, Alexey Fedorov, and Jue Wang. Perceptually motivated benchmark for video matting. In BMVC, volume 1, page 2, 2015.DOI
  12. [12]Wenshuo Gao, Xicheng Lan, and Shuai Yang. Anyportal: Zero-shot consistent video background replacement. In Proceedings of the IEEE/CVF International Conference on Computer Vision, pages 18990–18999, 2025.arxiv.org/abs/2509.07472
  13. [13]Yongtao Ge, Kangyang Xie, Guangkai Xu, Li Ke, Mingyu Liu, Longtao Huang, Hui Xue, Hao Chen, and Chunhua Shen. Generative video matting. In Proceedings of the Special Interest Group on Computer Graphics and Interactive Techniques Conference Papers, pages 1–10, 2025.DOI
  14. [14]Edward J Hu, Yelong Shen, Phillip Wallis, Zeyuan Allen-Zhu, Yuanzhi Li, Shean Wang, Liang Wang, Weizhu Chen, et al. Lora: Low-rank adaptation of large language models. Iclr, 1(2):3, 2022.arxiv.org/abs/2106.09685
  15. [15]Wenbo Hu, Xiangjun Gao, Xiaoyu Li, Sijie Zhao, Xiaodong Cun, Yong Zhang, Long Quan, and Ying Shan. Depthcrafter: Generating consistent long depth sequences for open-world videos. In Proceedings of the Computer Vision and Pattern Recognition Conference, pages 2005–2015, 2025.arxiv.org/abs/2409.02095
  16. [16]Longfei Huang, Yu Liang, Hao Zhang, Jinwei Chen, Wei Dong, Lunde Chen, Wanyu Liu, Bo Li, and Peng-Tao Jiang. Sdmatte: Grafting diffusion models for interactive matting. arXiv preprint arXiv:2508.00443, 2025.arxiv.org/abs/2508.00443
  17. [17]Wei-Lun Huang and Ming-Sui Lee. End-to-end video matting with trimap propagation. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 14337–14347, 2023.DOI
  18. [18]Xun Huang, Zhengqi Li, Guande He, Mingyuan Zhou, and Eli Shechtman. Self forcing: Bridging the train-test gap in autoregressive video diffusion. arXiv preprint arXiv:2506.08009, 2025.arxiv.org/abs/2506.08009
  19. [19]Chuong Huynh, Seoung Wug Oh, Abhinav Shrivastava, and Joon-Young Lee. Maggie: Masked guided gradual human instance matting. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 3870–3879, 2024.arxiv.org/abs/2404.16035
  20. [20]Bingxin Ke, Anton Obukhov, Shengyu Huang, Nando Metzger, Rodrigo Caye Daudt, and Konrad Schindler. Repurposing diffusion-based image generators for monocular depth estimation. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 9492–9502, 2024.arxiv.org/abs/2312.02145
  21. [21]Zhanghan Ke, Jiayu Sun, Kaican Li, Qiong Yan, and Rynson WH Lau. Modnet: Real-time trimap-free portrait matting via objective decomposition. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 36, pages 1140–1147, 2022.arxiv.org/abs/2011.11961
  22. [22]Alexander Kirillov, Eric Mintun, Nikhila Ravi, Hanzi Mao, Chloe Rolland, Laura Gustafson, Tete Xiao, Spencer Whitehead, Alexander C Berg, Wan-Yen Lo, et al. Segment anything. In Proceedings of the IEEE/CVF international conference on computer vision, pages 4015–4026, 2023.arxiv.org/abs/2304.02643
  23. [23]Jiachen Li, Vidit Goel, Marianna Ohanyan, Shant Navasardyan, Yunchao Wei, and Humphrey Shi. Vm-former: End-to-end video matting with transformer. In Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision, pages 6678–6687, 2024.
  24. [24]Jizhizi Li, Sihan Ma, Jing Zhang, and Dacheng Tao. Privacy-preserving portrait matting. In Proceedings of the 29th ACM international conference on multimedia, pages 3501–3509, 2021.
  25. [25]Jizhizi Li, Jing Zhang, Stephen J Maybank, and Dacheng Tao. Bridging composite and real: towards end-to-end deep image matting. International Journal of Computer Vision, 130(2):246–266, 2022.arxiv.org/abs/2010.16188
  26. [26]Jizhizi Li, Jing Zhang, and Dacheng Tao. Referring image matting. In Proceedings of the IEEE Computer Vision and Pattern Recognition, 2023.
  27. [27]Sangbeom Lim, Seoung Wug Oh, Jiahui Huang, Heeji Yoon, Seungryong Kim, and Joon-Young Lee. Videomama: Mask-guided video matting via generative prior. arXiv preprint arXiv:2601.14255, 2026.arxiv.org/abs/2601.14255
  28. [28]Shanchuan Lin, Andrey Rybtsеv, Soumyadip Sengupta, Brian L Curless, Steven M Seitz, and Ira Kemelmacher-Shlizerman. Real-time high-resolution background matting. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 8762–8771, 2021.arxiv.org/abs/2012.07810
  29. [29]Shanchuan Lin, Linjie Yang, Imran Saleemi, and Soumyadip Sengupta. Robust high-resolution video matting with temporal guidance. In Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision, pages 238–247, 2022.arxiv.org/abs/2108.11515
  30. [30]Kunhao Liu, Wenbo Hu, Jiale Xu, Ying Shan, and Shijian Lu. Rolling forcing: Autoregressive long video diffusion in real time. arXiv preprint arXiv:2509.25161, 2025.arxiv.org/abs/2509.25161
  31. [31]Ilya Loshchilov and Frank Hutter. Decoupled weight decay regularization. arXiv preprint arXiv:1711.05101, 2017.arxiv.org/abs/1711.05101
  32. [32]Yuexiao Ma, Xuzhe Zheng, Jing Xu, Xiwei Xu, Feng Ling, Xiawu Zheng, Huafeng Kuang, Huixia Li, Xing Wang, Xuefeng Xiao, et al. Flow caching for autoregressive video generation. arXiv preprint arXiv:2602.10825, 2026.arxiv.org/abs/2602.10825
  33. [33]Kwanyong Park, Sanghyun Woo, Seoung Wug Oh, In So Kweon, and Joon-Young Lee. Mask-guided matting in the wild. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, 2023.DOI
  34. [34]William Peebles and Saining Xie. Scalable diffusion models with transformers. In Proceedings of the IEEE/CVF international conference on computer vision, pages 4195–4205, 2023.arxiv.org/abs/2212.09748
  35. [35]Nikhila Ravi, Valentin Gabeur, Yuan-Ting Hu, Ronghang Hu, Chaitanya Ryali, Tengyu Ma, Haitham Khedr, Roman Rädlе, Chloe Rolland, Laura Gustafson, et al. Sam 2: Segment anything in images and videos. arXiv preprint arXiv:2408.00714, 2024.arxiv.org/abs/2408.00714
  36. [36]Mengwei Ren, Wei Xiong, Jae Shin Yoon, Zhixin Shu, Jianming Zhang, HyunJoon Jung, Guido Gerig, and He Zhang. Relightful harmonization: Lighting-aware portrait background replacement. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 6452–6462, 2024.arxiv.org/abs/2312.06886
  37. [37]Christoph Rhemann, Carsten Rother, Jue Wang, Margrit Gelautz, Pushmeet Kohli, and Pamela Rott. A perceptually motivated online benchmark for image matting. In 2009 IEEE conference on computer vision and pattern recognition, pages 1826–1833. IEEE, 2009.
  38. [38]Robin Rombach, Andreas Blattmann, Dominik Lorenz, Patrick Esser, and Björn Ommer. High-resolution image synthesis with latent diffusion models. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 10684–10695, 2022.arxiv.org/abs/2112.10752
  39. [39]Fatemeh Saleh, Sadegh Aliakbarian, Charlie Hewitt, Lohit Petikam, Antonio Criminisi, Thomas J Cashman, Tadas Baltrušaitis, et al. David: Data-efficient and accurate vision models from synthetic data. arXiv preprint arXiv:2507.15365, 2025.arxiv.org/abs/2507.15365
  40. [40]Hongje Seong, Seoung Wug Oh, Brian Price, Euntai Kim, and Joon-Young Lee. One-trimap video matting. In European Conference on Computer Vision, pages 430–448. Springer, 2022.
  41. [41]Jiahao Shao, Yuanbo Yang, Hongyu Zhou, Youmin Zhang, Yujun Shen, Vitor Guizilini, Yue Wang, Matteo Poggi, and Yiyi Liao. Learning temporally consistent video depth from video diffusion priors. In Proceedings of the Computer Vision and Pattern Recognition Conference, pages 22841–22852, 2025.arxiv.org/abs/2406.01493
  42. [42]Jianlin Su, Murtadha Ahmed, Yu Lu, Shengfeng Pan, Wen Bo, and Yunfeng Liu. Roformer: Enhanced transformer with rotary position embedding. Neurocomputing, 568:127063, 2024.arxiv.org/abs/2104.09864
  43. [43]Yanan Sun, Chi-Keung Tang, and Yu-Wing Tai. Ultrahigh resolution image/video matting with spatio-temporal sparsity. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pages 14112–14121, June 2023.DOI
  44. [44]Yanan Sun, Guanzhi Wang, Qiao Gu, Chi-Keung Tang, and Yu-Wing Tai. Deep video matting via spatio-temporal alignment and aggregation. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 6975–6984, 2021.arxiv.org/abs/2104.11208
  45. [45]Team Wan, Ang Wang, Baole Ai, Bin Wen, Chaojie Mao, Chen-Wei Xie, Di Chen, Feiwu Yu, Haiming Zhao, Jianxiao Yang, et al. Wan: Open and advanced large-scale video generative models. arXiv preprint arXiv:2503.20314, 2025.arxiv.org/abs/2503.20314
  46. [46]Junying Wang, Jingyuan Liu, Xin Sun, Krishna Kumar Singh, Zhixin Shu, He Zhang, Jimei Yang, Nanxuan Zhao, Tuanfeng Y Wang, Simon S Chen, et al. Comprehensive relighting: Generalizable and consistent monocular human relighting and harmonization. In Proceedings of the Computer Vision and Pattern Recognition Conference, pages 380–390, 2025.arxiv.org/abs/2504.03011
  47. [47]Tiantian Wang, Sifei Liu, Yapeng Tian, Kai Li, and Ming-Hsuan Yang. Video matting via consistency-regularized graph neural networks. In Proceedings of the IEEE/CVF International Conference on Computer Vision, pages 4902–4911, 2021.DOI
  48. [48]Guangcai Xu, Yongtao Ge, Mingyu Liu, Chengxiang Fan, Kangyang Xie, Zhiye Zhao, Hao Chen, and Chunhua Shen. What matters when repurposing diffusion models for general dense perception tasks? arXiv preprint arXiv:2403.06090, 2024.arxiv.org/abs/2403.06090
  49. [49]Shaocong Xu, Songlin Wei, Qizhe Wei, Zheng Geng, Hong Li, Licheng Shen, Qianpu Sun, Shu Han, Bin Ma, Bohan Li, et al. Diffusion knows transparency: Repurposing video diffusion for transparent object depth and normal estimation. arXiv preprint arXiv:2512.23705, 2025.arxiv.org/abs/2512.23705
  50. [50]Tian-Xing Xu, Xiangjun Gao, Wenbo Hu, Xiaoyu Li, Song-Hai Zhang, and Ying Shan. Geometrycrafter: Consistent geometry estimation for open-world videos with diffusion priors. In Proceedings of the IEEE/CVF International Conference on Computer Vision, pages 6632–6644, 2025.arxiv.org/abs/2504.01016
  51. [51]Jinrui Yang, Qing Liu, Yijun Li, Soo Ye Kim, Daniil Pakhomov, Mengwei Ren, Jianming Zhang, Zhe Lin, Cihang Xie, and Yuyin Zhou. Generative image layer decomposition with visual effects. In Proceedings of the Computer Vision and Pattern Recognition Conference, pages 7643–7653, 2025.arxiv.org/abs/2411.17864
  52. [52]Peiqing Yang, Shangchen Zhou, Kai Hao, and Qingyi Tao. MatAnyone 2: Scaling video matting via a learned quality evaluator. In CVPR, 2026.arxiv.org/abs/2512.11782
  53. [53]Peiqing Yang, Shangchen Zhou, Jixin Zhao, Qingyi Tao, and Chen Change Loy. Matanyone: Stable video matting with consistent memory propagation. In Proceedings of the Computer Vision and Pattern Recognition Conference, pages 7299–7308, 2025.arxiv.org/abs/2501.14677
  54. [54]Shuai Yang, Wei Huang, Ruihang Chu, Yicheng Xiao, Yuyang Zhao, Xianbang Wang, Muyang Li, Enze Xie, Yingcong Chen, Yao Lu, et al. Longlive: Real-time interactive long video generation. arXiv preprint arXiv:2509.22622, 2025.arxiv.org/abs/2509.22622
  55. [55]Tianwei Yin, Qiang Zhang, Richard Zhang, William T Freeman, Fredo Durand, Eli Shechtman, and Xun Huang. From slow bidirectional to fast autoregressive video diffusion models. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 22963–22974, 2025.arxiv.org/abs/2412.07772
  56. [56]Jianshu Zeng, Yuxuan Liu, Yutong Feng, Chenxuan Miao, Zixiang Gao, Jiwang Qu, Jianz​​hang Zhang, Bin Wang, and Kun Yuan. Lumen: Consistent video relighting and harmonious background replacement with video generative models. arXiv preprint arXiv:2508.12945, 2025.arxiv.org/abs/2508.12945
  57. [57]Hongfei Zhang, Harold Haodong Chen, Chenfei Liao, Jing He, Zixin Zhang, Haodong Li, Yihao Liang, Kanghao Chen, Bin Ren, Xu Zheng, et al. Dvd: Deterministic video depth estimation with generative priors. arXiv preprint arXiv:2603.12250, 2026.arxiv.org/abs/2603.12250
  58. [58]Yunke Zhang, Chi Wang, Miaomiao Cui, Peiran Ren, Xuansong Xie, Xian-Sheng Hua, Hujun Bao, Qixing Huang, and Weiwei Xu. Attention-guided temporally coherent video object matting. In Proceedings of the 29th ACM International Conference on Multimedia, pages 5128–5137, 2021.DOI

Paper details

vlnc:W_n2ku7bua
v1 · latestHistory (1)

published · Fresh — added to the Hub within the last 30 days

added ·

Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

CC BY 4.0

Original source

  • Computer Science

Not recorded for this paper · View statement →

Looking for related papers…
Contents