Method and apparatus for compressing image data using compression profiles

• US 9,924,199 B2
• Filed: 10/08/2015
• Issued: 03/20/2018
• Est. Priority Date: 08/26/2005
• Status: Active Grant

• Current Assignee: RGB Systems Incorporated
• Original Assignee: RGB Systems Incorporated
• Inventors: Smith, Peter Lionel
• Primary Examiner(s): Vaughn, Jr., William C
• Assistant Examiner(s): Noh, Jae N
• Application Number:
  US14/878,339
• Publication Number:
  US 20160105686A1
• Time in Patent Office: 894 Days
• Field of Search: 37524019
• CPC Class Codes: H04N 19/107 between spatial and temporal predictive coding, e.g. picture refresh
• CPC Class Codes: H04N 19/13 Adaptive entropy coding, e.g. adaptive variable length coding [AVLC] or context adaptive binary arithmetic coding [CABAC]
• CPC Class Codes: H04N 19/132 Sampling, masking or truncation of coding units, e.g. adaptive resampling, frame skipping, frame interpolation or high-frequency transform coefficient masking
• CPC Class Codes: H04N 19/17 the unit being an image region, e.g. an object
• CPC Class Codes: H04N 19/174 the region being a slice, e.g. a line of blocks or a group of blocks
• CPC Class Codes: H04N 19/176 the region being a block, e.g. a macroblock
• CPC Class Codes: H04N 19/182 the unit being a pixel
• CPC Class Codes: H04N 19/186 the unit being a colour or a chrominance component
• CPC Class Codes: H04N 19/1883 the unit relating to sub-band structure, e.g. hierarchical level, directional tree, e.g. low-high [LH], high-low [HL], high-high [HH]
• CPC Class Codes: H04N 19/33 in the spatial domain
• CPC Class Codes: H04N 19/42 characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation H04N19/635 takes precedence
• CPC Class Codes: H04N 19/423 characterised by memory arrangements H04N19/433 takes precedence
• CPC Class Codes: H04N 19/507 using conditional replenishment
• CPC Class Codes: H04N 19/51 Motion estimation or motion compensation
• CPC Class Codes: H04N 19/61 in combination with predictive coding
• CPC Class Codes: H04N 19/63 using sub-band based transform, e.g. wavelets
• CPC Class Codes: H04N 19/635 characterised by filter definition or implementation details
• CPC Class Codes: H04N 19/645 by grouping of coefficients into blocks after the transform
• CPC Class Codes: H04N 19/647 using significance based coding, e.g. Embedded Zerotrees of Wavelets [EZW] or Set Partitioning in Hierarchical Trees [SPIHT]
• CPC Class Codes: H04N 19/66 involving data partitioning, i.e. separation of data into packets or partitions according to importance
• CPC Class Codes: H04N 19/68 : involving the insertion of resynchronisation markers into the bitstream
• CPC Class Codes: H04N 19/70 : characterised by syntax aspects related to video coding, e.g. related to compression standards
• CPC Class Codes: H04N 19/86 : involving reduction of coding artifacts, e.g. of blockiness
• CPC Class Codes: H04N 19/89 : involving methods or arrangements for detection of transmission errors at the decoder
• CPC Class Codes: H04N 19/91 : Entropy coding, e.g. variable length coding [VLC] or arithmetic coding
• CPC Class Codes: H04N 19/96 : Tree coding, e.g. quad-tree coding

Abstract

Methods of data encoding using trees formed with logic gates are described which lead to spatial compression of image data. Data encoding is achieved using a five-level wavelet transform, such as the Haar or the 2/10 transform. A dual transform engine is used, the first and engine being used for the first part of the first-level transform, the second part of the first-level transform and the subsequent-level transforms being performed by the second transform engine within a time interval which is less than or equal to the time taken by the first transform engine to effect the part-transform. Each bit plane of the resulting coefficients is then encoded by forming a tree structure from the bits and OR logical combinations thereof. Redundant data are removed from the resulting tree structure, and further data can be removed by using a predetermined compression profile. The resulting blocks of compressed data are of variable length and are packaged with sync words and index words for transmission so that the location and identity of the transformed data blocks can be determined from the received signal.

Claims

1. A method for compressing input image data comprising a plurality of multi-bit pixel values using a codec comprising:

transforming said input image data, using a pipelined transform engine that transforms a plurality of pixels in parallel, into transformed image data comprising a plurality of bit planes including coefficient bit planes and a sign bit plane, wherein bit planes in said plurality of coefficient bit planes have different levels of significance, wherein coefficient bit planes of lower significance have relatively fewer coefficients than coefficient bit planes of higher significance;

