Cargando…
Robust and ultrafast fiducial marker correspondence in electron tomography by a two-stage algorithm considering local constraints
MOTIVATION: Electron tomography (ET) has become an indispensable tool for structural biology studies. In ET, the tilt series alignment and the projection parameter calibration are the key steps toward high-resolution ultrastructure analysis. Usually, fiducial markers are embedded in the sample to ai...
Autores principales: | , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Oxford University Press
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8694346/ https://www.ncbi.nlm.nih.gov/pubmed/33416867 http://dx.doi.org/10.1093/bioinformatics/btaa1098 |
_version_ | 1784619333923635200 |
---|---|
author | Han, Renmin Li, Guojun Gao, Xin |
author_facet | Han, Renmin Li, Guojun Gao, Xin |
author_sort | Han, Renmin |
collection | PubMed |
description | MOTIVATION: Electron tomography (ET) has become an indispensable tool for structural biology studies. In ET, the tilt series alignment and the projection parameter calibration are the key steps toward high-resolution ultrastructure analysis. Usually, fiducial markers are embedded in the sample to aid the alignment. Despite the advances in developing algorithms to find correspondence of fiducial markers from different tilted micrographs, the error rate of the existing methods is still high such that manual correction has to be conducted. In addition, existing algorithms do not work well when the number of fiducial markers is high. RESULTS: In this article, we try to completely solve the fiducial marker correspondence problem. We propose to divide the workflow of fiducial marker correspondence into two stages: (i) initial transformation determination, and (ii) local correspondence refinement. In the first stage, we model the transform estimation as a correspondence pair inquiry and verification problem. The local geometric constraints and invariant features are used to reduce the complexity of the problem. In the second stage, we encode the geometric distribution of the fiducial markers by a weighted Gaussian mixture model and introduce drift parameters to correct the effects of beam-induced motion and sample deformation. Comprehensive experiments on real-world datasets demonstrate the robustness, efficiency and effectiveness of the proposed algorithm. Especially, the proposed two-stage algorithm is able to produce an accurate tracking within an average of [Formula: see text] ms per image, even for micrographs with hundreds of fiducial markers, which makes the real-time ET data processing possible. AVAILABILITY AND IMPLEMENTATION: The code is available at https://github.com/icthrm/auto-tilt-pair. Additionally, the detailed original figures demonstrated in the experiments can be accessed at https://rb.gy/6adtk4. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. |
format | Online Article Text |
id | pubmed-8694346 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2021 |
publisher | Oxford University Press |
record_format | MEDLINE/PubMed |
spelling | pubmed-86943462022-01-04 Robust and ultrafast fiducial marker correspondence in electron tomography by a two-stage algorithm considering local constraints Han, Renmin Li, Guojun Gao, Xin Bioinformatics Original Papers MOTIVATION: Electron tomography (ET) has become an indispensable tool for structural biology studies. In ET, the tilt series alignment and the projection parameter calibration are the key steps toward high-resolution ultrastructure analysis. Usually, fiducial markers are embedded in the sample to aid the alignment. Despite the advances in developing algorithms to find correspondence of fiducial markers from different tilted micrographs, the error rate of the existing methods is still high such that manual correction has to be conducted. In addition, existing algorithms do not work well when the number of fiducial markers is high. RESULTS: In this article, we try to completely solve the fiducial marker correspondence problem. We propose to divide the workflow of fiducial marker correspondence into two stages: (i) initial transformation determination, and (ii) local correspondence refinement. In the first stage, we model the transform estimation as a correspondence pair inquiry and verification problem. The local geometric constraints and invariant features are used to reduce the complexity of the problem. In the second stage, we encode the geometric distribution of the fiducial markers by a weighted Gaussian mixture model and introduce drift parameters to correct the effects of beam-induced motion and sample deformation. Comprehensive experiments on real-world datasets demonstrate the robustness, efficiency and effectiveness of the proposed algorithm. Especially, the proposed two-stage algorithm is able to produce an accurate tracking within an average of [Formula: see text] ms per image, even for micrographs with hundreds of fiducial markers, which makes the real-time ET data processing possible. AVAILABILITY AND IMPLEMENTATION: The code is available at https://github.com/icthrm/auto-tilt-pair. Additionally, the detailed original figures demonstrated in the experiments can be accessed at https://rb.gy/6adtk4. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Oxford University Press 2021-01-08 /pmc/articles/PMC8694346/ /pubmed/33416867 http://dx.doi.org/10.1093/bioinformatics/btaa1098 Text en © The Author(s) 2021. Published by Oxford University Press. https://creativecommons.org/licenses/by/4.0/This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted reuse, distribution, and reproduction in any medium, provided the original work is properly cited. |
spellingShingle | Original Papers Han, Renmin Li, Guojun Gao, Xin Robust and ultrafast fiducial marker correspondence in electron tomography by a two-stage algorithm considering local constraints |
title | Robust and ultrafast fiducial marker correspondence in electron tomography by a two-stage algorithm considering local constraints |
title_full | Robust and ultrafast fiducial marker correspondence in electron tomography by a two-stage algorithm considering local constraints |
title_fullStr | Robust and ultrafast fiducial marker correspondence in electron tomography by a two-stage algorithm considering local constraints |
title_full_unstemmed | Robust and ultrafast fiducial marker correspondence in electron tomography by a two-stage algorithm considering local constraints |
title_short | Robust and ultrafast fiducial marker correspondence in electron tomography by a two-stage algorithm considering local constraints |
title_sort | robust and ultrafast fiducial marker correspondence in electron tomography by a two-stage algorithm considering local constraints |
topic | Original Papers |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8694346/ https://www.ncbi.nlm.nih.gov/pubmed/33416867 http://dx.doi.org/10.1093/bioinformatics/btaa1098 |
work_keys_str_mv | AT hanrenmin robustandultrafastfiducialmarkercorrespondenceinelectrontomographybyatwostagealgorithmconsideringlocalconstraints AT liguojun robustandultrafastfiducialmarkercorrespondenceinelectrontomographybyatwostagealgorithmconsideringlocalconstraints AT gaoxin robustandultrafastfiducialmarkercorrespondenceinelectrontomographybyatwostagealgorithmconsideringlocalconstraints |