787 research outputs found

    Segmentation of medical images under topological constraints

    Get PDF
    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, February 2006.Includes bibliographical references (p. 135-142).Major advances in the field of medical imaging over the past two decades have provided physicians with powerful, non-invasive techniques to probe the structure, function, and pathology of the human body. This increasingly vast and detailed amount of information constitutes a great challenge for the medical imaging community, and requires significant innovations in all aspect of image processing. To achieve accurate and topologically-correct delineations of anatomical structures from medical images is a critical step for many clinical and research applications. In this thesis, we extend the theoretical tools applicable to the segmentation of images under topological control, apply these new concepts to broaden the class of segmentation methodologies, and develop generally applicable and well-founded algorithms to achieve accurate segmentations of medical images under topological constraints. First, we introduce a digital concept that offers more flexibility in controlling the topology of digital segmentations. Second, we design a level set framework that offers a subtle control over the topology of the level set components. Our method constitutes a trade-off between traditional level sets and topology-preserving level sets.(cont.) Third, we develop an algorithm for the retrospective topology correction of 3D digital segmentations. Our method is nested in the theory of Bayesian parameter estimation, and integrates statistical information into the topology correction process. In addition, no assumption is made on the topology of the initial input images. Finally, we propose a genetic algorithm to accurately correct the spherical topology of cortical surfaces. Unlike existing approaches, our method is able to generate several potential topological corrections and to select the maximum-a-posteriori retessellation in a Bayesian framework. Our approach integrates statistical, geometrical, and shape information into the correction process, providing optimal solutions relatively to the MRI intensity profile and the expected curvature.by Florent Ségonne.Ph.D

    The whole mesh deformation model: A fast image segmentation method suitable for effective parallelization

    No full text
    In this article, we propose a novel image segmentation method called the whole mesh deformation (WMD) model, which aims at addressing the problems of modern medical imaging. Such problems have raised from the combination of several factors: (1) significant growth of medical image volumes sizes due to increasing capabilities of medical acquisition devices; (2) the will to increase the complexity of image processing algorithms in order to explore new functionality; (3) change in processor development and turn towards multi processing units instead of growing bus speeds and the number of operations per second of a single processing unit. Our solution is based on the concept of deformable models and is characterized by a very effective and precise segmentation capability. The proposed WMD model uses a volumetric mesh instead of a contour or a surface to represent the segmented shapes of interest, which allows exploiting more information in the image and obtaining results in shorter times, independently of image contents. The model also offers a good ability for topology changes and allows effective parallelization of workflow, which makes it a very good choice for large datasets. We present a precise model description, followed by experiments on artificial images and real medical data

    Combining Topological Maps, Multi-Label Simple Points, and Minimum-Length Polygons for Efficient Digital Partition Model

    Get PDF
    International audienceDeformable models have shown great potential for image segmentation. They include discrete models whose combinatorial formulation leads to efficient and sometimes optimal minimization algorithms. In this paper, we propose a new discrete framework to deform any partition while preserving its topology. We show how to combine the use of multi-label simple points, topological maps and minimum-length polygons in order to implement an efficient digital deformable partition model. Our experimental results illustrate the potential of our framework for segmenting images, since it allows the mixing of region-based, contour-based and regularization energies, while keeping the overall image structure

    Segmentation and Restoration of Images on Surfaces by Parametric Active Contours with Topology Changes

    Full text link
    In this article, a new method for segmentation and restoration of images on two-dimensional surfaces is given. Active contour models for image segmentation are extended to images on surfaces. The evolving curves on the surfaces are mathematically described using a parametric approach. For image restoration, a diffusion equation with Neumann boundary conditions is solved in a postprocessing step in the individual regions. Numerical schemes are presented which allow to efficiently compute segmentations and denoised versions of images on surfaces. Also topology changes of the evolving curves are detected and performed using a fast sub-routine. Finally, several experiments are presented where the developed methods are applied on different artificial and real images defined on different surfaces

    Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree

    Get PDF
    The contour tree is an abstraction of a scalar field that encodes the nesting relationships of isosurfaces. We show how to use the contour tree to represent individual contours of a scalar field, how to simplify both the contour tree and the topology of the scalar field, how to compute and store geometric properties for all possible contours in the contour tree, and how to use the simplified contour tree as an interface for exploratory visualization

    Guided Medical Data Segmentation Using Structure-Aligned Planar Contours

    Get PDF
    Segmentation of 3D/4D biological images is a critical step for a wide range of applications such as treatment planning, quantitative analysis, virtual simulations, and rendering visualizations. Automatic segmentation methods are becoming more reliable, but many experts still rely on manual intervention which makes segmentation a time and resource intensive bottleneck. Marking boundary contours in 3D images can be difficult when images are often noisy or the delineation of biological tissue is unclear. Non-parallel contours can be more accurate and reduce the amount of marking necessary, but require extra effort to ensure boundary consistency and maintain spatial orientation. This dissertation focuses three problems that pertain to drawing non-parallel contour networks and generating a segmentation surface from those networks. First a guided structure-aligned segmentation system is detailed that utilizes prior structure knowledge from past segmentations of similar data. It employs a contouring protocol to aid in navigating the volume data and support using arbitrarily-oriented contouring planes placed to capture or follow the global structure shape. A user study is provided to test how well novices perform segmentation using this system. The following two problems then aim to improve different aspects of this system. A new deformation approach to reconstruction is discussed which deforms previous segmentation meshes to fit protocol drawn contours from new data instances in order to obtain accurate segmentations that have the correct topology and general shape and preserves fine details. The focus is on the problem of finding a correspondence between a mesh and a set of contours describing a similar shape. And finally, a new robust algorithm that resolves inconsistencies in contour networks is detailed. Inconsistent contours are faster and less demanding to draw, and they allow the segmenter to focus on drawing boundaries and not maintaining consistency. However, inconsistency is detrimental to most reconstruction algorithms, so the network must be fixed as a post process after drawing
    • …
    corecore