Discrete cosine transform: algorithms, advantages, applications
Discrete cosine transform: algorithms, advantages, applications
The JPEG still picture compression standard
Communications of the ACM - Special issue on digital multimedia systems
IEEE Transactions on Signal Processing
Image analysis by Tchebichef moments
IEEE Transactions on Image Processing
Some computational aspects of discrete orthonormal moments
IEEE Transactions on Image Processing
Low-complexity transform and quantization in H.264/AVC
IEEE Transactions on Circuits and Systems for Video Technology
Fast Computation of Chebyshev Moments
IEEE Transactions on Circuits and Systems for Video Technology
| Hi-index | 0.00 |
The Discrete Tchebichef Transform (DTT) is a linear orthogonal transform which has higher energy compactness property like other orthogonal transform such as Discrete Cosine Transform (DCT). It is recently found applications in image analysis and compression. This paper proposes a new approach of fast zigzag pruning algorithm of 4×4 DTT coefficients. The principal idea of the proposed algorithm is to make use of the distributed arithmetic and symmetry property of 2-D DTT, which combines the similar terms of the pruned output. Normalization of each coefficient is done by merging the multiplication terms with the quantization matrix 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). The proposed method is implemented on a Xilinx XC2VP30 FPGA device to show its efficient use of hardware resources.