Granted Patent B2

US 12,323,623 · App. 18/730,266 · Granted Jun 3, 2025

Inventors: Dongping Pan (Hangzhou, CN); Yucheng Sun (Hangzhou, CN); Xiaoqiang Cao (Hangzhou, CN); Fangdong Chen (Hangzhou, CN)

Assignee: HANGZHOU HIKVISION DIGITAL TECHNOLOGY CO., LTD.

H04N19/61H04N19/129H04N19/159H04N19/184

Abstract

Claims (55)

1. A coefficient decoding method, comprising:

parsing a code stream to obtain coefficient group information of a unit to be decoded, wherein coefficients of the unit to be decoded are divided into one or more coefficient groups, each of the coefficient groups comprises one or more coefficient codes, the coefficient codes in a same coefficient group are fixed-length codes with a same coding length, the coefficient groups comprise a first coefficient group, and the coefficient group information comprises one or more boundary symbols of the first coefficient group;

parsing one or more coefficient codes in the first coefficient group into one or more coefficient values; and

determining whether the coefficient values in the first coefficient group are positive or negative according to the boundary symbols;

wherein determining whether the coefficient values in the first coefficient group are positive or negative according to the boundary symbols comprises:

in response to an absolute extremum being in the first coefficient group, determining that symbols of coefficient values in the first coefficient group whose absolute values are equal to coefficients of the absolute extremum are all positive or all negative according to the boundary symbols, wherein the absolute extremum is the largest absolute value of a fixed-length code value range of the coding length.

2. The coefficient decoding method according to claim 1 , wherein the coefficient group information further comprises a coding length and an image bit width of the first coefficient group, the coding length is used to represent a length of fixed-length codes corresponding to the first coefficient group, and parsing one or more coefficient codes in the first coefficient group into one or more coefficient values comprises:

in response to the coding length being greater than or equal to the image bit width, parsing the coefficient codes in the first coefficient group into the coefficient values by using fixed-length codes with a length equal to the image bit width; and

in response to the coding length being smaller than the image bit width, parsing the coefficient codes in the first coefficient group into the coefficient values by using fixed-length codes with a length equal to the coding length.

3. The coefficient decoding method according to claim 1 , wherein the first coefficient group comprises one or more coefficient blocks, the boundary symbols comprise a boundary symbol of each of the coefficient blocks, and determining whether the coefficient values in the first coefficient group are positive or negative according to the boundary symbols comprises:

for any one of the coefficient blocks, in response to an absolute extremum being in the coefficient block, determining that symbols of coefficient values in the coefficient block whose absolute values are equal to coefficients of the absolute extremum are all positive or all negative according to the boundary symbol of the coefficient block.

4. The coefficient decoding method according claim 1 , wherein coefficients in the first coefficient group are residual coefficients, transform coefficients, or original pixel values.

5. The coefficient decoding method according to claim 4 , wherein the coefficient groups comprise a direct current (DC) coefficient group and an alternating current (AC) coefficient group, and the first coefficient group is the DC coefficient group or the AC coefficient group.

6. The coefficient decoding method according to claim 5 , wherein the coding length is in a form of a coding length code in the coefficient group information, and the boundary symbols are in a form of a boundary symbol code in the coefficient group information;

in response to the coefficient codes in the first coefficient group representing the transform coefficients and the first coefficient group being the DC coefficient group, the coefficient decoding method further comprises: parsing the coding length code by using a fixed-length code to obtain the coding length; parsing a DC coefficient value by using a fixed-length code with a length of the coding length and parsing the boundary symbol code by using a fixed coding length of 1 to obtain the boundary symbols.

7. The coefficient decoding method according to claim 4 , further comprising:

determining a grouping manner of the unit to be decoded according to the code stream;

obtaining a prediction mode of a current coding unit from the code stream, and deriving a scanning manner according to the prediction mode;

scanning the unit to be decoded according to the scanning manner to obtain one or more scanning results; and

extracting the first coefficient group from the scanning results according to the grouping manner.

8. An electronic device, comprising an image decoder, a communication interface and a memory, wherein the image decoder is configured to perform operations comprising:

parsing a code stream to obtain coefficient group information of a unit to be decoded, wherein coefficients of the unit to be decoded are divided into one or more coefficient groups, each of the coefficient groups comprises one or more coefficient codes, the coefficient codes in a same coefficient group are fixed-length codes with a same coding length, the coefficient groups comprise a first coefficient group, and the coefficient group information comprises one or more boundary symbols of the first coefficient group;

parsing one or more coefficient codes in the first coefficient group into one or more coefficient values; and

determining whether the coefficient values in the first coefficient group are positive or negative according to the boundary symbols;

wherein determining whether the coefficient values in the first coefficient group are positive or negative according to the boundary symbols comprises:

in response to an absolute extremum being in the first coefficient group, determining that symbols of coefficient values in the first coefficient group whose absolute values are equal to coefficients of the absolute extremum are all positive or all negative according to the boundary symbols, wherein the absolute extremum is the largest absolute value of a fixed-length code value range of the coding length.

9. The electronic device according to claim 8 , wherein the coefficient group information further comprises a coding length and an image bit width of the first coefficient group, the coding length is used to represent a length of fixed-length codes corresponding to the first coefficient group, and parsing one or more coefficient codes in the first coefficient group into one or more coefficient values comprises:

in response to the coding length being greater than or equal to the image bit width, parsing the coefficient codes in the first coefficient group into the coefficient values by using fixed-length codes with a length equal to the image bit width; and

in response to the coding length being smaller than the image bit width, parsing the coefficient codes in the first coefficient group into the coefficient values by using fixed-length codes with a length equal to the coding length.

10. The electronic device according to claim 8 , wherein the first coefficient group comprises one or more coefficient blocks, the boundary symbols comprise a boundary symbol of each of the coefficient blocks, and determining whether the coefficient values in the first coefficient group are positive or negative according to the boundary symbols comprises:

for any one of the coefficient blocks, in response to an absolute extremum being in the coefficient block, determining that symbols of coefficient values in the coefficient block whose absolute values are equal to coefficients of the absolute extremum are all positive or all negative according to the boundary symbol of the coefficient block.

11. The electronic device according to claim 8 , wherein coefficients in the first coefficient group are residual coefficients, transform coefficients, or original pixel values.

12. The electronic device according to claim 11 , wherein the coefficient groups comprise a direct current (DC) coefficient group and an alternating current (AC) coefficient group, and the first coefficient group is the DC coefficient group or the AC coefficient group.

13. The electronic device according to claim 12 , wherein the coding length is in a form of a coding length code in the coefficient group information, and the boundary symbols are in a form of a boundary symbol code in the coefficient group information;

in response to the coefficient codes in the first coefficient group representing the transform coefficients and the first coefficient group being the DC coefficient group, the operations further comprise: parsing the coding length code by using a fixed-length code to obtain the coding length; parsing a DC coefficient value by using a fixed-length code with a length of the coding length and parsing the boundary symbol code by using a fixed coding length of 1 to obtain the boundary symbols.

14. The electronic device according to claim 11 , further comprising:

determining a grouping manner of the unit to be decoded according to the code stream;

obtaining a prediction mode of a current coding unit from the code stream, and deriving a scanning manner according to the prediction mode;

scanning the unit to be decoded according to the scanning manner to obtain a scanning result; and

extracting the first coefficient group from the scanning result according to the grouping manner.

15. A non-transitory computer-readable storage medium comprising computer instructions, wherein when the computer instructions are run on an electronic device, the electronic device is enabled to perform operations comprising:

parsing a code stream to obtain coefficient group information of a unit to be decoded, wherein coefficients of the unit to be decoded are divided into one or more coefficient groups, each of the coefficient groups comprises one or more coefficient codes, the coefficient codes in a same coefficient group are fixed-length codes with a same coding length, the coefficient groups comprise a first coefficient group, and the coefficient group information comprises one or more boundary symbols of the first coefficient group;

parsing one or more coefficient codes in the first coefficient group into one or more coefficient values; and

determining whether the coefficient values in the first coefficient group are positive or negative according to the boundary symbols;

wherein determining whether the coefficient values in the first coefficient group are positive or negative according to the boundary symbols comprises:

in response to an absolute extremum being in the first coefficient group, determining that symbols of coefficient values in the first coefficient group whose absolute values are equal to coefficients of the absolute extremum are all positive or all negative according to the boundary symbols, wherein the absolute extremum is the largest absolute value of a fixed-length code value range of the coding length.

16. The storage medium according to claim 15 , wherein the coefficient group information further comprises a coding length and an image bit width of the first coefficient group, the coding length is used to represent a length of fixed-length codes corresponding to the first coefficient group, and parsing one or more coefficient codes in the first coefficient group into one or more coefficient values comprises:

in response to the coding length being greater than or equal to the image bit width, parsing the coefficient codes in the first coefficient group into the coefficient values by using fixed-length codes with a length equal to the image bit width; and

in response to the coding length being smaller than the image bit width, parsing the coefficient codes in the first coefficient group into the coefficient values by using fixed-length codes with a length equal to the coding length.

17. The storage medium according to claim 15 , wherein the first coefficient group comprises one or more coefficient blocks, the boundary symbols comprise a boundary symbol of each of the coefficient blocks, and determining whether the coefficient values in the first coefficient group are positive or negative according to the boundary symbols comprises:

for any one of the coefficient blocks, in response to an absolute extremum being in the coefficient block, determining that symbols of coefficient values in the coefficient block whose absolute values are equal to coefficients of the absolute extremum are all positive or all negative according to the boundary symbol of the coefficient block.

18. The storage medium according to claim 15 , wherein coefficients in the first coefficient group are residual coefficients, transform coefficients, or original pixel values.

19. The coefficient decoding method according to claim 18 , wherein the coefficient groups comprise a direct current (DC) coefficient group and an alternating current (AC) coefficient group, and the first coefficient group is the DC coefficient group or the AC coefficient group.

20. The storage medium according to claim 19 , wherein the boundary symbols are in a form of a boundary symbol code in the coefficient group information; and

the operations further comprise: parsing the boundary symbol code by using a fixed coding length of 1 to obtain the boundary symbols.

Assignments (1)

Priority Claims (1)

Continuity (1)

References Cited (20)