Spiral Fractal Compression in Transform Domains for Underwater Communication

Q1 Decision Sciences
A. Selim, Taha E. Taha, Adel S. El-Fishawy, O. Zahran, M. M. Hadhoud, M. I. Dessouky, Fathi E. Abd El-Samie, Noha El-Hag
{"title":"Spiral Fractal Compression in Transform Domains for Underwater Communication","authors":"A. Selim,&nbsp;Taha E. Taha,&nbsp;Adel S. El-Fishawy,&nbsp;O. Zahran,&nbsp;M. M. Hadhoud,&nbsp;M. I. Dessouky,&nbsp;Fathi E. Abd El-Samie,&nbsp;Noha El-Hag","doi":"10.1007/s40745-023-00466-4","DOIUrl":null,"url":null,"abstract":"<div><p>This paper presents a simplified fractal image compression algorithm, which is implemented on a block-by-block basis. This algorithm achieves a Compression Ratio (CR) of up to 10 with a Peak Signal-to-Noise Ratio (PSNR) as high as 35 dB. Hence, it is very appropriate for the new applications of underwater communication. The idea of the proposed algorithm is based on the segmentation of the image, first, into blocks to setup reference blocks. The image is then decomposed again into block ranges, and a search process is carried out to find the reference blocks with the best match. The transmitted or stored values, after compression, are the reference block values and the indices of the reference block that achieves the best match. If there is no match, the average value of the block range is transmitted or stored instead. The effect of the spiral architecture instead of square block decomposition is studied. A comparison between different algorithms, including the conventional square search, the proposed simplified fractal compression algorithm and the standard JPEG compression algorithm, is introduced. We applied the types of fractal compression on a video sequence. In addition, the effect of using the fractal image compression algorithms in transform domain is investigated. The image is transferred firstly to a transform domain. The Discrete Cosine Transform (DCT) and Discrete Wavelet Transform (DWT) are used. After transformation takes place, the fractal algorithm is applied. A comparison between three fractal algorithms, namely conventional square, spiral, and simplified fractal compression, is presented. The comparison is repeated in the two cases of transformation. The DWT is used also in this paper to increase the CR of the block domain pool. We decompose the block domain by wavelet decomposition to two levels. This process gives a CR for block domain transmission as high as 16. The advantage of the proposed implementation is the simplicity of computation. We found that with the spiral architecture in fractal compression, the video sequence visual quality is better than those produced with conventional square fractal compression and the proposed simplified algorithm at the same CR, but with longer time consumed. We found also that all types of fractal compression give better quality than that of the standard JPEG. In addition, the decoded images, in case of using the wavelet transform, are the best. On the other hand, in case of using DCT, the decoded images have poor quality.</p></div>","PeriodicalId":36280,"journal":{"name":"Annals of Data Science","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Data Science","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.1007/s40745-023-00466-4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Decision Sciences","Score":null,"Total":0}
引用次数: 0

Abstract

This paper presents a simplified fractal image compression algorithm, which is implemented on a block-by-block basis. This algorithm achieves a Compression Ratio (CR) of up to 10 with a Peak Signal-to-Noise Ratio (PSNR) as high as 35 dB. Hence, it is very appropriate for the new applications of underwater communication. The idea of the proposed algorithm is based on the segmentation of the image, first, into blocks to setup reference blocks. The image is then decomposed again into block ranges, and a search process is carried out to find the reference blocks with the best match. The transmitted or stored values, after compression, are the reference block values and the indices of the reference block that achieves the best match. If there is no match, the average value of the block range is transmitted or stored instead. The effect of the spiral architecture instead of square block decomposition is studied. A comparison between different algorithms, including the conventional square search, the proposed simplified fractal compression algorithm and the standard JPEG compression algorithm, is introduced. We applied the types of fractal compression on a video sequence. In addition, the effect of using the fractal image compression algorithms in transform domain is investigated. The image is transferred firstly to a transform domain. The Discrete Cosine Transform (DCT) and Discrete Wavelet Transform (DWT) are used. After transformation takes place, the fractal algorithm is applied. A comparison between three fractal algorithms, namely conventional square, spiral, and simplified fractal compression, is presented. The comparison is repeated in the two cases of transformation. The DWT is used also in this paper to increase the CR of the block domain pool. We decompose the block domain by wavelet decomposition to two levels. This process gives a CR for block domain transmission as high as 16. The advantage of the proposed implementation is the simplicity of computation. We found that with the spiral architecture in fractal compression, the video sequence visual quality is better than those produced with conventional square fractal compression and the proposed simplified algorithm at the same CR, but with longer time consumed. We found also that all types of fractal compression give better quality than that of the standard JPEG. In addition, the decoded images, in case of using the wavelet transform, are the best. On the other hand, in case of using DCT, the decoded images have poor quality.

Abstract Image

用于水下通信的变换域螺旋分形压缩技术
本文介绍了一种简化的分形图像压缩算法,该算法是逐块实现的。该算法的压缩比(CR)高达 10,峰值信噪比(PSNR)高达 35 dB。因此,它非常适合水下通信的新应用。所提算法的思想基于对图像的分割,首先将图像分割成块,以设置参考块。然后,再次将图像分解为不同的区块范围,并进行搜索,以找到匹配度最高的参考区块。压缩后传输或存储的值是参考块值和达到最佳匹配的参考块的索引。如果无法匹配,则会传输或存储数据块范围的平均值。研究了螺旋结构代替方形块分解的效果。介绍了不同算法之间的比较,包括传统的正方形搜索、建议的简化分形压缩算法和标准 JPEG 压缩算法。我们在视频序列中应用了这些分形压缩算法。此外,还研究了在变换域中使用分形图像压缩算法的效果。首先将图像转移到变换域。使用的是离散余弦变换(DCT)和离散小波变换(DWT)。变换完成后,应用分形算法。比较了三种分形算法,即传统的正方形、螺旋形和简化的分形压缩。比较在两种变换情况下重复进行。本文还使用了 DWT 来增加块域池的 CR。我们通过小波分解将块域分解为两级。这一过程使块域传输的 CR 高达 16。建议实施方案的优势在于计算简单。我们发现,在分形压缩中采用螺旋结构时,视频序列的视觉质量优于采用传统方形分形压缩和所建议的简化算法在相同 CR 下产生的视频序列,但耗时更长。我们还发现,所有类型的分形压缩都比标准 JPEG 的质量更好。此外,使用小波变换的解码图像效果最好。另一方面,在使用 DCT 的情况下,解码图像的质量较差。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Annals of Data Science
Annals of Data Science Decision Sciences-Statistics, Probability and Uncertainty
CiteScore
6.50
自引率
0.00%
发文量
93
期刊介绍: Annals of Data Science (ADS) publishes cutting-edge research findings, experimental results and case studies of data science. Although Data Science is regarded as an interdisciplinary field of using mathematics, statistics, databases, data mining, high-performance computing, knowledge management and virtualization to discover knowledge from Big Data, it should have its own scientific contents, such as axioms, laws and rules, which are fundamentally important for experts in different fields to explore their own interests from Big Data. ADS encourages contributors to address such challenging problems at this exchange platform. At present, how to discover knowledge from heterogeneous data under Big Data environment needs to be addressed.     ADS is a series of volumes edited by either the editorial office or guest editors. Guest editors will be responsible for call-for-papers and the review process for high-quality contributions in their volumes.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信