- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
Context-conditioned neural video codecs such as the DCVC family achieve strong rate-distortion performance. Under packet loss, however, the receiver may infer a different entropy-coding distribution from damaged hyperprior, temporal, or cross-group context, which corrupts symbols decoded from intact payloads and propagates damage across frames, whereas existing loss-resilient codecs avoid this by giving up rich context modeling. The paper formalizes “entropy-condition locality” and proposes SEAL, which transmits the sender’s staged-refined entropy scale as packet-local side information bound to each residual unit so that both endpoints select identical CDFs, keeps staged context refinement on the sender side only, and trains along separate clean-sender and packet-erased-receiver trajectories.
Critical strengths
The paper isolates a concrete and underappreciated failure mode with a clean causal intervention in Section 2.3 and Appendix E.4. Holding the retained payload bytes and loss masks fixed and substituting only the sender CDF indexes recovers 5.64, 4.89, 3.69, with a positive effect on all seven videos.
An efficient loss-resilient codec is most convincingly supported by the unified MTU transport experiment, where all overhead is charged and the baseline uses real FEC with concealment.
Dual-trajectory training is supported by the 128 frame evaluation in Section 4.5, where SEAL’s loss-induced quality deficit grows more slowly than the control’s when each model is compared with its own clean run. The smaller drift of the receiver’s reference state matches the mechanism the training is designed to address.
Critical weaknesses
The claim that SEAL preserves the compression benefit of context modeling is not verified, because its clean efficiency is never compared with the original backbone or with a conventional codec without FEC. The design also turns context the receiver once shared for free into side information that costs bits, and the ablation in Section 4.3 suggests this cost is not small.
No experiment compares SEAL with a simpler way of obtaining locality on the same backbone, such as placing each hyperprior unit in the same packet as its residual. It therefore remains unclear whether transmitting a separately refined scale is necessary for the reported gains.
The main experiments configure the FEC baselines in ways that likely disadvantage them, including high fixed redundancy, disabled concealment, and burst matching that favors SEAL’s smaller packets. Under the fairer unified transport setup the advantage disappears at low loss, so the headline gains are likely overstated.
The main results cover only short sequences starting from a reliably delivered I-frame. This drift is also compared only against a weak control, so both long-session robustness and the specific value of dual-trajectory training remain uncertain.
Questions for authors
How does SEAL’s clean compression efficiency compare with the original DCVC-RT and with H.265 without FEC?
Evaluating longer sequences with periodic refresh or feedback would clarify how SEAL behaves in realistic long sessions.
4 comments
A short note on why we use H.265+FEC as the reference, and how its configuration was set.
When we started this work, existing methods fell into two camps. DCVC-RT compresses very well on a clean channel but degrades quickly once packets are lost, while GRACE handles loss well but needs a much higher clean rate (Fig. 1). Practical delivery needs both, so we first looked for the existing method with the best overall balance between the two and used it as the reference. Among the methods we evaluated, H.265+FEC gave the best overall balance: on a clean channel GRACE needs about 81% more rate than it, and under loss the average BD-PSNR of GRACE and H.264+FEC relative to it in Table 2 is −0.26 dB and −0.85 dB, respectively. H.265 without FEC needs fewer bits on a clean channel, but it cannot recover lost data, so it cannot serve as a reference for loss-resilient schemes. The GRACE paper also uses H.265 with FEC as its main comparison.
The relatively high redundancy in the main experiments was not chosen to weaken the baseline either. Operating points were selected by a rate rule alone, without reference to any quality measure (Appendix D.6). A supplementary screening shows that, over the tested mixture of loss conditions, higher redundancy actually helps H.265+FEC: in the middle-rate region, raising α from 0.5 to 0.8 improves mean PSNR by 1.67 dB, and raising it to 1.0 adds another 1.38 dB. Only under mild loss such as IID 10% does lower redundancy do slightly better. This matches your observation that the advantage shrinks at low loss, which is why our previous comment selected the optimal redundancy separately for each loss rate.
How the methods compare at different rates can be seen in Fig. 7: the 0% loss endpoint of each panel gives the clean quality in the low, middle and high rate regions. The clean BD-rates in our first response were computed from the clean RD curves of the methods over their shared quality range, and summarize the average rate gap between the curves. The revision will plot the curves themselves.
Thank you for the detailed responses and additional experiments.
The rebuttal confirms rather than resolves my main concern. SEAL’s clean efficiency falls well behind both the original backbone and conventional codecs, yet the paper still claims to retain the compression benefit of context modeling.
The additional experiments do not fully address the locality and baseline concerns. They do show that SEAL’s advantage holds under heavy and bursty loss, and I appreciate this.
The promised changes are substantial. Because no revised manuscript was uploaded, I cannot judge how these changes would actually be reflected in the paper. I find the diagnosis of entropy-condition mismatch valuable and encourage resubmission with narrowed claims.
I will keep my score at 2.
Thank you for your reply, and for finding the diagnosis of entropy-condition mismatch valuable. A brief final note on how we arrived at this design, and why we agree with narrowing the claims.
Network delivery requires splitting each frame into packets, and we first tried two straightforward ways. If DCVC-RT is only split into packets for transport, the receiver still decodes from the whole-frame hyperprior and context, so clean efficiency is kept, but once any packet is lost the scales can differ between the two ends and even intact packets are decoded incorrectly; loss-aware training does not remove this. If each packet is instead coded fully independently, as in GRACE, decoding is robust, but the conditional modeling that makes the DCVC family efficient is largely given up. SEAL tries to sit between the two: each packet stays independently entropy-decodable, while the sender can still use context. This is what we meant by "retaining the compression benefit of context modeling".
The clean results show that this recovers only part of the benefit. Under packetization, SEAL does not yet close the gap to coding the whole frame as a single bitstream, as the original DCVC-RT does. We therefore agree that the current wording claims more than the results support, and we accept your suggestion to narrow it. The revision will revise the related statements in the abstract, introduction and contributions accordingly, state the clean compression cost explicitly in the limitations, and use the unified-MTU experiment as the main experiment.
Thank you again for the careful review; these comments make the paper's conclusions more accurate.
Thank you for your comments. Building on our first response, we ran two additional experiments, addressing your points on a simpler way to obtain locality and on the fairness of the FEC baseline configuration.
A simpler way to obtain locality. We implemented the scheme you suggested on the same DCVC-RT backbone: each hyperprior unit is placed in the same packet as its residual, with the same loss training and packetization as SEAL. The hyperprior can then no longer be lost on its own, but the receiver still has to infer the entropy-coding distribution using temporal context. Without packet loss, this scheme reaches 0.069 bpp at QP55, lower than SEAL's 0.073 bpp, because it does not need to transmit the scales. Under loss, however, once the temporal context drifts, even intact packets are decoded incorrectly: under GE 20% (L=20), 12.6% of the residual symbols at the receiver differ from those at the sender, compared with 0 for SEAL. Correspondingly, its average PSNR is 31.6 dB, 6.7 dB lower than SEAL, and 7.1 dB lower under IID 20%. In other words, SEAL spends about 6% more rate on transmitting the scales and gains about 7 dB in quality under loss. Placing each hyperprior unit in the same packet as its residual closes only the hyperprior path. For the receiver to always select the distribution the sender used, the scale determined at the sender must also be transmitted with each packet.
FEC baseline configuration. We agree that SEAL's advantage over FEC is small at low loss. We therefore further strengthened the H.265+FEC baseline under the unified MTU setup, where error concealment is already enabled: the redundancy is chosen separately for each loss rate to be optimal, both codecs use the same byte-level loss traces, and total rates include all overhead and are matched. At IID loss rates of 20% and below, the two achieve similar quality, within 0.6 dB. When loss is heavier or bursty, the redundancy FEC needs grows quickly, and FEC may fail to recover whole frames, so SEAL's advantage emerges: it leads by 4.7 dB under IID 40% and by 8.1 dB under GE 20% (L=20). In the revision, the unified transport setup will serve as the main experiment.
These results will be added to Section 4 and the appendix of the revision. We would be happy to clarify any remaining concerns.