Theoretical Limits on Speed, Errors, and Resolution in Microscopy with Switchable Fluorophores Alexander R. Small California State Polytechnic University at Pomona, 3801 West Temple Avenue, Pomona, CA 91768 [email protected]

Abstract: We consider the theoretical limits to microscopy techniques that involve activation of a sparse subset of the fluorescent molecules in the sample until each molecule has been imaged and localized (e.g. STOchastic Reconstruction Microscopy). The number of activation cycles required can be reduced by the intelligent use of image processing techniques to remove bad data from the analysis. We will also show that the performance of the image processing algorithm determines the trade-offs between speed (reducing the number of activation cycles) and resolution. ©2009 Optical Society of America OCIS codes: (100.6640) Image Processing-Superresolution; (180.2520) Microscopy-Fluorescence Microscopy

Recent experimental work has shown that it is possible to obtain images with subwavelength resolution in fluorescence microscopy. Promising techniques, with the potential for truly single-molecule resolution, use fluorophores that can switch between a non-fluorescent “dark” state and a fluorescent “activated” switch, e.g. photoactivatable fluorescent proteins[1-3], quantum dots[4-6], and pairs of cyanine dyes[7-10]. In all of these methods, only a sparse subset of the fluorophores is activated at any given time, and so the probability of any two fluorophores being separated by less than ~λ (the resolution limit of a microscope lens) is low. One can thus treat each bright spot in the image as representing a single molecule, determine the center of the bright spot (with resolution limited by the number of photons detected, due to shot noise[11]). After enough cycles of activation and imaging, all of the fluorophores in the sample will have been localized. However, the key assumption in this procedure is that only 1 fluorophore is activated in any diffraction-limited region of area λ2 (in 2D microscopy) or λ3 (in 3D confocal microscopy). It therefore follows that the average number of fluorophores activated in a region of size λ2 or λ3 must be at most 1. With reported resolutions of λ/10 or better, the number of activation cycles required could exceed 100 in 2D and 1000 in 3D confocal microscopy. The need to avoid significant numbers of images with overlapping bright spots means that the average number of fluorophores activated in a diffraction-limited spot should actually be significantly smaller than 1, introducing many frames with no activated fluorophores in a diffraction-limited region and increasing the image acquisition time still further. There is thus a trade-off between speed and errors. One way to avoid errors, while activating more fluorophores to speed up the imaging process, is to use an algorithm that can analyze a bright spot and determine whether the spot results from 1 activated fluorophore or multiple activated fluorophores. If 1 fluorophore is activated, the algorithm should accept the bright spot and find its center. If, on the other hand, the bright spot contains m≥2 activated fluorophores, the algorithm should reject the spot. In reality, the algorithm will be imperfect, and will accept single-fluorophore spots with probability f1<1 while accepting m-fluorophore spots with probability fm>0. The performance of the algorithm can be completely specified by the set of parameters {fm}. This concept is illustrated in Fig. 1.

Fig. 1: Concept of a rejection algorithm. Open and dark circles represent activated and dark molecules. The algorithm should reject (with probability 1-f2) any image in which spots from 2 or more molecules overlap and accept (with probability f1) images with non-overlapping spots.

In this work, we will show that the non-ideal performance of the rejection algorithm can introduce artifacts that limit the resolution of the image when working with high activation probabilities (and fast image acquisition), and

