초록 ▼

A system and method for compressing related data sets of a sequence are disclosed. The process compares domain blocks from a current frame buffer to range blocks in a previous frame buffer or vector quantization ("VQ") tables to generate affine map codes. The affine map codes are preferably encoded

A system and method for compressing related data sets of a sequence are disclosed. The process compares domain blocks from a current frame buffer to range blocks in a previous frame buffer or vector quantization ("VQ") tables to generate affine map codes. The affine map codes are preferably encoded by an entropy encoder before being transmitted to a remote site for decompression. The cost for the encoded affine map codes are computed and used to determine whether affine map codes for representing smaller blocks should be included in the affine map codes which represent the domain blocks into which the original frame was segmented. The methods are preferably implemented on a commercially available discrete cosine transform ("DCT") processor having a process controller and a data comparator. The results of the affine map code generating process on the DCT processor achieves a more consistent bit rate and image quality than methods operating the DCT processor to generate DCT codes.

대표청구항 ▼

[ What is claimed is:] [1.] A method for compressing related sets of data comprising the steps of:performing a local search to compare a first set of range blocks from a range area in a previous frame buffer to a domain block;performing a checkerboard search to compare a second set of range blocks f

[ What is claimed is:] [1.] A method for compressing related sets of data comprising the steps of:performing a local search to compare a first set of range blocks from a range area in a previous frame buffer to a domain block;performing a checkerboard search to compare a second set of range blocks from a range area in said previous frame buffer to said domain block;determining a first cost of coding a best correspondence between a range block from said first set and said domain block;determining a second cost of coding a best correspondence between a range block from said second set and said domain block; andselecting a set of codes to represent said domain block, said selected set of codes corresponding to said best correspondence having a least cost.