coding said transformed image data, including;

coding a given coefficient bit plane using a single pass coding engine by;

dividing a given row of coefficients into a plurality of coefficient subsets;

using a first plurality of trees to perform in parallel a first coding on respective coefficient subsets, the first coding including an output for a given tree in the first plurality of trees indicating whether inputs to a given tree in the first plurality of trees includes at least one non-zero coefficient;

retaining, for a given tree in the first plurality of trees, only the output and not the coefficients of the given coefficient subset when the output indicates that all coefficients in the given coefficient subset are zero;

using a second plurality of trees tree to perform in parallel a second coding using the first coding as an input, wherein a given tree in the second plurality of trees receives outputs of a plurality of trees from the first plurality of trees, the second coding including an output for a given tree in the second plurality of trees indicating whether inputs to a given tree in the second plurality of trees includes at least one non-zero input;

retaining, for a given tree in the second plurality of trees, only the output and not the inputs when the output indicates that all inputs are zero;

coding coefficient data;

coding sign data in the sign bit plane;

selecting a compression profile from a plurality of predetermined compression profiles stored in memory accessible to said codec, said plurality of compression profiles comprising compression profiles configured to produce different amounts of compression than other of said plurality of compression profiles, so as to exclude a greater number of bits from bit planes of lower significance than those from the bit planes of greater significance,

said compression profile comprising a compression parameter corresponding to each of said plurality of bit planes, each said compression parameter comprising a plurality of bit values;

applying said selected compression profile to said coded transformed image data using a single-pass, real time, compression engine to generate compressed transformed image data by assigning predetermined bit values to bits of said plurality of bit planes corresponding to said bit values of said compression parameters;

generating an output bit stream from said compressed transformed image data.

2. The method of claim 1 wherein said predetermined bit values comprise a bit value of zero.

3. The method of claim 2 wherein said bits of said bit planes assigned said bit value of zero by applying said selected compression profile to said once transformed image data are excluded from said output bit stream.

4. The method of claim 3 wherein said transforming said input image data comprises transforming said input image data using a multi-level transform, and wherein each of said plurality of bit planes comprise bits relating to a plurality of levels of said multi-level transform.

5. The method of claim 4 wherein said plurality of bit values of said compression parameters comprise bit values relating to said plurality of levels of said multi-level transform.

6. The method of claim 5 wherein said plurality of bit planes comprise bit planes having a plurality of degrees of significance ranging from most significant to least significant.

7. The method of claim 1 wherein said plurality of compression profiles comprises a first compression profile configured to produce a greatest amount of compression in said output stream of said plurality of compression profiles.

8. The method of claim 7 wherein said plurality of compression profiles comprises a second compression profile configured to produce a least amount of compression in said output data stream of said plurality of compression profiles.

9. The method of claim 8 wherein said least amount of compression comprises no compression.

10. The method of claim 4 wherein each of said compression parameters for each of said compression profiles comprises a first compression parameter bit value relating to a highest level of said multi-level transform.

11. The method of claim 10 wherein each of said first compression parameter bit values relating to said highest level of said multi-level transform have the value of 1.

12. The method of claim 6 wherein said plurality of compression profiles comprises a compression profile configured to cause a greater number of bits of a least significant bit plane to be excluded from said output data stream than a number of bits from a most significant bit plane caused to be excluded from said output data stream.

13. The method of claim 5 wherein said plurality of compression profiles comprises a compression profile configured to cause a greater number bits relating to a lowest level of said multi-level transform to be excluded from said output data stream than a number of bits relating to a highest level of said multi-level transform caused to be excluded from said output data stream.

14. The method of claim 12 wherein said plurality of compression profiles comprises a compression profile configured to cause a greater number bits relating to a lowest level of said multi-level transform to be excluded from said output data stream than a number of bits relating to a highest level of said multi-level transform caused to be excluded from said output data stream.

15. The method of claim 1 wherein said input image data comprises a sequence of a plurality of blocks of a plurality of image frames.

16. The method of claim 15 wherein said blocks each comprise a square array of multi-bit image pixels.

17. The method of claim 4 wherein said multi-level transform comprises a wavelet transform.

18. The method of claim 16 wherein said square array comprises a 32 by 32 array and said multi-level transform comprises a five-level wavelet transform.

19. The method of claim 18 wherein each of said compression parameters comprises 16 bit values.