-
1
-
-
33645712892
-
Compressed sensing
-
Apr
-
D. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
-
(2006)
IEEE Trans. Inf. Theory
, vol.52
, Issue.4
, pp. 1289-1306
-
-
Donoho, D.1
-
2
-
-
0031619929
-
Sub-Nyquist sampling of multiband signals: Perfect reconstruction and bounds on aliasing error
-
Seattle, WA, May
-
R. Venkataramani and Y. Bresler, "Sub-Nyquist sampling of multiband signals: Perfect reconstruction and bounds on aliasing error," in Proc. IEEE Int. Conf. Acoustics, Speech and Signal Processing (ICASSP Seattle, WA, May 1998, vol. 3, pp. 1633-1636.
-
(1998)
Proc. IEEE Int. Conf. Acoustics, Speech and Signal Processing (ICASSP
, vol.3
, pp. 1633-1636
-
-
Venkataramani, R.1
Bresler, Y.2
-
3
-
-
29144439194
-
Decoding by linear programming
-
Dec
-
E. Candès and T. Tao, "Decoding by linear programming," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4203-4215, Dec. 2005.
-
(2005)
IEEE Trans. Inf. Theory
, vol.51
, Issue.12
, pp. 4203-4215
-
-
Candès, E.1
Tao, T.2
-
4
-
-
31744440684
-
Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information
-
Feb
-
E. Candès, J. Romberg, and T. Tao, "Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 489-509, Feb. 2006.
-
(2006)
IEEE Trans. Inf. Theory
, vol.52
, Issue.2
, pp. 489-509
-
-
Candès, E.1
Romberg, J.2
Tao, T.3
-
5
-
-
33748540464
-
Error correction via linear programming
-
Pittsburgh, PA, Oct
-
E. Candès, R. Mark, T. Tao, and R. Vershynin, "Error correction via linear programming," in Proc. IEEE Symp. Foundations of Computer Science (FOCS), Pittsburgh, PA, Oct. 2005, pp. 295-308.
-
(2005)
Proc. IEEE Symp. Foundations of Computer Science (FOCS)
, pp. 295-308
-
-
Candès, E.1
Mark, R.2
Tao, T.3
Vershynin, R.4
-
6
-
-
44049103219
-
Combinatorial algorithms for compressed sensing
-
Princeton, NJ, Mar
-
G. Cormode and S. Muthukrishnan, "Combinatorial algorithms for compressed sensing," in Proc. 40th Annu. Conf. Information Sciences and Systems, Princeton, NJ, Mar. 2006, pp. 198-201.
-
(2006)
Proc. 40th Annu. Conf. Information Sciences and Systems
, pp. 198-201
-
-
Cormode, G.1
Muthukrishnan, S.2
-
8
-
-
5444237123
-
Greed is good: Algorithmic results for sparse approximation
-
Oct
-
J. A. Tropp, "Greed is good: Algorithmic results for sparse approximation," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2231-2242, Oct. 2004.
-
(2004)
IEEE Trans. Inf. Theory
, vol.50
, Issue.10
, pp. 2231-2242
-
-
Tropp, J.A.1
-
11
-
-
0027668419
-
Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes
-
Sep
-
Y. Han, C. Hartmann, and C.-C. Chen, "Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes," IEEE Trans. Inf. Theory, vol. 39, no. 5, pp. 1514-1523, Sep. 1993.
-
(1993)
IEEE Trans. Inf. Theory
, vol.39
, Issue.5
, pp. 1514-1523
-
-
Han, Y.1
Hartmann, C.2
Chen, C.-C.3
-
12
-
-
71049134092
-
Iterative signal recovery from incomplete and inaccurate measurements
-
San Deigo, CA, Feb
-
J. Tropp, D. Needell, and R. Vershynin, "Iterative signal recovery from incomplete and inaccurate measurements," in Proc. Information Theory and Applications Workshop, San Deigo, CA, Feb. 2008.
-
(2008)
Proc. Information Theory and Applications Workshop
-
-
Tropp, J.1
Needell, D.2
Vershynin, R.3
-
13
-
-
33947416035
-
Near-optimal signal recovery from random projections: Universal encoding strategies?
-
Dec
-
E. J. Candès and T. Tao, "Near-optimal signal recovery from random projections: Universal encoding strategies?," IEEE Trans. Inf. Theory, vol. 52, no. 12, pp. 5406-5425, Dec. 2006.
-
(2006)
IEEE Trans. Inf. Theory
, vol.52
, Issue.12
, pp. 5406-5425
-
-
Candès, E.J.1
Tao, T.2
-
16
-
-
39449109476
-
1-regularized least squares
-
Dec
-
1-regularized least squares," IEEE J. Sel. Topics Signal Process., vol. 1, no. 4, pp. 606-617, Dec. 2007.
-
(2007)
IEEE J. Sel. Topics Signal Process
, vol.1
, Issue.4
, pp. 606-617
-
-
Kim, S.-J.1
Koh, K.2
Lustig, M.3
Boyd, S.4
Gorinevsky, D.5
-
17
-
-
46749146509
-
A coordinate gradient descent method for non-smooth separable minimization
-
Aug
-
P. Tseng and S. Yun, "A coordinate gradient descent method for non-smooth separable minimization," Math. Programming, vol. 117, no. 1-2, pp. 387-423, Aug. 2007.
-
(2007)
Math. Programming
, vol.117
, Issue.1-2
, pp. 387-423
-
-
Tseng, P.1
Yun, S.2
-
18
-
-
42649140570
-
The restricted isometry property and its implications for compressed sensing
-
C. R. l'Academie des Sciences
-
E. J. Candès, "The restricted isometry property and its implications for compressed sensing," C. R. l'Academie des Sciences, ser. I, no. 346, pp. 589-592, 2008.
-
(2008)
ser. I
, vol.346
, pp. 589-592
-
-
Candès, E.J.1
-
19
-
-
57949093358
-
Cosamp: Iterative signal recovery from incomplete and inaccurate samples
-
submitted for publication
-
D. Needell and J. A. Tropp, "Cosamp: Iterative signal recovery from incomplete and inaccurate samples," Appl. Comp. Harmonic Anal., 2008, submitted for publication.
-
(2008)
Appl. Comp. Harmonic Anal
-
-
Needell, D.1
Tropp, J.A.2
-
21
-
-
35448971851
-
One sketch for all: Fast algorithms for compressed sensing
-
San Diego, CA, Jun
-
A. Gilbert, M. Strauss, J. Tropp, and R. Vershynin, "One sketch for all: Fast algorithms for compressed sensing," in Proc. Symp. Theory of Computing (STOC), San Diego, CA, Jun. 2007, pp. 237-246.
-
(2007)
Proc. Symp. Theory of Computing (STOC)
, pp. 237-246
-
-
Gilbert, A.1
Strauss, M.2
Tropp, J.3
Vershynin, R.4
|