IP Library › Granted Patent US 12,225,205
Granted Patent B2
US 12,225,205 · App. 17/825,575 · Granted Feb 11, 2025

Block-wise entropy coding method in neural image compression

Inventors: Sheng Lin (San Jose, CA); Wei Jiang (Sunnyvale, CA); Shan Liu (San Jose, CA); Wei Wang (Palo Alto, CA)
Assignee: TENCENT AMERICA LLC
H04N19/149H04N19/176H04N19/60H04N19/91
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,225,205
App. No.
17/825,575
Granted
Feb 11, 2025
Kind
B2
Abstract

Systems and methods for block-wise entropy coding methods in neural image compression is provided. A method includes: receiving a bitstream that includes an image; partitioning the image into a plurality of blocks; compressing each of the plurality of blocks by a neural network-based encoder; obtaining compressed features by obtaining a compressed feature for each block from among the plurality of blocks in the image; processing the compressed features by an entropy encoder to generate a first compressed bitstream; obtaining a plurality of reshaped compressed features by concatenating the compressed features; processing the plurality of reshaped compressed features by the entropy encoder to generate a second compressed bitstream; and encoding the bitstream including the image based on the second compressed bitstream.

Claims (35)

1. A method performed by at least one processor in a video encoder, the method comprising:

receiving a bitstream that includes an image;

partitioning the image into a plurality of blocks;

compressing each of the plurality of blocks by a neural network-based encoder;

obtaining compressed features by obtaining a compressed feature for each block from among the plurality of blocks in the image;

processing the compressed features by an entropy encoder to generate a first compressed bitstream;

obtaining a plurality of reshaped compressed features by concatenating the compressed features such that a number of reshaped compressed features is less than a number of compressed features, wherein the concatenating the compressed features comprises concatenating the compressed feature blocks into reshaped compressed feature blocks that are larger than the compressed feature blocks, wherein a first reshaped compressed feature block has a square shape and a second reshaped feature block has a rectangular shape, wherein at least two of the reshaped compressed feature blocks are a different size from each other;

processing the plurality of reshaped compressed features by the entropy encoder to generate a second compressed bitstream; and

encoding the bitstream including the image based on the second compressed bitstream.

2. The method according to claim 1 , wherein

the obtaining the compressed features comprises obtaining compressed feature blocks; and.

3. The method according to claim 1 , wherein the encoding the bitstream comprises including an indicator in the encoded bitstream that indicates that the compressed features were concatenated.

4. The method according to claim 1 , further comprises sending the encoded bitstream to a decoder.

5. A system comprising:

at least one memory configured to store computer program code; and

at least one processor configured to access the computer program code and operate as instructed by the computer program code, the computer program code comprising encoding code that is configured to cause the at least one processor to:

partition an image, from a bitstream, into a plurality of blocks;

compress each of the plurality of blocks by a neural network-based encoder;

obtain compressed features by obtaining a compressed feature for each block from among the plurality of blocks in the image;

process the compressed features by an entropy encoder to generate a first compressed bitstream;

obtain a plurality of reshaped compressed features by concatenating the compressed features such that a number of reshaped compressed features is less than a number of compressed features, wherein the concatenating the compressed features comprises concatenating the compressed feature blocks into reshaped compressed feature blocks that are larger than the compressed feature blocks, wherein a first reshaped compressed feature block has a square shape and a second reshaped feature block has a rectangular shape, wherein at least two of the reshaped compressed feature blocks are a different size from each other;

process the plurality of reshaped compressed features by the entropy encoder to generate a second compressed bitstream; and

encode the bitstream including the image based on the second compressed bitstream.

6. The system according to claim 5 , wherein

the compressed features are compressed feature blocks.

7. The system according to claim 5 , wherein the encoding code is configured to cause the at least one processor to include an indicator in the encoded bitstream that indicates that the compressed features were concatenated.

8. A non-transitory computer-readable medium storing computer code that is configured to, when executed by at least one processor, cause the at least one processor to implement a video encoder that:

receives a bitstream that includes an image;

partitions the image into a plurality of blocks;

compresses each of the plurality of blocks by a neural network-based encoder;

obtains compressed features by obtaining a compressed feature for each block from among the plurality of blocks in the image;

processes the compressed features by an entropy encoder to generate a first compressed bitstream;

