Sciweavers

15 search results - page 2 / 3
» A First-Order Smoothed Penalty Method for Compressed Sensing
Sort
View
284
Voted
SIAMIS
2011
15 years 1 months ago
Gradient-Based Methods for Sparse Recovery
The convergence rate is analyzed for the sparse reconstruction by separable approximation (SpaRSA) algorithm for minimizing a sum f(x) + ψ(x), where f is smooth and ψ is convex, ...
William W. Hager, Dzung T. Phan, Hongchao Zhang
201
Voted
PERVASIVE
2008
Springer
15 years 6 months ago
Pressing the Flesh: Sensing Multiple Touch and Finger Pressure on Arbitrary Surfaces
Abstract. This paper identifies a new physical correlate of finger pressure that can be detected and measured visually in a wide variety of situations. When a human finger is press...
Joe Marshall, Tony P. Pridmore, Mike Pound, Steve ...
MOR
2010
120views more  MOR 2010»
15 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
1998
159views more  TIP 1998»
15 years 6 months ago
An optimal quadtree-based motion estimation and motion-compensated interpolation scheme for video compression
Abstract—In this paper, we propose an optimal quadtree (QT)based motion estimator for video compression. It is optimal in the sense that for a given bit budget for encoding the d...
Guido M. Schuster, Aggelos K. Katsaggelos
LCPC
2000
Springer
15 years 10 months ago
Efficient Dynamic Local Enumeration for HPF
In translating HPF programs, a compiler has to generate local iteration and communication sets. Apart from local enumeration, local storage compression is an issue, because in HPF ...
Will Denissen, Henk J. Sips