{'fraction_non_alphanumeric': 0.02280501710376283, 'fraction_numerical': 0.0011402508551881414, 'mean_word_length': 4.9727891156462585, '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}}
Complexity Analysis and Accuracy of Image Recovery Based on Signal Transformation Algorithms

In this paper we compare and analyze the complexity of three functions: Fast Fourier transform (FFT), Discrete Cosine Transform (DCT) and Discrete Wavelet Transform (DWT), used in image transformation. The purpose of all the algorithms is to shift the signal from space or time domain to frequency domain for de-noising or compression. We compare the simulated process time of both one and two dimensional FFT, DCT and DWT (Symlet and Debauches 1) using image and speech signal. The process time is found lowest for FFT and highest for DWT, provided its basis function governs the process time and DCT provide the moderate result. Finally the quality of compressed image under the three mathematical functions are compared, where DWT is found as the best and FFT yields worst result.