Continuous convex relaxation methodology applied to retroperitoneal tumors

In this paper, two algorithms for the segmentation of tumors in soft tissues are presented and compared. These algorithms are applied to the segmentatiion of retroperitoneal tumors. Method: The algorithms are based on a continuous convex relaxation methodology with the introduction of an accumulated gradient distance (AGD). Algorithm 1 is based on two-label convex relaxation and Algorithm 2 applies multilabel convex relaxation. Results: Algorithms 1 and 2 are tested on a database of 6 CT volumes and their results are compared with the manual segmentation. The multilabel version performs better, achieving a 91% of sensitivity, 100% of specificity, 88% of PPV and 89% of Dice index. Conclusions: To the best of our knowledge, this is the first time that the segmentation of retroperitoneal tumors has been addressed. Two segmentation algorithms have been compared and the multilabel version obtains very good resultsJunta de Andalucía P11-TIC-7727Junta de Andalucía PT13/0006/003

A convex selective segmentation model based on a piece-wise constant metric guided edge detector function

The challenge of segmentation for noisy images, especially those that have light in their backgrounds, is still exists in many advanced state-of-the-art segmentation models. Furthermore, it is significantly difficult to segment such images. In this article, we provide a novel variational model for the simultaneous restoration and segmentation of noisy images that have intensity inhomogeneity and high contrast background illumination and light. The suggested concept combines the multi-phase segmentation technology with the statistical approach in terms of local region knowledge and details of circular regions that are, in fact, centered at every pixel to enable in-homogeneous image restoration. The suggested model is expressed as a fuzzy set and is resolved using the multiplier alternating direction minimization approach. Through several tests and numerical simulations with plausible assumptions, we have evaluated the accuracy and resilience of the proposed approach over various kinds of real and synthesized images in the existence of intensity inhomogeneity and light in the background. Additionally, the findings are contrasted with those from cutting-edge two-phase and multi-phase methods, proving the superiority of our proposed approach for images with noise, background light, and inhomogeneity

A Combinatorial Solution to Non-Rigid 3D Shape-to-Image Matching

We propose a combinatorial solution for the problem of non-rigidly matching a 3D shape to 3D image data. To this end, we model the shape as a triangular mesh and allow each triangle of this mesh to be rigidly transformed to achieve a suitable matching to the image. By penalising the distance and the relative rotation between neighbouring triangles our matching compromises between image and shape information. In this paper, we resolve two major challenges: Firstly, we address the resulting large and NP-hard combinatorial problem with a suitable graph-theoretic approach. Secondly, we propose an efficient discretisation of the unbounded 6-dimensional Lie group SE(3). To our knowledge this is the first combinatorial formulation for non-rigid 3D shape-to-image matching. In contrast to existing local (gradient descent) optimisation methods, we obtain solutions that do not require a good initialisation and that are within a bound of the optimal solution. We evaluate the proposed method on the two problems of non-rigid 3D shape-to-shape and non-rigid 3D shape-to-image registration and demonstrate that it provides promising results.Comment: 10 pages, 7 figure

Joint methods in imaging based on diffuse image representations

This thesis deals with the application and the analysis of different variants of the Mumford-Shah model in the context of image processing. In this kind of models, a given function is approximated in a piecewise smooth or piecewise constant manner. Especially the numerical treatment of the discontinuities requires additional models that are also outlined in this work. The main part of this thesis is concerned with four different topics. Simultaneous edge detection and registration of two images: The image edges are detected with the Ambrosio-Tortorelli model, an approximation of the Mumford-Shah model that approximates the discontinuity set with a phase field, and the registration is based on these edges. The registration obtained by this model is fully symmetric in the sense that the same matching is obtained if the roles of the two input images are swapped. Detection of grain boundaries from atomic scale images of metals or metal alloys: This is an image processing problem from materials science where atomic scale images are obtained either experimentally for instance by transmission electron microscopy or by numerical simulation tools. Grains are homogenous material regions whose atomic lattice orientation differs from their surroundings. Based on a Mumford-Shah type functional, the grain boundaries are modeled as the discontinuity set of the lattice orientation. In addition to the grain boundaries, the model incorporates the extraction of a global elastic deformation of the atomic lattice. Numerically, the discontinuity set is modeled by a level set function following the approach by Chan and Vese. Joint motion estimation and restoration of motion-blurred video: A variational model for joint object detection, motion estimation and deblurring of consecutive video frames is proposed. For this purpose, a new motion blur model is developed that accurately describes the blur also close to the boundary of a moving object. Here, the video is assumed to consist of an object moving in front of a static background. The segmentation into object and background is handled by a Mumford-Shah type aspect of the proposed model. Convexification of the binary Mumford-Shah segmentation model: After considering the application of Mumford-Shah type models to tackle specific image processing problems in the previous topics, the Mumford-Shah model itself is studied more closely. Inspired by the work of Nikolova, Esedoglu and Chan, a method is developed that allows global minimization of the binary Mumford-Shah segmentation model by solving a convex, unconstrained optimization problem. In an outlook, segmentation of flowfields into piecewise affine regions using this convexification method is briefly discussed