Improving the accuracy of volumetric segmentation using pre-processing boundary detection and image reconstruction

Convex-relaxed kernel mapping for image segmentation

This paper investigates a convex-relaxed kernel mapping formulation of image segmentation. We optimize, under some partition constraints, a functional containing two characteristic terms: 1) a data term, which maps the observation space to a higher (possibly infinite) dimensional feature space via a kernel function, thereby evaluating nonlinear distances between the observations and segments parameters and 2) a total-variation term, which favors smooth segment surfaces (or boundaries). The algorithm iterates two steps: 1) a convex-relaxation optimization with respect to the segments by solving an equivalent constrained problem via the augmented Lagrange multiplier method and 2) a convergent fixed-point optimization with respect to the segments parameters. The proposed algorithm can bear with a variety of image types without the need for complex and application-specific statistical modeling, while having the computational benefits of convex relaxation. Our solution is amenable to parallelized implementations on graphics processing units (GPUs) and extends easily to high dimensions. We evaluated the proposed algorithm with several sets of comprehensive experiments and comparisons, including: 1) computational evaluations over 3D medical-imaging examples and high-resolution large-size color photographs, which demonstrate that a parallelized implementation of the proposed method run on a GPU can bring a significant speed-up and 2) accuracy evaluations against five state-of-the-art methods over the Berkeley color-image database and a multimodel synthetic data set, which demonstrates competitive performances of the algorithm.

Unsupervised variational image segmentation/classification using a Weibull observation model

Studies have shown that the Weibull distribution can model accurately a wide variety of images. Its parameters index a family of distributions which includes the exponential and approximations of the Gaussian and the Raleigh models widely used in image segmentation. This study investigates the Weibull distribution in unsupervised image segmentation and classification by a variational method. The data term of the segmentation functional measures the conformity of the image intensity in each region to a Weibull distribution whose parameters are determined jointly with the segmentation. Minimization of the functional is implemented by active curves via level sets and consists of iterations of two consecutive steps: curve evolution via Euler-Lagrange descent equations and evaluation of the Weibull distribution parameters. Experiments with synthetic and real images are described which verify the validity of method and its implementation.