Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014, Article ID 317979, 8 pages
http://dx.doi.org/10.1155/2014/317979
Research Article

Efficient LED-SAC Sparse Estimator Using Fast Sequential Adaptive Coordinate-Wise Optimization (LED-2SAC)

1Faculty of Electrical and Computer Engineering, University of Tabriz, 29 Bahman Avenue, Tabriz 51666-15813, Iran
2Department of Electrical and Computer Engineering, Ryerson University, Toronto, ON, Canada M5B 2K3

Received 7 October 2013; Accepted 29 December 2013; Published 6 February 2014

Academic Editor: Yue Wu

Copyright © 2014 T. Yousefi Rezaii et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. S. S. Chen, D. L. Donoho, and M. A. Saunders, “Atomic decomposition by basis pursuit,” SIAM Journal on Scientific Computing, vol. 20, no. 1, pp. 33–61, 1998. View at Publisher · View at Google Scholar · View at MathSciNet
  2. J. A. Tropp, “Greed is good: algorithmic results for sparse approximation,” IEEE Transactions on Information Theory, vol. 50, no. 10, pp. 2231–2242, 2004. View at Publisher · View at Google Scholar · View at MathSciNet
  3. Y. Li and S. Osher, “Coordinate descent optimization for L1 minimization with application to compressed sensing; a greedy algorithm,” Inverse Problems and Imaging, vol. 3, no. 3, pp. 487–503, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. M. Çetin, D. M. Malioutov, and A. S. Willsky, “A variational technique for source localization based on a sparse signal reconstruction perspective,” in Proceedings of the IEEE International Conference on Acoustic, Speech, and Signal Processing (ICASSP '02), pp. 2965–2968, May 2002. View at Scopus
  5. E. J. Candès, M. B. Wakin, and S. P. Boyd, “Enhancing sparsity by reweighted L1 minimization,” The Journal of Fourier Analysis and Applications, vol. 14, no. 5-6, pp. 877–905, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. R. Chartrand, “Exact reconstruction of sparse signals via nonconvex minimization,” IEEE Signal Processing Letters, vol. 14, no. 10, pp. 707–710, 2007. View at Publisher · View at Google Scholar · View at Scopus
  7. R. Chartrand and W. Yin, “Iteratively reweighted algorithms for compressive sensing,” in Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP '08), pp. 3869–3872, Las Vegas, Nev, USA, April 2008. View at Publisher · View at Google Scholar · View at Scopus
  8. C. J. Miosso, R. von Borries, M. Argàez, L. Velazquez, C. Quintero, and C. M. Potes, “Compressive sensing reconstruction with prior information by iteratively reweighted least-squares,” IEEE Transactions on Signal Processing, vol. 57, no. 6, pp. 2424–2431, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  9. D. M. Malioutov, S. R. Sanghavi, and A. S. Willsky, “Sequential compressed sensing,” IEEE Journal on Selected Topics in Signal Processing, vol. 4, no. 2, pp. 435–444, 2010. View at Publisher · View at Google Scholar · View at Scopus
  10. J. Benesty and S. L. Gay, “An improved PNLMS algorithm,” in Proceedings of the IEEE International Conference on Acoustic, Speech and Signal Processing (ICASSP '10), pp. 1881–1884, May 2002. View at Scopus
  11. D. L. Duttweiler, “Proportionate normalized least-mean-squares adaptation in echo cancelers,” IEEE Transactions on Speech and Audio Processing, vol. 8, no. 5, pp. 508–517, 2000. View at Publisher · View at Google Scholar · View at Scopus
  12. T. Gänsler, S. L. Gay, M. M. Sondhi, and J. Benesty, “Double-talk robust fast converging algorithms for network echo cancellation,” IEEE Transactions on Speech and Audio Processing, vol. 8, no. 6, pp. 656–663, 2000. View at Publisher · View at Google Scholar · View at Scopus
  13. O. Hoshuyama, R. A. Goubran, and A. Sugiyama, “A generalized proportionate variable step-size algorithm for fast changing acoustic environments,” in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '04), pp. 161–164, May 2004. View at Scopus
  14. J. Benesty, C. Paleologu, and S. Ciochina, “Proportionate adaptive filters from a basis pursuit perspective,” IEEE Signal Processing Letters, vol. 17, no. 12, pp. 985–988, 2010. View at Publisher · View at Google Scholar · View at Scopus
  15. Y. Chen, Y. Gu, and A. O. Hero III, “Sparse LMS for system identification,” in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '09), pp. 3125–3128, April 2009. View at Publisher · View at Google Scholar · View at Scopus
  16. Y. Gu, J. Jin, and S. Mei, “L0 norm constraint LMS algorithm for sparse system identification,” IEEE Signal Processing Letters, vol. 16, no. 9, pp. 774–777, 2009. View at Publisher · View at Google Scholar · View at Scopus
  17. J. Jin, Y. Gu, and S. Mei, “A stochastic gradient approach on compressive sensing signal reconstruction based on adaptive filtering framework,” IEEE Journal on Selected Topics in Signal Processing, vol. 4, no. 2, pp. 409–420, 2010. View at Publisher · View at Google Scholar · View at Scopus
  18. E. M. Ekşioǧlu, “RLS adaptive filtering with sparsity regularization,” in Proceedings of the 10th International Conference on Information Sciences, Signal Processing and Their Applications (ISSPA '10), pp. 550–553, May 2010. View at Publisher · View at Google Scholar · View at Scopus
  19. R. Tibshirani, “Regression shrinkage and selection via the lasso,” Journal of the Royal Statistical Society B, vol. 58, no. 1, pp. 267–288, 1996. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  20. B. Efron, T. Hastie, I. Johnstone, and R. Tibshirani, “Least angle regression,” The Annals of Statistics, vol. 32, no. 2, pp. 407–499, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  21. M. R. Osborne, B. Presnell, and B. A. Turlach, “A new approach to variable selection in least squares problems,” IMA Journal of Numerical Analysis, vol. 20, no. 3, pp. 389–403, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  22. J. Fan and R. Li, “Variable selection via nonconcave penalized likelihood and its oracle properties,” Journal of the American Statistical Association, vol. 96, no. 456, pp. 1348–1360, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  23. M. Yuan and Y. Lin, “On the nonnegative Garotte estimator,” Tech. Rep., Georgia Institute of Technology, School of Industrial and Systems Engineering, 2005. View at Google Scholar
  24. H. Zou, “The adaptive lasso and its oracle properties,” Journal of the American Statistical Association, vol. 101, no. 476, pp. 1418–1429, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  25. P. Zhao and B. Yu, “On model selection consistency of Lasso,” Journal of Machine Learning Research, vol. 7, pp. 2541–2563, 2006. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  26. T. Yousefi Rezaii, M. A. Tinati, and S. Beheshti, “Sparsity aware consistent and high precision variable selection,” Journal of Signal, Image and Video Processing, 2012. View at Publisher · View at Google Scholar
  27. D. Angelosante and G. B. Giannakis, “RLS-weighted Lasso for adaptive estimation of sparse signals,” in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '09), pp. 3245–3248, April 2009. View at Publisher · View at Google Scholar · View at Scopus
  28. M. A. Tinati and T. Y. Rezaii, “Adaptive sparsity-aware parameter vector reconstruction with application to compressed sensing,” in Proceedings of the International Conference on High Performance Computing and Simulation (HPCS '11), pp. 350–356, July 2011. View at Publisher · View at Google Scholar · View at Scopus
  29. T. Y. Rezaii, M. A. Tinati, and S. Beheshti, “Adaptive efficient sparse estimator achieving oracle properties,” IET Signal Processing, vol. 7, no. 4, pp. 259–268, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  30. Y. Li and S. Osher, “Coordinate descent optimization for L1 minimization with application to compressed sensing; a greedy algorithm,” Inverse Problems and Imaging, vol. 3, no. 3, pp. 487–503, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  31. T. T. Wu and K. Lange, “Coordinate descent algorithms for lasso penalized regression,” The Annals of Applied Statistics, vol. 2, no. 1, pp. 224–244, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  32. D. Angelosante, J. A. Bazerque, and G. B. Giannakis, “Online adaptive estimation of sparse signals: where RLS meets the L1-norm,” IEEE Transactions on Signal Processing, vol. 58, no. 7, pp. 3436–3447, 2010. View at Publisher · View at Google Scholar · View at MathSciNet