Skip to main content
Log in

A New Algorithm Based on Linearized Bregman Iteration with Generalized Inverse for Compressed Sensing

  • Published:
Circuits, Systems, and Signal Processing Aims and scope Submit manuscript

Abstract

This paper aims to solve the basis pursuit problem \(\min_{u\in\mathbb{R}^{n}}\{\|u\|_{1}: Au=f\}\) in compressed sensing when A is any matrix, there are two contributions in this paper. First, we provide a simplified iterative formula that combines original linearized Bregman iteration together with a soft threshold and iterative formula for generalized inverse of matrix \(A\in\mathbb{R}^{m\times n}\). Furthermore, we also discuss its convergence. Compared to the original linearized Bregman method, the proposed simplified iterative scheme possesses obvious advantage. The workload and computing time are greatly reduced, when mn and \(\operatorname{rank}(A)\ll m\), especially. But the requirement of high accuracy cannot be achieved. So, we need to select the proper number of inner loop to achieve the goal of balancing the workload and the accuracy of the simplified iterative formula. Second, we propose a new chaotic iterative algorithm based on the simplified iteration. Under the same iterations, the computing time of the simplified iteration with q=1 (q is the number of inner loops) is almost the same as that of the chaotic method, but the precision of the latter is better than that of the former because it utilized more information; and the accuracy of the chaotic method achieves that of A linearized Bregman iteration, while the computing time of the former is less than one half of the latter. In conclusion, the calculating efficiency of our two methods as regards A iteration is improved, and specially the chaotic iteration is more competitive. Numerical results on compressed sensing are presented that demonstrate that our methods can be significantly more effective than the original linearized Bregman iterations, even when matrix A is ill-conditioned.

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.

Institutional subscriptions

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

Similar content being viewed by others

References

  1. J. Cai, S. Osher, Z. Shen, Linearized Bregman iterations for compressed sensing. Math. Comput. 78(267), 1515–1536 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  2. J. Cai, S. Osher, Z. Shen, Convergence of the linearized Bregman iteration for l 1-norm minimization. Math. Comput. 78(268), 2127–2136 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  3. J. Cai, S. Osher, Z. Shen, Linearized Bregman iterations for frame-based image deblurring. SIAM J. Imaging Sci. 2(1), 226–252 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  4. E. Candés, J. Romberg, Quantitative robust uncertainty principles and optimally sparse decompositions. Found. Comput. Math. 6(2), 227–254 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  5. E. Candés, J. Romberg, T. Tao, Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory 52(2), 489–509 (2006)

    Article  MATH  Google Scholar 

  6. S. Chen, D. Donoho, M. Saunders, Atomic decomposition by basis pursuit. SIAM J. Sci. Comput. 20(1), 33–61 (1998)

    Article  MathSciNet  Google Scholar 

  7. D. Donoho, Compressed sensing. IEEE Trans. Inf. Theory 52(4), 1289–1306 (2006)

    Article  MathSciNet  Google Scholar 

  8. H. Gao, Z. Zuo, An adaptive non-local total variation blind deconvolution employing split Bregman iteration. Circuits Syst. Signal Process. 32(5), 2407–2421 (2013)

    Article  MathSciNet  Google Scholar 

  9. Y. Ji, Z. Yang, W. Li, Bayesian sparse reconstruction method of compressed sensing in the presence of impulsive noise. Circuits Syst. Signal Process. 32(6), 2971–2998 (2013)

    Article  MathSciNet  Google Scholar 

  10. M. Lai, W. Yin, Augmented l1 and nuclear-norm models with a globally linearly convergent algorithm. SIAM J. Imaging Sci. 6(2), 1059–1091 (2012)

    Article  MathSciNet  Google Scholar 

  11. W. Li, Z. Li, A family of iterative methods for computing the approximate inverse of a square matrix and inner inverse of a non-square matrix. Appl. Math. Comput. 215(9), 3433–3442 (2012)

    Article  Google Scholar 

  12. S. Osher, Y. Mao, B. Dong, W. Yin, Fast linearized Bregman iteration for compressive sensing and sparse denoising. UCLA-CAM-Report 08-37 (2008)

  13. Y. Tsaig, D. Donono, Extensions of compressed sensing. Signal Process. 86(3), 549–571 (2006)

    Article  MATH  Google Scholar 

  14. S. Wang, Z. Yang, Generalized Inverse Matrix and Its Applications (Beijing University of Technology Press, Beijing, 1996), pp. 195–209

    Google Scholar 

  15. G. Wang, Y. Wei, S. Qiao, Generalized Inverses: Theory and Computations (Science Press, Beijing, 2004), pp. 1–8, 129–165

    Google Scholar 

  16. W. Yin, Analysis and generalizations of the linearized Bregman method. SIAM J. Imaging Sci. 3(4), 856–877 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  17. W. Yin, S. Osher, D. Goldfarb, J. Darbon, Bregman iterative algorithms for l 1-minimization with applications to compressed sensing. SIAM J. Imaging Sci. 1(1), 143–168 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  18. H. Zhang, L. Cheng, A linearized Bregman iteration algorithm. Math. Numer. Sin. 32(1), 97–104 (2010)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tiantian Qiao.

Additional information

This research was partly supported by Fund of Oceanic Telemetry Engineering and Technology Research Center, State Oceanic Administration (Grant No. 2012003), NSFC(61101208, 61002048) and the Fundamental Research Funds for the Central Universities (Grant No. 13CX02086A).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Qiao, T., Li, W. & Wu, B. A New Algorithm Based on Linearized Bregman Iteration with Generalized Inverse for Compressed Sensing. Circuits Syst Signal Process 33, 1527–1539 (2014). https://doi.org/10.1007/s00034-013-9714-0

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00034-013-9714-0

Keywords

Navigation