Sciweavers

133 search results - page 9 / 27
» Simple and practical algorithm for sparse Fourier transform
Sort
View
AVBPA
1997
Springer
100views Biometrics» more  AVBPA 1997»
13 years 11 months ago
Using Gait as a Biometric, via Phase-weighted Magnitude Spectra
Gait is a biometric which is subject to increasing interest. Current approaches include modelling gait as a spatio-temporal sequence and as an articulated model. By considering leg...
David Cunado, Mark S. Nixon, John N. Carter
ICML
2009
IEEE
14 years 8 months ago
Bandit-based optimization on graphs with application to library performance tuning
The problem of choosing fast implementations for a class of recursive algorithms such as the fast Fourier transforms can be formulated as an optimization problem over the language...
Arpad Rimmel, Frédéric de Mesmay, Ma...
ICIP
2007
IEEE
14 years 1 months ago
Locally Competitive Algorithms for Sparse Approximation
Practical sparse approximation algorithms (particularly greedy algorithms) suffer two significant drawbacks: they are difficult to implement in hardware, and they are inefficie...
Christopher J. Rozell, Don H. Johnson, Richard G. ...
CVPR
2008
IEEE
14 years 9 months ago
An efficient algorithm for compressed MR imaging using total variation and wavelets
Compressed sensing, an emerging multidisciplinary field involving mathematics, probability, optimization, and signal processing, focuses on reconstructing an unknown signal from a...
Shiqian Ma, Wotao Yin, Yin Zhang, Amit Chakraborty
TIP
1998
142views more  TIP 1998»
13 years 7 months ago
Inversion of large-support ill-posed linear operators using a piecewise Gaussian MRF
Abstract—We propose a method for the reconstruction of signals and images observed partially through a linear operator with a large support (e.g., a Fourier transform on a sparse...
Mila Nikolova, Jérôme Idier, Ali Moha...