New virtual SPIHT tree structures for very low memory strip-based image compression

Li Wern Chew; Li Minn Ang; Kah Phooi Seng

doi:10.1109/LSP.2008.920515

New virtual SPIHT tree structures for very low memory strip-based image compression

Li Wern Chew, Li Minn Ang, Kah Phooi Seng

University of Nottingham

Research output: Contribution to journal › Article › peer-review

24 Citations (Scopus)

Abstract

Images obtained with wavelet-based compression techniques such as set-partitioning in hierarchical trees (SPIHT) yield very good results. However, a lot of memory space is required as the wavelet coefficients for the whole image need to be stored for the process of set-partitioning coding. In this letter, we propose new virtual SPIHT tree structures for very low memory strip-based image compression. The advantage of the proposed work is that it reduces the memory requirements for practical software and hardware implementations significantly without sacrificing performance.

Original language	English
Pages (from-to)	389-392
Number of pages	4
Journal	IEEE Signal Processing Letters
Volume	15
DOIs	https://doi.org/10.1109/LSP.2008.920515
Publication status	Published - 01 Dec 2008

Access to Document

10.1109/LSP.2008.920515

Cite this

@article{63c67078f0e54883a34a96e7452629ab,

title = "New virtual SPIHT tree structures for very low memory strip-based image compression",

abstract = "Images obtained with wavelet-based compression techniques such as set-partitioning in hierarchical trees (SPIHT) yield very good results. However, a lot of memory space is required as the wavelet coefficients for the whole image need to be stored for the process of set-partitioning coding. In this letter, we propose new virtual SPIHT tree structures for very low memory strip-based image compression. The advantage of the proposed work is that it reduces the memory requirements for practical software and hardware implementations significantly without sacrificing performance.",

keywords = "Low memory set-partitioning in hierarchical trees (SPIHT), Spatial orientation tree, Strip-based coding, Wavelet-based image compression",

author = "Chew, {Li Wern} and Ang, {Li Minn} and Seng, {Kah Phooi}",

year = "2008",

month = dec,

day = "1",

doi = "10.1109/LSP.2008.920515",

language = "English",

volume = "15",

pages = "389--392",

journal = "IEEE Signal Processing Letters",

issn = "1070-9908",

publisher = "International Journal of Applied Mathematics, Electronics and Computers",

}

TY - JOUR

T1 - New virtual SPIHT tree structures for very low memory strip-based image compression

AU - Chew, Li Wern

AU - Ang, Li Minn

AU - Seng, Kah Phooi

PY - 2008/12/1

Y1 - 2008/12/1

N2 - Images obtained with wavelet-based compression techniques such as set-partitioning in hierarchical trees (SPIHT) yield very good results. However, a lot of memory space is required as the wavelet coefficients for the whole image need to be stored for the process of set-partitioning coding. In this letter, we propose new virtual SPIHT tree structures for very low memory strip-based image compression. The advantage of the proposed work is that it reduces the memory requirements for practical software and hardware implementations significantly without sacrificing performance.

AB - Images obtained with wavelet-based compression techniques such as set-partitioning in hierarchical trees (SPIHT) yield very good results. However, a lot of memory space is required as the wavelet coefficients for the whole image need to be stored for the process of set-partitioning coding. In this letter, we propose new virtual SPIHT tree structures for very low memory strip-based image compression. The advantage of the proposed work is that it reduces the memory requirements for practical software and hardware implementations significantly without sacrificing performance.

KW - Low memory set-partitioning in hierarchical trees (SPIHT)

KW - Spatial orientation tree

KW - Strip-based coding

KW - Wavelet-based image compression

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

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

U2 - 10.1109/LSP.2008.920515

DO - 10.1109/LSP.2008.920515

M3 - Article

AN - SCOPUS:66749168510

SN - 1070-9908

VL - 15

SP - 389

EP - 392

JO - IEEE Signal Processing Letters

JF - IEEE Signal Processing Letters

ER -

New virtual SPIHT tree structures for very low memory strip-based image compression

Abstract

Access to Document

Other files and links

Fingerprint

Cite this