By Topic

A fast two-dimension Discrete Fractional Fourier Transform algorithm and its application on digital watermarking

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Bai Tianyang ; Honors Sch., Harbin Inst. of Technol., Harbin, China

In order to improve the computing efficiency and accuracy of Discrete Fractional Fourier Transform (DFRFT), a fast algorithm derived from Fast Fourier Transform is introduced on the basis of the study on the periodicity of the eigenvalues of Fractional Fourier Transform (FRFT). Moreover, the algorithm is generalized to implement the two-dimension DFRFT, by which the fractional order spectrum of the digital images can be obtained. In addition, the feasibility of the two-dimension algorithm is proved by its successful application in the domain of digital watermarking. Finally, the properties of the FRFT watermarking are briefly discussed: its sensitivity to attacks in both the spatial domain and the frequency domain indicates that the algorithm can be applied to make fragile watermarkings.

Published in:

Communication Technology (ICCT), 2010 12th IEEE International Conference on

Date of Conference:

11-14 Nov. 2010