.png){kind=icon}
.png){kind=icon}
Return
Study on fast fractal image compression algorithm based on centroid radius
.png){kind=icon}
OA
AI
DOI：10.1080/21642583.2023.2269183.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
To achieve real-time transmission of image information under limited network bandwidth conditions, we propose a fast fractal image compression algorithm based on centroid radius. This algorithm addresses the shortcomings of conventional fractal encoding algorithms, such as high computational complexity and long encoding times. With our proposed algorithm, we calculate the centroid radius for both domain and range blocks, then sort the domain blocks based on the centroid radius. For a range block, we can find the best-matched domain blocks in the nearest neighbourhood. Additionally, we apply a bilinear interpolation algorithm to reconstruct the image's edges, reducing the block effect. In this paper, we use scalars to characterize image block features and optimize the codebook organization structure and matching method accordingly. This localization of the matching search range results in shorter coding times. Experimental results demonstrate that our encoder is 4.68 times faster than conventional fractal encoding with the proposed scheme, while still achieving good fidelity and compression ratios for the decoded image.
Keywords:
Centroid radius
image compression coding algorithm
bilinear interpolation algorithm
scalar
codebook organization structure
Journal
IF:
4.4
Papers:
486
Citations:
2.1K