{'fraction_non_alphanumeric': 0.016570008285004142, 'fraction_numerical': 0.0008285004142502071, 'mean_word_length': 5.291666666666667, '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}}
Globally optimal algorithms for multiple-transform signal compression

In video compression, a single transform such as the DCT is typically used. Multipletransforms such as directional 1-D DCTs have been proposed to exploit the different statistical characteristics of motion compensation residuals. Many issues are associated with this scenario. In this thesis, we will focus on the issue of selecting the appropriate number of coefficients and transforms to be allocated for each block of the signal to optimize the energy compaction. We propose two new methods to select optimal transforms for different blocks in a signal. The first method is based on thresholding, while the second method is based on dynamic programming and related to the multiple-choice knapsack problem. These algorithms are then compared to two other previous algorithms. We analyze the energy compaction performance of these algorithms in terms of different blocksizes and different input characteristics. We then extend all of these algorithms to quantizated coefficients being transmitted, as well as to take a bit-rate constraint into account. Thesis Supervisor: Professor Jae S. Lim Title: Professor of Electrical Engineering