3,236 research outputs found

    A Deep Learning Framework for Unsupervised Affine and Deformable Image Registration

    Full text link
    Image registration, the process of aligning two or more images, is the core technique of many (semi-)automatic medical image analysis tasks. Recent studies have shown that deep learning methods, notably convolutional neural networks (ConvNets), can be used for image registration. Thus far training of ConvNets for registration was supervised using predefined example registrations. However, obtaining example registrations is not trivial. To circumvent the need for predefined examples, and thereby to increase convenience of training ConvNets for image registration, we propose the Deep Learning Image Registration (DLIR) framework for \textit{unsupervised} affine and deformable image registration. In the DLIR framework ConvNets are trained for image registration by exploiting image similarity analogous to conventional intensity-based image registration. After a ConvNet has been trained with the DLIR framework, it can be used to register pairs of unseen images in one shot. We propose flexible ConvNets designs for affine image registration and for deformable image registration. By stacking multiple of these ConvNets into a larger architecture, we are able to perform coarse-to-fine image registration. We show for registration of cardiac cine MRI and registration of chest CT that performance of the DLIR framework is comparable to conventional image registration while being several orders of magnitude faster.Comment: Accepted: Medical Image Analysis - Elsevie

    DEFORM'06 - Proceedings of the Workshop on Image Registration in Deformable Environments

    Get PDF
    Preface These are the proceedings of DEFORM'06, the Workshop on Image Registration in Deformable Environments, associated to BMVC'06, the 17th British Machine Vision Conference, held in Edinburgh, UK, in September 2006. The goal of DEFORM'06 was to bring together people from different domains having interests in deformable image registration. In response to our Call for Papers, we received 17 submissions and selected 8 for oral presentation at the workshop. In addition to the regular papers, Andrew Fitzgibbon from Microsoft Research Cambridge gave an invited talk at the workshop. The conference website including online proceedings remains open, see http://comsee.univ-bpclermont.fr/events/DEFORM06. We would like to thank the BMVC'06 co-chairs, Mike Chantler, Manuel Trucco and especially Bob Fisher for is great help in the local arrangements, Andrew Fitzgibbon, and the Programme Committee members who provided insightful reviews of the submitted papers. Special thanks go to Marc Richetin, head of the CNRS Research Federation TIMS, which sponsored the workshop. August 2006 Adrien Bartoli Nassir Navab Vincent Lepeti

    Indirect Image Registration with Large Diffeomorphic Deformations

    Full text link
    The paper adapts the large deformation diffeomorphic metric mapping framework for image registration to the indirect setting where a template is registered against a target that is given through indirect noisy observations. The registration uses diffeomorphisms that transform the template through a (group) action. These diffeomorphisms are generated by solving a flow equation that is defined by a velocity field with certain regularity. The theoretical analysis includes a proof that indirect image registration has solutions (existence) that are stable and that converge as the data error tends so zero, so it becomes a well-defined regularization method. The paper concludes with examples of indirect image registration in 2D tomography with very sparse and/or highly noisy data.Comment: 43 pages, 4 figures, 1 table; revise

    A non-rigid registration approach for quantifying myocardial contraction in tagged MRI using generalized information measures.

    Get PDF
    International audienceWe address the problem of quantitatively assessing myocardial function from tagged MRI sequences. We develop a two-step method comprising (i) a motion estimation step using a novel variational non-rigid registration technique based on generalized information measures, and (ii) a measurement step, yielding local and segmental deformation parameters over the whole myocardium. Experiments on healthy and pathological data demonstrate that this method delivers, within a reasonable computation time and in a fully unsupervised way, reliable measurements for normal subjects and quantitative pathology-specific information. Beyond cardiac MRI, this work redefines the foundations of variational non-rigid registration for information-theoretic similarity criteria with potential interest in multimodal medical imaging

    Local Mismatch Location and Spatial Scale Detection in Image Registration

    Full text link
    Image registration is now a well understood problem and several techniques using a combination of cost functions, transformation models and optimizers have been reported in medical imaging literature. Parametric methods often rely on the efficient placement of control points in the images, that is, depending on the location and scale at which images are mismatched. Poor choice of parameterization results in deformations not being modeled accurately or over parameterization, where control points may lie in homogeneous regions with low sensitivity to cost. This lowers computational efficiency due to the high complexity of the search space and might also provide transformations that are not physically meaningful, and possibly folded. Adaptive methods that parameterize based on mismatch in images have been proposed. In such methods, the cost measure must be normalized, heuristics such as how many points to pick, resolution of the grids, choosing gradient thresholds and when to refine scale would have to be ascertained in addition to the limitation of working only at a few discrete scales. In this paper we identify mismatch by searching the entire image and a wide range of smooth spatial scales. The mismatch vector, containing location and scale of mismatch is computed from peaks in the local joint entropy. Results show that this method can be used to quickly and effectively locate mismatched regions in images where control points can be placed in preference to other regions speeding up registration.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/85931/1/Fessler223.pd
    corecore