Sciweavers

587 search results - page 14 / 118
» Theory of matching pursuit
Sort
View
TSP
2010
13 years 2 months ago
Block-sparse signals: uncertainty relations and efficient recovery
We consider efficient methods for the recovery of block-sparse signals--i.e., sparse signals that have nonzero entries occurring in clusters--from an underdetermined system of line...
Yonina C. Eldar, Patrick Kuppinger, Helmut Bö...
ICANNGA
2009
Springer
201views Algorithms» more  ICANNGA 2009»
14 years 1 months ago
A Novel Signal-Based Approach to Anomaly Detection in IDS Systems
In this paper we present our original methodology, in which Matching Pursuit is used for networks anomaly and intrusion detection. The architecture of anomaly-based IDS based on si...
Lukasz Saganowski, Michal Choras, Rafal Renk, Wito...
DCC
1995
IEEE
13 years 11 months ago
Quantization of Overcomplete Expansions
The use of overcomplete sets of vectors (redundant bases or frames) together with quantization is explored as an alternative to transform coding for signal compression. The goal i...
Vivek K. Goyal, Martin Vetterli, Nguyen T. Thao
ICASSP
2010
IEEE
13 years 7 months ago
Sound enhancement using sparse approximation with speclets
This paper addresses an innovative approach to informed enhancement of damaged sound. It uses sparse approximations with a learned dictionary of atoms modeling the main components...
Manuel Moussallam, Pierre Leveau, Si-Mohamed Aziz ...
CVPR
2012
IEEE
11 years 9 months ago
A game-theoretic approach to deformable shape matching
We consider the problem of minimum distortion intrinsic correspondence between deformable shapes, many useful formulations of which give rise to the NP-hard quadratic assignment p...
Emanuele Rodolà, Alexander M. Bronstein, An...