Image Quick Search Based on F-shift Transformation

No Thumbnail Available
File version
Author(s)
Li, T
Fan, R
Li, X
Zhao, H
Pang, C
Wang, J
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2020
Size
File type(s)
Location

Ningbo, China

License
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.

Journal Title
Conference Title

Communications in Computer and Information Science

Book Title
Edition
Volume

1179

Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject

Artificial intelligence

Persistent link to this record
Citation

Li, T; Fan, R; Li, X; Zhao, H; Pang, C; Wang, J, Image Quick Search Based on F-shift Transformation, Data Science, 2020, 1179, pp. 450-460