Skip to main content
Top

2019 | OriginalPaper | Chapter

A Simple and Exact Algorithm to Solve Linear Problems with \(\ell ^1\)-Based Regularizers

Authors : Yohann Tendero, Igor Ciril, Jérôme Darbon

Published in: Computer Vision, Imaging and Computer Graphics Theory and Applications

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

This paper considers \(\ell ^1\)-based regularized signal estimation that are often used in applications. The estimated signal is obtained as the solution of an optimization problem and the quality of the recovered signal directly depends on the quality of the solver. This paper describes a simple algorithm that computes an exact minimizer of \( \Vert D \cdot \Vert _1\) under the constraints \(A\mathbf {x}=\mathbf {y}\). A comparative evaluation of the algorithm is presented. An illustrative application to real signals of bacterial flagellar motor is also presented.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Appendix
Available only for authorised users
Literature
1.
go back to reference Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183–202 (2009)MathSciNetCrossRef Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183–202 (2009)MathSciNetCrossRef
2.
go back to reference Blumensath, T., Davies, M.E.: Iterative hard thresholding for compressed sensing. Appl. Comput. Harmonic Anal. 27(3), 265–274 (2009)MathSciNetCrossRef Blumensath, T., Davies, M.E.: Iterative hard thresholding for compressed sensing. Appl. Comput. Harmonic Anal. 27(3), 265–274 (2009)MathSciNetCrossRef
4.
go back to reference Burger, M., Möller, M., Benning, M., Osher, S.: An adaptive inverse scale space method for compressed sensing. Math. Comput. 82(281), 269–299 (2013)MathSciNetCrossRef Burger, M., Möller, M., Benning, M., Osher, S.: An adaptive inverse scale space method for compressed sensing. Math. Comput. 82(281), 269–299 (2013)MathSciNetCrossRef
5.
go back to reference Cai, J.F., Osher, S., Shen, Z.: Linearized bregman iterations for compressed sensing. Math. Comput. 78(267), 1515–1536 (2009)MathSciNetCrossRef Cai, J.F., Osher, S., Shen, Z.: Linearized bregman iterations for compressed sensing. Math. Comput. 78(267), 1515–1536 (2009)MathSciNetCrossRef
6.
7.
go back to reference Candes, E.J., Tao, T.: Near-optimal signal recovery from random projections: universal encoding strategies? IEEE Trans. Inform. Theory 52(12), 5406–5425 (2006)MathSciNetCrossRef Candes, E.J., Tao, T.: Near-optimal signal recovery from random projections: universal encoding strategies? IEEE Trans. Inform. Theory 52(12), 5406–5425 (2006)MathSciNetCrossRef
8.
9.
go back to reference Ciril, I., Darbon, J., Tendero, Y.: A simple and exact algorithm to solve l1 linear problems - application to the compressive sensing method. In: Proceedings of the 13th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications - Volume 4: VISAPP, pp. 54–62. INSTICC, SciTePress (2018) Ciril, I., Darbon, J., Tendero, Y.: A simple and exact algorithm to solve l1 linear problems - application to the compressive sensing method. In: Proceedings of the 13th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications - Volume 4: VISAPP, pp. 54–62. INSTICC, SciTePress (2018)
10.
go back to reference Dai, W., Milenkovic, O.: Subspace pursuit for compressive sensing signal reconstruction. IEEE Trans. Inform. Theory 55(5), 2230–2249 (2009)MathSciNetCrossRef Dai, W., Milenkovic, O.: Subspace pursuit for compressive sensing signal reconstruction. IEEE Trans. Inform. Theory 55(5), 2230–2249 (2009)MathSciNetCrossRef
12.
go back to reference Donoho, D.L., Elad, M.: Optimally sparse representation in general (nonorthogonal) dictionaries via \(\ell 1\) minimization. Proc. Natl. Acad. Sci. 100(5), 2197–2202 (2003)MathSciNetCrossRef Donoho, D.L., Elad, M.: Optimally sparse representation in general (nonorthogonal) dictionaries via \(\ell 1\) minimization. Proc. Natl. Acad. Sci. 100(5), 2197–2202 (2003)MathSciNetCrossRef
14.
go back to reference Grant, M.C., Boyd, S.P.: The CVX Users’ Guide, Release 2.1 Grant, M.C., Boyd, S.P.: The CVX Users’ Guide, Release 2.1
15.
go back to reference Hale, E.T., Yin, W., Zhang, Y.: A fixed-point continuation method for l1-Regularized minimization with applications to compressed sensing. CAAM Technical Report TR07-07 (2007) Hale, E.T., Yin, W., Zhang, Y.: A fixed-point continuation method for l1-Regularized minimization with applications to compressed sensing. CAAM Technical Report TR07-07 (2007)
16.
go back to reference Hiriart-Urruty, J.B., Lemarechal, C.: Convex Analysis and Minimization Algorithms II: Advanced Theory and Bundle Methods. Grundlehren der mathematischen Wissenschaften. Springer, Heidelberg (1996)MATH Hiriart-Urruty, J.B., Lemarechal, C.: Convex Analysis and Minimization Algorithms II: Advanced Theory and Bundle Methods. Grundlehren der mathematischen Wissenschaften. Springer, Heidelberg (1996)MATH
17.
go back to reference Jain, P., Tewari, A., Dhillon, I.S.: Orthogonal matching pursuit with replacement. In: Advances in Neural Information Processing Systems, pp. 1215–1223 (2011) Jain, P., Tewari, A., Dhillon, I.S.: Orthogonal matching pursuit with replacement. In: Advances in Neural Information Processing Systems, pp. 1215–1223 (2011)
18.
go back to reference Maleki, A.: Coherence analysis of iterative thresholding algorithms. In: 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton, pp. 236–243. IEEE (2009) Maleki, A.: Coherence analysis of iterative thresholding algorithms. In: 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton, pp. 236–243. IEEE (2009)
19.
go back to reference Mallat, S., Zhang, Z.: Matching pursuits with time-frequency dictionaries. IEEE Trans. Signal Process. 41(12), 3397–3415 (1993)CrossRef Mallat, S., Zhang, Z.: Matching pursuits with time-frequency dictionaries. IEEE Trans. Signal Process. 41(12), 3397–3415 (1993)CrossRef
20.
go back to reference Moeller, M., Zhang, X.: Fast sparse reconstruction: greedy inverse scale space flows. Math. Comput. 85(297), 179–208 (2016)MathSciNetCrossRef Moeller, M., Zhang, X.: Fast sparse reconstruction: greedy inverse scale space flows. Math. Comput. 85(297), 179–208 (2016)MathSciNetCrossRef
21.
go back to reference Needell, D., Tropp, J.A.: CoSaMP: iterative signal recovery from incomplete and inaccurate samples. Appl. Comput. Harmonic Anal. 26(3), 301–321 (2009)MathSciNetCrossRef Needell, D., Tropp, J.A.: CoSaMP: iterative signal recovery from incomplete and inaccurate samples. Appl. Comput. Harmonic Anal. 26(3), 301–321 (2009)MathSciNetCrossRef
22.
go back to reference Needell, D., Vershynin, R.: Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit. Found. Comput. Math. 9(3), 317–334 (2009)MathSciNetCrossRef Needell, D., Vershynin, R.: Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit. Found. Comput. Math. 9(3), 317–334 (2009)MathSciNetCrossRef
23.
go back to reference Nirody, J.A., Sun, Y.R., Lo, C.J.: The biophysicist’s guide to the bacterial flagellar motor. Adv. Phys.: X 2(2), 324–343 (2017) Nirody, J.A., Sun, Y.R., Lo, C.J.: The biophysicist’s guide to the bacterial flagellar motor. Adv. Phys.: X 2(2), 324–343 (2017)
24.
go back to reference Osher, S., Burger, M., Goldfarb, D., Xu, J., Yin, W.: An iterative regularization method for total variation-based image restoration. Multiscale Model. Simul. 4(2), 460–489 (2005)MathSciNetCrossRef Osher, S., Burger, M., Goldfarb, D., Xu, J., Yin, W.: An iterative regularization method for total variation-based image restoration. Multiscale Model. Simul. 4(2), 460–489 (2005)MathSciNetCrossRef
25.
go back to reference Osher, S., Mao, Y., Dong, B., Yin, W.: Fast linearized bregman iteration for compressive sensing and sparse denoising. arXiv preprint arXiv:1104.0262 (2011) Osher, S., Mao, Y., Dong, B., Yin, W.: Fast linearized bregman iteration for compressive sensing and sparse denoising. arXiv preprint arXiv:​1104.​0262 (2011)
26.
go back to reference Pati, Y.C., Rezaiifar, R., Krishnaprasad, P.: Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition. In: Conference Record of The Twenty-Seventh Asilomar Conference on Signals, Systems and Computers, pp. 40–44. IEEE (1993) Pati, Y.C., Rezaiifar, R., Krishnaprasad, P.: Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition. In: Conference Record of The Twenty-Seventh Asilomar Conference on Signals, Systems and Computers, pp. 40–44. IEEE (1993)
27.
go back to reference Sowa, Y., et al.: Direct observation of steps in rotation of the bacterial flagellar motor. Nature 437(7060), 916 (2005)CrossRef Sowa, Y., et al.: Direct observation of steps in rotation of the bacterial flagellar motor. Nature 437(7060), 916 (2005)CrossRef
28.
go back to reference Tropp, J.A., Gilbert, A.C.: Signal recovery from random measurements via orthogonal matching pursuit. IEEE Trans. Inform. Theory 53(12), 4655–4666 (2007)MathSciNetCrossRef Tropp, J.A., Gilbert, A.C.: Signal recovery from random measurements via orthogonal matching pursuit. IEEE Trans. Inform. Theory 53(12), 4655–4666 (2007)MathSciNetCrossRef
29.
go back to reference Zhang, X., Burger, M., Osher, S.: A unified primal-dual algorithm framework based on bregman iteration. J. Sci. Comput. 46(1), 20–46 (2011)MathSciNetCrossRef Zhang, X., Burger, M., Osher, S.: A unified primal-dual algorithm framework based on bregman iteration. J. Sci. Comput. 46(1), 20–46 (2011)MathSciNetCrossRef
Metadata
Title
A Simple and Exact Algorithm to Solve Linear Problems with -Based Regularizers
Authors
Yohann Tendero
Igor Ciril
Jérôme Darbon
Copyright Year
2019
DOI
https://doi.org/10.1007/978-3-030-26756-8_12

Premium Partner