A novel predual dictionary learning algorithm

Journal of Visual Communication and Image Representation

Volumn 23, Issue 1, 2012, Pages 182-193

  Liu, Qiegen ^a   Wang, Shanshan ^a   Luo, Jianhua ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

Bregman iteration method; Dictionary learning; Gradient descent; Image denoising; Iterated refinement property; Majorization minimization; Predual proximal point algorithm; Sparse representation

Indexed keywords

BREGMAN ITERATION; DICTIONARY LEARNING; GRADIENT DESCENT; IMAGE DE-NOISING; ITERATED REFINEMENT PROPERTY; MAJORIZATION-MINIMIZATION; PROXIMAL POINT ALGORITHM; SPARSE REPRESENTATION;

IMAGE QUALITY; NOISE POLLUTION CONTROL;

LEARNING ALGORITHMS;

EID: 82755164460     PISSN: 10473203     EISSN: 10959076     Source Type: Journal    
DOI: 10.1016/j.jvcir.2011.09.008     Document Type: Article

References (34)

1. M. Aharon, M. Elad, and A.M. Bruckstein The K-SVD: an algorithm for designing of overcomplete dictionaries for sparse representations IEEE Trans. Signal Process. 54 11 2006 4311 4322 (Pubitemid 44637761)
2. M. Elad, and M. Aharon Image denoising via sparse and redundant representations over learned dictionaries IEEE Trans. Image Process 15 12 2006 3736 3745 (Pubitemid 44811686)
3. M. Aharon, and M. Elad Sparse and redundant modeling of image content using an image-signature-dictionary SIAM J. Imag. Sci. 1 2008 228 247
4. D.L. Donoho, M. Elad, and V. Temlyakov Stable recovery of sparse overcomplete representations in the presence of noise IEEE Trans. Inf. Theory 52 1 2006 6 18 (Pubitemid 43263116)
5. S. Mallat, and Z. Zhang Matching pursuit in a time-frequency dictionary IEEE Trans. Signal Process. 41 12 1993 3397 3415
6. J.A. Tropp Greed is good: algorithmic results for sparse approximation IEEE Trans. Inf. Theory 50 10 2004 2231 2242
7. R. Rubinstein, M. Zibulevsky, M. Elad, Efficient Implementation of the K-SVD Algorithm Using Batch Orthogonal Matching Pursuit, Technical Report - CS Technion, 2008.
8. H. Lee, A. Battle, R. Rajat, A.Y. Ng, Efficient sparse coding algorithms, in: Adv. NIPS, 2007.
9. S.S. Chen, D.L. Donoho, and M.A. Saunders Atomic decomposition by basis pursuit SIAM Rev. 43 1 2001 129 159 (Pubitemid 32406896)
10. I. Gorodnitsky, and B. Rao Sparse signal reconstruction from limited data using FOCUSS: a re-weighted minimum norm algorithm IEEE Trans. Signal Process. 45 3 1997 600 616 (Pubitemid 127765947)
11. B.D. Rao, and K. Kreutz-Delgado An affine scaling methodology for best basis selection IEEE Trans. Signal Process. 47 1 1999 187 200
12. B. Efron, T. Hastie, I. Johnstone, and R. Tibshirani Least angle regression Ann. Statist. 32 2 2004
13. B. Olshausen, and D. Field Sparse coding with an overcomplete basis set: a strategy employed by V1? Vision Res. 37 23 1997 3311 3325 (Pubitemid 27493805)
14. B.A. Olshausen, and D.J. Field Emergence of simple-cell receptive field properties by learning a sparse code for natural images Nature vol. 381 1996 springer-Verlag New York (6583) pp. 607-609
15. K. Kreutz-Delgado, J. Murray, B. Rao, K. Engan, T. Lee, and T. Sejnowski Dictionary learning algorithms for sparse representation Neural Comput. 15 2 2003 349 396 (Pubitemid 37049825)
16. K. Engan, S.O. Aase, J.H. Husoy, Frame based signal compression using method of optimal directions (MOD), in: Proc. ISCS, 1999.
17. M. Zhou, H. Chen, J. Paisley, L. Ren, G. Sapiro, and L. Carin Non-parametric bayesian dictionary learning for sparse image representations Neural Inform. Process. Syst. (NIPS) 2009
18. N. Dobigeon, and J.Y. Tourneret Bayesian orthogonal component analysis for sparse representation IEEE Trans. Signal Process. 58 5 2010 2675 2685
19. S. Osher, M. Burger, D. Goldfarb, J. Xu, and W. Yin An iterative regularization method for total variation-based image restoration SIAM J. Multiscale Model. Simul. 4 2005 460 489 (Pubitemid 43885248)
20. W. Yin, S. Osher, D. Goldfarb, and J. Darbon Bregman iterative algorithms for l1-minimization with applications to compressed sensing SIAM J. Imag. Sci. 1 2008 142 168
21. F. Malgouyres, and T. Zeng A predual proximal point algorithm solving a non negative basis pursuit denoising model Int. J. Comput. Vision 83 3 2009 294 311
22. J. Xu, and S. Osher Iterative regularization and nonlinear inverse scale space applied to wavelet-based denoising IEEE Trans. Image Process. 16 2 2007 534 544 (Pubitemid 46421693)
23. M. Burger, S. Osher, J. Xu, and G. Gilboa Nonlinear inverse scale space methods for image restoration Lect. Notes Comput. Sci. 3752 2005 25 36
24. R.T. Rockafellar Augmented Lagrangians and applications of the proximal point algorithm in convex programming Math. Oper. Res. 1 2 1976 97 116
25. J. Bect, L. Blanc-F'eraud, G. Aubert, A. Chambolle, A L1-unified variational framework for image restoration. Lecture notes in Computer Science, 2004. Proc. ECCV 2004.
26. D. Hunter, and K. Lange A tutorial on MM algorithms The Am. Statist. 58 2004 30 37 (Pubitemid 38260327)
27. M. Elad Why simple shrinkage is still relevant for redundant representations? IEEE Trans. Inf. Theory 52 12 2006 5559 5569 (Pubitemid 46445399)
28. I. Daubechies, M. De Friese, and C. De Mol An iterative thresholding algorithm for linear inverse problems with a sparsity constraint Commun. Pure Appl. Math. 57 2004 3601 3608
29. M. Figueiredo, and R. Nowak An EM algorithm for wavelet-based image restoration IEEE Trans. Image Process. 12 8 2003 906 916
30. J. Mairal, M. Elad, and G. Sapiro Sparse representation for color image restoration IEEE Trans. Image Process. 17 1 2008 53 69
31. L. Sendur, and I.W. Selesnick Bivariate shrinkage with local variance estimation IEEE Signal Process. Lett. 9 12 2002 438 441
32. J. Mairal, F. Bach, J. Ponce, and G. Sapiro Online learning for matrix factorization and sparse coding J. Mach. Learn. Res. 11 1 2010 19 60
33. Z.S. He, S.L. Xie, and L.Q. Zhang A note on Lewicki-Sejnowski gradient for learning overcomplete representations Neural Comput. 20 3 2008 636 643
34. M.S. Lewicki, and T.J. Sejnowski Learning overcomplete representations Neural Comput. 12 2000 337 365