Spiral Fractal Compression in Transform Domains for Underwater Communication

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 unde...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Annals of data science 2024-06, Vol.11 (3), p.1003-1030
Hauptverfasser: Selim, A., Taha, Taha E., El-Fishawy, Adel S., Zahran, O., Hadhoud, M. M., Dessouky, M. I., El-Samie, Fathi E. Abd, El-Hag, Noha
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 1030
container_issue 3
container_start_page 1003
container_title Annals of data science
container_volume 11
creator Selim, A.
Taha, Taha E.
El-Fishawy, Adel S.
Zahran, O.
Hadhoud, M. M.
Dessouky, M. I.
El-Samie, Fathi E. Abd
El-Hag, Noha
description 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
doi_str_mv 10.1007/s40745-023-00466-4
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_3056958161</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3056958161</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1854-dde27398006bd55606af3b447e4f0061c9a9d1eefd6ed8bb9dd5f00996d2b8823</originalsourceid><addsrcrecordid>eNp9kE1OwzAQhS0EElXpBVhFYh0YO7ZjL1GhgFTBgnZtObGDUjV2sFMhbtOz9GS4BMGO1fy9b0bzELrEcI0ByptIoaQsB1LkAJTznJ6gCcFS5ExgcvqbAz1Hsxg3AEAwTXI2Qc-vfRv0NlsEXQ8pzn3XBxtj691h37psFbSLjQ9dduc73bp42KcqWztjw4cebDgS3c61tR4Sc4HOGr2NdvYTp2i9uF_NH_Ply8PT_HaZ11gwmhtjSVlIAcArwxgHrpuiorS0tEk9XEstDba2MdwaUVXSGJYGUnJDKiFIMUVX494--PedjYPa-F1w6aQqgHGZHuc4qcioqoOPMdhG9aHtdPhUGNTROjVap5IX6ts6RRNUjFBMYvdmw9_qf6gvVvBzFQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3056958161</pqid></control><display><type>article</type><title>Spiral Fractal Compression in Transform Domains for Underwater Communication</title><source>Springer Online Journals Complete</source><creator>Selim, A. ; Taha, Taha E. ; El-Fishawy, Adel S. ; Zahran, O. ; Hadhoud, M. M. ; Dessouky, M. I. ; El-Samie, Fathi E. Abd ; El-Hag, Noha</creator><creatorcontrib>Selim, A. ; Taha, Taha E. ; El-Fishawy, Adel S. ; Zahran, O. ; Hadhoud, M. M. ; Dessouky, M. I. ; El-Samie, Fathi E. Abd ; El-Hag, Noha</creatorcontrib><description>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.</description><identifier>ISSN: 2198-5804</identifier><identifier>EISSN: 2198-5812</identifier><identifier>DOI: 10.1007/s40745-023-00466-4</identifier><language>eng</language><publisher>Berlin/Heidelberg: Springer Berlin Heidelberg</publisher><subject>Algorithms ; Artificial Intelligence ; Business and Management ; Communication ; Compression ratio ; Decomposition ; Discrete cosine transform ; Discrete Wavelet Transform ; Economics ; Finance ; Fractal transforms ; Fractals ; Image compression ; Image quality ; Image segmentation ; Insurance ; Management ; Search process ; Signal to noise ratio ; Statistics for Business ; Underwater communication ; Video compression ; Wavelet transforms</subject><ispartof>Annals of data science, 2024-06, Vol.11 (3), p.1003-1030</ispartof><rights>The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c1854-dde27398006bd55606af3b447e4f0061c9a9d1eefd6ed8bb9dd5f00996d2b8823</cites><orcidid>0000-0001-8749-9518</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s40745-023-00466-4$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s40745-023-00466-4$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>315,781,785,27929,27930,41493,42562,51324</link.rule.ids></links><search><creatorcontrib>Selim, A.</creatorcontrib><creatorcontrib>Taha, Taha E.</creatorcontrib><creatorcontrib>El-Fishawy, Adel S.</creatorcontrib><creatorcontrib>Zahran, O.</creatorcontrib><creatorcontrib>Hadhoud, M. M.</creatorcontrib><creatorcontrib>Dessouky, M. I.</creatorcontrib><creatorcontrib>El-Samie, Fathi E. Abd</creatorcontrib><creatorcontrib>El-Hag, Noha</creatorcontrib><title>Spiral Fractal Compression in Transform Domains for Underwater Communication</title><title>Annals of data science</title><addtitle>Ann. Data. Sci</addtitle><description>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.</description><subject>Algorithms</subject><subject>Artificial Intelligence</subject><subject>Business and Management</subject><subject>Communication</subject><subject>Compression ratio</subject><subject>Decomposition</subject><subject>Discrete cosine transform</subject><subject>Discrete Wavelet Transform</subject><subject>Economics</subject><subject>Finance</subject><subject>Fractal transforms</subject><subject>Fractals</subject><subject>Image compression</subject><subject>Image quality</subject><subject>Image segmentation</subject><subject>Insurance</subject><subject>Management</subject><subject>Search process</subject><subject>Signal to noise ratio</subject><subject>Statistics for Business</subject><subject>Underwater communication</subject><subject>Video compression</subject><subject>Wavelet transforms</subject><issn>2198-5804</issn><issn>2198-5812</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><recordid>eNp9kE1OwzAQhS0EElXpBVhFYh0YO7ZjL1GhgFTBgnZtObGDUjV2sFMhbtOz9GS4BMGO1fy9b0bzELrEcI0ByptIoaQsB1LkAJTznJ6gCcFS5ExgcvqbAz1Hsxg3AEAwTXI2Qc-vfRv0NlsEXQ8pzn3XBxtj691h37psFbSLjQ9dduc73bp42KcqWztjw4cebDgS3c61tR4Sc4HOGr2NdvYTp2i9uF_NH_Ply8PT_HaZ11gwmhtjSVlIAcArwxgHrpuiorS0tEk9XEstDba2MdwaUVXSGJYGUnJDKiFIMUVX494--PedjYPa-F1w6aQqgHGZHuc4qcioqoOPMdhG9aHtdPhUGNTROjVap5IX6ts6RRNUjFBMYvdmw9_qf6gvVvBzFQ</recordid><startdate>20240601</startdate><enddate>20240601</enddate><creator>Selim, A.</creator><creator>Taha, Taha E.</creator><creator>El-Fishawy, Adel S.</creator><creator>Zahran, O.</creator><creator>Hadhoud, M. M.</creator><creator>Dessouky, M. I.</creator><creator>El-Samie, Fathi E. Abd</creator><creator>El-Hag, Noha</creator><general>Springer Berlin Heidelberg</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0001-8749-9518</orcidid></search><sort><creationdate>20240601</creationdate><title>Spiral Fractal Compression in Transform Domains for Underwater Communication</title><author>Selim, A. ; Taha, Taha E. ; El-Fishawy, Adel S. ; Zahran, O. ; Hadhoud, M. M. ; Dessouky, M. I. ; El-Samie, Fathi E. Abd ; El-Hag, Noha</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1854-dde27398006bd55606af3b447e4f0061c9a9d1eefd6ed8bb9dd5f00996d2b8823</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Algorithms</topic><topic>Artificial Intelligence</topic><topic>Business and Management</topic><topic>Communication</topic><topic>Compression ratio</topic><topic>Decomposition</topic><topic>Discrete cosine transform</topic><topic>Discrete Wavelet Transform</topic><topic>Economics</topic><topic>Finance</topic><topic>Fractal transforms</topic><topic>Fractals</topic><topic>Image compression</topic><topic>Image quality</topic><topic>Image segmentation</topic><topic>Insurance</topic><topic>Management</topic><topic>Search process</topic><topic>Signal to noise ratio</topic><topic>Statistics for Business</topic><topic>Underwater communication</topic><topic>Video compression</topic><topic>Wavelet transforms</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Selim, A.</creatorcontrib><creatorcontrib>Taha, Taha E.</creatorcontrib><creatorcontrib>El-Fishawy, Adel S.</creatorcontrib><creatorcontrib>Zahran, O.</creatorcontrib><creatorcontrib>Hadhoud, M. M.</creatorcontrib><creatorcontrib>Dessouky, M. I.</creatorcontrib><creatorcontrib>El-Samie, Fathi E. Abd</creatorcontrib><creatorcontrib>El-Hag, Noha</creatorcontrib><collection>CrossRef</collection><jtitle>Annals of data science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Selim, A.</au><au>Taha, Taha E.</au><au>El-Fishawy, Adel S.</au><au>Zahran, O.</au><au>Hadhoud, M. M.</au><au>Dessouky, M. I.</au><au>El-Samie, Fathi E. Abd</au><au>El-Hag, Noha</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Spiral Fractal Compression in Transform Domains for Underwater Communication</atitle><jtitle>Annals of data science</jtitle><stitle>Ann. Data. Sci</stitle><date>2024-06-01</date><risdate>2024</risdate><volume>11</volume><issue>3</issue><spage>1003</spage><epage>1030</epage><pages>1003-1030</pages><issn>2198-5804</issn><eissn>2198-5812</eissn><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><cop>Berlin/Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/s40745-023-00466-4</doi><tpages>28</tpages><orcidid>https://orcid.org/0000-0001-8749-9518</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 2198-5804
ispartof Annals of data science, 2024-06, Vol.11 (3), p.1003-1030
issn 2198-5804
2198-5812
language eng
recordid cdi_proquest_journals_3056958161
source Springer Online Journals Complete
subjects Algorithms
Artificial Intelligence
Business and Management
Communication
Compression ratio
Decomposition
Discrete cosine transform
Discrete Wavelet Transform
Economics
Finance
Fractal transforms
Fractals
Image compression
Image quality
Image segmentation
Insurance
Management
Search process
Signal to noise ratio
Statistics for Business
Underwater communication
Video compression
Wavelet transforms
title Spiral Fractal Compression in Transform Domains for Underwater Communication
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-15T07%3A53%3A02IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Spiral%20Fractal%20Compression%C2%A0in%20Transform%20Domains%C2%A0for%20Underwater%20Communication&rft.jtitle=Annals%20of%20data%20science&rft.au=Selim,%20A.&rft.date=2024-06-01&rft.volume=11&rft.issue=3&rft.spage=1003&rft.epage=1030&rft.pages=1003-1030&rft.issn=2198-5804&rft.eissn=2198-5812&rft_id=info:doi/10.1007/s40745-023-00466-4&rft_dat=%3Cproquest_cross%3E3056958161%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=3056958161&rft_id=info:pmid/&rfr_iscdi=true