Method and apparatus for intra prediction

Patent metadata

Field	Value
Publication number	US-10375414-B2
Application number	US-201816004592-A
Country	US
Kind code	B2
Filing date	Jun 11, 2018
Priority date	Feb 6, 2013
Publication date	Aug 6, 2019
Grant date	Aug 6, 2019

Abstract

Disclosed herein are a method and apparatus for filtering a reference pixel. A method of smoothing a reference pixel may include determining whether or not to perform smoothing on a reference pixel based on the size of a transform block and information about an intra-prediction mode for the transform block and determining a smoothing method by comparing the size of the transform block with the size of a maximum transform block. Accordingly, image coding efficiency can be increased, and picture quality can be improved.

First claim

What is claimed is:

1. An intra-prediction method in which an intra-prediction is performed on a current block, comprising:
determining whether or not to perform smoothing on a reference pixel of the current block based on a size of a block and an intra-prediction mode for the current block, the size of the block being indicated by an encoder and transmitted to a decoder through a higher layer syntax;
determining a smoothing filter by comparing the size of the current block with the transmitted size of the block, and
in response to the result of comparison between the size of the current block and the transmitted size of the block, determining the smoothing filter to be a bi-linear smoothing filter or a smoothing filter having predetermined filtering coefficients.

2. An intra-prediction method in which an intra-prediction is performed on a current block, comprising:
determining whether or not to perform smoothing on a reference pixel of the current block based on a size of a block and an intra-prediction mode for the current block, the size of the block being indicated by an encoder and transmitted to a decoder through a higher layer syntax; and
determining a smoothing method by comparing the size of the current block with the transmitted size of the block,
wherein the determining of whether or not to perform smoothing on the reference pixel based on the transmitted size of the block and the intra-prediction mode for the current block comprises determining to perform smoothing only in response to each of:
the size of the current block being 8×8 and the intra-prediction mode for the current block being a No. 2 intra-prediction mode,
the size of the current block being 8×8 and the intra-prediction mode for the current block being a No. 18 intra-prediction mode,
the size of the current block being 8×8 and the intra-prediction mode for the current block being a No. 34 intra-prediction mode,
the size of the current block being 8×8 and the intra-prediction mode for the current block being a planar mode;
the size of the current block being 16×16 and the intra-prediction mode for the current block being a No. 2 intra-prediction mode to a No. 8 intra-prediction mode,
the size of the current block being 16×16 and the intra-prediction mode for the current block being a No. 12 intra-prediction mode to a No. 24 intra-prediction mode,
the size of the current block being 16×16 and the intra-prediction mode for the current block being a No. 28 intra-prediction mode to a No. 34 intra-prediction mode, and
the size of the current block being 16×16 and the intra-prediction mode for the current block being a planar mode; and
the size of the current block being 32×32 and the intra-prediction mode for the current block being a No. 2 intra-prediction mode to a No. 34 intra-prediction mode, and
the size of the current block being 32×32 and the intra-prediction mode for the current block being a planar mode other than a No. 10 intra-prediction mode and a No. 26 intra-prediction mode.

3. The intra-prediction method of claim 1 , wherein the smoothing filter having the filtering coefficients of [1,2,1] is a filter for calculating a filtered reference pixel,
pF[x][y ]( x=− 1, y=− 1 . . . nT* 2-1, x=− 1 . . . nT* 2-1, y=− 1),
according to the equations:
pF[− 1][ nT* 2−1]= p[− 1][ nT* 2−1]

pF[nT* 2−1][−1]= p[nT* 2−1][−1]

pF[− 1][ y ]=( p[− 1][ y+ 1]+2* p[− 1][ y]+p[− 1][ y− 1]+2)>>2 for y=nT* 2−2 . . . 0

pF[− 1][−1]=( p[− 1][0]+ 2 * p[− 1][−1]+ p[ 0][−1]+2)>>2

pF[x][− 1]=( p[x− 1][−1]+2* p[x][− 1]+ p[x+ 1][−1]+2)>>2 for x= 0 . . . nT* 2−2

wherein the current block is a current transform block and the size of the current block is a size of a current transform block, and wherein the size of the current transform block is nT, a reference pixel of the current transform block is
p[x][y ]( x=− 1, y=− 1 . . . nT* 2−1, x=− 1 . . . nT* 2−1, y= 1).

4. The intra-prediction method of claim 1 , wherein the bi-linear smoothing filter is a filter for calculating a filtered reference pixel
pF[x][y ]( x=− 1, y=− 1 . . . nT* 2−1, x=− 1 . . . nT* 2−1, y=− 1).

according to the equations:
pF[− 1][ nT* 2−1]= p[− 1][ nT* 2−1]

