By Topic

A 3D SPIHT low-memory encoding approach for video 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
$33 $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

2 Author(s)
Shang-Hsiu Tseng ; Electr. Eng. Program, Penn State Univ. at Harrisburg, Middletown, PA ; Morales, A.

In this paper, a three-dimensional (3D) SPIHT algorithm is proposed with low-memory usage. The standard SPIHT coding uses three separate lists to store and organize tree data structures and their significance, which can grow large at high rate and consume large amounts of memory. In the proposed algorithm, unnecessary lists are discarded and the process length of the sorting phase is shortened to reduce coding time and memory usage. Results show that the proposed method reduces memory usage, run time and improves PSNR.

Published in:

Consumer Electronics, 2009. ICCE '09. Digest of Technical Papers International Conference on

Date of Conference:

10-14 Jan. 2009