Fraunhofer Institute for Telecommunications - Heinrich Hertz Institute (HHI)

Size: px
Start display at page:

Download "Fraunhofer Institute for Telecommunications - Heinrich Hertz Institute (HHI)"

Transcription

1 Joint Video Team (JVT) of ISO/IEC MPEG & ITU-T VCEG (ISO/IEC JTC1/SC29/WG11 and ITU-T SG16 Q.6) 9 th Meeting: 2-5 September 2003, San Diego Document: JVT-I032d1 Filename: JVT-I032d5.doc Title: Status: Purpose: Author(s) or Contact(s): Source: SNR-scalable Extension of H.264/AVC Input Document to JVT Information Heiko Schwarz, Detlev Marpe, and Thomas Wiegand Image Processing Department, Einsteinufer 37, D Berlin, Germany Tel: hschwarz@hhi.de marpe@hhi.de wiegand@hhi.de Fraunhofer Institute for Telecommunications - Heinrich Hertz Institute (HHI) Abstract This document contains a description of an SNR-scalable extension of H.264/AVC [1]. To achieve an efficient SNR-scalable bitstream representation of a video sequence, the temporal dependency between pictures is coded using an open-loop subband approach. In this codec, most components of H.264/AVC are used as specified in the standard while only a few have been adjusted to the subband coding structure. We have tested a first version of the approach with QCIF and CIF resolution sequences obtaining some promising results. 1. Introduction Inspired by recent advances [2][3][4] in temporal subband coding of video sequences, we have investigated the possibility of an SNR-scalable extension of H.264/AVC. The main reason for these recent advances is the lifting representation of a filterbank as originally suggested in [5]. This lifting representation of temporal subband decompositions permits the use of known methods for motion-compensated prediction. Moreover, most other components of a hybrid video codec such as H.264/AVC can be used without modifications while only a few parts need to be adjusted. In the following, a brief review of the lifting framework is given together with a presentation of two practically important examples. The generic lifting scheme consists of three steps, the polyphase decomposition, the prediction step, and the update step, as depicted in Figure 1 (a). In the following we describe these steps performed for the analysis filterbank, i.e., at the encoder side. The polyphase decomposition separates the even and the odd samples of a given signal s[k]. In the case of temporal subband coding of video sequences, the samples s[k] correspond to pictures, but for simplicity please assume the s[k] are scalar values for now. Since the correlation structure typically shows a local characteristic, the even and odd polyphase components are highly correlated, and therefore, in a subsequent step, a prediction of the odd samples from the even samples is performed. The corresponding prediction operator P for each odd sample s odd [] k = s[ 2k + 1] is a linear combination of its neighboring even samples seven [ k] = s[ 2k], i.e., P )[ k] = p s [ k l]. ( s l even l even + File:JVT-I032d6.doc Page: 1 Date Saved:

2 As a result of the prediction step, we replace the odd samples by its corresponding prediction residuals h[] k = s odd [] k P( s even )[]. k Note that the prediction step is equivalent to applying a highpass filter of a two-channel filterbank [6] and in case of video sequence coding it is similar to motion-compensated prediction, e.g. as described in [1]. S k z -1 2 S 2k+1 P U F h h k F h -1 U P S 2k+1 2 z S k 2 S 2k F l l k F l -1 S 2k 2 (a) Lifting Scheme (Analysis Filterbank) (b) Inverse Lifting Scheme (Synthesis Filterbank) Figure 1: The lifting representation of an analysis filterbank (a), and the inverse lifting representation of the corresponding synthesis filterbank (b). Finally, in the update step of the lifting scheme, a low-pass filtering is performed by updating the even samples s even [] k with a linear combination of the prediction residuals h[k]. The corresponding update operator U is given by U ( h k = u h k + l )[ ] l [ ]. l By replacing the even samples with l [] k s [] k + h) [] k =, the given signal s[k] can finally be even U( represented by l[k] and h[k], each at half temporal sampling rate as s[k]. Since both the update and the prediction step are fully invertible, the corresponding transform can be interpreted as a critically sampled perfect reconstruction filterbank. In fact, it can be shown that any biorthogonal family of FIR filters can be realized with a sequence of prediction and update steps [6]. For a normalization of the low- and high-pass components, appropriately chosen scaling factors F l and F h are applied, respectively. At the decoder side, the inverse of the described lifting scheme is performed, which corresponds to the synthesis filterbank is shown in Figure 1 (b). The synthesis filterbank simply consists of the application of the prediction and update operator in reversed order with inverted signs in the summation process followed by the reconstruction process using the even and odd polyphase components. The Haar wavelet simply given by In the case of the Haar wavelet, the prediction and update operators are P ( s even )[] k s[ 2k] and U ( h )[] k = h[], k Haar = 1 such that h[] k = s[ 2k + 1] s[ 2k] and [] k = s[ k] + 1 h[] k = s 2k + s 2k + 1 Haar l correspond to the (non-normalized) high-pass and low-pass (analysis) output of the Haar filter, respectively. It should be noted that a correspondence between the Haar wavelet and predictive coding as specified e.g. for P slices in [1] as described later. File:JVT-I032d6.doc Page: 2 Date Saved:

3 The 5/3 bi-orthogonal spline wavelet The low- and high-pass analysis filters of the 5/3 spline wavelet have 5 and 3 taps, respectively, and its corresponding scaling function is a B- spline of order 2, hence the naming of the wavelet filter. Its simplicity together with a remarkably good performance in still image coding applications (like JPEG2000) recommends its use in a temporal subband coding scheme. In the lifting framework, the corresponding prediction and update operators of the 5/3 transform are given by 1 1 P 5/3 ( s even )[] k = ( s[ 2k] + s[ 2k + 2] ) and U 5/3( h) [] k = ( h[] k + h[ k 1] ). 2 4 It should be noted that a correspondence between the 5/3 bi-orthogonal spline wavelet and bipredictive coding as specified e.g. for B slices in [1] as described later. z -1 Figure 2: A temporal subband codec with the encoder containing the analysis filterbank and the quantizer (transform, scaling, quantization) and the decoder containing the inverse transform and scaling and the synthesis filterbank. File:JVT-I032d6.doc Page: 3 Date Saved:

4 2. Description of the codec 2.1. Analysis-synthesis filterbank Figure 2 depicts the general structure of the utilized filterbank. The depicted filterbank shows a 4 layer dyadic temporal decomposition of the video signal requiring the processing of 2 4 = 16 pictures to arrive at the lowest temporal resolution representation. The introduced delay of this approach is also 16 pictures making it impossible to be used in interactive applications such as videoconferencing. The depicted filterbank utilizes the iterated application of the Haar-based motion-compensated lifting scheme, which consists of a motion-compensated prediction step (M i0 ) as in H.264/AVC and a motion-compensated update step (M i1 ). Both, the prediction and the update step utilize the motion compensation process as specified in [1] followed by the deblocking filter process as specified in [1]. In each stage of the analysis filterbank, two pictures (either original pictures or pictures representing low pass signals generated in a previous analysis stage) are decomposed into a low pass signal, which can be considered as a representation of the commonness of the input pictures, and a high pass signal, which can be considered as a representation of the difference between the input pictures. In the corresponding stage of the synthesis filterbank, the two input pictures are reconstructed given the low and high pass signals. Since, in the synthesis step, the inverse operations of the analysis step are performed, the analysis-synthesis filterbank (without quantization) guarantees perfect reconstruction. When both motion fields M i0 and M i1 are equal to zero, the basic temporal decomposition-composition scheme corresponds to a lifting representation of the Haar filter as discussed in Section 1. In the following the prediction and update steps of the analysis and synthesis process are described in more detail. The motion fields M i0 and M i1 generally specify the motion between two pictures using a subset of the P slice syntax of H.264/AVC [1]. For the motion fields M i0 used by the prediction steps, we incorporated an intra macroblock type, in which the (motioncompensated) prediction signal for a macroblock is specified by an 4x4 array of luma transform coefficient levels and two 2x2 arrays of chroma transform coefficient levels similar to the IN- TRA_16x16 macroblock type of H.264/AVC with all AC coefficients set to zero. In the motion fields M i1 used for the update steps, this macroblock type is not included General motion compensated prediction This section describes a general motion compensated prediction process, which is used by the prediction and update steps at both the analysis and synthesis side. Input to this process is a reference picture R, a quantization parameter QP (if required), and a block-wise motion field M with the following properties: For each macroblock of the motion-compensated picture P, the motion field M specifies a macroblock mode, which can be equal to P_16x16, P_16x8, P_8x16, P_8x8, or INTRA. When the macroblock mode is equal to P_8x8, for each 8x8 sub-macroblock, a corresponding sub-macroblock mode is specified (P_8x8, P_8x4, P_4x8, P_4x4). If the macroblock mode is equal to INTRA, the generation of the prediction signal is specified by an 4x4 array of luminance coefficient levels and two 2x2 arrays of chrominance coefficient levels. Otherwise, the generation of the prediction signal is specified by one motion vector with quarter-sample accuracy for each macroblock or sub-macroblock partition. File:JVT-I032d6.doc Page: 4 Date Saved:

5 Given the reference picture R and the motion field description M, the prediction signal P is constructed in a macroblock-wise manner as described in the following: If the macroblock mode specified in M is not equal to INTRA, for each macroblock or sub-macroblock partition the following applies: o The luma and chroma samples of the picture P that are covered by the regarded macroblock or sub-macroblock partition are obtained by quarter-sample accurate motion compensated prediction as specified in [1]: p[i,j] = M interp (r, i m x, j m y ), where [m x, m y ] T is the motion vector of the regarded macroblock or submacroblock partition given by M, r[] is the array of luma or chroma samples of the reference picture R, and M interp (.) represents the interpolation process specified for the motion compensated prediction in H.264/AVC with the exception that the clipping to the interval [0;255] is removed. Otherwise (the macroblock mode is equal to INTRA), the following applies: o The given 4x4 array of luminance transform coefficient levels is treated as the array of DC luma coefficient levels for the INTRA_16x16 macroblock type in H.264/AVC, and the inverse scaling and transform process specified in [1] is applied using the given quantization parameter QP, while it is assumed that all AC transform coefficient levels are equal to zero. As a result a 16x16 array res[] of residual luma samples is obtained. The luma samples of the prediction picture P covering the regarded macroblock are constructed according to p[i,j] = res[i,j]. Note, that for each 4x4 luma block, the obtained prediction signal p[] is constant and represents an approximation of the average of the original 4x4 luma block. o For each chrominance component, the given 2x2 array of chrominance transform coefficient levels is treated as the array of DC chroma coefficient levels, and the inverse scaling and transform process for chroma coefficients specified in [1] is applied using the given quantization parameter QP, while it is assumed that all AC transform coefficient levels are equal to zero. As a result an 8x8 array res[] of residual chroma samples is obtained. The chroma samples of the prediction picture P covering the macroblock are constructed according to p[i,j] = res[i,j]. Note, that for each 4x4 chroma block, the obtained prediction signal p[] is constant and represents an approximation of the average of the original 4x4 chroma block. After generating the whole prediction picture P, the de-blocking filter as specified in [1] is applied to that prediction picture, whereas the derivation of the boundary filter strength is based File:JVT-I032d6.doc Page: 5 Date Saved:

6 only on the macroblock modes (information about INTRA) and the motion vectors specified in the motion description M; furthermore, the clipping to the interval [0; 255] is removed. As it can be seen from the above description, the general process of generating (motion compensated) prediction pictures is nearly identical to the reconstruction process of P slices as described in H.264/AVC [1]. The following differences can be identified: o Removal of the clipping to the interval [0; 255] in the processes of motion compensated prediction and de-blocking. o Simplified INTRA mode reconstruction without intra prediction and with all AC transform coefficient levels set to zero. o Simplified reconstruction for motion compensated prediction modes without residual information Prediction step at analysis (encoder) side Given two input pictures A and B as well as the motion vector array M i0 for the block-based motion compensation of picture A towards picture B and a quantization parameter QP, the following operations are performed to obtain a residual picture H: - The picture P representing a prediction of the picture B is generated by invoking the process specified in sec with the reference picture A, the motion field description M i0, and the quantization parameter QP as input. - The residual picture H is generated by h[i,j] = b[i,j] p[i,j], where h[], b[], and p[] represent the luma or chroma sample arrays of the pictures H, B, and P, respectively Update step at analysis (encoder) side Given the input picture A, the residual picture H obtained in the prediction step as well as the motion vector array M i1 for the block-based motion compensation of picture B towards picture A, the following operations are performed to obtain a picture L representing the temporal low pass signal: - A picture P is generated by invoking the process specified in Sec with the reference picture H and the motion field description M i1 as input. - The low pass picture L is generated by l[i,j] = a[i,j] + (p[i,j] >> 1), where l[], a[], and p[] represent the luma or chroma sample arrays of the pictures L, A, and P, respectively Update step at synthesis (decoder) side Given the (quantized/constructed) low pass pictures L', the quantized residual picture H' as well as the motion vector array M i1, the following operations are performed to obtain the decoded picture A': - The picture P' is generated by invoking the process specified in Sec with the reference picture H' and the motion field description M i1 as input. - The reconstructed picture A is generated by a'[i,j] = l'[i,j] (p'[i,j] >> 1), where a'[], l'[], and p'[] represent the sample arrays of the pictures A', L', and P', respectively Prediction step at synthesis (decoder) side Given the quantized residual picture H', the constructed picture A' obtained in the update step at the decoder as well as the motion field M i0, the following operations are performed to obtain the decoded picture B: File:JVT-I032d6.doc Page: 6 Date Saved:

