Sciweavers

574 search results - page 102 / 115
» Sequential Compressed Sensing
Sort
View
JMLR
2008
209views more  JMLR 2008»
13 years 7 months ago
Bayesian Inference and Optimal Design for the Sparse Linear Model
The linear model with sparsity-favouring prior on the coefficients has important applications in many different domains. In machine learning, most methods to date search for maxim...
Matthias W. Seeger
TIT
2008
121views more  TIT 2008»
13 years 7 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
SAC
2002
ACM
13 years 7 months ago
The P-tree algebra
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
Qin Ding, Maleq Khan, Amalendu Roy, William Perriz...
FOCM
2010
140views more  FOCM 2010»
13 years 6 months ago
Combinatorial Sublinear-Time Fourier Algorithms
We study the problem of estimating the best k term Fourier representation for a given frequency-sparse signal (i.e., vector) A of length N k. More explicitly, we investigate how t...
Mark A. Iwen
ICASSP
2010
IEEE
13 years 6 months ago
Human detection in images via L1-norm Minimization Learning
In recent years, sparse representation originating from signal compressed sensing theory has attracted increasing interest in computer vision research community. However, to our b...
Ran Xu, Baochang Zhang, Qixiang Ye, Jianbin Jiao