A modified-set partitioning in hierarchical trees algorithm for real-time image compression

M. Akter, Md. Mamun Ibne Reaz, F. Mohd-Yasin, F. Choong

Research output: Contribution to journalArticle

34 Citations (Scopus)

Abstract

Among 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.

Original languageEnglish
Pages (from-to)642-650
Number of pages9
JournalJournal of Communications Technology and Electronics
Volume53
Issue number6
DOIs
Publication statusPublished - Jun 2008
Externally publishedYes

Fingerprint

Image compression
Data storage equipment
lists
coding
Sorting
Wavelet transforms
Computer hardware
Signal to noise ratio
classifying
wavelet analysis
Communication
hardware
signal to noise ratios
communication
requirements
coefficients

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

A modified-set partitioning in hierarchical trees algorithm for real-time image compression. / Akter, M.; Ibne Reaz, Md. Mamun; Mohd-Yasin, F.; Choong, F.

In: Journal of Communications Technology and Electronics, Vol. 53, No. 6, 06.2008, p. 642-650.

Research output: Contribution to journalArticle

@article{bf8a719a92ee490788ba96790a755332,
title = "A modified-set partitioning in hierarchical trees algorithm for real-time image compression",
abstract = "Among 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.",
author = "M. Akter and {Ibne Reaz}, {Md. Mamun} and F. Mohd-Yasin and F. Choong",
year = "2008",
month = "6",
doi = "10.1134/S1064226908060065",
language = "English",
volume = "53",
pages = "642--650",
journal = "Journal of Communications Technology and Electronics",
issn = "1064-2269",
publisher = "Maik Nauka-Interperiodica Publishing",
number = "6",

}

TY - JOUR

T1 - A modified-set partitioning in hierarchical trees algorithm for real-time image compression

AU - Akter, M.

AU - Ibne Reaz, Md. Mamun

AU - Mohd-Yasin, F.

AU - Choong, F.

PY - 2008/6

Y1 - 2008/6

N2 - Among 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.

AB - Among 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.

UR - http://www.scopus.com/inward/record.url?scp=46749148389&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=46749148389&partnerID=8YFLogxK

U2 - 10.1134/S1064226908060065

DO - 10.1134/S1064226908060065

M3 - Article

VL - 53

SP - 642

EP - 650

JO - Journal of Communications Technology and Electronics

JF - Journal of Communications Technology and Electronics

SN - 1064-2269

IS - 6

ER -