Sciweavers

33 search results - page 1 / 7
» Stable sparse approximations via nonconvex optimization
Sort
View
ICASSP
2008
IEEE
13 years 11 months ago
Stable sparse approximations via nonconvex optimization
We present theoretical results pertaining to the ability of ℓp minimization to recover sparse and compressible signals from incomplete and noisy measurements. In particular, we ...
Rayan Saab, Rick Chartrand, Özgür Yilmaz
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 5 months ago
Sparse Recovery by Non-convex Optimization -- Instance Optimality
In this note, we address the theoretical properties of p, a class of compressed sensing decoders that rely on p minimization with p (0, 1) to recover estimates of sparse and compr...
Rayan Saab, Özgür Yilmaz
CORR
2011
Springer
194views Education» more  CORR 2011»
12 years 8 months ago
Sparse approximation property and stable recovery of sparse signals from noisy measurements
—In this paper, we introduce a sparse approximation property of order s for a measurement matrix A: xs 2 ≤ D Ax 2 + β σs(x) √ s for all x, where xs is the best s-sparse app...
Qiyu Sun
CORR
2011
Springer
203views Education» more  CORR 2011»
12 years 12 months ago
Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
The Compressive Sensing (CS) framework aims to ease the burden on analog-to-digital converters (ADCs) by reducing the sampling rate required to acquire and stably recover sparse s...
Laurent Jacques, Jason N. Laska, Petros Boufounos,...
ICRA
2002
IEEE
147views Robotics» more  ICRA 2002»
13 years 9 months ago
Design of Asymptotically Stable Walking for a 5-Link Planar Biped Walker via Optimization
— Closed-loop, asymptotically stable walking motions are designed for a 5-link, planar bipedal robot model with one degree of underactuation. Parameter optimization is applied to...
E. R. Westervelt, J. W. Grizzle