160 search results - page 8 / 32 » On the diagonalization of the discrete Fourier transform |
PAMI
2008
13 years 7 months ago
2008
This paper presents an efficient algorithm for iris recognition using phase-based image matching--an image matching technique using phase components in 2D Discrete Fourier Transfor...
JMIV
2011
13 years 2 months ago
2011
When the Discrete Fourier Transform of an image is computed, the image is implicitly assumed to be periodic. Since there is no reason for opposite borders to be alike, the “peri...
SIPS
2008
IEEE
14 years 1 months ago
2008
IEEE
In this paper we present an efficient way of doing image reconstruction using the 2D Discrete Fourier transform (DFT). We exploit the fact that in the frequency domain, informati...
TIFS
2008
13 years 7 months ago
2008
This paper presents two vector watermarking schemes that are based on the use of complex and quaternion Fourier transforms and demonstrates, for the first time, how to embed waterm...
PACT
2009
Springer
14 years 1 months ago
2009
Springer
The notion of Fast Fourier Transformation (FFT) describes a range of efficient algorithms to compute the discrete Fourier transformation, frequency distribution in a signal. FFT pl...