Sciweavers

420 search results - page 82 / 84
» Compressive sensing
Sort
View
CORR
2010
Springer
164views Education» more  CORR 2010»
13 years 7 months ago
Sub-Nyquist Sampling of Short Pulses: Part I
We develop sub-Nyquist sampling systems for analog signals comprised of several, possibly overlapping, finite duration pulses with unknown shapes and time positions. Efficient sam...
Ewa Matusiak, Yonina C. Eldar
TSP
2008
151views more  TSP 2008»
13 years 7 months ago
Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
Moshe Mishali, Yonina C. Eldar
MOR
2010
120views more  MOR 2010»
13 years 5 months ago
Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Lojasiewicz In
We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x, y) = f(x)+Q(x, y)+g(y), where f : Rn → ...
Hedy Attouch, Jérôme Bolte, Patrick R...
TIP
2010
255views more  TIP 2010»
13 years 2 months ago
Image Super-Resolution Via Sparse Representation
This paper presents a new approach to single-image superresolution, based on sparse signal representation. Research on image statistics suggests that image patches can be wellrepre...
Jianchao Yang, John Wright, Thomas S. Huang, Yi Ma
ICCV
2011
IEEE
12 years 7 months ago
The Generalized Trace-Norm and its Application to Structure-from-Motion Problems
In geometric computer vision, the structure from motion (SfM) problem can be formulated as a optimization problem with a rank constraint. It is well known that the trace norm of a...
Roland Angst, Christopher Zach, Marc Pollefeys