7 - A picture P' representing a prediction of the picture B' is generated by invoking the process specified in Sec with the reference picture A', the motion field description M i0, and the quantization parameter QP as input. - The reconstructed picture B is generated by b[i,j] = h[i,j] + p[i,j], where b[], h[], and p[] represent the sample arrays of the pictures B', H', and P', respectively. By cascading the basic pair-wise picture decomposition stages, a dyadic tree structure is obtained, which decomposes a group of 2 n pictures into 2 n -1 residual pictures and a single low pass (or intra) picture as depicted in Figure 3 for a group of 8 pictures. original GOP (8 pictures) 1st stage 2nd stage 3rd stage Intra picture (low pass signal) Residual pictures (high pass signals) Figure 3: Temporal decomposition of a group of 8 pictures. It is worth noting that the inverse lifting step at the decoder requires twice the amount of motion compensation and deblocking filter operations than if the same number of pictures would be decoded in a hybrid video decoder when coding one I picture and all remaining pictures are coded as P pictures General coding of pictures and motion fields (Base Layer) For a group of 2 n pictures, (2 n+1-2) prediction data arrays (motion vectors and intra predictors), (2 n -1) residual pictures as well as a single low pass (or intra) picture have to be transmitted. We use slice data partitioning with a few modifications to map these data to NAL units. Prediction data array The prediction data arrays are coded using a subset of the H.264/AVC slice layer syntax consisting of the following syntax elements: File:JVT-I032d6.doc Page: 7 Date Saved:

8 - slice header (with changed meaning of some elements) - slice data (subset) o macroblock layer (subset) mb_type (P_16x16, P_16x8, P_8x16, P_8x8, INTRA) if( mb_type = = P_8x8 ) sub_mb_type (P_8x8, P_8x4, P_4x8, P_4x4) if( mb_type = = INTRA ) mb_qp_delta residual blocks (only LUMA_DC and CHROMA_DC) else motion vector differences o end_of_slice_flag - rbsp_slice_trailing_bits The motion vector predictors are derived as specified in [1]. Residual pictures (high-pass signals) The residual pictures are coded using a subset of the H.264/AVC slice layer syntax consisting of the following syntax elements: - slice header (with changed meaning of some elements) - slice data (subset) o macroblock layer (subset) coded_block_pattern mb_qp_delta residual blocks o end_of_slice_flag - rbsp_slice_trailing_bits Low-pass pictures The low-pass pictures are generally coded using the syntax of H.264/AVC [1]. In the simplest version, the low-pass pictures of each GOP are coded independently as intra pictures. The coding efficiency can be improved if the correlations between the low-pass pictures of successive GOP s are exploited. Thus, in a more general version, the low pass pictures are coded as P pictures using reconstructed low pass pictures of previous GOP s as references; intra (IDR) pictures are inserted in regular intervals only to provide random access points. The low pass pictures are decoded and reconstructed as specified in [1] including the de-blocking filter operation SNR-Scalability: Coding of enhancement layers The open-loop structure of the subband approach provides the possibility to efficiently incorporate SNR-scalability. We propose a very simple SNR-scalable extension, in which the base layer is coded as described in Sec. 2.2, and the enhancement layers consist of refinement pictures for the subband signals, which are also coded using the residual picture syntax as described in Sec At the encoder side, residual pictures computed between the original subband pictures generated by the analysis filterbank and the constructed subband pictures obtained after decoding the base or a previous enhancement layer are generated. These residual pictures are quantized using a smaller quantization parameter as in the base or previous enhancement layer(s) and encoded exploiting the residual picture syntax described in Sec At the decoder side, the subband representations of the base layer and the refinement signals of various enhancement layers can be de- File:JVT-I032d6.doc Page: 8 Date Saved:

9 coded independently, whereas the final enhancement layer subband representation is obtained by simply adding up the corresponding base layer and enhancement layer residual data either in the transform or spatial domain. Our simulations have shown, that the performance losses in comparison to the single layer approach are reasonably small if the quantization parameters are decreased by a value of six from one layer to the next; this bisection of the quantization step size approximately results in a doubling of the bit-rate from one enhancement layer to another. 3. Operational encoder control 3.1 Selection of the quantization parameters When neglecting the motion and replacing the bit-shift to the right in the update step by a realvalued multiplication by a factor of 1/2, the basic two-channel analysis step can be normalized by multiplying the high-pass samples of the picture H by a factor of 1/sqrt(2) and the low-pass samples by a factor of sqrt(2). Since we neglect this normalization in the realization of the analysis and synthesis filter banks to keep the range of the samples values nearly constant, we have to take it into account during the quantization of the temporal subbands. For the basic two-channel analysis-synthesis filterbank, this can easily be done by quantizing the low-pass signal with half of the quantization step size that is used for quantizing the high-pass signal. This leads to the following quantizer selection process for the specified dyadic decomposition structure of a group of 2 n pictures: Let QP L(n) be the quantization parameter used for coding the low-pass picture obtained after the n-th decomposition stage. The quantization parameters used for coding the high-pass pictures obtained after the i-th decomposition stage are derived by QP H(i) = QP L(n) + 3 * (n + 2 i) Within each temporal subband picture, the quantization parameter QP is held constant in the encoder version used for generating the simulation results. The quantization parameter QP INTRA(i) that is used for quantizing the intra prediction signals of the motion field descriptions M (i-1)0, which are used in the i-th decomposition stage, are derived from the quantization parameters QP H(i) for the high-pass pictures generated in this decomposition stage by QP INTRA(i) = QP H(i) Motion estimation and mode selection The motion field descriptions M i0 and M i1 that are used in the prediction and update steps, respectively, are estimated independently. In the following, the process for estimating the motion field description M i0 used in the prediction step is described. The process for estimating M i1 is obtained by interchanging the original pictures A and B and removing the INTRA mode from the set of possible macroblock modes. File:JVT-I032d6.doc Page: 9 Date Saved:

