{'fraction_non_alphanumeric': 0.016183986371379896, 'fraction_numerical': 0.0, 'mean_word_length': 5.420765027322404, '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}}
Research on the SAR Image Compression Method Based on Sparse Representation

Abstract The image sparse representation based on the over-complete dictionary is a new image representation theory. Using redundancy of the over-complete dictionary can capture various structural features of images effectively, thereby realizing effective representation of images. This paper presents a method using the over-complete dictionary sparse representation to realize image compression. In order to get the information required for the image, only the sparse decomposition coefficients and corresponding coordinates need to be stored to realize the purpose of image compression. This paper introduces K-SVD algorithm to realize constructing an over-complete dictionary. K-SVD is an algorithm based on learning. As all training samples come from the image itself, the dictionary can represent structure of the image better, thereby realizing sparse representation. Simulation results show that for SAR image compression, the algorithm introduced in this paper is effective and it is better than Jpeg algorithm based on DCT as well as EZW and SPIHT algorithms based on wavelet transform.