The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Three-Dimensional Structure Determination from Common Lines in Cryo-EM by Eigenvectors and Semidefinite Programming
Open accessAbstract
The cryo-electron microscopy reconstruction problem is to find the three-dimensional (3D) structure of a macromolecule given noisy samples of its two-dimensional projection images at unknown random directions. Present algorithms for finding an initial 3D structure model are based on the "angular reconstitution" method in which a coordinate system is established from three projections, and the orientation of the particle giving rise to each image is deduced from common lines among the images. However, a reliable detection of common lines is difficult due to the low signal-to-noise ratio of the images. In this paper we describe two algorithms for finding the unknown imaging directions of all projections by minimizing global self-consistency errors. In the first algorithm, the minimizer is obtained by computing the three largest eigenvectors of a specially designed symmetric matrix derived from the common lines, while the second algorithm is based on semidefinite programming (SDP). Compared with existing algorithms, the advantages of our algorithms are five-fold: first, they accurately estimate all orientations at very low common-line detection rates; second, they are extremely fast, as they involve only the computation of a few top eigenvectors or a sparse SDP; third, they are nonsequential and use the information in all common lines at once; fourth, they are amenable to a rigorous mathematical analysis using spectral analysis and random matrix theory; and finally, the algorithms are optimal in the sense that they reach the information theoretic Shannon bound up to a constant for an idealized probabilistic model.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Least-Squares Fitting of Two 3-D Point Sets
Arun, K. S., Huang, T. S., & Blostein, S. D. (1987) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1987.4767965 · Cited by 3,952 · cited 3×
“Arun, Huang, and Bolstein [27] proved that tr(OQ) ≤ tr(V U T Q) for all O ∈ SO(3), where Q = U ΣV T is the singular value decomposition of Q.”
BackgroundMethodInfluentialGoemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587 · cited 3×
“9) using semidefinite programming (SDP) [24], which draws similarities with the Goemans–Williamson SDP for finding the maximum cut in a weighted graph [25].”
MethodAngular synchronization by eigenvectors and semidefinite programming
Singer, A. (2011) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2010.02.001 · Cited by 329
Self-citation
Research works printed but not linked: 39
- J. Frank, Three-Dimensional Electron Microscopy of Macromolecular Assemblies: Visualization of Biological Molecules in Their Native State , Oxford University Press, New York, 2006.
- 10.1152/physiol.00045.2005 · doi:10.1152/physiol.00045.2005
- 10.1017/S0033583504003920 · DOI · Paper page
- 10.1016/j.str.2008.02.007 · DOI · Paper page
- 10.1073/pnas.0711623105 · DOI · Paper page
- 10.1016/j.str.2004.12.016 · DOI
- 10.1111/j.1365-2818.1987.tb01333.x · DOI · Paper page
- 10.1002/j.1460-2075.1987.tb04865.x · doi:10.1002/j.1460-2075.1987.tb04865.x
- 10.1016/0734-189X(90)90038-W · DOI
- 10.1007/BF00140118 · doi:10.1007/bf00140118
- 10.1016/0304-3991(94)90038-8 · DOI · Paper page
- 10.1016/0304-3991(87)90078-7 · DOI · Paper page
- 10.1017/S0033583500003644 · DOI · Paper page
- B. Vainshtein and A. Goncharov, Determination of the spatial orientation of arbitrarily arranged identical particles of an unknown structure from their projections , in Proceedings of the 11th International Congress on Electron Mircoscopy, 1986, pp. 459–460.
- Van Heel M., 1997, Scanning Microscopy, 11, 195
- 10.1364/JOSAA.9.001749 · doi:10.1364/josaa.9.001749
- 10.1016/0304-3991(96)00037-X · DOI
- S. P. Mallick, S. Agarwal, D. J. Kriegman, S. J. Belongie, B. Carragher, and C. S. Potter, Structure and view estimation for tomographic reconstruction: A Bayesian approach , in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), Volume II, 2006, pp. 2253–2260. · doi:10.1109/cvpr.2006.295
- 10.1016/j.jsb.2009.11.003 · doi:10.1016/j.jsb.2009.11.003
- 10.1016/j.acha.2009.11.003 · DOI
- S. Basu and Y. Bresler, Uniqueness of tomography with unknown view angles, IEEE Trans. Image Process. 9 (2000), pp. 1094–1106. · doi:10.1109/83.846251
- S. Basu and Y. Bresler, Feasibility of tomography with unknown view angles, IEEE Trans. Image Process. 9 (2000), pp. 1107–1122. · doi:10.1109/83.846252
- 10.1109/TIP.2008.2002305 · DOI · Paper page
- 10.1137/1038003 · DOI · Paper page
- F. Natterer, The Mathematics of Computerized Tomography , Classics Appl. Math. 32, SIAM, Philadelphia, 2001. · DOI · Paper page
- 10.2307/1970079 · DOI · Paper page
- 10.2307/1970008 · DOI · Paper page
- 10.1007/s10107-002-0352-8 · DOI · Paper page
- 10.1016/S1063-5203(03)00030-7 · doi:10.1016/s1063-5203(03)00030-7
- 10.1137/060650283 · DOI
- Coifman R. R., 1968, Enseignement Math., 14, 121
- 10.1007/BF02785860 · DOI
- 10.1007/s002200050743 · DOI · Paper page
- 10.1007/BF02100489 · DOI · Paper page
- 10.1007/s00440-005-0466-z · DOI · Paper page
- 10.1007/s00220-007-0209-3 · DOI · Paper page
- 10.1007/BF02579329 · DOI · Paper page
- T. M. Cover and J. A. Thomas, Elements of Information Theory , Wiley, New York, 1991.
- R. G. Gallager, Information Theory and Reliable Communication , Wiley, New York, 1968.
Cited by
Past, Present, and Future of Simultaneous Localization and Mapping: Toward the Robust-Perception Age
Cadena, C., Carlone, L., Carrillo, H., Latif, Y., Scaramuzza, D., Neira, J., Reid, I., & Leonard, J. J. (2016) · IEEE Transactions on Robotics · doi:10.1109/tro.2016.2624754 · Cited by 3,596
“[245], [254], structure from motion in computer vision [87], [96], [104], [168], and cryo-electron microscopy [224], [225].”
Past, present, and future of simultaneous localization and mapping: Toward the robust-perception age
Cadena, C., Carlone, L., Carrillo, H., Latif, Y., Scaramuzza, D., Neira, J., Reid, I. D., & Leonard, J. J. (2016) · Zurich Open Repository and Archive (University of Zurich) · doi:10.5167/uzh-138892 · Cited by 3,048
Angular synchronization by eigenvectors and semidefinite programming
Singer, A. (2011) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2010.02.001 · Cited by 329
Self-citationSE-Sync: A certifiably correct algorithm for synchronization over the special Euclidean group
Rosen, D. M., Carlone, L., Bandeira, A. S., & Leonard, J. J. (2019) · The International Journal of Robotics Research · doi:10.1177/0278364918784361 · Cited by 282
Exact and stable recovery of rotations for robust synchronization
Wang, L., & Singer, A. (2013) · Information and Inference · doi:10.1093/imaiai/iat005 · Cited by 178
Self-citation
Metadata
- Authors
- Singer, A., & Shkolnisky, Y.
- Venue
- SIAM Journal on Imaging Sciences
- Published
- 2011-01
- Volume
- 4
- Issue
- 2
- Pages
- 543-572
- ISSN
- 1936-4954 (ISSN-L)
- OpenAlex
- W2072951627
- Cited by
- 178
- References
- 3
- FWCI
- 6.06
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.