摘要:
The present invention is embodied in a data compression encoder (38) for use with the discrete cosine transform compression process (48). The invention enhances compression using the discrete cosine transform by utilizing a prediction engine (46) that breaks the data received into predicted and unpredicted portions. The predicted portions are excluded from the discrete cosine transform reducing the time required to compress a file. The prediction engine relies, in part, upon look-up tables that are used to determine the predicted blocks. A table build engine and database compiler are used to create the look-up tables.
摘要:
In some embodiments of the present invention, quantized frequency coefficients of a matrix of spatial data are obtained. Blocks of frequency coefficients that will be zero-valued after quantization are identified. Only frequency coefficients belonging to other blocks are calculated explicitly using the spatial-to-frequency transform.
摘要:
In some embodiments of the present invention, frequently occurring inverse linear transform results are calculated and stored in look-up-tables. In real time, incoming blocks of linear transform coefficients are divided into two or more groups. A numerical code is determined for each group and checked against a look-up-table for that group to see whether it corresponds to a pre-calculated inverse linear transform result.
摘要:
The present invention is embodied in a data compression encoder (38) for use with the discrete cosine transform compression process (48). The invention enhances compression using the discrete cosine transform by utilizing a prediction engine (46) that breaks the data received into predicted and unpredicted portions. The predicted portions are excluded from the discrete cosine transform reducing the time required to compress a file. The prediction engine relies, in part, upon look-up tables that are used to determine the predicted blocks. A table build engine and database compiler are used to create the look-up tables.
摘要:
In some embodiments of the present invention, low frequency components for a current block in a current picture and a candidate block in a reference picture are obtained. For each of the low frequency components, quantized phase differences between the current block and the candidate block are calculated. Using the quantized phase differences as an index, coordinates of a global maximum of a correlation function corresponding to the quantized phase differences are retrieved from the table. The coordinates represent a motion vector. A refined candidate block is determined from a spatial search in the vicinity of a candidate block in the reference picture from which the motion vector originates when the motion vector terminates at the current block. The refined candidate block is selected as a reference block for the current block if a matching criterion between the refined candidate block and the current block satisfies a predetermined criterion.
摘要:
An image compression method is provided including separating an image into a plurality of color channel sub-images processing each of the color channel sub-images by sub-sampling the sub-image transform coding the sub-sampled sub-image decoding the transform-coded image forming a plurality of square groupings of pixels in the decoded image predicting a value for a pixel within each of the x-shaped groupings determining a prediction error for each predicted pixel value within each of the square groupings coding the prediction error forming a plurality of at least partly diamond-shaped groupings of pixels in the decoded image predicting a value for a pixel within each of the diamond-shaped groupings and combining each of the processed color channel sub-images with the coded prediction errors, thereby forming a compressed image.