10 Given the pictures A and B, which are either original pictures or pictures representing low pass signals generated in a previous analysis stage, and the corresponding arrays of luma samples a[] and b[], the motion description M i0 is estimated in a macroblock-wise manner by the following process: For all possible macroblock and sub-macroblock partitions of a macroblock i inside the picture B, the associated motion vectors m i = [m x, m y ] T are obtained by minimizing the Lagrangian functional m i = arg min m S { ( i, m) + λ R( i, m) } D SAD with the distortion term being given as D SAD ( i, m ) = ( x, y) P b[ x, y] a[ x m, y m ] x y At this, S specifies the motion vector search range inside the reference picture A, P is the area covered by the regarded macroblock or sub-macroblock partition, R(i,m) specifies the number of bits needed to transmit all components of the motion vector m, and λ is a fixed Lagrange multiplier. The motion search proceeds first over all integer-sample accurate motion vectors in the given search range S. Then, given the best integer motion vector, the eight surrounding half-sample accurate motion vectors are tested, and finally, given the best half-sample accurate motion vector, the eight surrounding quarter-sample accurate motion vectors are tested. For the half- and quarter-sample accurate motion vector refinement, the term a[ x mx, y m y ] has to be interpreted as interpolation operator. The mode decision for the macroblock and sub-macroblock modes follows basically the same approach. From a given set of possible macroblock or sub-macroblock modes S mode, the mode p i that minimizes the following Lagrangian functional is chosen: p i = arg min p S mod e { D ( i, p) + R( i, p) } SAD λ. The distortion term is given as D SAD ( i, p) = b[ x, y] a[ x m [ p, x, y], y m [ p, x, y]], ( x, y) P x where P specifies the macroblock or sub-macroblock area and m[p,x,y] is the motion vector associated with the macroblock or sub-macroblock mode p and the partition or submacroblock partition covering the luma location (x, y). The rate term R(i,p) represents the number of bits associated with choosing the coding mode p. For the motion-compensated coding modes it includes the bits for the macroblock type (if applicable), the sub-macroblock type(s) (if applicable) and the motion vector(s); for the INTRA mode, it includes the bits for the macroblock mode and the arrays of quantized luma and chroma transform coefficient levels. The set of possible sub-macroblock types is given by {P_8x8, P_8x4, P_4x8, P_4x4}, and the set of possible macroblock types is given by {P_16x16, P_16x8, P_8x16, P_8x8, INTRA}, whereat the INTRA type is only included if a motion field description M i0 that is used for the prediction step is estimated. y File:JVT-I032d6.doc Page: 10 Date Saved:

11 The Lagrangian multiplier λ is set in dependence of the base-layer quantization parameter for the high-pass picture(s) QP Hi of the decomposition stage, for which the motion field is estimated: λ ^( QP / 3 4). = Hi 3.3 Temporal placement of the low-pass signals The basic two-channel analysis filterbank decomposes two input pictures A and B into a lowpass picture L and a high-pass picture H. Following the notation in this contribution, the lowpass picture L shares the coordinate system with the original picture A. Thus, assuming perfect (error-free) motion compensation, the pictures A and L are identical. The decomposition structure depicted in Figure 1 is obtained if in all decomposition stages, the even input pictures at temporal sampling positions 0, 2, 4,... are treated as input pictures A and the odd input pictures at temporal sampling positions 1, 3, 5, are treated as input pictures B. This scheme enables efficient temporal scalability allowing temporal sub-sampling down to very small frame rates. However, the temporal distance between the pictures that are decomposed in each two-channel analysis filterbank is increased by a factor of 2 from one decomposition stage to the next. And it is well known that the efficiency of motion compensated prediction decreases when the temporal distance between the reference picture and the picture to be predicted increases. It is possible to realize decomposition schemes in which the temporal distance between the pictures to be decomposed by the two-channel filterbank are increased by a factor less than 2 from one decomposition stage to the next. However, these schemes don t provide the feature of efficient temporal scalability allowing temporal sub-sampling down to very small frame rates, since the distances between neighboring low-pass pictures varies in most of the decomposition stages. In our simulations, we used the decomposition scheme depicted in Figure 4, which we believe constitutes a reasonable compromise between temporal scalability and coding efficiency. The sequence of original pictures is treated as a sequence of input pictures ABABAB AB; thus, this scheme provides one stage of optimal temporal scalability (equal distance between the low-pass pictures). The sequences of low-pass pictures used as input of all following decomposition stages are treated as a sequences of input pictures BAABBA AB, whereby the distances between the low-pass pictures that will be decomposed in following two-channel analysis steps is kept small. File:JVT-I032d6.doc Page: 11 Date Saved:

12 original GOP A B A B A B A B A B A B A B A B 1st stage B A A B B A A B 2nd stage B A A B 3rd stage B A 4th stage Figure 4: Temporal placement of low-pass pictures for a group of 16 pictures. 4. Results For evaluating the coding efficiency of the proposed SNR-scalable extension of H.264/AVC, we compared it to an H.264/AVC compliant encoder using a similar degree of encoder optimization. The set of input sequences for this comparison consists of six test sequences with widely varying content; all sequences have been encoded using different resolutions and frame rates as depicted in Table 1. Table 1: Test sequences Sequence Duration Resolution, frame rate Basketball 6.4 sec QCIF, 10Hz QCIF, 15Hz QCIF, 30Hz CIF, 15Hz CIF, 30Hz Flowers & Garden 6.4 sec QCIF, 10Hz QCIF, 15Hz QCIF, 30Hz CIF, 15Hz CIF, 30Hz Foreman 9.6 sec QCIF, 10Hz QCIF, 15Hz QCIF, 30Hz CIF, 15Hz CIF, 30Hz Mobile & Calendar 9.6 sec QCIF, 10Hz QCIF, 15Hz QCIF, 30Hz CIF, 15Hz CIF, 30Hz Paris 9.6 sec QCIF, 10Hz QCIF, 15Hz QCIF, 30Hz CIF, 15Hz CIF, 30Hz Tempete 6.4 sec QCIF, 10Hz QCIF, 15Hz QCIF, 30Hz CIF, 15Hz CIF, 30Hz For all sequences, resolutions, and frame rates, two versions of the scalable encoder have been tested. In the first version ( Scalable ), the temporal low-pass pictures of each group of pictures (GOP) are coded independently as IDR pictures; in the second version ( Scalable+DPCM ), only the temporal low-pass picture of the first group of pictures is coded as IDR picture, all remaining temporal low-pass pictures are coded as P pictures using the reconstructed temporal low-pass pictures of the previous GOP as reference. The video sequences generally are processed in groups of 16 pictures using the encoder control described in section 3. The rate-distortion curves for the scalable encoders have been obtained by decoding a different amount of enhancement layers of a single scalable bit-stream, which consists of one base and three enhancement layers. The quantization parameter for the temporal low-pass picture of the base layer QP L(4) was set to 28, and for generating the enhancement layers the quantization parameters have been decreased by a value of 6 from one layer to the next. File:JVT-I032d6.doc Page: 12 Date Saved:

13 The H.264/AVC compliant encoder was run with three different configurations. By using the first configuration ( IDR16, 1ref ), an IDR picture is inserted every 16 pictures, the remaining pictures are coded as P pictures, and only the previous reconstructed picture is used as reference for motion-compensated prediction in the P pictures. With the second configuration ( IDR0, 1ref ), only the first picture of a video sequence is coded as IDR picture, and all following pictures are coded as P pictures using a single reference picture for motion-compensated prediction. These two encoder configurations are considered as reasonable references for the two versions of the scalable encoder. The rate-distortion curves have been obtained by encoding the video sequences with fixed quantization parameters QP {40, 36, 32, 38, 24, 20}. We added a third encoder configuration ( IDR0, 2B, 5ref ) to the comparison, which is considered as representing nearly optimal H.264/AVC compliant encoding results. With this configuration, only the first picture of a video sequence is coded as IDR picture, two B pictures are inserted between each pair of P pictures, and 5 reference pictures are used. All three H.264/AVC compliant encoders are operated using the Lagrangian coder control described in [7], which uses a similar amount of encoder optimization as the operational control that was used for the scalable encoders (see section 3). For all tested encoders, CABAC was used as entropy coding method. The motion estimation was carried out using an exhaustive search. The search range was set to ±16 integer pixels for QCIF and ±32 pixels for CIF sequences if the reference picture represents a neighboring picture of the current picture, and it was enlarged to ±24 integer pixels for QCIF and ±48 integer pixels for CIF sequences if the reference picture does not represent a neighboring picture. Diagrams with the rate-distortion for all tested encoders, test sequences, resolution, and frame rates are contained in the accompanying Excel document. The Figure 5-Figure 10 show the ratedistortion curves for the CIF versions of the test sequences with a frame rate of 30Hz. The simulation results indicate that the coding efficiency of our first version of the SNR-scalable codec strongly depends on the characteristic of the input sequence. For sequences like Mobile & Calendar, Tempete, or Flowers & Garden that mainly contain global motion, the coding efficiency of our scalable codec s is especially in the low bit-rate range nearly comparable to that of the H.264/AVC compliant encoders. The coding efficiency of the scalable encoders drastically decreases in comparison to the H.264/AVC compliant encoders if the input sequences contain complex motion or a large amount of occlusion areas. Generally, the coding efficiency of the scalable encoders decreases if the frame rate is reduced. When looking at the reconstructed sequences it can be seen, that most coding artifacts occur in image regions that are covered or uncovered inside a group of pictures (Foreman, Paris) or that undergo complex motion (Basketball). This indicates that our simple bit-allocation algorithm, which uses a fixed quantization parameter inside a temporal subband picture, is not optimal. This is related to the fact that the orthonormality of the filterbank is only approximately given if the motion field used in the update step is the inverse of the motion field used in the prediction step. File:JVT-I032d6.doc Page: 13 Date Saved:

