Description

INTRA-BASE-LAYER PREDICTION METHOD SATISFYING

SINGLE LOOP DECODING CONDITION, AND VIDEO

CODING METHOD AND APPARATUS USING THE

PREDICTION METHOD

Technical Field

[1] Methods and apparatuses consistent with the present invention relate to video coding, and more particularly, to improving the performance of a multi-layer based video codec. Background Art

[2] According to developments in communication technologies including the Internet, in addition to the increase in text and voice communication, image communication is increasing. The related art communication schemes, which are mainly for text communication, cannot satisfy the various demands of customers, so multimedia services capable of providing various types of information including text, image, and music are increasingly being developed. Multimedia data is usually large and requires a large capacity medium for storage and a wide bandwidth for transmission. Therefore, it is important to use a compression coding scheme in order to transmit multimedia data.

[3] The basic principle of data compression is to remove redundancy. Data compression can be achieved by removing spatial redundancy such as repetition of the same color or entity in an image, temporal redundancy such as repetition of the same sound in audio data or little or no change between adjacent pictures in a moving image stream, or the perceptional redundancy based on the fact that the human visual and perceptional capability is insensitive to high frequencies. In typical video coding schemes, temporal redundancy is removed by temporal filtering based on motion compensation, and spatial redundancy is removed by a spatial transform.

[4] Transmission media, which are necessary in order to transmit multimedia data generated, show various levels of performance. Currently used transmission media include media having various transmission speeds, from an ultra high-speed communication network capable of transmitting several tens of mega bits of data per second to a mobile communication network having a transmission speed of 384 kbits per second. In such an environment, it can be said that the scalable vide coding scheme, that is, a scheme for transmitting the multimedia data at a appropriate data rate according to the transmission environment or in order to support transmission media of various speeds, is more appropriate for the multimedia environment. [5] The scalable video coding is a coding scheme by which it is possible to control a resolution, a frame rate, and a Signal-to-Noise Ratio (SNR) of video by discarding part of a compressed bit stream, that is, a coding scheme supporting various scalabilities.

[6] Currently, the Joint Video Team (JVT), which is a joint working group of the

Moving Picture Experts Group (MPEG) and the International Telecommunication Union (ITU), is doing work on standardization, hereinafter, referred to as 'H.264 SE'(Scalable Extension), in order to implement scalability in a multi-layer codec based on H.264.

[7] The scalable video codec based on the H.264 SE basically supports four prediction modes including inter-prediction, directional intra-prediction (hereinafter, referred to as simply 'intra-prediction'), residual prediction, and intra-base-layer prediction. 'Prediction' is a technique for compressively expressing the original data by using prediction data generated from information that is available in both an encoder and a decoder.

[8] Among the four prediction modes, inter-prediction is a mode that is usually used in a video codec having a single layer structure. According to inter-prediction, a block that is most similar to a certain block (current block) of a current picture is searched for from at least one reference picture (previous or future picture), a prediction block that can express the current block as well as possible is obtained from the searched block, and a difference between the current block and the prediction block is quantized.

[9] According to the way of referring to the reference picture, the inter-prediction can be classified into bi-directional prediction which uses two reference pictures, forward prediction which uses a previous reference picture, and a backward prediction which uses a future reference picture.

[10] The intra-prediction is also a prediction scheme used in a single-layer video codec such as H.264. Intra-prediction is a prediction scheme in which a current block is predicted by using pixels adjacent to the current block among the surrounding blocks of the current block. Intra-prediction is different from other prediction modes in that intra-prediction uses only the information within the current picture, and does not refer to other pictures in the same layer or pictures in other layers.

[11] The intra-base-layer prediction can be used in a case where a current picture has a picture (hereinafter, referred to as 'base picture') of a lower layer having the same temporal location in a video codec having a multi-layer structure. As shown in FIG. 2, a macro-block of the current picture can be effectively predicted from the macro-block of the base picture corresponding to the macro-block. Specifically, the difference between the macro-block of the current picture and the macro-block of the base picture is quantized.

[12] When a resolution of a lower layer and a resolution of a current layer are different, the macro-block of the base picture must be up-sampled to the resolution of the current layer before the difference is obtained. When the efficiency of the inter-prediction is not high, for example, in images having very fast motion or images having scene changes, the intra-base-layer prediction described above is especially effective. Intra- base-layer prediction is also called intra-BL prediction.

