Method and apparatus for intra prediction

Patent metadata

Field	Value
Publication number	US-10931970-B2
Application number	US-201916531470-A
Country	US
Kind code	B2
Filing date	Aug 5, 2019
Priority date	Feb 6, 2013
Publication date	Feb 23, 2021
Grant date	Feb 23, 2021

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; and
applying a bi-linear smoothing filter or a smoothing filter having predetermined filtering coefficients as the smoothing filter when it is determined that to perform the smoothing on the reference pixel of the current block,
wherein a flag information is used for determining whether or not to perform the smoothing on the reference pixel based on a size of the current block and the intra-prediction mode for the current block, and
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=0 . . . 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.

2. The intra-prediction method of claim 1 , 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=0 . . . nT*2−1, y=−1).

3. 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; and
applying a bi-linear smoothing filter or a smoothing filter having predetermined filtering coefficients as the smoothing filter when it is determined to perform the smoothing on the reference pixel of the current block,
wherein a flag information is used for determining whether or not to perform the smoothing on the reference pixel based on a size of the current block and the intra-prediction mode for the current block, and
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=0 . . . 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.

4. The image decoder of claim 3 ,
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=0 . . . nT*2−1, y=−1).

5. 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; and
applying a bi-linear smoothing filter or a smoothing filter having predetermined filtering coefficients as the smoothing filter when it is determined to perform the smoothing on the reference pixel of the current block,
wherein a flag information is used for determining whether or not to perform the smoothing on the reference pixel based on a size of the current block and the intra-prediction mode for the current block, and
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, 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.

6. The image decoder of claim 5 , 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, nT*2−1, y=−1).

7. 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, a size of a current 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; and
applying a bi-linear smoothing filter or a smoothing filter having predetermined filtering coefficients as the smoothing filter when it is determined to perform the smoothing on the reference pixel of the current block,
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=0 . . . 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.

8. The intra-prediction method of claim 7 , 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=0 . . . nT*2−1, y=−1).

9. 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; and
applying a bi-linear smoothing filter or a smoothing filter having predetermined filtering coefficients as the smoothing filter when it is determined to perform the smoothing on the reference pixel of the current block,
wherein a flag information is used for determining whether or not to perform the smoothing on the reference pixel based on a size of the current block and the intra-prediction mode for the current block, and
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, 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

Assignees

• Research & Business Found Sungkyunkwan Univ

Inventors

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

Classifications

• H04N19/176

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

• H04N19/82

  involving filtering within a prediction loop · CPC title

• H04N19/182

  the unit being a pixel · CPC title

• H04N19/105

  Selection of the reference unit for prediction within a chosen coding or prediction mode, e.g. adaptive choice of position and number of pixels used for prediction · CPC title

• H04N19/159

  Prediction type, e.g. intra-frame, inter-frame or bidirectional frame prediction · CPC title