Quantifying the local resolution of cryo-em density maps

Size: px
Start display at page:

Download "Quantifying the local resolution of cryo-em density maps"

Transcription

1 BRIEF COMMUNICATIONS npg 2014 Nature America, Inc. All rights reserved. Quantifying the local resolution of cryo-em density maps Alp Kucukelbir 1, Fred J Sigworth 1,2 & Hemant D Tagare 1,3 We propose a definition of local resolution for three-dimensional electron cryo-microscopy (cryo-em) density maps that uses local sinusoidal features. Our algorithm has no free parameters and is applicable to other imaging modalities, including tomography. By evaluating the local resolution of singleparticle reconstructions and subtomogram averages for four example data sets, we report variable resolution across a 4- to 40-Å range. Various resolution measures for cryo-em have been proposed in the past three decades 1. Unlike the classical Rayleigh resolution that characterizes instruments, these measures characterize features present in the data. A commonly used cryo-em resolution measure is the Fourier shell correlation (FSC) procedure. It quantifies the strength, relative to noise, of sinusoidal features across the entire density map. FSC produces a single resolution for the entire density map. FSC cannot assess locally varying resolution, which may be caused by sample heterogeneity and image processing errors 2. Our goal was to overcome this limitation of FSC by presenting a definition of local resolution that can assess variable resolution across the density map. As a resolution measure, FSC has other limitations. FSC uses split data sets, that is, the images are grouped into two halves each contributing to a separate density map. The resolution is measured using both density maps. The computational stage at which the data are split can affect the FSC resolution 3. Further, calculating the resolution from FSC requires a threshold, whose value and interpretation has been debated 1. Alternative approaches 4,5 address some of these shortcomings but do not define local resolution. Recent structural studies 6,7 have used windowed FSC for local resolution 8. Windowed FSC masks the split data set density maps with a window and calculates FSC resolutions as the window moves through the map. This requires a window size parameter, whose value is often arbitrary. Although this approach implicitly conducts multiple tests on the density map, it does not control the false discovery rate (FDR) in the thresholding of the FSC. FDR control is critical because local resolution tests are repeated at many points in the volume. Additionally, there is data dependency between neighboring points that windowed FSC does not account for. We propose a mathematical theory and an efficient algorithm for measuring local resolution that address all of the above limitations. The theory (Online Methods) is based on the following idea: a -Å feature exists at a point in the volume if a threedimensional (3D) local sinusoid of wavelength is statistically detectable above noise at that point. A likelihood-ratio hypothesis test of the local sinusoid versus noise can detect this feature at a given P value (typically P = 0.05). We define the local resolution at a point as the smallest at which the local sinusoid is detectable, and we account for multiple testing with an FDR procedure. Our algorithm, named ResMap, implements this theory. ResMap begins by initializing a local-sinusoid model at = 2, where is the voxel spacing in Å. Likelihood-ratio tests are conducted at all voxels in the volume, with explicit FDR control that accounts for data dependency. Voxels that pass the test are assigned resolution, whereas those that fail are tested at a larger. The algorithm produces a local-resolution map with a number assigned to every voxel in the density map (Fig. 1a). There are no algorithm parameters to tune, and local resolution may be defined unambiguously at the given P value. In ResMap, local sinusoids of wavelength are approximated by a set of functions called H2. This set is derived from Gaussian windowed second-order Hermite polynomials 9,10, with window size proportional to the wavelength (Fig. 1b and Online Methods). ResMap results with H2 are specifically denoted as ResMap-H2. H2 functions are steerable, so their linear combination can locally model any arbitrarily oriented local sinusoid in three dimensions (Supplementary Note 1). At a fixed wavelength, the standard likelihood-ratio test 11 can detect whether a local sinusoid is present in the steerable function approximation. The test requires an estimate of the noise variance, which we obtain from the region surrounding the particle. The likelihood-ratio test does not depend on how this variance is estimated. Other noise estimates, such as those obtained by analyzing split data set density maps, can also be used. The smallest at which the likelihood-ratio test passes at a given P value defines the resolution. We control for false discoveries using a method that takes into account the dependencies between tests 12 (Online Methods). We first evaluated ResMap using a simulated density map of a radially symmetrical chirp signal whose wavelength decreased with radius. We added white and non-white noise with two different variance levels (Supplementary Fig. 1). ResMap-H2 estimates show an intuitive relation to the underlying signal features (Fig. 1c). 1 Department of Biomedical Engineering, Yale University, New Haven, Connecticut, USA. 2 Department of Cellular and Molecular Physiology, Yale University, New Haven, Connecticut, USA. 3 Department of Diagnostic Radiology, Yale University, New Haven, Connecticut, USA. Correspondence should be addressed to H.D.T. (hemant.tagare@yale.edu). RECEIVED 30 MAY; ACCEPTED 2 OCTOBER; PUBLISHED ONLINE 10 NOVEMBER 2013; DOI: /NMETH.2727 NATURE METHODS VOL.11 NO.1 JANUARY

2 npg 2014 Nature America, Inc. All rights reserved. BRIEF COMMUNICATIONS Figure 1 Local resolution. (a) The ResMap algorithm. Wavelength is initialized to twice the voxel spacing. Likelihood-ratio tests decide whether the local-sinusoid model is detectable at each voxel. Voxels that pass the test are controlled for false discoveries. Voxels that fail the test are tested again after is increased (Online Methods). (b) Cosine- and sine-like H2 functions oriented along an axis. White and black indicate negative and positive parts, respectively (Supplementary Note 1). (c) Left, slice through noisy simulated density maps with voxel spacing of 1 Å. Right, radial plots. ResMap-H2 resolution estimates show a steady improvement as the simulated signal becomes more finely varying. Bottom, corresponding results for 1/f noise display robustness against non-white noise (Supplementary Fig. 1). 2, variance. Further, increasing the noise worsens the resolution at every point. ResMap-H2 results for this simulation exhibit a ripple in the transitions between the peaks and valleys of the signal. This is because transitions have more energy in the higher frequencies and are thus detectable with local sinusoids of smaller scale. We then tested ResMap with four different density maps ranging from near-atomic single-particle reconstructions (~4 Å) to typical subtomogram averages (~40 Å). All results were obtained with a P value of We compared ResMap-H2 results to regular and gold-standard 3 FSC plots and to windowed FSC maps. First, we analyzed a single-particle 80S ribosome reconstruction (EMDataBank: EMD-2275) 13. The original publication estimated a resolution of 4.5 Å (gold-standard FSC at 0.143) and noted the blurring from the heterogeneity in the 40S subunit (Fig. 2a). Our ResMap-H2 resolution estimates fall between 4.5 and 5.5 Å in the 60S subunit and between 4.5 and 9 Å in the 40S subunit. Some parts of the 40S are just as resolved as the 60S, which ResMap-H2 results show in the portion of 40S adjacent to 60S. The median a b c d Resolution 3D visualization Density map slice(s) ResMap-H2 slice(s) (Å) S 60S a c Initialize. Set voxels inside the particle to have unassigned resolution. Conduct likelihood-ratio tests at unassigned voxels to evaluate the -Å local-sinusoid model. Assign Å to voxels that pass the test with FDR control. White noise, 2 = 2.0 1/f noise, 2 = 2.0 ResMap-H2 (Å) ResMap-H2 (Å) Increase YES More unassigned voxels? Radius (voxels) Signal ResMap-H2 resolution ( 2 = 2.0) ResMap-H2 resolution ( 2 = 0.5) ResMap-H2 resolution ( 2 = 2.0) ResMap-H2 resolution ( 2 = 0.5) Radius (voxels) ResMap-H2 resolutions in the 40S and 60S subunits are 6.5 and 5 Å, respectively, which agree with a map versus atomic model FSC plot (Fig. 3J in the original publication 13 ). Our ResMap-H2 results additionally point to a decrease in resolution near the edges of the particle. This may be due to image alignment errors or the interaction of the ribosome with the solvent. Second, we analyzed a single-particle Tulane virus reconstruction (EMD-5529) 14. The original publication estimated a 6.3-Å (gold-standard FSC at 0.143) resolution for the entire particle and highlighted the considerable flexibility of the protruding domains of the virus. Our ResMap results corroborate these findings, estimating the resolution of the shell as between 6 and 7 Å and the resolution of the protruding domains as between 7 and 9 Å (Fig. 2b). Third, we analyzed a subtomogram average of GroEL (EMD-2221) 15. The original publication reported an 8.4-Å (FSC at 0.5) resolution. Our ResMap-H2 estimates suggest that many -helices are resolved up to 7.5 Å (Fig. 2c). This is evident in the close-up rendering that displays the central part of a helix at 7.5 Å but the end and adjoining loop at ~9.5 Å. These results are corroborated in Supplementary Video 1, in which the central part of Figure 2 ResMap-H2 results using experimental density maps. Color bars apply to both volumes and slices. 3D visualizations are rendered using UCSF Chimera 17. White dotted lines in color bars indicate FSC and 0.5 thresholds from the original publications. (a) 80S ribosome (EMD-2275). ResMap-H2 results indicate a decreased resolution within the 40S subunit and near the edges of the particle. (b) Tulane virus (EMD-5529). ResMap estimates lower resolutions in the protruding domains, whereas the shell appears well resolved. (c) Subtomogram GroEL (uncropped version of EMD-2221). ResMap-H2 results show an -helix with varying levels of resolution (Supplementary Video 1). (d) Subtomogram ATP synthase dimer (uncropped version of EMD-2161). ResMap delineates the central dimer as better resolved than the neighboring dimers and membrane. NO DONE b VOL.11 NO.1 JANUARY 2014 NATURE METHODS

