Show simple item record

dc.contributor.authorAkter, M
dc.contributor.authorReaz, MBI
dc.contributor.authorMohd-Yasin, F
dc.contributor.authorChoong, F
dc.date.accessioned2017-05-03T11:49:24Z
dc.date.available2017-05-03T11:49:24Z
dc.date.issued2008
dc.date.modified2011-08-12T06:21:28Z
dc.identifier.issn1064-2269
dc.identifier.doi10.1134/S1064226908060065
dc.identifier.urihttp://hdl.handle.net/10072/39963
dc.description.abstractAmong all algorithms based on wavelet transform and zerotree quantization, Said and Pearlman's set partitioning in hierarchical trees (SPIHT) algorithm is well known for its simplicity and efficiency. SPIHT's high memory requirement is a major drawback to hardware implementation. In this study, we present a modification of SPIHT named modified SPIHT (MSPIHT), which requires less execution time at a low bit rate and less working memory than SPIHT. The MSPIHT coding algorithm is modified with the use of one list to store the coordinates of wavelet coefficients instead of three lists of SPIHT; defines two terms, number of error bits and absolute zerotree; and merges the sorting pass and the refinement pass together as one scan pass. Comparison of MSPIHT with SPIHT on different test image shows that MSPIHT reduces execution time at most 7 times for coding a 512 נ512 grayscale image; reduces execution time at most 11 times at a low bit rate; saves at least 0.5625 MB of memory; and reduces minor peak signal-to noise ratio (PSNR) values, thereby making it highly promising for real-time and memory limited mobile communications.
dc.description.peerreviewedYes
dc.description.publicationstatusYes
dc.languageEnglish
dc.language.isoeng
dc.publisherM A I K Nauka - Interperiodica
dc.publisher.placeRussian Federation
dc.relation.ispartofstudentpublicationN
dc.relation.ispartofpagefrom676
dc.relation.ispartofpageto685
dc.relation.ispartofissue6
dc.relation.ispartofjournalJournal of Communications Technology and Electronics
dc.relation.ispartofvolume53
dc.rights.retentionY
dc.subject.fieldofresearchCommunications engineering
dc.subject.fieldofresearchcode4006
dc.titleA modified-set partitioning in hierarchical trees algorithm for real-time image compression
dc.typeJournal article
dc.type.descriptionC1 - Articles
dc.type.codeC - Journal Articles
gro.rights.copyrightSelf-archiving of the author-manuscript version is not yet supported by this journal. Please refer to the journal link for access to the definitive, published version or contact the author[s] for more information.
gro.date.issued2008
gro.hasfulltextNo Full Text
gro.griffith.authorMohd-Yasin, Faisal


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record