Sciweavers

14 search results - page 2 / 3
» Gradient Pursuits
Sort
View
SIAMIS
2010
190views more  SIAMIS 2010»
13 years 5 months ago
Analysis and Generalizations of the Linearized Bregman Method
This paper analyzes and improves the linearized Bregman method for solving the basis pursuit and related sparse optimization problems. The analysis shows that the linearized Bregma...
Wotao Yin
SIAMSC
2008
139views more  SIAMSC 2008»
13 years 10 months ago
Probing the Pareto Frontier for Basis Pursuit Solutions
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...
Ewout van den Berg, Michael P. Friedlander
TSP
2008
89views more  TSP 2008»
13 years 10 months ago
A Geometrical Study of Matching Pursuit Parametrization
This paper studies the effect of discretizing the parametrization of a dictionary in the particular context of Matching Pursuit decompositions of signals. Our approach relies on th...
Laurent Jacques, Christophe De Vleeschouwer
ICASSP
2011
IEEE
13 years 2 months ago
An ALPS view of sparse recovery
We provide two compressive sensing (CS) recovery algorithms based on iterative hard-thresholding. The algorithms, collectively dubbed as algebraic pursuits (ALPS), exploit the res...
Volkan Cevher
ICIP
2007
IEEE
14 years 5 months ago
Sparse Gradient Image Reconstruction Done Faster
In a wide variety of imaging applications (especially medical imaging), we obtain a partial set or subset of the Fourier transform of an image. From these Fourier measurements, we...
Ray Maleh, Anna C. Gilbert, Martin J. Strauss