IP Library › Granted Patent US 12,348,790
Granted Patent B2
US 12,348,790 · App. 18/123,623 · Granted Jul 1, 2025

Entropy encoding and decoding apparatus and method for using the same

Inventors: Yinji Piao (Suwon-si, KR); Kyungah Kim (Suwon-si, KR); Minsoo Park (Suwon-si, KR); Minwoo Park (Suwon-si, KR); Kwangpyo Choi (Suwon-si, KR)
Assignee: SAMSUNG ELECTRONICS CO., LTD.
H04N19/91H04N19/174H04N19/70
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,348,790
App. No.
18/123,623
Granted
Jul 1, 2025
Kind
B2
Abstract

An entropy decoding method may include obtaining, from a bitstream, information about a slice type, based on an occurrence probability of a symbol, performing arithmetic decoding on a current symbol corresponding to a syntax element, when the information about the slice type indicates an I slice, determining a first scaling factor for updating the occurrence probability of the symbol by using a first function, wherein a value of the first function is determined based on a first threshold value, when the information about the slice type indicates a B or P slice, determining the first scaling factor by using a second function, wherein a value of the second function is determined based on a second threshold value, and by using the first scaling factor, updating the occurrence probability of the symbol.

Claims (60)

1. An entropy decoding method comprising:

obtaining, from a bitstream, information about a slice type;

based on an occurrence probability of a symbol, performing arithmetic decoding on a current symbol corresponding to a syntax element;

based on the slice type indicating an I slice, determining a first scaling factor for updating the occurrence probability of the symbol by using a first function, wherein a value of the first function is determined based on a count value and a first threshold value;

based on the slice type indicating a B or P slice, determining the first scaling factor by using a second function, wherein a value of the second function is determined based on the count value and a second threshold value; and

by using the first scaling factor, updating the occurrence probability of the symbol,

wherein the first threshold value is greater than or equal to the second threshold value,

wherein the count value indicates a number of times a symbol corresponding to the syntax element has been previously arithmetic-decoded.

2. The entropy decoding method of claim 1 , further comprising:

based on the slice type indicating the I slice, determining a second scaling factor for updating the occurrence probability of the symbol by using a third function, wherein a value of the third function is determined based on a third threshold value; and

based on the slice type indicating a B or P slice, determining the second scaling factor by using a fourth function, wherein a value of the fourth function is determined based on a fourth threshold value,

wherein the updating of the occurrence probability of the symbol by using the first scaling factor comprises,

by using the first scaling factor and the second scaling factor, updating the occurrence probability of the symbol, and

the third threshold value is greater than or equal to the fourth threshold value.

3. The entropy decoding method of claim 2 , wherein the updating of the occurrence probability of the symbol by using the first scaling factor and the second scaling factor comprises:

by using the first scaling factor, updating a first probability of the symbol;

by using the second scaling factor, updating a second probability of the symbol; and

by using an average of the first probability and the second probability, updating the occurrence probability of the symbol.

4. The entropy decoding method of claim 2 , wherein the updating of the occurrence probability of the symbol by using the first scaling factor and the second scaling factor comprises:

by using the first scaling factor, updating a first probability of the symbol;

by using the second scaling factor, updating a second probability of the symbol; and

by using a weighted sum of the first probability and the second probability, updating the occurrence probability of the symbol.

5. The entropy decoding method of claim 4 , wherein, based on the slice type indicating the I slice, a value of the first scaling factor is greater than or equal to a value of the second scaling factor, and a weight for the first probability is greater than or equal to a weight for the second probability.

6. The entropy decoding method of claim 4 , wherein, when the information about the slice type indicates the B or P slice, a value of the first scaling factor is greater than or equal to a value of the second scaling factor, and a weight for the first probability is less than or equal to a weight for the second probability.

7. The entropy decoding method of claim 1 , wherein a value of the first function that is determined when the number of times of arithmetic decoding is greater than or equal to the first threshold value, is greater than a value of the first function determined when the number of times of arithmetic decoding is less than the first threshold value.

8. The entropy decoding method of claim 1 , wherein a value of the first function that is determined when the number of times of arithmetic decoding is greater than or equal to the first threshold value, is greater by 1 than a value of the first function determined when the number of times of arithmetic decoding is less than the first threshold value.

9. The entropy decoding method of claim 1 , further comprising:

obtaining a request for the syntax element; and

based on a type of the syntax element, determining a number of symbols.

10. The entropy decoding method of claim 9 , wherein a value of the first scaling factor is determined by using the number of symbols.

11. The entropy decoding method of claim 10 , wherein,

based on the number of symbols being greater than or equal to a predetermined value, the value of the first scaling factor is determined based on the predetermined value, and

based on the number of symbols being less than the predetermined value, the value of the first scaling factor is determined based on the number of symbols.

12. The entropy decoding method of claim 1 , wherein, when a number of symbols is M which is an integer, the current symbol corresponds to one integer of 0 to M−1.

13. An entropy decoding apparatus comprising at least one processor configured to:

obtain, from a bitstream, information about a slice type;

based on an occurrence probability of a symbol, perform arithmetic decoding on a current symbol corresponding to a syntax element;

based on the slice type indicating an I slice, determine a first scaling factor for updating the occurrence probability of the symbol by using a first function, wherein a value of the first function is determined based on a count value and a first threshold value;

when the information about the slice type indicates a B or P slice, determine the first scaling factor by using a second function, wherein a value of the second function is determined based on the count value and a second threshold value; and

