Sciweavers

61 search results - page 3 / 13
» Biomedical signal compression based on basis pursuit
Sort
View
ICIP
2006
IEEE
15 years 16 days ago
Tree-Based Orthogonal Matching Pursuit Algorithm for Signal Reconstruction
Recent studies in linear inverse problems have recognized the sparse representation of unknown signal in a certain basis as an useful and effective prior information to solve thos...
Chinh La, Minh N. Do
ICASSP
2008
IEEE
14 years 5 months ago
An audio watermarking method based on molecular matching pursuit
In this paper we introduce a new watermarking model combining a joint time frequency (TF) representation using the molecular matching pursuit (MMP) algorithm and a psychoacoustic ...
Mathieu Parvaix, Sridhar Krishnan, Cornel Ioana
CORR
2011
Springer
282views Education» more  CORR 2011»
13 years 5 months ago
Fast Linearized Bregman Iteration for Compressive Sensing and Sparse Denoising
We propose and analyze an extremely fast, efficient and simple method for solving the problem: min{ u 1 :Au=f,u∈Rn }. This method was first described in [1], with more details i...
Stanley Osher, Yu Mao, Bin Dong, Wotao Yin
ICASSP
2010
IEEE
13 years 11 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...
ICIP
2005
IEEE
15 years 16 days ago
The M-term pursuit for image representation and progressive compression
This paper introduces a sparse signal representation algorithm in redundant dictionaries, called the M-Term Pursuit (MTP), with an application to image representation and scalable ...
Adel Rahmoune, Pierre Vandergheynst, Pascal Frossa...