A comparison of temporal scalability techniques | Semantic Scholar (2024)

In HRPS, thereference picture memory is managed as a hierarchical structure and the reference picture selection method can be applied to each layer, which improves the coding efficiency of each layer.

In order to avoid problems with too large bitstreams of the base layer produced by some of the hitherto proposed spatially scalable coders, spatio-temporal scalability is proposed for video compression systems.

A highly scalable wavelet video codec is proposed for Internet video streaming applications based on the simplified JPEG-2000 compression core by adopting an adaptive frame grouping scheme based on fast scene change detection, a flexible temporal grouping according to motion activities.

Novel sub-sequence coding techniques for temporal scalability are introduced, adopted into the latest video coding standard, H.264, making it easy to identify sub-sequences and possible to discard them intentionally.

The reversible rounding method is proposed to convert the floating point coefficients given by the interpolating wavelet transform into integers without loss of resolution and outperforms substantially the TSB approach in generating lower frame rate videos.

A fully scalable video coding algorithm with combined temporal, spatial and quality scalability is designed, and a complete video coding system MC-EZBC is developed, matching the requirements of MPEG-21 DIA.

Analysis of minimum buffer requirement for temporal scalable coding based on the most typical temporal scalable video coding structure, i.e., the so-called hierarchical B picture coding structure is presented.

A measure for video reconstruction error (VRE) is defined, and a heap-based greedy algorithm is used to build a hierarchy of increasingly sparsely sampled temporal sequences, each consisting of key frames with minimal VRE.

...

...

A new three-dimensional subband coder is presented which provides six different spatio-temporal resolutions of a video signal and successfully merges spatial and temporal scalability without imposing restrictions on which of the six video resolutions can be decoded.

The general formulation and solution using the Lagrange multiplier method and dynamic programming is given, and it is demonstrated how the general theory can be adapted and applied to both an MPEG-like coder and a motion-compensated wavelet coder.

The motion-compensated 3-D SBC coder with lattice VQ was found to outperform the techniques used in current standard coders by several dBs in the compression of interlaced CCIR 601 sequences.

This work replaces the arithmetic coding portion of the Taubman codec with block coding, and compares the encode/decode speed of this new coder with MPEG, which is one order of magnitude faster than MPEG-1.

The results of video coding based on a three-dimensional spatio-temporal subband decomposition are competitive with traditional video coding techniques and provide the motivation for investigating the 3-D subband framework for different coding schemes and various applications.

The scheme is interpreted more generally, viewed as a motion-compensated short-time spectral analysis of video sequences, which can adapt to the quickness of changes.

A multiresolution representation for video signals is introduced and Interpolation in an FIR (finite impulse response) scheme solves uncovered area problems, considerably improving the temporal prediction.

Experimental results show that the performance of the proposed video coding system exceeds that of an MPEG-1 implementation for several video test sequences covering various camera and object motions.

...

...