{'fraction_non_alphanumeric': 0.0219256434699714, 'fraction_numerical': 0.0009532888465204957, 'mean_word_length': 5.953642384105961, '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}}
HLS: Hierarchical Lossless Segmentation - A New Approach for Bilevel Image Compression

Imaging plays a significant role in modern applications as medicine, telemetry and archiving. Hence, image compression is among the procedures of preserving the system resources. In this paper, we propose a new lossless compression technique based on hierarchical segmentation, namely hierarchi-callossless segmentation (HLS). The principle of HLS works with bilevel images on hierarchical segmentation until homogeneous segments are obtained. The homogeneous segments are then encoded by an efficient interference-limiting constellation in which each symbol assembles two bits. From the compression performance perspective, findings illustrate that the proposed HLS outperforms the existing work with compression gain up to 6%. From the compression time perspective, HLS introduces moderate computational time among the comparable approaches. Images, that meet the smoothness criterion, highlight the compression and computational efficiencies of our proposal.