show that the performance of the algorithm must exceed a certain threshold to get noise-limited resolution while working at the maximum acquisition rate. We will assume that the probability of activating a single molecule is some number p, which the experimenter determines, and that the number of fluorophores in a diffraction-limited spot is n>>1. The probability that a spot contains m activated fluorophores is then pm = [n!/m!(n-m)!]pm(1-p)n-m. To ensure that each fluorophore is activated at least once, we would want to activate it T>>1 times, where the precise value of T depends on the experimenters tolerances. In recently published work[12] we showed that the number of activation cycles should then be N = nT/f1p1., and that the maximum value of p is 1/n. Setting p larger than 1/n actually increases N by replacing single fluorophore spots with 2-fluorophore spots, decreasing p1. One result of this limit on p is that our errors are dominated by 2-fluorophore spots, since pm is a decreasing function of m if p<1/n [12]. Now, consider 2 fluorophores separated by a distance d<<λ, as shown in Fig. 2a. If only 1 of them is activated, it is possible to localize the fluorophore with a resolution ~λ/√Np where Np is the number of photons collected from the fluorophore. If the fluorophore is localized several successive times, the estimated positions will vary, but they will cluster in a region of size ~λ/√Np. As long as only 1 fluorophore is activated at a time, the fluorophores will be distinguishable in the image built up by successive activation cycles (provided that d> λ/√Np) (Fig. 2b). However, if both fluorophores are activated at once in a frame, and if the algorithm does not reject that frame, then the apparent center of the bright spot will be intermediate between the true positions of the 2 fluorophores. (Fig. 2c).

Fig. 2: (a) Schematic of fluorophore positions. (b) Image built up from successive localizations of the fluorophores with noise-limited resolution. (c) Image that includes erroneous spot between fluorophores due to simultaneous activation of both fluorophores. (Central spot is drawn smaller only for schematic puroposes, to show that it is dimmer and less prominent.)

Suppose that the rejection algorithm utilizes information on the shape of the bright spot (as fluorophores with larger separations will give rise to ellipsoidal bright spots), leading to a separation dependent rejection probability as shown in Fig. 3. The intensity of the erroneous central bright spot will be proportional to the probability that 2 fluorophores are activated and that the fluorophores are separated by a distance less than l, the effective range of the separation-dependent rejection probability in Fig. 3. This gives the following for the intensity of the central spot:

I 2 ∝ 2 f 2 (0)(n − 1) p(1 − p) n −2 (l / λ ) 2

(1) where f2 may depend on d if the rejection algorithm makes use of the bright spot’s shape (e.g. the curve-fitting procedure in [10]) and the factor of 2 comes from having 2 activated fluorophores emitting photons. The intensity of the spots on the left and right in Fig. 2c will be given by the probability that the fluorophore is active while all others are dark and the probability that the image is accepted:

I 1 ∝ f 1 (1 − p) n −1

(2) The central bright spot will only impede our ability to resolve the fluorophores on the left and right if it is sufficiently bright, i.e. I1/I2
Fig. 3: Characteristic form of a separation-dependent rejection probability.

If we suppose that p=1/n<<1 (i.e. working at maximum activation rate with a sample containing a high density of fluorophores) and set I1/I2¥C, we get the following condition on the performance of the algorithm:

l≤λ

f1 2 f 2 (0)C

(3)

