{'fraction_non_alphanumeric': 0.018915510718789406, 'fraction_numerical': 0.005044136191677175, 'mean_word_length': 4.969924812030075, '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}}
A new fast bit allocation procedure for image coding based on wavelet transform and dead zone lattice vector quantization

In this paper, we present a new bit allocation procedure based on the approximation of the rate distortion (R-D) functions provided by our efficient lattice vector quantizer with pyramidal dead zone (DZLVQ). Here, we show that DZLVQ R-D functions can be efficiently fitted by an exponential model. This property leads to an analytical solution to the bit allocation problem which reduces significantly the complexity of our compression scheme. Furthermore, our method is highly parallelizable. Finally we show that it keeps the very good results in terms of visual quality of DZLQV, as it better preserves fine structures with respect to SPIHT and JPEG2000 at low rates.