Sciweavers

242 search results - page 22 / 49
» Fast computation of general Fourier Transforms on GPUS
Sort
View
ACIVS
2009
Springer
14 years 9 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...
BMCBI
2008
139views more  BMCBI 2008»
14 years 11 months ago
Hierarchical structure of cascade of primary and secondary periodicities in Fourier power spectrum of alphoid higher order repea
Background: Identification of approximate tandem repeats is an important task of broad significance and still remains a challenging problem of computational genomics. Often there ...
Vladimir Paar, Nenad Pavin, Ivan Basar, Marija Ros...
JCPHY
2011
87views more  JCPHY 2011»
14 years 2 months ago
A fast directional algorithm for high-frequency electromagnetic scattering
This paper is concerned with the fast solution of high frequency electromagnetic scattering problems using the boundary integral formulation. We extend the O(N log N) directional ...
Paul Tsuji, Lexing Ying
JCP
2007
104views more  JCP 2007»
14 years 11 months ago
Cyclic Convolution Algorithm Formulations Using Polynomial Transform Theory
— This work presents a mathematical framework for the development of efficient algorithms for cyclic convolution computations. The framework is based on the Chinese Reminder Theo...
Abraham H. Diaz-Perez, Domingo Rodríguez
ICIP
2001
IEEE
16 years 1 months ago
Faster template matching without FFT
We consider the template matching problem, in which one wants to find all good enough occurrences of a pattern template P from a larger image I. The current standard of template m...
Kimmo Fredriksson, Esko Ukkonen