Biomedical subjects

Yao Cong

Publications and source records attributed to Yao Cong.

3 recordsLinked to original sources

PubMed2005

Fast rotational matching of single-particle images.

The presence of noise and absence of contrast in electron micrographs lead to a reduced resolution of the final 3D reconstruction, due to the inherent limitations of single-particle image alignment. The fast rotational matching (FRM) algorithm was introduced recently for an accurate alignment of 2D images under such challenging conditions. Here, we implemented this algorithm for the first time in a standard 3D reconstruction package used in electron microscopy. This allowed us to carry out exhaustive tests of the robustness and reliability in iterative orientation determination, classification, and 3D reconstruction on simulated and experimental image data. A classification test on GroEL chaperonin images demonstrates that FRM assigns up to 13% more images to their correct reference orientation, compared to the classical self-correlation function method. Moreover, at sub-nanometer resolution, GroEL and rice dwarf virus reconstructions exhibit a remarkable resolution gain of 10-20% that is attributed to the novel image alignment kernel.

Algorithms↗

PubMed2003

Fast rotational matching of rigid bodies by fast Fourier transform acceleration of five degrees of freedom.

The 'fast rotational matching' method (an approach to find the three rotational degrees of freedom in matching problems using just one three-dimensional FFT) is extended to the full six-dimensional (rotation and translation) matching scenario between two three-dimensional objects. By recasting this problem into a formulation involving five angles and just one translational parameter, it was possible to accelerate, by means of fast Fourier transforms, five of the six degrees of freedom of the problem. This method was successfully applied to the docking of atomic structures of components into three-dimensional low-resolution density maps. Timing comparisons performed with our method and with 'fast translational matching' (the standard way to accelerate the translational parameters utilizing fast Fourier transforms) demonstrates that the performance gain can reach several orders of magnitude, especially for large map sizes. This gain can be particularly advantageous for spherical- and toroidal-shaped maps, since the scanning range of the translational parameter would be significantly constrained in these cases. The method can also be harnessed to the complementary surface (or 'exterior docking') problem and to pattern recognition in image processing.

Fourier Analysis↗

PubMedDate not supplied

2D fast rotational matching for image processing of biophysical data.

In 3D single particle reconstruction, which involves the translational and rotational matching of a large number of electron microscopy (EM) images, the algorithmic performance is largely dependent on the efficiency and accuracy of the underlying 2D image alignment kernel. We present a novel fast rotational matching kernel for 2D images (FRM2D) that significantly reduces the cost of this alignment. The alignment problem is formulated using one translational and two rotational degrees of freedom. This allows us to take advantage of fast Fourier transforms (FFTs) in rotational space to accelerate the search of the two angular parameters, while the remaining translational parameter is explored, within a limited range, by exhaustive search. Since there are no boundary effects in FFTs of cyclic angular variables, we avoid the expensive zero padding associated with Fourier transforms in linear space. To verify the robustness of our method, efficiency and accuracy tests were carried out over a range of noise levels in realistic simulations of EM images. Performance tests against two standard alignment methods, resampling to polar coordinates and self-correlation, demonstrate that FRM2D compares very favorably to the traditional methods. FRM2D exhibits a comparable or higher robustness against noise and a significant gain in efficiency that depends on the fineness of the angular sampling and linear search range.

Algorithms↗