IP Library › Granted Patent US 12,382,029
Granted Patent B2
US 12,382,029 · App. 18/656,353 · Granted Aug 5, 2025

Image encoding/decoding method and device using intra prediction

Inventor: Ki Baek Kim (Daejeon, KR)
Assignee: GUANGDONG OPPO MOBILE TELECOMMUNICATIONS CORP., LTD.
H04N19/11H04N19/119H04N19/176H04N19/186H04N19/593
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,382,029
App. No.
18/656,353
Granted
Aug 5, 2025
Kind
B2
Abstract

The image encoding/decoding method and device according to the present invention may determine an intra prediction mode of a current block and perform intra prediction on the current block on the basis of the intra prediction mode, wherein the intra prediction mode of the current block is determined for each of a luminance block and a color difference block.

Claims (1537)

1. A method of decoding an image, comprising:

determining an intra prediction mode of a current block, wherein the intra prediction mode of the current block is determined for each of a luma block and a chroma block respectively,

performing intra prediction on the current block based on the intra prediction mode,

wherein performing the intra prediction comprises:

specifying a luma region for inter-components reference of the chroma block;

performing down-sampling for the luma region;

deriving a parameter for the inter-components reference of the chroma block; and

predicting the chroma block based on the down-sampled luma region and the parameter,

wherein the luma region comprises a luma block and a neighboring region adjacent to the luma block, and performing down-sampling for the luma region comprises:

when the neighboring region belongs to a same CTU as the luma block, performing down-sampling for the neighboring region adjacent to the luma block based on:

pTopDsY

[

x

]

=

(

pY

[

2

×

x

]

[

-

3

]

+

p

⁢

Y

[

2

×

x

-

1

]

[

-

2

]

+

4

×

p

⁢

Y

[

2

×

x

]

[

-

2

]

+

p

⁢

Y

[

2

×

x

+

1

]

[

-

2

]

+

p

⁢

Y

[

2

×

x

]

[

-

1

]

+

4

)

>>

3

,

wherein x represents a horizontal coordinate value of a sample in the neighboring region adjacent to the luma block.

2. The method of claim 1 , wherein performing down-sampling for the luma region comprises:

performing down-sampling for the luma block based on:

pDsY

[

x

]

[

y

]

=

