Sciweavers

1381 search results - page 44 / 277
» Fast Filtered Sampling
Sort
View
TIT
2008
121views more  TIT 2008»
15 years 2 months ago
Stability Results for Random Sampling of Sparse Trigonometric Polynomials
Recently, it has been observed that a sparse trigonometric polynomial, i.e. having only a small number of non-zero coefficients, can be reconstructed exactly from a small number o...
Holger Rauhut
119
Voted
CLEF
2010
Springer
15 years 2 months ago
Random Sampling Image to Class Distance for Photo Annotation
Image classification or annotation is proved difficult for the computer algorithms. The Naive-Bayes Nearest Neighbor method is proposed to tackle the problem, and achieved the stat...
Deyuan Zhang, Bingquan Liu, Chengjie Sun, Xiaolong...
ICASSP
2008
IEEE
15 years 8 months ago
A new Particle Filtering algorithm with structurally optimal importance function
Bayesian estimation in nonlinear stochastic dynamical systems has been addressed for a long time. Among other solutions, Particle Filtering (PF) algorithms propagate in time a Mon...
Boujemaa Ait-El-Fquih, François Desbouvries
ICASSP
2010
IEEE
15 years 2 months ago
Empirical quantization for sparse sampling systems
We propose a quantization design technique (estimator) suitable for new compressed sensing sampling systems whose ultimate goal is classification or detection. The design is base...
Michael A. Lexa
CEC
2008
IEEE
15 years 8 months ago
Differential evolution particle swarm optimization for digital filter design
— In this paper, swarm and evolutionary algorithms have been applied for the design of digital filters. Particle swarm optimization (PSO) and differential evolution particle swar...
Bipul Luitel, Ganesh K. Venayagamoorthy