IDEAS home Printed from https://ideas.repec.org/a/spr/aodasc/v11y2024i3d10.1007_s40745-023-00466-4.html
   My bibliography  Save this article

Spiral Fractal Compression in Transform Domains for Underwater Communication

Author

Listed:
  • A. Selim

    (ERTU)

  • Taha E. Taha

    (Menoufia University)

  • Adel S. El-Fishawy

    (Menoufia University)

  • O. Zahran

    (Menoufia University)

  • M. M. Hadhoud

    (Menoufia University)

  • M. I. Dessouky

    (Menoufia University)

  • Fathi E. Abd El-Samie

    (Menoufia University
    Princess Nourah Bint Abdulrahman University)

  • Noha El-Hag

    (The Higher Institute of Commercial Sciences)

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.

Suggested Citation

  • 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, 2024. "Spiral Fractal Compression in Transform Domains for Underwater Communication," Annals of Data Science, Springer, vol. 11(3), pages 1003-1030, June.
  • Handle: RePEc:spr:aodasc:v:11:y:2024:i:3:d:10.1007_s40745-023-00466-4
    DOI: 10.1007/s40745-023-00466-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s40745-023-00466-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s40745-023-00466-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:aodasc:v:11:y:2024:i:3:d:10.1007_s40745-023-00466-4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.