48 research outputs found

    2D parallel thinning and shrinking based on sufficient conditions for topology preservation

    Get PDF
    Thinning and shrinking algorithms, respectively, are capable of extracting medial lines and topological kernels from digital binary objects in a topology preserving way. These topological algorithms are composed of reduction operations: object points that satisfy some topological and geometrical constraints are removed until stability is reached. In this work we present some new sufficient conditions for topology preserving parallel reductions and fiftyfour new 2D parallel thinning and shrinking algorithms that are based on our conditions. The proposed thinning algorithms use five characterizations of endpoints

    Acta Cybernetica : Volume 20. Number 1.

    Get PDF

    The 2nd Conference of PhD Students in Computer Science

    Get PDF

    Medial faces from a concise 3D thinning algorithm

    Full text link

    Acta Cybernetica : Volume 15. Number 2.

    Get PDF

    Determining Alpha-Helix Correspondence for Protein Structure Prediction from Cryo-EM Density Maps, Master\u27s Thesis, May 2007

    Get PDF
    Determining protein structure is an important problem for structural biologists, which has received a significant amount of attention in the recent years. In this thesis, we describe a novel, shape-modeling approach as an intermediate step towards recovering 3D protein structures from volumetric images. The input to our method is a sequence of alpha-helices that make up a protein, and a low-resolution volumetric image of the protein where possible locations of alpha-helices have been detected. Our task is to identify the correspondence between the two sets of helices, which will shed light on how the protein folds in space. The central theme of our approach is to cast the correspondence problem as that of shape matching between the 3D volume and the 1D sequence. We model both the shapes as attributed relational graphs, and formulate a constrained inexact graph matching problem. To compute the matching, we developed an optimal algorithm based on the A*-search with several choices of heuristic functions. As demonstrated in a suite of real protein data, the shape-modeling approach is capable of correctly identifying helix correspondences in noise-abundant volumes with minimal or no user intervention
    corecore