Skip to main content
Log in

Robust classifier using distance-based representation with square weights

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

This paper presents a new multi-class classification method that is different from sparse representation classifier (SRC) method. SRC is a classical method which has been widely used for face recognition and digit identification. However, SRC method only looks for the sparsest solution using \(l_1\) norm minimization with high computation complexity. The sparsest representation cannot show the space distribution feature of samples. Moreover, the sparsest representation does not mean obtaining the highest recognition rate for data classification. This paper proposes a distance-based representation method for classification. The distance between samples is used to measure the similarity. It is crucial that square weights \(x_i^2\) are used as the weight of distance instead of \(x_i\). Furthermore, a closed form solution is obtained so that the computation complexity is lower than that of SRC. The extensive experiments show that the proposed method achieves very competitive classification results.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  • Adler A, Elad M, Hel-Or Y (2011) Fast subspace clustering via sparse representations. Rep , Department of Computer Science, Technion, Tech

  • Aharon M, Elad M, Bruckstein A (2006) K-svd: an algorithm for designing overcomplete dictionaries for sparse representation. Signal Processing, IEEE Transactions on 54(11):4311–4322

    Article  Google Scholar 

  • Bruckstein AM, Donoho DL, Elad M (2009) From sparse solutions of systems of equations to sparse modeling of signals and images. SIAM review 51(1):34–81

    Article  MATH  MathSciNet  Google Scholar 

  • Chen S, Donoho D (1994) Basis pursuit. In Signals, Systems and Computers, 1994. 1994 Conference Record of the Twenty-Eighth Asilomar Conference on, volume 1, pages 41–44

  • Cheng B, Yang J, Yan S, Fu Y, Huang TS (2010) Learning with l1-graph for image analysis. Image Processing, IEEE Transactions on 19(4):858–866

    Article  MathSciNet  Google Scholar 

  • Chi Y, Porikli F (2012) Connecting the dots in multi-class classification: From nearest subspace to collaborative representation. In Computer Vision and Pattern Recognition (CVPR), 2012 IEEE Conference on, pages 3602–3609

  • Cotter SF (2010) Sparse representation for accurate classification of corrupted and occluded facial expressions. In Acoustics Speech and Signal Processing (ICASSP), 2010 IEEE International Conference on, pages 838–841

  • Elad M, Aharon M (2006) Image denoising via sparse and redundant representations over learned dictionaries. Image Processing, IEEE Transactions on 15(12):3736–3745

    Article  MathSciNet  Google Scholar 

  • Elhamifar E, Vidal R (2011) Robust classification using structured sparse representation. In Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on, pages 1873–1879

  • Elhamifar E, Vidal R (2011) Sparse manifold clustering and embedding. Advances in Neural Information Processing Systems 24:55–63

    Google Scholar 

  • Elhamifar E, Vidal R (2012) Block-sparse recovery via convex optimization. Signal Processing, IEEE Transactions on 60(8):4094–4107

    Article  MathSciNet  Google Scholar 

  • Elhamifar E, Vidal R (2012), Sparse subspace clustering: Algorithm, theory, and applications. arXiv, preprint arXiv:1203.1005

  • Fuchs JJ (2005) Recovery of exact sparse representations in the presence of bounded noise. Information Theory, IEEE Transactions on 51(10):3601–3608

    Article  MATH  Google Scholar 

  • Guha T, Ward RK (2012) Learning sparse representations for human action recognition. Pattern Analysis and Machine Intelligence, IEEE Transactions on 34(8):1576–1588

    Article  Google Scholar 

  • Hamidzadeh J, Monseft R, Yazdi HS (2012) DDC: distance-based decision classifier. Neural Computing and Applications 21(7):1697–1707

    Article  Google Scholar 

  • Ji Y, Lin T, Zha H (2009) Mahalanobis distance based non-negative sparse representation for face recognition. In Machine Learning and Applications, 2009. ICMLA’09. International Conference on, pages 41–46

  • Liu Z, Hsiao W, Cantarel BL, Drabek EF, Liggett CF (2011) Sparse distance-based learning for simultaneous multiclass classification and feature selection of metagenomic data. Bioinformatics 27(23):3242–3249

    Article  Google Scholar 

  • Lv JC, Tan KK, Zhang Y, Huang S (2010) A family of fuzzy learning algorithms for robust principal component analysis neural networks. Fuzzy Systems, IEEE Transactions on 18(1):217–226

    Article  Google Scholar 

  • Lv JC, Tan KK, Zhang Y, Huang S (2009) Convergence Analysis of a Class of HyvÄrinen-Oja’s ICA Learning Algorithms With Constant Learning Rates. Signal Processing, IEEE Transactions on 57(5):1811–1824

    Article  Google Scholar 

  • Lv JC, Zhang Y, Tan KK (2006) Global convergence of Oja’s PCA learning algorithm with a non-zero-approaching adaptive learning rate. Theoretical computer science 367(3):286–307

    Article  MATH  MathSciNet  Google Scholar 

  • Lv JC, Zhang Y, Zhou J (2010) Subspace learning of neural networks. CRC Press Inc.

  • Mairal J, Bach, Ponce J, Sapiro G (2009) Online dictionary learning for sparse coding. In Proceedings of the 26th Annual International Conference on Machine Learning, pages 689–696

  • Pati YC, Rezaiifar R, Krishnaprasad P (1993) Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition. In Signals, Systems and Computers, 1993. 1993 Conference Record of The Twenty-Seventh Asilomar Conference on, pages 40–44

  • Roweis ST, Saul LK (2000) Nonlinear dimensionality reduction by locally linear embedding. Science 290(5500):2323–2326

    Article  Google Scholar 

  • Saul LK, Roweis ST (2003) Think globally, fit locally: unsupervised learning of low dimensional manifolds. The Journal of Machine Learning Research 4:119–155

    MathSciNet  Google Scholar 

  • Soltanolkotabi M, Elhamifar E, Candes EJ (2013), Robust Subspace Clustering. arXiv, preprint arXiv:1301.2603

  • Stojnic M, Parvaresh F, Hassibi B (2009) On the reconstruction of block-sparse signals with an optimal number of measurements. Signal Processing, IEEE Transactions on 57(8):3075–3085

    Article  MathSciNet  Google Scholar 

  • Tropp JA (2004) Greed is good: Algorithmic results for sparse approximation. Information Theory, IEEE Transactions on 50(10):2231–2242

    Article  MATH  MathSciNet  Google Scholar 

  • Wright J, Ma Y, Mairal J, Sapiro G, Huang TS, Yan S (2010) Sparse representation for computer vision and pattern recognition. Proceedings of the IEEE 98(6):1031–1044

    Article  Google Scholar 

  • Wright J, Yang AY, Ganesh A, Sastry SS, Ma Y (2009) Robust face recognition via sparse representation. Pattern Analysis and Machine Intelligence, IEEE Transactions on 31(2):210–227

    Article  Google Scholar 

  • Zhang L, Yang M, Feng X (2011) Sparse representation or collaborative representation: Which helps face recognition? In Computer Vision (ICCV), 2011 IEEE International Conference on, pages 471–478

Download references

Acknowledgments

This work was supported by Specialized Research Fund for the Doctoral Program of Higher Education under Grant 2010081110053 and National Program on Key Basic Research Project (973 Program) under Grant 2011CB302201, partially supported by National Science Foundation of China under grant 61375065.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jian Cheng Lv.

Additional information

Communicated by A. Castiglione.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wei, J., Lv, J.C. & Yi, Z. Robust classifier using distance-based representation with square weights. Soft Comput 19, 507–515 (2015). https://doi.org/10.1007/s00500-014-1272-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-014-1272-2

Keywords

Navigation