Fast fractal image retrieval algorithm based on HV partition

Existing quadtree-based fractal algorithms and fractal algorithms based on horizontal vertical (HV) have the problems of long encoding time and low accuracy in the task of image retrieval. In this paper, an improved fast fractal image retrieval algorithm based on HV segmentation is proposed, which speeds up the coding time and improves the accuracy for real-time searching. In order to improve the coding efficiency, the proposed algorithm restricts R block segmentation to certain direction and location in the coding phase and uses the local codebook to find the optimal matching of the partitioned blocks. We also introduce a weighting equation calculating method of area intersection to the image matching. New weighting parameters with respect to the sizes of partitioning blocks are proposed to improve the accuracy of image retrieval. The constraint-based HV segmentation algorithm and the local codebook matching strategy are tested on the texture and Olivetti Research Laboratory (ORL) face datasets. The experimental results show that the proposed algorithm accelerates the speed of image encoding. When the recall ratio is 100%, the precision of our algorithm has improved significantly. The proposed algorithm based on HV segmentation outperforms traditional fractal search algorithms in terms of adaption adaptivity.