It is difficult to make the parameter l small, as it requires being able to infer the presence of multiple fluorophores from slight asymmetry in the shape of the bright spot. However, f2(0) can be made less than 1 (increasing our target value of l) by rejecting spots with intensities significantly above average. Since tests of the overall intensity of a spot require significantly less computation time than, say, nonlinear curve fitting to detect asymmetry in a spot’s shape, this result suggests that tests of intensity combined with simple shape tests (e.g. moments about principle axes) may yield very rapid post-processing while still rejecting multi-fluorophore images with enough reliability to ensure noise-limited resolution in a rapid experiment. It is also interesting to note that one’s ability to obtain noise-limited resolution while using the minimum number of activation cycles is constrained not just by the detectors and their noise characteristics, but also by the performance of the algorithms used to analyze the series of images obtained. This suggests a new concept that we term “algorithm-limited resolution” to distinguish this limitation from the noise limit on a detector’s resolution and the diffraction limit to a lens’s resolution. We are currently working to quantify the performance of imageprocessing algorithms used by experimental groups in this field, and compare the performance of their algorithms with other candidate algorithms for distinguishing single-fluorophore images from multi-fluorophore images. References 1. E. Betzig, G. H. Patterson, R. Sougrat, O. W. Lindwasser, S. Olenych, J. S. Bonifacino, M. W. Davidson, J. Lippincott-Schwartz, and H. F. Hess, "Imaging Intracellular Fluorescent Proteins at Nanometer Resolution," Science 313, 1642-1645 (2006). 2. A. Egner, C. Geisler, C. von Middendorff, H. Bock, D. Wenzel, R. Medda, M. Andresen, A. C. Stiel, S. Jakobs, and C. Eggeling, "Fluorescence Nanoscopy in Whole Cells by Asynchronous Localization of Photoswitching Emitters," Biophysical Journal 93, 3285-3290 (2007). 3. A. C. Stiel, M. Andresen, H. Bock, M. Hilbert, J. Schilde, A. Schonle, C. Eggeling, A. Egner, S. W. Hell, and S. Jakobs, "Generation of Monomeric Reversibly Switchable Red Fluorescent Proteins for Far-Field Fluorescence Nanoscopy," Biophysical Journal 95, 2989-2997 (2008). 4. B. C. Lagerholm, L. Averett, G. E. Weinreb, K. Jacobson, and N. L. Thompson, "Analysis Method for Measuring Submicroscopic Distances with Blinking Quantum Dots," Biophysical Journal 91, 3050-3060 (2006). 5. K. Lidke, B. Rieger, T. Jovin, and R. Heintzmann, "Superresolution by localization of quantum dots using blinking statistics," Optics Express 13, 7052-7062 (2005). 6. K. A. Lidke, and R. Heintzmann, "LOCALIZATION FLUORESCENCE MICROSCOPY USING QUANTUM DOT BLINKING," Biomedical Imaging: From Nano to Macro, 2007. ISBI 2007. 4th IEEE International Symposium on Biomedical Imaging, 936-939 (2007). 7. M. Bates, B. Huang, G. T. Dempsey, and X. Zhuang, "Multicolor Super-Resolution Imaging with Photo-Switchable Fluorescent Probes," Science 317, 1749-1753 (2007). 8. B. Huang, S. A. Jones, B. Brandenburg, and X. Zhuang, "Whole-cell 3D STORM reveals interactions between cellular structures with nanometer-scale resolution," Nature Methods 5, 1047 (2008). 9. B. Huang, W. Wang, M. Bates, and X. Zhuang, "Three-Dimensional Super-Resolution Imaging by Stochastic Optical Reconstruction Microscopy," Science 319, 810-8134 (2008). 10. M. J. Rust, M. Bates, and X. Zhuang, "Sub-diffraction-limit imaging by stochastic optical reconstruction microscopy (STORM)," Nature Methods 3, 793-795 (2006). 11. N. Bobroff, "Position measurement with a resolution and noise-limited instrument," Review of Scientific Instruments 57, 1152-1157 (1986). 12. A. Small, "Theoretical Limits on Errors and Acquisition Rates in Localizing Switchable Fluorophores," Biophysical Journal (in press) (2009).

Theoretical Limits on Speed, Errors, and Resolution in ...

... M. Bates, and X. Zhuang, "Three-Dimensional Super-Resolution Imaging by Stochastic Optical Reconstruction. Microscopy," Science 319, 810-8134 (2008). 10. M. J. Rust, M. Bates, and X. Zhuang, "Sub-diffraction-limit imaging by stochastic optical reconstruction microscopy (STORM)," Nature. Methods 3, 793-795 (2006).

138KB Sizes 3 Downloads 204 Views

Recommend Documents

Theoretical Limits on Errors and Acquisition Rates in ...
Department of Physics, California State Polytechnic University-Pomona, Pomona, California .... multiple molecules easier to ascertain with good algorithms.

Theoretical Limits on Errors and Acquisition Rates in ...
One promising road to single-molecule imaging in the far-field is to ..... Mapping the number of molecules and brightness in the laser scanning micro- scope.

