Image Quick Search Based on F-shift Transformation

Abstract

Searching a given image belongs to which part of an image is a practical significance topic in computer vision, image and video processing. Commonly the images are compressed for efficient storage and transfer, while if we want to search a given image form images, we need to decompress them first and then process our task. In this paper, we give a quick image searching method based on F-shift compressed images, which means no decompression processes are needed. The basic principle lies on the attribute of F-shift transformation (similar to Haar wavelet transformation), where each of the data are quality-guaranteed. This property ensure we can just search the high frequency component of a compressed image to reach our goal. Getting benefit from the fact that no decompression process are needed, the efficiency of our method can be promoted significantly.