Method of image frame compression
OwnerChih-Ta Star Sunginventor
Life of this patent
Estimating the term…
Abstract
An image frame is compressed segment by segment by applying a lossless compression algorithm to the segment of pixels with simple pattern and a lossy algorithm to the segment with complex pattern. A segment comprising at least one homogenous area and one complex area will be compressed separately by assigning a lossless compression algorithm to compress the homogenous area and a lossly algorithm to compress the complex area. Another mechanism of partitioning a segment into multiple sub-segments with each sub-segment being compressed by one compression algorithm also helps in reducing the error in the homogenous area.
Claims14
A method of compressing an image frame, comprising:
- partitioning an image frame of pixels into a predetermined amount of segments with each segment having a predetermined amount of pixels;
- if the segment is a mixture of simple pattern and more pixels of complex patterns, then, separating the segment of pixel components into at least two areas and applying a lossless compression to code the area of simple pattern and applying a lossy compression algorithm to code the area of complex pattern;
- otherwise,
- applying a lossless compression algorithm to code the segment of pixel components, if the code length is within budget, then, the result is selected to be the output, otherwise, applying a lossy compression algorithm to code the segment of pixel components and select the result of code to be the output.
A method of compressing an image frame, comprising:
- partitioning an image frame of pixels into a predetermined amount of segments with each segment having a predetermined amount of pixels;
- determining the data rate and applying a lossless compression algorithm to code the segment of pixel components with simple pattern;
- determining the data rate and applying a lossy compression algorithm to code the segment of pixel components with complex pattern;
- and
- if the segment is a mixture of simple pattern and more pixels of complex patterns, then, dividing the segment of pixel components into at least two sub-segments and applying a lossless compression to code the sub-segment of simple pixel pattern and applying a lossy compression algorithm to code the sub-segment of complex pattern.
Dependencies are inferred from the claim text.