Sciweavers

1054 search results - page 83 / 211
» Fast Approximated SIFT
Sort
View
APCCAS
2006
IEEE
261views Hardware» more  APCCAS 2006»
14 years 12 months ago
A Grouped Fast Fourier Transform Algorithm Design For Selective Transformed Outputs
- 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...
Chih-Peng Fan, Guo-An Su
VCIP
2003
178views Communications» more  VCIP 2003»
14 years 11 months ago
Geometrical image compression with bandelets
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...
Erwan Le Pennec, Stéphane Mallat
ICASSP
2011
IEEE
14 years 1 months ago
Audio Signal Representations for Factorization in the Sparse Domain
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...
Manuel Moussallam, Laurent Daudet, Gaël Richa...
CVPR
2005
IEEE
15 years 12 months ago
Applying Neighborhood Consistency for Fast Clustering and Kernel Density Estimation
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...
Kai Zhang, Ming Tang, James T. Kwok
DATE
2007
IEEE
150views Hardware» more  DATE 2007»
15 years 4 months ago
Fast memory footprint estimation based on maximal dependency vector calculation
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...
Qubo Hu, Arnout Vandecappelle, Per Gunnar Kjeldsbe...