Proteins are involved in almost all functions in a living cell, and functions of proteins are realized by their tertiary structures. Obtaining a global perspective of the variety and distribution of protein structures lays a foundation for our understanding of the building principle of protein structures. In light of the rapid accumulation of low-resolution structure data from electron tomography and cryo-electron microscopy, here we map and classify three-dimensional (3D) surface shapes of proteins into a similarity space. Surface shapes of proteins were represented with 3D Zernike descriptors, mathematical moment-based invariants, which have previously been demonstrated effective for biomolecular structure similarity search. In addition to single chains of proteins, we have also analyzed the shape space occupied by protein complexes. From the mapping, we have obtained various new insights into the relationship between shapes, main-chain folds, and complex formation. The unique view obtained from shape mapping opens up new ways to understand design principles, functions, and evolution of proteins.
We propose a new set of moment invariants based on Krawtchouk polynomials for comparison of local patches in 2D images. Being computed from discrete functions, these moments do not carry the error due to discretization. Unlike many orthogonal moments, which usually capture global features, Krawtchouk moments can be used to compute local descriptors from a region-of-interest in an image. This can be achieved by changing two parameters, and hence shifting the center of interest region horizontally or vertically or both. This property enables comparison of two arbitrary local regions. We show that Krawtchouk moments can be written as a linear combination of geometric moments, so easily converted to rotation, size, and position independent invariants. We also construct local Hu-based invariants using Hu invariants and utilizing them on images localized by the weight function given in the definition of Krawtchouk polynomials. We give the formulation of local Krawtchouk-based and Hu-based invariants, and evaluate their discriminative performance on local comparison of artificially generated test images.
We propose a new geometric buildup algorithm for the solution of the distance geometry problem in protein modeling, which can prevent the accumulation of the rounding errors in the buildup calculations successfully and also tolerate small errors in given distances. In this algorithm, we use all instead of a subset of available distances for the determination of each unknown atom and obtain the position of the atom by using a least-squares approximation instead of an exact solution to the system of distance equations. We show that the least-squares approximation can be obtained by using a special singular value decomposition method, which not only tolerates and minimizes small distance errors, but also prevents the rounding errors from propagation effectively, especially when the distance data is sparse. We describe the least-squares formulations and their solution methods, and present the test results from applying the new algorithm for the determination of a set of protein structures with varying degrees of availability and accuracy of the distances. We show that the new development of the algorithm increases the modeling ability, and improves stability and robustness of the geometric buildup approach significantly from both theoretical and practical points of view.
Zernike polynomials have been widely used in the description and shape retrieval of 3D objects. These orthonormal polynomials allow for efficient description and reconstruction of objects that can be scaled to fit within the unit ball. However, maps defined within box-shaped regions ¶ for example, rectangular prisms or cubes ¶ are not well suited to representation by Zernike polynomials, because these functions are not orthogonal over such regions. In particular, the representations require many expansion terms to describe object features along the edges and corners of the region. We overcome this problem by applying a Gram-Schmidt process to re-orthogonalize the Zernike polynomials so that they recover the orthonormality property over a specified box-shaped domain. We compare the shape retrieval performance of these new polynomial bases to that of the classical Zernike unit-ball polynomials.
Direct comparison of three-dimensional (3D) objects is computationally expensive due to the need for translation, rotation, and scaling of the objects to evaluate their similarity. In applications of 3D object comparison, often identifying specific local regions of objects is of particular interest. We have recently developed a set of 2D moment invariants based on discrete orthogonal Krawtchouk polynomials for comparison of local image patches. In this work, we extend them to 3D and construct 3D Krawtchouk descriptors (3DKD) that are invariant under translation, rotation, and scaling. The new descriptors have the ability to extract local features of a 3D surface from any region-of-interest. This property enables comparison of two arbitrary local surface regions from different 3D objects. We present the new formulation of 3DKD and apply it to the local shape comparison of protein surfaces in order to predict ligand molecules that bind to query proteins. from them do not carry any error due to discretization unlike many other moments related to continuous functions [23]. 2) These polynomials are orthogonal; each moment brings in a new feature of the image, where minimum redundancy is critical in their discriminative performance. Moreover, they are directly defined in the image coordinate space, and hence their orthogonality property is well retained in the computed moments. 3) They are complete with a finite number of functions (equal to the image size) while many other polynomial spaces have infinitely many members. 4) They have the ability to retrieve local image patches by only changing the resolution of reconstruction and using low order moments. 5) The location of the patch can also be controlled by changing three parameters and hence shifting the region-of-interest along each dimension. 6) We also prove that these moments can be transformed into local descriptors, which are invariant under translation, rotation, and scaling. Therefore, using only a small number of invariant descriptors per image will make it possible to develop an efficient method for quick local image retrieval.Moment-based approaches, particularly Krawtchouk moments, are very useful for representing biological and medical images as they are pixelized or voxelized data. In medical imaging, such as computerized tomography (CT) scan and magnetic resonance imaging (MRI), objects are observed at different viewpoints and local images need to be extracted and examined. In digital pathology, for instance, pathologists are interested in information about specific structures rather than the whole image [9]. Thus, it is necessary to construct moment invariants that do not change by translation, rotation, and scaling and can retrieve local image patches or subimages.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.