DSpace@nitr >
National Institue of Technology- Rourkela >
Conference Papers >

Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/1322

Full metadata record

DC FieldValueLanguage
contributor.authorSenapati, R K-
contributor.authorPati, U C-
contributor.authorMahapatra, K K-
date.accessioned2010-12-06T04:57:50Z-
date.available2010-12-06T04:57:50Z-
date.issued2010-11-
identifier.citationInternational Conference on Computational Intelligence and Communication Networks (CICN2010), 26-28 November, 2010en
identifier.urihttp://hdl.handle.net/2080/1322-
descriptionCopyright belongs to the Proceeding of Publisheren
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
format.extent1269330 bytes-
format.mimetypeapplication/pdf-
language.isoen-
subjectDiscrete Tchebichef Momenten
subjectImage compressionen
subjectFast algorithmen
subjectBlock Prunen
subjectZigzag Prunen
titleA Novel Fast Zigzag Prune 4×4 Discrete Tchebichef Moment Based Image Compression Algorithmen
typeArticleen
Appears in Collections:Conference Papers

Files in This Item:

File Description SizeFormat
CICN2010.pdf1239KbAdobe PDFView/Open

Show simple item record

All items in DSpace are protected by copyright, with all rights reserved.

 

Powered by DSpace Feedback