(

pY

[

2

×

x

]

[

2

×

y

-

1

]

+

pY

[

2

×

x

-

1

]

[

2

×

y

]

+

4

×

pY

[

2

×

x

]

[

2

×

y

]

+

pY

[

2

×

x

+

1

[

2

×

y

]

+

pY

[

2

×

x

]

[

2

×

y

+

1

]

+

4

)

≫

3.

3. The method of claim 1 , wherein performing down-sampling for the luma region comprises:

performing down-sampling for the luma block based on:

pDsY

[

x

]

[

y

]

=

(

pY

[

2

×

x

-

1

]

[

2

×

y

]

+

pY

[

2

×

x

-

1

]

[

2

×

y

+

1

]

+

2

×

pY

[

2

×

x

[

2

×

y

]

+

2

×

pY

[

2

×

x

]

[

2

×

y

+

1

]

+

pY

[

2

×

x

+

1

]

[

2

×

y

]

+

pY

[

2

×

x

+

1

]

[

2

×

y

+

1

]

+

4

)

≫

3.

4. The method of claim 1 , wherein performing down-sampling for the luma region comprises:

performing down-sampling for the neighboring region adjacent to the luma block based on:

pLeftDsY

[

y

]

=

(

pY

[

-

2

]

[

2

×

y

-

1

]

+

pY

[

-

3

]

[

2

×

y

]

+

4

×

pY

[

-

2

]

[

2

×

y

]

+

pY

[

-

1

]

[

2

×

y

]

+

pY

[

-

2

]

[

2

×

y

+

1

]

+

4

)

≫

3.

5. The method of claim 1 , wherein the current block is divided into a plurality of sub-blocks, and

wherein the division is performed based on a size of the current block, and

when the size of the current block is smaller than a pre-determined threshold size, the current block is divided into two vertically or horizontally, and

when the size of the current block is greater than or equal to the pre-determined threshold size, the current block is divided into four vertically or horizontally.

6. A method of encoding an image, comprising:

determining an intra prediction mode of a current block, wherein the intra prediction mode of the current block is determined for each of a luma block and a chroma block respectively;

performing intra prediction on the current block based on the intra prediction mode; and

encoding the MPM index into a bitstream,

wherein performing the intra prediction comprises:

specifying a luma region for inter-components reference of the chroma block;

performing down-sampling for the luma region;

deriving a parameter for the inter-components reference of the chroma block; and

predicting the chroma block based on the down-sampled luma region and the parameter,

wherein the luma region comprises a luma block and a neighboring region adjacent to the luma block, and performing down-sampling for the luma region comprises:

when the neighboring region belongs to a same CTU as the luma block, performing down-sampling for the neighboring region adjacent to the luma block based on:

pTopDsY

[

x

]

=

(

pU

[

2

×

x

]

[

-

3

]

+

pY

[

2

×

x

-

1

]

[

-

2

]

+

4

×

pY

[

2

×

x

]

[

-

2

]

+

pY

[

2

×

x

+

1

]

[

-

2

]

+

pY

[

2

×

x

]

[

-

1

]

+

4

)

≫

3.

wherein x represents a horizontal coordinate value of a sample in the neighboring region adjacent to the luma block.

7. The method of claim 6 , wherein performing down-sampling for the luma region comprises:

performing down-sampling for the luma block based on:

p

⁢

D

⁢

s

⁢

Y

[

x

]

[

y

]

=

(

pY

[

2

×

x

]

[

2

×

y

-

1

]

+

p

⁢

Y

[

2

×

x

-

1

]

[

2

×

y

]

+

4

×

p

⁢

Y

[

2

×

x

]

[

2

×

y

]

+

pY

[

2

×

x

+

1

]

[

2

×

y

]

+

p

⁢

Y

[

2

×

x

]

[

2

×

y

+

1

]

+

4

)

≫

3.

8. The method of claim 6 , wherein performing down-sampling for the luma region comprises:

performing down-sampling for the luma block based on:

p

⁢

D

⁢

s

⁢

Y

[

x

]

[

y

]

=

(

pY

[

2

×

x

-

1

]

[

2

×

y

]

+

p

⁢

Y

[

2

×

x

-

1

]

[

2

×

y

+

1

]

+

2

×

p

⁢

Y

[

2

×

x

]

[

2

×

y

]

+

2

×

p

⁢

Y

[

2

×

x

]

[

2

×

y

+

1

]

+

p

⁢

Y

[

2

×

x

+

1

]

[

2

×

y

]

+

pY

[

2

×

x

+

1

]

[

2

×

y

+

1

]

+

4

)

≫

3.

9. The method of claim 6 , wherein performing down-sampling for the luma region comprises:

performing down-sampling for the neighboring region adjacent to the luma block based on:

pLeftDsY

[

y

]

=

(

pY

[

-

2

]

[

2

×

y

-

1

]

+

pY

[

-

3

]

[

2

×

y

]

+

4

×

pY

[

-

2

]

[

2

×

y

]

+

pY

[

-

1

]

[

2

×

y

]

+

pY

[

-

2

]

[

2

×

y

+

1

]

+

4

)

≫

3.

10. The method of claim 6 , wherein the current block is divided into a plurality of sub-blocks, and

wherein the division is performed based on a size of the current block, and

when the size of the current block is smaller than a pre-determined threshold size, the current block is divided into two vertically or horizontally, and

when the size of the current block is greater than or equal to the pre-determined threshold size, the current block is divided into four vertically or horizontally.

11. A decoder, comprising a memory and a processor, wherein

the memory is configured to store computer programs capable of running in the processor; and

the processor is configured to run the computer programs to execute:

determining an intra prediction mode of a current block, wherein the intra prediction mode of the current block is determined for each of a luma block and a chroma block respectively; and

performing intra prediction on the current block based on the intra prediction mode;

wherein the processor is further configured to run the computer programs to execute:

specifying a luma region for inter-components reference of the chroma block;

performing down-sampling for the luma region;

deriving a parameter for the inter-components reference of the chroma block; and

predicting the chroma block based on the down-sampled luma region and the parameter,

wherein the luma region comprises a luma block and a neighboring region adjacent to the luma block, and performing down-sampling for the luma region comprises:

when the neighboring region belongs to a same CTU as the luma block, performing down-sampling for the neighboring region adjacent to the luma block based on:

p

⁢

T

⁢

o

⁢

p

⁢

D

⁢

s

⁢

Y

[

x

]

=

(

p

⁢

Y

[

2

×

x

]

[

-

3

]

+

p

⁢

Y

[

2

×

x

-

1

]

[

-

2

]

+

4

×

p

⁢

Y

[

2

×

x

]

[

-

2

]

+

p

⁢

Y

[

2

×

x

+

1

]

[

-

2

]

+

p

⁢

Y

[

2

×

x

]

[

-

1

]

+

4

)

≫

3

,

wherein x represents a horizontal coordinate value of a sample in the neighboring region adjacent to the luma block.

12. The decoder of claim 11 , wherein the processor is further configured to run the computer programs to execute:

performing down-sampling for the luma block based on:

p

⁢

D

⁢

s

⁢

Y

[

x

]

[

y

]

=

(

pY

[

2

×

x

]

[

2

×

y

-

1

]

+

p

⁢

Y

[

2

×

x

-

1

]

[

2

×

y

]

+

4

×

p

⁢

Y

[

2

×

x

]

[

2

×

y

]

+

pY

[

2

×

x

+

1

]

[

2

×

y

]

+

p

⁢

Y

[

2

×

x

]

[

2

×

y

+

1

]

+

4

)

≫

3.

13. The decoder of claim 11 , wherein the processor is further configured to run the computer programs to execute:

performing down-sampling for the luma block based on:

p

⁢

D

⁢

s

⁢

Y

[

x

]

[

y

]

=

(

p

⁢

Y

[

2

×

x

-

1

]

[

2

×

y

]

+

p

⁢

Y

[

2

×

x

-

1

]

[

2

×

y

+

1

]

+

2

×

p

⁢

Y

[

2

×

x

]

[

2

×

y

]

+

2

×

p

⁢

Y

[

2

×

x

]

[

2

×

y

+

1

]

+

p

⁢

Y

[

2

×

x

+

1

]

[

2

×

y

]

+

pY

[

2

×

x

+

1

]

[

2

×

y

+

1

]

+

4

)

≫

3.

14. The decoder of claim 11 , wherein the processor is further configured to run the computer programs to execute:

performing down-sampling for the neighboring region adjacent to the luma block based on:

pLeftDsY

[

y

]

=

(

pY

[

-

2

]

[

2

×

y

-

1

]

+

pY

[

-

3

]

[

2

×

y

]

+

4

×

pY

[

-

2

]

[

2

×

y

]

+

pY

[

-

1

]

[

2

×

y

]

+

pY

[

-

2

]

[

2

×

y

+

1

]

+

4

)

≫

3.

15. The decoder of claim 11 , wherein the current block is divided into a plurality of sub-blocks, and

wherein the division is performed based on a size of the current block, and

when the size of the current block is smaller than a pre-determined threshold size, the current block is divided into two vertically or horizontally, and

when the size of the current block is greater than or equal to the pre-determined threshold size, the current block is divided into four vertically or horizontally.

16. An encoder, comprising a memory and a processor, wherein

the memory is configured to store computer programs capable of running in the processor; and

the processor is configured to run the computer programs to execute:

determining an intra prediction mode of a current block, wherein the intra prediction mode of the current block is determined for each of a luma block and a chroma block respectively;

performing intra prediction on the current block based on the intra prediction mode; and

encoding an MPM index into a bitstream,

wherein the processor is further configured to run the computer programs to execute:

specifying a luma region for inter-components reference of the chroma block;

performing down-sampling for the luma region;

deriving a parameter for the inter-components reference of the chroma block; and

predicting the chroma block based on the down-sampled luma region and the parameter,

wherein the luma region comprises a luma block and a neighboring region adjacent to the luma block, and performing down-sampling for the luma region comprises:

when the neighboring region belongs to a same CTU as the luma block, performing down-sampling for the neighboring region adjacent to the luma block based on:

p

⁢

T

⁢

o

⁢

p

⁢

D

⁢

s

⁢

Y

[

x

]

=

(

p

⁢

Y

[

2

×

x

]

[

-

3

]

+

p

⁢

Y

[

2

×

x

-

1

]

[

-

2

]

+

4

×

p

⁢

Y

[

2

×

x

]

[

-

2

]

+

p

⁢

Y

[

2

×

x

+

1

]

[

-

2

]

+

p

⁢

Y

[

2

×

x

]

[

-

1

]

+

4

)

≫

3

,

wherein x represents a horizontal coordinate value of a sample in the neighboring region adjacent to the luma block.

17. The encoder of claim 16 , wherein the processor is further configured to run the computer programs to execute:

performing down-sampling for the luma block based on:

p

⁢

D

⁢

s

⁢

Y

[

x

]

[

y

]

=

(

p

⁢

Y

[

2

×

x

]

[

2

×

y

-

1

]

+

p

⁢

Y

[

2

×

x

-

1

]

[

2

×

y

]

+

4

×

p

⁢

Y

[

2

×

x

]

[

2

×

y

]

+

pY

[

2

×

x

+

1

]

[

2

×

y

]

+

p

⁢

Y

[

2

×

x

]

[

2

×

y

+

1

]

+

4

)

≫

3.

18. The encoder of claim 15 , wherein the processor is further configured to run the computer programs to execute:

performing down-sampling for the luma block based on:

p

⁢

D

⁢

s

⁢

Y

[

x

]

[

y

]

=

(

p

⁢

Y

[

2

×

x

-

1

]

[

2

×

y

]

+

p

⁢

Y

[

2

×

x

-

1

]

[

2

×

y

+

1

]

+

2

×

p

⁢

Y

[

2

×

x

]

[

2

×

y

]

+

2

×

p

⁢

Y

[

2

×

x

]

[

2

×

y

+

1

]

+

pY

[

2

×

x

+

1

]

[

2

×

y

]

+

pY

[

2

×

x

+

1

]

[

2

×

y

+

1

]

+

4

)

≫

3.

19. The encoder of claim 16 , wherein the processor is further configured to run the computer programs to execute:

performing down-sampling for the neighboring region adjacent to the luma block based on:

pLeftDsY

[

y

]

=

(

pY

[

-

2

]

[

2

×

y

-

1

]

+

pY

[

-

3

]

[

2

×

y

]

+

4

×

pY

[

-

2

]

[

2

×

y

]

+

pY

[

-

1

]

[

2

×

y

]

+

pY

[

-

2

]

[

2

×

y

+

1

]

+

4

)

≫

3.

20. The encoder of claim 16 , wherein the current block is divided into a plurality of sub-blocks, and

wherein the division is performed based on a size of the current block, and

when the size of the current block is smaller than a pre-determined threshold size, the current block is divided into two vertically or horizontally, and

when the size of the current block is greater than or equal to the pre-determined threshold size, the current block is divided into four vertically or horizontally.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 6, 2024
From: KIM, KI BAEK
To: GUANGDONG OPPO MOBILE TELECOMMUNICATIONS CORP., LTD.
Reel/Frame 067326/0329 →
Priority Claims (1)
KR 10-2018-0037811 · Apr 1, 2018 · national
Continuity (4)
Continuation 18295811 · Apr 4, 2023
Continuation 17457969 · Dec 7, 2021
Continuation 17042432
Related Publication 20240291974A1 · Aug 29, 2024
References Cited (70)
US 9374582B2 · Oh et al. · 2016 [cited by applicant]
US 9432668B1 · Bossen · 2016 [cited by applicant]
US 9813712B2 · Oh et al. · 2017 [cited by applicant]
US 9866836B2 · Oh et al. · 2018 [cited by applicant]
US 10045027B2 · Oh et al. · 2018 [cited by applicant]
US 11445179B2 · Lee · 2022 [cited by applicant]
US 20140314142A1 · Oh et al. · 2014 [cited by applicant]
US 20160261866A1 · Oh et al. · 2016 [cited by applicant]
US 20160261867A1 · Oh et al. · 2016 [cited by applicant]
US 20160277762A1 · Zhang · 2016 [cited by examiner]
US 20170332084A1 · Seregin · 2017 [cited by examiner]
US 20180048889A1 · Zhang et al. · 2018 [cited by applicant]
US 20180063532A1 · Oh et al. · 2018 [cited by applicant]
US 20180063553A1 · Zhang et al. · 2018 [cited by applicant]
US 20180309994A1 · Oh et al. · 2018 [cited by applicant]
US 20190075328A1 · Huang et al. · 2019 [cited by applicant]
US 20190215512A1 · Lee · 2019 [cited by examiner]
US 20190222837A1 · Lee et al. · 2019 [cited by applicant]
US 20200021804A1 · Jun et al. · 2020 [cited by applicant]
US 20200036985A1 · Jang · 2020 [cited by examiner]
US 20200112750A1 · Huang et al. · 2020 [cited by applicant]
US 20210092396A1 · Zhang et al. · 2021 [cited by applicant]
CN 103096066A · 2013 [cited by applicant]
CN 103891283A · 2014 [cited by applicant]
KR 101336578B1 · 2013 [cited by applicant]
KR 1020140090154A · 2014 [cited by applicant]
KR 1020170111473A · 2017 [cited by applicant]
KR 1020180014675A · 2018 [cited by applicant]
WO 2017157249A1 · 2017 [cited by applicant]
WO 2017222237A1 · 2017 [cited by applicant]
WO 2018016823A1 · 2018 [cited by applicant]
WO 2018035130A1 · 2018 [cited by applicant]
WO 2020053805A1 · 2020 [cited by applicant]
International Search Report issued on Jul. 3, 2019 in counterpart International Patent Applicatian No. PCT/KR2019/03776 (3 pages in English and 3 pages in Korean). [cited by applicant]
Alshina et al. Description of Exploration Experiments on Coding Tools, 116 MPEG Meeting. Chengdu, Oct. 14-16, 2016. 14 pages. [cited by applicant]
Chiu, Y. ot al. “CE6a: Modified down-sampling for LM mode of intra chroma prediction”, JCT-VC Meeting, Geneva, Nov. 21-30, 2011. 6 pages. [cited by applicant]
EPO, Partial Supplementary European Search Report for European Patent Application No. 19780794.4. Mail Date: Mar. 18, 2021. 16 pages. [cited by applicant]
Bross, B. et al. “WD4: the Working Draft 4 of High-Efficiency Video Coding” the JCTVC-803. 2011. 216 pages. [cited by applicant]
EPO, Extended European Search Report for European Patent Application No. 19780794.4. Mail Date: Jun. 24, 2021. 16 pages. [cited by applicant]
KIPO, Notification of Reason for Refusal for Korean Patent Application No. 10-2020-7000411. Mail Date: Jun. 12, 2020. 10 pages with English translation. [cited by applicant]
Wang, B. et al. “CE-3 Related: a unified MPM list for intra mode coding”, JVET-N185, version 6, 2019. 3 pages. [cited by applicant]
Vadim et al., “Neighbor based intra most probable modes list derivation”, JVET-C0055, May 26, 2016. 4 pages. [cited by applicant]
Xiaoran Cao et al., and “CE6.b Report on Short Distance Intra Prediction Method”, JCTVC-D299. Jan. 20, 2011. 8 pages. [cited by applicant]
Office Action of the Indian application No. 202017044822, issued on Aug. 17, 2021. [cited by applicant]
First Office Action of the Korean application No. 10-2020-7000411, issued on Aug. 6, 2021. 8 pages with English translation. [cited by applicant]
Written Opinion of the International Search Authority in the international application No. PCT/KR2019/003776, mailed on Jul. 3, 2019.Written Opinion of the International Search Authority in the international application… [cited by applicant]
Geert Van der Auwera, “Description of Core Experiment 3: Intra Prediction and Mode Coding,” (JCTVC-J1023. version 3, Jun. 20, 2018). 44 pages. [cited by applicant]
Benjamin Bross, “Versatile Video Coding (Draft 4),” (JCTVC-M1001 version 7, Mar. 17, 2019). 300 pages. [cited by applicant]
Second Office Action of the Korean application No. 10-2020-7000411, issued on Nov. 16, 2021. 10 pages with English translation. [cited by applicant]
First Office Action of the U.S. Appl. No. 17/042,432, issued on May 11, 2021. [cited by applicant]
Notice of Allowance of the U.S. Appl. No. 17/042,432, issued on Sep. 8, 2021. [cited by applicant]
Corrected Notice of Allowance of the U.S. Appl. No. 17/042,432, issued on Nov. 10, 2021. [cited by applicant]
Kai Zhang,et,al. “Enhanced Cross-component Linear Model Intra-prediction”, Joint Video Exploration Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, Document: JVET-D0110, 4th Meeting: Chengdu, CN, Oct. 15-2… [cited by applicant]
First Office Action of the Chinese application No. 202110276753.5, issued on Nov. 30, 2022. 20 pages with English translation. [cited by applicant]
Corrected Notice of Allowance of the U.S. Appl. No. 17/042,432, issued on Dec. 14, 2021. [cited by applicant]
First Office Action of the U.S. Appl. No. 17/457,969, issued on Oct. 27, 2022. [cited by applicant]
Notice of Allowance of the U.S. Appl. No. 17/457,969, issued on Jan. 9, 2023. [cited by applicant]
Corrected Notice of Allowance of the U.S. Appl. No. 17/457,969, issued on Mar. 13, 2023. [cited by applicant]
Notice of Allowance of the Chinese application No. 202110276753.5, issued on Apr. 5, 2023. 5 pages with English translation. [cited by applicant]
First Office Action of the U.S. Appl. No. 18/295,801, issued on Oct. 25, 2023. 37 pages. [cited by applicant]
Final Office Action of the U.S. Appl. No. 18/295,801, issued on Dec. 22, 2023. 8 pages. [cited by applicant]
First Office Action of the U.S. Appl. No. 18/295,818, issued on Oct. 26, 2023. 29 pages. [cited by applicant]
Notice of Allowance of the U.S. Appl. No. 18/295,818, issued on Dec. 28, 2023. 9 pages. [cited by applicant]
Notice of Allowance of the U.S. Appl. No. 18/295,801, issued on Mar. 6, 2024, 13 pages. [cited by applicant]
Corrected Notice of Allowability of the U.S. Appl. No. 18/295,818, issued on Jan. 26, 2024, 6 pages. [cited by applicant]
Non-Final Office Action of the U.S. Appl. No. 18/295,811, issued on Oct. 26, 2023, 37 pages. [cited by applicant]
Final Office Action of the U.S. Appl. No. 18/295,811, issued on Jan. 4, 2024, 13 pages. [cited by applicant]
Notice of Allowance of the U.S. Appl. No. 18/295,811, issued on Feb. 28, 2024, 13 pages. [cited by applicant]
Third Office Action of the Korean application No. 10-2020-7000411, issued on Mar. 22, 2022, 6 pages with English translation. [cited by applicant]
First Office Action of the Korean application No. 10-2020-7031234, issued on Jan. 15, 2025, 11 pages with English translation. [cited by applicant]