Sciweavers

242 search results - page 28 / 49
» Fast computation of general Fourier Transforms on GPUS
Sort
View
ICIP
2010
IEEE
14 years 9 months ago
Constructing a sparse convolution matrix for shift varying image restoration problems
Convolution operator is a linear operator characterized by a point spread functions (PSF). In classical image restoration problems, the blur is usually shift invariant and so the ...
Stanley H. Chan
CVPR
2010
IEEE
14 years 10 months ago
Transform Coding for Fast Approximate Nearest Neighbor Search in High Dimensions
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...
Jonathan Brandt
CORR
2011
Springer
151views Education» more  CORR 2011»
14 years 6 months ago
Generating and Searching Families of FFT Algorithms
A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fo...
Steve Haynal, Heidi Haynal
IPPS
2010
IEEE
14 years 9 months ago
Offline library adaptation using automatically generated heuristics
Automatic tuning has emerged as a solution to provide high-performance libraries for fast changing, increasingly complex computer architectures. We distinguish offline adaptation (...
Frédéric de Mesmay, Yevgen Voronenko...
CVPR
2008
IEEE
16 years 1 months ago
Action MACH a spatio-temporal Maximum Average Correlation Height filter for action recognition
In this paper we introduce a template-based method for recognizing human actions called Action MACH. Our approach is based on a Maximum Average Correlation Height (MACH) filter. A...
Mikel D. Rodriguez, Javed Ahmed, Mubarak Shah