ADVANCED ALGORITHM FOR EXPEDITING IMAGE PROCESSING

Abstract

Processing images more effectively is possible when a novel technique based on fractal image compression is applied. Range blocks and domain blocks are the overlapping and non-overlapping portions of an image that are separated to achieve a fast encoding time Typically, domain blocks are bigger than range blocks. This study proposed a novel rapid full-search algorithm technique to drastically cut down on encoding time, one that expands the search until a suitable match is located or the search is finished. Using the nearest points in the range blocks as a starting point, this method searches the range block for the best matching domain. Despite being straightforward to use, the recommended rapid full-search strategy outperforms the traditional search strategy. The proposed method's search reduction, peak signal-to-noise ratio, compression ratio, and encoding time are all assessed. Test results show that the proposed method may reduce the overall search time by 89% and encode a 512x512 gray scale Lena image in 0.31 seconds.