Abstract—The Discrete Tchebichef transform (DTT) is a linear orthonormal version of the orthogonal Tchebichef polynomials, which is recently used in image analysis and compression. This paper presents a new fast block-pruned 4x4 DTT algorithm which is suitable for pruning the output coefficients in block fashion. The principle idea behind the proposed algorithm is the utilization of the distributed-arithmetic and the symmetry properties of 2-d DTT in order to combine similar terms of the linear combination of each computed pruned output. As well as, some trivial multiplications are represented by shifts or add-shift operations to reduce the number of required computations. The proposed algorithm requires the smallest computation complexity with respect to other recently proposed algorithms. Different block-pruning sizes are considered in the comparative analysis of the proposed algorithm vs. others. Furthermore, the experimental results show that the DTT is a good alternative for the Discrete Cosine Transform (DCT) in image compression especially for artificial diagrams images.
Index Terms—DTT, Fast algorithm, Image Compression, Pruned.
Manuscript received April 29, 2009. H. I. Saleh is permanently with the National Center for Radiation Research and Technology (NCRRT), Atomic Energy Authority, Egypt (phone: 202-22738665; fax: 202-22749298). H. I. Saleh is currently with Computer Science Dept., Gurayat Community College, Jouf University, KSA (Phone:+966551553404, Fax:+96646432445).
[PDF]
Cite: Hassan I. Saleh, "A Fast Block-Pruned 4x4 DTT Algorithm for Image Compression,"
International Journal of Computer Theory and Engineering vol. 1, no. 3, pp. 258-261, 2009.
