Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSenapati, R K-
dc.contributor.authorPati, U C-
dc.contributor.authorMahapatra, K K-
dc.identifier.citationIEEE INDICON 2010,IEEE Calcutta Section at Kolkata, December 17-19, 2010.en
dc.descriptionCopyright belongs to Proceedings Publisheren
dc.description.abstractIn 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.extent233305 bytes-
dc.subjectSigned discrete cosine transform (SDCT)en
dc.subjectImage compressionen
dc.subjectPercentage error energy norm (PEEN)en
dc.titleA Low Complexity Orthogonal 8×8 Transform Matrix for Fast Image Compressionen
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
Cdrom_430.pdf227.84 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.