3 npg 2014 Nature America, Inc. All rights reserved. the helix is shown to maintain its tubular structure under a range of surface threshold values. Finally, we analyzed a subtomogram average of ATP synthase dimers (EMD-2161) 16. The original publication estimated a 37-Å (FSC at 0.5) resolution. Our ResMap-H2 resolution estimates are between 30 and 42 Å in the central dimers, which are better resolved than the neighboring dimers and membrane (Fig. 2d). The edges of the central dimers appear to be at a higher resolution than the cores. This is likely due to the strong dark bands surrounding the particle, as is typical in particles reconstructed without contrast transfer function correction. ResMap results are consistent with windowed FSC but differ in some important aspects. Windowed FSC results appear to be sensitive to the fixed size of the user-defined window (Supplementary Fig. 2). Too large a window size may include the solvent in the FSC computation and lead to underestimation of resolution (Supplementary Fig. 3). ResMap does not suffer from this effect because the localization uncertainty in the joint spatial-frequency domain is minimized by the use of the H2 functions. The behavior of ResMap for typical P values is shown in Supplementary Figure 4. Moreover, windowed FSC can be slow, taking anywhere between 25 min and 4 h to compute, depending on the window size; ResMap usually requires a few minutes. For all cases above, ResMap-H2 local resolutions within the reconstructed particle were almost always between the 0.5 and threshold of the FSC in the original publications. This is consistent with the idea that the 0.5 threshold may be too conservative and that the threshold may be too optimistic 3,13. Moreover, ResMap-H2 results agree with published flexibility analyses and also visually match the level of detail in the density maps. ResMap is available as a cross-platform executable package with a simple graphical user interface (Supplementary Fig. 5). The software and test data are publicly accessible (Supplementary Software; Users can also apply ResMap to other fields by choosing features other than local sinusoids. For instance, a 2D Gaussian feature may be appropriate for optical nanoscopy, whereas rotated 2D arcs may be of use in radio telescopy. The anticipated 2 recent increase in heterogeneity studies 6,7,13 highlights the pressing challenge of evaluating the local resolution of cryo-em density maps. We believe that this local-resolution method is both statistically rigorous and practical and therefore BRIEF COMMUNICATIONS provides a critical step in enabling researchers to assess the quality of cryo-em density maps. METHODS Methods and any associated references are available in the online version of the paper. Note: Any Supplementary Information and Source Data files are available in the online version of the paper. ACKNOWLEDGMENTS We are grateful to S. Scheres, G. Lander, A. Bartesaghi and K. Davies for stimulating discussions and sharing their density maps for this study. This work was supported by Natural Sciences and Engineering Research Council of Canada award PGS-D3 (A.K.) and US National Institutes of Health grants R01LM (H.D.T.), R01GM (A.K. and H.D.T.) and R01NS (F.J.S.). AUTHOR CONTRIBUTIONS A.K. and H.D.T. conceived of the theory. A.K. developed the algorithm and performed experiments. A.K., F.J.S. and H.D.T. designed the experiments and wrote the manuscript. COMPETING FINANCIAL INTERESTS The authors declare no competing financial interests. Reprints and permissions information is available online at com/reprints/index.html. 1. Liao, H.Y. & Frank, J. Structure 18, (2010). 2. Leschziner, A.E. & Nogales, E. Annu. Rev. Biophys. 36, (2007). 3. Scheres, S.H. & Chen, S. Nat. Methods 9, (2012). 4. Unser, M. et al. J. Struct. Biol. 149, (2005). 5. Sousa, D. & Grigorieff, N. J. Struct. Biol. 157, (2007). 6. Lander, G.C. et al. Nature 482, (2012). 7. Hashem, Y. et al. Nature 494, (2013). 8. Heymann, J.B. & Belnap, D.M. J. Struct. Biol. 157, 3 18 (2007). 9. Freeman, W.T. & Adelson, E.H. IEEE Trans. Pattern Anal. Mach. Intell. 13, (1991). 10. Derpanis, K.G. & Gryn, J.M. IEEE Int. Conf. Image Processing 3, (2005). 11. Lehmann, E.L. & Romano, J.P. Testing Statistical Hypotheses 3rd edn. (Springer, New York, 2005). 12. Benjamini, Y. & Yekutieli, D. Ann. Stat. 29, (2001). 13. Bai, X., Fernandez, I.S., McMullan, G. & Scheres, S.H. elife 2, e00461 (2013). 14. Yu, G. et al. PLoS ONE 8, e59817 (2013). 15. Bartesaghi, A., Lecumberry, F., Sapiro, G. & Subramaniam, S. Structure 20, (2012). 16. Davies, K.M., Anselmi, C., Wittig, I., Faraldo-Gómez, J.D. & Kühlbrandt, W. Proc. Natl. Acad. Sci. USA 109, (2012). 17. Pettersen, E.F. et al. J. Comput. Chem. 25, (2004). NATURE METHODS VOL.11 NO.1 JANUARY

4 npg 2014 Nature America, Inc. All rights reserved. ONLINE METHODS This section presents mathematical details of the theory and algorithm. The mathematical formulation is in three dimensions, but actual computations are performed on column vectors, where the elements in three dimensions are inserted in order into the vector. To highlight this difference, 3D variables are displayed in ordinary type (A) and their vectorized counterparts in bold type (A). Modeling the signal locally. We first describe how the density map can be approximated locally by any basis. Then we introduce the 3D sinusoid-like feature basis used in our algorithm. The 3D density map S is in a V V V voxel array. The voxels are indexed by discrete-valued coordinates x, y, z. We refer to a voxel in the array as v = (v x, v y, v z ) where v x, v y, v z are its coordinates. The vectorized density map of S is a V 3 1 column vector S. Suppose W v, is a spherically symmetric Gaussian function centered at voxel v with scaling parameter Wv, ( x, y, z) exp( [( x vx) ( y vy) ( z vz) ]) and that k v,, k = 1,, K are basis functions centered at v. We then have D D Wv, S Wv, v, which locally approximates the density map S by basis functions k v,. Here W D v, is a diagonal matrix with W v, along the principal diagonal; v, is a matrix whose columns are the basis functions k v,; is a column vector of the coefficients of the basis functions; and is zero-mean Gaussian noise with variance 2. Note that the weighting function W v, determines the spatial extent of the local model. To fit the local model to S, we minimize the weighted residual sum of squares (WRSS v, ) T D WRSSv, ( Sv, ) Wv, ( S v, ) 2 D Wv, ( S v, ) with respect to. The minimizing coefficient vector is denoted as. ˆ 3D sinusoid-like features. A natural basis for density maps is one containing rotated 3D sinusoids with wavelength Å. Unfortunately, describing all orientations in 3D requires an infinite number of basis functions. A computationally tractable alternative is to use steerable filters 9,10, which we refer to as steerable functions. Steerable functions are a finite set of functions with the property that every 3D rotation of any of the functions is produced by linear combinations of the functions 9 (Supplementary Note 1). The steerable functions we use are the second-order Hermite polynomial and its approximate quadrature, multiplied by a Gaussian function. We call this set H2. The elements of H2 match cosine and sine functions up to their second-order Taylor expansion terms. They can also be scaled such that their spectral peak occurs at any desired wavelength. The H2 steerable functions are constructed from a pair of functions Gv, ( x, y, z) PG v ( x, y, z) Wv x y z,, (,, ) 2 [( 4 ( x vx)) 2] Wv, (, x y, z ) Hv, ( x, y, z) P ( x, y, z) W x y z Hv v (,, ),, 3 [( ( x vx)) 2254(. ( x vx))] Wv, ( x, y, z) (1) (2) (3) (4) where G v, is the cosine-like function and H v, is the sine-like function. The scalar controls the peak frequency and the width of the Gaussian function. Setting = 2/ 2/5 gives a spectral peak for G v, and H v, at wavelength (Supplementary Note 2). The functions in equation (4) are each composed of the Hermite polynomial (P Gv, ) or its quadrature (P Hv, ) multiplied by W v,, the spherically symmetric Gaussian weighting function. Their spectral peak occurs on the x axis of the frequency domain because the functions are oriented along the spatial x axis. Rotating G v, and H v, so that their spectral peaks occur along the vertices and faces of an icosahedron respectively gives D steerable functions. The linear combination of these 16 functions produces all possible rotations of G v, and H v, in three dimensions 10, thereby covering a shell in the 3D Fourier domain (Supplementary Note 1). i We denote the rotated Hermite polynomials as P Gv, i = 1,, 6 j, and P H, j = 1,, 10. These polynomials and the constant function v, 1 are our local-sinusoid signal model. Because the weighting function W v, appears outside of the basis matrix v, in equation (2), the v, matrix need only contain the vectorized polynomials v, 1 P 1 Gv P, G 6 v P, H 1 v P, H 10 v, where the boldface denotes vectorization. Likelihood-ratio testing. Testing whether the data in the neighborhood of voxel v support the local-sinusoid model is equivalent to testing the two hypotheses 0 : The constant term 0 is unconstrained, but : All of 0, 1,, 1 6 are unconstrained (6) where the null hypothesis 0 states that the data do not support the local-sinusoid model (the coefficients of all local-sinusoid terms are 0). The alternate hypothesis 1 allows the coefficients to take on any finite value. The likelihood-ratio test 11 is a standard procedure for comparing such hypotheses. For this test, we calculate the s that maximize the likelihood (probability) under each hypothesis and then use the logarithm of the ratio of the maximized likelihoods. The s that maximize the likelihood are found by minimizing the WRSS from equation (3) under 0 and 1, respectively. Many common statistical tests such as the Pearson 2 test and the F-test are derived from the likelihood-ratio test (Supplementary Note 3). A simple calculation shows that the negative logarithm of the log-likelihood ratio, called the likelihood-ratio statistic (LRS), is given by 2 2 D alrs(;, ) ( ˆ, ) D S v 1 Wv S 1 Wv, ( S v, ˆ) 2 0 where T S ( ) 0 S 2 D D T D 1 T D 0 Wv, Wv, 11 ( Wv, 1) 1 Wv, D D T Wv, Wv, v, ( v, Wv D 1, v, ) v T, Wv D, (5) (7) NATURE METHODS doi: /nmeth.2727

5 npg 2014 Nature America, Inc. All rights reserved. The LRS is a difference of weighted residuals between the null model fit and the local-sinusoid model fit. It takes large values when the local-sinusoid model is a better fit than the null model. The likelihood-ratio test is applied by comparing the LRS to a number c, defined by T S ( 0 ) S Pr 2 c 1 p for some P value p, usually If LRS < c, then the data do not support the model and we accept the null hypothesis. Otherwise, we accept the hypothesis that the local-sinusoidal model fits the data. Calculating the threshold c requires the statistical distribution of the LRS. Unfortunately, because of the weighting function W v,, the LRS does not have a closed-form statistical distribution. However, S T ( 0 )S asymptotically tends to a weighted sum of 2 random variables r r 2, where r are the eigenvalues 18 of 0. Fast and accurate numerical methods are available to compute such distributions 19. The LRS computation requires the value of the noise variance 2. We estimate this variance accurately by taking nonoverlapping cubes of voxels from the region of the density map surrounding the particle. We use the following variance estimator recommended for local-signal modeling 18 ˆ ( ) 2 1 T B C b 0 Cb B b 1 trace( 0 ) (8) (9) where C b is a cube of voxels from the background and B is the number of nonoverlapping cubes that are available in the background. This estimator is robust to non-white noise as it only requires the noise spectrum to be relatively flat within the shell in 3D Fourier space that the local-sinusoid model, implicitly indicated by, is approximating. The noise variance may also be estimated from the difference map between split data set density maps. In this case, the estimator from equation (9) is adjusted to accept cubes of voxels from the region inside the particle. The noise statistics inside and outside the particle are nearly identical (Supplementary Note 4). Both noise-variance estimators are implemented in the accompanying software package (Supplementary Software; sourceforge.net/). Multiple-testing correction. The likelihood-ratio test chooses between two hypotheses at each voxel. Because this test has to be repeated for many voxels in S, some sort of false discovery rate (FDR) control is necessary. The tests in neighboring windows are not independent from each other; therefore, we use the Benjamini-Yekutieli FDR procedure 12 that accounts for dependencies between tests. Summary. ResMap works by applying a hypothesis test at every voxel. The null hypothesis is that the data in the neighborhood of a voxel do not support a local sinusoid. The alternative hypothesis is that the data describe a local sinusoid. These features are modeled by 3D steerable functions. The likelihood-ratio statistic is used to decide between the hypotheses at a given P value. Noise variance is estimated from the area surrounding the particle, and multiple-testing correction is applied to carry out the test at many voxels. 18. Loader, C. Local Regression and Likelihood (Springer, New York, 1999). 19. Farebrother, R.W. J. R. Stat. Soc. Ser. C Appl. Stat. 33, (1984). doi: /nmeth.2727 NATURE METHODS

6 Supplementary Material The Local Resolution of Cryo-EM Density Maps Alp Kucukelbir 1, Fred J. Sigworth 1,2, and Hemant D. Tagare 1,3 1 Department of Biomedical Engineering, Yale University, New Haven, United States 2 Department of Cellular and Molecular Physiology, Yale University, New Haven, United States 3 Department of Diagnostic Radiology, Yale University, New Haven, United States Correspondence should be addressed to HDT (hemant.tagare@yale.edu) Contents Supplementary Figure 1: Simulated data visualization 2 Supplementary Figure 2: Comparison of windowed FSC results 3 Supplementary Figure 3: Comparison of windowed FSC and ResMap-H2 results 4 Supplementary Figure 4: ResMap behavior for typical statistical confidence levels 5 Supplementary Figure 5: Screenshot of ResMap s graphical user interface 6 Supplementary Note 1: Steerable Functions 7 Supplementary Note 2: Scaling of the Basis Functions 8 Supplementary Note 3: Likelihood Ratio Testing Framework 9 Supplementary Note 4: Noise Statistics Inside and Outside the Particle 10 References 15 1

7 Supplementary Figure 1 a b Arbitrary Units white, variance = 0.5 1/f, variance = 0.5 white, variance = 2.0 1/f, variance = Synthetic Signal Signal plus white σ 2 = 0.5 noise 10 Signal plus 1/f σ 2 = 0.5 noise Voxels Supplementary Figure 1 Simulated data visualization. The simulated signal is 3 cos(2 (1/(1 4p R +0.15))) + 3 where R is a radius map with zeros outside radius 38. We added both white and 1/f noise to the data. The purpose of the latter is to demonstrate the robustness of the local resolution estimates to non-white noise, which is typical of cryo-em images 1. (a) Central slices through simulated data corrupted by white and 1/f non-white noise at two variance levels. (b) Plot through central line for the variance level 2 =0.5. 2

8 Supplementary Figure boxsize = 10 boxsize = 18 boxsize = Å Supplementary Figure 2 Comparison of windowed FSC results. S.cerevisiae ribosome 2 (EMD2275, split-dataset maps courtesy of the authors) volumes are rendered and colored with the output of blocres 3 using varying window sizes. Values are reported in A. Results are sensitive to the boxsize parameter and take 25 minutes (boxsize = 10) to four hours (boxsize = 25) to compute on a four-core Fedora 14 workstation. 3

9 Supplementary Figure 3 a b Windowed FSC ResMap-H A B 9.5 Density Map ResMap-H2 Windowed FSC 8.5 Supplementary Figure 3 Comparison of windowed FSC and ResMap-H2 results for the 26S Proteasome 4 (EMD-1992). Windowed FSC results were obtained using blocres 3 with boxsize = 18 (personal communication with Gabriel Lander). Values are reported in Å. (a) Volumes were median filtered in UCSF Chimera for visualization. Left: windowed FSC results. Right: ResMap-H2 results. The windowed FSC results estimate a lower resolution than ResMap-H2 in the area delineated in the black circle. This may be the result of windowed FSC using neighboring voxels in the solvent. (b) Central slice through unfiltered density map. Letters A and B highlight regions where the visual detail level appears to be comparable. ResMap-H2 corroborates this by assigning similar resolutions to both regions, while windowed FSC results appears to underestimate resolution in region A. 7.5 Å 4

10 Supplementary Figure 4 p-value = 0.01 p-value = 0.05 Supplementary Figure 4 ResMap behavior for typical statistical confidence levels. Results shown on the 80S ribosome 2 (EMD-2275). Colorbar values are reported in Å. As the p-value decreases, it is expected that fewer likelihood-ratio tests pass at smaller wavelengths. This is observed in the histograms above (note the di erent y-axis limits). Visualizations and histograms are generated from ResMap (Supplementary Software; 5

11 Supplementary Figure 5 Supplementary Figure 5 Screenshot of ResMap s graphical user interface on Mac OSX. The volume to be analyzed is the only required input. The optional inputs may be used to analyze a specific resolution range and/or reduce computation time by taking larger step sizes. The algorithm will automatically delineate the particle from its surrounding solvent, though the option to override this using a mask volume is also available. Further details are provided within the software package manual (Supplementary Software; 6

12 Supplementary Note 1: Steerable Functions Steerable functions are a finite set of functions with the property that linear combinations of these functions produce all possible rotations of themselves 5. For example, the G v, function defined in the Online Methods section is a steerable function. In three dimensions, six G i v, s oriented along the vertices of the icosahedron are su cient to produce any arbitrary rotation of G 6 v,. The icosahedrally oriented set of functions G i v, for i =1,, 6, are shown in Supplementary Figure 6a-f. Supplementary Figure 6g shows a G v, function oriented along the z-axis. This function is not in the original set G 1 v,,,g 6 v,, but can be obtained as, G v, = G 1 v, G 2 v, 0.25 G 3 v, G 4 v, 0.25 G 5 v, G 6 v,. Similar results follow for H v, with 10 rotated versions, oriented along the faces of the icosahedron. a b c g d e f Supplementary Figure 6: G i v, steerable functions. Red and blue indicate negative and positive parts, respectively. Subfigures (a) through (f) depict G i v, for i =1,, 6. Subfigure (g) shows an arbitrarily rotated G v, that can be obtained as a linear combination of the previous six functions. 7

13 Supplementary Note 2: Scaling of the Basis Functions For simplicity we consider the one-dimensional G v, function centered at v x = 0. Extending the result to 2D and 3D is trivial and the centering does not a ect the spectral peak. The one-dimensional G v, function is defined as G v, (x) = 4( x) 2 ( x) 2 2 exp, 2 and its Fourier transform is F[G v, ](!) = 1! exp 2 2!2. Taking the derivative of the Fourier transform and setting it to zero gives the maximum at r 5! = ± 2. To scale G v, such that its spectrum peaks at! =2 (1/ )weset = 2 r 2 5, where is the desired spatial resolution we seek in Angstroms. We can use the same factor for the quadrature function H v,, since it is a polynomial fit to the Hilbert transform of G v,, which in this case is simply a phase shift 5. 8

14 Supplementary Note 3: Likelihood Ratio Testing Framework The model described in the Online Methods section implies the following likelihood of observing the density map S at voxel v under a local-sinusoid model with scaling parameter, 1 q L(S ; v, ) / exp 2 2 Wv, (S D v, ) 2, where / means proportional to and k k 2 is the sum of voxels squared. The likelihood ratio is then simply the following ratio (S ; v, ) = max{l(s ; v, ) : restrained to H 0} max{l(s ; v, ) : restrained to H 1 } = L(S b 0 ; v, ) L(S b ; v, ) where b 0 and b are the coe cient vectors that minimize the weighted residual sum of squares under the local constant and local-sinusoid models, respectively. To ease computations, it is common to calculate the likelihood ratio statistic (LRS). Below we present the calculation of the LRS: LRS(S ; v, ) = 2ln (S ; v, ) = 2ln L(S b 0 ; v, ) +2ln L(S b ; v, ) = 1 q W 2 v, (S D 1 b 0) 2 q Wv, (S D b v, ) 2 = 1 (S 1 b 2 0) > Wv, (S D 1 b 0) (S b v, ) > Wv, (S D b v, ) = S> 0S S > S 2 = S> ( 0 )S 2 0 = W D v, W D v, 1 1 > W D v, > W D v, =W D v, W D v, v, > v, W D v, v, 1 > v, W D v, 9

15 Supplementary Note 4: Noise Statistics Inside and Outside the Particle The theory presented in the Online Methods section is independent of the method used to estimate the noise variance. We use two noise estimators: one which analyzes the region outside the particle of a single reconstruction, and another which analyzes the di erence between two split-dataset reconstructions in the region of the particle. Both approaches provide similar estimates of the noise variance and the noise statistics inside and outside the particle are nearly identical. The variance estimates agree to better than 20%, and their power spectra are indistinguishable for our purposes. Supplementary Figures 7-9 show the first order statistics of the noise inside and outside the particle region of three particles that span the 4 to 40Å range. Supplementary Figures show the corresponding noise power spectra Slice 120 of the di erence map Standard deviation inside: 8.29e-03 Gaussian with estimated sample mean and variance Histogram Slice 120 of the particle mask Standard deviation outisde: 6.99e-03 Gaussian with estimated sample mean and variance Histogram Supplementary Figure 7: Noise histograms for the S.cerevisiae Ribosome (EMD-2275). The di erence map is computed by subtracting one of the split reconstruction from the other. The particle mask delineates where the protein is located. The histograms of the voxels show that the noise distribution follows a Gaussian shape, both inside and outside the particle. Moreover, the standard deviations of the histograms are very similar. 10

16 0 Slice 120 of the di erence map Standard deviation inside: 6.31e-01 Gaussian with estimated sample mean and variance Histogram Slice 120 of the particle mask Standard deviation outside: 6.72e-01 Gaussian with estimated sample mean and variance Histogram Supplementary Figure 8: Noise histograms for the 26S Proteasome (EMD-1992). The di erence map is computed by subtracting one of the split reconstruction from the other. The particle mask delineates where the protein is located. The histograms of the voxels show that the noise distribution follows a Gaussian shape, both inside and outside the particle. Moreover, the standard deviations of the histograms are very similar. 11

17 Standard deviation inside: 4.30e+00 0 Slice 48 of the di erence map Gaussian with estimated sample mean and variance Histogram Standard deviation outside: 4.18e+00 0 Slice 48 of the particle mask Gaussian with estimated sample mean and variance Histogram Supplementary Figure 9: Noise histograms for the ATP Synthase Dimer (EMD-2161). The di erence map is computed by subtracting one of the split reconstruction from the other. The particle mask delineates where the protein is located. The histograms of the voxels show that the noise distribution follows a Gaussian shape, both inside and outside the particle. Moreover, the standard deviations of the histograms are very similar. 12

18 Radially Averaged Spectral Power ( f 2 ) S.cerevisiae Ribosome 10 4 Inside the protein Outside the protein (background) Frequency Supplementary Figure 10: Noise spectra for the S.cerevisiae Ribosome (EMD-2275). A box of size 40 voxels was placed inside and outside the protein mask and outside the protein. A 3D Fourier transform was computed for each box and then radially/spherically averaged to produce the plot above. 13

19 Radially Averaged Spectral Power ( f 2 ) S Proteasome Inside the protein Outside the protein (background) Frequency Supplementary Figure 11: Noise spectra for the 26S Proteasome (EMD-1992).A box of size 40 voxels was placed inside and outside the protein mask and outside the protein. A 3D Fourier transform was computed for each box and then radially/spherically averaged to produce the plot above. Radially Averaged Spectral Power ( f 2 ) ATP Synthase Dimer Inside the protein Outside the protein (background) Inside the membrane Frequency Supplementary Figure 12: Noise spectra the ATP Synthase Dimer (EMD-2161). A box of size 22 voxels was placed inside the protein (i.e. where there is the ATP Synthase dimer), inside the membrane (i.e. where there is membrane density), and outside both. A 3D Fourier transform was computed for each box and then radially/spherically averaged to produce the plot above. 14

20 References [1] Baxter, W., Grassucci, R., Gao, H. & Frank, J. J. Struct. Biol. 166, 126 (2009). [2] Bai, X., Fernandez, I. S., McMullan, G. & Scheres, S. H. elife Sci. 2 (2013). [3] Heymann, J. B. & Belnap, D. M. J. Struct. Biol. 157, 3 (2007). [4] Lander, G. C. et al. Nature 482, (2012). [5] Freeman, W. T. & Adelson, E. H. IEEE Trans. Pattern Anal. Mach. Intell. 13, (1991). [6] Derpanis, K. G. & Gryn, J. M. IEEE Inter. Conf. Image Process. 3, 553 (2005). 15

Likelihood-based optimization of cryo-em data. Sjors Scheres National Center for Biotechnology CSIC Madrid, Spain

Likelihood-based optimization of cryo-em data. Sjors Scheres National Center for Biotechnology CSIC Madrid, Spain Likelihood-based optimization of cryo-em data Sjors Scheres National Center for Biotechnology CSIC Madrid, Spain Life based on molecular machines DNA replication Protein synthesis Dynein motion Molecular

More information

Chapter 4. Clustering Core Atoms by Location

Chapter 4. Clustering Core Atoms by Location Chapter 4. Clustering Core Atoms by Location In this chapter, a process for sampling core atoms in space is developed, so that the analytic techniques in section 3C can be applied to local collections

More information

3. Image formation, Fourier analysis and CTF theory. Paula da Fonseca

3. Image formation, Fourier analysis and CTF theory. Paula da Fonseca 3. Image formation, Fourier analysis and CTF theory Paula da Fonseca EM course 2017 - Agenda - Overview of: Introduction to Fourier analysis o o o o Sine waves Fourier transform (simple examples of 1D

More information

Structural Basis for RNA Processing by the Human. RISC-Loading Complex

Structural Basis for RNA Processing by the Human. RISC-Loading Complex Supplementary Information Structural Basis for RNA Processing by the Human RISC-Loading Complex Hong-Wei Wang, Cameron Noland, Bunpote Siridechadilok, David W. Taylor, Enbo Ma, Karin Felderer, Jennifer

More information

FMA901F: Machine Learning Lecture 3: Linear Models for Regression. Cristian Sminchisescu

FMA901F: Machine Learning Lecture 3: Linear Models for Regression. Cristian Sminchisescu FMA901F: Machine Learning Lecture 3: Linear Models for Regression Cristian Sminchisescu Machine Learning: Frequentist vs. Bayesian In the frequentist setting, we seek a fixed parameter (vector), with value(s)

More information

Image Alignment and Application of 2D Fast Rotational Matching in Single Particle cryo-electron Microscopy. Yao Cong. Baylor College of Medicine

Image Alignment and Application of 2D Fast Rotational Matching in Single Particle cryo-electron Microscopy. Yao Cong. Baylor College of Medicine Image Alignment and Application of 2D Fast Rotational Matching in Single Particle cryo-electron Microscopy Yao Cong Baylor College of Medicine cryo-em & single particle analysis Single-particle electron

More information

3D Reconstruction in EM

3D Reconstruction in EM 3D Reconstruction in EM C.O.S. Sorzano Biocomputing Unit, CNB-CSIC Instruct Image Processing Center Contents Initial volume Angular assignment 3D Reconstruction 3D Classification Resolution Amplitude correction

More information

Biometrics Technology: Image Processing & Pattern Recognition (by Dr. Dickson Tong)

Biometrics Technology: Image Processing & Pattern Recognition (by Dr. Dickson Tong) Biometrics Technology: Image Processing & Pattern Recognition (by Dr. Dickson Tong) References: [1] http://homepages.inf.ed.ac.uk/rbf/hipr2/index.htm [2] http://www.cs.wisc.edu/~dyer/cs540/notes/vision.html

More information

Digital Image Processing (CS/ECE 545) Lecture 5: Edge Detection (Part 2) & Corner Detection

Digital Image Processing (CS/ECE 545) Lecture 5: Edge Detection (Part 2) & Corner Detection Digital Image Processing (CS/ECE 545) Lecture 5: Edge Detection (Part 2) & Corner Detection Prof Emmanuel Agu Computer Science Dept. Worcester Polytechnic Institute (WPI) Recall: Edge Detection Image processing

More information

Maximum-likelihood methods

Maximum-likelihood methods Maximum-likelihood methods Fred Sigworth, Andrew Barthel, Hemant Tagare Yale University Maximum Likelihood solves all problems. a b Frequency µ 1 µ 2 µ 3 Measured value 3D reconstruction as an optimization

More information

Analysis of Functional MRI Timeseries Data Using Signal Processing Techniques

Analysis of Functional MRI Timeseries Data Using Signal Processing Techniques Analysis of Functional MRI Timeseries Data Using Signal Processing Techniques Sea Chen Department of Biomedical Engineering Advisors: Dr. Charles A. Bouman and Dr. Mark J. Lowe S. Chen Final Exam October

More information

Supplementary Figure 1. Decoding results broken down for different ROIs

Supplementary Figure 1. Decoding results broken down for different ROIs Supplementary Figure 1 Decoding results broken down for different ROIs Decoding results for areas V1, V2, V3, and V1 V3 combined. (a) Decoded and presented orientations are strongly correlated in areas

More information

Texture. Texture is a description of the spatial arrangement of color or intensities in an image or a selected region of an image.

Texture. Texture is a description of the spatial arrangement of color or intensities in an image or a selected region of an image. Texture Texture is a description of the spatial arrangement of color or intensities in an image or a selected region of an image. Structural approach: a set of texels in some regular or repeated pattern

More information

Single-particle electron microscopy (cryo-electron microscopy) CS/CME/BioE/Biophys/BMI 279 Nov. 16 and 28, 2017 Ron Dror

Single-particle electron microscopy (cryo-electron microscopy) CS/CME/BioE/Biophys/BMI 279 Nov. 16 and 28, 2017 Ron Dror Single-particle electron microscopy (cryo-electron microscopy) CS/CME/BioE/Biophys/BMI 279 Nov. 16 and 28, 2017 Ron Dror 1 Last month s Nobel Prize in Chemistry Awarded to Jacques Dubochet, Joachim Frank

More information

THREE-DIMENSIONA L ELECTRON MICROSCOP Y OF MACROMOLECULAR ASSEMBLIE S. Visualization of Biological Molecules in Their Native Stat e.

THREE-DIMENSIONA L ELECTRON MICROSCOP Y OF MACROMOLECULAR ASSEMBLIE S. Visualization of Biological Molecules in Their Native Stat e. THREE-DIMENSIONA L ELECTRON MICROSCOP Y OF MACROMOLECULAR ASSEMBLIE S Visualization of Biological Molecules in Their Native Stat e Joachim Frank CHAPTER 1 Introduction 1 1 The Electron Microscope and

More information

Image Restoration and Reconstruction

Image Restoration and Reconstruction Image Restoration and Reconstruction Image restoration Objective process to improve an image, as opposed to the subjective process of image enhancement Enhancement uses heuristics to improve the image

More information

Understanding Clustering Supervising the unsupervised

Understanding Clustering Supervising the unsupervised Understanding Clustering Supervising the unsupervised Janu Verma IBM T.J. Watson Research Center, New York http://jverma.github.io/ jverma@us.ibm.com @januverma Clustering Grouping together similar data

More information

Lecture 4: Spatial Domain Transformations

Lecture 4: Spatial Domain Transformations # Lecture 4: Spatial Domain Transformations Saad J Bedros sbedros@umn.edu Reminder 2 nd Quiz on the manipulator Part is this Fri, April 7 205, :5 AM to :0 PM Open Book, Open Notes, Focus on the material

More information

Lecture 3: Geometric and Signal 3D Processing (and some Visualization)

Lecture 3: Geometric and Signal 3D Processing (and some Visualization) Lecture 3: Geometric and Signal 3D Processing (and some Visualization) Chandrajit Bajaj Algorithms & Tools Structure elucidation: filtering, contrast enhancement, segmentation, skeletonization, subunit

More information

Nature Structural & Molecular Biology: doi: /nsmb.2467

Nature Structural & Molecular Biology: doi: /nsmb.2467 Supplementary Figure 1. Cryo-electron tomography and GRAFIX optimization of COPII cages. a) Tomogram of Sec13-31 cages viewed along the air/water interface. The tomogram shows a large amount of disordered

More information

MULTICHANNEL image processing is studied in this

MULTICHANNEL image processing is studied in this 186 IEEE SIGNAL PROCESSING LETTERS, VOL. 6, NO. 7, JULY 1999 Vector Median-Rational Hybrid Filters for Multichannel Image Processing Lazhar Khriji and Moncef Gabbouj, Senior Member, IEEE Abstract In this

More information

Supplementary Information. Structure of a RSC nucleosome Complex and Insights into Chromatin Remodeling

Supplementary Information. Structure of a RSC nucleosome Complex and Insights into Chromatin Remodeling Supplementary Information Structure of a RSC nucleosome Complex and Insights into Chromatin Remodeling Yuriy Chaban 1, Chukwudi Ezeokonkwo 1, Wen-Hsiang Chung 1, Fan Zhang 1, Roger D. Kornberg 2, Barbara

More information

Relationship between Fourier Space and Image Space. Academic Resource Center

Relationship between Fourier Space and Image Space. Academic Resource Center Relationship between Fourier Space and Image Space Academic Resource Center Presentation Outline What is an image? Noise Why do we transform images? What is the Fourier Transform? Examples of images in

More information

Clustering CS 550: Machine Learning

Clustering CS 550: Machine Learning Clustering CS 550: Machine Learning This slide set mainly uses the slides given in the following links: http://www-users.cs.umn.edu/~kumar/dmbook/ch8.pdf http://www-users.cs.umn.edu/~kumar/dmbook/dmslides/chap8_basic_cluster_analysis.pdf

More information

Digital Image Processing. Prof. P. K. Biswas. Department of Electronic & Electrical Communication Engineering

Digital Image Processing. Prof. P. K. Biswas. Department of Electronic & Electrical Communication Engineering Digital Image Processing Prof. P. K. Biswas Department of Electronic & Electrical Communication Engineering Indian Institute of Technology, Kharagpur Lecture - 21 Image Enhancement Frequency Domain Processing

More information

Robust Lip Contour Extraction using Separability of Multi-Dimensional Distributions

Robust Lip Contour Extraction using Separability of Multi-Dimensional Distributions Robust Lip Contour Extraction using Separability of Multi-Dimensional Distributions Tomokazu Wakasugi, Masahide Nishiura and Kazuhiro Fukui Corporate Research and Development Center, Toshiba Corporation

More information

Scanner Parameter Estimation Using Bilevel Scans of Star Charts

Scanner Parameter Estimation Using Bilevel Scans of Star Charts ICDAR, Seattle WA September Scanner Parameter Estimation Using Bilevel Scans of Star Charts Elisa H. Barney Smith Electrical and Computer Engineering Department Boise State University, Boise, Idaho 8375

More information

Segger Tutorial. NCMI Workshop on Single Particle Reconstruction, Validation and Analysis. March 14-17, 2011

Segger Tutorial. NCMI Workshop on Single Particle Reconstruction, Validation and Analysis. March 14-17, 2011 NCMI Workshop on Single Particle Reconstruction, Validation and Analysis March 14-17, 2011 Segger Tutorial Segmentation of Density Maps and Rigid Body Docking of Structures Greg Pintilie Baylor College

More information

Edge and corner detection

Edge and corner detection Edge and corner detection Prof. Stricker Doz. G. Bleser Computer Vision: Object and People Tracking Goals Where is the information in an image? How is an object characterized? How can I find measurements

More information

Image Restoration and Reconstruction

Image Restoration and Reconstruction Image Restoration and Reconstruction Image restoration Objective process to improve an image Recover an image by using a priori knowledge of degradation phenomenon Exemplified by removal of blur by deblurring

More information

The Curse of Dimensionality

The Curse of Dimensionality The Curse of Dimensionality ACAS 2002 p1/66 Curse of Dimensionality The basic idea of the curse of dimensionality is that high dimensional data is difficult to work with for several reasons: Adding more

More information

ECE 176 Digital Image Processing Handout #14 Pamela Cosman 4/29/05 TEXTURE ANALYSIS

ECE 176 Digital Image Processing Handout #14 Pamela Cosman 4/29/05 TEXTURE ANALYSIS ECE 176 Digital Image Processing Handout #14 Pamela Cosman 4/29/ TEXTURE ANALYSIS Texture analysis is covered very briefly in Gonzalez and Woods, pages 66 671. This handout is intended to supplement that

More information

Digital Volume Correlation for Materials Characterization

Digital Volume Correlation for Materials Characterization 19 th World Conference on Non-Destructive Testing 2016 Digital Volume Correlation for Materials Characterization Enrico QUINTANA, Phillip REU, Edward JIMENEZ, Kyle THOMPSON, Sharlotte KRAMER Sandia National

More information

Parametric Texture Model based on Joint Statistics

Parametric Texture Model based on Joint Statistics Parametric Texture Model based on Joint Statistics Gowtham Bellala, Kumar Sricharan, Jayanth Srinivasa Department of Electrical Engineering, University of Michigan, Ann Arbor 1. INTRODUCTION Texture images

More information

Vivekananda. Collegee of Engineering & Technology. Question and Answers on 10CS762 /10IS762 UNIT- 5 : IMAGE ENHANCEMENT.

Vivekananda. Collegee of Engineering & Technology. Question and Answers on 10CS762 /10IS762 UNIT- 5 : IMAGE ENHANCEMENT. Vivekananda Collegee of Engineering & Technology Question and Answers on 10CS762 /10IS762 UNIT- 5 : IMAGE ENHANCEMENT Dept. Prepared by Harivinod N Assistant Professor, of Computer Science and Engineering,

More information

Spatial Enhancement Definition

Spatial Enhancement Definition Spatial Enhancement Nickolas Faust The Electro- Optics, Environment, and Materials Laboratory Georgia Tech Research Institute Georgia Institute of Technology Definition Spectral enhancement relies on changing

More information

CHAPTER 3 IMAGE ENHANCEMENT IN THE SPATIAL DOMAIN

CHAPTER 3 IMAGE ENHANCEMENT IN THE SPATIAL DOMAIN CHAPTER 3 IMAGE ENHANCEMENT IN THE SPATIAL DOMAIN CHAPTER 3: IMAGE ENHANCEMENT IN THE SPATIAL DOMAIN Principal objective: to process an image so that the result is more suitable than the original image

More information

An Intuitive Explanation of Fourier Theory

An Intuitive Explanation of Fourier Theory An Intuitive Explanation of Fourier Theory Steven Lehar slehar@cns.bu.edu Fourier theory is pretty complicated mathematically. But there are some beautifully simple holistic concepts behind Fourier theory

More information

Detection, Classification, & Identification of Objects in Cluttered Images

Detection, Classification, & Identification of Objects in Cluttered Images Detection, Classification, & Identification of Objects in Cluttered Images Steve Elgar Washington State University Electrical Engineering 2752 Pullman, Washington 99164-2752 elgar@eecs.wsu.edu Voice: (509)

More information

Quantifying Three-Dimensional Deformations of Migrating Fibroblasts

Quantifying Three-Dimensional Deformations of Migrating Fibroblasts 45 Chapter 4 Quantifying Three-Dimensional Deformations of Migrating Fibroblasts This chapter presents the full-field displacements and tractions of 3T3 fibroblast cells during migration on polyacrylamide

More information

Michael Moody School of Pharmacy University of London 29/39 Brunswick Square London WC1N 1AX, U.K.

Michael Moody School of Pharmacy University of London 29/39 Brunswick Square London WC1N 1AX, U.K. This material is provided for educational use only. The information in these slides including all data, images and related materials are the property of : Michael Moody School of Pharmacy University of

More information

Classification of Hyperspectral Breast Images for Cancer Detection. Sander Parawira December 4, 2009

Classification of Hyperspectral Breast Images for Cancer Detection. Sander Parawira December 4, 2009 1 Introduction Classification of Hyperspectral Breast Images for Cancer Detection Sander Parawira December 4, 2009 parawira@stanford.edu In 2009 approximately one out of eight women has breast cancer.

More information

Computer Vision I - Filtering and Feature detection

Computer Vision I - Filtering and Feature detection Computer Vision I - Filtering and Feature detection Carsten Rother 30/10/2015 Computer Vision I: Basics of Image Processing Roadmap: Basics of Digital Image Processing Computer Vision I: Basics of Image

More information

Interactive Boundary Detection for Automatic Definition of 2D Opacity Transfer Function

Interactive Boundary Detection for Automatic Definition of 2D Opacity Transfer Function Interactive Boundary Detection for Automatic Definition of 2D Opacity Transfer Function Martin Rauberger, Heinrich Martin Overhoff Medical Engineering Laboratory, University of Applied Sciences Gelsenkirchen,

More information

Three-dimensional structure and flexibility of a membrane-coating module of the nuclear pore complex

Three-dimensional structure and flexibility of a membrane-coating module of the nuclear pore complex CORRECTION NOTICE Nat. Struct. Mol. Biol. advance online publication, doi:10.1038/nsmb.1618 (7 June 2009) Three-dimensional structure and flexibility of a membrane-coating module of the nuclear pore complex

More information

Fourier analysis of low-resolution satellite images of cloud

Fourier analysis of low-resolution satellite images of cloud New Zealand Journal of Geology and Geophysics, 1991, Vol. 34: 549-553 0028-8306/91/3404-0549 $2.50/0 Crown copyright 1991 549 Note Fourier analysis of low-resolution satellite images of cloud S. G. BRADLEY

More information

Single Particle Reconstruction Techniques

Single Particle Reconstruction Techniques T H E U N I V E R S I T Y of T E X A S S C H O O L O F H E A L T H I N F O R M A T I O N S C I E N C E S A T H O U S T O N Single Particle Reconstruction Techniques For students of HI 6001-125 Computational

More information

INTENSITY TRANSFORMATION AND SPATIAL FILTERING

INTENSITY TRANSFORMATION AND SPATIAL FILTERING 1 INTENSITY TRANSFORMATION AND SPATIAL FILTERING Lecture 3 Image Domains 2 Spatial domain Refers to the image plane itself Image processing methods are based and directly applied to image pixels Transform

More information

3 Nonlinear Regression

3 Nonlinear Regression CSC 4 / CSC D / CSC C 3 Sometimes linear models are not sufficient to capture the real-world phenomena, and thus nonlinear models are necessary. In regression, all such models will have the same basic

More information

Robust Shape Retrieval Using Maximum Likelihood Theory

Robust Shape Retrieval Using Maximum Likelihood Theory Robust Shape Retrieval Using Maximum Likelihood Theory Naif Alajlan 1, Paul Fieguth 2, and Mohamed Kamel 1 1 PAMI Lab, E & CE Dept., UW, Waterloo, ON, N2L 3G1, Canada. naif, mkamel@pami.uwaterloo.ca 2

More information

Spectral Compression: Weighted Principal Component Analysis versus Weighted Least Squares

Spectral Compression: Weighted Principal Component Analysis versus Weighted Least Squares Spectral Compression: Weighted Principal Component Analysis versus Weighted Least Squares Farnaz Agahian a*, Brian Funt a, Seyed Hossein Amirshahi b a Simon Fraser University, 8888 University Dr. V5A 1S6,

More information

Computer Vision I. Announcements. Fourier Tansform. Efficient Implementation. Edge and Corner Detection. CSE252A Lecture 13.

Computer Vision I. Announcements. Fourier Tansform. Efficient Implementation. Edge and Corner Detection. CSE252A Lecture 13. Announcements Edge and Corner Detection HW3 assigned CSE252A Lecture 13 Efficient Implementation Both, the Box filter and the Gaussian filter are separable: First convolve each row of input image I with

More information

CS 664 Segmentation. Daniel Huttenlocher

CS 664 Segmentation. Daniel Huttenlocher CS 664 Segmentation Daniel Huttenlocher Grouping Perceptual Organization Structural relationships between tokens Parallelism, symmetry, alignment Similarity of token properties Often strong psychophysical

More information

UNIT - 5 IMAGE ENHANCEMENT IN SPATIAL DOMAIN

UNIT - 5 IMAGE ENHANCEMENT IN SPATIAL DOMAIN UNIT - 5 IMAGE ENHANCEMENT IN SPATIAL DOMAIN Spatial domain methods Spatial domain refers to the image plane itself, and approaches in this category are based on direct manipulation of pixels in an image.

More information

Spatial Patterns Point Pattern Analysis Geographic Patterns in Areal Data

Spatial Patterns Point Pattern Analysis Geographic Patterns in Areal Data Spatial Patterns We will examine methods that are used to analyze patterns in two sorts of spatial data: Point Pattern Analysis - These methods concern themselves with the location information associated

More information

Image denoising using curvelet transform: an approach for edge preservation

Image denoising using curvelet transform: an approach for edge preservation Journal of Scientific & Industrial Research Vol. 3469, January 00, pp. 34-38 J SCI IN RES VOL 69 JANUARY 00 Image denoising using curvelet transform: an approach for edge preservation Anil A Patil * and

More information

Determination of Three-Dimensional Voxel Sensitivity for Two- and Three-Headed Coincidence Imaging

Determination of Three-Dimensional Voxel Sensitivity for Two- and Three-Headed Coincidence Imaging IEEE TRANSACTIONS ON NUCLEAR SCIENCE, VOL. 50, NO. 3, JUNE 2003 405 Determination of Three-Dimensional Voxel Sensitivity for Two- and Three-Headed Coincidence Imaging Edward J. Soares, Kevin W. Germino,

More information

Recent advances in Metamodel of Optimal Prognosis. Lectures. Thomas Most & Johannes Will

Recent advances in Metamodel of Optimal Prognosis. Lectures. Thomas Most & Johannes Will Lectures Recent advances in Metamodel of Optimal Prognosis Thomas Most & Johannes Will presented at the Weimar Optimization and Stochastic Days 2010 Source: www.dynardo.de/en/library Recent advances in

More information

Bayesian Spherical Wavelet Shrinkage: Applications to Shape Analysis

Bayesian Spherical Wavelet Shrinkage: Applications to Shape Analysis Bayesian Spherical Wavelet Shrinkage: Applications to Shape Analysis Xavier Le Faucheur a, Brani Vidakovic b and Allen Tannenbaum a a School of Electrical and Computer Engineering, b Department of Biomedical

More information

First-level fmri modeling

First-level fmri modeling First-level fmri modeling Monday, Lecture 3 Jeanette Mumford University of Wisconsin - Madison What do we need to remember from the last lecture? What is the general structure of a t- statistic? How about

More information

CHAPTER 6 IDENTIFICATION OF CLUSTERS USING VISUAL VALIDATION VAT ALGORITHM

CHAPTER 6 IDENTIFICATION OF CLUSTERS USING VISUAL VALIDATION VAT ALGORITHM 96 CHAPTER 6 IDENTIFICATION OF CLUSTERS USING VISUAL VALIDATION VAT ALGORITHM Clustering is the process of combining a set of relevant information in the same group. In this process KM algorithm plays

More information

Image denoising in the wavelet domain using Improved Neigh-shrink

Image denoising in the wavelet domain using Improved Neigh-shrink Image denoising in the wavelet domain using Improved Neigh-shrink Rahim Kamran 1, Mehdi Nasri, Hossein Nezamabadi-pour 3, Saeid Saryazdi 4 1 Rahimkamran008@gmail.com nasri_me@yahoo.com 3 nezam@uk.ac.ir

More information

3D RECONSTRUCTION OF BRAIN TISSUE

3D RECONSTRUCTION OF BRAIN TISSUE 3D RECONSTRUCTION OF BRAIN TISSUE Hylke Buisman, Manuel Gomez-Rodriguez, Saeed Hassanpour {hbuisman, manuelgr, saeedhp}@stanford.edu Department of Computer Science, Department of Electrical Engineering

More information

The Elimination of Correlation Errors in PIV Processing

The Elimination of Correlation Errors in PIV Processing 9 th International Symposium on Applications of Laser Techniques to Fluid Mechanics, Lisbon, Portugal, July, 1998 The Elimination of Correlation Errors in PIV Processing Douglas P. Hart Massachusetts Institute

More information

EE795: Computer Vision and Intelligent Systems

EE795: Computer Vision and Intelligent Systems EE795: Computer Vision and Intelligent Systems Spring 2012 TTh 17:30-18:45 WRI C225 Lecture 04 130131 http://www.ee.unlv.edu/~b1morris/ecg795/ 2 Outline Review Histogram Equalization Image Filtering Linear

More information

Image Transformation Techniques Dr. Rajeev Srivastava Dept. of Computer Engineering, ITBHU, Varanasi

Image Transformation Techniques Dr. Rajeev Srivastava Dept. of Computer Engineering, ITBHU, Varanasi Image Transformation Techniques Dr. Rajeev Srivastava Dept. of Computer Engineering, ITBHU, Varanasi 1. Introduction The choice of a particular transform in a given application depends on the amount of

More information

Advanced phase retrieval: maximum likelihood technique with sparse regularization of phase and amplitude

Advanced phase retrieval: maximum likelihood technique with sparse regularization of phase and amplitude Advanced phase retrieval: maximum likelihood technique with sparse regularization of phase and amplitude A. Migukin *, V. atkovnik and J. Astola Department of Signal Processing, Tampere University of Technology,

More information

Section 2.3: Simple Linear Regression: Predictions and Inference

Section 2.3: Simple Linear Regression: Predictions and Inference Section 2.3: Simple Linear Regression: Predictions and Inference Jared S. Murray The University of Texas at Austin McCombs School of Business Suggested reading: OpenIntro Statistics, Chapter 7.4 1 Simple

More information

Automatic Partiicle Tracking Software USE ER MANUAL Update: May 2015

Automatic Partiicle Tracking Software USE ER MANUAL Update: May 2015 Automatic Particle Tracking Software USER MANUAL Update: May 2015 File Menu The micrograph below shows the panel displayed when a movie is opened, including a playback menu where most of the parameters

More information

Robust Kernel Methods in Clustering and Dimensionality Reduction Problems

Robust Kernel Methods in Clustering and Dimensionality Reduction Problems Robust Kernel Methods in Clustering and Dimensionality Reduction Problems Jian Guo, Debadyuti Roy, Jing Wang University of Michigan, Department of Statistics Introduction In this report we propose robust

More information

Advanced Image Reconstruction Methods for Photoacoustic Tomography

Advanced Image Reconstruction Methods for Photoacoustic Tomography Advanced Image Reconstruction Methods for Photoacoustic Tomography Mark A. Anastasio, Kun Wang, and Robert Schoonover Department of Biomedical Engineering Washington University in St. Louis 1 Outline Photoacoustic/thermoacoustic

More information

Hybrid filters for medical image reconstruction

Hybrid filters for medical image reconstruction Vol. 6(9), pp. 177-182, October, 2013 DOI: 10.5897/AJMCSR11.124 ISSN 2006-9731 2013 Academic Journals http://www.academicjournals.org/ajmcsr African Journal of Mathematics and Computer Science Research

More information

RESTORATION OF DEGRADED DOCUMENTS USING IMAGE BINARIZATION TECHNIQUE

RESTORATION OF DEGRADED DOCUMENTS USING IMAGE BINARIZATION TECHNIQUE RESTORATION OF DEGRADED DOCUMENTS USING IMAGE BINARIZATION TECHNIQUE K. Kaviya Selvi 1 and R. S. Sabeenian 2 1 Department of Electronics and Communication Engineering, Communication Systems, Sona College

More information

Supplementary Data. in residuals voxel time-series exhibiting high variance, for example, large sinuses.

Supplementary Data. in residuals voxel time-series exhibiting high variance, for example, large sinuses. Supplementary Data Supplementary Materials and Methods Step-by-step description of principal component-orthogonalization technique Below is a step-by-step description of the principal component (PC)-orthogonalization

More information

SUPPLEMENTARY INFORMATION

SUPPLEMENTARY INFORMATION SUPPLEMENTARY INFORMATION doi:10.1038/nature10934 Supplementary Methods Mathematical implementation of the EST method. The EST method begins with padding each projection with zeros (that is, embedding

More information

Categorical Data in a Designed Experiment Part 2: Sizing with a Binary Response

Categorical Data in a Designed Experiment Part 2: Sizing with a Binary Response Categorical Data in a Designed Experiment Part 2: Sizing with a Binary Response Authored by: Francisco Ortiz, PhD Version 2: 19 July 2018 Revised 18 October 2018 The goal of the STAT COE is to assist in

More information

Sampling and Reconstruction

Sampling and Reconstruction Sampling and Reconstruction Sampling and Reconstruction Sampling and Spatial Resolution Spatial Aliasing Problem: Spatial aliasing is insufficient sampling of data along the space axis, which occurs because

More information

Image Denoising Based on Hybrid Fourier and Neighborhood Wavelet Coefficients Jun Cheng, Songli Lei

Image Denoising Based on Hybrid Fourier and Neighborhood Wavelet Coefficients Jun Cheng, Songli Lei Image Denoising Based on Hybrid Fourier and Neighborhood Wavelet Coefficients Jun Cheng, Songli Lei College of Physical and Information Science, Hunan Normal University, Changsha, China Hunan Art Professional

More information

Bootstrapping Method for 14 June 2016 R. Russell Rhinehart. Bootstrapping

Bootstrapping Method for  14 June 2016 R. Russell Rhinehart. Bootstrapping Bootstrapping Method for www.r3eda.com 14 June 2016 R. Russell Rhinehart Bootstrapping This is extracted from the book, Nonlinear Regression Modeling for Engineering Applications: Modeling, Model Validation,

More information

Contrast Optimization: A faster and better technique for optimizing on MTF ABSTRACT Keywords: INTRODUCTION THEORY

Contrast Optimization: A faster and better technique for optimizing on MTF ABSTRACT Keywords: INTRODUCTION THEORY Contrast Optimization: A faster and better technique for optimizing on MTF Ken Moore, Erin Elliott, Mark Nicholson, Chris Normanshire, Shawn Gay, Jade Aiona Zemax, LLC ABSTRACT Our new Contrast Optimization

More information

Expectation and Maximization Algorithm for Estimating Parameters of a Simple Partial Erasure Model

Expectation and Maximization Algorithm for Estimating Parameters of a Simple Partial Erasure Model 608 IEEE TRANSACTIONS ON MAGNETICS, VOL. 39, NO. 1, JANUARY 2003 Expectation and Maximization Algorithm for Estimating Parameters of a Simple Partial Erasure Model Tsai-Sheng Kao and Mu-Huo Cheng Abstract

More information

All rights reserved Image Science Software GmbH Berlin, Germany

All rights reserved Image Science Software GmbH Berlin, Germany All rights reserved Image Science Software GmbH Berlin, Germany Version: June 2010 Ribosome pictures kindly provided by Prof van Heel, Imperial College, London IMAGIC-4D: Introduction: Whereas IMAGIC programs

More information

Neurophysical Model by Barten and Its Development

Neurophysical Model by Barten and Its Development Chapter 14 Neurophysical Model by Barten and Its Development According to the Barten model, the perceived foveal image is corrupted by internal noise caused by statistical fluctuations, both in the number

More information

Texture. Outline. Image representations: spatial and frequency Fourier transform Frequency filtering Oriented pyramids Texture representation

Texture. Outline. Image representations: spatial and frequency Fourier transform Frequency filtering Oriented pyramids Texture representation Texture Outline Image representations: spatial and frequency Fourier transform Frequency filtering Oriented pyramids Texture representation 1 Image Representation The standard basis for images is the set

More information

A MORPHOLOGY-BASED FILTER STRUCTURE FOR EDGE-ENHANCING SMOOTHING

A MORPHOLOGY-BASED FILTER STRUCTURE FOR EDGE-ENHANCING SMOOTHING Proceedings of the 1994 IEEE International Conference on Image Processing (ICIP-94), pp. 530-534. (Austin, Texas, 13-16 November 1994.) A MORPHOLOGY-BASED FILTER STRUCTURE FOR EDGE-ENHANCING SMOOTHING

More information

Null test for a highly paraboloidal mirror

Null test for a highly paraboloidal mirror Null test for a highly paraboloidal mirror Taehee Kim, James H. Burge, Yunwoo Lee, and Sungsik Kim A circular null computer-generated hologram CGH was used to test a highly paraboloidal mirror diameter,

More information

Computer Vision 2. SS 18 Dr. Benjamin Guthier Professur für Bildverarbeitung. Computer Vision 2 Dr. Benjamin Guthier

Computer Vision 2. SS 18 Dr. Benjamin Guthier Professur für Bildverarbeitung. Computer Vision 2 Dr. Benjamin Guthier Computer Vision 2 SS 18 Dr. Benjamin Guthier Professur für Bildverarbeitung Computer Vision 2 Dr. Benjamin Guthier 1. IMAGE PROCESSING Computer Vision 2 Dr. Benjamin Guthier Content of this Chapter Non-linear

More information

3. Data Analysis and Statistics

3. Data Analysis and Statistics 3. Data Analysis and Statistics 3.1 Visual Analysis of Data 3.2.1 Basic Statistics Examples 3.2.2 Basic Statistical Theory 3.3 Normal Distributions 3.4 Bivariate Data 3.1 Visual Analysis of Data Visual

More information

Medical Image Analysis

Medical Image Analysis Medical Image Analysis Instructor: Moo K. Chung mchung@stat.wisc.edu Lecture 10. Multiple Comparisons March 06, 2007 This lecture will show you how to construct P-value maps fmri Multiple Comparisons 4-Dimensional

More information

A MAXIMUM NOISE FRACTION TRANSFORM BASED ON A SENSOR NOISE MODEL FOR HYPERSPECTRAL DATA. Naoto Yokoya 1 and Akira Iwasaki 2

A MAXIMUM NOISE FRACTION TRANSFORM BASED ON A SENSOR NOISE MODEL FOR HYPERSPECTRAL DATA. Naoto Yokoya 1 and Akira Iwasaki 2 A MAXIMUM NOISE FRACTION TRANSFORM BASED ON A SENSOR NOISE MODEL FOR HYPERSPECTRAL DATA Naoto Yokoya 1 and Akira Iwasaki 1 Graduate Student, Department of Aeronautics and Astronautics, The University of

More information

Nature Methods: doi: /nmeth Supplementary Figure 1

Nature Methods: doi: /nmeth Supplementary Figure 1 Supplementary Figure 1 Schematic demonstrating the preferred orientation sampling problem in single-particle cryo-em. Specimens sticking to the air-water interface or a substrate support of a cryo-em grid

More information

Supplementary text S6 Comparison studies on simulated data

Supplementary text S6 Comparison studies on simulated data Supplementary text S Comparison studies on simulated data Peter Langfelder, Rui Luo, Michael C. Oldham, and Steve Horvath Corresponding author: shorvath@mednet.ucla.edu Overview In this document we illustrate

More information

Chapter 3: Intensity Transformations and Spatial Filtering

Chapter 3: Intensity Transformations and Spatial Filtering Chapter 3: Intensity Transformations and Spatial Filtering 3.1 Background 3.2 Some basic intensity transformation functions 3.3 Histogram processing 3.4 Fundamentals of spatial filtering 3.5 Smoothing

More information

Sections 3-6 have been substantially modified to make the paper more comprehensible. Several figures have been re-plotted and figure captions changed.

Sections 3-6 have been substantially modified to make the paper more comprehensible. Several figures have been re-plotted and figure captions changed. Response to First Referee s Comments General Comments Sections 3-6 have been substantially modified to make the paper more comprehensible. Several figures have been re-plotted and figure captions changed.

More information

Reconstruction of Images Distorted by Water Waves

Reconstruction of Images Distorted by Water Waves Reconstruction of Images Distorted by Water Waves Arturo Donate and Eraldo Ribeiro Computer Vision Group Outline of the talk Introduction Analysis Background Method Experiments Conclusions Future Work

More information

SUPPLEMENTARY INFORMATION

SUPPLEMENTARY INFORMATION Supplementary Information Compact spectrometer based on a disordered photonic chip Brandon Redding, Seng Fatt Liew, Raktim Sarma, Hui Cao* Department of Applied Physics, Yale University, New Haven, CT

More information

Outline 7/2/201011/6/

Outline 7/2/201011/6/ Outline Pattern recognition in computer vision Background on the development of SIFT SIFT algorithm and some of its variations Computational considerations (SURF) Potential improvement Summary 01 2 Pattern

More information

Globally Stabilized 3L Curve Fitting

Globally Stabilized 3L Curve Fitting Globally Stabilized 3L Curve Fitting Turker Sahin and Mustafa Unel Department of Computer Engineering, Gebze Institute of Technology Cayirova Campus 44 Gebze/Kocaeli Turkey {htsahin,munel}@bilmuh.gyte.edu.tr

More information

INVARIANT CORNER DETECTION USING STEERABLE FILTERS AND HARRIS ALGORITHM

INVARIANT CORNER DETECTION USING STEERABLE FILTERS AND HARRIS ALGORITHM INVARIANT CORNER DETECTION USING STEERABLE FILTERS AND HARRIS ALGORITHM ABSTRACT Mahesh 1 and Dr.M.V.Subramanyam 2 1 Research scholar, Department of ECE, MITS, Madanapalle, AP, India vka4mahesh@gmail.com

More information

Temperature Distribution Measurement Based on ML-EM Method Using Enclosed Acoustic CT System

Temperature Distribution Measurement Based on ML-EM Method Using Enclosed Acoustic CT System Sensors & Transducers 2013 by IFSA http://www.sensorsportal.com Temperature Distribution Measurement Based on ML-EM Method Using Enclosed Acoustic CT System Shinji Ohyama, Masato Mukouyama Graduate School

More information