2 ms·
> Instead, if part of the frame is constantly being updated you'll still recover from loss in finite time Modern video codecs tend not to be self-stabilising.
by londons_explore 7y ago
> Instead, if part of the frame is constantly being updated you'll still recover from loss in finite time
Modern video codecs tend not to be self-stabilising. For example, most codecs use some kind of huffman tables or arithmetic coding. If the probabilities for those tables depend on previous frames, and you don't know the probabilities, the resulting decode will be entirely junk, and won't get you any closer to being able to decode the next frame either.
- nullc 7y agoI was insufficiently precise in my description, but having implemented it in one (admittedly simple) codec I can assure you it works. ::grin:: When this kind of rolling keyframe is used the encoder needs to track the reference structure of the video and not make any references into the "dirty zone"-- this includes constraining coding modes so that no entropy context leaks. This can be aided by (or necessitate the use of) 'tiled'/'sliced' entropy coding features that some codecs have for parallelism reasons. There is, of course, a coding performance loss-- especially if the video pans against the update boundary.