Sparsity-aware adaptive filtering based on a Douglas-Rachford splitting

European Signal Processing Conference

Volumn , Issue , 2011, Pages 1929-1933

  Yamada, Isao ^a   Gandy, Silvia ^a   Yamagishi, Masao ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

A-MONOTONE; ADAPTIVE FILTERING ALGORITHMS; CONVERGENCE PERFORMANCE; CONVEX FUNCTIONS; NON-SMOOTH; SIMPLE ALGORITHM; SOLUTION SET; SPLITTING METHOD; TIME VARYING; UPPER BOUND;

ALGORITHMS; SIGNAL PROCESSING;

ADAPTIVE FILTERING;

EID: 84863735995     PISSN: 22195491     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. J. Benesty, Y. A. Huang, J. Chen, and P. A. Naylor. Adaptive algorithm for the identification of sparse impulse responses, chapter 5, pages 125-153. Springer, 2006.
2. Y. Chen, Y. Gu, and A. O. Hero. Regularized least-mean-square algorithms. Available at arxiv.org: http://arxiv.org/pdf/1012.5066.
3. Y. Chen, Y. Gu, and A. O. Hero. Sparse LMS for system identification. In Proc. IEEE ICASSP 2009, pages 3125-3128, Taipel, Taiwan, Apr. 2009.
4. P. L. Combettes and J.-C. Pesquet. A Douglas-Rachford splitting approach to nonsmooth convex variational signal recovery. IEEE J. Sel. Top. Signal Process., 1:564-574, 2007.
5. P. L. Combettes and J.-C. Pesquet. A proximal decomposition method for solving convex variational inverse problems. Inverse Problems, 24, 2008.
6. P. L. Combettes and V. R. Wajs. Signal recovery by proximal forwardbackward splitting. Multiscale Model. Simul., 4(4):1168-1200, 2005.
7. D. L. Duttweiler. Proportionate normalized least-mean-squares adaptation in echo cancelers. IEEE Trans. Speech Audio Processing, 8(5):508-518, Sep. 2000.
8. S. Gandy, B. Recht, and I. Yamada. Tensor completion and low-nrank tensor recovery via convex optimization. Inverse Problems, 27(2), 2011.
9. S. Gandy and I. Yamada. Convex optimization techniques for the efficient recovery of a sparsely corrupted low-rank matrix. Journal of Math-for-Industry, JMI2010B, Oct. 2010.
10. T. Gänsler, S. L. Gay, M. M. Sondhi, and J. Benesty. Double-talk robust fast converging algorithms for network echo cancellation. IEEE Trans. Speech Audio Processing, 8(6):656-663, Nov. 2000.
11. S. Haykin. Adaptive Filter Theory. Prentice Hall, third edition, 1996.
12. T. Hinamoto and S. Maekawa. Extended theory of learning identification. Trans. IEE Japan (in Japanese), 95-C(10):227-234, 1975.
13. J. B. Hiriart-Urruty and C. Lemaréchal. Convex analysis and minimization algorithms, volume 1 and 2. Springer, 1993.
14. ITU-T Rec. G.168. Digital Network Echo Cancellers, 2007.
15. W. K. Jenkins and D. F. Marshall. Transform domain adaptive filtering. In Digital Signal Processing Handbook, chapter 22. CRC Press, Florida, 1999.
16. J. J. Moreau. Fonctions convexes duales et points proximaux dans un espace hilbertien. C. R. Acad. Sci. Paris Sér, 255:2897-2899, 1962.
17. Y. Murakami, M. Yamagishi, M. Yukawa, and I. Yamada. A sparse adaptive filtering using time-varying soft-thresholding techniques. In Proc. IEEE ICASSP 2010, pages 3734-3737, Dallas, Texas, USA, Mar. 2010.
18. J. Nagumo and A. Noda. A learning method for system identification. IEEE Trans. Autom. Control, 12(3):282-287, Jun. 1967.
19. K. Ozeki and T. Umeda. An adaptive filtering algorithm using an orthogonal projection to an affine subspace and its properties. IEICE Trans. (in Japanese), 67-A(5):126-132, 1984.
20. B. G. Passty. Ergodic convergence to a zero of the sum of monotone operators in hilbert space. J. Math. Anal. Appl., 72(2):383-390, 1979.
21. G. Pierra. Decomposition through formalization in a product space. Math. Program., 28:96-115, 1984.
22. A. H. Sayed. Fundamentals of Adaptive Filtering. Wiley, 2003.
23. K. Slavakis, Y. Kopsinis, and S. Theodoridis. Adaptive algorithm for sparse system identification using projections onto weighted l1 balls. In Proc. IEEE ICASSP 2010, pages 3742-3745, Dalla, Texas, USA, Mar. 2010.
24. 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 Processing Magazine, 28(1):97-123, Jan. 2011.
25. I. Yamada and N. Ogura. Adaptive projected subgradient method for asymptotic minimization of sequence of nonnegative convex functions. Numer. Funct. Anal. Optim., 25(7&8):593-617, 2004.
26. I. Yamada, K. Slavakis, and K. Yamada. An efficient robust adaptive filtering algorithm based on parallel subgradient projection techniques. IEEE Trans. Signal Processing, 50(5):1091-1101, 2002.
27. I. Yamada, M. Yukawa, and M. Yamagishi. Minimizing the Moreau envelope of nonsmooth convex functions over the fixed point set of certain quasi-nonexpansive mappings. In: Fixed Point Algorithms for Inverse Problems in Science and Engineering (H. H. Bauschke, R. Burachik, P. L. Combettes, V. Elser, D. R. Luke, and H.Wolkowicz, eds.), chapter 17, pages 345-390. Springer, 2011.
28. M. Yamagishi, M. Yukawa, and I. Yamada. Sparse system identification by exponentially weighted adaptive parallel projection and generalized soft-thresholding. In Proc. APSIPA ASC 2010, Biopolis, Singapore, Dec. 2010.
29. M. Yamagishi, M. Yukawa, and I. Yamada. Acceleration of adaptive proximal forward-backward splitting method and its application to sparse system identification. In Proc. IEEE ICASSP 2011, Prague, Czech Republic, May. 2011.
30. M. Yukawa, K. Slavakis, and I. Yamada. Adaptive parallel quadraticmetric projection algorithms. IEEE Trans. Audio, Speech, Language Processing, 15(5):1665-1680, 2007.