{'fraction_non_alphanumeric': 0.015364916773367477, 'fraction_numerical': 0.0, 'mean_word_length': 5.516666666666667, '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}}
Efficient Image Set Compression

The explosion of digital photos has posed a challenge for storage and transmission bandwidth. The thesis briefly discusses my work on efficient image set compression. The lossless compression of near-duplicate image collection is carried out using multiple steps, where each step is computationally demanding. My task is to make them work faster without compromising on compression efficiency. In this pursuit, we propose approaches for efficient clustering, fast direction oriented motion estimation algorithm, and an image reordering scheme with minimum predictive costs for better compression. The preliminary results for the proposed approach are promising. We also aim to extend our approach to hyperspectral and medical image set compression.