Sciweavers

112 search results - page 3 / 23
» Faster deterministic dictionaries
Sort
View
SDM
2012
SIAM
245views Data Mining» more  SDM 2012»
11 years 8 months ago
Deterministic CUR for Improved Large-Scale Data Analysis: An Empirical Study
Low-rank approximations which are computed from selected rows and columns of a given data matrix have attracted considerable attention lately. They have been proposed as an altern...
Christian Thurau, Kristian Kersting, Christian Bau...
ICASSP
2008
IEEE
14 years 7 days ago
Blind source separation using monochannel overcomplete dictionaries
We propose a new approach to underdetermined Blind Source Separation (BSS) using sparse decomposition over monochannel dictionary atoms and compare it to multichannel dictionary a...
B. Vikrham Gowreesunker, Ahmed H. Tewfik
CORR
2011
Springer
179views Education» more  CORR 2011»
13 years 21 days ago
Recovery of Sparsely Corrupted Signals
We investigate the recovery of signals exhibiting a sparse representation in a general (i.e., possibly redundant or incomplete) dictionary that are corrupted by additive noise adm...
Christoph Studer, Patrick Kuppinger, Graeme Pope, ...
CORR
2007
Springer
183views Education» more  CORR 2007»
13 years 5 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