245 search results - page 24 / 49 » A Fast Fourier Transform Compiler |
ICIP
2006
IEEE
15 years 11 months ago
2006
IEEE
For the non-local denoising approach presented by Buades et al., remarkable denoising results are obtained at high expense of computational cost. In this paper, a new algorithm th...
IMAGING
2004
14 years 11 months ago
2004
In imaging applications, computation is often carried out in a derivative (gradient) domain. For example, we can attenuate small image differences by thresholding the gradient and...
103
click to vote
ACIVS
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. Gharavi-Alkhansari [1] proposed a full-search equivalent algorithm for speeding-up template matching based on Lp-norm distance measures. This algorithm performs a pruning...
107
click to vote
CANS
2011
Springer
13 years 9 months ago
2011
Springer
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
TSP
2008
14 years 9 months ago
2008
This paper introduces a general and axiomatic approach to linear signal processing (SP) that we refer to as the algebraic signal processing theory (ASP). Basic to ASP is the linear...