Method and apparatus for packaging image data for transmission over a network

• US 10,244,263 B2
• Filed: 10/20/2015
• Issued: 03/26/2019
• 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/918,389
• Publication Number:
  US 20160142737A1
• Time in Patent Office: 1,253 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 comprising:

using a multi-level wavelet transform engine to transform a given block of image data, of an image, having square dimensions to form a corresponding data block comprising an array of transformed image coefficients configured as a plurality of bit planes, wherein the given data block contains absolute image data that does not depend on either historical or forward data, and the given block is a smallest block into which the image is broken down into for processing;

configuring, by a codec a plurality of variable length data blocks corresponding to respective blocks of image data having square dimensions, into a data stream for transmission over a communications network, wherein an indexed data block is formed for each data block in the plurality of data blocks, wherein the indexed block size is fixed so that each indexed data block has the same size;

wherein each indexed data block formed for each data block in the plurality of data blocks containing absolute image data comprises no more than a single data block, wherein the length of the data block may vary from data block to data block, and wherein each indexed data block formed for each data block in the plurality of data blocks comprises;

a data block sync word that is distinguishable from other data in said data stream and that is identical for all indexed data blocks;

an index number which uniquely identifies the data block within said plurality of data blocks; and

the respective data block of variable length;

packaging at least one indexed data block corresponding to a transformed block of image data into a plurality of data packets for transmission over said communications network;

determining, for a last packet in the plurality of data packets, whether the last packet is only partially filled with data block data corresponding to the transformed block of image data;

in response to a determination that the last packet in the plurality of data packets is only partially filled with data block data corresponding to the transformed block of image data, packing the last packet with non-image data.

2. The method of claim 1, wherein each said indexed data block comprises, in sequence, said data block sync word, said index number and said respective data block.

3. The method of claim 1 wherein said sync word comprises a repeated sequence of identical bits.

4. The method of claim 3 wherein said identical bits are each equal to 1.

5. The method of claim 1 wherein said index number for each said indexed data block comprises a bit sequence having a first number of bits that enables at least 2048 different data blocks to be uniquely identified.

6. The method of claim 1 wherein said block of image data, of an image, having square dimensions has dimensions of 2×

2, 4×

4 or 32×

32.

7. The method of claim 5 wherein said first number of bits is 11 bits.

8. A method of retrieving a plurality of indexed data blocks from a data stream transmitted over a communications network by a codec, comprising:

receiving a first plurality of indexed data blocks corresponding to respective transformed blocks of image data of an image, wherein a block of image data is a smallest block into which the image is broken down into for processing, wherein each indexed data block is received in a distinct set of packets, the packets being of the same size, and wherein a given indexed data block comprises;

a data block sync word identifying a respective indexed data block;

an index number which defines a position of a respective data block in an image frame; and

the respective data block of variable length, the respective data block comprising image data having square dimensions transformed using a multi-level wavelet transform engine to form the respective data block, the respective data block comprising an array of transformed image coefficients configured as a plurality of bit planes, wherein the respective data block contains absolute image data that does not depend on either historical or forward data;

locating within said data stream each sync word identifying an indexed data block;

retrieving each said identified indexed data block from said data stream;

where a given data block is not a last block in an image frame, validating a given data block using a data block sync word associated with the given data block and using a sync word associated with a next data block;

where a given data block is the last block in an image frame, using an additional received sync word not associated with an indexed data block, the additional received sync word indicating the given data block is the last data block in the image frame;

in response to determining that a given received data block is damaged, inhibiting am image corresponding to the data block from being displayed;

applying a reverse wavelet transform to transform respective data blocks, in respective indexed data blocks identified by respective located sync words, and enabling corresponding image data to be displayed and, if a data block has been determined to be damaged, enabling image data of a previous intact block to be displayed in place of image data corresponding to the damaged data block.

9. The method of claim 8 further comprising selecting for subsequent processing only those indexed data blocks that have been validated as valid indexed data blocks said subsequent processing comprising said application of a reverse wavelet transform.

10. The method of claim 9 wherein said data blocks comprise data corresponding to sequence of image frames, and wherein said subsequent processing comprises reconstructing said image frames from said data blocks.

11. The method of claim 10 wherein said data blocks comprise compressed data, and said subsequent processing comprises decompressing said compressed data.

12. The method of claim 10 wherein said reconstruction of said image frames comprises replacing a data block associated with a first index number of a previous image frame with a data block of a validated indexed data block of a subsequent image frame associated with said first index number.