{'fraction_non_alphanumeric': 0.013172338090010977, 'fraction_numerical': 0.0, 'mean_word_length': 5.857142857142857, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Evaluation of Burrows Wheeler Transform based image compression algorithm for multimedia applications

Compression is a technique to reduce the quantity of data without excessively reducing the quality. The transmission and storing of compressed multimedia data is much faster and more efficient than original uncompressed data. There are various techniques and standards for multimedia data compression, especially for image compression. They are either lossless or lossy techniques. Arithmetic and Huffman coding are two of the widely used lossless compression techniques. Burrows Wheeler Transform(BWT) is a sorting technique which when used with the available compression algorithms can considerably increase the compression ratio. Here a hybrid compression model using BWT with Arithmetic Coding(AC) and Huffman Coding is analysed for image compression and improvement in overall compression is documented.