A Novel Fast Zigzag Prune 4×4 Discrete Tchebichef Moment Based Image Compression Algorithm

The Discrete Tchebichef Moment (DTM) is a linear orthogonal transform which has higher energy compactness property like other orthogonal transform. It is recently found applications in image analysis and compression. This paper proposes a new approach of fast zigzag pruning algorithm of 4×4 DTM coefficients. The principal ideal of the proposed algorithm is to make use of the distributed arithmetic and the symmetry property of 2-D DTM, which combines the similar terms of the pruned output. The multiplication terms are replaced by shift and add operations so as to reduce the computation. Equal number of zigzag pruned coefficients and block pruned coefficients are used for comparison to test the efficiency of our algorithm. Experimental method shows that our method is competitive with the block pruned method. Specifically for 3×3 block pruned case our method provides lesser computational complexity and has higher peak signal to noise ratio (PSNR).