2374 search results - page 24 / 475 » Fast Distributed Algorithms for Computing Separable Function... |
TOG
2012
11 years 10 months ago
2012
Using existing programming tools, writing high-performance image processing code requires sacrificing readability, portability, and modularity. We argue that this is a consequenc...
CSIE
2009
IEEE
14 years 14 days ago
2009
IEEE
A new algorithm of image layer-presentation was proposed. The key concept of the algorithm was in that the image grayscale function f(x,y), which was comparatively irregular, was ...
PACT
2009
Springer
14 years 2 months ago
2009
Springer
The notion of Fast Fourier Transformation (FFT) describes a range of efficient algorithms to compute the discrete Fourier transformation, frequency distribution in a signal. FFT pl...
CCA
2005
Springer
13 years 9 months ago
2005
Springer
If one wishes to find out whether a computational problem over discrete data is solvable or how complex it is, the classical approach is to represent the discrete objects in quest...
IBPRIA
2005
Springer
14 years 1 months ago
2005
Springer
We describe a fast algorithm for Gabor filtering, specially designed for multi-scale image representations. Our proposal is based on three facts: first, Gabor functions can be de...