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

An Efficient Algorithm for Learning Dictionary under Coherence Constraint

College of Information Engineering, Zhejiang University of Technology, Hangzhou, Zhejiang 310023, China

Received 30 March 2016; Revised 8 June 2016; Accepted 23 June 2016

Academic Editor: Srdjan Stankovic

Copyright © 2016 Huang Bai 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. A. M. Bruckstein, D. L. Donoho, and M. Elad, “From sparse solutions of systems of equations to sparse modeling of signals and images,” SIAM Review, vol. 51, no. 1, pp. 34–81, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  2. M. Elad, Sparse and Redundant Representations: From Theory to Applications in Signal and Image Processing, Springer, New York, NY, USA, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. M. Elad and M. Aharon, “Image denoising via sparse and redundant representations over learned dictionaries,” IEEE Transactions on Image Processing, vol. 15, no. 12, pp. 3736–3745, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. A. Li and H. Shouno, “Dictionary-based image denoising by fused-lasso atom selection,” Mathematical Problems in Engineering, vol. 2014, Article ID 368602, 10 pages, 2014. View at Publisher · View at Google Scholar · View at Scopus
  5. Z. Jian, H. Luxi, J. Jian, and X. Yu, “A fast iterative pursuit algorithm in robust face recognition based on sparse representation,” Mathematical Problems in Engineering, vol. 2014, Article ID 683494, 11 pages, 2014. View at Publisher · View at Google Scholar · View at Scopus
  6. X. Zhu and F. Kui, “Image recovery algorithm based on learned dictionary,” Mathematical Problems in Engineering, vol. 2014, Article ID 964835, 6 pages, 2014. View at Publisher · View at Google Scholar · View at Scopus
  7. H. Bai, G. Li, S. Li, Q. Li, Q. Jiang, and L. Chang, “Alternating optimization of sensing matrix and sparsifying dictionary for compressed sensing,” IEEE Transactions on Signal Processing, vol. 63, no. 6, pp. 1581–1594, 2015. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. M. S. Lewicki and T. J. Sejnowski, “Learning overcomplete representations,” Neural Computation, vol. 12, no. 2, pp. 337–365, 2000. View at Publisher · View at Google Scholar · View at Scopus
  9. I. Tosic and P. Frossard, “Dictionary learning: what is the right representation for my signals,” IEEE Signal Processing Magazine, vol. 28, no. 2, pp. 27–38, 2011. View at Google Scholar
  10. K. Engan, S. O. Aase, and J. H. Hakon-Housoy, “Method of optimal direction for frame design,” in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, vol. 5, pp. 2443–2446, Phoenix, Ariz, USA, 1999.
  11. M. Aharon, M. Elad, and A. Bruckstein, “K-SVD: an algorithm for designing overcomplete dictionaries for sparse representation,” IEEE Transactions on Signal Processing, vol. 54, no. 11, pp. 4311–4322, 2006. View at Publisher · View at Google Scholar · View at Scopus
  12. S. K. Sahoo and A. Makur, “Dictionary training for sparse representation as generalization of K-means clustering,” IEEE Signal Processing Letters, vol. 20, no. 6, pp. 587–590, 2013. View at Publisher · View at Google Scholar · View at Scopus
  13. 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 · View at Scopus
  14. J. A. Tropp and A. C. Gilbert, “Signal recovery from random measurements via orthogonal matching pursuit,” IEEE Transactions on Information Theory, vol. 53, no. 12, pp. 4655–4666, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. E. J. Candes and M. B. Wakin, “An introduction to compressive sampling,” IEEE Signal Processing Magazine, vol. 25, no. 2, pp. 21–30, 2008. View at Publisher · View at Google Scholar · View at Scopus
  16. M. S. Asif and J. Romberg, “Sparse recovery of streaming signals using l1-homotopy,” IEEE Transactions on Signal Processing, vol. 62, no. 16, pp. 4209–4223, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. M. Yaghoobi, L. Daudet, and M. E. Davies, “Parametric dictionary design for sparse coding,” IEEE Transactions on Signal Processing, vol. 57, no. 12, pp. 4800–4810, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  18. B. Mailhé, D. Barchiesi, and M. D. Plumbley, “INK-SVD: learning incoherent dictionaries for sparse representations,” in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '12), pp. 3573–3576, IEEE, Kyoto, Japan, March 2012. View at Publisher · View at Google Scholar · View at Scopus
  19. D. Barchiesi and M. D. Plumbley, “Learning incoherent dictionaries for sparse approximation using iterative projections and rotations,” IEEE Transactions on Signal Processing, vol. 61, no. 8, pp. 2055–2065, 2013. View at Publisher · View at Google Scholar · View at Scopus
  20. C. D. Sigg, T. Dikk, and J. M. Buhmann, “Learning dictionaries with bounded self-coherence,” IEEE Signal Processing Letters, vol. 19, no. 12, pp. 861–864, 2012. View at Publisher · View at Google Scholar · View at Scopus
  21. D. L. Donoho and M. Elad, “Optimally sparse representation in general (nonorthogonal) dictionaries via l1 minimization,” Proceedings of the National Academy of Sciences of the United States of America, vol. 100, no. 5, pp. 2197–2202, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  22. T. Strohmer and J. Heath, “Grassmannian frames with applications to coding and communication,” Applied and Computational Harmonic Analysis, vol. 14, no. 3, pp. 257–275, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  23. V. Abolghasemi, S. Ferdowsi, and S. Sanei, “A gradient-based alternating minimization approach for optimization of the measurement matrix in compressive sensing,” Signal Processing, vol. 92, no. 4, pp. 999–1009, 2012. View at Publisher · View at Google Scholar · View at Scopus
  24. G. Li, Z. Zhu, D. Yang, L. Chang, and H. Bai, “On projection matrix optimization for compressive sensing systems,” IEEE Transactions on Signal Processing, vol. 61, no. 11, pp. 2887–2898, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  25. R. A. Horn and C. R. Johnson, Matrix Analysis, Cambridge University Press, 2nd edition, 2013. View at MathSciNet
  26. I. Damnjanovic, M. E. P. Davies, and M. D. Plumbley, “SMALLbox-an evaluation framework for sparse representations and dictionary learning algorithms,” in Proceedings of the 9th International Conference on Latent Variable Analysis and Signal Separation (LVA/ICA '10), pp. 418–425, St. Malo, France, 2010.