Reconstruction of sparse signals from l 1 dimensionality-reduced cauchy random projections

IEEE Transactions on Signal Processing

Volumn 60, Issue 11, 2012, Pages 5725-5737

  Ramirez, Ana B ^a   Arce, Gonzalo R ^a   Otero, Daniel ^a   Paredes, Jose Luis ^b   Sadler, Brian M ^c  

^a UNIVERSITY OF DELAWARE   (United States)

^b UNIVERSIDAD DE LOS ANDES   (Venezuela)

^c U S ARMY RESEARCH LABORATORY   (United States)

Author keywords

Cauchy random projections; compressed sensing; dimensionality reduction; myriad filter; Restricted Isometry Property (RIP); sketching

Indexed keywords

COMPRESSIVE SENSING; DIMENSIONALITY REDUCTION; MYRIAD FILTERS; RANDOM PROJECTIONS; RESTRICTED ISOMETRY PROPERTY (RIP); SKETCHING;

ALGORITHMS; SIGNAL RECONSTRUCTION;

MATRIX ALGEBRA;

EID: 84867563288     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2012.2208954     Document Type: Article

References (43)

1. P. Indyk, "Stable distributions, pseudorandom generators, embeddings and data stream computation," J. ACM, vol. 53, no. 3, pp. 307-323, May 2006. (Pubitemid 44180740)
2. S. Deegalla and H. Bostrom, "Reducing high-dimensional data by principal component analysis vs. random projection for nearest neighbor classification," presented at the IEEE Conf. Mach. Learn. Appl. (ICMLA), Orlando, Fl, Dec. 2006.
3. P. Li, T. J. Hastie, and K. W. Church, "Nonlinear estimators and tail bounds for dimension reduction in using Cauchy random projections," J. Mach. Learn. Res., vol. 8, pp. 2497-2532, Oct. 2007. (Pubitemid 350046191)
4. G. R. Arce, Nonlinear Signal Processing: A Statistical Approach. New York: Wiley, 2005.
5. S. Vempala, The Random Projection Method, ser. Series in Discrete Mathematics and Theoretical Computer Science. Providence, RI: Amer. Math. Soc., 2004, vol. 65.
6. W. B. Johnson and J. Lindenstrauss, "Extensions of Lipschitz mapping into Hilbert space," in Comtemp. Math. Providence, R.I.:Amer. Math. Soc., June 1984, vol. 26, pp. 189-206.
7. R. Baranuik, M.Davenport, R. DeVore, and M.Wakin, "A simple proof of the restricted isometry property for random matrices," J. on Const. Approx., vol. 28, no. 3, pp. 253-263, Dec. 2008.
8. R. Berinde, A. Gilbert, P. Indik, H. Karloff, and M. Strauss, "Combining geometry and combinatorics: A unified approach to sparse signal recovery," J. Const. Approx., vol. 28, pp. 253-263, Apr. 2008.
9. P. Indyk and M. Ruzic, "Near-optimal sparse recovery in the l1 norm," in Proc. 49th IEEE Symp. Found. Comput. Sci., Oct. 2008, pp. 199-207.
10. X. Z. Fern and C. E. Brodley, "Random projection for high dimensional data clustering: a cluster ensemble approach," in Proc. 20th Conf. Mach. Learn., Seattle, Washington, Aug. 2003, pp. 186-193.
11. D. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
12. E. 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, 2006. (Pubitemid 46445381)
13. Z. Wang and G. R. Arce, "Variable density compressed image sampling," IEEE Trans. Image Process., vol. 19, pp. 264-270, Jan. 2010.
14. G. Cormode, M. Datar, P. Indyk, and S. Muthukrishnan, "Comparing data streams using Hamming norms," presented at the 28th Conf. Very Large DataBases (VLDB), Hong Kong, China, Aug. 2002.
15. A. Menon, G. Pham, S. Chawla, and A. Viglas, "An incremental datastreamsketch using sparse random projections," presented at the SIAM Conf. Data Mining, Minnesota, CA, Apr. 2007.
16. E. Cańdes and J. Romberg, "l1 Magic: Recovery of sparse signals via convex programming," California Inst. of Technol., Pasadena, CA, Tech. Rep., Oct. 2005.
17. K. Koh, S. Kim, and S. Boyd, "l1-ls: A Matlab Solver for Large-Scale l1-Regularized Least Squares Problems," Stanford Univ., Stanford, CA, Tech. Rep., Mar. 2007.
18. S. Kalluri and G. R. Arce, "Adaptive weighted myriad filter algorithms for robust signal processing in alpha-stable noise environments," IEEE Trans. Signal Process., vol. 46, no. 2, pp. 322-334, Feb. 1998. (Pubitemid 128744984)
19. J. G. Gonzalez and G. R. Arce, "Optimality of the myriad filter in practical impulsive-noise environments," IEEE Trans. Signal Process., vol. 49, no. 2, pp. 438-441, Feb. 2001. (Pubitemid 32254638)
20. S. Kalluri and G. R. Arce, "A general class of nonlinear normalized adaptive filtering algorithms," IEEE Trans. Signal Process., vol. 47, no. 8, pp. 2262-2272, Aug. 1999.
21. R. C. Nunez et al., "Fast and accurate computation of the myriad filter via branch-and-bound search," IEEE Trans. Signal Process., vol. 56, no. 7, pp. 3340-3346, Jul. 2008.
22. S. Kalluri and G. R. Arce, "Robust frequency-selective filtering using weighted myriad filters admitting real-valued weights," IEEE Trans. Signal Process., vol. 49, no. 11, pp. 2721-2733, Nov. 2001. (Pubitemid 33048441)
23. J. Friedman, T. Hastie, H. Hofling, and R. Tibshirani, "Pathwise coordinate optimization," Ann. Appl. Stat., vol. 1, no. 2, pp. 302-332, Dec. 2007.
24. S. Yun and K. Toh, "A coordinate gradient descent method for-regularized convex minimization," J. Comput. Optim. Appl., May 2009.
25. P. Tseng and S. Yun, "Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization," J. Comput. Optim. Appl., vol. 140, no. 3, pp. 513-535, Mar. 2009.
26. T. T. Wu and K. Lange, "Coordinate descent algorithm for Lasso penalized regression," Ann. Appl. Stat., vol. 2, no. 1, pp. 224-244, Mar. 2008.
27. P. Tseng, "Convergence of a block coordinate descent method for nondifferentiableminimization," J. Optim. Theory Appl., vol. 19, no. 3, pp. 475-494, June 2001.
28. R. Mazumder, J. Friedman, and T. Hastie, "Sparsenet: Coordinate descent with non-convex penalties," Statistics Dept., Stanford Univ., Stanford, CA, Tech. Rep., Dec. 2009.
29. 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. (Pubitemid 43174093)
30. S. J. Kim, K. Koh, M. Lustig, S. Boyd, and D. Gorinevsky, "A method for large-scale l1-regularized least squares," IEEE J. Sel. Topics Signal Process., vol. 1, no. 4, pp. 606-617, Dec. 2007.
31. J. L. Paredes and G. R. Arce, "Compressive sensing signal reconstruction by weighted median regression estimates," IEEE Trans. Signal Process., vol. 59, no. 6, pp. 2585-2601, Jun. 2011.
32. Y. Li and S. Osher, "Coordinate descent optimization for minimization with application to compressed sensing; A Greedy Algorithm," UCLA, Los Angeles, Comput. Appl. Math. Rep., 09-17, Mar. 2009.
33. J. G.Gonzalez andG. R. Arce, "Statistically-efficient filtering in impulsive environments:Weighted myriad filters," EURASIP J. Appl. Signal Process., vol. 1, pp. 4-20, Feb. 2002. (Pubitemid 34784308)
34. A. Ruszczynski, Nonlinear Optimization. Princeton, NJ: Princeton Univ. Press, 2006.
35. Z. Luo and P. Tseng, "On the convergence of the coordinate descent method for convex differentiable minimization," J. Optim. Theory Appl., vol. 12, no. 5, pp. 7-35, Jan. 1992.
36. P. Breheny and J. Huang, "Coordinate descent algorithms for nonconvex penalized regression with applications to biological feature extraction," Ann. Appl. Stat., vol. 5, no. 1, pp. 232-253, 2011.
37. 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.
38. J. Yang and Y. Zhang, "Alternating direction algorithms for-problems in compressive sensing," Mathematics Dept., Rice Univ., Houston, TX, Tech. Rep., Dec. 2009.
39. J. G. Gonzalez, J. L. Paredes, and G. R. Arce, "Zero-order statistics: A mathematical framework for the processing and characterization of very impulsive signals," IEEE Trans. Signal Process., vol. 54, no. 10, pp. 3839-3851, Oct. 2006. (Pubitemid 44507644)
40. G. Pisier, The Volume of Convex Bodies and Banach Space Geometry. Cambridge, U.K.: Cambridge Univ. Press, 1989.
41. S. V. Selivanova, "The tangent cone to a quasimetric space with dilations," Siberian Math. J., vol. 51, no. 2, pp. 313-324, Mar. 2010.
42. H.Arguello andG. R. Arce, "Code aperture optimization for spectrally agile compressive imaging," J. Opt. Soc. Amer. A, vol. 28, no. 11, pp. 2400-2413, Nov. 2011.
43. S. Kalluri and G. R. Arce, "Fast algorithms for weighted myriad computation by fixed-point search," IEEE Trans. Signal Process., vol. 48, no. 1, pp. 159-171, Jan. 2000. (Pubitemid 30561702)