Image Compression Using Discrete Tchebichef Transform Algorithm

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Senapati, R K	-
dc.contributor.author	Pati, U C	-
dc.contributor.author	Mahapatra, K K	-
dc.date.accessioned	2010-10-25T05:43:30Z	-
dc.date.available	2010-10-25T05:43:30Z	-
dc.date.issued	2010	-
dc.identifier.citation	International Conference on Advances in Communication, Network, and Computing – CNC 2010,04-05 October, 2010,Calicut,	en
dc.identifier.uri	http://hdl.handle.net/2080/1307	-
dc.description.abstract	The 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
dc.format.extent	411771 bytes	-
dc.format.mimetype	application/pdf	-
dc.language.iso	en	-
dc.subject	DCT,	en
dc.subject	DTT,	en
dc.subject	Image compression,	en
dc.subject	Peak signal to noise ratio (PSNR).	en
dc.title	Image Compression Using Discrete Tchebichef Transform Algorithm	en
dc.type	Article	en
Appears in Collections:	Conference Papers

Files in This Item:

File	Description	Size	Format
ranjan.pdf		402.12 kB	Adobe PDF	View/Open