yeah, the video on the left is an MP4 re-encoding of the video on the right. the video on the right, in the .mov container, is Sorenson video. which is easier to scrub through. but the point of the comparison was software in 2020 vs 2002. which includes the codec. so that's 1/2
-
-
why I re-encoded it. but it's not an excuse for the modern software. there's so much computing power in this machine. it could easily make scrubbing responsive if it wanted to. (and some software can.) the people who made it just don't care enough.
7 replies 0 retweets 30 likes -
It's not possible to make scrubbing universally responsive in h.264 except post facto by caching the hell out of everything. Keyframe intervals can be arbitrarily long and smooth scrubbing requires being able to decode one whole GOP per screen frame.
2 replies 0 retweets 6 likes -
At a typical GOP interval of 30, you need 30 times the CPU power required to decode a video normally for smooth scrubbing to arbitrary frames. GOPs can be even larger than that.
1 reply 0 retweets 4 likes -
the computer on the left is 500 times more powerful just in CPU than the computer on the right
1 reply 0 retweets 3 likes -
And h.264 is probably over 20 times more complex to decode than the older codec. Times 30 you're at 600. And nobody is putting exact seek into browser players because it's not going to work for HD video which multiplies the CPU usage again.
1 reply 0 retweets 5 likes -
i don't understand what the times 30 is here
1 reply 0 retweets 0 likes -
h.264 frames can depend on an infinite number of frames before them. A more common setting is 30. That means decoding frame 30 requires decoding frames 1-29 too. So you need 30 times the CPU power to decode any *random* arbitrary frame in the time it normally takes to decode one.
2 replies 0 retweets 8 likes -
but why doesn't it cache them aaaaaahhhhhhhhhhhhhh
2 replies 0 retweets 0 likes -
Caching is only really useful for seeking back within the most recent GOP, not for random seeking in a video. Uncompressed video takes tons of RAM.
2 replies 0 retweets 0 likes
*normal* decoding, in order, of course keeps any frames that might still be needed around (and no more, and which frames those are is defined in the bitstream ahead of time, and how many there can be is part of the profile that determines what decoders can handle).
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.