Structured sparse coding for classification via reweighted ℓ2,1 minimization

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In recent years, sparse coding has been used in a wide range of applications including classification and recognition. Different from many other applications, the sparsity pattern of features in many classification tasks are structured and constrained in some feasible domain. In this paper, we proposed a re-weighted ℓ2,1 norm based structured sparse coding method to exploit such structures in the context of classification and recognition. In the proposed method, the dictionary is learned by imposing the class-specific structured sparsity on the sparse codes associated with each category, which can bring noticeable improvement on the discriminability of sparse codes. An alternating iterative algorithm is presented for the proposed sparse coding scheme. We evaluated our method by applying it to several image classification tasks. The experiments showed the improvement of the proposed structured sparse coding method over several existing discriminative sparse coding methods on tested data sets.

Cite

CITATION STYLE

APA

Xu, Y., Sun, Y., Quan, Y., & Luo, Y. (2015). Structured sparse coding for classification via reweighted ℓ2,1 minimization. In Communications in Computer and Information Science (Vol. 546, pp. 189–199). Springer Verlag. https://doi.org/10.1007/978-3-662-48558-3_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free