[13] Finally, inter-prediction with residual prediction (hereinafter, referred to as simply

'residual prediction') is an extension of the inter-prediction from the existing single layer to the multi-layer. As shown in FIG. 3, in the residual prediction, the difference obtained during the inter-prediction of the current layer is not directly quantized, but the obtained difference is compared with a difference obtained through inter-prediction of a lower layer to yield another difference between them, which is then quantized.

[14] In consideration of characteristics of various video sequences, the most effective mode is selected among the four above-mentioned prediction modes, for each of the macro-blocks constituting a picture. For example, the inter-prediction or residual prediction may be selected for video sequences having slow motion, and the intra- base-layer prediction may be mainly selected for video sequences having fast motion.

[15] In comparison with a video codec having a single-layer structure, a video codec having the multi-layer structure has a more complicated prediction structure and mainly uses the open-loop structure. Therefore, more blocking artifacts are observed in the video codec having the multi-layer structure than in the video codec having a single-layer structure. Especially, in the residual prediction, which uses a residual signal of a lower layer picture, a large distortion may occur when the residual signal of the lower layer picture shows characteristics different from those of an inter-predicted signal of the current layer picture.

[16] In contrast, a prediction signal for a macro-block of the current picture during the intra-base-layer prediction, that is, a macro-block of the base picture is not the original signal but is a signal restored after being quantized. Therefore, the prediction signal can be obtained by both an encoder and a decoder, and thus causes no mismatch between the encoder and the decoder. Especially, if the difference between the macro- block of the prediction signal and the macro-block of the current picture is obtained after a smoothing filter is applied to the prediction signal, the blocking artifacts are greatly reduced.

[17] According to the low complexity decoding condition that has been adopted as a working draft of the current H.264 SE, use of the intra-base-layer prediction is limited. That is, according to H.264 SE, use of the intra-base-layer prediction is allowed only when specific conditions are satisfied, so that at least the decoding can be performed in a way similar to the single-layer video codec even if the encoding is performed in the multi-layer manner. [18] According to the low complexity decoding condition (single loop decoding condition), the intra-base-layer prediction is used only when the macro-block type of a macro-block of a lower layer corresponding to a certain macro-block of the current layer is the intra-prediction mode or the intra-base-layer prediction mode, in order to reduce the operation quantity according to the motion compensation process, which occupies the largest portion of the total operation quantity during decoding. However, such limited use of the intra-base-layer prediction greatly degrades the performance for fast-motion images.

Disclosure of Invention Technical Problem

[19] FlG. 1 is a graph illustrating a result obtained by applying a video codec (codec 1) allowing the multi-loop, and a video codec (codec 2) using only the single loop to video sequences having fast motion, e.g. sports sequences, which shows the difference in the luminance component PSNR (Y-PSNR). It should be noted from FlG. 1 that the performance of codec 1 is superior to that of codec 2 for most bit rates.

[20] Although the related art single loop decoding condition can reduce the decoding complexity, it cannot be overlooked that the related art single loop decoding condition also reduces the picture quality. Therefore, it is necessary to develop a method of using the intra-base-layer prediction without restriction while following the single loop decoding condition.

Technical Solution

[21] Exemplary embodiments of the present invention overcome the above disadvantages and other disadvantages not described above. Also, the present invention is not required to overcome the disadvantages described above, and an exemplary embodiment of the present invention may not overcome any of the problems described above.

[22] The present invention provides an intra-base-layer prediction method and a video coding method and apparatus which improve the performance of video coding by providing a new intra-base-layer prediction scheme which satisfies the single loop decoding condition in a multi-layer based video codec.

[23] In according with an aspect of the present invention, there is provided a method of multi-layer based video encoding, the method including obtaining a difference between a base layer block corresponding to a current layer block and an inter-prediction block for the base layer block; down-sampling an inter-prediction block for the current layer block; adding the difference and the down-sampled inter-prediction block; up-sampli ng a result of the addition; and encoding a difference between the current layer block and a result of the up-sampling. [24] In accordance with another aspect of the present invention, there is provided a method of multi-layer based video decoding, the method including restoring a residual signal of a current layer block from texture data of the current layer block included in an input bit stream; restoring a residual signal of a base layer block from texture data of the base layer block which corresponds to the current layer block and is included in the bit stream; down-sampling an inter-prediction block for the current layer block; adding the down-sampled inter-prediction block and the restored residual signal ; up- sampling a result of the addition; and adding the restored residual signal and the result of the up-sampling.

