Design and Implementation of a Novel Parallel Algorithm for Efficient Image Compression in High-Performance Computing

The focus of this paper is to describe the development and the architecture of a new parallel algorithm targeted for image compression within High Performance Computing context. The suggested algorithm apply parallel processing strategies for the image data set in order to minimize the amount of computation while at the same time optimize the compression ratio and speed. When combining new parallelism strategies with newly developed and existing methods of data compression, the result is visibly better in both, compression ratio and time, as opposed to comparable existing algorithms. Experimental results performed on different HPC environment prove that the solution put forward is quite scalable and efficient; therefore, it should be considered in applications where real time image processing is crucial. It provides a major contribution to the literature in image compression with a special focus on parallel computations.

Authors

Institutions

Publication Details

Journal
EAI Endorsed Transactions on AI and Robotics
Published
2025-06-30
DOI
https://doi.org/10.4108/airo.7832
Citations
2
Primary Topic
Brain Tumor Detection and Classification
Type
article
Field-Weighted Citation Impact
1.68
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Design and Implementation of a Novel Parallel Algorithm for Efficient Image Compression in High-Performance Computing

Hewa Majeed Zangana
2 citations
EAI Endorsed Transactions on AI and Robotics
Brain Tumor Detection and Classification
1.68
article

Design and Implementation of a Novel Parallel Algorithm for Efficient Image Compression in High-Performance Computing

Hewa Majeed Zangana
article en
2 citations

Abstract

The focus of this paper is to describe the development and the architecture of a new parallel algorithm targeted for image compression within High Performance Computing context. The suggested algorithm apply parallel processing strategies for the image data set in order to minimize the amount of computation while at the same time optimize the compression ratio and speed. When combining new parallelism strategies with newly developed and existing methods of data compression, the result is visibly better in both, compression ratio and time, as opposed to comparable existing algorithms. Experimental results performed on different HPC environment prove that the solution put forward is quite scalable and efficient; therefore, it should be considered in applications where real time image processing is crucial. It provides a major contribution to the literature in image compression with a special focus on parallel computations.

EAI Endorsed Transactions on AI and RoboticsVol. 4
Duhok Polytechnic University (IQ)
Openalex Percentile: Top 15%
Brain Tumor Detection and Classification
1.68
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.