Algorithms on Sparse Representation

  • Authors

    • D. Khalandar Basha
    • T. Venkateswarlu
    2018-12-09
    https://doi.org/10.14419/ijet.v7i4.36.24139
  • Sparse representation, image restoration, regularization, pursuit algorithm, greedy algorithm, relaxation algorithm

  • Abstract

    Representation of signals and images in sparse become more interesting for various applications like restoration, compression and recognition. Many researches carried out in the era of sparse representation. Sparse represents signal or image as a few elements from the dictionary atoms. There are various algorithms proposed by researchers for learning dictionary. This paper discuss some of the terms related to sparse like regularization term, minimization, minimization,  minimizationfollowed by the pursuit algorithms for solving  problem, greedy algorithms and relaxation algorithms. This paper gives algorithmic approaches for the algorithms.

     

     

  • References

    1. [1] Elad M, Sparse and redundant representations: from theory to applications in signal and image processing, Springer Science & Business Media, (2010).

      [2] Tibshirani R, “Regression shrinkage and selection via the lassoâ€, Journal of the Royal Statistical Society. Series B (Methodological), (1996), pp.267-288.

      [3] Efron B, Hastie T, Johnstone I & Tibshirani R, “Least angle regressionâ€, The Annals of statistics, Vol.32, No.2, (2004), pp.407-499.

      [4] Yang J & Zhang Y, “Alternating direction algorithms for ell_1-problems in compressive sensingâ€, SIAM journal on scientific computing, Vol.33, No.1, (2011), pp.250-278.

      [5] Schmidt M, Fung G & Rosales R, “Fast optimization methods for l1 regularization: A comparative study and two new approachesâ€, European Conference on Machine Learning, (2007), pp.286-297.

      [6] Naseem I, Togneri R & Bennamoun M, “Linear regression for face recognitionâ€, IEEE transactions on pattern analysis and machine intelligence, Vol.32, No.11, (2010), pp.2106-2112.

      [7] Zhang L, Yang M & Feng X, Sparse representation or collaborative representation: Which helps face recognition?. IEEE international conference on Computer vision (ICCV), (2011), pp.471-478.

      [8] Xu Y, Zhang D, Yang J & Yang JY, “A two-phase test sample sparse representation method for use with face recognitionâ€, IEEE Transactions on Circuits and Systems for Video Technology, Vol.21, No.9, (2011), pp.1255-1262.

      [9] Chen SS, Donoho DL & Saunders MA, “Atomic decomposition by basis pursuitâ€, SIAM Journal on Scientific Computing, Vol.20, No.1, (1998), pp.33-61.

      [10] Wright J, Yang AY, Ganesh A, Sastry SS & Ma Y, “Robust face recognition via sparse representationâ€, IEEE transactions on pattern analysis and machine intelligence, Vol.31, No.2, (2009), pp.210-227.

      [11] Donoho DL, “For most large underdetermined systems of linear equations the minimal ð“1â€norm solution is also the sparsest solutionâ€, Communications on Pure and Applied Mathematics: A Journal Issued by the Courant Institute of Mathematical Sciences, Vol.59, No.6, (2006), pp.797-829.

      [12] Tropp JA, Gilbert AC & Strauss MJ, “Algorithms for simultaneous sparse approximation Part I: Greedy pursuitâ€, Signal Processing, Vol.86, No.3, (2006), pp.572-588.

      [13] Mallat SG & Zhang Z, “Matching pursuits with time-frequency dictionariesâ€, IEEE Transactions on Signal Processing, Vol.41, (1993), pp.3397–3415.

      [14] Pati YC, Rezaiifar R & Krishnaprasad PS, “Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decompositionâ€, IEEE Twenty-Seventh Asilomar Conference on Signals, Systems and Computers, (1993), pp. 40-44.

      [15] Davis G, Mallat S & Avellaneda M, “Adaptive greedy approximationsâ€, Constructive approximation, Vol.13, No.1, (1997), pp.57-98.

      [16] Tropp JA & Gilbert AC, “Signal recovery from random measurements via orthogonal matching pursuitâ€, IEEE Transactions on information theory, Vol.53, No.12, (2007), pp.4655-4666.

      [17] Needell D & Vershynin R, “Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuitâ€, Foundations of computational mathematics, Vol.9, No.3, (2009), pp.317-334.

  • Downloads

  • How to Cite

    Khalandar Basha, D., & Venkateswarlu, T. (2018). Algorithms on Sparse Representation. International Journal of Engineering & Technology, 7(4.36), 569-573. https://doi.org/10.14419/ijet.v7i4.36.24139

    Received date: 2018-12-16

    Accepted date: 2018-12-16

    Published date: 2018-12-09