Sciweavers

225 search results - page 23 / 45
» The Future Fast Fourier Transform
Sort
View
ICIP
2006
IEEE
14 years 10 months ago
Fast Non-Local Algorithm for Image Denoising
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...
Jin Wang, Yanwen Guo, Yiting Ying, Yanli Liu, Quns...
IMAGING
2004
13 years 9 months ago
Fast Re-integration of Shadow Free Images
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...
Clément Fredembach, Graham D. Finlayson
ACIVS
2009
Springer
13 years 6 months ago
Enhanced Low-Resolution Pruning for Fast Full-Search Template Matching
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...
Stefano Mattoccia, Federico Tombari, Luigi di Stef...
CANS
2011
Springer
258views Cryptology» more  CANS 2011»
12 years 8 months ago
Fast Computation on Encrypted Polynomials and Applications
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
Payman Mohassel
TSP
2008
180views more  TSP 2008»
13 years 8 months ago
Algebraic Signal Processing Theory: Foundation and 1-D Time
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...
Markus Püschel, José M. F. Moura