[25] In accordance with another aspect of the present invention, there is provided a multi-layer based video encoder including a subtracter obtaining a difference between a base layer block corresponding to a current layer block and an inter-prediction block for the base layer block; a down-sampler down-sampling an inter-prediction block for the current layer block; an adder adding the difference and the down-sampled inter- prediction block; an up-sampler up-sampling a result of the addition; and an encoding means for encoding a difference between the current layer block and a result of the up- sampling.

[26] In accordance with another aspect of the present invention, there is provided a multi-layer based video decoder including a first restoring means restoring a residual signal of a current layer block from texture data of the current layer block included in an input bit stream; a second restoring means restoring a residual signal of a base layer block from texture data of the base layer block which corresponds to the current layer block and is included in the bit stream; a down-sampler down-sampling an inter- prediction block for the current layer block; a first adder adding the down-sampled inter-prediction block and the residual signal restored by the second restoring means; an up-sampler up-sampling a result of the addition; and a second adder adding the residual signal restored by the first restoring means and the result of the up-sampling. Brief Description of the Drawings

[27] The above and other aspects of the present invention will become apparent from the following detailed description of exemplary embodiments taken in conjunction with the accompanying drawings, in which:

[28] FlG. 1 is a graph illustrating the performance difference between a video codec allowing multi-loop and a video codec using a single loop;

[29] FlG. 2 illustrates an example of application of a de-blocking filter to a vertical boundary between sub-blocks;

[30] FlG. 3 illustrates an example of application of a de-blocking filter to a horizontal boundary between sub-blocks; [31] FlG. 4 is a flowchart of a process for a modified intra-base-layer prediction process according to an exemplary embodiment of the present invention;

[32] FlG. 5 is a block diagram illustrating a construction of a video encoder according to an exemplary embodiment of the present invention;

[33] FlG. 6 is a view for showing the necessity of padding;

[34] FlG. 7 is a view showing a specific example of padding;

[35] FlG. 8 is a block diagram illustrating a construction of a video decoder according to an exemplary embodiment of the present invention;

[36] FIGS. 9 and 10 are graphs illustrating coding performance of a codec according to the present invention. Mode for the Invention

[37] Hereinafter, exemplary embodiments of the present invention will be described with reference to the accompanying drawings. The matters defined in the description such as a detailed construction and elements are provided to assist in a comprehensive understanding of the invention. Thus, it should be apparent that the present invention can be carried out without those defined matters. In the following description of the present invention, the same drawing reference numerals are used for the same elements across different drawings. Also, a detailed description of known functions and configurations incorporated herein will be omitted when it may make the subject matter of the present invention unclear.

[38] As used herein, a layer currently being encoded is called a 'current layer', and another layer to which the current layer makes reference is called a 'base layer'. Further, among pictures in the current layer, a picture located at the current time slot for encoding is called a 'current picture'.

[39] A residual signal R obtained by the related art intra-base-layer prediction can be defined by equation (1):

[40]

