Sciweavers

225 search results - page 6 / 45
» Kernel Basis Pursuit
Sort
View
ICASSP
2010
IEEE
13 years 10 months ago
Gradient Polytope Faces Pursuit for large scale sparse recovery problems
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
Aris Gretsistas, Ivan Damnjanovic, Mark D. Plumble...
CORR
2007
Springer
183views Education» more  CORR 2007»
13 years 9 months ago
Compressed Sensing and Redundant Dictionaries
This article extends the concept of compressed sensing to signals that are not sparse in an orthonormal basis but rather in a redundant dictionary. It is shown that a matrix, whic...
Holger Rauhut, Karin Schnass, Pierre Vandergheynst
CORR
2007
Springer
136views Education» more  CORR 2007»
13 years 9 months ago
Sparsity in time-frequency representations
We consider signals and operators in finite dimension which have sparse time-frequency representations. As main result we show that an S-sparse Gabor representation in Cn with re...
Götz E. Pfander, Holger Rauhut
ICCV
2009
IEEE
13 years 7 months ago
Kernel map compression using generalized radial basis functions
The use of Mercer kernel methods in statistical learning theory provides for strong learning capabilities, as seen in kernel principal component analysis and support vector machin...
Omar Arif, Patricio A. Vela
CVPR
2010
IEEE
13 years 10 months ago
Robust RVM regression using sparse outlier model
Kernel regression techniques such as Relevance Vector Machine (RVM) regression, Support Vector Regression and Gaussian processes are widely used for solving many computer vision p...
Kaushik Mitra, Ashok Veeraraghavan, Rama Chellappa