Sciweavers

26 search results - page 5 / 6
» Universal Measurement Bounds for Structured Sparse Signal Re...
Sort
View
ICASSP
2011
IEEE
12 years 10 months ago
Improved model-based spectral compressive sensing via nested least squares
This paper introduces a new algorithm for reconstructing signals with sparse spectrums from noisy compressive measurements. The proposed model-based algorithm takes the signal str...
Mahdi Shaghaghi, Sergiy A. Vorobyov
ICASSP
2011
IEEE
12 years 10 months ago
Improved thresholds for rank minimization
—Nuclear norm minimization (NNM) has recently gained attention for its use in rank minimization problems. In this paper, we define weak, sectional and strong recovery for NNM to...
Samet Oymak, M. Amin Khajehnejad, Babak Hassibi
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 6 months ago
Phase Transitions for Greedy Sparse Approximation Algorithms
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner...
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 6 months ago
Restricted Isometries for Partial Random Circulant Matrices
In the theory of compressed sensing, restricted isometry analysis has become a standard tool for studying how efficiently a measurement matrix acquires information about sparse an...
Holger Rauhut, Justin K. Romberg, Joel A. Tropp
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 6 months ago
Performance Analysis of Spectral Clustering on Compressed, Incomplete and Inaccurate Measurements
Spectral clustering is one of the most widely used techniques for extracting the underlying global structure of a data set. Compressed sensing and matrix completion have emerged a...
Blake Hunter, Thomas Strohmer