3,249 research outputs found

    A General System for Automatic Biomedical Image Segmentation Using Intensity Neighborhoods

    Get PDF
    Image segmentation is important with applications to several problems in biology and medicine. While extensively researched, generally, current segmentation methods perform adequately in the applications for which they were designed, but often require extensive modifications or calibrations before being used in a different application. We describe an approach that, with few modifications, can be used in a variety of image segmentation problems. The approach is based on a supervised learning strategy that utilizes intensity neighborhoods to assign each pixel in a test image its correct class based on training data. We describe methods for modeling rotations and variations in scales as well as a subset selection for training the classifiers. We show that the performance of our approach in tissue segmentation tasks in magnetic resonance and histopathology microscopy images, as well as nuclei segmentation from fluorescence microscopy images, is similar to or better than several algorithms specifically designed for each of these applications

    Brain Structure Segmentation from MRI by Geometric Surface Flow

    Get PDF
    We present a method for semiautomatic segmentation of brain structures such as thalamus from MRI images based on the concept of geometric surface flow. Given an MRI image, the user can interactively initialize a seed model within region of interest. The model will then start to evolve by incorporating both boundary and region information following the principle of variational analysis. The deformation will stop when an equilibrium state is achieved. To overcome the low contrast of the original image data, a nonparametric kernel-based method is applied to simultaneously update the interior probability distribution during the model evolution. Our experiments on both 2D and 3D image data demonstrate that the new method is robust to image noise and inhomogeneity and will not leak from spurious edge gaps

    LASS: a simple assignment model with Laplacian smoothing

    Full text link
    We consider the problem of learning soft assignments of NN items to KK categories given two sources of information: an item-category similarity matrix, which encourages items to be assigned to categories they are similar to (and to not be assigned to categories they are dissimilar to), and an item-item similarity matrix, which encourages similar items to have similar assignments. We propose a simple quadratic programming model that captures this intuition. We give necessary conditions for its solution to be unique, define an out-of-sample mapping, and derive a simple, effective training algorithm based on the alternating direction method of multipliers. The model predicts reasonable assignments from even a few similarity values, and can be seen as a generalization of semisupervised learning. It is particularly useful when items naturally belong to multiple categories, as for example when annotating documents with keywords or pictures with tags, with partially tagged items, or when the categories have complex interrelations (e.g. hierarchical) that are unknown.Comment: 20 pages, 4 figures. A shorter version appears in AAAI 201
    corecore