Online sparse system identification and signal reconstruction using projections onto weighted ℓ1 balls

IEEE Transactions on Signal Processing

Volumn 59, Issue 3, 2011, Pages 936-952

  Kopsinis, Yannis ^a   Slavakis, Konstantinos ^b   Theodoridis, Sergios ^a  

^a UNIVERSITY OF ATHENS   (Greece)

^b UNIVERSITY OF PELOPONNESE   (Greece)

Author keywords

adaptive filtering; compressive sensing; projections; Sparsity

Indexed keywords

ADAPTATION MECHANISM; CLOSED CONVEX SETSS; COMPRESSIVE SENSING; COST CRITERIA; DATA MISMATCH; LINEAR DEPENDENCE; NUMERICAL RESULTS; OBSERVED DATA; PROJECTION OPERATOR; PROJECTIONS; SELECTION OPERATORS; SPARSE SIGNALS; SPARSE SYSTEM IDENTIFICATION; SPARSITY;

ADAPTIVE FILTERING; ADAPTIVE FILTERS; MATHEMATICAL OPERATORS; NUMERICAL METHODS; SET THEORY; SIGNAL RECONSTRUCTION;

ADAPTIVE ALGORITHMS;

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

References (38)

1. 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)
2. D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, pp. 1289-1306, 2006.
3. E. Candès, "Compressive sampling," Proc. ICM, vol. 3, pp. 1433-1452, 2006.
4. E. J. Candès and T. Tao, "Decoding by linear programming," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4203-4215, 2005. (Pubitemid 41800353)
5. R. G. Baraniuk, "Compressive sensing [lecture notes]," IEEE Signal Process. Mag., vol. 24, no. 4, pp. 118-121, August 2007.
6. Y. Chen, Y. Gu, and A. O. Hero, "Sparse LMS for system identification," in Proc. IEEE ICASSP, 2009, pp. 3125-3128.
7. D. Angelosante and G. B. Giannakis, "RLS-weighted Lasso for adaptive estimation of sparse signals," in Proceedings of the IEEE ICASSP, 2009, pp. 3245-3248.
8. B. Babadi, N. Kalouptsidis, and V. Tarokh, "Asympotic achievability of the Cramer-Rao bound for noisy compressive sampling," IEEE Trans. Signal Process., vol. 57, no. 3, pp. 1233-1236, 2009.
9. Y. Murakami, M. Yamagishi, M. Yukawa, and I. Yamada, "A sparse adaptive filtering using time-varying soft-thresholding techniques," in Proc. IEEE ICASSP, Dallas, TX, Mar. 2010, pp. 3734-3737.
10. 1 balls," in Proceedings of IEEE ICASSP, Dallas, TX, Mar. 2010, pp. 3742-3745.
11. 1-norm, " IEEE Trans. Signal Process., vol. 58, no. 7, pp. 3436-3447, July 2010.
12. P. L. Combettes, "The foundations of set theoretic estimation," Proc. IEEE, vol. 81, no. 2, pp. 182-208, 1993.
13. I. Yamada and N. Ogura, "Adaptive Projected Subgradient Method for asymptotic minimization of sequence of nonnegative convex functions," Numer. Funct. Anal. Optim., vol. 25, no. 7 and 8, pp. 593-617, 2004. (Pubitemid 40050078)
14. K. Slavakis, I. Yamada, and N. Ogura, "The adaptive projected subgradient method over the fixed point set of strongly attracting nonexpansive mappings," Numer. Funct. Anal. Optim., vol. 27, no. 7 and 8, pp. 905-930, 2006.
15. K. Slavakis and I. Yamada, Asymptotic Minimization of Sequences of Loss Functions Constrained by Families of Quasi-Nonexpansive Mappings and its Application to Online Learning [Online]. Available: http://arxiv.org/abs/1008. 5231 Sept. 2010
16. H. Rauhut, "Circulant and Toeplitz matrices in compressed sensing," in Proc. Signal Process. Adapt. Sparse Structured Represent. (SPARS) Workshop, 2009.
17. W. Bajwa, J. Haupt, G. Raz, S. Wright, and R. Nowak, " Toeplitzstructured compressed sensing matrices," in Proc. IEEE Statist. Signal Process. (SSP) Workshop, Washington, DC, 2007, pp. 294-298.
18. W. Bajwa, J. Haupt, A. Sayeed, and R. Nowak, "Compressed channel sensing: A new approach to estimating sparse multipath channels," Proc. IEEE, Jun. 2010.
19. S. Theodoridis, K. Slavakis, and I. Yamada, "Adaptive learning in a world of projections: A unifying framework for linear and nonlinear classification and regression tasks," IEEE Signal Process. Mag., vol. 28, no. 1, pp. 97-123, 2011.
20. 1 minimization," J. Fourier Anal. Appl., vol. 14, pp. 877-905, 2008.
21. L. M. Bregman, "The method of successive projections for finding a common point of convex sets," Soviet Math. Dokl., vol. 6, pp. 688-692, 1965.
22. L. G. Gubin, B. T. Polyak, and E. V. Raik, "The method of projections for finding the common point of convex sets," USSR Comput. Math. Phys., vol. 7, pp. 1-24, 1967.
23. H. H. Bauschke and J. M. Borwein, "On projection algorithms for solving convex feasibility problems," SIAM Rev., vol. 38, no. 3, pp. 367-426, Sep. 1996. (Pubitemid 126599619)
24. H. Stark and Y. Yang, Vector Space Projections: A Numerical Approach to Signal and Image Processing, Neural Nets, and Optics. New York: Wiley, 1998.
25. K. Slavakis, S. Theodoridis, and I. Yamada, "Adaptive constrained learning in Reproducing Kernel Hilbert Spaces: The robust beamforming case," IEEE Trans. Signal Process., vol. 57, no. 12, pp. 4744-4764, Dec. 2009.
26. K. Slavakis, S. Theodoridis, and I. Yamada, "Online kernel-based classification using adaptive projection algorithms," IEEE Trans. Signal Process., vol. 56, no. 7, pp. 2781-2796, 2008.
27. I. Yamada, K. Slavakis, and K. Yamada, "An efficient robust adaptive filtering algorithm based on parallel subgradient projection techniques," IEEE Trans. Signal Process., vol. 50, no. 5, pp. 1091-1101, 2002. (Pubitemid 34515269)
28. 1-ball for learning in high dimensions," in Proc. Int. Conf. Machine Learning (ICML), 2008, pp. 272-279.
29. I. Daubechies, M. Fornasier, and I. Loris, "Accelerated projected gradient method for linear inverse problems with sparsity constraints," J. Fourier Anal. Applicat., vol. 14, no. 5-6, pp. 764-792, Dec. 2008.
30. H. Zou, "The adaptive lasso and its oracle properties," J. Amer. Statist. Assoc., vol. 101, pp. 1418-1429, Dec. 2006.
31. E. van den Berg and M. P. Friedlander, "Probing the pareto frontier for basis pursuit solutions," SIAM J. Sci. Comput., vol. 31, no. 2, pp. 890-912, 2008.
32. E. van den Berg and M. P. Friedlander, SPGL1: A Solver for Large-Scale Sparse Reconstruction Jun. 2007 [Online]. Available: http://www.cs.ubc.ca/labs/ scl/spgl1
33. J. F. Sturm, "Using SeDuMi 1.02, aMATLAB toolbox for optimization over symmetric cones," Optim. Meth. Softw., vol. 11-12, pp. 625-653, Aug. 1999.
34. A. H. Sayed, Fundamentals of Adaptive Filtering. Hoboken, NJ: Wiley, 2003.
35. S. Haykin, Adaptive Filter Theory, 3rd ed. Upper Saddle River, NJ: Prentice-Hall, 1996.
36. 1 balls," 2010 [Online]. Available: http://arxiv.org/abs/ 1004.3040
37. J.-B. Hiriart-Urruty and C. Lemaréchal, Convex Analysis and Minimization Algorithms. Berlin, Germany: Springer-Verlag, 1993, vol. 1.
38. H. H. Bauschke and P. L. Combettes, "A weak-to-strong convergence principle for Fejér-monotone methods in Hilbert spaces," Math. Oper. Res., vol. 26, no. 2, pp. 248-264, May 2001. (Pubitemid 34050614)