Sparse coding from a bayesian perspective

IEEE Transactions on Neural Networks and Learning Systems

Volumn 24, Issue 6, 2013, Pages 929-939

  Lu, Xiaoqiang ^a   Wang, Yulong ^a,b   Yuan, Yuan ^a  

^a XI AN INSTITUTE OF OPTICS AND PRECISION MECHANICS   (China)

^b HUBEI UNIVERSITY   (China)

Author keywords

Bayesian; compressive sensing (CS); computer vision; maximum a posteriori (MAP); sparse coding

Indexed keywords

BAYESIAN; COMPRESSIVE SENSING; CONVERGENCE PROPERTIES; MAXIMUM A POSTERIORI; MAXIMUM A POSTERIORI ESTIMATION; RECONSTRUCTION ERROR; SPARSE CODING; STATE-OF-THE-ART METHODS;

ARTIFICIAL INTELLIGENCE; COMPUTER VISION;

COMPUTER NETWORKS;

EID: 84876133796     PISSN: 2162237X     EISSN: 21622388     Source Type: Journal    
DOI: 10.1109/TNNLS.2013.2245914     Document Type: Article

References (39)

1. S. Abdallah and M. Plumbley, "Unsupervised analysis of polyphonic music by sparse coding," IEEE Trans. Neural Netw., vol. 17, no. 1, pp. 179-196, Jan. 2006. (Pubitemid 43263950)
2. K. Labusch, E. Barth, and T. Martinetz, "Simple method for highperformance digit recognition based on sparse coding," IEEE Trans. Neural Netw., vol. 19, no. 11, pp. 1985-1989, Nov. 2008.
3. Y. Li, A. Cichocki, S. Amari, S. Xie, and C. Guan, "Equivalence probability and sparsity of two sparse solutions in sparse representation," IEEE Trans. Neural Netw., vol. 19, no. 12, pp. 2009-2021, Dec. 2008.
4. E. Elhamifar and R. Vidal, "Robust classification using structured sparse representation," in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., Jun. 2011, pp. 1873-1879.
5. J. Mairal, M. Elad, and G. Sapiro, "Sparse representation for color image restoration," IEEE Trans. Image Process., vol. 17, no. 1, pp. 53-69, Jan. 2008.
6. J. Wright, A. Yang, A. Ganesh, S. Sastry, and Y. Ma, "Robust face recognition via sparse representation," IEEE Trans. Pattern Anal. Mach. Intell., vol. 31, no. 2, pp. 210-227, Feb. 2009.
7. H. Lee, A. Battle, R. Raina, and A. Ng, "Efficient sparse coding algorithms," in Advances Neural Inform Processing Systems, Cambridge, MA, USA: MIT Press, 2007.
8. B. Olshausen and D. Field, "Emergence of simple-cell receptive field properties by learning a sparse code for natural images," Nature, vol. 381, no. 6583, pp. 607-609, 1996. (Pubitemid 26177476)
9. B. Trevor, T. Hadtie, L. Johnstone, and R. Tibshirani, "Least angle regression," Ann. Stat., vol. 32, no. 2, pp. 407-499, 2004. (Pubitemid 41250302)
10. T. Wu and K. Lange, "Coordinate descent algorithms for LASSO penalized regression," Ann. Appl. Stat., vol. 2, no. 1, pp. 224-244, 2008.
11. J. Yang, J. Wright, T. Huang, and Y. Ma, "Image super-resolution via sparse representation," IEEE Trans. Image Process., vol. 19, no. 11, pp. 2861-2873, Nov. 2010.
12. B. Liu, J. Huang, L. Yang, and C. Kulikowsk, "Robust tracking using local sparse appearance model and k-selection," in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., Jun. 2011, pp. 1313-1320.
13. X. Mei and H. Ling, "Robust visual tracking and vehicle classification via sparse representation," IEEE Trans. Pattern Anal. Mach. Intell., vol. 33, no. 11, pp. 2259-2272, Nov. 2011.
14. B. Olshausen and D. Field, "Sparse coding with an over-complete basis set: A strategy employed by VI?," Vis. Res., vol. 37, no. 23, pp. 3311-3325, 1997. (Pubitemid 27493805)
15. S. Bohte, H. Poutre, and J. Kok, "Unsupervised clustering with spiking neurons by sparse temporal coding and multilayer rbf networks," IEEE Trans. Neural Netw., vol. 13, no. 2, pp. 426-435, Mar. 2002. (Pubitemid 34475043)
16. M. Zheng, J. Bu, C. Chen, C. Wang, L. Zhang, G. Qiu, and D. Cai, "Graph regularized sparse coding for image representation," IEEE Trans. Image Process., vol. 20, no. 5, pp. 1327-1336, May 2011.
17. M. Elad and M. Aharon, "Image denoising via sparse and redundant representations over learned dictionaries," IEEE Trans. Image Process., vol. 15, no. 12, pp. 3736-3745, Dec. 2006. (Pubitemid 44811686)
18. M. Aharon, M. Elad, and A. Bruckstein, "K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation," IEEE Trans. Single Process., vol. 54, no. 11, pp. 4311-4322, Nov. 2006. (Pubitemid 44637761)
19. J. Mairal, F. Bach, J. Ponce, G. Sapiro, and A. Zisserman, "Supervised dictionary learning," in Advances in Neural Information Processing Systems, Cambridge, MA, USA: MIT Press, 2009.
20. Z. Xu, X. Chang, F. Xu, and H. Zhang, "L1/2 regularization: A thresholding representation theory and a fast solver," IEEE Trans. Neural Netw. Learn. Syst., vol. 23, no. 7, pp. 1013-1027, Jul. 2012.
21. Y. Liu and Y. Wu, "Variable selection via a combination of the L0 and L1 penalties," J. Comput. Graph. Stat., vol. 16, no. 4, pp. 782-798, 2007.
22. R. Tibshirani, "Regression shrinkage and selection via the LASSO," J. Royal Stat. Soc. Ser. B, vol. 58, no. 1, pp. 267-288, 1996.
23. C. H. Zhang, "Nearly unbiased variable selection under minimax concave penalty," Ann. Stat., vol. 38, no. 2 pp. 894-942, 2010.
24. E. George and R. Mcculloch, "Approaches for bayesian variable selection," Stat. Sinica, vol. 7, pp. 339-374, Jan. 1997. (Pubitemid 127084819)
25. T. J. Yen, "A majorization-minimization approach to variable selection using spike and slab priors," Ann. Stat., vol. 39, no. 3, pp. 1748-1775, 2011.
26. A. Genkin, D. Lewis, and D. Madigan, "Large scale bayesian logistic regression for text categorization," Technometrics, vol. 49, no. 3, pp. 291-304, 2007. (Pubitemid 47292487)
27. R. Ilin, "Unsupervised learning of categorical data with competing models," IEEE Trans. Neural Netw. Learn. Syst., vol. 23, no. 11, pp. 1726-1737, Nov. 2012.
28. B. Gao, W. Woo, and S. Dlay, "Variational regularized 2-d nonnegative matrix factorization," IEEE Trans. Neural Netw. Learn. Syst., vol. 23, no. 5, pp. 703-716, May 2012.
29. M. Seeger, F. Steinke, and K. Tsuda, "Bayesian inference and optimal design in the sparse linear model," J. Mach. Learn. Res., vol. 9, pp. 759-813, 2008.
30. Y. Li and S. Osher, "Coordinate descent optimization for l1 minimization with application to compressed sensing: A greedy algorithm," CAM Rep., Univ. of CA, Los Angeles, USA, 2009.
31. T. Park and G. Casella, "The bayesian LASSO," Tech. Rep., vol. 103, no. 482, pp. 681-686, 2008.
32. M. Tipping, "Sparse bayesian learning and the relevance vector machine," J. Mach. Learn. Res., vol. 1, pp. 211-244, Jan. 2001. (Pubitemid 33687203)
33. M. Lewicki and T. Sejnowski, "Learning overcomplete representations," Neural Comput. vol. 12, no. 2, pp. 337-365, Feb. 2000.
34. J. Mairal, F. Bach, J. Ponce, and G. Sapiro, "Online dictionary learning for sparse coding," in Proc. 26th Annu. Int. Conf. Mach. Learn., 2009, pp. 689-696.
35. K. Labusch, E. Barth, and T. Martinetz, "Robust and fast learning of sparse codes with stochastic gradient descent," IEEE Trans. Sel. Topics Signal Process., vol. 5, no. 5, pp. 1048-1060, Sep. 2011.
36. J. Tropp, "Greed is good: Algorithmic results for sparse approximation," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2231-2242, Oct. 2004.
37. J. Liu, S. Ji, and J. Ye, SLEP: Sparse Learning With Efficient Projections, Glendale, AZ, USA: Arizona Univ. Press, 2009.
38. D. Ross, J. Lim, R. Lin, and M. Yang, "Incremental learning for robust visual tracking," Int. J. Comput. Vis., vol. 77, nos. 1-3, pp. 125-141, May 2008. (Pubitemid 351294740)
39. Q. Zhou, H. Lu, and M. Yang, "Online multiple support instance tracking," in Proc. IEEE Conf. Autom. Face Gesture Recognit., Mar. 2011, pp. 545-552.