160 search results - page 13 / 32 » On the diagonalization of the discrete Fourier transform |
111
click to vote
SIAMSC
2010
14 years 4 months ago
2010
The fast Gauss transform allows for the calculation of the sum of N Gaussians at M points in O(N + M) time. Here, we extend the algorithm to a wider class of kernels, motivated by ...
108
click to vote
ISCAS
2003
IEEE
15 years 3 months ago
2003
IEEE
This paper presents a semi-fragile object-based authentication solution for MPEG4 video. To protect the integrity of the video objects / sequences, a content-based watermark is em...
100
click to vote
SCIA
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we propose Local Binary Pattern Histogram Fourier features (LBP-HF), a novel rotation invariant image descriptor computed from discrete Fourier transforms of local b...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
This paper presents a signal processing tool for analyzing and manipulating digitized acoustic wave fields, based on a spatio-temporal extension of the time–frequency represent...
CORR
2007
Springer
14 years 10 months ago
2007
Springer
Abstract—This paper presents a systematic methodology to derive and classify fast algorithms for linear transforms. The approach is based on the algebraic signal processing theor...