Abstract
The scarcity of labeled data and the high-dimensionality of multimedia data are the major obstacles for image classification. Due to these concerns, this paper proposes a novel algorithm, Iterative Semi-supervised Sparse Coding (ISSC), which jointly explores the advantages of both sparse coding and graph-based semi-supervised learning in order to learn discriminative sparse codes as well as an effective classification function. The ISSC algorithm fully exploits initial labels and the subsequently predicted labels for sparse codes learning. At the same time, during the graph-based semi-supervised learning stage, similarity matrix is firstly adjusted through the latest learned sparse codes, and then is utilized to obtain a better classification function. To make the ISSC scale up to larger databases, a novel online dictionary learning algorithm is also proposed to update the dictionary incrementally. In particular, by solving quadratic optimization, the ISSC approach can give rise to closed-form solutions for sparse codes and classification function, respectively. It has been extensively evaluated over three widely used datasets for image classification task. The experimental results in terms of classification accuracy demonstrate the proposed ISSC approach can achieve significant performance improvements with respect to the state-of-the-arts.
Similar content being viewed by others
References
Belkin, M., Niyogi, P., Sindhwani, V. (2006). Manifold regularization: a geometric framework for learning from labeled and unlabeled examples. Journal of Machine Learning Research, 7, 2399–2434.
Bo, L., & Sminchisescu, C. (2009). Efficient match kernel between sets of features for visual recognition. In NIPS (pp. 135–143). Curran Associates Inc.
Cheng, H., Liu, Z., Yang, J. (2009). Sparsity induced similarity measure for label propagation. In ICCV (pp. 317–324). IEEE.
Gao, S., Tsang, I., Chia, L.T. (2013). Sparse representation with kernels. IEEE Transactions on Image Processing, 22 (2), 423–434.
Gao, S., Tsang, I.W.H., Chia, L.T. (2013). Laplacian sparse coding, hypergraph laplacian sparse coding, and applications. IEEE Transactions Pattern Analysis Machine Intelligence, 35 (1), 92–104.
Griffin, G., Holub, A., Perona, P. (2007). Caltech-256 object category dataset. Technical report 7694, California Institute of Technology.
Gupta, M.D., & Xiao, J. (2011). Non-negative matrix factorization as a feature selection tool for maximum margin classifiers. In IEEE conference on computer vision and pattern recognition (pp. 2841–2848). Los Alamitos: IEEE Computer Society.
Hughes, J.M., Graham, D.J., Rockmore, D.N. (2010). Quantification of artistic style through sparse coding analysis in the drawings of Pieter Bruegel the Elder. Proceedings of the National Academy of Sciences, 107 (4), 1279–1283.
Jiang, W., Chang, S.F., Jebara, T., Loui, A.C. (2008). Semantic concept classification by joint semi-supervised learning of feature subspaces and support vector machines. In D. A. Forsyth, P. H. S. Torr, A. Zisserman (Eds.), ECCV 2008, lecture notes in computer science (Vol. 5305, pp. 270–283). Berlin Heidelberg: Springer.
Joachims, T. (2003). Transductive learning via spectral graph partitioning. In Proceedings of the twentieth international conference on machine learning (pp. 290–297). AAAI Press.
Lazebnik, S., Schmid, C., Ponce, J. (2006). Beyond bags of features: Spatial pyramid matching for recognizing natural scene categories. In Proceedings of the 2006 IEEE computer society conference on computer vision and pattern recognition (Vol. 2, pp. 2169–2178). Washington, DC: IEEE Computer Society.
Lee, H., Battle, A., Raina, R., Ng, A.Y. (2006). Efficient sparse coding algorithms. In Advances in neural information processing systems 19, proceedings of the twentieth annual conference on neural information processing systems, Vancouver, British Columbia, Canada, December 4-7, 2006 (pp. 801–808). MIT Press.
Li, L.J., & Li, F.F. (2007). What, where and who? classifying events by scene and object recognition. In: ICCV’07 (pp. 1–8).
Lowe, D.G. (2004). Distinctive image features from scale-invariant keypoints. International Journal of Computer Vision, 60 (2), 91–110.
Lu, Z., & Ip, H.H.S. (2011). Automatic image annotation based on generalized relevance models. Journal of Signal Processing Systems, 65 (1), 23–33.
Lu, Z., & Peng, Y. (2011). Latent semantic learning by efficient sparse coding with hypergraph regularization. In AAAI. AAAI Press.
Luo, B., & Chanussot, J. (2011). Supervised hyperspectral image classification based on spectral unmixing and geometrical features. Journal of Signal Processing Systems, 65 (3), 457–468.
Mairal, J., Bach, F., Ponce, J., Sapiro, G. (2009). Online dictionary learning for sparse coding. In Proceedings of the 26th annual international conference on machine learning (pp. 689–696). New York: ACM.
Mairal, J., Bach, F., Ponce, J., Sapiro, G., Zisserman, A. (2008). Supervised dictionary learning. In NIPS’08 (pp. 1033–1040).
Mairal, J., Bach, F., Ponce, J., Sapiro, G., Zisserman, A. (2009). Non-local sparse models for image restoration. In ICCV (pp. 2272–2279). IEEE.
Mairal, J., Elad, M., Sapiro, G. (2008). Sparse representation for color image restoration. Transactions Image Process, 17 (1), 53–69.
Maji, S., & Berg, A. (2009). Max-margin additive classifiers for detection. In IEEE 12th international conference on computer vision (pp. 40–47).
Ramamurthy, K.N., Thiagarajan, J.J., Sattigeri, P. (2012). Learning dictionaries with graph embedding constraints. In IEEE Asilomar (pp. 1974–1978).
Wang, F., & Zhang, C. (2006). Label propagation through linear neighborhoods. In Proceedings of the 23rd international conference on Machine learning (pp. 985–992). New York: ACM.
Wang, J., Jebara, T., fu Chang, S. (2008). Graph transduction via alternating minimization. In Proceedings of international conference on machine learning (Vol. 307, pp. 1144–1151). ACM.
Wang, J., Yang, J., Yu, K., Lv, F., Huang, T.S., Gong, Y. (2010). Locality-constrained linear coding for image classification. In The twenty-third IEEE conference on computer vision and pattern recognition, San Francisco, CA, USA, 13-18 June 2010 (pp. 3360–3367). IEEE.
Wu, J., & Rehg, J. (2009). Beyond the euclidean distance: creating effective visual codebooks using the histogram intersection kernel. In IEEE 12th international conference on computer vision (pp. 630–637).
Yang, J., Yu, K., Gong, Y., Huang, T.S. (2009). Linear spatial pyramid matching using sparse coding for image classification. In Computer vision and pattern recognition (pp. 1794–1801).
Zheng, H., Ip, H.H.S., Tao, L. (2012). Adjacency matrix construction using sparse coding for label propagation. In ECCV workshops on higher-order models and global constraints in computer vision, lecture notes in computer science (Vol. 7585, pp. 315–323). Springer.
Zheng, M., Bu, J., Chen, C., Wang, C., Zhang, L., Qiu, G., Cai, D. (2011). Graph regularized sparse coding for image representation. IEEE Transactions on Image Processing, 20 (5), 1327–1336.
Zhou, D., Bousquet, O., Lal, T.N., Weston, J., Schölkopf, B. (2003). Learning with local and global consistency. In Advances in neural information processing systems (Vol. 16). MIT Press.
Zhu, X., Ghahramani, Z., Lafferty, J. (2003). Semi-supervised learning using Gaussian fields and harmonic functions. In Proceedings of the twentieth international conference on machine learning (pp. 912–919).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zheng, H., Ip, H.H.S. Iterative Semi-Supervised Sparse Coding Model for Image Classification. J Sign Process Syst 81, 99–110 (2015). https://doi.org/10.1007/s11265-014-0907-y
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11265-014-0907-y