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

Full metadata record

DC FieldValueLanguage
contributor.authorSenapati, R K-
contributor.authorPati, U C-
contributor.authorMahapatra, K K-
identifier.citationInternational Conference on Information, Communications and Signal Processing (ICICS)-2011, Nanyang Technological University, Singapore, 13-16 December 2011en
descriptionCopyright belongs to Proceeding publisheren
description.abstractListless SPECK (LSPECK) is a low complexity image coding algorithm compared to SPECK. The problem of LSPECK is that, it encode each insignificant subband by a zero. Therefore, these block based coders codes as many zeros as the number of insignificant subbands. This gives rise to many zeros at the encoder output on early bit plane passes. By looking at the statistics of transformed images, the number of significant coefficients at some of the higher bitplanes are likely to be very few. We propose a variant of LSPECK algorithm, called as Improved LSPECK (ILSPECK), that code a single zero to several insignificant subbands. This reduces the length of the output bit string as well as encoding/decoding time. Further, ILSPECK algorithm is coupled with discrete tchebichef transform (DTT). The propose new coder called as Hierarchical Listless DTT (HLDTT), preserves most of the properties of wavelet coders. Extensive simulations on various kind of images shows the effictiveness of our coder.en
format.extent707693 bytes-
publisherICICS 2011en
subjectListless SPECKen
subjectImproved Listless SPECKen
subjectHi-erarchical Listless DTTen
subjectImage Compressionen
subjectEmbedded Coderen
titleA Low Complexity Embedded Image Coding Algorithm Using Hierarchical Listless DTTen
Appears in Collections:Conference Papers

Files in This Item:

File Description SizeFormat
WP2 5-P0327 (2).pdf232KbAdobe PDFView/Open

Show simple item record

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


Powered by DSpace Feedback