{'fraction_non_alphanumeric': 0.020484171322160148, 'fraction_numerical': 0.0, 'mean_word_length': 6.072368421052632, '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}}
Performance analysis of stereo coding algorithms

We discuss several techniques for stereo image coding. These techniques include those that are directly adapted from motion compensation such as disparity compensation, windowed disparity compensation, and variable block size disparity compensation (quadtree decomposition) as well as a novel stereo coding algorithm that we have previously proposed, namely the subspace projection technique (SPT). Also, combined techniques such as windowed disparity compensation followed by the SPT or variable block size disparity compensation followed by the SPT are implemented. In addition, improvements and modifications for the subspace projection technique are reported. These improvements include a non-statistical significance test for the subspace coefficients, two different implementations of the basic algorithm, a locally optimal bit-allocation scheme, and a new quantization scheme for the projection coefficients. In addition, we compare the rate-distortion performance of our approach to several stereo coding algorithms.