- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- BIRS Workshop Lecture Videos /
- Structural Heterogeneity from 3D Covariance Estimation...
Open Collections
BIRS Workshop Lecture Videos
BIRS Workshop Lecture Videos
Structural Heterogeneity from 3D Covariance Estimation in Cryo-EM Anden, Joakim
Description
Molecules imaged using cryo-electron microscopy (cryo-EM) often exhibit a significant amount of variability, be it in conformation or composition. The molecules are typically represented as 3D volume maps of the electric potential as a function of space. In order to characterize the variability of these maps, the authors propose a method for fast and accurate estimation of the 3D covariance matrix. The estimator is given by the least-squares solution to a linear inverse problem and is efficiently calculated by exploiting its 6D convolutional structure. Combining this with a circulant preconditioner, the solution is obtained using the conjugate gradient method. For $n$ images of size $N$-by-$N$, the computational complexity of the algorithm is $O(n N^4 + \sqrt{\kappa} N^6 \log N)$, where $\kappa$ is a condition number typically of the order $200$. The method is evaluated on simulated and experimental datasets, achieving results comparable to the state of the art at very short runtimes.
Item Metadata
| Title |
Structural Heterogeneity from 3D Covariance Estimation in Cryo-EM
|
| Creator | |
| Publisher |
Banff International Research Station for Mathematical Innovation and Discovery
|
| Date Issued |
2017-10-16T10:05
|
| Description |
Molecules imaged using cryo-electron microscopy (cryo-EM) often exhibit a significant amount of variability, be it in conformation or composition. The molecules are typically represented as 3D volume maps of the electric potential as a function of space. In order to characterize the variability of these maps, the authors propose a method for fast and accurate estimation of the 3D covariance matrix. The estimator is given by the least-squares solution to a linear inverse problem and is efficiently calculated by exploiting its 6D convolutional structure. Combining this with a circulant preconditioner, the solution is obtained using the conjugate gradient method. For $n$ images of size $N$-by-$N$, the computational complexity of the algorithm is $O(n N^4 + \sqrt{\kappa} N^6 \log N)$, where $\kappa$ is a condition number typically of the order $200$. The method is evaluated on simulated and experimental datasets, achieving results comparable to the state of the art at very short runtimes.
|
| Extent |
28 minutes
|
| Subject | |
| Type | |
| File Format |
video/mp4
|
| Language |
eng
|
| Notes |
Author affiliation: Flatiron Institute
|
| Series | |
| Date Available |
2018-04-14
|
| Provider |
Vancouver : University of British Columbia Library
|
| Rights |
Attribution-NonCommercial-NoDerivatives 4.0 International
|
| DOI |
10.14288/1.0365626
|
| URI | |
| Affiliation | |
| Peer Review Status |
Unreviewed
|
| Scholarly Level |
Other
|
| Rights URI | |
| Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International