Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSenapati, R K-
dc.contributor.authorPati, U C-
dc.contributor.authorMahapatra, K K-
dc.identifier.citationInternational Conference on Computational Intelligence and Communication Networks (CICN2010), 26-28 November, 2010en
dc.descriptionCopyright belongs to the Proceeding of Publisheren
dc.description.abstractThe 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 4x4 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 3x3 block pruned case our method provides lesser computational complexity and has higher peak signal to noise ratio (PSNR).en
dc.format.extent1269330 bytes-
dc.subjectDiscrete Tchebichef Momenten
dc.subjectImage compressionen
dc.subjectFast algorithmen
dc.subjectBlock Prunen
dc.subjectZigzag Prunen
dc.titleA Novel Fast Zigzag Prune 4×4 Discrete Tchebichef Moment Based Image Compression Algorithmen
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
CICN2010.pdf1.24 MBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.