Image Compression Encoding Extra Bits for Random Access
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing image compression methods, such as DCT and JPEG-type compressors, require large pixel blocks for efficient compression, leading to increased processor power and memory bandwidth usage, and fail to maximize accuracy while minimizing storage and decoding complexity.
Innovation Solution
An image encoding and decoding system that encodes and recovers at least one extra bit in the image compression process, allowing for increased precision and flexibility in bit ordering, enabling efficient compression and decompression of image data blocks without altering the original image.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If DCT or JPEG-type compressors are used to achieve reasonable compression factor and quality, then compression efficiency is improved, but processor power and memory bandwidth requirements increase
Solution Approach 1:
The patent divides the image into smaller 4x4 pixel blocks instead of using larger 8x8 or 16x16 blocks required by DCT. This segmentation allows independent processing of small blocks, reducing the computational burden per block and enabling more efficient use of processor power and memory bandwidth while maintaining compression effectiveness.
Solution Approach 2:
The patent changes the fundamental compression parameter from DCT coefficients to a new representation using two representative colors and 16 decision bits per 4x4 block. This parameter transformation enables compression with reduced computational requirements compared to traditional DCT-based methods.
2Use of energy by moving object
If BTC or CCC methods are used to reduce block size to 4x4 pixels, then processor power and memory bandwidth are reduced, but decoding hardware complexity increases
Solution Approach 1:
The patent pre-calculates and stores 256 lookup tables during encoding, where each table maps 4-bit indices to pairs of representative colors. During decoding, the system simply performs table lookups based on the compressed bitstream, avoiding complex real-time calculations. This preliminary preparation significantly simplifies the decoding hardware requirements while maintaining small block size benefits.
3Productivity
If large blocks of pixels are used for compression, then compression factor is improved, but random access to individual pixels becomes inefficient
Solution Approach 1:
By segmenting the image into small 4x4 pixel blocks, the patent enables fine-grained random access. When a single pixel or small region needs to be accessed, only the corresponding 4x4 block needs to be decompressed and transferred to memory, rather than fetching large portions of compressed data required by larger block methods. This segmentation directly reduces access time while maintaining overall compression efficiency.
Data Source
AI summary
A method for encoding at least one extra bit in an image compression and decompression system. The method includes accessing an input image, and compressing the input image into a compressed image using an encoder system, wherein said encoding system implements an algorithm for encoding at least one extra bit. The method further includes communicatively transferring the compressed image to a decoding system, and decompressing the compressed image into a resulting uncompressed image that is unaltered from said input image, wherein the algorithm for encoding enables the recovery of the at least one extra bit.