Figure - available via license: Creative Commons Attribution-ShareAlike 4.0 International
Content may be subject to copyright.
Download
View publication
Computational Complexity: Time to en- code/decode 1 frame (in seconds). The computation time is estimated for the highest RD point of our framework.

Computational Complexity: Time to en- code/decode 1 frame (in seconds). The computation time is estimated for the highest RD point of our framework.

Source publication
Fig. 1: Proposed RDAC framework. From a single reference frame, motion...
Fig. 3: RD Performance: Our method achieves considerable bitrate gains...
Fig. 4: Reconstruction quality as a function of time: RDAC temporal...
Computational Complexity: Time to en- code/decode 1 frame (in seconds)....
Predictive Coding For Animation-Based Video Compression
Preprint
Full-text available
  • Jul 2023
We address the problem of efficiently compressing video for conferencing-type applications. We build on recent approaches based on image animation, which can achieve good reconstruction quality at very low bitrate by representing face motions with a compact set of sparse keypoints. However, these methods encode video in a frame-by-frame fashion, i....
Cite
Download full-text

Similar publications

The proposed neural network for image partitioning decision
The overall hardware architecture for the proposed system. The...
Processing steps required to apply the first convolution layer. Filters...
Fcd-cnn: FPGA-based CU depth decision for HEVC intra encoder using CNN
Article
Full-text available
  • Jun 2024
Video compression for storage and transmission has always been a focal point for researchers in the field of image processing. Their efforts aim to reduce the data volume required for video representation while maintaining its quality. HEVC is one of the efficient standards for video compression, receiving special attention due to the increasing de...
View