Compressed sensing with cross validation

IEEE Transactions on Information Theory

Volumn 55, Issue 12, 2009, Pages 5773-5782

  Ward, Rachel ^a,b  

^a PRINCETON UNIVERSITY   (United States)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

Best K term approximation; Compressed sensing (CS); Cross validation; Encoding decoding; Error estimates; Johnson Lindenstrauss (JL) lemma; Measurements

Indexed keywords

BEST K-TERM APPROXIMATION; COMPRESSED SENSING; CROSS VALIDATION; ENCODING/DECODING; ERROR ESTIMATES; JOHNSON-LINDENSTRAUSS LEMMATA;

MEASUREMENTS; QUALITY ASSURANCE; SIGNAL RECONSTRUCTION;

APPROXIMATION ALGORITHMS;

EID: 77949694214     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2009.2032712     Document Type: Article

References (30)

1. E. Candes and T. Tao, "Decoding by linear programming," IEEE Trans Inf. Theory, vol.51, no.12, pp. 4203-4215, Dec. 2005.
2. E. Candes, 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.
3. D. Donoho and M. Elad, "Optimally sparse representation from overcomplete distionaries via ℓ-norm minimization," in Proc. Nat. Acad. Sci., 2003, pp. 2197-12002
4. R. Baraniuk, M. Davenport, R. DeVore, and M.Wakin, "A simple proof of the restricted isometry property for random matrices," Constructive Approx., vol.28, pp. 253-263, 2007.
5. M. Rudelson and R. Vershynin, "On sparse reconstruction from Fourier and Gaussian measurements," Commun. Pure Appl. Math., vol.61, pp. 1025-1045, 2008.
6. q regularization: Phase transitions for sparse approximation", submitted for publication.
7. A. Cohen, R. DeVore, and W. Dahmen, "Compressed sensing and best κ-term approximation," J. Amer. Math. Soc., vol.22, pp. 211-231, 2009.
8. q -minimization for 0 < q ≤ 1," Appl. Comput. Harmon. Anal., vol.26, pp. 395-407, 2009.
9. D. Needell and J. Tropp, "Cosamp: Iterative signal reco very from incomplete and inaccurate samples," Appl. Comput. Harmon. Anal., vol.26, no.3, pp. 301-321, May 2009.
10. W. Johnson and J. Lindenstrauss, "Extensions of lipschitz maps into a Hilbert space," Contemp. Math, vol.26, pp. 189-206, 1984.
11. P. Boufounos, M. Duarte, and R. Baraniuk, "Sparse signal reconstruction from noisy compressive measurements using cross validation," in Proc. IEEE Workshop Statist. Signal Process., 2007, pp. 299-303.
12. P. Frankl and H. Maehara, "The Johnson-Lindenstrauss lemma and the sphericity of some graphs," J. Combinat. Theory B, vol.44, pp. 355-362, 1988.
13. P. Indyk and R. Motwani, "Approximate nearest neighbors: Towards removing the curse of dimensionality," in Proc. 30th Symp. Theory Comput., 1998, pp. 604-613.
14. S. Dasgupta and A. Gupta, "An elementary proof of a theorem of Johnson and Lindenstrauss," Random Structures Algorithms, vol.22, pp. 60-65, 2003.
15. J. Matousek, "On variants of the Johnson-Lindenstrauss lemma," Random Structures Algorithms, vol.33, pp. 142-156, 2008.
16. I. Daubechies, R. DeVore, M. Fornasier, and C. Sinan Güntürk, "Iteratively re-weighted least squares minimization for sparse recovery," Commun. Pure Appl. Math., vol.63, no.1, pp. 1-38, 2010.
17. W. Dai and O. Milenkovic, "Subspace pursuit for compressive sensing: Closing the gap between performance and complexity", submitted for publication.
18. P. Wojtaszczyk, "Stability and instance optimality for Gaussian measurements in compressed sensing," Found. Comput. Math., 2009, submitted for publication.
19. R. DeVore, G. Petrova, and P. Wojtaszczyk, "Instance-optimality in probability with an ell-1 decoder," Appl. Comput. Harmonic Anal., vol.27, no.3, pp. 275-288, Nov. 2009.
20. D. Needell and R. Vershynin, "Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit," Found. Comput. Math., vol.9, pp. 317-334, 2009.
21. R. DeVore, B. Jawerth, and B. Lucier, "Image compression through wavelet transform coding," IEEE Trans. Inf. Theory, vol.38, no.2, pp. 719-746, Mar. 1992.
22. E. Candes, L. Demanet, D. Donoho, and L.Ying, "Fast discrete curvelet transforms," Multiscale Model. Simul., vol.5, pp. 861-899, 2005.
23. R. Tibshirani, "Regression shrinkage and selection via the lasso," J. R. Statist. Soc. B, vol.58, pp. 267-288, 1996.
24. D. Malioutov, M. Cetin, and A. Willsky, "Homotopy continuation for sparse signal representation," in Proc. IEEE Int. Conf. Acoust. Speech Signal Process., 2005.
25. E. J. Candes and T. Tao, "The Dantzig selector: Statistical estimation when p is much larger than n," Ann. Statist., vol.35, pp. 2392-2404, 2008.
26. G. James, P. Radchenko, and J. Lv, "Dasso: Connections between the Dantzig selector and lasso," J. R. Statist. Soc. B, vol.71, pp. 127-142, 2009.
27. J. Tropp and A. Gilbert, "Signal recovery from random measurements via orthogonal matching pursuit," IEEE Trans. Inf. Theory, vol.53, no.12, pp. 4655-4666, Dec. 2007.
28. I. Daubechies, M. Defrise, and C. De Mol, "An iterative thresholding algorithm for linear inverse problems with a sparsity constraint," Commun. Pure Appl. Math., vol.57, no.11, pp. 1413-1457, 2004.
29. T. Do, L. Gan, Y. Chen, N. Nguyen, and T. Tran, "Fast and efficient dimensionality reduction using structurally random matrices," in Proc. IEEE Int. Conf. Acoust. Speech Signal Process., 2009, pp. 1821-1824.
30. 1 norm," in Proc. 43rd Symp. Found. Comput. Sci., Dec. 2005, 2002, pp. 551-560.