{'fraction_non_alphanumeric': 0.018891687657430732, 'fraction_numerical': 0.005037783375314861, 'mean_word_length': 5.309523809523809, '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}}
Graph-cut rate-distortion optimization for subband image compression

We present a new rate-distortion optimization algorithm based on graph-cuts that can encode efficiently the coefficients of a critically sampled or even redundant non orthogonal transform. The basic idea is to construct a specialized graph such that its minimum cut minimizes an energy functional. We propose to use the graph-cut mechanism for the minimization of the rate-distortion Lagrangian function. To this aim, we have designed a graph able to represent the decomposition subbands and take into consideration their correlations in a biorthogonal multiresolution representation. The method yields good compression results compared to the state-of-art JPEG2000 codec, as well as a general improvement in visual quality.