The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
A Metaheuristic Approach for Tetrolet-Based Medical Image Compression
|
|
Author(s): Saravanan S. (Department of Computer Science and Engineering, Karunya Institute of Technology and Sciences, Coimbatore, India)and Sujitha Juliet (Department of Computer Science and Engineering, Karunya Institute of Technology and Sciences, Coimbatore, India)
Copyright: 2022
Volume: 24
Issue: 2
Pages: 14
Source title:
Journal of Cases on Information Technology (JCIT)
Editor(s)-in-Chief: Ali Selamat (Universiti Teknologi Malaysia, Malaysia)
DOI: 10.4018/JCIT.20220401.oa3
Purchase
|
Abstract
Over recent times, medical imaging plays a significant role in clinical practices. Storing and transferring the huge volume of images becomes complicated without an efficient image compression technique. This paper proposes a compression algorithm that uses a Haar based wavelet transform called Tetrolet transform, which reduces the noise on the input images and decomposes with a 4 x 4 blocks of equal squares called tetrominoes. It opts for a decomposing using optimal scheme for achieving the input image into a sparse representation which gives a much-detailed performance for texture and edge information better than wavelet transform. Set Partitioning in Hierarchical Trees (SPIHT) is used for encoding the significant coefficients to achieve efficient image compression. It has been investigated with various metaheuristic algorithms. Experimental results prove that the proposed method outperforms the other transform-based compression in terms of PSNR, CR, and Complexity. Also, the proposed method shows an improved result with another state of work.
Related Content
|
Ricardo Gregorio Lugo, Ausrius Juozapavicius, Kristina Lapin, Torvald F. Ask, Benjamin J. Knox, Stefan Sütterlin.
© 2025.
13 pages.
|
|
Jack Ng Kok Wah.
© 2025.
20 pages.
|
|
Chunyi Lou, Liang Lu, Jianfang Mao, Yan Ding.
© 2025.
16 pages.
|
|
Zhongqiao Sun, Maochun Wu.
© 2025.
16 pages.
|
|
Shuanglan Zhao.
© 2025.
23 pages.
|
|
Meng Liu.
© 2025.
17 pages.
|
|
Eiman Tamah Al-Shammari.
© 2025.
27 pages.
|
|
|