-SUP: a clustering algorithm for cryo-electron microscopy images of asymmetric particles
From MaRDI portal
Publication:2453670
Abstract: Cryo-electron microscopy (cryo-EM) has recently emerged as a powerful tool for obtaining three-dimensional (3D) structures of biological macromolecules in native states. A minimum cryo-EM image data set for deriving a meaningful reconstruction is comprised of thousands of randomly orientated projections of identical particles photographed with a small number of electrons. The computation of 3D structure from 2D projections requires clustering, which aims to enhance the signal to noise ratio in each view by grouping similarly oriented images. Nevertheless, the prevailing clustering techniques are often compromised by three characteristics of cryo-EM data: high noise content, high dimensionality and large number of clusters. Moreover, since clustering requires registering images of similar orientation into the same pixel coordinates by 2D alignment, it is desired that the clustering algorithm can label misaligned images as outliers. Herein, we introduce a clustering algorithm -SUP to model the data with a -Gaussian mixture and adopt the minimum -divergence for estimation, and then use a self-updating procedure to obtain the numerical solution. We apply -SUP to the cryo-EM images of two benchmark macromolecules, RNA polymerase II and ribosome. In the former case, simulated images were chosen to decouple clustering from alignment to demonstrate -SUP is more robust to misalignment outliers than the existing clustering methods used in the cryo-EM community. In the latter case, the clustering of real cryo-EM data by our -SUP method eliminates noise in many views to reveal true structure features of ribosome at the projection level.
Recommendations
- A representation theory perspective on simultaneous alignment and classification
- Viewing angle classification of cryo-electron microscopy images using eigenvectors
- A Bayesian approach to initial model inference in cryo-electron microscopy
- Three-dimensional structure determination from common lines in cryo-EM by eigenvectors and semidefinite programming
- Toward Single Particle Reconstruction without Particle Picking: Breaking the Detection Limit
Cites work
- Estimating the number of clusters in a data set via the gap statistic
- Families of alpha-, beta- and gamma-divergences: flexible and robust measures of similarities
- Functional Bregman Divergence and Bayesian Estimation of Distributions
- Geometry of q-exponential family of probability distributions
- scientific article; zbMATH DE number 3579840 (Why is no real title available?)
- scientific article; zbMATH DE number 795297 (Why is no real title available?)
- Introduction to Information Retrieval
- Least squares quantization in PCM
- Model-Based Gaussian and Non-Gaussian Clustering
- On multilinear principal component analysis of order-two tensors
- Projective power entropy and maximum Tsallis entropy distributions
- Robust and efficient estimation by minimising a density power divergence
- Robust Estimation: A Weighted Maximum Likelihood Approach
- Robust extraction of local structures by the minimum \(\beta\)-divergence method
- Robust parameter estimation with a small bias against heavy contamination
- Strictly Proper Scoring Rules, Prediction, and Estimation
- Strip Integration in Radio Astronomy
- The estimation of the gradient of a density function, with applications in pattern recognition
Cited in
(12)- On the asymptotic normality and efficiency of Kronecker envelope principal component analysis
- AdaReg: data adaptive robust estimation in linear regression with application in GTEx gene expressions
- On the convergence and consistency of the blurring mean-shift process
- The generalized degrees of freedom of multilinear principal component analysis
- A jackknife entropy-based clustering algorithm for probability density functions
- A robust automatic clustering algorithm for probability density functions with application to categorizing color images
- On the strengths of the self-updating process clustering algorithm
- Spontaneous clustering via minimum gamma-divergence
- Robust clustering method in the presence of scattered observations
- Randomized self-updating process for clustering large-scale data
- Representation theoretic patterns in three-dimensional cryo-electron microscopy. II: The class averaging problem
- On the weak convergence and central limit theorem of blurring and nonblurring processes with application to robust location estimation
This page was built for publication: \(\gamma\)-SUP: a clustering algorithm for cryo-electron microscopy images of asymmetric particles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453670)