Skip to Main Content
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.