Impact of Spatial Dynamic Search With Matching Threshold Strategy on Fractal Image Compression Algorithm Performance: Study

Abstract

Fractal image compression (FIC) is a very popular technique in image compression applications due to its simplicity and superior performance. However, it has a major drawback, which is the long encoding time. This is due to the requirement of performing huge similarity search for encoding each small portion in the image. Thus, reducing the search time of FIC while keeping the quality of reconstructed images at acceptable level is still an active research topic. Therefore, this paper has focused on studying the search problem of the conventional full-search FIC algorithm and the impact of employing a spatial dynamic search technique instead with the matching threshold strategy. Unlike the conventional full-search method that is a spatially static where the search starts from a fixed position (normally from the top-left corner of the image to the bottom-right corner) regardless of the position of the range block being encoding, the idea of the dynamic search method is simple, but effective, and it is based on starting the search from the closest domain block to the range block that needs to be encoded. These two search schemes are tested under different matching threshold values, in which the search is terminated whenever a domain block with an acceptable matching level is found. To make the study comprehensive, the test is performed for different image sizes and types, range block and partitioning step sizes, and quantization levels. The experimental results show the significant impact of using the dynamic search method instead of the conventional search method specifically when the threshold is large. For the best encoding parameters, the improvement amount that can be achieved is near to 90 % in terms of search reduction and 1.6 dB PSNR in terms of image quality. INDEX TERMS Fractal image compression, fast search method, full search scheme.

Fast Full-Search Algorithm of Fractal Image Compression for Acceleration Image Processing

“…The dynamic search starts with a domain block nearest to a range block so it has to be coded and expands until it finds a suitably matching domain block or until the completed search. The effect of using a spatial dynamic search approach instead of a matching threshold strategy on the search reduction of standard full-search of FIC algorithm studied in Saad, et al [52],When using the matching threshold strategy, the dynamic search approach begins with the closest domain and continues until after an acceptable matching block is found or the full image is covered. Closed sub-image blocks are selected over distant image blocks, according to the proposed approach.…”

Crowd Detection, Monitoring and Management : A literature Review

“…Real-time image processing models require a lot of computer power. Utilizing picture compression is one technique to cut down on the expensive computation [24]. For the detection-based methods, like Figure 1, researchers use a sliding window to detect the people in an image and then use this information to count the number of people 33, 34].…”

Deep Pipeline Architecture for Fast Fractal Color Image Compression Utilizing Inter-Color Correlation

“…To reduce the required number of matching operations, the searched blocks are restricted to that exist only on the area close to the corresponding range block. This generally will not cause a noticeable degradation in the quality of the decoded image as the correlation among the adjacent blocks is generally high, specifically for images captured from natural scenes [5,39,40]. Therefore, in this work, each range block in window is compared with every domain blocks s in the same window.…”