obtains a plurality of reshaped compressed features by concatenating the compressed features such that a number of reshaped compressed features is less than a number of compressed features, wherein the concatenating the compressed features comprises concatenating the compressed feature blocks into reshaped compressed feature blocks that are larger than the compressed feature blocks, wherein a first reshaped compressed feature block has a square shape and a second reshaped feature block has a rectangular shape, wherein at least two of the reshaped compressed feature blocks are a different size from each other;

processes the plurality of reshaped compressed features by the entropy encoder to generate a second compressed bitstream; and

encodes the bitstream including the image based on the second compressed bitstream.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 31, 2022
From: LIN, SHENG; JIANG, WEI; LIU, SHAN; WANG, WEI
To: TENCENT AMERICA LLC
Reel/Frame 060053/0197 →
Continuity (2)
Provisional Application 63212469 · Jun 18, 2021
Related Publication 20220408098A1 · Dec 22, 2022
References Cited (46)
US 10303980B1 · Kim · 2019 [cited by examiner]
US 10311321B1 · Kim · 2019 [cited by examiner]
US 10311324B1 · Kim · 2019 [cited by examiner]
US 10387754B1 · Kim · 2019 [cited by examiner]
US 10402695B1 · Kim · 2019 [cited by examiner]
US 10438082B1 · Kim · 2019 [cited by examiner]
US 20130121401A1 · Zheludkov · 2013 [cited by examiner]
US 20130279577A1 · Schwarz · 2013 [cited by examiner]
US 20130287116A1 · Helle · 2013 [cited by examiner]
US 20170013267A1 · Tanaka · 2017 [cited by examiner]
US 20180165427A1 · Verthein · 2018 [cited by examiner]
US 20180260956A1 · Huang · 2018 [cited by examiner]
US 20190050667A1 · Wang · 2019 [cited by examiner]
US 20190073553A1 · Yao · 2019 [cited by examiner]
US 20190149821A1 · Moon · 2019 [cited by examiner]
US 20190273922A1 · Lim · 2019 [cited by examiner]
US 20190281297A1 · Lee · 2019 [cited by examiner]
US 20190342550A1 · Lim · 2019 [cited by examiner]
US 20190355142A1 · Croxford · 2019 [cited by examiner]
US 20190362180A1 · Croxford · 2019 [cited by examiner]
US 20190364278A1 · Lee · 2019 [cited by examiner]
US 20190385024A1 · Croxford · 2019 [cited by examiner]
US 20190387226A1 · Lee · 2019 [cited by examiner]
US 20200089985A1 · Wang · 2020 [cited by examiner]
US 20200092552A1 · Coelho et al. · 2020 [cited by applicant]
US 20200092556A1 · Coelho et al. · 2020 [cited by applicant]
US 20200221122A1 · Ye · 2020 [cited by examiner]
US 20210027480A1 · Ren · 2021 [cited by examiner]
US 20210089807A1 · Liu · 2021 [cited by examiner]
US 20210314562A1 · Kang · 2021 [cited by examiner]
US 20210392353A1 · Skupin · 2021 [cited by examiner]
US 20210406582A1 · Wang · 2021 [cited by examiner]
US 20220132103A1 · Li · 2022 [cited by examiner]
US 20220368900A1 · Moon · 2022 [cited by examiner]
US 20220408098A1 · Lin · 2022 [cited by examiner]
US 20230095387A1 · Dumas · 2023 [cited by examiner]
US 20230096567A1 · Nalci · 2023 [cited by examiner]
US 20230254507A1 · Dumas · 2023 [cited by examiner]
US 20240031611A1 · Galpin · 2024 [cited by examiner]
US 20240155153A1 · Kang · 2024 [cited by examiner]
JP 2303220A · 1990 [cited by applicant]
JP 377477A · 1991 [cited by applicant]
Extended European Search Report dated Jun. 14, 2023 in Application No. 22800557.5. [cited by applicant]
International Search Report dated Oct. 25, 2022 in Application No. PCT/US22/33816. [cited by applicant]
Written Opinion of the International Searching Authority dated Oct. 25, 2022 in Application No. PCT/US22/33816. [cited by applicant]
Japanese Office Action issued Mar. 5, 2024 in Application No. 2023-519443. [cited by applicant]