A modified robust image hashing using fractional fourier transform for image retrieval

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In order to improve the security and robustness of image retrieval, a novel image hashing algorithm based on fractional Fourier transform (FRFT) for content-based image retrieval (CBIR) application is proposed in this paper. By employing FRFT and normalized Hamming distance, a robust hashing sequence is obtained by preprocessing, feature extracting and post processing. The security of proposed algorithm is totally depended on the orders of FRFT which are saved as secret keys. For illustration, several benchmark images are utilized to show the feasibility of the image hashing algorithm. Experimental results show that the proposed scheme is robust against perceptually acceptable modifications to the image such as JPEG compression, mid-filtering, and rotation. Therefore, the scheme proposed in this paper is suitable for CBIR application. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Cui, D., Zuo, J., & Xiao, M. (2010). A modified robust image hashing using fractional fourier transform for image retrieval. In Lecture Notes in Electrical Engineering (Vol. 72 LNEE, pp. 309–315). https://doi.org/10.1007/978-3-642-14350-2_39

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free