pF[nT* 2−1][−1]= p[nT* 2−1][−1]

pF[− 1][ y ]=( nT* 2−1− y )* p[− 1][−1]+( y+ 1)* p[− 1][ nT* 2−1]+ nT )>>(1+log 2 ( nT )) for y= 0 . . . nT* 2−2

pF[− 1][−1 ]=p[− 1][−1]

pF[x][− 1]=(( nT* 2−1− x )* p[− 1][−1]+( x+ 1)* p[nT* 2−1][−1]+ nT )>>(1+log 2 ( nT )) for x= 0 . . . nT* 2−2

wherein the current block is a current transform block and the size of the current block is a size of a current transform block, and wherein the size of the current transform block is nT, and a reference pixel of the current transform block is
p[x][y ]( x=− 1, y=− 1 . . . nT* 2−1, x=− 1 . . . nT* 2−1, y= 1).

5. The intra-prediction method of claim 1 , further comprising decoding flag information, wherein the flag information is information for determining whether or not to perform smoothing on the reference pixel by determining whether or not to perform smoothing on the reference pixel based on the size of the current block and the intra-prediction mode for the current block and comparing the size of the current block with the size of the block.

6. The intra-prediction method of claim 1 , further comprising determining an intra-prediction method for a specific intra-prediction mode by comparing the size of the current block with the transmitted size of the block.

7. An image decoder in which an intra-prediction is performed on a current block, comprising:
an intra-prediction unit configured to:
determine whether or not to perform smoothing on a reference pixel of the current block based on a size of a block and an intra-prediction mode for the current block, the size of the block being indicated by an encoder and transmitted to the decoder through a higher layer syntax,
determine a smoothing method by comparing the size of the current block with the transmitted size of the block,
in response to the result of comparison between the size of the current block and the transmitted size of the block, determine the smoothing filter to be a bi-linear smoothing filter or a smoothing filter having predetermined filtering coefficients.

8. The image decoder of claim 7 ,
wherein the smoothing filter having the filtering coefficients of [1,2,1] is a filter for calculating a filtered reference pixel,
pF[x][y ]( x=− 1, y=− 1 . . . nT* 2−1, x=− 1 . . . nT* 2−1, y= 1),

according to:
pF[− 1][ nT* 2−1]= p[− 1][ nT* 2−1]

pF[nT* 2−1][−1]= p[nT* 2−1][−1]

pF[− 1][ y ]=( p[− 1][ y+ 1]+2* p[− 1][ y]+p[− 1][ y− 1]+2)>>2 for y=nT* 2−2 . . . 0

pF[− 1][−1]=( p[− 1][0]+ 2 * p[− 1][−1]+ p[ 0][−1]+2)>>2

pF[x][− 1]=( p[x− 1][−1]+2* p[x][− 1]+ p[x+ 1][−1]+2)>>2 for x= 0 . . . nT* 2−2

wherein the current block is a current transform block and the size of the current block is a size of a current transform block, and wherein the size of the transform current block is nT, and a reference pixel of the transform block is
p[x][y ]( x=− 1, y=− 1 . . . nT* 2−1, x=− 1 . . . nT* 2−1, y=− 1).

9. The image decoder of claim 7 ,
wherein the bi-linear smoothing filter is a filter for calculating a filtered reference pixel, pF[x][y] (x=−1, y=−1 . . . nT*2−1, x=−1 . . . nT*2−1, y=−1), according to:
pF[− 1][ nT* 2−1]= p[− 1][ nT* 2−1]

pF[nT* 2−1][−1]= p[nT* 2−1][−1]

pF[− 1][ y ]=( nT* 2−1− y )* p[− 1][−1]+( y+ 1)* p[− 1][ nT* 2−1]+ nT )>>(1+log 1 ( nT )) for y= 0 . . . nT* 2−2

pF[− 1][−1 ]=p[− 1][−1]

pF[x][− 1]=(( nT* 2−1− x )* p[− 1][−1]+( x+ 1)* p[nT* 2−1][−1]+ nT )>>(1+log 2 ( nT )) for x= 0 . . . nT* 2−2

wh

Assignees

• Research & Business Found Sungkyunkwan Univ

Inventors

• Jeon Byeung Woo
• Lee Ho Young
• Won Kwang Hyun

Classifications

• H04N19/82

  involving filtering within a prediction loop · CPC title

• H04N19/182

  the unit being a pixel · CPC title

• H04N19/593 Primary

  involving spatial prediction techniques · CPC title

• H04N19/176

  the region being a block, e.g. a macroblock · CPC title

• H04N19/117

  Filters, e.g. for pre-processing or post-processing (sub-band filter banks H04N19/635) · CPC title