Please use this identifier to cite or link to this item:
http://hdl.handle.net/2080/1334
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-12-27T09:28:32Z | - |
dc.date.available | 2010-12-27T09:28:32Z | - |
dc.date.issued | 2010-12 | - |
dc.identifier.citation | IEEE INDICON 2010,IEEE Calcutta Section at Kolkata, December 17-19, 2010. | en |
dc.identifier.uri | http://hdl.handle.net/2080/1334 | - |
dc.description | Copyright belongs to Proceedings Publisher | en |
dc.description.abstract | In this paper, an efficient orthogonal sparse 8×8 transform matrix for low bit-rate image compression is proposed. The transform matrix is made sparse by appropriately inserting additional zeros into the matrix proposed by Bouguezel. The algorithm for fast computation is also developed. It is shown that the proposed transform matrix provides a 20% reduction in computation over the matrix proposed by Bouguezel, and 45% over signed discrete cosine transform (SDCT). By using various test images, it is shown that the rate-distortion performance is also almost comparable to that of above two transform matrices at low bit-rates. | en |
dc.format.extent | 233305 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.subject | Signed discrete cosine transform (SDCT) | en |
dc.subject | Image compression | en |
dc.subject | Percentage error energy norm (PEEN) | en |
dc.title | A Low Complexity Orthogonal 8×8 Transform Matrix for Fast Image Compression | en |
dc.type | Article | en |
Appears in Collections: | Conference Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Cdrom_430.pdf | 227.84 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.