US 9,307,246 B2Grant
Apparatus for decoding moving picture
Issue Date:2016-04-05
•4 Claims
•6 Drawing Sheets
Abstract
Provided is an intra prediction decoding apparatus that restores quantized residual coefficients, intra prediction information and size information on a prediction unit from a received bit stream, restores an intra prediction mode of the current prediction unit on the basis of the intra prediction information and the size information on the current prediction unit, generates unavailable reference pixels of the prediction unit, and adaptively filters the reference pixels on the basis of the intra prediction mode. Also, the apparatus generates a prediction block by adaptively filtering reference pixels corresponding to the intra prediction mode. Then, the apparatus generates a restoration image using the prediction block and a restored residual block. Accordingly, a prediction block close to an original image can be restored, and an image compression ratio can be improved.
Metadata
Assignee
- M & K HOLDINGS INC.
Inventors
- Soo Mi Oh
- Moonock Yang
Application Information
Application Number:US 13/624,852
Filing Date:2012-09-21
Priority Date:2010-07-31
Art Unit:2487
Classifications
IPC:
H04N7/32H04N19/117H04N19/176H04N19/46H04N19/593H04N19/157H04N19/182H04N19/82
Field of Search:
H04N 19/176
Patent Drawings (6 sheets)
Description
Cross-Reference to Related Applications
[0001] This application is a continuation application of International Application No. PCT/KR2011/005590 filed on Jul. 29, 2011, which claims priority to Korean Application No. 10-2010-0074460 filed on Jul. 31, 2010 and Korean Application No. 10-2011-0063288 filed Jun. 28, 2011, which applications are incorporated herein by reference.
Technical Field
[0002] The present invention relates to an intra prediction decoding apparatus, and more particularly, to an apparatus that decodes an intra prediction mode, adaptively generates a prediction block and a residual block according to the intra prediction mode, and thereby generates a reconstructed block.
Background Art
[0003] In image compression methods such as Motion Picture Experts Group (MPEG)-1, MPEG-2, MPEG-4 and H.264/MPEG-4 Advanced Video Coding (AVC), one picture is divided into macroblocks to encode an image. Then, the respective macroblocks are encoded using inter prediction or intra prediction.
[0004] In intra prediction, a current block of a current picture is encoded not using a reference picture, but using values of pixels spatially adjacent to the current block. An intra prediction mode with little distortion is selected by comparing a prediction block generated using the adjacent pixel values with an original macroblock. Then, using the selected intra prediction mode and the adjacent pixel values, prediction values of the current block are calculated. Difference between the prediction values and pixels values of the original current block are calculated and then encoded through transform coding, quantization and entropy coding. The intra prediction mode is also encoded.
[0005] Intra prediction are generally classified into 4×4 intra prediction, 8×8 intra prediction and 16×16 intra prediction for luminance components and chrominance components.
[0006] In 16×16 intra prediction according to related art, there are four modes of a vertical mode, a horizontal mode, a direct current (DC) mode and a plane mode.
[0007] In 4×4 intra prediction according to related art, there are nine modes of a vertical mode, a horizontal mode, a DC mode, a diagonal down-left mode, a diagonal down-right mode, a vertical right mode, a vertical left mode, a horizontal-up mode and a horizontal-down mode.
[0008] Each prediction mode has indexed according to the frequency of use of the respective modes. The vertical mode that is mode 0 shows the highest possibility of being used most frequently for performing intra prediction on a target block, and the horizontal-up mode that is mode 8 shows the highest possibility of being used most infrequently.
[0009] According to H.264 standards, a current block is encoded using a total of 13 modes, that is, 4 modes of the 4×4 intra prediction and 9 modes of the 16×16 intra prediction. A bit stream of the current block is generated according to an optimal mode among these modes.
[0010] However, when some or all values of pixels adjacent to current block do not exist or are not already encoded, it is impossible to apply some or all of the intra prediction modes to the current block. Also, when a difference between adjacent reference pixels is large, a difference between a prediction block and an original block becomes large. Therefore, new technique is required to reduce the difference between an original block and a prediction block generated based on positions of reference pixels used for generating the prediction block.
Summary of the Disclosure
[0011] The present invention is directed to an intra prediction decoding apparatus for effectively reconstructing a coded image with high compression efficiency by generating or reconstructing a prediction block close to an original image.
[0012] One aspect of the present invention provides an intra prediction decoding apparatus, including: an entropy decoder configured to restore quantized residual coefficients, intra prediction information and size information on a prediction unit from a received bit stream; a prediction mode decoder configured to restore an intra prediction mode of the current prediction unit on the basis of the intra prediction information and the size information on the current prediction unit received from the entropy decoder; a residual signal decoder configured to restore a residual signal according to the intra prediction mode received from the prediction mode decoder; a reference pixel generator configured to restore unavailable reference pixels of the current prediction unit, and adaptively filter the reference pixels on the basis of the intra prediction mode of the current prediction unit received from the prediction mode decoder; a prediction block generator configured to generate a prediction block using reference pixels corresponding to the intra prediction mode received from the prediction mode decoder; a prediction block post-processor configured to adaptively filter the prediction block generated from the prediction block generator according to the intra prediction mode received from the prediction mode decoder; and an image restorer configured to receive the prediction block from the prediction block generator or the prediction block post-processor in units of the prediction unit according to the intra prediction mode received from the prediction mode decoder, and generate a restoration image using a restored residual block received from the residual signal decoder.
[0013] An intra prediction decoding apparatus according to the present invention generates reference pixels and adaptively filters the reference pixels in order to generate a prediction block minimizing the difference between a prediction block and an original block. Also, by generating or modifying a prediction block using reference pixels that are not used for generating a prediction block, the prediction block similar to an original block can be reconstructed, and an image compression can be improved.
Brief Description of Drawings
[0014] FIG. 1 is a block diagram of a moving picture coding apparatus according to the present invention.
[0015] FIG. 2 is a block diagram of an intra predictor according to the present invention.
[0016] FIG. 3 is a conceptual diagram showing directional intra prediction modes according to the present invention.
[0017] FIG. 4 a flow chart illustrating a process of encoding an intra prediction mode of a prediction unit performed in a prediction mode coder according to the present invention.
[0018] FIG. 5 is a block diagram of an intra prediction decoding apparatus according to the present invention.
Detailed Description of the Disclosure
[0019] Hereinafter, various embodiments of the present invention will be described in detail with reference to the accompanying drawings. However, the present invention is not limited to the exemplary embodiments disclosed below, but can be implemented in various types. Therefore, many other modifications and variations of the present invention are possible, and it is to be understood that within the scope of the disclosed concept, the present invention may be practiced otherwise than as has been specifically described.
[0020] For image coding, each picture consists of one or more slices, and each slice consists of a plurality of coding units. Since an image of a high-definition (HD) grade or higher has many smooth regions, an image compression can be improved by encoding the image with coding units of various sizes.
[0021] Coding units according to the present invention have a quad tree structure and can be hierarchically divided using depth information. A coding unit of the largest size is referred to as a largest coding unit (LCU), and a coding unit of the smallest size is referred to as a smallest coding unit (SCU). Information relating to the LCU and the SCU may be included in a sequence parameter set (SPS) and transmitted.
[0022] A LCU consists of one or more coding units. The LCU has the form of a recursive coding tree so as to include a division structure of the LCU and corresponding coding units. The LCU may be one coding unit or may be divided into a plurality of coding units. When the LCU is one coding unit, the coding tree may contain one coding unit and information indicating that the LCU is not divided. On the other hand, when the LCU is divided into four coding units, the coding tree may contain four sub-coding trees and information indicating that the LCU is divided. Likewise, each sub-coding tree has the same structure as the LCU. However, a coding unit of the SCU size is not divided into coding units.
[0023] Meanwhile, each coding unit in the coding tree is subjected to intra prediction or inter prediction in units of the coding unit itself or a sub-partition. A unit in which the intra prediction or the inter prediction is performed is referred to as a prediction unit. A size of the prediction unit may be 2N×2N or N×N in intra prediction. A size of the prediction unit may be 2N×2N, 2N×N, N×2N or N×N in inter prediction. Here, 2N denotes horizontal and vertical lengths of the coding unit.
[0024] Meanwhile, a prediction unit for intra prediction may not be a square. For example, a square coding unit may be divided into four hN×2N prediction units or four 2N×hN prediction units for intra prediction. In this case, the distance between a reference pixel and a pixel of a prediction block for intra prediction is reduced, such that prediction efficiency can be improved. This intra prediction method is short distance intra prediction (SDIP).
[0025] A coding unit includes prediction mode and size information (part_mode) of each prediction unit within the coding unit. To improve coding efficiency, the prediction mode and the size information may be combined and joint-coded. In this case, each coding unit includes a joint-coded prediction type.
[0026] A coding unit includes additional information required for generating a prediction block of each prediction unit and a residual signal. The additional information is defined per prediction unit. In intra prediction, the additional information includes encoded intra prediction information. In inter prediction, the additional information includes encoded motion information. The motion information includes a motion vector and a reference picture index.
[0027] A residual signal is included in each coding unit. A residual signal includes one transform tree, one luminance residual signal carrier and two chrominance residual signal carriers. The residual signal carriers include encoded residual information on one or more transform units. The largest size of the transform unit is equal to or smaller than the size of the coding unit. The transform unit may have the same size as the largest transform unit or a sub-transform unit of the largest transform unit.
[0028] The transform tree includes information indicating a division structure of the transform unit for the residual signal included in the coding unit. Also, the transform tree includes information indicating whether or not a residual signal of each transform unit is 0.
[0029] The residual signal carrier carries encoded residual information on transform units corresponding to the information indicating the division structure in the transform tree in units of coding units.
[0030] Although the above description has been made of only a prediction unit obtained by equally dividing a coding unit, unequal division is also possible. In other words, for compressing a residual signal, it may be more effective to unequally divide an image signal in a specific direction according to a boundary of an image and perform intra or inter prediction.
[0031] The simplest adaptive mode is to divide a coding unit into two blocks using a straight line so as to extract statistical dependency of a prediction region on local topography. A boundary of an image is matched to straight line and divided. In this case, dividable directions may be limited to a predetermined number. For example, a method of dividing a block may be limited to four directions of horizontal, vertical, upward diagonal and downward diagonal directions. Also, the division may be limited to the horizontal and vertical directions only. The number of dividable directions can be three, five, seven and so on. The number of dividable directions may vary according to a size of the coding block. For example, for a coding unit of a large size, the number of dividable directions may be relatively increased.
[0032] In inter prediction, when one coding unit is divided into two prediction units for more adaptive prediction, motion estimation and motion compensation should be performed on each of prediction units. After prediction blocks are derived from the respective two prediction units divided from the one coding unit, the two prediction blocks may be added to generate the prediction block having the same size as the coding unit. In this case, to reduce difference between pixel values on both sides of a division boundary of the prediction block of the coding unit size, pixels positioned at the division boundary may be filtered. The prediction block may be generated such that the prediction blocks corresponding to the respective prediction units overlap, and the overlapping boundary portion may be smoothed to generate the one prediction block.
[0033] FIG. 1 is a block diagram of a moving picture coding apparatus according to the present invention.
[0034] Referring to FIG. 1 , a moving picture coding apparatus 100 according to the present invention includes a picture divider 110, a transformer 120, a quantizer 130, a scanner 131, an entropy coder 140, an intra predictor 150, an inter predictor 160, an inverse quantizer 135, an inverse transformer 125, a post-processor 170, a picture storage 180, a subtracter 190 and an adder 195.
[0035] The picture divider 110 analyzes an input video signal to divide each LCU of a picture into one or more coding units each of which has a predetermined size, determine prediction mode of each coding unit, and determines size of prediction unit per each coding unit. The picture divider 110 sends the prediction unit to be encoded to the intra predictor 150 or the inter predictor 160 according to the prediction mode. Also, the picture divider 110 sends the prediction units to be encoded to the subtracter 190.
[0036] The transformer 120 transforms a residual signal between an original block of an input prediction unit and a prediction block generated by the intra predictor 150 or the inter predictor 160. The residual block may have a size of coding unit. The residual block may be divided into optimal transform units and transformed. A transform matrix type may be adaptively determined according to the prediction mode and the intra prediction mode. The transform unit of the residual signal may be transformed by horizontal and vertical one-dimensional (1D) transform matrices. In inter prediction, one predetermined transform matrix type is applied. In intra prediction, there is a high possibility that the residual signal will have vertical directivity when the intra prediction mode of the current prediction unit is horizontal.
[0037] Thus, a discrete cosine transform (DCT)-based integer matrix is applied to the vertical direction, and a discrete sine transform (DST) or Karhunen Loeve transform (KLT)-based integer matrix is applied to the horizontal direction. When the intra prediction mode is vertical, a DST or KLT-based integer matrix is applied to the vertical direction, and a DCT-based integer matrix is applied to the horizontal direction. Alternatively, in intra prediction, the transform matrix may be adaptively determined according to the size of the transform unit.
[0038] The quantizer 130 determines a quantization step size for quantizing transform coefficients of the residual block according to coding units. The quantization step size is determined per coding unit size equal to or larger than a predetermined size. The predetermined size may be 8×8 or 16×16. Using the determined quantization step size and a quantization matrix determined according to a prediction mode, the transform coefficients are quantized. The quantizer 130 uses quantization step sizes of the coding units adjacent to the current coding unit to generate a quantization step size predictor of the current coding unit. The quantizer 130 sequentially searches a left coding unit, an upper coding unit and an upper left coding unit of the current coding unit, determines the quantization step size predictor of the current coding unit using quantization step sizes of one or more valid coding units, and transmits a difference between the quantization step size and the quantization step size predictor of the current coding unit to the entropy coder 140.
[0039] When a slice is divided into coding units, there may be none of a left coding unit, an upper coding unit and an upper left coding unit of the current coding unit. On the other hand, there may be a previous coding unit of the current coding unit in a coding order. Thus, coding units adjacent to the current coding unit and the previous coding unit may be candidates. In this case, priority may be sequentially given to 1) the left coding unit of the current coding unit, 2) the upper coding unit of the current coding unit, 3) the upper left coding unit of the current coding unit and 4) the previous coding unit of the current coding unit. The sequence may vary, or the upper left coding unit may be omitted.
[0040] The quantized transform block is provided to the inverse quantizer 135 and the scanner 131.
[0041] The scanner 131 scans the quantized transform coefficients of the quantized transform block, thereby converting the quantized transform coefficients into 1D quantized transform coefficients. A coefficient scanning method is determined according to the prediction mode and the intra prediction mode. Also, the coefficient scanning method may be determined differently according to the size of the transform units. The scanner 131 determines whether or not to divide a quantized transform block into a plurality of subsets on the basis of a size of the current transform unit. When the size of the transform unit is larger than a first reference size, the scanner 131 divides the quantized transform block into a plurality of subsets. The first reference size may be 4×4 or 8×8.
[0042] The scanner 131 determines a scan pattern to be applied to the quantized transform block. In inter prediction, only one predetermined scan pattern (e.g., zigzag scan) can be applied. In intra prediction, a scan pattern determined according to the intra prediction mode can be applied. The scan pattern may vary according to a directional intra prediction mode. Zigzag scan is applied to non-directional intra prediction modes. A non-directional mode may be a direct current (DC) mode or a planar mode. The quantized transform coefficients are scanned in a reverse direction.
[0043] When the quantized transform coefficients are divided into the plurality of subsets, the same scan pattern is applied to the quantized coefficients in each subset. The plurality of subsets consist of one main subset and one or more residual subsets. The main subset is located at an upper left side and includes a DC coefficient and the one or more residual subsets cover region other than the main subset.
[0044] Zigzag scan may be applied to scan the subsets. The subsets may be scanned beginning with the main subset to the residual subsets in a forward direction, or can be scanned in a reverse direction. A scan pattern for scanning the subsets may be set the same as a scan pattern for scanning the quantized transform coefficients. In this case, the scan pattern for scanning the subsets is determined according to the intra prediction mode. An encoder transmits information capable of indicating a position of the last non-zero quantized coefficient of the transform unit to a decoder. The encoder also transmits information capable of indicating a position of the last non-zero quantized coefficient in each subset to the decoder.
[0045] The inverse quantizer 135 inversely quantizes the quantized transform coefficients. The inverse transformer 125 restores a residual block of the spatial domain from the inversely quantized transform coefficients. The adder 195 generates a reconstruction block by adding the residual block reconstructed by the inverse transformer 125 and the prediction block from the intra predictor 150 or the inter predictor 160.
[0046] The post-processor 170 performs a deblocking filtering process for removing blocking artifact generated in a reconstructed picture, an adaptive offset application process for complementing a difference between the reconstructed picture and the original image per pixel, and an adaptive loop filter process for complementing a difference between the reconstructed picture and the original image in a coding unit.
[0047] The deblocking filtering process may be applied to a boundary between predictive coding blocks and between transform blocks. The boundary is an edge of a grid having a predetermined size or more and the predetermined size may be 8×8. The deblocking filtering process includes a step of determining a boundary to be filtered, a step of determining boundary filtering strength to be applied to the boundary, a step of determining whether or not to apply a deblocking filter, and a step of selecting a filter to be applied to the boundary when it is determined to apply the deblocking filter.
[0048] Whether or not to apply the deblocking filter is determined according to i) whether or not the boundary filtering strength is greater than 0 and ii) whether or not a value indicating the difference between boundary pixels of P block and Q block is smaller than a first reference value determined according to a quantization parameter.
[0049] Two or more filters may exist. When an absolute value of a difference between two pixels adjacent to the block boundary is equal to or larger than a second reference value, a weak filter is selected. The second reference value is determined by the quantization parameter and the boundary filtering strength.
[0050] The adaptive offset application process is intended to reduce a difference (distortion) between a pixel subjected to the deblocking filter and the original pixel. A picture or slice may be divided into a plurality of offset regions, and an offset mode may be determined per the offset region. There are four edge offset modes, two band offset modes and an offset non-application mode. According to each offset mode, pixels in each offset region are classified into a predetermined number of classes, and offset corresponding to the classified class is added to the pixel. In the case of an edge offset mode, a class of a current pixel is determined by comparing the current pixel value with pixel values of two or more pixels adjacent to the current pixel.
[0051] The adaptive loop filter process may be performed on the basis of a value obtained by comparing an original image and a reconstructed image to which the deblocking filtering process or the adaptive offset application process is applied. An adaptive loop filter (ALF) is detected through one Laplacian activity value on the basis of a 4×4 block. The determined ALF can be applied to all pixels included in a 4×4 block or an 8×8 block. Whether or not to apply an ALF may be determined according to coding units. A size and coefficients of a loop filter may vary according to each coding unit. Information indicating whether the ALF is applied to each coding unit, filter coefficient information, filter shape information, etc. may be included in slice header and transmitted to the decoder. In the case of a chrominance signal, whether or not to apply the ALF may be determined in picture units. Unlike luminance, the loop filter may have a rectangular shape.
[0052] The picture storage 180 receives post-processed image data from the post-processor 170, and stores the image in picture units. A picture may be a frame or a field. The picture storage 180 has a buffer (not shown) capable of storing a plurality of pictures.
[0053] The inter predictor 160 performs motion estimation using one or more reference pictures stored in the picture storage 180, and determines a reference picture index indicating the reference pictures and a motion vector. According to the reference picture index and motion vector, the inter predictor 160 extracts a prediction block corresponding to a prediction unit to be encoded from a reference picture selected among a plurality of reference pictures stored in the picture storage 180 and outputs the extracted prediction block.
[0054] The intra predictor 150 performs intra prediction using a reconstructed pixel value in a picture including a current prediction unit. The intra predictor 150 receives the current prediction unit to be predictively encoded, selects one of a predetermined number of intra prediction modes, and performs intra prediction. The predetermined number of intra prediction modes depends on a size of the current prediction unit. The intra predictor 150 adaptively filters reference pixels used to generate the intra prediction block. When some of reference pixels are not valid, it is possible to generate the reference pixels at the invalid positions using valid reference pixels.
[0055] The entropy coder 140 entropy-codes the quantized transform coefficients from the quantizer 130, intra prediction information received from the intra predictor 150, motion information received from the inter predictor 160, and so on.
[0056] FIG. 2 is a block diagram of an intra predictor 150 according to the present invention.
[0057] Referring to FIG. 2 , the intra predictor 150 includes a prediction unit receiver 141, a reference pixel generator 142, a prediction block generator 143, a prediction block post-processor 144, a prediction mode determiner 145 and a prediction mode coder 146.
[0058] The prediction unit receiver 141 receives a prediction unit as input. The prediction unit receiver 141 transmits size information on the received prediction unit to the prediction mode determiner 145 and the reference pixel generator 142, and transmits the prediction unit to the reference pixel generator 142 and the prediction block generator 143.
[0059] The reference pixel generator 142 determines whether reference pixels of the received current prediction unit are available. The reference pixels of the current prediction unit used for intra prediction consist of a corner reference pixel positioned at (x=−1, y=−1), 2L upper reference pixels positioned at (x=0, . . . , 2L−1, y=−1), and 2M left reference pixels positioned at (x=0, y=0, . . . , and 2M−1). Here, L is a width of the current prediction unit, and M is a height of the current prediction unit.
[0060] When the reference pixels are unavailable or insufficient, reference pixels are generated.
[0061] When no reference pixels are available, reference pixels are generated with a predetermined value.
[0062] When some of the reference pixels are unavailable, it is determined whether the unavailable reference pixels exist in only one direction from available pixels or between the available pixels.
[0063] When the unavailable reference pixels exist in only one direction from the available pixels, reference pixels are generated by copying the value of an available pixel closest to the unavailable pixel. For example, when the current prediction unit is positioned at an upper boundary of a picture or a slice, the corner reference pixel and the upper reference pixels are unavailable. Thus, in this case, the corner reference pixel and the upper reference pixels can be generated by copying a reference pixel positioned at (x=−1, y=0). Alternatively, reference pixels may be generated using an available reference pixel of the closest position and one or more available reference pixels. For example, when the corner reference pixel and reference pixels at positions (x=0, . . . , and L−1, y=−1) are available and reference pixels at positions (x=L, . . . , 2L−1, y=−1) are unavailable, reference pixels at the unavailable positions can be generated using change in difference between a reference pixel value at a position (x=L−1, y=−1) and a corner reference pixel value or another reference pixel value.
[0064] When the unavailable reference pixels exist between the available pixels, reference pixels are generated using two available pixels p and q adjacent to the unavailable reference pixels. For example, when the corner reference pixel and the upper reference pixels positioned at (x=0, . . . , and L−1, y=−1) are unavailable, reference pixels existing between the reference pixel p at a position (x=−1, y=0) and the reference pixel q at a position (x=L, y=−1) can be generated using the reference pixels p and q.
[0065] The generated reference pixel values may be obtained by rounding off an average of the reference pixel p and the reference pixel q. Also, the reference pixel values may be generated using change in difference between pixels values of the reference pixel p and the reference pixel q. In this case, the reference pixel values may be generated by linear interpolation determined according to positions corresponding to the generated pixel values or using a weighted average of the two reference pixels.
[0066] Meanwhile, when a plurality of prediction units are on an upper side of the current prediction unit, there is a high possibility that a difference between boundary pixels present on both sides of a boundary between two of the upper prediction units will be higher than a difference between adjacent pixels in each upper prediction unit. This results from an error caused by a quantization parameter. It is highly probable that the error will occur in directional intra prediction modes in which a prediction pixel of the prediction block is generated using two adjacent reference pixels.
[0067] In particular, the modes (mode numbers 3, 6 and 9) having a direction of 45° with reference to the horizontal or vertical direction of FIG. 3 are most seriously affected. In the vertical and horizontal intra prediction modes (mode numbers 0 and 1), one pixel is used to generate a prediction pixel of a prediction block, and thus the vertical and horizontal intra prediction modes are slightly affected.
[0068] For this reason, a filter (smoothing filter) is applied to the reference pixels in the directional intra prediction modes 3, 6 and 9, and is not applied to the reference pixels in the vertical and horizontal intra prediction modes. In the DC mode among the non-directional intra prediction modes, the filter is not applied to reference pixels either. For these modes, whether or not to apply the filter may be determined regardless of the size of the current prediction unit.
[0069] In directional intra prediction modes existing between the intra prediction mode 3, 6 or 9 and the horizontal or vertical intra prediction mode, the filter can be adaptively applied to reference pixels according to the size of the prediction unit. It is preferable to increase a probability of applying the filter as the direction of the directional intra prediction mode is relatively closer to the direction of the intra prediction mode having the direction of 45°. Specifically, when a first directional intra prediction mode is closer in directivity to the intra prediction mode having the direction of 45° than a second directional intra prediction mode, if a filter is applied to the reference pixels in the second directional intra prediction mode, the filter is also applied to the reference pixels in the first directional intra prediction mode. On the other hand, if the filter is applied to the reference pixels in the first directional intra prediction mode, the filter may or may not be applied to the reference pixels in the second directional intra prediction mode.
[0070] There is a high possibility that a change in difference between pixels in a prediction unit of a large size will be less than a change in difference between pixels in a prediction unit of a small size. Thus, the number of directional modes in which the filter is applied may increase or the stronger filter may be applied as the size of the prediction unit increases. On the other hand, when a prediction unit becomes smaller than a specific size, the filter may not be applied.
[0071] For one example, in the intra prediction mode 3, 6 or 9, a first filter may be applied to reference pixels of a prediction unit having a size equal to or smaller than a first size, and a second filter that is stronger than the first filter may be applied to reference pixels of a prediction unit having a size larger than the first size. The first size may vary according to directional prediction modes.
[0072] For another example, in the intra prediction mode 5 existing between the vertical intra prediction mode and the intra prediction mode 6, no filter may be applied to a prediction unit having a size equal to or smaller than a second size, the first filter may be applied to reference pixels of a prediction unit having a size larger than the second size and equal to or smaller than a third size, and the second filter may be applied to a prediction unit having a size larger than the third size. The second size and the third size may vary according to directional prediction modes.
[0073] The first filter may be a 3-tap filter [1, 2, 1] or a 5-tap filter [1, 2, 4, 2, 1]. The second filter has a greater smoothing effect than the first filter.
[0074] The prediction block generator 143 generates a prediction block using reference pixels determined by the intra prediction mode.
[0075] In the directional intra prediction mode, the corresponding reference pixels vary according to the intra prediction mode. For example, in the vertical mode, L upper reference pixels positioned at (x=0, . . . , and L−1, y=−1) are used, and in the horizontal mode, L left reference pixels positioned at (x=−1, y=0, . . . , and L−1) are used.
[0076] In non-directional intra prediction mode, the corner pixel, the L upper reference pixels positioned at (x=0, . . . , and L−1, y=−1) and the L left reference pixels positioned at (x=−1, y=0, . . . , and L−1) are used. The non-directional intra prediction mode is the DC mode or the planar mode.
[0077] In the planar mode, a reference pixel of a prediction block is generated using the corner reference pixel, a left reference pixel and an upper reference pixel. When a reference pixel to be generated is positioned at (a, b), a prediction pixel X(a, b) is generated using the corner reference pixel C(x=−1, y=−1), an upper reference pixel T(x=a, y=−1) and a left reference pixel L(x=−1, y=b). Specifically, X(a, b)=L(x=−1, y=b)+T(x=a, y=−1)−C(x=−1, y=−1).
[0078] In the intra prediction mode existing to the right side of the vertical mode of FIG. 3 , a possibility that a difference between pixel of a lower left region of the generated prediction block and corresponding pixel of the original prediction unit will increase if the prediction block is generated using only upper reference pixels. However, when a prediction block is generated using upper reference pixels and left reference pixels, the difference can be reduced. This effect is greatest in the intra prediction mode 6. Also in intra prediction modes existing under the horizontal mode of FIG. 3 , same method may be applied, and the effect is greatest in the intra prediction mode 9.
[0079] Thus, in the intra prediction mode 6 or 9, a prediction pixel may be generated using one upper interpolation reference pixel and one left interpolation reference pixel. The prediction pixel may be generated by linear interpolation of the one upper interpolation reference pixel and the one left interpolation reference pixel or using an average that is rounded off. Likewise, in a predetermined number of intra prediction modes adjacent to mode 6 or 9, a prediction block can be generated using the left reference pixels and the upper reference pixels. For example, in intra prediction mode 6 or a mode belonging to the predetermined number of (e.g., four) prediction modes adjacent to mode 6, the left reference pixels and the upper reference pixels can be used to generate a prediction block. In this case, to reduce complexity, the aforementioned method may not be applied in intra prediction modes having mode numbers greater than a predetermined mode number (e.g., 9 or 17). Also, the method may be applied to only a current prediction unit having a size equal to or larger than a predetermined size. The predetermined size is 8×8 or 16×16.
[0080] The prediction block post-processor 144 adaptively filters the prediction block generated by the prediction block generator 143. To reduce a difference between a reference pixel and a prediction pixel adjacent to the reference pixel, the prediction block post-processor 144 adaptively filters some or all prediction pixels adjacent to the reference pixel not used to generate the prediction block according to the intra prediction mode.
[0081] In the planar mode, the prediction pixels are generated using all reference pixels adjacent to the prediction pixel, and thus no filter is applied.
[0082] In the DC mode, an average of reference pixels is used to generate prediction pixel, and thus a filter is applied. Different type of filter can be used according to the size of prediction unit. In a prediction unit of a large size, a filter that is the same as used in a prediction unit of a small size or a strong filter having a great smoothing effect can be used.
[0083] The prediction mode determiner 145 determines the intra prediction mode of the current prediction unit using reference pixels. The prediction mode determiner 145 may select one intra prediction mode with minimum coded bits of a residual block among intra prediction modes of the current prediction unit.
[0084] The prediction mode coder 146 encodes the intra prediction mode of the current prediction unit using intra prediction modes of prediction units adjacent to the current prediction unit.
[0085] FIG. 4 is a flow chart illustrating a process of encoding an intra prediction mode of a current prediction unit performed in the prediction mode coder 146 according to the present invention.
[0086] First, intra prediction mode candidates of a current prediction unit are searched for (S110). An upper intra prediction mode and a left intra prediction mode of the current prediction unit may be the intra prediction mode candidates. A corner intra prediction mode may also be added, or a new mode may be added according to the upper intra prediction mode and the left intra prediction mode.
[0087] When there are a plurality of upper prediction units of the current prediction unit, the plurality of upper prediction units are scanned in a predetermined direction (e.g., from right to left) to determine the intra prediction mode of a first valid prediction unit as an upper intra prediction mode. Also, when there are a plurality of left prediction units of the current prediction unit, the plurality of left prediction units are scanned in a predetermined direction (e.g., from bottom to top) to determine the intra prediction mode of a first valid prediction unit as a left intra prediction mode. Alternatively, among a plurality of valid prediction units, the intra prediction mode of a valid prediction unit having the lowest intra prediction mode number may be set as an upper intra prediction mode.
[0088] The corner intra prediction mode may be set as a prediction mode of a prediction unit adjacent to the upper right side or the upper left side of the current prediction unit. Alternatively, the corner intra prediction mode may be set as a first valid intra prediction mode obtained by scanning intra prediction modes adjacent to the upper left side, the upper right side and a lower right side of the current prediction unit in a predetermined order. The predetermined order is the upper left side, the lower right side and the upper right side. Alternatively, two (upper right side and upper left side) or three (upper right side, upper left side and lower left side) corner intra prediction modes may be added as intra prediction mode candidates of the current prediction unit.
[0089] Next, it is determined whether or not to change intra prediction mode candidate of the valid intra prediction mode candidates (S120).
[0090] When it is determined to change the intra prediction mode, the valid intra prediction mode candidate is changed (S130).
[0091] Specifically, when the mode number of a valid intra prediction mode candidate is equal to or greater than the number of intra prediction modes permissible for the current prediction unit, the valid intra prediction mode candidate is converted into one of the permissible modes. The number of permissible modes may vary according to a size of the current prediction unit. For example, when the size of the current prediction unit is 4×4, the intra prediction mode of the valid intra prediction mode candidate is converted into one of nine modes (mode 0 to mode 8) or 18 modes, and when the size of the current prediction unit is 64×64, the intra prediction mode value of the valid intra prediction mode candidate is converted into one of four modes (mode 0 to mode 2).
[0092] Next, an intra prediction candidate list of the current prediction unit is built (S140). The candidates may be listed in mode number order. Alternatively, the candidates may be listed in frequency order, and intra prediction candidates having the same frequency may be listed in mode number order. When a plurality of intra prediction candidates have the same mode, the intra prediction candidates except one are removed from the list.
[0093] Next, it is determined whether the intra prediction mode of the current prediction unit is the same as any one of the intra prediction mode candidates in the built list (S150).
[0094] When the intra prediction mode of the current prediction unit is the same as one of the intra prediction mode candidates, information indicating that the intra prediction mode is the same as one of the intra prediction mode candidates and a candidate index specifying the one intra prediction mode are determined as intra prediction information (S160).
[0095] When the intra prediction mode of the current prediction unit is not the same as any of the intra prediction mode candidates, a mode change value for changing the intra prediction mode of the current prediction unit is calculated (S170). The mode change value is the number of intra prediction mode candidates having intra prediction mode number that are not greater than the intra prediction mode number of the current prediction unit.
[0096] Next, the intra prediction mode of the current prediction unit is changed using the mode change value (S180). The changed intra prediction mode is determined as candidate index of the current prediction unit. The changed intra prediction mode of the current prediction unit is transmitted to the entropy coder 140.
[0097] FIG. 5 is a block diagram of an intra prediction decoding apparatus 200 according to the present invention.
[0098] The intra prediction decoding apparatus 200 according to the present invention includes an entropy decoder 210, a residual signal decoder 220, a prediction mode decoder 230, a reference pixel generator 240, a prediction block generator 250, a prediction block filter 260 and an image reconstructor 270.
[0099] The entropy decoder 210 extracts quantized residual coefficients from a received bit stream, and transmits the quantized residual coefficients of the transform unit and a size of the transform unit to the residual signal decoder 220. Also, the entropy decoder 210 transmits intra prediction information and a size of a prediction unit to be decoded to the prediction mode decoder 230.
[0100] The residual signal decoder 220 converts the quantized residual coefficients into inverse-quantized block of a two dimensional (2D) array. For this conversion, one of a plurality of scan patterns is selected. The scan pattern of the transform block is determined on the basis of at least one of the prediction mode and the intra prediction mode. An inverse scanning operation is the same as an inverse process of operation of the scanner 131 of FIG. 1 . For example, when a size of the current transform unit to be decoded is larger than a first reference size, the quantized residual coefficients are inversely scanned to form a plurality of subsets according to the scan pattern, and an inverse-quantized block having the size of the transform unit is generated using the plurality of subsets. On the other hand, when the size of the current transform unit to be decoded is not larger than the first reference size, the quantized residual coefficients are inversely scanned to generate an inverse-quantized block according to the scanning pattern.
[0101] The prediction mode decoder 230 restores the intra prediction mode of the current prediction mode on the basis of the intra prediction information and the size information on the current prediction unit received from the entropy decoder 210. The received intra prediction information is restored through an inverse process of the process shown in FIG. 4 .
[0102] The reference pixel generator 240 generates unavailable reference pixels of the current prediction unit, and adaptively filters the reference pixels according to the intra prediction mode of the current prediction unit received from the prediction mode decoder 230. A method of generating the reference pixels and a method of filtering the reference pixels are the same as those of the reference pixel generator 142 in the intra predictor 150 of FIG. 2 .
[0103] Specifically, it is determined whether reference pixels of the current prediction unit are available. The reference pixels of the current prediction unit used for intra prediction consist of a corner reference pixel positioned at (x=−1, y=−1), 2L upper reference pixels positioned at (x=0, . . . , and 2L−1, y=−1), and 2M left reference pixels positioned at (x=0, y=0, . . . , and 2M−1). Here, L is a width of the current prediction unit, and M is a height of the current prediction unit.
[0104] When the reference pixels for generating a prediction block are unavailable or insufficient, reference pixels are generated.
[0105] When all the reference pixels are unavailable, reference pixels are generated with a predetermined value.
[0106] When some of the reference pixels are unavailable, it is determined whether the unavailable reference pixels exist in only one direction from available pixels or between the available pixels.
[0107] When the unavailable reference pixels exist in only one direction from the available pixels, reference pixels are generated by copying the value of an available pixel closest to the unavailable pixel. For example, when the current prediction unit is positioned at an upper boundary of a picture or a slice, the corner reference pixel and the upper reference pixels are unavailable. Thus, in this case, the corner reference pixel and the upper reference pixels can be generated by copying a reference pixel positioned at (x=−1, y=0). Alternatively, reference pixels may be generated using an available reference pixel of the closest position and one or more available reference pixels. For example, when the corner reference pixel having a position (x=−1, y=−1) and reference pixels at positions (x=0, . . . , and L−1, y=−1) are available and reference pixels at positions (x=L, . . . , 2L−1, y=−1) are unavailable, reference pixels at the unavailable positions can be generated using change in difference between a reference pixel at a position (x=L−1, y=−1) and a corner reference pixel value or another reference pixel value.
[0108] When the unavailable reference pixels exist between the available pixels, reference pixels are generated using two available pixels p and q adjacent to the unavailable reference pixels. For example, when the corner reference pixel and the L upper reference pixels positioned at (x=0, . . . , and L−1, y=−1) are unavailable, reference pixels existing between the reference pixel p at a position (x=−1, y=0) and the reference pixel q at a position (x=L, y=−1) can be generated using the reference pixels p and q.
[0109] The generated reference pixel values may be obtained by rounding off an average of the reference pixel p and the reference pixel q. Also, the reference pixel values may be generated using change in difference between pixels values of the reference pixel p and the reference pixel q. In this case, the reference pixel values may be generated by linear interpolation determined according to positions corresponding to the generated pixel values or using a weighted average of the two reference pixels.
[0110] Meanwhile, when a plurality of prediction units are on an upper side of the current prediction unit, there is a high possibility that a difference between boundary pixels present on both sides of a boundary between two of the upper prediction units will be higher than a difference between adjacent pixels in each upper prediction unit. This results from an error caused by a quantization parameter. It is highly probable that the error will occur in directional intra prediction modes in which a prediction pixel of the prediction block is generated using two adjacent reference pixels.
[0111] In particular, modes (mode numbers 3, 6 and 9) having a direction of 45° with reference to a horizontal or vertical direction of FIG. 3 are most seriously affected. In the vertical and horizontal intra prediction modes (mode numbers 0 and 1), one pixel is used to generate a prediction pixel of a prediction block, and thus the vertical and horizontal intra prediction modes are slightly affected.
[0112] For this reason, a filter (smoothing filter) is applied to the reference pixels in the directional intra prediction modes 3, 6 and 9, and is not applied to the reference pixels in the vertical and horizontal intra prediction modes. In the DC mode, the filter is not applied either. For these modes, whether or not to apply the filter may be determined regardless of a size of the current prediction unit.
[0113] In directional intra prediction modes existing between the intra prediction mode 3, 6 or 9 and the horizontal or vertical intra prediction mode, the filter can be adaptively applied to reference pixels according to the size of the prediction unit. It is preferable to increase a probability of applying the filter as the direction of the directional intra prediction mode is relatively closer to the direction of the intra prediction mode having the direction of 45°. Specifically, when a first directional intra prediction mode is closer in directivity to the intra prediction mode having the direction of 45° than a second directional intra prediction mode, if a filter is applied to the reference pixels in the second directional intra prediction mode, the filter is also applied to the reference pixels in the first directional intra prediction mode. On the other hand, if the filter is applied to the reference pixels in the first directional intra prediction mode, the filter may or may not be applied to the reference pixels in the second directional intra prediction mode.
[0114] There is a high possibility that a change in difference between pixels in a prediction unit of a large size will be less than a change in difference between pixels in a prediction unit of a small size. Thus, the number of directional modes in which the filter is applied may be increase or the stronger filter may be applied as the size of the prediction unit increases. On the other hand, when a prediction unit becomes smaller than a specific size, the filter may not be applied.
[0115] For one example, in the intra prediction mode 3, 6 or 9, a first filter may be applied to reference pixels of a prediction unit having a size equal to or smaller than a first size, and a second filter that is stronger than the first filter may be applied to reference pixels of a prediction unit having a size larger than the first size. The first size may vary according to directional prediction modes.
[0116] For another example, in the intra prediction mode 5 existing between the vertical intra prediction mode and the intra prediction mode 6, no filter may be applied to a prediction unit having a size equal to or smaller than a second size, the first filter may be applied to reference pixels of a prediction unit having a size larger than the second size and equal to or smaller than a third size, and the second filter may be applied to a prediction unit having a size larger than the third size. The second size and the third size may vary according to directional prediction modes.
[0117] The first filter may be a 3-tap filter [1, 2, 1] or a 5-tap filter [1, 2, 4, 2, 1]. The second filter has a greater smoothing effect than the first filter.
[0118] The prediction block generator 250 generates a prediction block according to the intra prediction mode of the current prediction unit received from the prediction mode decoder 230. A method of generating the prediction block is the same as that of the prediction block generator 142 in the intra predictor 150 of FIG. 2 .
[0119] Specifically, in the directional intra prediction mode, the corresponding reference pixels vary according to the intra prediction modes. For example, in the vertical mode, the L upper reference pixels positioned at (x=0, . . . , and L−1, y=−1) are used, and in the horizontal mode, L left reference pixels positioned at (x=−1, y=0, . . . , and L−1) are used.
[0120] In non-directional intra prediction modes, the corner pixel, the L upper reference pixels positioned at (x=0, . . . , and L−1, y=−1) and the L left reference pixels positioned at (x=−1, y=0, . . . , and L−1) are used. The non-directional intra prediction modes are the DC mode and the planar mode.
[0121] In the planar mode, a reference pixel of a prediction block is generated using the corner reference pixel, a left reference pixel and an upper reference pixel. When a reference pixel to be generated is positioned at (a, b), a prediction pixel X(a, b) is generated using the corner reference pixel C(x=−1, y=−1), an upper reference pixel T(x=a, y=−1) and a left reference pixel L(x=−1, y=b). Specifically, X(a, b)=L(x=−1, y=b)+T(x=a, y=−1)−C(x=−1, y=−1).
[0122] In the intra prediction mode existing to the right side of the vertical mode of FIG. 3 , a possibility that a difference between pixel of a lower left region of the generated prediction block and corresponding pixel of the original prediction unit will increase if the prediction block is generated using only upper reference pixels. However, when a prediction block is generated using upper reference pixels and left reference pixels, the difference can be reduced. This effect is greatest in the intra prediction mode 6. Also in intra prediction modes existing under the horizontal mode of FIG. 3 , same method may be applied, and the effect is greatest in the intra prediction mode 9.
[0123] Thus, in the prediction mode 6 or 9, a prediction pixel may be generated using one upper interpolation reference pixel and one left interpolation reference pixel. The prediction pixel may be generated by linear interpolation of the one upper interpolation reference pixel and the one left interpolation reference pixel or using an average that is rounded off. Likewise, in a predetermined number of intra prediction modes adjacent to mode 6 or 9, a prediction block can be generated using the left reference pixels and the upper reference pixels. In this case, to reduce complexity, the aforementioned method may not be applied in intra prediction modes having mode numbers greater than a predetermined mode number (e.g., 9 or 17). Also, the method may be applied to only a current prediction unit having a size equal to or larger than a predetermined size. The predetermined size is 8×8 or 16×16.
[0124] The prediction block filter 260 adaptively filters the prediction block generated by the prediction block generator 250 according to the intra prediction mode of the current prediction unit received from the prediction mode decoder 230. The prediction block filter 260 may be integrated into the prediction block generator 250. A prediction block filtering method is the same as that of the prediction block post-processor 144 of the intra predictor 150 of FIG. 2 .
[0125] Specifically, to reduce a difference in picture value between a reference pixel and a prediction pixel adjacent to the reference pixel, the prediction block filter 260 adaptively filters some or all prediction pixels adjacent to the reference pixels not used to generate the prediction block according to the intra prediction mode.
[0126] In the planar mode, the prediction pixels are generated using all reference pixel adjacent to the prediction pixel, and thus no filter is applied.
[0127] In the DC mode, an average of reference pixels is used to generate prediction pixel, and thus a filter is applied. Different type of filter can be used according to the size of prediction unit. In a prediction unit of a large size, a filter that is the same as used in a prediction unit of a small size or a strong filter having a great smoothing effect can be used.
[0128] The image reconstructor 270 receives a prediction block from the prediction block generator 250 or the prediction block filter 260 in units of prediction units according to the intra prediction mode. The image reconstructor 270 receives a residual signal restored by the residual signal decoder 220 in units of prediction units. The image reconstructor 270 generates a reconstructed image by adding the received prediction block and residual signal of a size of prediction unit. The image may be reconstructed in units of coding units.
[0129] While the invention has been shown and described with reference to certain exemplary embodiments thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims.
Claims
The invention claimed is:
1. An apparatus for decoding an image, the apparatus comprising:
an entropy decoder configured to restore quantized residual coefficients and intra prediction information;
a prediction mode decoder configured to restore an intra prediction mode based on the intra prediction information;
a residual signal decoder configured to restore the quantized residual signals according to the intra prediction mode;
a reference pixel generator configured to generate reference pixels when one or more unavailable reference pixels exist, and to adaptively filter the reference pixels according to the intra prediction mode and a size of a prediction block;
a prediction block generator configured to generate prediction pixels using the reference pixels determined by the intra prediction mode; and
an image reconstructor configured to generate a reconstructed image using the prediction pixels and the residual signals, wherein
the reference pixel generator adaptively filters the reference pixels according to the size of a prediction block for intra prediction modes existing between a horizontal mode and an intra prediction mode having a direction of 45° with respect to the horizontal mode,
when the intra prediction mode of the prediction block is the same as a predetermined second directional intra prediction mode, the reference pixel generator filter the reference pixels,
when the intra prediction mode of the prediction block is closer in directivity to the intra prediction mode having the direction of 45° with respect to the horizontal mode than the second directional intra prediction mode is, the reference pixel generator filters the reference pixels, and
the second directional intra prediction mode exists between the horizontal mode and the intra prediction mode having the direction of 45° with respect to the horizontal mode.
2. The apparatus of claim 1, wherein the reference pixel generator does not filter the reference pixels when ht size of the prediction block is smaller than a predetermined block size.
3. The apparatus of claim 1, wherein, when the intra prediction mode is a planar mode, the reference pixel generator generates a reference pixel of a prediction block using a corner reference pixel, a left reference pixel and an upper reference pixel.
4. The apparatus of claim 1, wherein, when the intra prediction mode is an intra prediction mode having a direction of 45° with respect to a vertical mode or one out of a predetermined number of intra prediction modes having directivity close to the intra prediction mode having the direction of 45° with respect to the vertical mode, the reference pixel generator generates a prediction block using upper reference pixels and left reference pixels.
Patent Citations (19)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US2009/0310678(A1) | 2009-12-01 | Tanaka | Applicant |
| US2010/0246692(A1) | 2010-09-01 | Rusanovskyy et al. | Examiner |
| US2011/0164677(A1) | 2011-07-01 | Lu et al. | Examiner |
| US2012/0033728(A1) | 2012-02-01 | Cho et al. | Examiner |
| EP2557797(A2) | 2013-02-01 | Applicant | |
| JP2006-279374 | 2006-10-01 | Applicant | |
| JP2007-306276 | 2007-11-01 | Applicant | |
| JP2009-302776 | 2009-12-01 | Applicant | |
| JP5437807 | 2013-12-01 | Applicant | |
| KR1020070037532(A) | 2007-04-01 | Applicant | |
| KR1020080000562 | 2008-01-01 | Applicant | |
| KR1020080041972 | 2008-05-01 | Applicant | |
| KR1020080110171 | 2008-12-01 | Applicant | |
| KR1020090067176(A) | 2009-06-01 | Applicant | |
| KR1020090116655 | 2009-11-01 | Applicant | |
| KR1020100027096(A) | 2010-03-01 | Applicant | |
| KR1020100045007 | 2010-05-01 | Applicant | |
| KR1020110036401 | 2011-04-01 | Applicant | |
| KR1020110054244 | 2011-05-01 | Applicant |
Non-Patent Literature (15)
- International Search Report dated Feb. 20, 2012 issued in connection with PCT/KR2011/005590.Applicant
- Bae Byung Kyu et al., “Efficient Intra-Prediction Algorithm with Directions in Spatial Domain based on H.264,” Kwangwoon Univ., pp. 180-183 (with English abstract).Applicant
- Ken McCann, “Samsung's Response to the Call for Proposals on Video Compression Technology,” Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/wG11, 1st Meeting: Dresden, DE, Apr. 15-23, 2010, pp. 1-40, with appendix: ITU-T H.264 Series H: Audiovisual and Multimedia Systems, Infrastructure of audiovisual services—Coding of moving video, Advanced video coding for generic audiovisual services, Recommendation ITU-T H.264.Applicant
- Anonymous, “Test Model under Consideration” 2. JCT-VC Meeting; Geneva, Switzerland; (Joint Collaborative Team on Video Coding of ISO/IEC JCTC1/SC29/WG11 and ITU-T SG. 16), No. JCTVC-B205, Jul. 21-28, 2010, XP030007704, ISSN: 0000-0046.Applicant
- Har-Noy et al., “Adaptive In-Loop Prediction Refinement for Video Coding”, IEEE 9th Workshop on Multimedia Signal Processing, MMSP 2007, Piscataway, NJ, USA, Oct. 1, 2007, pp. 171-174. XP031224804, ISBN: 978-1-4244-1274-7.Applicant
- Sugimoto et al, “LUT-based adaptive filtering on intra prediciton samples”, 4, JCT-VC Meeting, Daegu; (Joint Collaborative Team on Video Coding of ISO/IEC JTC1/Sc29/WG11 and ITU-T SG, 16), No. JCTVC-D109, Jan. 20-28, 2011, XP030008149, ISSN: 0000-0015.Applicant
- Zheng et al., “Simplified Intra Smoothing”, 3. JCT-VC Meeting; Guangzhou, China; (Joint Collaborative Team on Video Coding of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11)), No. JCTVC-C234, Oct. 7-15, 2010, XP030007941, ISSN: 0000-0019.Applicant
- Wiegand et al., “WD3: Working Draft 3 of High-Efficiency Video Coding”, 5. Geneva, Switzerland; JCT-VC Meeting; (Joint Collaborative Team on Video Coding of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11, No. JCTVC-E603, Mar. 16-23, 2011.Applicant
- Zheng et al., “CE13: Mode Dependent Hybrid Intra Smoothing”, 4. JCT-VC Meeting; Korea; (Joint Collaborative Team on Video Coding of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11, Jan. 20-28, 2011, No. JCTV-D282.Applicant
- Anonymous, “Test Model under Consideration” 2. JCT-VC Meeting; Geneva; (Joint Collaborativeteam on Video Coding of ISO/IEC JCTC1/SC29/WG11 and ITU-T SG. 16), No. JCTVC-B205, Jul. 28, 2010, XP030007704, ISSN: 0000-0046.Applicant
- Shay Har-Noy et al., “Adaptive In-Loop Prediction Refinement for Video Coding”, IEEE 9th Workshop on Multimedia Signal Processing, MMSP 2007, Piscataway, NJ, USA, Oct. 1, 2007, pp. 171-174. XP031224804, ISBN: 978-1-4244-1274-7.Applicant
- Kazuo Sugimoto et al, “LUT-based adaptive filtering on intra prediciton samples”, 4, JCT-VC Meeting, Daegu; (joint Collaborative Team on Video Coding of ISO/IEC JTC1/Sc29/WG11 and ITU-T SG, 16), No. JCTVC-D109, Jan. 14, 2011, XP030008149, ISSN: 0000-0015.Applicant
- Zheng et al., “Simplified Intra Smoothing”, 3. JCT-VC Meeting; Guangzhou; (Joint Collaborative Team on Video Coding of ISO/IECJTC1/SC29/WG11 and ITU-T SG.16), No. JCTVC-C234, Oct. 2010, SP030007942, ISSN: 0000-0019.Applicant
- Wiegand et al., “WD3: Working Draft 3 of High-Efficienty Video Coding”, JCT-VC Meeting; (Joint Collaborative Team on Video Coding of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11, No. JCTVC-E603, Mar. 16-23, 2011.Applicant
- Zheng et al., “CE13: Mode Dependent Hybrid INtra Smoothing”, 4. JCT-VC Meeging; Korea; (Joint Collaborative Team on Video Coding of ISO/IEC JTC1/SC29/WG11, No. JCTVC-De82, Jan. 20-28, 2011.Applicant