decoding state can be bulkier than a key frame and opaque to the CPU if hardware... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		infofarmer on Aug 18, 2024 \| parent \| context \| favorite \| on: Mpv – A free, open-source, and cross-platform medi... decoding state can be bulkier than a key frame and opaque to the CPU if hardware acceleration is used I wonder if caching semi-compressed frames would be more efficient in either case (CPU or GPU)

hsbauauvhabzb on Aug 21, 2024 [–]

It doesn’t have to be every frame though. Pre calculate to 25%/50%/75%, then as I’m playing, save key frames for more incremental points, and if I start scrubbing, calculate more around that region.

Edit: this doesn’t have to happen synchronously either, it can occur in a background thread or passively.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact