Algorithmic modifications to SPIHT

This paper proposes several low complexity algorithmic modifications to the SPIHT (Set Partitioning in Hierarchical Trees) image coding method of [3]. The modifications exploit universal traits common to the real world images. Approximately 1-2 % compression gain (bit rate reduction for a given mean squared error) has been obtained for the images in our test suite by incorporating all of the proposed modifications into SPIHT.

• Type: Conference
• Year: 2001
• Where: ICIP
• Authors: Ulug Bayazit, William A. Pearlman
• Keywords: Bit Rate Reduction, Complexity Algorithmic Modifications, ICIP 2001, Image Processing, Mean Squared Error