PubMed Health⌕ Search

Biomedical subjects

Guillermo Sapiro

Publications and source records attributed to Guillermo Sapiro.

7 recordsLinked to original sources

Shapes of antibody binding sites: qualitative and quantitative analyses based on a geomorphic classification scheme.

The topography of antibody binding sites has been classified into five types that evoke familiar geomorphic features of the Earth. The 229 antibody crystal structures from the Protein Data Bank were analyzed and classified into these classes. Relationships to previous topography classifications by Rees et al., who defined three classes, and Thornton et al., who defined four classes, are identified. An algorithm was developed to identify the antibody binding site class automatically based on the definition and the shape of the binding site. A three-dimensional convex hull was formed around the complementarity determining regions (CDRs) of the antibody. The convex hull was then "trimmed" to fit the binding site by using distance criteria and morphological techniques. Once the program identified the binding site shape, a statistical and distance based analysis was performed to classify automatically the antibody into one of the five geomorphic classes. The five antibody topography classes are as follows: cave (mostly hapten binders), crater (mostly protein and peptide/carbohydrate/nucleic acid binders), canyon, valley, and plain (mostly protein binders). Comparisons of the binding sites of empty and of complexed antibody binding sites gave an indication of how the shape of the binding site is influenced by binding of the antigen.

Algorithms↗

Fast image and video colorization using chrominance blending.

Colorization, the task of coloring a grayscale image or video, involves assigning from the single dimension of intensity or luminance a quantity that varies in three dimensions, such as red, green, and blue channels. Mapping between intensity and color is, therefore, not unique, and colorization is ambiguous in nature and requires some amount of human interaction or external information. A computationally simple, yet effective, approach of colorization is presented in this paper. The method is fast and it can be conveniently used "on the fly," permitting the user to interactively get the desired results promptly after providing a reduced set of chrominance scribbles. Based on the concepts of luminance-weighted chrominance blending and fast intrinsic distance computations, high-quality colorization results for still images and video are obtained at a fraction of the complexity and computational cost of previously reported techniques. Possible extensions of the algorithm introduced here included the capability of changing the colors of an existing color image or video, as well as changing the underlying luminance, and many other special effects demonstrated here.

Algorithms↗

An energy-based three-dimensional segmentation approach for the quantitative interpretation of electron tomograms.

Electron tomography allows for the determination of the three-dimensional structures of cells and tissues at resolutions significantly higher than that which is possible with optical microscopy. Electron tomograms contain, in principle, vast amounts of information on the locations and architectures of large numbers of subcellular assemblies and organelles. The development of reliable quantitative approaches for the analysis of features in tomograms is an important problem, and a challenging prospect due to the low signal-to-noise ratios that are inherent to biological electron microscopic images. This is, in part, a consequence of the tremendous complexity of biological specimens. We report on a new method for the automated segmentation of HIV particles and selected cellular compartments in electron tomograms recorded from fixed, plastic-embedded sections derived from HIV-infected human macrophages. Individual features in the tomogram are segmented using a novel robust algorithm that finds their boundaries as global minimal surfaces in a metric space defined by image features. The optimization is carried out in a transformed spherical domain with the center an interior point of the particle of interest, providing a proper setting for the fast and accurate minimization of the segmentation energy. This method provides tools for the semi-automated detection and statistical evaluation of HIV particles at different stages of assembly in the cells and presents opportunities for correlation with biochemical markers of HIV infection. The segmentation algorithm developed here forms the basis of the automated analysis of electron tomograms and will be especially useful given the rapid increases in the rate of data acquisition. It could also enable studies of much larger data sets, such as those which might be obtained from the tomographic analysis of HIV-infected cells from studies of large populations.

Algorithms↗

Is image steganography natural?

Steganography is the art of secret communication. Its purpose is to hide the presence of information, using, for example, images as covers. We experimentally investigate if stego-images, bearing a secret message, are statistically "natural." For this purpose, we use recent results on the statistics of natural images and investigate the effect of some popular steganography techniques. We found that these fundamental statistics of natural images are, in fact, generally altered by the hidden "nonnatural" information. Frequently, the change is consistently biased in a given direction. However, for the class of natural images considered, the change generally falls within the intrinsic variability of the statistics, and, thus, does not allow for reliable detection, unless knowledge of the data hiding process is taken into account. In the latter case, significant levels of detection are demonstrated.

Algorithms↗

Implicit brain imaging.

We describe how implicit surface representations can be used to solve fundamental problems in brain imaging. This kind of representation is not only natural following the state-of-the-art segmentation algorithms reported in the literature to extract the different brain tissues, but it is also, as shown in this paper, the most appropriate one from the computational point of view. Examples are provided for finding constrained special curves on the cortex, such as sulcal beds, regularizing surface-based measures, such as cortical thickness, and for computing warping fields between surfaces such as the brain cortex. All these result from efficiently solving partial differential equations (PDEs) and variational problems on surfaces represented in implicit form. The implicit framework avoids the need to construct intermediate mappings between 3-D anatomical surfaces and parametric objects such planes or spheres, a complex step that introduces errors and is required by many other cortical processing approaches.

Algorithms↗

Morse description and geometric encoding of digital elevation maps.

Two complementary geometric structures for the topographic representation of an image are developed in this work. The first one computes a description of the Morse-topological structure of the image, while the second one computes a simplified version of its drainage structure. The topographic significance of the Morse and drainage structures of digital elevation maps (DEMs) suggests that they can been used as the basis of an efficient encoding scheme. As an application, we combine this geometric representation with an interpolation algorithm and lossless data compression schemes to develop a compression scheme for DEMs. This algorithm achieves high compression while controlling the maximum error in the decoded elevation map, a property that is necessary for the majority of applications dealing with DEMs. We present the underlying theory and compression results for standard DEM data.

Algorithms↗

Statistical analysis of RNA backbone.

Local conformation is an important determinant of RNA catalysis and binding. The analysis of RNA conformation is particularly difficult due to the large number of degrees of freedom (torsion angles) per residue. Proteins, by comparison, have many fewer degrees of freedom per residue. In this work, we use and extend classical tools from statistics and signal processing to search for clusters in RNA conformational space. Results are reported both for scalar analysis, where each torsion angle is separately studied, and for vectorial analysis, where several angles are simultaneously clustered. Adapting techniques from vector quantization and clustering to the RNA structure, we find torsion angle clusters and RNA conformational motifs. We validate the technique using well-known conformational motifs, showing that the simultaneous study of the total torsion angle space leads to results consistent with known motifs reported in the literature and also to the finding of new ones.

Base Sequence↗