This method preforms a matrix multiplication of the input pixel data matrix by the transposed cosine matrix and store the result in a temporary N N ma

���������������������������� This method sets up the quantization matrix using the Quality parameter and then sets up the Cosine Transform Matrix and

Initializes the ZigZag matrix.

This method is preformed using the reverse of the operations preformed in the DCT. This restores a N N input block to the corresponding output block w

This method orders the DCT result matrix into a zigzag pattern and then quantitizes the data. The quantitized value is rounded to the nearest integer.

Constructs a new DCT object. Initializes the cosine transform matrix these are used when computing the DCT and it's inverse. This also initializes the

This method uses bit shifting to convert an array of two bytes to a integer (16 bits max). Byte 0 is the most signifigant byte and Byte 1 is the least

<br><br> This does not huffman code, it uses a minimal run-length encoding scheme. Huffman, Adaptive Huffman or arithmetic encoding will give much bet

This method determines the runs in the input data, decodes it and then returnss the corrected matrix. It is used to decode the data from the compressI

This method reads in DCT codes dequanitizes them and places them in the correct location. The codes are stored in the zigzag format so they need to b

This method uses bit shifting to convert an integer to an array of two bytes, byte 0, the most signifigant and byte 1, the least signifigant. @param c