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/1307

Full metadata record

DC FieldValueLanguage
contributor.authorSenapati, R K-
contributor.authorPati, U C-
contributor.authorMahapatra, K K-
date.accessioned2010-10-25T05:43:30Z-
date.available2010-10-25T05:43:30Z-
date.issued2010-
identifier.citationInternational Conference on Advances in Communication, Network, and Computing – CNC 2010,04-05 October, 2010,Calicut,en
identifier.urihttp://hdl.handle.net/2080/1307-
description.abstractThe Discrete Tchebichef Transform (DTT) based on orthogonal Tchebichef polynomials can be an alternative to Discrete Cosine Transform (DCT) for JPEG image compression standard. The properties of DTT are not only very similar to DCT; it has also higher energy compactness and lower computational advantage using a set of recurrence relation. Through extensive simulation, image reconstruction accuracy (Peak Signal to Noise Ratio) and the number of bits required to encode the coefficients for both DCT and DTT is verified. It has been demonstrated that, DTT requires lesser number of bits to encode the coefficients than DCT for a given compression ratio.en
format.extent411771 bytes-
format.mimetypeapplication/pdf-
language.isoen-
subjectDCT,en
subjectDTT,en
subjectImage compression,en
subjectPeak signal to noise ratio (PSNR).en
titleImage Compression Using Discrete Tchebichef Transform Algorithmen
typeArticleen
Appears in Collections:Conference Papers

Files in This Item:

File Description SizeFormat
ranjan.pdf402KbAdobe PDFView/Open

Show simple item record

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

 

Powered by DSpace Feedback