Skip to main content

Orthogonal and Smooth Subspace Based on Sparse Coding for Image Classification

  • Conference paper
  • First Online:
Advances in Multimedia Information Processing -- PCM 2015 (PCM 2015)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9315))

Included in the following conference series:

  • 1794 Accesses

Abstract

Many real-world problems usually deal with high-dimensional data, such as images, videos, text, web documents and so on. In fact, the classification algorithms used to process these high-dimensional data often suffer from the low accuracy and high computational complexity. Therefore, we propose a framework of transforming images from a high-dimensional image space to a low-dimensional target image space, based on learning an orthogonal smooth subspace for the SIFT sparse codes (SC-OSS). It is a two stage framework for subspace learning. Firstly, a sparse coding followed by spatial pyramid max pooling is used to get the image representation. Then, the image descriptor is mapped into an orthonormal and smooth subspace to classify images in low dimension. The proposed algorithm adds the orthogonality and a Laplacian smoothing penalty to constrain the projective function coefficient to be orthogonal and spatially smooth. The experimental results on the public datasets have shown that the proposed algorithm outperforms other subspace methods.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Lowe, D.G.: Distinctive image features from scale-invariant keypoints. Int. J. Comput. Vis. 60(2), 91–110 (2004)

    Article  Google Scholar 

  2. Bai, E.: Big data: The curse of dimensionality in modeling. In: Control Conference, pp.6–13. IEEE press, Chinese (2014)

    Google Scholar 

  3. Lou, X., Huang, D., Fan, L., et al.: An image classification algorithm based on bag of visual words and multi-kernel learning. J. Multimedia 9(2), 269–277 (2014)

    Article  Google Scholar 

  4. Lazebnik, S., Schmid, C., Ponce, J.: Beyond bags of features: spatial pyramid matching for recognizing natural scene categories. IEEE Comput. Soc. Conf. Comput. Vis. Pattern Recogn. 2, 2169–2178 (2006)

    Google Scholar 

  5. Yang, J., Yu, K., Gong, Y., et al.: Linear spatial pyramid matching using sparse coding for image classification. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 1794–1801 (2009)

    Google Scholar 

  6. Yan, Y., Zhang, Y.: Discriminant projection embedding for face and palmprint recognition. Neurocomputing 17, 3534–3543 (2008)

    Article  Google Scholar 

  7. Zhou, J., Jin, Z., Yang, J.: Multiscale saliency detection using principle component analysis. In: The 2012 International Joint Conference on Neural Networks (IJCNN), pp. 1–6. IEEE press, Brisbane (2012)

    Google Scholar 

  8. Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification, 2nd edn. Wiley-Inter science, Hoboken, NJ (2000)

    MATH  Google Scholar 

  9. Hou, C., Nie, F., Zhang, C., et al.: Learning an orthogonal and smooth subspace for image classification. Signal Process. Lett. 16(4), 303–306 (2009). IEEE press

    Article  Google Scholar 

  10. Lee, H., Battle, A., Raina, R., et al.: Efficient sparse coding algorithms. In: Advances in neural information processing systems, pp.801–808 (2006)

    Google Scholar 

  11. Liu, F., Liu, X.: Locality enhanced spectral embedding and spatially smooth spectral regression for face recognition. In: Information and Automation, pp.299–303. IEEE press, Shenyang (2012)

    Google Scholar 

  12. Ye, J.: Characterization of a family of algorithms for generalized discriminant analysis on undersampled problems. J. Mach. Learn. Res. 6, 483–502 (2005)

    MathSciNet  MATH  Google Scholar 

  13. Serre, T., Wolf, L., Poggio, T.: Object recognition with features inspired by visual cortex. Comput. Vis. Pattern Recogn. 2, 994–1000 (2005)

    Google Scholar 

  14. Wang, J., Yang, J., Yu, K., et al.: Locality-constrained linear coding for image classification. In: IEEE Conference on Computer Vision and Pattern Recognition, pp.3360–3367 (2010)

    Google Scholar 

Download references

Acknowledgement

This paper was supported in part by National Natural Science Foundation of China (61210006, 61100141), Program for Changjiang Scholars and Innovative Research Team in University (IRT201206), the Fundamental Research Funds for the Central Universities of China (2013JBM021).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yao Zhao .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Dai, F., Zhao, Y., Chang, D., Lin, C. (2015). Orthogonal and Smooth Subspace Based on Sparse Coding for Image Classification. In: Ho, YS., Sang, J., Ro, Y., Kim, J., Wu, F. (eds) Advances in Multimedia Information Processing -- PCM 2015. PCM 2015. Lecture Notes in Computer Science(), vol 9315. Springer, Cham. https://doi.org/10.1007/978-3-319-24078-7_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-24078-7_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-24077-0

  • Online ISBN: 978-3-319-24078-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics