|
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 Field | Value | Language |
|---|
| contributor.author | Senapati, R K | - |
| contributor.author | Pati, U C | - |
| contributor.author | Mahapatra, K K | - |
| date.accessioned | 2010-10-25T05:43:30Z | - |
| date.available | 2010-10-25T05:43:30Z | - |
| date.issued | 2010 | - |
| identifier.citation | International Conference on Advances in Communication, Network, and Computing – CNC 2010,04-05 October, 2010,Calicut, | en |
| identifier.uri | http://hdl.handle.net/2080/1307 | - |
| 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 |
| format.extent | 411771 bytes | - |
| format.mimetype | application/pdf | - |
| language.iso | en | - |
| subject | DCT, | en |
| subject | DTT, | en |
| subject | Image compression, | en |
| subject | Peak signal to noise ratio (PSNR). | en |
| title | Image Compression Using Discrete Tchebichef Transform Algorithm | en |
| type | Article | en |
| Appears in Collections: | Conference Papers
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| ranjan.pdf | | 402Kb | Adobe PDF | View/Open |
|
Show simple item record
All items in DSpace are protected by copyright, with all rights reserved.
|
