14 research outputs found

    WESD--Weighted Spectral Distance for measuring shape dissimilarity.

    No full text
    This paper presents a new distance for measuring shape dissimilarity between objects. Recent publications introduced the use of eigenvalues of the Laplace operator as compact shape descriptors. Here, we revisit the eigenvalues to define a proper distance, called Weighted Spectral Distance (WESD), for quantifying shape dissimilarity. The definition of WESD is derived through analyzing the heat trace. This analysis provides the proposed distance with an intuitive meaning and mathematically links it to the intrinsic geometry of objects. We analyze the resulting distance definition, present and prove its important theoretical properties. Some of these properties include: 1) WESD is defined over the entire sequence of eigenvalues yet it is guaranteed to converge, 2) it is a pseudometric, 3) it is accurately approximated with a finite number of eigenvalues, and 4) it can be mapped to the ([0,1)) interval. Last, experiments conducted on synthetic and real objects are presented. These experiments highlight the practical benefits of WESD for applications in vision and medical image analysis. © 1979-2012 IEEE

    Anatomy-Aware Inference of the 3D Standing Spine Posture from 2D Radiographs

    Full text link
    An important factor for the development of spinal degeneration, pain and the outcome of spinal surgery is known to be the balance of the spine. It must be analyzed in an upright, standing position to ensure physiological loading conditions and visualize load-dependent deformations. Despite the complex 3D shape of the spine, this analysis is currently performed using 2D radiographs, as all frequently used 3D imaging techniques require the patient to be scanned in a prone position. To overcome this limitation, we propose a deep neural network to reconstruct the 3D spinal pose in an upright standing position, loaded naturally. Specifically, we propose a novel neural network architecture, which takes orthogonal 2D radiographs and infers the spine’s 3D posture using vertebral shape priors. In this work, we define vertebral shape priors using an atlas and a spine shape prior, incorporating both into our proposed network architecture. We validate our architecture on digitally reconstructed radiographs, achieving a 3D reconstruction Dice of 0.95, indicating an almost perfect 2D-to-3D domain translation. Validating the reconstruction accuracy of a 3D standing spine on real data is infeasible due to the lack of a valid ground truth. Hence, we design a novel experiment for this purpose, using an orientation invariant distance metric, to evaluate our model’s ability to synthesize full-3D, upright, and patient-specific spine models. We compare the synthesized spine shapes from clinical upright standing radiographs to the same patient’s 3D spinal posture in the prone position from CT

    Discriminative segmentation-based evaluation through shape dissimilarity.

    Get PDF
    Segmentation-based scores play an important role in the evaluation of computational tools in medical image analysis. These scores evaluate the quality of various tasks, such as image registration and segmentation, by measuring the similarity between two binary label maps. Commonly these measurements blend two aspects of the similarity: pose misalignments and shape discrepancies. Not being able to distinguish between these two aspects, these scores often yield similar results to a widely varying range of different segmentation pairs. Consequently, the comparisons and analysis achieved by interpreting these scores become questionable. In this paper, we address this problem by exploring a new segmentation-based score, called normalized Weighted Spectral Distance (nWSD), that measures only shape discrepancies using the spectrum of the Laplace operator. Through experiments on synthetic and real data we demonstrate that nWSD provides additional information for evaluating differences between segmentations, which is not captured by other commonly used scores. Our results demonstrate that when jointly used with other scores, such as Dices similarity coefficient, the additional information provided by nWSD allows richer, more discriminative evaluations. We show for the task of registration that through this addition we can distinguish different types of registration errors. This allows us to identify the source of errors and discriminate registration results which so far had to be treated as being of similar quality in previous evaluation studies. © 2012 IEEE

    Spectral Forests: Learning of Surface Data, Application to Cortical Parcellation

    Get PDF
    International audienceThis paper presents a new method for classifying surface datavia spectral representations of shapes. Our approach benefits classificationproblems that involve data living on surfaces, such as in cortical parcellation.For instance, current methods for labeling cortical points into surface parcelsoften involve a slow mesh deformation toward pre-labeled atlases, requiringas much as 4 hours with the established FreeSurfer. This may burden neurosciencestudies involving region-specific measurements. Learning techniquesoffer an attractive computational advantage, however, their representation ofspatial information, typically defined in a Euclidean domain, may be inadequatefor cortical parcellation. Indeed, cortical data resides on surfaces thatare highly variable in space and shape. Consequently, Euclidean representationsof surface data may be inconsistent across individuals. We proposeto fundamentally change the spatial representation of surface data, by exploitingspectral coordinates derived from the Laplacian eigenfunctions ofshapes. They have the advantage over Euclidean coordinates, to be geometryaware and to parameterize surfaces explicitly. This change of paradigm,from Euclidean to spectral representations, enables a classifier to be applieddirectly on surface data via spectral coordinates. In this paper, we decide tobuild upon the successful Random Decision Forests algorithm and improve itsspatial representation with spectral features. Our method, Spectral Forests,is shown to significantly improve the accuracy of cortical parcellations overstandard Random Decision Forests (74% versus 28% Dice overlaps), and produceaccuracy equivalent to FreeSurfer in a fraction of its time (23 secondsversus 3 to 4 hours)

    BrainPrint: A discriminative characterization of brain morphology

    Get PDF
    We introduce BrainPrint, a compact and discriminative representation of brain morphology. BrainPrint captures shape information of an ensemble of cortical and subcortical structures by solving the eigenvalue problem of the 2D and 3D Laplace–Beltrami operator on triangular (boundary) and tetrahedral (volumetric) meshes. This discriminative characterization enables new ways to study the similarity between brains; the focus can either be on a specific brain structure of interest or on the overall brain similarity. We highlight four applications for BrainPrint in this article: (i) subject identification, (ii) age and sex prediction, (iii) brain asymmetry analysis, and (iv) potential genetic influences on brain morphology. The properties of BrainPrint require the derivation of new algorithms to account for the heterogeneous mix of brain structures with varying discriminative power. We conduct experiments on three datasets, including over 3000 MRI scans from the ADNI database, 436 MRI scans from the OASIS dataset, and 236 MRI scans from the VETSA twin study. All processing steps for obtaining the compact representation are fully automated, making this processing framework particularly attractive for handling large datasets.National Cancer Institute (U.S.) (1K25-CA181632-01)Athinoula A. Martinos Center for Biomedical Imaging (P41-RR014075)Athinoula A. Martinos Center for Biomedical Imaging (P41-EB015896)National Alliance for Medical Image Computing (U.S.) (U54-EB005149)Neuroimaging Analysis Center (U.S.) (P41-EB015902)National Center for Research Resources (U.S.) (U24 RR021382)National Institute of Biomedical Imaging and Bioengineering (U.S.) (5P41EB015896-15)National Institute of Biomedical Imaging and Bioengineering (U.S.) (R01EB006758)National Institute on Aging (AG022381)National Institute on Aging (5R01AG008122-22)National Institute on Aging (AG018344)National Institute on Aging (AG018386)National Center for Complementary and Alternative Medicine (U.S.) (RC1 AT005728-01)National Institute of Neurological Diseases and Stroke (U.S.) (R01 NS052585-01)National Institute of Neurological Diseases and Stroke (U.S.) (1R21NS072652-01)National Institute of Neurological Diseases and Stroke (U.S.) (1R01NS070963)National Institute of Neurological Diseases and Stroke (U.S.) (R01NS083534)National Institutes of Health (U.S.) ((5U01-MH093765

    BrainPrint: A discriminative characterization of brain morphology

    Get PDF
    We introduce BrainPrint, a compact and discriminative representation of brain morphology. BrainPrint captures shape information of an ensemble of cortical and subcortical structures by solving the eigenvalue problem of the 2D and 3D Laplace–Beltrami operator on triangular (boundary) and tetrahedral (volumetric) meshes. This discriminative characterization enables new ways to study the similarity between brains; the focus can either be on a specific brain structure of interest or on the overall brain similarity. We highlight four applications for BrainPrint in this article: (i) subject identification, (ii) age and sex prediction, (iii) brain asymmetry analysis, and (iv) potential genetic influences on brain morphology. The properties of BrainPrint require the derivation of new algorithms to account for the heterogeneous mix of brain structures with varying discriminative power. We conduct experiments on three datasets, including over 3000 MRI scans from the ADNI database, 436 MRI scans from the OASIS dataset, and 236 MRI scans from the VETSA twin study. All processing steps for obtaining the compact representation are fully automated, making this processing framework particularly attractive for handling large datasets.National Cancer Institute (U.S.) (1K25-CA181632-01)Athinoula A. Martinos Center for Biomedical Imaging (P41-RR014075)Athinoula A. Martinos Center for Biomedical Imaging (P41-EB015896)National Alliance for Medical Image Computing (U.S.) (U54-EB005149)Neuroimaging Analysis Center (U.S.) (P41-EB015902)National Center for Research Resources (U.S.) (U24 RR021382)National Institute of Biomedical Imaging and Bioengineering (U.S.) (5P41EB015896-15)National Institute of Biomedical Imaging and Bioengineering (U.S.) (R01EB006758)National Institute on Aging (AG022381)National Institute on Aging (5R01AG008122-22)National Institute on Aging (AG018344)National Institute on Aging (AG018386)National Center for Complementary and Alternative Medicine (U.S.) (RC1 AT005728-01)National Institute of Neurological Diseases and Stroke (U.S.) (R01 NS052585-01)National Institute of Neurological Diseases and Stroke (U.S.) (1R21NS072652-01)National Institute of Neurological Diseases and Stroke (U.S.) (1R01NS070963)National Institute of Neurological Diseases and Stroke (U.S.) (R01NS083534)National Institutes of Health (U.S.) ((5U01-MH093765

    A modified shape context method for shape based object retrieval

    Full text link

    Spectral Log-Demons: Diffeomorphic Image Registration with Very Large Deformations

    Get PDF
    International audienceThis paper presents a new framework for capturing large and complex deformations in image registration and atlas construction. This challenging and recurrent problem in computer vision and medical imaging currently relies on iterative and local approaches, which are prone to local minima and, therefore, limit present methods to relatively small deformations. Our general framework introduces to this effect a new direct feature matching technique that finds global correspondences between images via simple nearest-neighbor searches. More specifically, very large image deformations are captured in Spectral Forces, which are derived from an improved graph spectral representation. We illustrate the benefits of our framework through a new enhanced version of the popular Log-Demons algorithm, named the Spectral Log-Demons, as well as through a groupwise extension, named the Groupwise Spectral Log-Demons, which is relevant for atlas construction. The evaluations of these extended versions demonstrate substantial improvements in accuracy and robustness to large deformations over the conventional Demons approaches
    corecore