3D Structure Determination using Cryo-Electron Microscopy Computational Challenges
|
|
- Magdalene Jodie Jenkins
- 6 years ago
- Views:
Transcription
1 3D Structure Determination using Cryo-Electron Microscopy Computational Challenges Amit Singer Princeton University Department of Mathematics and Program in Applied and Computational Mathematics July 28, 2015 Mathematics in Data Science Amit Singer (Princeton University) July / 28
2 Single Particle Reconstruction using cryo-em Schematic drawing of the imaging process: The cryo-em problem: Amit Singer (Princeton University) July / 28
3 New detector technology: Exciting times for cryo-em BIOCHEMISTRY The Resolution Revolution Werner Kühlbrandt P recise knowledge of the structure of macromolecules in the cell is essential for understanding how they function. Structures of large macromolecules can now be obtained at near-atomic resolution by averaging thousands of electron microscope images recorded before radiation damage accumulates. This is what Amunts et al. have done in their research article on page 1485 of this issue ( 1), reporting the structure of the large subunit of the mitochondrial ribosome at 3.2 Å resolution by electron cryo-microscopy (cryo-em). Together with other recent high-resolution cryo-em structures ( 2 4) (see the figure), this achievement heralds the beginning of a new era in molecular biology, where structures at near-atomic resolution are no longer the prerogative of x-ray crystallography or nuclear magnetic resonance (NMR) spectroscopy. Ribosomes are ancient, massive protein- RNA complexes that translate the linear genetic code into three-dimensional proteins. Mitochondria semi-autonomous organelles SCIENCE VOL MARCH A B C Advances in detector technology and image processing are yielding high-resolution electron cryo-microscopy structures of biomolecules. Near-atomic resolution with cryo-em. (A) The large subunit of the yeast mitochondrial ribosome at 3.2 Å reported by Amunts et al. In the detailed view below, the base pairs of an RNA double helix and a magnesium ion (blue) are clearly resolved. (B) TRPV1 ion channel at 3.4 Å ( 2), with a detailed view of residues lining the ion pore on the four-fold axis of the tetrameric channel. (C) F 420-reducing [NiFe] hydrogenase at 3.36 Å ( 3). The detail shows an α helix in the FrhA subunit with resolved side chains. The maps are not drawn to scale. Amit Singer (Princeton University) July / 28
4 Big Movie Data, Publicly Available Amit Singer (Princeton University) July / 28
5 Image Formation Model and Inverse Problem Projection I i Molecule φ R i = Ri 1 Ri 2 Ri 3 T T T SO(3) Electron source Projection images I i (x,y) = φ(xr1 i +yri 2 +zri 3 )dz + noise. φ : R 3 R is the electric potential of the molecule. Cryo-EM problem: Find φ and R 1,...,R n given I 1,...,I n. Amit Singer (Princeton University) July / 28
6 Toy Example Amit Singer (Princeton University) July / 28
7 E. coli 50S ribosomal subunit 27,000 particle images provided by Dr. Fred Sigworth, Yale Medical School 3D reconstruction by S, Lanhui Wang, and Jane Zhao Amit Singer (Princeton University) July / 28
8 Main Algorithmic Challenges 1 Orientation assignment 2 Heterogeneity (resolving structural variability) 3 2D Class averaging (de-noising) 4 Particle picking 5 Symmetry detection 6 Motion correction Amit Singer (Princeton University) July / 28
9 The heterogeneity problem What if the molecule has more than one possible structure? (Image source: H. Liao and J. Frank, Classification by bootstrapping in single particle methods, ISBI, 2010.) Katsevich, Katsevich, S (SIAM Journal on Imaging Sciences, 2015) Covariance matrix estimation of the 3-D structures from their 2-D projections (high-dimensional statistics, random matrices, low-rank matrix completion) Amit Singer (Princeton University) July / 28
10 Experimental Data: 70S Ribosome image dataset (130-by-130), courtesy Joachim Frank (Columbia University) Class 1 Class 2 Morphing video by S, Joakim Andén, and Eugene Katsevich Amit Singer (Princeton University) July / 28
11 Class averaging for image denoising Rotation invariant representation (steerable PCA, bispectrum) Vector diffusion maps (S, Wu 2012), generalization of Laplacian Eigenmaps (Belkin, Niyogi 2003) and Diffusion Maps (Coifman, Lafon 2006) Graph Connection Laplacian Experimental images (70S) courtesy of Dr. Joachim Frank (Columbia) Class averages by vector diffusion maps (averaging with 20 nearest neighbors) (Zhao, S 2014) Amit Singer (Princeton University) July / 28
12 Orientation Estimation Standard procedure is iterative refinement. Alternating minimization or expectation-maximization, starting from an initial guess φ 0 for the 3-D structure I i = P(R i φ)+ǫ i, i = 1,...,n. R i φ(r) = φ(r 1 i r) is the left group action P is integration in the z-direction and grid sampling. Converges to a local optimum, not necessarily the global one. Model bias is a well-known pitfall Is reference free orientation assignment and reconstruction possible? Amit Singer (Princeton University) July / 28
13 3D Puzzle Optimization problem: min g 1,g 2,...,g n G n i,j=1 f ij (g i g 1 j ) G = SO(3) is the group of rotations in space. Parameter space G G G is exponentially large. Amit Singer (Princeton University) July / 28
14 Non-Unique Games over Compact Groups min g 1,g 2,...,g n G n i,j=1 f ij (g i g 1 j ) For G = Z 2 this encodes Max-Cut. 1 3 w 12 w 34 2 w 14 w 24 w 35 w w 45 Max-2-Lin(Z L ) formulation of Unique Games (Khot et al 2005): Find x 1,...,x n Z L that satisfy as many difference eqs as possible x i x j = b ij This corresponds to G = Z L and mod L, (i,j) E f ij (x i x j ) = 1 {xi x j =b ij } Our games are non-unique in general, and the group is not necessarily finite. Amit Singer (Princeton University) July / 28
15 Orientation Estimation: Fourier projection-slice theorem (x ij,y ij ) R i c ij c ij = (x ij,y ij,0) T Projection I i Î i (x ji,y ji ) 3D Fourier space R i c ij = R j c ji Projection I j Î j 3D Fourier space Amit Singer (Princeton University) July / 28
16 Angular Reconstitution (Vainshtein and Goncharov 1986, Van Heel 1987) Amit Singer (Princeton University) July / 28
17 Least Squares Approach (x ij,y ij) R ic ij c ij = (x ij,y ij,0) T Projection I i Î i 3D Fourier space (x ji,y ji) R ic ij = R jc ji Projection I j Î j 3D Fourier space min R 1,R 2,...,R n SO(3) R i c ij R j c ji 2 i j Search space is exponentially large and non-convex. Spectral and semidefinite programming relaxations (non-commutative Grothendieck, Max-Cut) S, Shkolnisky (SIAM Journal on Imaging Sciences, 2011) Amit Singer (Princeton University) July / 28
18 MLE The images contain more information than that expressed by optimal pairwise matching of common lines. Algorithms based on pairwise matching can succeed only at high SNR. (Quasi) Maximum Likelihood: We would like to try all possible rotations R 1,...,R n and choose the combination for which the agreement on the common lines (implied by the rotations) as observed in the images is maximal. Computationally intractable: exponentially large search space, complicated cost function. Amit Singer (Princeton University) July / 28
19 Quasi MLE Common line equation: R i c ij = R j c ji = R ie 3 R j e 3 R i e 3 R j e 3 with e 3 = (0,0,1) T. Quasi MLE min c ij = R 1 i c ji = R 1 j n R 1,...,R n SO(3) i,j=1 R i e 3 R j e 3 R i e 3 R j e 3 = e 3 R 1 i R j e 3 e 3 R 1 i R j e 3 R i e 3 R j e 3 R i e 3 R j e 3 = R 1 j R i e 3 e 3 R 1 i R i e 3 e 3 Îi(,c ij ) Îj(,c ji ) 2 min g 1,...,g n G n i,j=1 f ij (g i g 1 j ) Amit Singer (Princeton University) July / 28
20 Fourier transform over G Recall for G = SO(2) f(α) = ˆf(k) = 1 2π k= 2π 0 ˆf(k)e ıkα f(α)e ıkα dα In general, for a compact group G ] f(g) = d k Tr[ˆf(k)ρ k (g) ˆf(k) = k=0 G Here ρ k are the unitary irreducible representations of G d k is the dimension of the representation ρ k (e.g., d k = 1 for SO(2), d k = 2k +1 for SO(3)) dg is the Haar measure on G f(g)ρ k (g) dg Amit Singer (Princeton University) July / 28
21 Linearization of the cost function Introduce matrix variables Fourier expansion of f ij Linear cost function f(g 1,...,g n ) = f ij (g) = n i,j=1 X (k) ij k=0 = ρ k (g i g 1 j ) ] d k Tr[ˆf ij (k)ρ k (g) f ij (g i g 1 j ) = n i,j=1k=0 ] d k Tr [ˆf ij (k)x (k) ij Amit Singer (Princeton University) July / 28
22 Constraints on the variables X (k) ij = ρ k (g i g 1 j ) 1 X (k) 0 2 X (k) ii = I dk, for i = 1,...,n 3 rank(x (k) ) = d k = ρ k (g i g 1 j ) = ρ k (g i )ρ k (g 1 j ) = ρ k (g i )ρ k (g j ) ρ k (g 1 ) X (k) ρ k (g 2 ) [ = ρk (g 1 ) ρ k (g 2 ) ρ k (g n ) ]. ρ k (g n ) X (k) ij We drop the non-convex rank constraint. The relaxation is too loose, as we can have X (k) ij = 0 (for i j). Even with the rank constraint, nothing ensures that X (k) ij and X (k ) ij correspond to the same group element g i g 1 j. Amit Singer (Princeton University) July / 28
23 Additional constraints on X (k) ij = ρ k (g i g 1 j ) The delta function for G = SO(2) δ(α) = k= Shifting the delta function to α i α j δ(α (α i α j )) = k= e ıkα e ıkα e ık(α i α j ) = k= The delta function is non-negative and integrates to 1: e ıkα X (k) ij 0, α [0,2π) k= 1 2π 2π 0 k= e ıkα X (k) ij (0) dα = X ij = 1 e ıkα X (k) ij Amit Singer (Princeton University) July / 28
24 Finite truncation via Fejér kernel In practice, we cannot use infinite number of representations to compose the delta function. Simple truncation leads to the Dirichlet kernel which changes sign D m (α) = m k= m e ıkα This is also the source for the Gibbs phenomenon and the non-uniform convergence of the Fourier series. The Fejér kernel is non-negative and leads to uniform convergence F m (α) = 1 m m 1 k=0 D k (α) = m k= m ( 1 k ) e ıkα m The Fejér kernel is the first order Cesàro mean of the Dirichlet kernel. Amit Singer (Princeton University) July / 28
25 Finite truncation via Fejér-Riesz factorization Non-negativity constraints over SO(2) m ( 1 k ) e ıkα X (k) ij 0, α [0,2π) m k= m Fejér-Riesz: P is a non-negative trigonometric polynomial over the circle, i.e. P(e ıα ) 0 α [0,2π) iff P(e ıα ) = Q(e ıα ) 2 for some polynomial Q. { Leads to semidefinite constraints on X (k) ij } k for each i,j. Similar non-negativity constraints hold for general G using the delta function over G δ(g) = d k Tr[ρ k (g)] k=0 For example, Fejér proved that for SO(3) the second order Cesàro mean of the Dirichlet kernel is non-negative. Amit Singer (Princeton University) July / 28
26 Tightness of the semidefinite program We solve an SDP for the matrices X (0),...,X (m). Numerically, the solution of the SDP has the desired ranks up to a certain level of noise (w.h.p). In other words, even though the search-space is exponentially large, we typically find the MLE in polynomial time. This is a viable alternative to heuristic methods such as EM and alternating minimization. The SDP gives a certificate whenever it finds the MLE. Amit Singer (Princeton University) July / 28
27 Final Remarks Loss of handedness ambiguity in cryo-em: If g 1,...,g n SO(3) is the solution, then so is Jg 1 J 1,...,Jg n J 1 for J = diag( 1, 1,1). [ ] Define X (k) ij = 1 2 ρ k (g i g 1 j )+ρ k (Jg i g 1 j J 1 ) Splits the representation: 2k +1 = d k = k +(k +1), reduced computation Point group symmetry (cyclic, dihedral, etc.): reduces the dimension of the representation (invariant polynomials) Translations and rotations simultaneously: SE(3) is a non-compact group, but we can map it to SO(4). Amit Singer (Princeton University) July / 28
28 References A. Singer, Y. Shkolnisky, Three-Dimensional Structure Determination from Common Lines in Cryo-EM by Eigenvectors and Semidefinite Programming, SIAM Journal on Imaging Sciences, 4 (2), pp (2011). A. Singer, H.-T. Wu, Vector Diffusion Maps and the Connection Laplacian, Communications on Pure and Applied Mathematics, 65 (8), pp (2012). Z. Zhao, A. Singer, Rotationally Invariant Image Representation for Viewing Direction Classification in Cryo-EM, Journal of Structural Biology, 186 (1), pp (2014). A. S. Bandeira, M. Charikar, A. Singer, A. Zhu, Multireference Alignment using Semidefinite Programming, 5th Innovations in Theoretical Computer Science (ITCS 2014). A. S. Bandeira, Y. Chen, A. Singer Non-Unique Games over Compact Groups and Orientation Estimation in Cryo-EM, G. Katsevich, A. Katsevich, A. Singer, Covariance Matrix Estimation for the Cryo-EM Heterogeneity Problem, SIAM Journal on Imaging Sciences, 8 (1), pp (2015). J. Andén, E. Katsevich, A. Singer, Covariance estimation using conjugate gradient for 3D classification in Cryo-EM, 12th IEEE International Symposium on Biomedical Imaging (ISBI 2015). Amit Singer (Princeton University) July / 28
Introduction to Three Dimensional Structure Determination of Macromolecules by Cryo-Electron Microscopy
Introduction to Three Dimensional Structure Determination of Macromolecules by Cryo-Electron Microscopy Amit Singer Princeton University, Department of Mathematics and PACM July 23, 2014 Amit Singer (Princeton
More informationNon-unique Games over Compact Groups and Orientation Estimation in Cryo-EM
Non-unique Games over Compact Groups and Orientation Estimation in Cryo-EM Amit Singer Princeton University Department of Mathematics and Program in Applied and Computational Mathematics July 28, 2016
More informationSome Optimization and Statistical Learning Problems in Structural Biology
Some Optimization and Statistical Learning Problems in Structural Biology Amit Singer Princeton University, Department of Mathematics and PACM January 8, 2013 Amit Singer (Princeton University) January
More informationPCA from noisy linearly reduced measurements
PCA from noisy linearly reduced measurements Amit Singer Princeton University Department of Mathematics and Program in Applied and Computational Mathematics September 27, 2016 Amit Singer (Princeton University)
More informationThree-dimensional structure determination of molecules without crystallization
Three-dimensional structure determination of molecules without crystallization Amit Singer Princeton University, Department of Mathematics and PACM June 4, 214 Amit Singer (Princeton University) June 214
More informationClass Averaging in Cryo-Electron Microscopy
Class Averaging in Cryo-Electron Microscopy Zhizhen Jane Zhao Courant Institute of Mathematical Sciences, NYU Mathematics in Data Sciences ICERM, Brown University July 30 2015 Single Particle Reconstruction
More informationOrientation Assignment in Cryo-EM
Orientation Assignment in Cryo-EM Amit Singer Princeton University Department of Mathematics and Program in Applied and Computational Mathematics July 24, 2014 Amit Singer (Princeton University) July 2014
More informationBeyond Scalar Affinities for Network Analysis or Vector Diffusion Maps and the Connection Laplacian
Beyond Scalar Affinities for Network Analysis or Vector Diffusion Maps and the Connection Laplacian Amit Singer Princeton University Department of Mathematics and Program in Applied and Computational Mathematics
More informationMultireference Alignment, Cryo-EM, and XFEL
Multireference Alignment, Cryo-EM, and XFEL Amit Singer Princeton University Department of Mathematics and Program in Applied and Computational Mathematics August 16, 2017 Amit Singer (Princeton University)
More informationGlobal Positioning from Local Distances
Global Positioning from Local Distances Amit Singer Yale University, Department of Mathematics, Program in Applied Mathematics SIAM Annual Meeting, July 2008 Amit Singer (Yale University) San Diego 1 /
More informationCovariance Matrix Estimation for the Cryo-EM Heterogeneity Problem
Covariance Matrix Estimation for the Cryo-EM Heterogeneity Problem Amit Singer Princeton University Department of Mathematics and Program in Applied and Computational Mathematics July 25, 2014 Joint work
More informationarxiv: v1 [cs.cv] 12 Jul 2016
arxiv:1607.03464v1 [cs.cv] 12 Jul 2016 A Representation Theory Perspective on Simultaneous Alignment and Classification Roy R. Lederman and Amit Singer July 13, 2016 Abstract One of the difficulties in
More informationThe Projected Power Method: An Efficient Algorithm for Joint Alignment from Pairwise Differences
The Projected Power Method: An Efficient Algorithm for Joint Alignment from Pairwise Differences Yuxin Chen Emmanuel Candès Department of Statistics, Stanford University, Sep. 2016 Nonconvex optimization
More informationThree-Dimensional Electron Microscopy of Macromolecular Assemblies
Three-Dimensional Electron Microscopy of Macromolecular Assemblies Joachim Frank Wadsworth Center for Laboratories and Research State of New York Department of Health The Governor Nelson A. Rockefeller
More informationData-dependent representations: Laplacian Eigenmaps
Data-dependent representations: Laplacian Eigenmaps November 4, 2015 Data Organization and Manifold Learning There are many techniques for Data Organization and Manifold Learning, e.g., Principal Component
More informationTools for Cryo-EM Map Fitting. Paul Emsley MRC Laboratory of Molecular Biology
Tools for Cryo-EM Map Fitting Paul Emsley MRC Laboratory of Molecular Biology April 2017 Cryo-EM model-building typically need to move more atoms that one does for crystallography the maps are lower resolution
More informationarxiv: v1 [physics.comp-ph] 12 Mar 2018
Mathematics for cryo-electron microscopy To appear in the Proceedings of the International Congress of Mathematicians 2018 arxiv:1803.06714v1 [physics.comp-ph] 12 Mar 2018 A Amit Singer Abstract Single-particle
More informationUnsupervised Learning Techniques Class 07, 1 March 2006 Andrea Caponnetto
Unsupervised Learning Techniques 9.520 Class 07, 1 March 2006 Andrea Caponnetto About this class Goal To introduce some methods for unsupervised learning: Gaussian Mixtures, K-Means, ISOMAP, HLLE, Laplacian
More informationFast Angular Synchronization for Phase Retrieval via Incomplete Information
Fast Angular Synchronization for Phase Retrieval via Incomplete Information Aditya Viswanathan a and Mark Iwen b a Department of Mathematics, Michigan State University; b Department of Mathematics & Department
More informationApplied and Computational Harmonic Analysis
Appl. Comput. Harmon. Anal. 28 (2010) 296 312 Contents lists available at ScienceDirect Applied and Computational Harmonic Analysis www.elsevier.com/locate/acha Reference free structure determination through
More informationComputing Steerable Principal Components of a Large Set of Images and Their Rotations Colin Ponce and Amit Singer
IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL 20, NO 11, NOVEMBER 2011 3051 Computing Steerable Principal Components of a Large Set of Images and Their Rotations Colin Ponce and Amit Singer Abstract We present
More informationGlobal vs. Multiscale Approaches
Harmonic Analysis on Graphs Global vs. Multiscale Approaches Weizmann Institute of Science, Rehovot, Israel July 2011 Joint work with Matan Gavish (WIS/Stanford), Ronald Coifman (Yale), ICML 10' Challenge:
More informationDiffusion Wavelets and Applications
Diffusion Wavelets and Applications J.C. Bremer, R.R. Coifman, P.W. Jones, S. Lafon, M. Mohlenkamp, MM, R. Schul, A.D. Szlam Demos, web pages and preprints available at: S.Lafon: www.math.yale.edu/~sl349
More informationImage Assessment San Diego, November 2005
Image Assessment San Diego, November 005 Pawel A. Penczek The University of Texas Houston Medical School Department of Biochemistry and Molecular Biology 6431 Fannin, MSB6.18, Houston, TX 77030, USA phone:
More informationAdvanced Machine Learning & Perception
Advanced Machine Learning & Perception Instructor: Tony Jebara Topic 1 Introduction, researchy course, latest papers Going beyond simple machine learning Perception, strange spaces, images, time, behavior
More informationFast and Robust Phase Retrieval
Fast and Robust Phase Retrieval Aditya Viswanathan aditya@math.msu.edu CCAM Lunch Seminar Purdue University April 18 2014 0 / 27 Joint work with Yang Wang Mark Iwen Research supported in part by National
More informationData dependent operators for the spatial-spectral fusion problem
Data dependent operators for the spatial-spectral fusion problem Wien, December 3, 2012 Joint work with: University of Maryland: J. J. Benedetto, J. A. Dobrosotskaya, T. Doster, K. W. Duke, M. Ehler, A.
More informationGraph Partitioning Using Random Walks
Graph Partitioning Using Random Walks A Convex Optimization Perspective Lorenzo Orecchia Computer Science Why Spectral Algorithms for Graph Problems in practice? Simple to implement Can exploit very efficient
More informationREPRESENTATION THEORETIC PATTERNS IN THREE DIMENSIONAL CRYO-ELECTRON MICROSCOPY III - PRESENCE OF POINT SYMMETRIES
REPRESENTATION THEORETIC PATTERNS IN THREE DIMENSIONAL CRYO-ELECTRON MICROSCOPY III - PRESENCE OF POINT SYMMETRIES SHAMGAR GUREVICH, RONNY HADANI, AND AMIT SINGER A. In this paper we present a novel algorithm,
More informationLearning gradients: prescriptive models
Department of Statistical Science Institute for Genome Sciences & Policy Department of Computer Science Duke University May 11, 2007 Relevant papers Learning Coordinate Covariances via Gradients. Sayan
More informationLECTURE NOTE #11 PROF. ALAN YUILLE
LECTURE NOTE #11 PROF. ALAN YUILLE 1. NonLinear Dimension Reduction Spectral Methods. The basic idea is to assume that the data lies on a manifold/surface in D-dimensional space, see figure (1) Perform
More informationREPRESENTATION THEORETIC PATTERNS IN THREE DIMENSIONAL CRYO-ELECTRON MICROSCOPY III - PRESENCE OF POINT SYMMETRIES
REPRESENTATION THEORETIC PATTERNS IN THREE DIMENSIONAL CRYO-ELECTRON MICROSCOPY III - PRESENCE OF POINT SYMMETRIES SHAMGAR GUREVICH, RONNY HADANI, AND AMIT SINGER A. In this paper we present a novel algorithm,
More informationGraph Metrics and Dimension Reduction
Graph Metrics and Dimension Reduction Minh Tang 1 Michael Trosset 2 1 Applied Mathematics and Statistics The Johns Hopkins University 2 Department of Statistics Indiana University, Bloomington November
More informationMachine Learning Practice Page 2 of 2 10/28/13
Machine Learning 10-701 Practice Page 2 of 2 10/28/13 1. True or False Please give an explanation for your answer, this is worth 1 pt/question. (a) (2 points) No classifier can do better than a naive Bayes
More informationNIH Public Access Author Manuscript Ann Math. Author manuscript; available in PMC 2012 November 23.
NIH Public Access Author Manuscript Published in final edited form as: Ann Math. 2011 September 1; 174(2): 1219 1241. doi:10.4007/annals.2011.174.2.11. Representation theoretic patterns in three dimensional
More informationDisentangling Orthogonal Matrices
Disentangling Orthogonal Matrices Teng Zhang Department of Mathematics, University of Central Florida Orlando, Florida 3286, USA arxiv:506.0227v2 [math.oc] 8 May 206 Amit Singer 2 Department of Mathematics
More informationDetermining Protein Structure BIBC 100
Determining Protein Structure BIBC 100 Determining Protein Structure X-Ray Diffraction Interactions of x-rays with electrons in molecules in a crystal NMR- Nuclear Magnetic Resonance Interactions of magnetic
More informationProtein Structure Prediction II Lecturer: Serafim Batzoglou Scribe: Samy Hamdouche
Protein Structure Prediction II Lecturer: Serafim Batzoglou Scribe: Samy Hamdouche The molecular structure of a protein can be broken down hierarchically. The primary structure of a protein is simply its
More informationUnsupervised dimensionality reduction
Unsupervised dimensionality reduction Guillaume Obozinski Ecole des Ponts - ParisTech SOCN course 2014 Guillaume Obozinski Unsupervised dimensionality reduction 1/30 Outline 1 PCA 2 Kernel PCA 3 Multidimensional
More informationRecovery of Compactly Supported Functions from Spectrogram Measurements via Lifting
Recovery of Compactly Supported Functions from Spectrogram Measurements via Lifting Mark Iwen markiwen@math.msu.edu 2017 Friday, July 7 th, 2017 Joint work with... Sami Merhi (Michigan State University)
More informationDiscriminative Direction for Kernel Classifiers
Discriminative Direction for Kernel Classifiers Polina Golland Artificial Intelligence Lab Massachusetts Institute of Technology Cambridge, MA 02139 polina@ai.mit.edu Abstract In many scientific and engineering
More informationIndex. p, lip, 78 8 function, 107 v, 7-8 w, 7-8 i,7-8 sine, 43 Bo,94-96
p, lip, 78 8 function, 107 v, 7-8 w, 7-8 i,7-8 sine, 43 Bo,94-96 B 1,94-96 M,94-96 B oro!' 94-96 BIro!' 94-96 I/r, 79 2D linear system, 56 2D FFT, 119 2D Fourier transform, 1, 12, 18,91 2D sinc, 107, 112
More informationLearning Eigenfunctions: Links with Spectral Clustering and Kernel PCA
Learning Eigenfunctions: Links with Spectral Clustering and Kernel PCA Yoshua Bengio Pascal Vincent Jean-François Paiement University of Montreal April 2, Snowbird Learning 2003 Learning Modal Structures
More informationAlgorithms in Bioinformatics
Algorithms in Bioinformatics Sami Khuri Department of Computer Science San José State University San José, California, USA khuri@cs.sjsu.edu www.cs.sjsu.edu/faculty/khuri RNA Structure Prediction Secondary
More informationF. Piazza Center for Molecular Biophysics and University of Orléans, France. Selected topic in Physical Biology. Lecture 1
Zhou Pei-Yuan Centre for Applied Mathematics, Tsinghua University November 2013 F. Piazza Center for Molecular Biophysics and University of Orléans, France Selected topic in Physical Biology Lecture 1
More informationLecture: Some Practical Considerations (3 of 4)
Stat260/CS294: Spectral Graph Methods Lecture 14-03/10/2015 Lecture: Some Practical Considerations (3 of 4) Lecturer: Michael Mahoney Scribe: Michael Mahoney Warning: these notes are still very rough.
More informationMIT Algebraic techniques and semidefinite optimization May 9, Lecture 21. Lecturer: Pablo A. Parrilo Scribe:???
MIT 6.972 Algebraic techniques and semidefinite optimization May 9, 2006 Lecture 2 Lecturer: Pablo A. Parrilo Scribe:??? In this lecture we study techniques to exploit the symmetry that can be present
More informationPHASE RETRIEVAL OF SPARSE SIGNALS FROM MAGNITUDE INFORMATION. A Thesis MELTEM APAYDIN
PHASE RETRIEVAL OF SPARSE SIGNALS FROM MAGNITUDE INFORMATION A Thesis by MELTEM APAYDIN Submitted to the Office of Graduate and Professional Studies of Texas A&M University in partial fulfillment of the
More informationCS273: Algorithms for Structure Handout # 13 and Motion in Biology Stanford University Tuesday, 11 May 2003
CS273: Algorithms for Structure Handout # 13 and Motion in Biology Stanford University Tuesday, 11 May 2003 Lecture #13: 11 May 2004 Topics: Protein Structure Determination Scribe: Minli Zhu We acknowledge
More informationREPRESENTATION THEORY WEEK 7
REPRESENTATION THEORY WEEK 7 1. Characters of L k and S n A character of an irreducible representation of L k is a polynomial function constant on every conjugacy class. Since the set of diagonalizable
More informationNonlinear Dimensionality Reduction. Jose A. Costa
Nonlinear Dimensionality Reduction Jose A. Costa Mathematics of Information Seminar, Dec. Motivation Many useful of signals such as: Image databases; Gene expression microarrays; Internet traffic time
More informationParM filament images were extracted and from the electron micrographs and
Supplemental methods Outline of the EM reconstruction: ParM filament images were extracted and from the electron micrographs and straightened. The digitized images were corrected for the phase of the Contrast
More informationIntroduction to the Mathematics of Medical Imaging
Introduction to the Mathematics of Medical Imaging Second Edition Charles L. Epstein University of Pennsylvania Philadelphia, Pennsylvania EiaJTL Society for Industrial and Applied Mathematics Philadelphia
More informationSDP Relaxations for MAXCUT
SDP Relaxations for MAXCUT from Random Hyperplanes to Sum-of-Squares Certificates CATS @ UMD March 3, 2017 Ahmed Abdelkader MAXCUT SDP SOS March 3, 2017 1 / 27 Overview 1 MAXCUT, Hardness and UGC 2 LP
More informationApplications of Hidden Markov Models
18.417 Introduction to Computational Molecular Biology Lecture 18: November 9, 2004 Scribe: Chris Peikert Lecturer: Ross Lippert Editor: Chris Peikert Applications of Hidden Markov Models Review of Notation
More informationELE539A: Optimization of Communication Systems Lecture 15: Semidefinite Programming, Detection and Estimation Applications
ELE539A: Optimization of Communication Systems Lecture 15: Semidefinite Programming, Detection and Estimation Applications Professor M. Chiang Electrical Engineering Department, Princeton University March
More informationConvex Optimization M2
Convex Optimization M2 Lecture 8 A. d Aspremont. Convex Optimization M2. 1/57 Applications A. d Aspremont. Convex Optimization M2. 2/57 Outline Geometrical problems Approximation problems Combinatorial
More informationapproximation algorithms I
SUM-OF-SQUARES method and approximation algorithms I David Steurer Cornell Cargese Workshop, 201 meta-task encoded as low-degree polynomial in R x example: f(x) = i,j n w ij x i x j 2 given: functions
More informationNonlinear Analysis with Frames. Part III: Algorithms
Nonlinear Analysis with Frames. Part III: Algorithms Radu Balan Department of Mathematics, AMSC, CSCAMM and NWC University of Maryland, College Park, MD July 28-30, 2015 Modern Harmonic Analysis and Applications
More informationStructure, Dynamics and Function of Membrane Proteins using 4D Electron Microscopy
Structure, Dynamics and Function of Membrane Proteins using 4D Electron Microscopy Anthony W. P. Fitzpatrick Department of Chemistry, Lensfield Road, Cambridge, CB2 1EW My research aims to understand the
More information7. Nuclear Magnetic Resonance
7. Nuclear Magnetic Resonance Nuclear Magnetic Resonance (NMR) is another method besides crystallography that can be used to find structures of proteins. NMR spectroscopy is the observation of spins of
More informationRepresentation theoretic patterns in three dimensional Cryo-Electron Microscopy I: The intrinsic reconstitution algorithm
Annals of Mathematics 174 (211), 1219 1241 http://dx.doi.org/1.47/annals.211.174.2.11 Representation theoretic patterns in three dimensional Cryo-Electron Microscopy I: The intrinsic reconstitution algorithm
More informationLearning Binary Classifiers for Multi-Class Problem
Research Memorandum No. 1010 September 28, 2006 Learning Binary Classifiers for Multi-Class Problem Shiro Ikeda The Institute of Statistical Mathematics 4-6-7 Minami-Azabu, Minato-ku, Tokyo, 106-8569,
More informationProtein Crystallography
Protein Crystallography Part II Tim Grüne Dept. of Structural Chemistry Prof. G. Sheldrick University of Göttingen http://shelx.uni-ac.gwdg.de tg@shelx.uni-ac.gwdg.de Overview The Reciprocal Lattice The
More informationMachine Learning - MT & 5. Basis Expansion, Regularization, Validation
Machine Learning - MT 2016 4 & 5. Basis Expansion, Regularization, Validation Varun Kanade University of Oxford October 19 & 24, 2016 Outline Basis function expansion to capture non-linear relationships
More informationGroup theoretical methods in Machine Learning
Group theoretical methods in Machine Learning Risi Kondor Columbia University Tutorial at ICML 2007 Tiger, tiger, burning bright In the forests of the night, What immortal hand or eye Dare frame thy fearful
More informationTHE HIDDEN CONVEXITY OF SPECTRAL CLUSTERING
THE HIDDEN CONVEXITY OF SPECTRAL CLUSTERING Luis Rademacher, Ohio State University, Computer Science and Engineering. Joint work with Mikhail Belkin and James Voss This talk A new approach to multi-way
More informationAPPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2.
APPENDIX A Background Mathematics A. Linear Algebra A.. Vector algebra Let x denote the n-dimensional column vector with components 0 x x 2 B C @. A x n Definition 6 (scalar product). The scalar product
More information4 Matrix product states
Physics 3b Lecture 5 Caltech, 05//7 4 Matrix product states Matrix product state (MPS) is a highly useful tool in the study of interacting quantum systems in one dimension, both analytically and numerically.
More informationBeyond the Point Cloud: From Transductive to Semi-Supervised Learning
Beyond the Point Cloud: From Transductive to Semi-Supervised Learning Vikas Sindhwani, Partha Niyogi, Mikhail Belkin Andrew B. Goldberg goldberg@cs.wisc.edu Department of Computer Sciences University of
More informationHomework 1. Yuan Yao. September 18, 2011
Homework 1 Yuan Yao September 18, 2011 1. Singular Value Decomposition: The goal of this exercise is to refresh your memory about the singular value decomposition and matrix norms. A good reference to
More informationNonlinear Dimensionality Reduction
Outline Hong Chang Institute of Computing Technology, Chinese Academy of Sciences Machine Learning Methods (Fall 2012) Outline Outline I 1 Kernel PCA 2 Isomap 3 Locally Linear Embedding 4 Laplacian Eigenmap
More informationElectron microscopy in molecular cell biology II
Electron microscopy in molecular cell biology II Cryo-EM and image processing Werner Kühlbrandt Max Planck Institute of Biophysics Sample preparation for cryo-em Preparation laboratory Specimen preparation
More informationKernel methods, kernel SVM and ridge regression
Kernel methods, kernel SVM and ridge regression Le Song Machine Learning II: Advanced Topics CSE 8803ML, Spring 2012 Collaborative Filtering 2 Collaborative Filtering R: rating matrix; U: user factor;
More informationOpportunity and Challenge: the new era of cryo-em. Ning Gao School of Life Sciences Tsinghua University
Opportunity and Challenge: the new era of cryo-em Ning Gao School of Life Sciences Tsinghua University 2015-10-20 Education and Research Experience Principal Investigator 2008.11-present Postdoc, Department
More informationQuantum state discrimination with post-measurement information!
Quantum state discrimination with post-measurement information! DEEPTHI GOPAL, CALTECH! STEPHANIE WEHNER, NATIONAL UNIVERSITY OF SINGAPORE! Quantum states! A state is a mathematical object describing the
More informationLinear vs Non-linear classifier. CS789: Machine Learning and Neural Network. Introduction
Linear vs Non-linear classifier CS789: Machine Learning and Neural Network Support Vector Machine Jakramate Bootkrajang Department of Computer Science Chiang Mai University Linear classifier is in the
More informationShort note on compact operators - Monday 24 th March, Sylvester Eriksson-Bique
Short note on compact operators - Monday 24 th March, 2014 Sylvester Eriksson-Bique 1 Introduction In this note I will give a short outline about the structure theory of compact operators. I restrict attention
More informationRotational motion of a rigid body spinning around a rotational axis ˆn;
Physics 106a, Caltech 15 November, 2018 Lecture 14: Rotations The motion of solid bodies So far, we have been studying the motion of point particles, which are essentially just translational. Bodies with
More informationSelf-Tuning Semantic Image Segmentation
Self-Tuning Semantic Image Segmentation Sergey Milyaev 1,2, Olga Barinova 2 1 Voronezh State University sergey.milyaev@gmail.com 2 Lomonosov Moscow State University obarinova@graphics.cs.msu.su Abstract.
More informationThe Kernel Trick, Gram Matrices, and Feature Extraction. CS6787 Lecture 4 Fall 2017
The Kernel Trick, Gram Matrices, and Feature Extraction CS6787 Lecture 4 Fall 2017 Momentum for Principle Component Analysis CS6787 Lecture 3.1 Fall 2017 Principle Component Analysis Setting: find the
More informationMagnetization Gradients, k-space and Molecular Diffusion. Magnetic field gradients, magnetization gratings and k-space
2256 Magnetization Gradients k-space and Molecular Diffusion Magnetic field gradients magnetization gratings and k-space In order to record an image of a sample (or obtain other spatial information) there
More informationPROTEIN NMR SPECTROSCOPY
List of Figures List of Tables xvii xxvi 1. NMR SPECTROSCOPY 1 1.1 Introduction to NMR Spectroscopy 2 1.2 One Dimensional NMR Spectroscopy 3 1.2.1 Classical Description of NMR Spectroscopy 3 1.2.2 Nuclear
More informationRandomized Algorithms
Randomized Algorithms Saniv Kumar, Google Research, NY EECS-6898, Columbia University - Fall, 010 Saniv Kumar 9/13/010 EECS6898 Large Scale Machine Learning 1 Curse of Dimensionality Gaussian Mixture Models
More informationUnsupervised Machine Learning and Data Mining. DS 5230 / DS Fall Lecture 7. Jan-Willem van de Meent
Unsupervised Machine Learning and Data Mining DS 5230 / DS 4420 - Fall 2018 Lecture 7 Jan-Willem van de Meent DIMENSIONALITY REDUCTION Borrowing from: Percy Liang (Stanford) Dimensionality Reduction Goal:
More informationPattern Recognition and Machine Learning
Christopher M. Bishop Pattern Recognition and Machine Learning ÖSpri inger Contents Preface Mathematical notation Contents vii xi xiii 1 Introduction 1 1.1 Example: Polynomial Curve Fitting 4 1.2 Probability
More informationCopyright Mark Brandt, Ph.D A third method, cryogenic electron microscopy has seen increasing use over the past few years.
Structure Determination and Sequence Analysis The vast majority of the experimentally determined three-dimensional protein structures have been solved by one of two methods: X-ray diffraction and Nuclear
More informationAnalysis of Spectral Kernel Design based Semi-supervised Learning
Analysis of Spectral Kernel Design based Semi-supervised Learning Tong Zhang IBM T. J. Watson Research Center Yorktown Heights, NY 10598 Rie Kubota Ando IBM T. J. Watson Research Center Yorktown Heights,
More informationRochester Institute of Technology Rochester, New York. COLLEGE of Science Department of Chemistry. NEW (or REVISED) COURSE:
Rochester Institute of Technology Rochester, New York COLLEGE of Science Department of Chemistry NEW (or REVISED) COURSE: 1014-730 1.0 Title: Magnetic Resonance Imaging (MRI) Date: July 2006 Credit Hours:
More informationSpectral Graph Theory and its Applications. Daniel A. Spielman Dept. of Computer Science Program in Applied Mathematics Yale Unviersity
Spectral Graph Theory and its Applications Daniel A. Spielman Dept. of Computer Science Program in Applied Mathematics Yale Unviersity Outline Adjacency matrix and Laplacian Intuition, spectral graph drawing
More informationBiological Small Angle X-ray Scattering (SAXS) Dec 2, 2013
Biological Small Angle X-ray Scattering (SAXS) Dec 2, 2013 Structural Biology Shape Dynamic Light Scattering Electron Microscopy Small Angle X-ray Scattering Cryo-Electron Microscopy Wide Angle X- ray
More informationChapter 12: Intracellular sorting
Chapter 12: Intracellular sorting Principles of intracellular sorting Principles of intracellular sorting Cells have many distinct compartments (What are they? What do they do?) Specific mechanisms are
More informationApproximation algorithms for nonnegative polynomial optimization problems over unit spheres
Front. Math. China 2017, 12(6): 1409 1426 https://doi.org/10.1007/s11464-017-0644-1 Approximation algorithms for nonnegative polynomial optimization problems over unit spheres Xinzhen ZHANG 1, Guanglu
More informationREPRESENTATION THEORETIC PATTERNS IN THREE DIMENSIONAL CRYO-ELECTRON MICROSCOPY I - THE INTRINSIC RECONSTITUTION ALGORITHM
REPRESENTATION THEORETIC PATTERNS IN THREE DIMENSIONAL CRYO-ELECTRON MICROSCOPY I - THE INTRINSIC RECONSTITUTION ALGORITHM RONNY HADANI AND AMIT SINGER A. In this paper, we reveal the formal algebraic
More informationLecture 21: HSP via the Pretty Good Measurement
Quantum Computation (CMU 5-859BB, Fall 205) Lecture 2: HSP via the Pretty Good Measurement November 8, 205 Lecturer: John Wright Scribe: Joshua Brakensiek The Average-Case Model Recall from Lecture 20
More informationSemidefinite Programming
Semidefinite Programming Notes by Bernd Sturmfels for the lecture on June 26, 208, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra The transition from linear algebra to nonlinear algebra has
More informationSTA 4273H: Statistical Machine Learning
STA 4273H: Statistical Machine Learning Russ Salakhutdinov Department of Computer Science! Department of Statistical Sciences! rsalakhu@cs.toronto.edu! h0p://www.cs.utoronto.ca/~rsalakhu/ Lecture 7 Approximate
More informationManifold Regularization
9.520: Statistical Learning Theory and Applications arch 3rd, 200 anifold Regularization Lecturer: Lorenzo Rosasco Scribe: Hooyoung Chung Introduction In this lecture we introduce a class of learning algorithms,
More informationBasics of protein structure
Today: 1. Projects a. Requirements: i. Critical review of one paper ii. At least one computational result b. Noon, Dec. 3 rd written report and oral presentation are due; submit via email to bphys101@fas.harvard.edu
More informationNear-Optimal Algorithms for Maximum Constraint Satisfaction Problems
Near-Optimal Algorithms for Maximum Constraint Satisfaction Problems Moses Charikar Konstantin Makarychev Yury Makarychev Princeton University Abstract In this paper we present approximation algorithms
More information