3,148 research outputs found

    A Scale-Space Medialness Transform Based on Boundary Concordance Voting

    Get PDF
    The Concordance-based Medial Axis Transform (CMAT) presented in this paper is a multiscale medial axis (MMA) algorithm that computes the medial response from grey-level boundary measures. This non-linear operator responds only to symmetric structures, overcoming the limitations of linear medial operators which create “side-lobe” responses for symmetric structures and respond to edge structures. In addition, the spatial localisation of the medial axis and the identification of object width is improved in the CMAT algorithm compared with linear algorithms. The robustness of linear medial operators to noise is preserved in our algorithm. The effectiveness of the CMAT is accredited to the concordance property described in this paper. We demonstrate the performance of this method with test figures used by other authors and medical images that are relatively complex in structure. In these complex images the benefit of the improved response of our non-linear operator is clearly visible

    Gap Filling of 3-D Microvascular Networks by Tensor Voting

    Get PDF
    We present a new algorithm which merges discontinuities in 3-D images of tubular structures presenting undesirable gaps. The application of the proposed method is mainly associated to large 3-D images of microvascular networks. In order to recover the real network topology, we need to ïŹll the gaps between the closest discontinuous vessels. The algorithm presented in this paper aims at achieving this goal. This algorithm is based on the skeletonization of the segmented network followed by a tensor voting method. It permits to merge the most common kinds of discontinuities found in microvascular networks. It is robust, easy to use, and relatively fast. The microvascular network images were obtained using synchrotron tomography imaging at the European Synchrotron Radiation Facility. These images exhibit samples of intracortical networks. Representative results are illustrated

    Multiscale 3D Shape Analysis using Spherical Wavelets

    Get PDF
    ©2005 Springer. The original publication is available at www.springerlink.com: http://dx.doi.org/10.1007/11566489_57DOI: 10.1007/11566489_57Shape priors attempt to represent biological variations within a population. When variations are global, Principal Component Analysis (PCA) can be used to learn major modes of variation, even from a limited training set. However, when significant local variations exist, PCA typically cannot represent such variations from a small training set. To address this issue, we present a novel algorithm that learns shape variations from data at multiple scales and locations using spherical wavelets and spectral graph partitioning. Our results show that when the training set is small, our algorithm significantly improves the approximation of shapes in a testing set over PCA, which tends to oversmooth data

    Multiscale medial shape-based analysis of image objects

    Get PDF
    pre-printMedial representation of a three-dimensional (3-D) object or an ensemble of 3-D objects involves capturing the object interior as a locus of medial atoms, each atom being two vectors of equal length joined at the tail at the medial point. Medial representation has a variety of beneficial properties, among the most important of which are 1) its inherent geometry, provides an object-intrinsic coordinate system and thus provides correspondence between instances of the object in and near the object(s); 2) it captures the object interior and is, thus, very suitable for deformation; and 3) it provides the basis for an intuitive object-based multiscale sequence leading to efficiency of segmentation algorithms and trainability of statistical characterizations with limited training sets. As a result of these properties, medial representation is particularly suitable for the following image analysis tasks; how each operates will be described and will be illustrated by results: 1) segmentation of objects and object complexes via deformable models; 2) segmentation of tubular trees, e.g., of blood vessels, by following height ridges of measures of fit of medial atoms to target images; 3) object-based image registration via medial loci of such blood vessel trees; 4) statistical characterization of shape differences between control and pathological classes of structures. These analysis tasks are made possible by a new form of medial representation called m-reps, which is described

    The Multiscale Medial Response of Grey-level Images

    Full text link

    Zoom invariant vision of figural shape: The mathematics of cores

    Get PDF
    Believing that figural zoom invariance and the cross-figural boundary linking implied by medial loci are important aspects of object shape, we present the mathematics of and algorithms for the extraction of medial loci directly from image intensities. The medial loci called cores are defined as generalized maxima in scale space of a form of medial information that is invariant to translation, rotation, and in particular, zoom. These loci are very insensitive to image disturbances, in strong contrast to previously available medial loci, as demonstrated in a companion paper. Core-related geometric properties and image object representations are laid out which, together with the aforementioned insensitivities, allow the core to be used effectively for a variety of image analysis objectives.

    Automation Process for Morphometric Analysis of Volumetric CT Data from Pulmonary Vasculature in Rats

    Get PDF
    With advances in medical imaging scanners, it has become commonplace to generate large multidimensional datasets. These datasets require tools for a rapid, thorough analysis. To address this need, we have developed an automated algorithm for morphometric analysis incorporating A Visualization Workshop computational and image processing libraries for three-dimensional segmentation, vascular tree generation and structural hierarchical ordering with a two-stage numeric optimization procedure for estimating vessel diameters. We combine this new technique with our mathematical models of pulmonary vascular morphology to quantify structural and functional attributes of lung arterial trees. Our physiological studies require repeated measurements of vascular structure to determine differences in vessel biomechanical properties between animal models of pulmonary disease. Automation provides many advantages including significantly improved speed and minimized operator interaction and biasing. The results are validated by comparison with previously published rat pulmonary arterial micro-CT data analysis techniques, in which vessels were manually mapped and measured using intense operator intervention

    Affine Registration of label maps in Label Space

    Get PDF
    Two key aspects of coupled multi-object shape\ud analysis and atlas generation are the choice of representation\ud and subsequent registration methods used to align the sample\ud set. For example, a typical brain image can be labeled into\ud three structures: grey matter, white matter and cerebrospinal\ud fluid. Many manipulations such as interpolation, transformation,\ud smoothing, or registration need to be performed on these images\ud before they can be used in further analysis. Current techniques\ud for such analysis tend to trade off performance between the two\ud tasks, performing well for one task but developing problems when\ud used for the other.\ud This article proposes to use a representation that is both\ud flexible and well suited for both tasks. We propose to map object\ud labels to vertices of a regular simplex, e.g. the unit interval for\ud two labels, a triangle for three labels, a tetrahedron for four\ud labels, etc. This representation, which is routinely used in fuzzy\ud classification, is ideally suited for representing and registering\ud multiple shapes. On closer examination, this representation\ud reveals several desirable properties: algebraic operations may\ud be done directly, label uncertainty is expressed as a weighted\ud mixture of labels (probabilistic interpretation), interpolation is\ud unbiased toward any label or the background, and registration\ud may be performed directly.\ud We demonstrate these properties by using label space in a gradient\ud descent based registration scheme to obtain a probabilistic\ud atlas. While straightforward, this iterative method is very slow,\ud could get stuck in local minima, and depends heavily on the initial\ud conditions. To address these issues, two fast methods are proposed\ud which serve as coarse registration schemes following which the\ud iterative descent method can be used to refine the results. Further,\ud we derive an analytical formulation for direct computation of the\ud "group mean" from the parameters of pairwise registration of all\ud the images in the sample set. We show results on richly labeled\ud 2D and 3D data sets
    • 

    corecore