Bicriteria Block Splitting Heuristic For Lossy Compression
US-2023141888-A1 · May 11, 2023 · US
US12101492B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-12101492-B2 |
| Application number | US-202117355842-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jun 23, 2021 |
| Priority date | Jun 23, 2021 |
| Publication date | Sep 24, 2024 |
| Grant date | Sep 24, 2024 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A method of image compression, including, receiving at least one unprocessed image frame, transforming a domain of the at least one unprocessed image frame to output a transformed domain dataset, block processing the transformed domain dataset to yield a blocked dataset, quantizing the blocked dataset to produce a quantized dataset and entropy encoding the quantized dataset to construct at least one compressed image frame.
Opening claim text (preview).
What is claimed is: 1. A method of image compression, comprising: receiving at least one unprocessed image frame, wherein the unprocessed image frame is at least one of unprocessed and minimally processed; transforming a domain of the at least one unprocessed image frame to output a transformed domain dataset wherein the unprocessed image frame is sampled in a Bayer color filter array format and the transformed domain dataset is in a domain having a luminance channel, a blue-green difference channel, a red-green difference channel, and a first green to second green difference channel: block processing the transformed domain dataset to yield a blocked dataset, wherein the block processing utilizes at least one of discrete cosine transform and wavelet transform; quantizing the blocked dataset to produce a quantized dataset; and entropy encoding the quantized dataset to construct at least one compressed image frame. 2. The method of image compression of claim 1 , wherein the block processing divides the transformed domain dataset into a set of regular blocks. 3. The method of image compression of claim 1 , further comprising reorganizing a set of transform coefficients of the block processing. 4. The method of image compression of claim 1 , further comprising retransforming a set of transform coefficients of the block processing. 5. The method of image compression of claim 1 , wherein a quantization factor applied for quantization is based on a set of coefficient frequencies. 6. The method of image compression of claim 1 , wherein a quantization factor applied for quantization is based on a coefficient criticality. 7. The method of image compression of claim 1 , wherein the entropy encoding is processed by at least one of Huffman coding and Arithmetic coding. 8. The method of image compression of claim 1 , wherein the transforming of the at least one unprocessed image frame is a lossless transformation. 9. The method of image compression of claim 1 , wherein the at least one unprocessed image frame is a video frame. 10. A method of image decompression, comprising: receiving at least one compressed image frame; entropy decoding the at least one compressed image frame to construct an entropy decoded dataset; de-quantizing the entropy decoded dataset to produce a de-quantized dataset; inverse block processing the de-quantized dataset to yield produce an inverse blocked dataset, wherein the inverse block processing utilizes at least one of inverse discrete cosine transform and inverse wavelet transform; and inverse transforming the inverse blocked dataset to output at least one unprocessed image frame, wherein the uncompressed image frame is in a Bayer color filter array format and the inverse blocked dataset is in a domain having a luminance channel, a blue-green difference channel, a red-green difference channel, and a first green to second green difference channel. 11. The method of image decompression of claim 10 , wherein the entropy decoding is processed by at least one of Huffman decoding and Arithmetic decoding. 12. The method of image decompression of claim 10 , wherein a de-quantization factor applied to de-quantization based on a coefficient criticality. 13. The method of image decompression of claim 10 , wherein a de-quantization factor applied to de-quantization based on a set of coefficient frequencies. 14. The method of image decompression of claim 10 , further comprising retransforming a set of inverse transform coefficients of the inverse block processing. 15. The method of image decompression of claim 10 , further comprising reorganizing a set of inverse transform coefficients of the inverse block processing. 16. The method of image decompression of claim 10 , wherein the inverse transformation includes at least three color channels. 17. The method of image decompression of claim 10 , wherein the inverse transforming of the at least one compressed image frame is a lossless inverse transformation. 18. The method of image decompression of claim 10 , wherein the at least one compressed image frame is a video frame.
using discrete cosine transform [DCT] · CPC title
Adaptive subdivision aspects, e.g. subdivision of a picture into rectangular or non-rectangular coding blocks · CPC title
Entropy coding, e.g. variable length coding [VLC] or arithmetic coding · CPC title
characterised by ordering of coefficients or of bits for transmission · CPC title
the unit being a set of transform coefficients · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.