Digital Image Processing

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

SPIHT Image Compression Algorithm is Modified for Application to Large Images with Limited Processor Memory


Affiliations
1 Department of Electronics and Communication Engineering, Bannari Amman Institute of Technology, Satthyamangalam-638401, India
2 Department of Computer Science Engineering, Bannari Amman Institute of Technology, Satthyamangalam-638401, India
     

   Subscribe/Renew Journal


The SPIHT image compression algorithm is modified for application to large images with limited processor memory. The sub band decomposition coefficients are partitioned into small tree-preserving spatial blocks which are each independently coded using the SPIHT algorithm. The bit streams for each spatial block are assembled into a single final bit stream through one of two packetization schemes. The final bit stream can be embedded in fidelity with a small expense in rate. SPIHT encoding and decoding of the spatial blocks can be done in parallel for real-time video compression.

Keywords

Decomposition, SPIHT Algorithm, Packetization, Sub-Bitstream.
User
Subscription Login to verify subscription
Notifications
Font Size

Abstract Views: 146

PDF Views: 2




  • SPIHT Image Compression Algorithm is Modified for Application to Large Images with Limited Processor Memory

Abstract Views: 146  |  PDF Views: 2

Authors

S. M. Ramesh
Department of Electronics and Communication Engineering, Bannari Amman Institute of Technology, Satthyamangalam-638401, India
A. Shanmugam
Department of Electronics and Communication Engineering, Bannari Amman Institute of Technology, Satthyamangalam-638401, India
B. Gomathy
Department of Computer Science Engineering, Bannari Amman Institute of Technology, Satthyamangalam-638401, India

Abstract


The SPIHT image compression algorithm is modified for application to large images with limited processor memory. The sub band decomposition coefficients are partitioned into small tree-preserving spatial blocks which are each independently coded using the SPIHT algorithm. The bit streams for each spatial block are assembled into a single final bit stream through one of two packetization schemes. The final bit stream can be embedded in fidelity with a small expense in rate. SPIHT encoding and decoding of the spatial blocks can be done in parallel for real-time video compression.

Keywords


Decomposition, SPIHT Algorithm, Packetization, Sub-Bitstream.