by using the first scaling factor, update the occurrence probability of the symbol,

wherein the first threshold value is greater than or equal to the second threshold value,

wherein the count value indicates a number of times a symbol corresponding to the syntax element has been previously arithmetic-decoded.

14. An entropy encoding method comprising:

obtaining information about a slice type;

based on an occurrence probability of a symbol, performing arithmetic encoding on a current symbol corresponding to a syntax element;

based on the slice type indicating an I slice, determining a first scaling factor for updating the occurrence probability of the symbol by using a first function, wherein a value of the first function is determined based on a count value and a first threshold value;

based on the slice type indicating a B or P slice, determining the first scaling factor by using a second function, wherein a value of the second function is determined based on the count value and a second threshold value; and

by using the first scaling factor, updating the occurrence probability of the symbol,

wherein the first threshold value is greater than or equal to the second threshold value,

wherein the count value indicates a number of times a symbol corresponding to the syntax element has been previously arithmetic-decoded.

15. A method for transmitting a bitstream comprising:

obtaining information about a slice type;

based on an occurrence probability of a symbol, performing arithmetic encoding on a current symbol corresponding to a syntax element;

based on the slice type indicating an I slice, determining a first scaling factor for updating the occurrence probability of the symbol by using a first function, wherein a value of the first function is determined based on a count value and a first threshold value;

based on the slice type indicating a B or P slice, determining the first scaling factor by using a second function, wherein a value of the second function is determined based on the count value and a second threshold value;

by using the first scaling factor, updating the occurrence probability of the symbol;

generating the bitstream including the arithmetic encoded syntax element; and

transmitting the bitstream from an encoding apparatus to a decoding apparatus,

wherein the first threshold value is greater than or equal to the second threshold value,

wherein the count value indicates a number of times a symbol corresponding to the syntax element has been previously arithmetic-decoded.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 20, 2023
From: PIAO, YINJI; KIM, KYUNGAH; PARK, MINSOO; PARK, MINWOO; CHOI, KWANGPYO
To: SAMSUNG ELECTRONICS CO., LTD.
Reel/Frame 063035/0949 →
Priority Claims (2)
KR 10-2022-0042526 · Apr 5, 2022 · national
KR 10-2022-0114368 · Sep 8, 2022 · national
Continuity (2)
Continuation PCTKR2023003261 · Mar 9, 2023
Related Publication 20230319319A1 · Oct 5, 2023
References Cited (33)
US 9172976B2 · Chien et al. · 2015 [cited by applicant]
US 9661326B2 · Alshin · 2017 [cited by examiner]
US 10869062B2 · Egilmez · 2020 [cited by examiner]
US 10911756B2 · Lee et al. · 2021 [cited by applicant]
US 10939104B2 · Alshina et al. · 2021 [cited by applicant]
US 10999579B2 · Misra et al. · 2021 [cited by applicant]
US 11178399B2 · Dong et al. · 2021 [cited by applicant]
US 11277614B2 · George et al. · 2022 [cited by applicant]
US 11457230B2 · Stegemann et al. · 2022 [cited by applicant]
US 11638006B2 · Alshina et al. · 2023 [cited by applicant]
US 11924438B2 · Zhao et al. · 2024 [cited by applicant]
US 20130028334A1 · Bossen · 2013 [cited by examiner]
US 20170339413A1 · Alshin · 2017 [cited by examiner]
US 20180338144A1 · Nam · 2018 [cited by examiner]
US 20190200043A1 · Egilmez · 2019 [cited by examiner]
US 20210227222A1 · Lee · 2021 [cited by examiner]
US 20210289222A1 · Wang et al. · 2021 [cited by applicant]
US 20210392330A1 · Piao · 2021 [cited by examiner]
US 20220109850A1 · Jang et al. · 2022 [cited by applicant]
US 20220377340A1 · Misra · 2022 [cited by examiner]
US 20220408091A1 · Lee · 2022 [cited by examiner]
US 20230024560A1 · Bossen · 2023 [cited by examiner]
US 20230134365A1 · Kirchhoffer · 2023 [cited by examiner]
US 20240007636A1 · Jeon · 2024 [cited by examiner]
KR 1020190140862A · 2019 [cited by applicant]
KR 1020210133976A · 2021 [cited by applicant]
KR 102365164B1 · 2022 [cited by applicant]
International Search Report & Written Opinion (PCT/ISA/210 & 237) issued Jun. 8, 2023 by the International Searching Authority in International Application No. PCT/KR2023/003261. [cited by applicant]
Alshin et al., “High Precision Probability Estimation for Cabac, ” Visual Communication and Image Processing, 2013, Total 6 pages. [cited by applicant]
Han, “Probability Model Estimation for M-ary Random Variables,” Alliance for Open Media Codec Working Group, Document: CWG-C018_v1, Feb. 17, 2022, Total 6 pages. [cited by applicant]
Akula et al., “Description of SDR, HDR and 360° video coding technology proposal considering mobile application scenario by Samsung, Huawei, GoPro, and HiSilicon,” Document: JVET-J0024, Joint Video Exploration Team (JVE… [cited by applicant]
Choi et al., “CE5: Counter-based probability estimation (Test 2.4),” Document: JVET-K0170-v1, Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, Jul. 2018, Total 4 pages. [cited by applicant]
Xiu et al., “AHG12: Improved probability estimation for CABAC,” Document: JVET-Y0157 v2, Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29, Jan. 2022, Total 4 pages. [cited by applicant]