Compression of Medical images using SPIHT Algorithm for Telemedicine Application

Jins Sebastian, Deny J, S. N. Kumar
{"title":"Compression of Medical images using SPIHT Algorithm for Telemedicine Application","authors":"Jins Sebastian, Deny J, S. N. Kumar","doi":"10.37391/ijeer.120108","DOIUrl":null,"url":null,"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.","PeriodicalId":158560,"journal":{"name":"International Journal of Electrical and Electronics Research","volume":"57 11","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Electrical and Electronics Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.37391/ijeer.120108","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

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.
使用 SPIHT 算法压缩医学图像,用于远程医疗应用
图像压缩在医学领域的 DICOM 图像存储和传输中发挥着举足轻重的作用。这项研究工作的重点是利用层次结构树中的集合分割(SPIHT)算法压缩医学图像。将 CT/MR 图像作为输入,用中值滤波器对图像进行过滤。CT 图像一般受到高斯噪声的干扰,而 MR 图像则受到里氏噪声的干扰。SPIHT 算法包括以下几个阶段:小波域变换、细化和排序。算法采用哈小波变换,小波系数经过排序和细化处理。哈小波变换产生 LL、HL、HL 和 HH 子带。在分类过程中,系数被分为重要和不重要两类。细化阶段为重要系数创建精确位。SPIHT 算法的主要特点是不使用熵编码器。解码阶段的重建图像通过性能指标进行了验证。与小波算法和嵌入式零树小波(EZW)算法等经典算法相比,SPIHT 算法能产生出色的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
1.70
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书