R_F = o_h -[υ\o_B (1)

[41]

[42] In equation (1), O denotes a certain block of the current picture, O denotes a

F B block of a base layer picture, and U denotes an up-sampled function. Because the up- sampled function is applicable only when the current layer and the lower layer have different resolutions, the up-sampled function is expressed by [U], which implies that it is selectively applicable. However, because O B can be expressed as a sum of a residual signal R B and a prediction signal P B for the block of the base layer picture, equation (1) can be re-expressed as equation (2): [43]

^ = O, - [U]- (P_{8 +} R₃)

(2)

[44]

[45] According to the single loop decoding condition, it is impossible to use the intra- base-layer prediction when P of equation (2) is a signal generated by the inter-

B prediction. This is a restriction in order to avoid double use of the motion compensation operation which requires a large number of operations during the inter- prediction.

[46] The present invention proposes a new intra-base-layer prediction scheme, which is obtained by slightly modifying the existing intra-base-layer prediction technique as defined by equation (2), and satisfies the single loop decoding condition. According to the proposal of the present invention, the prediction signal P B for the base layer block is obtained by the inter-prediction, the prediction signal is replaced by a prediction signal P for the current layer block or its down-sampled version.

[47] In relation to this proposal is a document entitled 'Smoothed Reference Prediction for Single-loop Decoding', (hereinafter, referred to as 'JVT-0085') proposed by Woo- Jin Han in the seventeenth JVT meeting (Poznan, Poland) which is incorporated herein by reference. This document also recognizes similar problems and discloses a technical solution for overcoming the restriction of the single loop decoding condition.

[48] According to JVT-0085, R can be obtained by equation (3):

[49]

R, = O_F ~ (P_y + [u]. R_B) φ

[50]

[51] As noted from equation (3), P B is replaced by P F , and R B is up-sampled in order to match the resolution between layers. Using this method, JVT-0085 also satisfies the single loop decoding condition. [52] However, JVT-0085 uses up-sampling of the residual signal R B in order to match its resolution with the resolution of the prediction signal P . However, because the residual signal R B has different characteristics from those of typical images, most samples in the residual signal R B have a sample value of 0, except for some samples having a non-zero value. Therefore, due to the up-sampling of the residual signal R B ,

JVT-0085 fails to significantly improve the entire coding performance. [53] The present invention proposes a new approach to down-sample P B of equation (2), and matches its resolution with the resolution of/? B . That is, in the proposed new approach, a prediction signal of the base layer used in the intra-base-layer prediction is replaced by a down-sampled version of the prediction signal of the current layer, so as to satisfy the single loop decoding condition. [54] According to the present invention, it is possible to calculate R by using equation

(4): [55]

Ry = O_h ~ [U] . ([D] . P_{F +} R_B) (₄)

[56]

[57] When compared with equation (3), equation (4) does not include the process of up- sampling R B , which has the problems as described above. Instead, the prediction signal P of the current layer is down-sampled, the result thereof is added to R , and

F B the sum is then up-sampled back to the resolution of the current layer. Because the elements in the parentheses in equation (4) do not represent only a residual signal but represent a signal approaching an actual image, application of up-sampling to the elements does not cause a significant problem.

[58] It is generally known in the art that application of a de-blocking filter in order to reduce the mismatch between a video encoder and a video decoder causes improvement in the coding efficiency.

[59] In the present invention, it is may be preferable to additionally apply a de-blocking filter. When a de-blocking filter is additionally applied, equation (4) is modified to equation (5), wherein B denotes a de-blocking function or de-blocking filter.

[60]

^ = O_F - [U) - B - ([D] - P_{17 +} R₈) (₅)

[61]

[62] Both the de-blocking function B and the up-sampling function U have a smoothing effect, so they play an overlapping role. Therefore, it is possible to simply express the de-blocking function B by using linear combination of the pixels located at the block edges and their neighbor pixels, so that the process of applying the de-blocking function can be performed by a small quantity of operation.

[63] FIGS. 2 and 3 illustrate an example of such a de-blocking filter, when the filter is applied to the vertical edge and the horizontal edge of a 4x4 sized sub-block. As shown in FIGS. 2 and 3, the pixels x(n-l) and x(n), which are located at the edges, can be smoothed through linear combination of themselves with neighbor cells adjacent to them. When the results of the application of the de-blocking filter for the pixels x(n-l) and x(n) are marked as x'(n-l) and x'(n), respectively, x'(n-l) and x'(n) can be defined by equation (6): [64]

x'(n - 1) = a * x(n - 2) + b * x(n - 1) + c * x(n)

x^*(n ) = c * x(n - l) + b * x(n) + a * x(n + 1) (6)

[65]

[66] In equation (6), a, b, and c may be properly selected so that the sum of them should be 1. For example, by selecting a = 1/4, b = 1/2, and c = 1/4 in equation (6), it is possible to raise the weight of a corresponding pixel to be higher than that of neighbor pixels. Of course, it is possible to select more pixels as neighbor pixels in equation (6).

[67] FlG. 4 is a flowchart of a process for a modified intra-base-layer prediction process according to an exemplary embodiment of the present invention.

[68] First, an inter-prediction block 13 for a base block 10 is generated from blocks 11 and 12 in neighbor reference pictures (a forward reference picture and a backward reference picture) of a lower layer corresponding to the base block 10 by motion vectors (Sl). Then, a residual 14, which corresponds to R in equation (5), is obtained by subtracting the prediction block 13 from the base block (S2).

[69] Meanwhile, an inter-prediction block 23 for a current block 20, which corresponds to P in equation (5), is generated from blocks 21 and 22 in neighbor reference pictures of the current layer, which correspond to the current block 20 by motion vectors (S3). Operation S3 may be performed before operations Sl and S2. In general, the 'inter-prediction block' is a prediction block obtained from an image or images of a reference picture corresponding to the current block in a picture to be encoded. The relation between the current block and the corresponding image is expressed by a motion vector. The inter-prediction block may imply either the corresponding image itself when there is a single reference picture or a weighted sum of the corresponding images when there are multiple reference pictures. The inter-prediction block 23 is down-sampled by a predetermined down-sampler (S4). For the down-sampling, an MPEG down-sampler, a wavelet down-sampler, etc. may be used.

[70] Thereafter, the down-sampled result 15, which corresponds to [D]-P of equation (5), is added to the residual obtained in operation S2 (S5). Then, the block 16 generated through the addition, which corresponds to [D] P + R in equation (5), is

F B smoothed by using a de-blocking filter (S6). Then, the smoothed result 17 is up- sampled to the resolution of the current layer by using a predetermined up-sampler (S7). For the up-sampling, an MPEG up-sampler, a wavelet up-sampler, etc. may be used. [71] Then, the up-sampled result 24, which corresponds to [U]-B-([D]-P + R ) m^'

F B equation 5, is subtracted from the current block 20 S6. Finally, the residual 25, which is the result of the subtraction, is quantized (S7).

[72] FIG. 5 is a block diagram of a video encoder 100 according to an exemplary embodiment of the present invention.

[73] First, a predetermined block O (hereinafter, referred to as a 'current block') included in the current picture is input to a down-sampler 103. The down-sampler 103 spatially and/or temporally down-samples the current block O and generates a corresponding base layer block O B .

[74] The motion estimator 205 obtains a motion vector MV by performing motion estimation for the base layer block O with reference to a neighbor picture F '. Such a referred neighbor picture is called 'reference picture'. For the motion estimation, the block matching algorithm is widely used. Specifically, a vector, which has a displacement having a minimum error while a given block is moved pixel by pixel or sub- pixel by sub-pixel (2/2 pixel, 1/4 pixel, and others) within a particular search area of a reference picture, is selected as the motion vector. For the motion estimation, it is possible to use not only a fixed size block matching but also the Hierarchical Variable Size Block Matching (HVSBM) which has been used in the H.264, and others.

[75] If the video encoder 100 is implemented by an open loop codec, an original neighbor picture F stored in the buffer 201 will be used as it is for the reference

° ^e OB picture. However, if the video encoder 100 is implemented by a closed loop codec, a picture (not shown) which has been decoded after being encoded will be used for the reference picture. The following description is focused on the open loop codec, but the present invention is not limited thereto. [76] The motion vector MV B obtained by the motion estimator 205 is provided to the motion compensator 210. The motion compensator 210 extracts an image corresponding to the motion vector MV B from the reference picture F B and generates an inter-prediction block P B from the extracted image. In the case of using a bi-directional reference, the inter-prediction block can be calculated as an average of the extracted images. In the case of using a unidirectional reference, the inter-prediction block may be the same as the extracted image. [77] The subtractor 215 generates the residual block R B by subtracting the inter- prediction block P from the base layer block O . The generated residual block R is

B B B provided to the adder 135.

[78] In the meantime, the current block O is input to the motion estimator 105, the buffer 101, and the subtracter 115. The motion estimator 105 calculates a motion vector MV by performing motion estimation for the current block with reference to the neighbor picture F '. Such a motion estimation process is the same process as that executed in the motion estimator 205, so repetitive description thereof will be omitted here.

[79] The motion vector MV by the motion estimator 105 is provided to the motion compensator 110. The motion compensator 110 extracts an image corresponding to the motion vector MV from the reference picture F and generates an inter-prediction block P from the extracted image.

[80] Then, the down-sampler 130 down-samples the inter-prediction block P provided from the motion compensator 110. At this time, the n: 1 down-sampling is not a simple process for operating n pixel values into one pixel value but is a process for operating values of neighbor pixels adjacent to n pixels into one pixel value. Of course, the number of neighbor pixels to be considered depends on the down-sampling algorithm. The more the neighbor pixels are considered, the smoother the down-sampling result becomes.

[81] Therefore, as shown in FIG. 6, in order to down-sample an inter-prediction block

31, it is necessary to understand the values of the neighbor pixels 32 adjacent to the block 31. However, although it is possible to obtain the inter-prediction block 31 from reference pictures located at different temporal positions, it is not always possible to obtain the block 33 including the neighbor pixels 32. Especially, this problem emerges when the block 33 including the neighbor pixels 32 belongs to the intra-base mode and the base layer block 34 corresponding to the block 33 belongs to the directional intra- mode. It is because, in actual implementation of the H.264 SE, data of a macro-block is stored in a buffer only when the macro-block of the base layer belongs to the intra-base mode. Therefore, when the base layer block 34 belongs to the directional intra-mode, the base layer block 34 corresponding to the block 33 does not exist in the buffer.

[82] Because the block 33 belongs to the intra-base mode, when there is no corresponding base layer block, it is impossible to generate a prediction block thereof and is thus impossible to completely construct the neighbor pixels 32.

[83] In consideration of such a case as described above, the present invention employs padding in order to generate pixel values of a block including the neighbor pixels, when blocks including the neighbor pixels include no corresponding base layer block .

[84] The padding can be performed in a manner similar to the diagonal mode from among the directional intra-prediction, as shown in FIG. 7. That is, pixels I, J, K, and L adjacent to the left side of a certain block 35, pixels A, B, C, and D adjacent to the upper side thereof, and a pixel M adjacent to the left upper corner are copied in a direction with an inclination of 45 degrees. For example, an average of the values of the pixel K and the pixel L is copied to the lowermost-and-leftmost pixel 36 of the block 35.

[85] The down-sampler 130 restores neighbor pixels through the above process when there are omitted neighbor pixels, and then down-samples the inter-prediction block P .

[86] The adder 135 adds the down-sampled result D-P F and the R B output from the subtracter 215, and provides the result D-P + R of the addition to the de-blocking filter 140.

[87] The de-blocking filter 140 smoothes the result D-P + R of the addition by applying a de-blocking function thereto. For the de-blocking function forming the deblocking filter, not only a bi-linear filter may be used as in the H.264, but a simple linear combination can be also used as shown in Equation 6. Further, it is possible to omit such a process by the de-blocking filter, in consideration of the up-sampling process after the de-blocking filter. It is because the smoothing effect can be achieved to some degree only by the up-sampling.

[88] The up-sampler 145 up-samples the smoothed result B-(D-P F + R B), which is then input as a prediction block for the current block O to the subtractor 115. Then, the subtractor 115 generates the residual signal R by subtracting the up-sampled result U B (D P + R )from the current block O .

F B F

[89] Although it may be preferable to perform the up-sampling after the de-blocking as described above, it is also possible to perform the de-blocking after the up-sampling.

[90] The transformer 120 performs spatial transform for the residual signal R and generates a transform coefficient R ^τ. For the spatial transform, various methods including a Discrete Cosine Transform (DCT) and a wavelet transform may be used. The transform coefficient is a DCT coefficient when the DCT is used and is a wavelet coefficient when the wavelet transform is used.

[91] The quantizer 125 quantizes the transform coefficient R , thereby generating a quantization coefficient R . The quantization is a process for expressing transform coefficient R ^τ having a predetermined real number value by using a discrete value. For example, the quantizer 125 may perform the quantization by dividing the transform coefficient R ^τ expressed as a real number value by predetermined quantization steps and then rounding off the result of the division to a nearest integer value.

[92] Meanwhile, the residual signal R B of the base layer is also transformed to a quantization coefficient R in the same manner by the transformer 220 and the quantizer 225. [93] The entropy encoder 150 generates a bit stream by performing no-loss encoding for the motion vector MV estimated by the motion estimator 105, the quantization coefficient R ^Q provided by the quantizer 125, and the quantization coefficient R ^Q provided by the quantizer 225. For the no-loss encoding, various methods including Huffman coding, arithmetic coding, and variable length coding may be used.

[94] FIG. 8 is a block diagram illustrating a construction of a video decoder 300 according to an exemplary embodiment of the present invention.

[95] The entropy decoder 305 performs no-loss decoding for an input bit stream, so as to extract texture data R F of a current block, texture data R B of a base layer block cor- responding to the current block, and a motion vector MV of the current block. The no- loss decoding is an inverse process to the no-loss encoding. [96] The texture data R B ^Q of the base layer block is provided to the de-quantizer 410 and the texture data R of the current block is provided to the de-quantizer 310. Further, the motion vector MV of the current block is provided to the motion compensator 350.

[97] The de-quantizer 310 de-quantizes the received texture data R ^Q of the current block. The de-quantization is a process of restoring a value matching with an index, which is generated during quantization, by using the same quantization table as that used during the quantization process.

[98] The inverse transformer 320 performs an inverse transform for the result of the de- quantization. Such an inverse transform is a process inverse to the transform at the encoder side, which may include an inverse DCT, an inverse wavelet transform, and others.

[99] As a result of the inverse transform, the residual signal R for the current block is restored.

[100] In the meantime, the de-quantizer 410 de-quantizes the received texture data R B ^Q of the base layer block, and the inverse transformer 420 performs an inverse transform for the result R B of the de-quantization. As a result of the inverse transform, the residual signal R B for the base layer block is restored. The restored residual signal R B is provided to the adder 370. [101] The buffer 340 temporarily stores the finally restored picture and then provides the stored picture as a reference picture at the time of restoring another picture. [102] The motion compensator 350 extracts a corresponding image O indicated by the motion vector MV among reference pictures , and generates an inter-prediction block

P F by using the extracted image. When the bi-directional reference is used, the inter- prediction block P can be calculated as an average of the extracted images O '. In contrast, when the uni-directional reference is used, the inter-prediction block P may be the same as the extracted image O '. [103] The down-sampler 360 down-samples the inter-prediction block P provided from the motion compensator 350. The down-sampling process may include the padding as shown in FlG. 7.

[104] The adder 370 adds the down-sampled result D P F and the residual signal R B provided from the inverse transformer 420. [105] The de-blocking filter 380 smoothes the output D-P F + R B of the adder 370 by applying a de-blocking function thereto. For the de-blocking function forming the deblocking filter, not only a bi-linear filter may be used as in the H.264, but a simple linear combination can be also used as shown in Equation 6. Further, it is possible to omit such a process by the de-blocking filter, in consideration of the up-sampling process after the de-blocking filter. [106] The up-sampler 390 up-samples the smoothed result B-(D-P F + R B), which is then input as a prediction block for the current block O to the adder 330. Then, the adder 330 adds the residual signal R F and the up-sampled result U-B-(D-P F + RB), thereby restoring the current block O .

[107] Although it may be preferable to perform the up-sampling after the de-blocking as described above, it is also possible to perform the de-blocking after the up-sampling.

[108] Although an example of coding of a video frame having two layers has been described above with reference to FIGS. 5 and 8, it is apparent to those skilled in the art that the present invention is not limited to such an example and is applicable to coding of a video frame having a structure of more than two layers.

[109] Each of the elements described above with reference to FIGS. 5 and 8 may be implemented by software executed at a predetermined region in a memory, such as task, class, sub-routine, process, object, execution thread, or program, hardware, such as a Field-Programmable Gate Array (FPGA) or an Application-Specific Integrated Circuit (ASIC), or a combination of such software and hardware. These elements may be included in a storage medium readable by a computer or distributed to multiple computers.

[110] FIGS. 9 and 10 are graphs for illustrating coding performance of a codec SRl according to the present invention. FlG. 9 is a graph for showing comparison of luminance PSNR (Y-PSNR) between the inventive codec SRl and the related art codec ANC in video sequences having various frame rates of 7.5, 15, and 30 Hz. As shown FlG. 9, the codec according to the present invention shows an improvement of maximum 25 dB in comparison with the related art codec, and such a PSNR difference is observed nearly constant regardless of the frame rates.

[Ill] FlG. 10 is a graph showing a comparison of the performance of a codec SR2 to which a method presented by the JVT-85 document is applied and the performance of the inventive codec SRl in video sequences having various frame rates. As noted from FlG. 10, the PSNR difference between the two codec is maximum 0.07 dB, which is maintained during most comparison intervals. Industrial Applicability

[112] According to the present invention, it is possible to use the intra-base-layer prediction without limitation, while satisfying the single loop decoding condition in a multi-layer based video codec.

[113] Such unlimited use of the intra-base-layer prediction can improve the performance of the video coding.

[114] Although exemplary embodiments of the present invention has been described for illustrative purposes, those skilled in the art will appreciate that various modifications, additions and substitutions are possible, without departing from the scope and spirit of the invention as disclosed in the accompanying claims.