14 Y-PSNR [db] Basketball - CIF 30Hz frames (6.4 sec) DPCM: IDR16, 1ref DPCM: IDR0, 1ref DPCM: IDR0, 2B, 5ref Scalable: GOP16 Scalable: GOP16 + DPCM bit-rate [kbit/s] Figure 5: Comparison of the coding efficiency of the H.264/AVC compliant encoder ( DPCM ) and the proposed SNR-scalable extension ( Scalable ) for the sequence Basketball in CIF resolution with a frame rate of 30Hz Flowers & Garden - CIF 30Hz frames (6.4 sec) Y-PSNR [db] DPCM: IDR16, 1ref DPCM: IDR0, 1ref DPCM: IDR0, 2B, 5ref Scalable: GOP16 Scalable: GOP16 + DPCM bit-rate [kbit/s] Figure 6: Comparison of the coding efficiency of the H.264/AVC compliant encoder ( DPCM ) and the proposed SNR-scalable extension ( Scalable ) for the sequence Flowers & Garden in CIF resolution with a frame rate of 30Hz. File:JVT-I032d6.doc Page: 14 Date Saved:

15 42 Foreman - CIF 30Hz frames (9.6 sec) Y-PSNR [db] DPCM: IDR16, 1ref DPCM: IDR0, 1ref DPCM: IDR0, 2B, 5ref Scalable: GOP16 Scalable: GOP16 + DPCM bit-rate [kbit/s] Figure 7: Comparison of the coding efficiency of the H.264/AVC compliant encoder ( DPCM ) and the proposed SNR-scalable extension ( Scalable ) for the sequence Foreman in CIF resolution with a frame rate of 30Hz Mobile & Calendar - CIF 30Hz frames (9.6 sec) Y-PSNR [db] DPCM: IDR16, 1ref DPCM: IDR0, 1ref DPCM: IDR0, 2B, 5ref Scalable: GOP16 Scalable: GOP16 + DPCM bit-rate [kbit/s] Figure 8: Comparison of the coding efficiency of the H.264/AVC compliant encoder ( DPCM ) and the proposed SNR-scalable extension ( Scalable ) for the sequence Mobile & Calendar in CIF resolution with a frame rate of 30Hz. File:JVT-I032d6.doc Page: 15 Date Saved:

16 43 Paris - CIF 30Hz frames (9.6 sec) Y-PSNR [db] DPCM: IDR16, 1ref DPCM: IDR0, 1ref DPCM: IDR0, 2B, 5ref Scalable: GOP16 Scalable: GOP16 + DPCM bit-rate [kbit/s] Figure 9: Comparison of the coding efficiency of the H.264/AVC compliant encoder ( DPCM ) and the proposed SNR-scalable extension ( Scalable ) for the sequence Paris in CIF resolution with a frame rate of 30Hz. 42 Tempete - CIF 30Hz frames (6.4 sec) Y-PSNR [db] DPCM: IDR16, 1ref DPCM: IDR0, 1ref DPCM: IDR0, 2B, 5ref Scalable: GOP16 Scalable: GOP16 + DPCM bit-rate [kbit/s] Figure 10: Comparison of the coding efficiency of the H.264/AVC compliant encoder ( DPCM ) and the proposed SNR-scalable extension ( Scalable ) for the sequence Tempete in CIF resolution with a frame rate of 30Hz. File:JVT-I032d6.doc Page: 16 Date Saved:

17 5. Future research items In the presented approach, the motion vector arrays M i0 and M i1, which are used in the prediction and update step, respectively, are estimated and encoded independently. This does not only increase the bit-rate needed for transmitting the motion parameters, but probably also has a negative influence on the connectivity of these two motion fields, which seems to have an important influence on the coding efficiency of the subband approach. Thus, we believe that the coding efficiency can be improved if the motion fields M i1 used in the update step are not independently estimated and coded, but derived from the motion fields M i0 used in the prediction steps in a way that they are still representing block-wise motion compatible with the H.264/AVC specification. As a side effect, this might also limit the complexity needed for the update step. Our current analysis-synthesis structure represents a lifting representation of the simple Haar filters. This scheme can be extended to a lifting representation of the bi-orthogonal 5/3 filters, which lead to bi-predictive motion compensation. The most promising approach is probably to adaptively switch between the lifting representations of the Haar filters and that of the 5/3 filters on a block-basis, for which the motion compensated prediction as specified for B slices in H.264/AVC can be applied. In addition, it may be beneficial to adaptively choosing the GOP size for the temporal subband decomposition. Since the usage of multiple reference pictures has improved the performance of hybrid video coding schemes considerably, the incorporation of this approach into the subband scheme is an interesting research item. Another important point is the development of more suitable bit-allocation algorithms that reduce the annoying SNR fluctuations inside a group of pictures, which we have observed for some of the test sequences (e.g. Foreman). Furthermore, it should be worth to examine new techniques for transform coefficient coding, which could improve the SNR-scalability and perhaps provide additionally a certain degree of spatial scalability which itself is also on our list of things to be investigated. References [1] T. Wiegand and G. J. Sullivan (eds), Draft ITU-T Recommendation and Final Draft International Standard of Joint Video Specification (ITU-T Rec. H.264 ISO/IEC AVC), Doc. JVT-G050r1, May [2] D. Taubman, Successive refinement of video: fundamental issues, past efforts and new directions, Proc. of SPIE (VCIP 03), vol. 5150, pp , [3] J.-R. Ohm, Complexity and delay analysis of MCTF interframe wavelet structures, ISO/IEC JTC1/WG11 Doc. M8520, July [4] M. Flierl and B. Girod, "Video coding with motion-compensated lifted wavelet transforms", Proc. PCS [5] W. Sweldens, A custom-design construction of biorthogonal wavelets, J. Appl. Comp. Harm. Anal., vol. 3 (no. 2), pp , [6] I. Daubechies and W. Sweldens, Factoring wavelet transforms into lifting steps, J. Fourier Anal. Appl., vol. 4 (no. 3), pp , [7] T. Wiegand et al, Rate-Constrained Coder Control and Comparison of Video Coding Standards, IEEE Transactions on Circuits and Systems for Video Technology, vol. 13, pp , July File:JVT-I032d6.doc Page: 17 Date Saved:

Optimum Quantization Parameters for Mode Decision in Scalable Extension of H.264/AVC Video Codec

Optimum Quantization Parameters for Mode Decision in Scalable Extension of H.264/AVC Video Codec Optimum Quantization Parameters for Mode Decision in Scalable Extension of H.264/AVC Video Codec Seung-Hwan Kim and Yo-Sung Ho Gwangju Institute of Science and Technology (GIST), 1 Oryong-dong Buk-gu,

More information

An Improved H.26L Coder Using Lagrangian Coder Control. Summary

An Improved H.26L Coder Using Lagrangian Coder Control. Summary UIT - Secteur de la normalisation des télécommunications ITU - Telecommunication Standardization Sector UIT - Sector de Normalización de las Telecomunicaciones Study Period 2001-2004 Commission d' études

More information

MCTF and Scalability Extension of H.264/AVC and its Application to Video Transmission, Storage, and Surveillance

MCTF and Scalability Extension of H.264/AVC and its Application to Video Transmission, Storage, and Surveillance MCTF and Scalability Extension of H.264/AVC and its Application to Video Transmission, Storage, and Surveillance Ralf Schäfer, Heiko Schwarz, Detlev Marpe, Thomas Schierl, and Thomas Wiegand * Fraunhofer

More information

Wavelet-Based Video Compression Using Long-Term Memory Motion-Compensated Prediction and Context-Based Adaptive Arithmetic Coding

Wavelet-Based Video Compression Using Long-Term Memory Motion-Compensated Prediction and Context-Based Adaptive Arithmetic Coding Wavelet-Based Video Compression Using Long-Term Memory Motion-Compensated Prediction and Context-Based Adaptive Arithmetic Coding Detlev Marpe 1, Thomas Wiegand 1, and Hans L. Cycon 2 1 Image Processing

More information

H.264/AVC und MPEG-4 SVC - die nächsten Generationen der Videokompression

H.264/AVC und MPEG-4 SVC - die nächsten Generationen der Videokompression Fraunhofer Institut für Nachrichtentechnik Heinrich-Hertz-Institut Ralf Schäfer schaefer@hhi.de http://bs.hhi.de H.264/AVC und MPEG-4 SVC - die nächsten Generationen der Videokompression Introduction H.264/AVC:

More information

Reduced Frame Quantization in Video Coding

Reduced Frame Quantization in Video Coding Reduced Frame Quantization in Video Coding Tuukka Toivonen and Janne Heikkilä Machine Vision Group Infotech Oulu and Department of Electrical and Information Engineering P. O. Box 500, FIN-900 University

More information

(Invited Paper) /$ IEEE

(Invited Paper) /$ IEEE IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 17, NO. 9, SEPTEMBER 2007 1103 Overview of the Scalable Video Coding Extension of the H.264/AVC Standard Heiko Schwarz, Detlev Marpe,

More information

Advanced Video Coding: The new H.264 video compression standard

Advanced Video Coding: The new H.264 video compression standard Advanced Video Coding: The new H.264 video compression standard August 2003 1. Introduction Video compression ( video coding ), the process of compressing moving images to save storage space and transmission

More information

New Techniques for Improved Video Coding

New Techniques for Improved Video Coding New Techniques for Improved Video Coding Thomas Wiegand Fraunhofer Institute for Telecommunications Heinrich Hertz Institute Berlin, Germany wiegand@hhi.de Outline Inter-frame Encoder Optimization Texture

More information

Digital Video Processing

Digital Video Processing Video signal is basically any sequence of time varying images. In a digital video, the picture information is digitized both spatially and temporally and the resultant pixel intensities are quantized.

