Cart (Loading....) | Create Account
Close category search window
 

New Virtual SPIHT Tree Structures for Very Low Memory Strip-Based Image Compression

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Li Wern Chew ; Sch. of Electr. & Electron. Eng., Nottingham Jalan Broga Univ., Semenyih ; Ang, Li-Minn ; Kah Phooi Seng

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.

Published in:

Signal Processing Letters, IEEE  (Volume:15 )

Date of Publication:

2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.