Abstract

Image compression plays a pivotal role in the medical field for the storage and transfer of DICOM images. This research work focuses on the compression of medical images using Set Partitioning in Hierarchy Trees (SPIHT) algorithm. The CT/MR images are used as input, the images are subjected to filtering by a median filter. The CT images in general are corrupted by Gaussian noise and MR images are corrupted by rician noise. The SPIHT algorithm comprises of following phases; transformation into wavelet domain, refinement pass and sorting pass. The Haar wavelet transform is employed and the wavelet coefficients are subjected to sorting and refinement pass. The Haar wavelet transform generates LL, HL, HL and HH sub-bands. In the sorting pass, the coefficients are classified into significant and insignificant. The refinement pass creates the precision bits for the significant coefficients. The main characteristic of the SPIHT algorithm is that it does not use an entropy coder. The reconstructed image in the decoding stage was validated by performance metrics. The SPIHT algorithm generates proficient results, when compared with the classical algorithms like wavelet and embedded zero tree wavelet (EZW) algorithms.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call