More information

Video Coding Using Spatially Varying Transform

Video Coding Using Spatially Varying Transform Video Coding Using Spatially Varying Transform Cixun Zhang 1, Kemal Ugur 2, Jani Lainema 2, and Moncef Gabbouj 1 1 Tampere University of Technology, Tampere, Finland {cixun.zhang,moncef.gabbouj}@tut.fi

More information

ADVANCES IN VIDEO COMPRESSION

ADVANCES IN VIDEO COMPRESSION ADVANCES IN VIDEO COMPRESSION Jens-Rainer Ohm Chair and Institute of Communications Engineering, RWTH Aachen University Melatener Str. 23, 52074 Aachen, Germany phone: + (49) 2-80-27671, fax: + (49) 2-80-22196,

More information

Laboratoire d'informatique, de Robotique et de Microélectronique de Montpellier Montpellier Cedex 5 France

Laboratoire d'informatique, de Robotique et de Microélectronique de Montpellier Montpellier Cedex 5 France Video Compression Zafar Javed SHAHID, Marc CHAUMONT and William PUECH Laboratoire LIRMM VOODDO project Laboratoire d'informatique, de Robotique et de Microélectronique de Montpellier LIRMM UMR 5506 Université

More information

Overview: motion-compensated coding

Overview: motion-compensated coding Overview: motion-compensated coding Motion-compensated prediction Motion-compensated hybrid coding Motion estimation by block-matching Motion estimation with sub-pixel accuracy Power spectral density of

More information

Performance Comparison between DWT-based and DCT-based Encoders

Performance Comparison between DWT-based and DCT-based Encoders , pp.83-87 http://dx.doi.org/10.14257/astl.2014.75.19 Performance Comparison between DWT-based and DCT-based Encoders Xin Lu 1 and Xuesong Jin 2 * 1 School of Electronics and Information Engineering, Harbin

More information

Fine grain scalable video coding using 3D wavelets and active meshes

Fine grain scalable video coding using 3D wavelets and active meshes Fine grain scalable video coding using 3D wavelets and active meshes Nathalie Cammas a,stéphane Pateux b a France Telecom RD,4 rue du Clos Courtel, Cesson-Sévigné, France b IRISA, Campus de Beaulieu, Rennes,

More information

BANDWIDTH-EFFICIENT ENCODER FRAMEWORK FOR H.264/AVC SCALABLE EXTENSION. Yi-Hau Chen, Tzu-Der Chuang, Yu-Jen Chen, and Liang-Gee Chen

BANDWIDTH-EFFICIENT ENCODER FRAMEWORK FOR H.264/AVC SCALABLE EXTENSION. Yi-Hau Chen, Tzu-Der Chuang, Yu-Jen Chen, and Liang-Gee Chen BANDWIDTH-EFFICIENT ENCODER FRAMEWORK FOR H.264/AVC SCALABLE EXTENSION Yi-Hau Chen, Tzu-Der Chuang, Yu-Jen Chen, and Liang-Gee Chen DSP/IC Design Lab., Graduate Institute of Electronics Engineering, National

More information

Scalable Video Coding

Scalable Video Coding 1 Scalable Video Coding Z. Shahid, M. Chaumont and W. Puech LIRMM / UMR 5506 CNRS / Universite Montpellier II France 1. Introduction With the evolution of Internet to heterogeneous networks both in terms

More information

Lecture 13 Video Coding H.264 / MPEG4 AVC

Lecture 13 Video Coding H.264 / MPEG4 AVC Lecture 13 Video Coding H.264 / MPEG4 AVC Last time we saw the macro block partition of H.264, the integer DCT transform, and the cascade using the DC coefficients with the WHT. H.264 has more interesting

More information

IBM Research Report. Inter Mode Selection for H.264/AVC Using Time-Efficient Learning-Theoretic Algorithms

IBM Research Report. Inter Mode Selection for H.264/AVC Using Time-Efficient Learning-Theoretic Algorithms RC24748 (W0902-063) February 12, 2009 Electrical Engineering IBM Research Report Inter Mode Selection for H.264/AVC Using Time-Efficient Learning-Theoretic Algorithms Yuri Vatis Institut für Informationsverarbeitung

More information

Bit Allocation for Spatial Scalability in H.264/SVC

Bit Allocation for Spatial Scalability in H.264/SVC Bit Allocation for Spatial Scalability in H.264/SVC Jiaying Liu 1, Yongjin Cho 2, Zongming Guo 3, C.-C. Jay Kuo 4 Institute of Computer Science and Technology, Peking University, Beijing, P.R. China 100871

More information

An Efficient Mode Selection Algorithm for H.264

An Efficient Mode Selection Algorithm for H.264 An Efficient Mode Selection Algorithm for H.64 Lu Lu 1, Wenhan Wu, and Zhou Wei 3 1 South China University of Technology, Institute of Computer Science, Guangzhou 510640, China lul@scut.edu.cn South China

More information

BLOCK MATCHING-BASED MOTION COMPENSATION WITH ARBITRARY ACCURACY USING ADAPTIVE INTERPOLATION FILTERS

BLOCK MATCHING-BASED MOTION COMPENSATION WITH ARBITRARY ACCURACY USING ADAPTIVE INTERPOLATION FILTERS 4th European Signal Processing Conference (EUSIPCO ), Florence, Italy, September 4-8,, copyright by EURASIP BLOCK MATCHING-BASED MOTION COMPENSATION WITH ARBITRARY ACCURACY USING ADAPTIVE INTERPOLATION

More information

The Scope of Picture and Video Coding Standardization

The Scope of Picture and Video Coding Standardization H.120 H.261 Video Coding Standards MPEG-1 and MPEG-2/H.262 H.263 MPEG-4 H.264 / MPEG-4 AVC Thomas Wiegand: Digital Image Communication Video Coding Standards 1 The Scope of Picture and Video Coding Standardization

More information

Week 14. Video Compression. Ref: Fundamentals of Multimedia

Week 14. Video Compression. Ref: Fundamentals of Multimedia Week 14 Video Compression Ref: Fundamentals of Multimedia Last lecture review Prediction from the previous frame is called forward prediction Prediction from the next frame is called forward prediction

More information

Fast Decision of Block size, Prediction Mode and Intra Block for H.264 Intra Prediction EE Gaurav Hansda

Fast Decision of Block size, Prediction Mode and Intra Block for H.264 Intra Prediction EE Gaurav Hansda Fast Decision of Block size, Prediction Mode and Intra Block for H.264 Intra Prediction EE 5359 Gaurav Hansda 1000721849 gaurav.hansda@mavs.uta.edu Outline Introduction to H.264 Current algorithms for

More information

Scalable Video Coding in H.264/AVC

Scalable Video Coding in H.264/AVC Scalable Video Coding in H.264/AVC 1. Introduction Potentials and Applications 2. Scalability Extension of H.264/AVC 2.1Scalability Operation and High-Level Syntax 2.2Temporal Scalability 2.3SNR/Fidelity/Quality

More information

Upcoming Video Standards. Madhukar Budagavi, Ph.D. DSPS R&D Center, Dallas Texas Instruments Inc.

Upcoming Video Standards. Madhukar Budagavi, Ph.D. DSPS R&D Center, Dallas Texas Instruments Inc. Upcoming Video Standards Madhukar Budagavi, Ph.D. DSPS R&D Center, Dallas Texas Instruments Inc. Outline Brief history of Video Coding standards Scalable Video Coding (SVC) standard Multiview Video Coding

More information

Decoded. Frame. Decoded. Frame. Warped. Frame. Warped. Frame. current frame

Decoded. Frame. Decoded. Frame. Warped. Frame. Warped. Frame. current frame Wiegand, Steinbach, Girod: Multi-Frame Affine Motion-Compensated Prediction for Video Compression, DRAFT, Dec. 1999 1 Multi-Frame Affine Motion-Compensated Prediction for Video Compression Thomas Wiegand

More information

ARCHITECTURES OF INCORPORATING MPEG-4 AVC INTO THREE-DIMENSIONAL WAVELET VIDEO CODING

ARCHITECTURES OF INCORPORATING MPEG-4 AVC INTO THREE-DIMENSIONAL WAVELET VIDEO CODING ARCHITECTURES OF INCORPORATING MPEG-4 AVC INTO THREE-DIMENSIONAL WAVELET VIDEO CODING ABSTRACT Xiangyang Ji *1, Jizheng Xu 2, Debin Zhao 1, Feng Wu 2 1 Institute of Computing Technology, Chinese Academy

More information

IMPROVED CONTEXT-ADAPTIVE ARITHMETIC CODING IN H.264/AVC

IMPROVED CONTEXT-ADAPTIVE ARITHMETIC CODING IN H.264/AVC 17th European Signal Processing Conference (EUSIPCO 2009) Glasgow, Scotland, August 24-28, 2009 IMPROVED CONTEXT-ADAPTIVE ARITHMETIC CODING IN H.264/AVC Damian Karwowski, Marek Domański Poznań University

More information

An Efficient Table Prediction Scheme for CAVLC

An Efficient Table Prediction Scheme for CAVLC An Efficient Table Prediction Scheme for CAVLC 1. Introduction Jin Heo 1 Oryong-Dong, Buk-Gu, Gwangju, 0-712, Korea jinheo@gist.ac.kr Kwan-Jung Oh 1 Oryong-Dong, Buk-Gu, Gwangju, 0-712, Korea kjoh81@gist.ac.kr

More information

Introduction to Video Coding

Introduction to Video Coding Introduction to Video Coding o Motivation & Fundamentals o Principles of Video Coding o Coding Standards Special Thanks to Hans L. Cycon from FHTW Berlin for providing first-hand knowledge and much of

More information

EE Low Complexity H.264 encoder for mobile applications

