Abstract
Compressed sensing (CS) is a relatively new approach to signal acquisition which has as its goal to minimize the number of measurements needed of the signal in order to guarantee that it is captured to a prescribed accuracy. It is natural to inquire whether this new subject has a role to play in electron microscopy (EM). In this chapter, we shall describe the foundations of CS and then examine which parts of this new theory may be useful in EM.
This research was supported in part by the College of Arts and Sciences at the University of South Carolina; the ARO/DoD Contracts W911NF-05-1-0227 and W911NF-07-1-0185; the Office of Naval Research Contract ONR-N00014-08-1-1113; the NSF Grants DMS-0915104 and DMS-0915231; the Special Priority Program SPP 1324, funded by German Research Foundation; and National Academies Keck Futures Initiative grant NAKFI IS11.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
In mathematics, the symbol “ : = ” is used to mean that the quantity nearest the colon “:” is defined by the quantity nearest the equal sign “=”.
References
Baba N, Terayama K, Yoshimizu T, Ichise N, Tanaka N (2001) An auto-tuning method for focusing and astigmatism correction in HAADF-STEM, based on the image contrast transfer function. J Electron Microsc 50(3):163–176
Batson PE, Dellby N, Krivanek OL (2002) Sub-angstrom resolution using aberration corrected electron optics. Nature 418:617–620
Becker S, Bobin J, Candes E (2009) NESTA: a fast and accurate first-order method for sparse recovery. CalTech Technical Report
Binev P, Blanco-Silva F, Blom D, Dahmen W, Lamby P, Sharpley R, Vogt T (2012) High-Quality Image Formation by Nonlocal Means Applied to High-Angle Annular Dark-Field Scanning Transmission Electron Microscopy (HAADF-STEM). (Chap. 5 in this volume)
Bregman L (1967) The relaxation method of finding the common points of convex sets and its application to the solution of problems in convex programming. USSR Comput Math Math Phys 7:200–217
Candès E, Romberg J (2005) ℓ 1-Magic: recovery of sparse signals via convex programming. http://www.acm.caltech.edu/l1magic/
Candès E, Romberg J, Tao T (2006) Stable signal recovery from incomplete and inaccurate measurements. Comm Pure Appl Math 59:1207–1223
Candès E, Romberg J, Tao T (2006) Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans Inf Theory 52:489–509
Candès E, Tao T (2005) Decoding by linear programming. IEEE Trans Inf Theory 51:4203–4215
Chambolle A, DeVore R, Lucier B, Lee Y (1998) Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage. IEEE Image Process 7:319–335
Cohen A, Dahmen W, Daubechies I, DeVore R (2001) Tree approximation and encoding. ACHA 11:192–226
Cohen A, Dahmen W, DeVore R (2009) Compressed sensing and best k-term approximation. J Amer Math Soc 22:211–231
Cohen A, Dahmen W, DeVore R (2009) Instance optimal decoding by thresholding in compressed sensing. In: Proc of El Escorial 08, Contemporary mathematics
DeVore R, Daubechies I, Fornasier M, Güntürk S (2010) Iterative re-weighted least squares. Comm Pure Appl Math 63(1):1–38
DeVore R, Jawerth B, Lucier B (1992) Image compression through transform coding. IEEE Proc Inf Theory 38:719–746
DeVore R, Johnson LS, Pan C, Sharpley R (2000) Optimal entropy encoders for mining multiply resolved data. In: Ebecken N, Brebbia CA (eds) Data mining II. WIT Press, Boston, pp 73–82
DeVore R, Petrova G, Wojtaszczyk P (2009) Instance-optimality in probability with an l 1-minimization decoder. Appl Comput Harmon Anal 27:275–288
Donoho D, Tsaig Y (2006) Compressed sensing. IEEE Trans Inf Theory 52:1289–1306
Duarte MF, Davenport MA, Takhar D, Laska JN, Sun T, Kelly KF, Baraniuk RG (2008) Single pixel imaging via compressive sampling. IEEE Signal Process Mag 25:83–91
Garnaev A, Gluskin ED (1984) The widths of a Euclidean ball. Dokl Akad Nauk SSSR 277(5):1048–1052 (In Russian)
Gilbert AC, Mutukrishnan S, Strauss MJ (2003) Approximation of functions over redundant dictionaries using coherence. In: Proc 14th Annu ACM-SIAM Symp discrete algorithms, Baltimore, MD, pp 243–252
Haider M, Uhlemann S, Schwan E, Rose H, Kabius B, Urban K (1998) Electron microscopy image enhanced. Nature 392(6678):768–769
James EM, Browning ND (1999) Practical aspects of atomic resolution imaging and analysis in STEM. Ultramicroscopy 78(1–4):125–139
Kashin B (1977) The widths of certain finite dimensional sets and classes of smooth functions. Izvestia 41:334–351
Kirkland EJ (2010) Advanced computing in electron microscopy, Second Edition. Springer, New York
Mao Y, Fahimian BP, Osher SJ, Miao J (2010) Development and optimization of regularized tomographic reconstruction algorithms utilizing equally-sloped tomography. IEEE Trans Image Process 19(5):1259–1268
Needell D, Tropp JA (2008) CoSaMP: iterative signal recovery from incomplete and inaccurate samples. Appl Comput Harmonic Anal 26(3):301–321
Nesterov Y (1983) A method for unconstrained convex minimization problem with the rate of convergence O(1 ∕ k 2). Doklady AN USSR 269:543–547
Nesterov Y (2005) Smooth minimization of non-smooth functions. Math Program 103:127–152
Osher S, Burger M, Goldfarb D, Xu J, Yin W (2005) An iterative regularization method for total variation based image restoration. Multi-scale Model Simul 4(2):460–489
Osher S, Mao Y, Dong B, Yin W (2010) Fast linearized bregman iteration for compressive sensing and sparse denoising. Commun Math Sci 8:93–111
Sawada H, Tanishiro Y, Ohashi N, Tomita T, Hosokawa F, Kaneyama T, Kondo Y, Takayanagi K (2009) STEM imaging of 47-pm-separated atomic columns by a spherical aberration-corrected electron microscope with a 300-kV cold field emission gun. J Electron Microsc 58(6):357–361
Shapiro J (1993) Embedded image coding using zero-trees of wavelet coefficients. IEEE Trans Signal Process 41:3445–3462
Temlyakov VN (2008) Greedy approximation. Acta Num 10:235–409
Tropp J (2004) Greed is good: algorithmic results for sparse approximation. IEEE Trans Inf Theory 10:2231–2242
Weyland M, Midgley PA, Thomas JM (2001) Electron tomography of nanoparticle catalysts on porous supports: a new technique based on rutherford scattering. J Phys Chem B 105:7882–7886.
Yin W, Osher S, Darbon J, Goldfarb D (2007) Bregman iterative algorithms for compressed sensing and related problems. CAAM Technical Report TR07-13
Zibulevsky M, Elad M (2010) L1–L2 optimization in signal and image processing: iterative shrinkage and beyond. IEEE Signal Process Mag 10:76–88
Acknowledgments
We are very indebted to Doug Blom and Sonali Mitra for providing us with several STEM simulations, without which we would not have been able to validate the algorithmic concepts. Numerous discussions with Tom Vogt and Doug Blom have provided us with invaluable sources of information, without which this research would not have been possible. We are also very grateful to Nigel Browning for providing tomography data. We would also like to thank Andreas Platen for his assistance in preparing the numerical experiments.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Binev, P., Dahmen, W., DeVore, R., Lamby, P., Savu, D., Sharpley, R. (2012). Compressed Sensing and Electron Microscopy. In: Vogt, T., Dahmen, W., Binev, P. (eds) Modeling Nanoscale Imaging in Electron Microscopy. Nanostructure Science and Technology. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-2191-7_4
Download citation
DOI: https://doi.org/10.1007/978-1-4614-2191-7_4
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4614-2190-0
Online ISBN: 978-1-4614-2191-7
eBook Packages: Chemistry and Materials ScienceChemistry and Material Science (R0)