Variable Speed Limits
What is a Variable Speed Limit (VSL)?. • Speed limit changes ... Speeds of fastest driver decreased. 0. 10. 20. 30. 40. 50. 60 ... enforcement. • Pagers, internet.

Comment on" Twofold Advance in the Theoretical Understanding of ...
Dec 1, 2008 - the N = 10 channel IRLM calculated in the framework of the perturbative ... de-phase electrons on the IL therefore suppressing CT. (Γ0 being ...

On Limits of Wireless Communications in a Fading ...
On Limits of Wireless Communications in a Fading Environment when Using Multiple Antennas. G.J. FOSCHINI and M.J. GANS. Lucent Technologies, Bell Labs.

On Limits of Wireless Communications in a Fading ...
G.J. FOSCHINI and M.J. GANS. Lucent Technologies, Bell Labs. .... where the normalized channel power transfer characteristic is |H|2. (in this 1-D case H is .... We call this system an optimum combining, OC(nR), system. Its capacity is. C =log2.

Theoretical perspectives on development in early years.pdf ...
2. List the theoretical approaches to study child development. 3. Explain the term scheme. 4. Define the term “habituation”. 5. What do you mean by 'super ego' ?

Theoretical perspectives on impairments in spoken ...
South Parks Road, Oxford OX1 3UD, UK ... data on language processing, thus providing novel ... patients with deficits in item retention, but not those with.

Limits and Continuity
Sep 2, 2014 - Secant to a Curve. A line through two points on a curve is a secant to the curve. Marjorie Lee Browne. (1914–1979). When Marjorie Browne.

Theoretical Perspectives on Affect and Deep Learning
view of affect detection in the computer and social sciences. Theoretical conver- .... The parents explain that it will take 2 years to get rid of it so she changes her mind. .... At the other extreme, the degree of cognitive disequilib- rium may be 

Theoretical Perspectives on Affect and Deep Learning
(2010) review of affect detection in the computer and social sciences. Theoretical .... challenges, high engagement, timely achievement, and delight. This is experi- .... of mastery versus performance goals (Deci & Ryan, 2002; Dweck, 2002; Pekrun,. 2

Fundamental limits on adversarial robustness
State-of-the-art deep networks have recently been shown to be surprisingly unstable .... An illustration of ∆unif,ϵ(x; f) and ∆adv(x; f) is given in Fig. 1. Similarly to ...

Limits and Continuity
Sep 2, 2014 - 2 by evaluating the formula at values of h close to 0. When we ...... 10x x. 1. 74. f x x sin ln x. 75. Group Activity To prove that limu→0 (sin u) u.

GSO standard on microbiological limits - MICoR
plans employed are more stringent. Precautions are being taken that these limits be within attainable limits in production units by following good manufacturing.

Errors in Project Approval and Mandatory Review
We compare two processes for society to review projects: one that is entirely based .... savings. 2The court ruled that if one technology user successfully challenges the validity .... preclude the evaluator from taking their information into account

Draft Resolution on Nkandla.pdf
Sign in. Page. 1. /. 2. Loading… Page 1 of 2. Page 1 of 2. Page 2 of 2. Page 2 of 2. Draft Resolution on Nkandla.pdf. Draft Resolution on Nkandla.pdf. Open. Extract. Open with. Sign In. Main menu. Displaying Draft Resolution on Nkandla.pdf. Page 1

Graded structure and the speed of category verification: On the ...
For non-social categories (e.g., BIRD), participants were faster to classify typical instances than atypical .... testable propositions, both of which received support.

Semantic Smells and Errors in Access Control Models
Index Terms—code smells, access control models, security, ... is semantically unrelated to the download code it protects. .... following snippet of PHP code:.

Practical lessons on the lever escapement, its tests, errors, their ...
Practical lessons on the lever escapement, its tests, errors, their detection and correction (1916).pdf. Practical lessons on the lever escapement, its tests, errors, ...