EE Low Complexity H.264 encoder for mobile applications EE 5359 Low Complexity H.264 encoder for mobile applications Thejaswini Purushotham Student I.D.: 1000-616 811 Date: February 18,2010 Objective The objective of the project is to implement a low-complexity

More information

Video Compression Standards (II) A/Prof. Jian Zhang

Video Compression Standards (II) A/Prof. Jian Zhang Video Compression Standards (II) A/Prof. Jian Zhang NICTA & CSE UNSW COMP9519 Multimedia Systems S2 2009 jzhang@cse.unsw.edu.au Tutorial 2 : Image/video Coding Techniques Basic Transform coding Tutorial

More information

Rate Distortion Optimization in Video Compression

Rate Distortion Optimization in Video Compression Rate Distortion Optimization in Video Compression Xue Tu Dept. of Electrical and Computer Engineering State University of New York at Stony Brook 1. Introduction From Shannon s classic rate distortion

More information

Complexity Reduced Mode Selection of H.264/AVC Intra Coding

Complexity Reduced Mode Selection of H.264/AVC Intra Coding Complexity Reduced Mode Selection of H.264/AVC Intra Coding Mohammed Golam Sarwer 1,2, Lai-Man Po 1, Jonathan Wu 2 1 Department of Electronic Engineering City University of Hong Kong Kowloon, Hong Kong

More information

International Journal of Emerging Technology and Advanced Engineering Website: (ISSN , Volume 2, Issue 4, April 2012)

International Journal of Emerging Technology and Advanced Engineering Website:   (ISSN , Volume 2, Issue 4, April 2012) A Technical Analysis Towards Digital Video Compression Rutika Joshi 1, Rajesh Rai 2, Rajesh Nema 3 1 Student, Electronics and Communication Department, NIIST College, Bhopal, 2,3 Prof., Electronics and

More information

A COST-EFFICIENT RESIDUAL PREDICTION VLSI ARCHITECTURE FOR H.264/AVC SCALABLE EXTENSION

A COST-EFFICIENT RESIDUAL PREDICTION VLSI ARCHITECTURE FOR H.264/AVC SCALABLE EXTENSION A COST-EFFICIENT RESIDUAL PREDICTION VLSI ARCHITECTURE FOR H.264/AVC SCALABLE EXTENSION Yi-Hau Chen, Tzu-Der Chuang, Chuan-Yung Tsai, Yu-Jen Chen, and Liang-Gee Chen DSP/IC Design Lab., Graduate Institute

More information

OPTIMIZATION OF LOW DELAY WAVELET VIDEO CODECS

OPTIMIZATION OF LOW DELAY WAVELET VIDEO CODECS OPTIMIZATION OF LOW DELAY WAVELET VIDEO CODECS Andrzej Popławski, Marek Domański 2 Uniwersity of Zielona Góra, Institute of Computer Engineering and Electronics, Poland 2 Poznań University of Technology,

More information

THE H.264 ADVANCED VIDEO COMPRESSION STANDARD

THE H.264 ADVANCED VIDEO COMPRESSION STANDARD THE H.264 ADVANCED VIDEO COMPRESSION STANDARD Second Edition Iain E. Richardson Vcodex Limited, UK WILEY A John Wiley and Sons, Ltd., Publication About the Author Preface Glossary List of Figures List

More information

Video coding. Concepts and notations.

Video coding. Concepts and notations. TSBK06 video coding p.1/47 Video coding Concepts and notations. A video signal consists of a time sequence of images. Typical frame rates are 24, 25, 30, 50 and 60 images per seconds. Each image is either

More information

Video Codecs. National Chiao Tung University Chun-Jen Tsai 1/5/2015

Video Codecs. National Chiao Tung University Chun-Jen Tsai 1/5/2015 Video Codecs National Chiao Tung University Chun-Jen Tsai 1/5/2015 Video Systems A complete end-to-end video system: A/D color conversion encoder decoder color conversion D/A bitstream YC B C R format

More information

LIST OF TABLES. Table 5.1 Specification of mapping of idx to cij for zig-zag scan 46. Table 5.2 Macroblock types 46

LIST OF TABLES. Table 5.1 Specification of mapping of idx to cij for zig-zag scan 46. Table 5.2 Macroblock types 46 LIST OF TABLES TABLE Table 5.1 Specification of mapping of idx to cij for zig-zag scan 46 Table 5.2 Macroblock types 46 Table 5.3 Inverse Scaling Matrix values 48 Table 5.4 Specification of QPC as function

More information

One-pass bitrate control for MPEG-4 Scalable Video Coding using ρ-domain

One-pass bitrate control for MPEG-4 Scalable Video Coding using ρ-domain Author manuscript, published in "International Symposium on Broadband Multimedia Systems and Broadcasting, Bilbao : Spain (2009)" One-pass bitrate control for MPEG-4 Scalable Video Coding using ρ-domain

More information

VHDL Implementation of H.264 Video Coding Standard

VHDL Implementation of H.264 Video Coding Standard International Journal of Reconfigurable and Embedded Systems (IJRES) Vol. 1, No. 3, November 2012, pp. 95~102 ISSN: 2089-4864 95 VHDL Implementation of H.264 Video Coding Standard Jignesh Patel*, Haresh

More information

VIDEO COMPRESSION STANDARDS

