• Login
    View Item 
    •   Home
    • Research
    • Articles
    • View Item
    •   Home
    • Research
    • Articles
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguideTheses and Dissertations LibguideSubmit an Item

    Statistics

    Display statistics

    Robust and ultrafast fiducial marker correspondence in electron tomography by a two-stage algorithm considering local constraints

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    main_manuscript.pdf
    Size:
    4.699Mb
    Format:
    PDF
    Description:
    Accepted manuscript
    Download
    Type
    Article
    Authors
    Han, Renmin
    Li, Guojun
    Gao, Xin cc
    KAUST Department
    Computational Bioscience Research Center (CBRC)
    Computer Science Program
    Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division
    Structural and Functional Bioinformatics Group
    KAUST Grant Number
    FCC/1/1976-17
    FCC/1/1976-23
    FCC/1/1976-26
    REI/1/0018-01-01
    Date
    2021-01-08
    Online Publication Date
    2021-01-08
    Print Publication Date
    2021-04-09
    Embargo End Date
    2022-01-08
    Submitted Date
    2020-07-02
    Permanent link to this record
    http://hdl.handle.net/10754/667204
    
    Metadata
    Show full item record
    Abstract
    Abstract 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 towards 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 paper, 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 ≤ ms per image, even for micrographs with hundreds of fiducial markers, which makes the real-time ET data processing possible. Availability 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.
    Citation
    Han, R., Li, G., & Gao, X. (2021). Robust and ultrafast fiducial marker correspondence in electron tomography by a two-stage algorithm considering local constraints. Bioinformatics. doi:10.1093/bioinformatics/btaa1098
    Sponsors
    This work was supported by the National Key Research and Development Program of China [2020YFA0712400], the National Natural Science Foundation of China [62072280, 11931008, 61771009], the King Abdullah University of Science and Technology (KAUST) Office of Sponsored Research (OSR) under Awards No. FCC/1/1976-17, FCC/1/1976-23, FCC/1/1976-26, URF/1/4098-01-01, URF/1/4352-01-01, URF/1/4379-01-01, REI/1/0018-01-01 and REI/1/4473-01-01.
    Publisher
    Oxford University Press (OUP)
    Journal
    Bioinformatics
    DOI
    10.1093/bioinformatics/btaa1098
    PubMed ID
    33416867
    Additional Links
    https://academic.oup.com/bioinformatics/advance-article/doi/10.1093/bioinformatics/btaa1098/6069572
    Relations
    Is Supplemented By:
    • [Software]
      Title: icthrm/auto-tilt-pair:. Publication Date: 2020-01-18. github: icthrm/auto-tilt-pair Handle: 10754/668077
    ae974a485f413a2113503eed53cd6c53
    10.1093/bioinformatics/btaa1098
    Scopus Count
    Collections
    Articles; Structural and Functional Bioinformatics Group; Computer Science Program; Computational Bioscience Research Center (CBRC); Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division

    entitlement

    Related articles

    • A fast fiducial marker tracking model for fully automatic alignment in electron tomography.
    • Authors: Han R, Zhang F, Gao X
    • Issue date: 2018 Mar 1
    • A novel fully automatic scheme for fiducial marker-based alignment in electron tomography.
    • Authors: Han R, Wang L, Liu Z, Sun F, Zhang F
    • Issue date: 2015 Dec
    • A joint method for marker-free alignment of tilt series in electron tomography.
    • Authors: Han R, Bao Z, Zeng X, Niu T, Zhang F, Xu M, Gao X
    • Issue date: 2019 Jul 15
    • AuTom-dualx: a toolkit for fully automatic fiducial marker-based alignment of dual-axis tilt series with simultaneous reconstruction.
    • Authors: Han R, Wan X, Li L, Lawrence A, Yang P, Li Y, Wang S, Sun F, Liu Z, Gao X, Zhang F
    • Issue date: 2019 Jan 15
    • Robust fluoroscopic tracking of fiducial markers: exploiting the spatial constraints.
    • Authors: Li R, Sharp G
    • Issue date: 2013 Mar 21
    DSpace software copyright © 2002-2023  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.