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

Title: A Low Complexity Orthogonal 8×8 Transform Matrix for Fast Image Compression
Authors: Senapati, R K
Pati, U C
Mahapatra, K K
Keywords: Signed discrete cosine transform (SDCT)
Image compression
Percentage error energy norm (PEEN)
Issue Date: Dec-2010
Citation: IEEE INDICON 2010,IEEE Calcutta Section at Kolkata, December 17-19, 2010.
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.
Description: Copyright belongs to Proceedings Publisher
URI: http://hdl.handle.net/2080/1334
Appears in Collections:Conference Papers

Files in This Item:

File Description SizeFormat
Cdrom_430.pdf227KbAdobe PDFView/Open

Show full item record

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

 

Powered by DSpace Feedback