VIDEO COMPRESSION STANDARDS VIDEO COMPRESSION STANDARDS Family of standards: the evolution of the coding model state of the art (and implementation technology support): H.261: videoconference x64 (1988) MPEG-1: CD storage (up to

More information

NEW CAVLC ENCODING ALGORITHM FOR LOSSLESS INTRA CODING IN H.264/AVC. Jin Heo, Seung-Hwan Kim, and Yo-Sung Ho

NEW CAVLC ENCODING ALGORITHM FOR LOSSLESS INTRA CODING IN H.264/AVC. Jin Heo, Seung-Hwan Kim, and Yo-Sung Ho NEW CAVLC ENCODING ALGORITHM FOR LOSSLESS INTRA CODING IN H.264/AVC Jin Heo, Seung-Hwan Kim, and Yo-Sung Ho Gwangju Institute of Science and Technology (GIST) 261 Cheomdan-gwagiro, Buk-gu, Gwangju, 500-712,

More information

Title Adaptive Lagrange Multiplier for Low Bit Rates in H.264.

Title Adaptive Lagrange Multiplier for Low Bit Rates in H.264. Provided by the author(s) and University College Dublin Library in accordance with publisher policies. Please cite the published version when available. Title Adaptive Lagrange Multiplier for Low Bit Rates

More information

Xin-Fu Wang et al.: Performance Comparison of AVS and H.264/AVC 311 prediction mode and four directional prediction modes are shown in Fig.1. Intra ch

Xin-Fu Wang et al.: Performance Comparison of AVS and H.264/AVC 311 prediction mode and four directional prediction modes are shown in Fig.1. Intra ch May 2006, Vol.21, No.3, pp.310 314 J. Comput. Sci. & Technol. Performance Comparison of AVS and H.264/AVC Video Coding Standards Xin-Fu Wang (ΞΠΛ) and De-Bin Zhao (± ) Department of Computer Science, Harbin

More information

High Efficiency Video Coding (HEVC) test model HM vs. HM- 16.6: objective and subjective performance analysis

High Efficiency Video Coding (HEVC) test model HM vs. HM- 16.6: objective and subjective performance analysis High Efficiency Video Coding (HEVC) test model HM-16.12 vs. HM- 16.6: objective and subjective performance analysis ZORAN MILICEVIC (1), ZORAN BOJKOVIC (2) 1 Department of Telecommunication and IT GS of

More information

SCALABLE HYBRID VIDEO CODERS WITH DOUBLE MOTION COMPENSATION

SCALABLE HYBRID VIDEO CODERS WITH DOUBLE MOTION COMPENSATION SCALABLE HYBRID VIDEO CODERS WITH DOUBLE MOTION COMPENSATION Marek Domański, Łukasz Błaszak, Sławomir Maćkowiak, Adam Łuczak Poznań University of Technology, Institute of Electronics and Telecommunications,

More information

Video Coding Standards. Yao Wang Polytechnic University, Brooklyn, NY11201 http: //eeweb.poly.edu/~yao

Video Coding Standards. Yao Wang Polytechnic University, Brooklyn, NY11201 http: //eeweb.poly.edu/~yao Video Coding Standards Yao Wang Polytechnic University, Brooklyn, NY11201 http: //eeweb.poly.edu/~yao Outline Overview of Standards and Their Applications ITU-T Standards for Audio-Visual Communications

More information

Recent, Current and Future Developments in Video Coding

Recent, Current and Future Developments in Video Coding Recent, Current and Future Developments in Video Coding Jens-Rainer Ohm Inst. of Commun. Engineering Outline Recent and current activities in MPEG Video and JVT Scalable Video Coding Multiview Video Coding

More information

Efficient MPEG-2 to H.264/AVC Intra Transcoding in Transform-domain

Efficient MPEG-2 to H.264/AVC Intra Transcoding in Transform-domain MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com Efficient MPEG- to H.64/AVC Transcoding in Transform-domain Yeping Su, Jun Xin, Anthony Vetro, Huifang Sun TR005-039 May 005 Abstract In this

More information

Fast Mode Decision for H.264/AVC Using Mode Prediction

Fast Mode Decision for H.264/AVC Using Mode Prediction Fast Mode Decision for H.264/AVC Using Mode Prediction Song-Hak Ri and Joern Ostermann Institut fuer Informationsverarbeitung, Appelstr 9A, D-30167 Hannover, Germany ri@tnt.uni-hannover.de ostermann@tnt.uni-hannover.de

More information

Deblocking Filter Algorithm with Low Complexity for H.264 Video Coding

Deblocking Filter Algorithm with Low Complexity for H.264 Video Coding Deblocking Filter Algorithm with Low Complexity for H.264 Video Coding Jung-Ah Choi and Yo-Sung Ho Gwangju Institute of Science and Technology (GIST) 261 Cheomdan-gwagiro, Buk-gu, Gwangju, 500-712, Korea

More information

LONG-TERM MEMORY PREDICTION USING AFFINE MOTION COMPENSATION

LONG-TERM MEMORY PREDICTION USING AFFINE MOTION COMPENSATION LONGTERM MEMORY PREDICTION USING AFFINE MOTION COMPENSATION Thomas Wiegand, Eckehard Steinbach, and Bernd Girod Telecommunications Laboratory University of ErlangenNuremberg Cauerstrasse 7/NT, D91058 Erlangen,

More information

EXPLOITING TEMPORAL CORRELATION WITH ADAPTIVE BLOCK-SIZE MOTION ALIGNMENT FOR 3D WAVELET CODING

EXPLOITING TEMPORAL CORRELATION WITH ADAPTIVE BLOCK-SIZE MOTION ALIGNMENT FOR 3D WAVELET CODING EXPLOITING TEMPORAL CORRELATION WITH ADAPTIVE BLOCK-SIZE MOTION ALIGNMENT FOR 3D WAVELET CODING Ruiqin Xiong 1, Feng Wu 2, Shipeng Li 2, Zixiang Xiong 3, Ya-Qin Zhang 2 1. Institute of Computing Technology,

More information

Advances of MPEG Scalable Video Coding Standard

Advances of MPEG Scalable Video Coding Standard Advances of MPEG Scalable Video Coding Standard Wen-Hsiao Peng, Chia-Yang Tsai, Tihao Chiang, and Hsueh-Ming Hang National Chiao-Tung University 1001 Ta-Hsueh Rd., HsinChu 30010, Taiwan pawn@mail.si2lab.org,

More information

Selected coding methods in H.265/HEVC

Selected coding methods in H.265/HEVC Selected coding methods in H.265/HEVC Andreas Unterweger Salzburg University of Applied Sciences May 29, 2017 Andreas Unterweger (Salzburg UAS) Selected coding methods in H.265/HEVC May 29, 2017 1 / 22

More information

Reduced 4x4 Block Intra Prediction Modes using Directional Similarity in H.264/AVC

Reduced 4x4 Block Intra Prediction Modes using Directional Similarity in H.264/AVC Proceedings of the 7th WSEAS International Conference on Multimedia, Internet & Video Technologies, Beijing, China, September 15-17, 2007 198 Reduced 4x4 Block Intra Prediction Modes using Directional

More information

Adaptation of Scalable Video Coding to Packet Loss and its Performance Analysis

Adaptation of Scalable Video Coding to Packet Loss and its Performance Analysis Adaptation of Scalable Video Coding to Packet Loss and its Performance Analysis Euy-Doc Jang *, Jae-Gon Kim *, Truong Thang**,Jung-won Kang** *Korea Aerospace University, 100, Hanggongdae gil, Hwajeon-dong,

More information

COMPARISON OF HIGH EFFICIENCY VIDEO CODING (HEVC) PERFORMANCE WITH H.264 ADVANCED VIDEO CODING (AVC)

COMPARISON OF HIGH EFFICIENCY VIDEO CODING (HEVC) PERFORMANCE WITH H.264 ADVANCED VIDEO CODING (AVC) Journal of Engineering Science and Technology Special Issue on 4th International Technical Conference 2014, June (2015) 102-111 School of Engineering, Taylor s University COMPARISON OF HIGH EFFICIENCY

More information

Cross Layer Protocol Design

Cross Layer Protocol Design Cross Layer Protocol Design Radio Communication III The layered world of protocols Video Compression for Mobile Communication » Image formats» Pixel representation Overview» Still image compression Introduction»

More information

Coding of Coefficients of two-dimensional non-separable Adaptive Wiener Interpolation Filter

Coding of Coefficients of two-dimensional non-separable Adaptive Wiener Interpolation Filter Coding of Coefficients of two-dimensional non-separable Adaptive Wiener Interpolation Filter Y. Vatis, B. Edler, I. Wassermann, D. T. Nguyen and J. Ostermann ABSTRACT Standard video compression techniques

More information

Overview, implementation and comparison of Audio Video Standard (AVS) China and H.264/MPEG -4 part 10 or Advanced Video Coding Standard

Overview, implementation and comparison of Audio Video Standard (AVS) China and H.264/MPEG -4 part 10 or Advanced Video Coding Standard Multimedia Processing Term project Overview, implementation and comparison of Audio Video Standard (AVS) China and H.264/MPEG -4 part 10 or Advanced Video Coding Standard EE-5359 Class project Spring 2012

More information

H.264/AVC BASED NEAR LOSSLESS INTRA CODEC USING LINE-BASED PREDICTION AND MODIFIED CABAC. Jung-Ah Choi, Jin Heo, and Yo-Sung Ho

H.264/AVC BASED NEAR LOSSLESS INTRA CODEC USING LINE-BASED PREDICTION AND MODIFIED CABAC. Jung-Ah Choi, Jin Heo, and Yo-Sung Ho H.264/AVC BASED NEAR LOSSLESS INTRA CODEC USING LINE-BASED PREDICTION AND MODIFIED CABAC Jung-Ah Choi, Jin Heo, and Yo-Sung Ho Gwangju Institute of Science and Technology {jachoi, jinheo, hoyo}@gist.ac.kr

More information

2014 Summer School on MPEG/VCEG Video. Video Coding Concept

2014 Summer School on MPEG/VCEG Video. Video Coding Concept 2014 Summer School on MPEG/VCEG Video 1 Video Coding Concept Outline 2 Introduction Capture and representation of digital video Fundamentals of video coding Summary Outline 3 Introduction Capture and representation

More information

Advanced Encoding Features of the Sencore TXS Transcoder

Advanced Encoding Features of the Sencore TXS Transcoder Advanced Encoding Features of the Sencore TXS Transcoder White Paper November 2011 Page 1 (11) www.sencore.com 1.605.978.4600 Revision 1.0 Document Revision History Date Version Description Author 11/7/2011

More information

MPEG-4: Simple Profile (SP)

MPEG-4: Simple Profile (SP) MPEG-4: Simple Profile (SP) I-VOP (Intra-coded rectangular VOP, progressive video format) P-VOP (Inter-coded rectangular VOP, progressive video format) Short Header mode (compatibility with H.263 codec)

More information

Interframe coding A video scene captured as a sequence of frames can be efficiently coded by estimating and compensating for motion between frames pri

Interframe coding A video scene captured as a sequence of frames can be efficiently coded by estimating and compensating for motion between frames pri MPEG MPEG video is broken up into a hierarchy of layer From the top level, the first layer is known as the video sequence layer, and is any self contained bitstream, for example a coded movie. The second

More information

MOTION COMPENSATION IN TEMPORAL DISCRETE WAVELET TRANSFORMS. Wei Zhao

MOTION COMPENSATION IN TEMPORAL DISCRETE WAVELET TRANSFORMS. Wei Zhao MOTION COMPENSATION IN TEMPORAL DISCRETE WAVELET TRANSFORMS Wei Zhao August 2004 Boston University Department of Electrical and Computer Engineering Technical Report No. ECE-2004-04 BOSTON UNIVERSITY MOTION

More information

White paper: Video Coding A Timeline

White paper: Video Coding A Timeline White paper: Video Coding A Timeline Abharana Bhat and Iain Richardson June 2014 Iain Richardson / Vcodex.com 2007-2014 About Vcodex Vcodex are world experts in video compression. We provide essential

More information

Implementation and analysis of Directional DCT in H.264

Implementation and analysis of Directional DCT in H.264 Implementation and analysis of Directional DCT in H.264 EE 5359 Multimedia Processing Guidance: Dr K R Rao Priyadarshini Anjanappa UTA ID: 1000730236 priyadarshini.anjanappa@mavs.uta.edu Introduction A

More information

Lecture 5: Error Resilience & Scalability

Lecture 5: Error Resilience & Scalability Lecture 5: Error Resilience & Scalability Dr Reji Mathew A/Prof. Jian Zhang NICTA & CSE UNSW COMP9519 Multimedia Systems S 010 jzhang@cse.unsw.edu.au Outline Error Resilience Scalability Including slides

More information

OVERVIEW OF IEEE 1857 VIDEO CODING STANDARD

OVERVIEW OF IEEE 1857 VIDEO CODING STANDARD OVERVIEW OF IEEE 1857 VIDEO CODING STANDARD Siwei Ma, Shiqi Wang, Wen Gao {swma,sqwang, wgao}@pku.edu.cn Institute of Digital Media, Peking University ABSTRACT IEEE 1857 is a multi-part standard for multimedia

More information

A Novel Deblocking Filter Algorithm In H.264 for Real Time Implementation

A Novel Deblocking Filter Algorithm In H.264 for Real Time Implementation 2009 Third International Conference on Multimedia and Ubiquitous Engineering A Novel Deblocking Filter Algorithm In H.264 for Real Time Implementation Yuan Li, Ning Han, Chen Chen Department of Automation,

More information

STACK ROBUST FINE GRANULARITY SCALABLE VIDEO CODING

STACK ROBUST FINE GRANULARITY SCALABLE VIDEO CODING Journal of the Chinese Institute of Engineers, Vol. 29, No. 7, pp. 1203-1214 (2006) 1203 STACK ROBUST FINE GRANULARITY SCALABLE VIDEO CODING Hsiang-Chun Huang and Tihao Chiang* ABSTRACT A novel scalable

More information

EE 5359 MULTIMEDIA PROCESSING SPRING Final Report IMPLEMENTATION AND ANALYSIS OF DIRECTIONAL DISCRETE COSINE TRANSFORM IN H.

EE 5359 MULTIMEDIA PROCESSING SPRING Final Report IMPLEMENTATION AND ANALYSIS OF DIRECTIONAL DISCRETE COSINE TRANSFORM IN H. EE 5359 MULTIMEDIA PROCESSING SPRING 2011 Final Report IMPLEMENTATION AND ANALYSIS OF DIRECTIONAL DISCRETE COSINE TRANSFORM IN H.264 Under guidance of DR K R RAO DEPARTMENT OF ELECTRICAL ENGINEERING UNIVERSITY

More information

Transcoding from H.264/AVC to High Efficiency Video Coding (HEVC)

Transcoding from H.264/AVC to High Efficiency Video Coding (HEVC) EE5359 PROJECT PROPOSAL Transcoding from H.264/AVC to High Efficiency Video Coding (HEVC) Shantanu Kulkarni UTA ID: 1000789943 Transcoding from H.264/AVC to HEVC Objective: To discuss and implement H.265

More information

Improved H.264/AVC Requantization Transcoding using Low-Complexity Interpolation Filters for 1/4-Pixel Motion Compensation

Improved H.264/AVC Requantization Transcoding using Low-Complexity Interpolation Filters for 1/4-Pixel Motion Compensation Improved H.264/AVC Requantization Transcoding using Low-Complexity Interpolation Filters for 1/4-Pixel Motion Compensation Stijn Notebaert, Jan De Cock, and Rik Van de Walle Ghent University IBBT Department

More information

Video Quality Analysis for H.264 Based on Human Visual System

Video Quality Analysis for H.264 Based on Human Visual System IOSR Journal of Engineering (IOSRJEN) ISSN (e): 2250-3021 ISSN (p): 2278-8719 Vol. 04 Issue 08 (August. 2014) V4 PP 01-07 www.iosrjen.org Subrahmanyam.Ch 1 Dr.D.Venkata Rao 2 Dr.N.Usha Rani 3 1 (Research

More information

Unit-level Optimization for SVC Extractor

Unit-level Optimization for SVC Extractor Unit-level Optimization for SVC Extractor Chang-Ming Lee, Chia-Ying Lee, Bo-Yao Huang, and Kang-Chih Chang Department of Communications Engineering National Chung Cheng University Chiayi, Taiwan changminglee@ee.ccu.edu.tw,

More information

Pyramid Coding and Subband Coding

Pyramid Coding and Subband Coding Pyramid Coding and Subband Coding Predictive pyramids Transform pyramids Subband coding Perfect reconstruction filter banks Quadrature mirror filter banks Octave band splitting Transform coding as a special

More information

ERROR-ROBUST INTER/INTRA MACROBLOCK MODE SELECTION USING ISOLATED REGIONS

ERROR-ROBUST INTER/INTRA MACROBLOCK MODE SELECTION USING ISOLATED REGIONS ERROR-ROBUST INTER/INTRA MACROBLOCK MODE SELECTION USING ISOLATED REGIONS Ye-Kui Wang 1, Miska M. Hannuksela 2 and Moncef Gabbouj 3 1 Tampere International Center for Signal Processing (TICSP), Tampere,

More information

INTERNATIONAL ORGANISATION FOR STANDARDISATION ORGANISATION INTERNATIONALE DE NORMALISATION ISO/IEC JTC1/SC29/WG11 CODING OF MOVING PICTURES AND AUDIO

INTERNATIONAL ORGANISATION FOR STANDARDISATION ORGANISATION INTERNATIONALE DE NORMALISATION ISO/IEC JTC1/SC29/WG11 CODING OF MOVING PICTURES AND AUDIO INTERNATIONAL ORGANISATION FOR STANDARDISATION ORGANISATION INTERNATIONALE DE NORMALISATION ISO/IEC JTC1/SC29/WG11 CODING OF MOVING PICTURES AND AUDIO ISO/IEC JTC1/SC29/WG11 MPEG2011/N12559 February 2012,

More information

Chapter 11.3 MPEG-2. MPEG-2: For higher quality video at a bit-rate of more than 4 Mbps Defined seven profiles aimed at different applications:

Chapter 11.3 MPEG-2. MPEG-2: For higher quality video at a bit-rate of more than 4 Mbps Defined seven profiles aimed at different applications: Chapter 11.3 MPEG-2 MPEG-2: For higher quality video at a bit-rate of more than 4 Mbps Defined seven profiles aimed at different applications: Simple, Main, SNR scalable, Spatially scalable, High, 4:2:2,

More information

Standard Codecs. Image compression to advanced video coding. Mohammed Ghanbari. 3rd Edition. The Institution of Engineering and Technology

Standard Codecs. Image compression to advanced video coding. Mohammed Ghanbari. 3rd Edition. The Institution of Engineering and Technology Standard Codecs Image compression to advanced video coding 3rd Edition Mohammed Ghanbari The Institution of Engineering and Technology Contents Preface to first edition Preface to second edition Preface

More information

JPEG 2000 vs. JPEG in MPEG Encoding

JPEG 2000 vs. JPEG in MPEG Encoding JPEG 2000 vs. JPEG in MPEG Encoding V.G. Ruiz, M.F. López, I. García and E.M.T. Hendrix Dept. Computer Architecture and Electronics University of Almería. 04120 Almería. Spain. E-mail: vruiz@ual.es, mflopez@ace.ual.es,

More information

H.264 / AVC (Advanced Video Coding)

H.264 / AVC (Advanced Video Coding) H.264 / AVC (Advanced Video Coding) 2014-2016 Josef Pelikán CGG MFF UK Praha pepca@cgg.mff.cuni.cz http://cgg.mff.cuni.cz/~pepca/ H.264/AVC 2016 Josef Pelikán, http://cgg.mff.cuni.cz/~pepca 1 / 20 Context

More information

VIDEO AND IMAGE PROCESSING USING DSP AND PFGA. Chapter 3: Video Processing

VIDEO AND IMAGE PROCESSING USING DSP AND PFGA. Chapter 3: Video Processing ĐẠI HỌC QUỐC GIA TP.HỒ CHÍ MINH TRƯỜNG ĐẠI HỌC BÁCH KHOA KHOA ĐIỆN-ĐIỆN TỬ BỘ MÔN KỸ THUẬT ĐIỆN TỬ VIDEO AND IMAGE PROCESSING USING DSP AND PFGA Chapter 3: Video Processing 3.1 Video Formats 3.2 Video

More information

Welcome Back to Fundamentals of Multimedia (MR412) Fall, 2012 Chapter 10 ZHU Yongxin, Winson

Welcome Back to Fundamentals of Multimedia (MR412) Fall, 2012 Chapter 10 ZHU Yongxin, Winson Welcome Back to Fundamentals of Multimedia (MR412) Fall, 2012 Chapter 10 ZHU Yongxin, Winson zhuyongxin@sjtu.edu.cn Basic Video Compression Techniques Chapter 10 10.1 Introduction to Video Compression

More information

Research Article A High-Throughput Hardware Architecture for the H.264/AVC Half-Pixel Motion Estimation Targeting High-Definition Videos

Research Article A High-Throughput Hardware Architecture for the H.264/AVC Half-Pixel Motion Estimation Targeting High-Definition Videos Reconfigurable Computing Volume 2, Article ID 25473, 9 pages doi:.55/2/25473 Research Article A High-Throughput Hardware Architecture for the H.264/AVC Half-Pixel Motion Estimation Targeting High-Definition

More information

Video Coding Standards

Video Coding Standards Based on: Y. Wang, J. Ostermann, and Y.-Q. Zhang, Video Processing and Communications, Prentice Hall, 2002. Video Coding Standards Yao Wang Polytechnic University, Brooklyn, NY11201 http://eeweb.poly.edu/~yao

More information

IN the early 1980 s, video compression made the leap from

IN the early 1980 s, video compression made the leap from 70 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 9, NO. 1, FEBRUARY 1999 Long-Term Memory Motion-Compensated Prediction Thomas Wiegand, Xiaozheng Zhang, and Bernd Girod, Fellow,

More information

High Efficiency Video Coding: The Next Gen Codec. Matthew Goldman Senior Vice President TV Compression Technology Ericsson

High Efficiency Video Coding: The Next Gen Codec. Matthew Goldman Senior Vice President TV Compression Technology Ericsson High Efficiency Video Coding: The Next Gen Codec Matthew Goldman Senior Vice President TV Compression Technology Ericsson High Efficiency Video Coding Compression Bitrate Targets Bitrate MPEG-2 VIDEO 1994

More information

Smoooth Streaming over wireless Networks Sreya Chakraborty Final Report EE-5359 under the guidance of Dr. K.R.Rao

Smoooth Streaming over wireless Networks Sreya Chakraborty Final Report EE-5359 under the guidance of Dr. K.R.Rao Smoooth Streaming over wireless Networks Sreya Chakraborty Final Report EE-5359 under the guidance of Dr. K.R.Rao 28th April 2011 LIST OF ACRONYMS AND ABBREVIATIONS AVC: Advanced Video Coding DVD: Digital

More information

Department of Electrical Engineering, IIT Bombay.

Department of Electrical Engineering, IIT Bombay. Scalable Video Coding Prof V M Gadre Prof. V. M. Gadre Department of Electrical Engineering, IIT Bombay. Scalable Video Coding Video streaming over internet is gaining g more and more popularity due to

More information

Mode-Dependent Pixel-Based Weighted Intra Prediction for HEVC Scalable Extension

Mode-Dependent Pixel-Based Weighted Intra Prediction for HEVC Scalable Extension Mode-Dependent Pixel-Based Weighted Intra Prediction for HEVC Scalable Extension Tang Kha Duy Nguyen* a, Chun-Chi Chen a a Department of Computer Science, National Chiao Tung University, Taiwan ABSTRACT

More information