Reconstruction of sparse signals via neurodynamic optimization

  • Guocheng Li
  • Zheng YanEmail author
Original Article


It is significant to solve \(l_1\) minimization problems efficiently and reliably in compressed sensing (CS) since the \(l_1\) minimization is essential for the recovery of sparse signals. In view of this, a neurodynamic optimization approach is proposed for solving the \(l_1\)-minimization problems for reconstruction of sparse signals based on a projection neural network (PNN). The proposed neurodynamic optimization approach differs from most \(l_1\)-solvers in that it operates in continuous time rather than being specified by discrete iterations; i.e., it evolves according to deterministic neurodynamics. The proposed PNN is designed based on subgradient projection methods. The neural network has a simple structure, giving it a potential to be implemented as a large-scale analog circuit. It is proved that under appropriate conditions on the measurement matrix, every neuronal state of the proposed neural network is convergent to the optimal solution of the \(l_1\)-minimization problem under study. Simulation results are provided to substantiate the effectiveness of the proposed approach.


Compressive sensing L1 minimization Recurrent neural network 


  1. 1.
    Candes EJ, Romberg J (2007) Sparsity and incoherence in compressive sampling. Inverse Probl 23(3):969–985MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Baraniuk R (2008) Compressive sensing. IEEE Signal Process Mag 25:118–120MathSciNetCrossRefGoogle Scholar
  3. 3.
    Candes EJ, Romberg J, Tao T (2006) Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. Trans IEEE Inf Theory 52(2):489–509MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Lustig M, Donoho D, Pauly J (2007) The application of compressed sensing for rapid MR imaging. Magn Reson Med 58(6):1182CrossRefGoogle Scholar
  5. 5.
    Trzasko J, Manduca A, Trans IEEE (2009) Highly undersampled magnetic resonance image reconstruction via homotopic minimization. Med Imag 28(1):106–121CrossRefGoogle Scholar
  6. 6.
    Duarte M, Davenport M, Tahkar D, Laska J, Ting S, Kelly K, Baraniuk R (2008) Single-pixel imaging via compressive sampling. IEEE Signal Process Mag 25(2):83–91CrossRefGoogle Scholar
  7. 7.
    Natarajan BK (1995) Sparse approximate solutions to liline systems. SIAM J Comput 24:227–234MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Candes EJ, Acad CR (2008) The restricted isometry property and its applications for compressed sensing. C R Acad Sci Paris Ser I 346(9–10):589–592Google Scholar
  9. 9.
    Chen S, Donoho DL, Saunders MA (2001) Atomic decomposition by basis pursuit. SIAM Rev 43(1):129–159MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Kim SJ, Koh K, Lustig M, Boyd S, Corinevsky D (2007) An interior-point method for large-scale l1 regularized least squares. IEEE J Select Topics Signal Process 1(4):606–617CrossRefGoogle Scholar
  11. 11.
    Donoho DL, Tsaig Y (2006) Fast solution of l1-norm minimization problems when the solution may be sparse. Department of Statistics, Stanford University, USA, Tech. repGoogle Scholar
  12. 12.
    Figueiredo M, Nowak R, Wright S, Sel IEEEJ (2007) Gradient projection for sparse reconstruction: application to compressed sensing and other inverse problems. Topics Signal Process 1(4):586–598CrossRefGoogle Scholar
  13. 13.
    Candes EJ (2008) The restricted isometry property and its implications for compressed sensing. Comptes Rendus Acad Sci Ser I 346(9–10):589–592Google Scholar
  14. 14.
    Becker S, Bobin J, Candes EJ (2011) Nesta: a fast and accurate first-order method for sparse recovery. SIAM J Imaging Sci 4(1):1–39MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Yin W, Osher S, Goldfarb D, Darbon J (2008) Bregman iterative algorithms for l1-minimization with applications to compressed sensing. SIAM J Imaging Sci 1(1):143–168MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Berg ED, Friedlander MP (2008) Probing the pareto frontier for basis pursuit solutions. SIAM J Sci Comput 31(2):890–912MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Daubechies I, Defrise M, Mol CD (2004) An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Commun Pure Appl Math 57(11):1413–1457MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Blumensath T, Davies ME (2008) Iterative thresholding for sparse approximations. J Fourier Anal Appl 14(5–6):629–654MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Donoho D, Tsaig Y (2008) Fast solution for l1-norm minimization problems when the solution may be sparse. Trans IEEE Inf Theory 54(11):4789–4812CrossRefzbMATHGoogle Scholar
  20. 20.
    Hopfield JJ (1982) Neural networks and physical systems with emergent collective computational abilities. In: Proc Nat Acad SciGoogle Scholar
  21. 21.
    Cichocki A, Unbehauen R (1993) Neural networks for optimization and signal processing. Wiley, New YorkzbMATHGoogle Scholar
  22. 22.
    Twigg C, Hasler P (2009) Configurable analog signal processing. Digital Signal Process 19(6):904–922CrossRefGoogle Scholar
  23. 23.
    Rozell CJ, Johnson DH, Baraniuk RG, Olshausen BA (2008) Sparse coding via thresholding and local competition in neural circuits. Neural Comput 20(10):2526–2563MathSciNetCrossRefGoogle Scholar
  24. 24.
    Guo ZS, Wang J (2010) A neurodynamical optimization approach to constrained sparsity maximization based on alternative objective functions. In: Proceedings of International Joint Conference on Neural NetworksGoogle Scholar
  25. 25.
    Liu Q, Wang J (2009) A one-layer recurrent neural network for nonsmooth convex optimization subject to linear equality constraints. In: Proc Int Conf Neural Inf, ProcessGoogle Scholar
  26. 26.
    Guo Z, Liu Q, Wang J (2011) A one-layer recurrent neural network for pseudoconvex optimization with linear equality constraints. IEEE Trans Neural Netw 22(12):1892–1900CrossRefGoogle Scholar
  27. 27.
    Filippov A (1988) Differential equations with discontinuous right-hand side. Kluwer Academic, DordrechtCrossRefzbMATHGoogle Scholar
  28. 28.
    Aubin J, Cellina A (1984) Differential inclusions. Springer-Verlag, BerlinCrossRefzbMATHGoogle Scholar
  29. 29.
    Clarke F (1969) Optimization and non-smooth analysis. Wiley, New YorkGoogle Scholar
  30. 30.
    Pardalos P (2008) Nonconvex optimization and its application. Berlin HeidelbergGoogle Scholar
  31. 31.
    Cambini A, Martein L (2009) Generalized convexity and optimization: theory and applications. Springer-Verlag, Berlin HeidelbergzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2017

Authors and Affiliations

  1. 1.Department of MathematicsBeijing Information Science and Technology UniversityBeijingChina
  2. 2.Faculty of Engineering and Information TechnologyUniversity of Technology SydneySydneyAustralia

Personalised recommendations