top | item 41279868 (no title) infofarmer | 1 year ago you'd have to "rebase" all the other frames to be derived from those discuss order hn newest coryrc|1 year ago You wouldn't have to any more than you need 0 through N frames in memory to calculate frame N+1. Whatever your decoding state completes at frame N can be considered a key frame. infofarmer|1 year ago decoding state can be bulkier than a key frame and opaque to the CPU if hardware acceleration is usedI wonder if caching semi-compressed frames would be more efficient in either case (CPU or GPU) load replies (1)
coryrc|1 year ago You wouldn't have to any more than you need 0 through N frames in memory to calculate frame N+1. Whatever your decoding state completes at frame N can be considered a key frame. infofarmer|1 year ago decoding state can be bulkier than a key frame and opaque to the CPU if hardware acceleration is usedI wonder if caching semi-compressed frames would be more efficient in either case (CPU or GPU) load replies (1)
infofarmer|1 year ago decoding state can be bulkier than a key frame and opaque to the CPU if hardware acceleration is usedI wonder if caching semi-compressed frames would be more efficient in either case (CPU or GPU) load replies (1)
coryrc|1 year ago
infofarmer|1 year ago
I wonder if caching semi-compressed frames would be more efficient in either case (CPU or GPU)