Comparison of lossless compression models

With the development of multimedia and digital imaging there is a need to reduce the cost of storage and transmission of information. The cost reduction translates into reducing the amount of data that represent the information. This thesis investigates the performance of several lossless compression algorithms widely used for image coding. The first three chapters describe these algorithms in detail, as well as give examples of well-known data compression algorithms such as Huffman. Arithmetic. Dynamic Markov Coding, and Run Length Encoding. Finally, the relative performances of the listed algorithms are compared. The thesis also includes C— and ANSI C implementations of the Huffman and RLE algorithms respectively.