1054 search results - page 83 / 211 » Fast Approximated SIFT |
173
click to vote
APCCAS
2006
IEEE
15 years 8 months ago
2006
IEEE
- In this paper, the grouped scheme is specially applied to compute the fast Fourier transform (FFT) when the portions of transformed outputs are calculated selectively. The groupe...
154
click to vote
VCIP
2003
15 years 8 months ago
2003
This paper introduces a new class of bases, called bandelet bases, which decompose the image along multiscale vectors that are elongated in the direction of a geometric flow. Thi...
196
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper, a new class of audio representations is introduced, together with a corresponding fast decomposition algorithm. The main feature of these representations is that th...
181
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
Nearest neighborhood consistency is an important concept in statistical pattern recognition, which underlies the well-known k-nearest neighbor method. In this paper, we combine th...
195
click to vote
DATE
2007
IEEE
16 years 1 months ago
2007
IEEE
In data dominated applications, loop transformations have a huge impact on the lifetime of array data and therefore on memory footprint. Since a locally optimal loop transformatio...