Fast kernel sparse representation

Proceedings - 2011 International Conference on Digital Image Computing: Techniques and Applications, DICTA 2011

Volumn , Issue , 2011, Pages 72-77

  Li, Hanxi ^a,b,c   Gao, Yongsheng ^a,b   Sun, Jun ^a,c  

^a CSIRO   (Australia)

^b GRIFFITH UNIVERSITY   (Australia)

^c AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

Kernel trick; Orthogonal Matching Pursuit; Sparse Representation

Indexed keywords

EFFICIENT ALGORITHM; HIGH-DIMENSIONAL; INNER PRODUCT; KERNEL TRICK; LOSS OF ACCURACY; NON-ITERATIVE; ONE STEP; ORTHOGONAL MATCHING PURSUIT; SINGLE-STEP; SPARSE REPRESENTATION;

ALGORITHMS;

EID: 84863078673     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DICTA.2011.20     Document Type: Conference Paper

References (23)

1. C. Wang, S. Yan, L. Zhang, and H.J. Zhang, "Multilabel sparse coding for automatic image annotation," in Proc. IEEE Conf. Comp. Vis. Patt. Recogn., 2009, pp. 1643-1650.
2. 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, 2006. (Pubitemid 44811686)
3. J. Mairal, M. Elad, and G. Sapiro, "Sparse representation for color image restoration," IEEE Trans. Image Process., vol. 17, no. 1, pp. 53-69, 2008.
4. J. Wright, A.Y. Yang, A. Ganesh, S.S. Sastry, and Y. Ma, "Robust face recognition via sparse representation," IEEE Trans. Pattern Anal. Mach. Intell., vol. 31, pp. 210-227, 2009.
5. J. Yang, K. Yu, Y. Gong, and T. Huang, "Linear spatial pyramid matching using sparse coding for image classification," Proc. IEEE Conf. Comp. Vis. Patt. Recogn., pp. 1794-1801, 2009.
6. S. Gao, I. Tsang, and L.T. Chia, "Kernel sparse representation for image classification and face recognition," Proc. Eur. Conf. Comp. Vis., pp. 1-14, 2010.
7. J. Shawe-Taylor and N. Cristianini, Kernel methods for pattern analysis, Cambridge Univ Press, 2004.
8. 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, 1999.
9. H. Lee, A. Battle, R. Raina, and A.Y. Ng, "Efficient sparse coding algorithms," Proc. Adv. Neural Inf. Process. Syst., vol. 19, pp. 801, 2007.
10. Y. C. Pati, R. Rezaiifar, Y. C. Pati R. Rezaiifar, and P. S. Krishnaprasad, "Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition," in Proceedings of the 27 th Annual Asilomar Conference on Signals, Systems, and Computers, 1993, pp. 40-44.
11. J. A. Tropp and A. C. Gilbert, "Signal recovery from random measurements via orthogonal matching pursuit," IEEE Trans. Inf. Theory, vol. 53, pp. 4655-4666, 2007.
12. Q. Shi, H. Li, and C. Shen, "Rapid face recognition using hashing," Proc. IEEE Conf. Comp. Vis. Patt. Recogn., pp. 2753-2760, 2010.
13. M. Aharon, M. Elad, and A. Bruckstein, "k-svd: An algorithm for designing overcomplete dictionaries for sparse representation," IEEE Trans. Signal Process., vol. 54, no. 11, pp. 4311-4322, 2006. (Pubitemid 44637761)
14. E. Candès, J. Romberg, and T. Tao, "Stable signal recovery from incomplete and inaccurate measurements," Communications on Pure and Applied Mathematics, vol. 59, pp. 1207-1223, 2006. (Pubitemid 43988295)
15. S. Mallat and Z. Zhang, "Matching pursuit with time-frequency dictionaries," IEEE Trans. Signal Process., vol. 41, pp. 3397-3415, 1993.
16. G. Davis, S. Mallat, and Z. Zhang, "Adaptive time-frequency decompositions with matching pursuits," Optical Eng., vol. 33, 1994.
17. P. Vincent and Y. Bengio, "Kernel matching pursuit," Mach. Learn., vol. 48, no. 1, pp. 165-187, 2002.
18. F.R. Bach, "Consistency of the group lasso and multiple kernel learning," J. Mach. Learn. Res., vol. 9, pp. 1179-1225, 2008.
19. J. Huang, T. Zhang, and D. Metaxas, "Learning with structured sparsity," in Proc. Int. Conf. Mach. Learn., 2009, pp. 417-424.
20. J. Huang and T. Zhang, "The benefit of group sparsity," Arxiv preprint arXiv:0901.2962, 2009.
21. I. Naseem, R. Togneri, and M. Bennamoun, "Linear regression for face recognition," IEEE Trans. Pattern Anal. Mach. Intell., pp. 2106-2112, 2010.
22. M. Grant and S. Boyd, "Cvx: Matlab software for disciplined convex programming," Available httpstanford edu boydcvx, 2008.
23. K.C. Lee, J. Ho, and D. Kriegman, "Acquiring linear subspaces for face recognition under variable lighting," IEEE Trans. Pattern Anal. Mach. Intell., vol. 27, no. 5, pp. 684-698, 2005. (Pubitemid 40608402)