Boundary detection in medical images using edge following algorithm based on intensity gradient and texture gradient features

Finding the correct boundary in noisy images is still a difficult task. This paper introduces a new edge following technique for boundary detection in noisy images. Utilization of the proposed technique is exhibited via its application to various types of medical images. Our proposed technique can detect the boundaries of objects in noisy images using the information from the intensity gradient via the vector image model and the texture gradient via the edge map. The performance and robustness of the technique have been tested to segment objects in synthetic noisy images and medical images including prostates in ultrasound images, left ventricles in cardiac magnetic resonance (MR) images, aortas in cardiovascular MR images, and knee joints in computerized tomography images. We compare the proposed segmentation technique with the active contour models (ACM), geodesic active contour models, active contours without edges, gradient vector flow snake models, and ACMs based on vector field convolution, by using the skilled doctors' opinions as the ground truths. The results show that our technique performs very well and yields better performance than the classical contour models. The proposed method is robust and applicable on various kinds of noisy images without prior knowledge of noise properties.     

Image segmentation using active contours driven by the Bhattacharyya gradient flow.

This paper addresses the problem of image segmentation by means of active contours, whose evolution is driven by the gradient flow derived from an energy functional that is based on the Bhattacharyya distance. In particular, given the values of a photometric variable (or of a set thereof), which is to be used for classifying the image pixels, the active contours are designed to converge to the shape that results in maximal discrepancy between the empirical distributions of the photometric variable inside and outside of the contours. The above discrepancy is measured by means of the Bhattacharyya distance that proves to be an extremely useful tool for solving the problem at hand. The proposed methodology can be viewed as a generalization of the segmentation methods, in which active contours maximize the difference between a finite number of empirical moments of the "inside" and "outside" distributions. Furthermore, it is shown that the proposed methodology is very versatile and flexible in the sense that it allows one to easily accommodate a diversity of the image features based on which the segmentation should be performed. As an additional contribution, a method for automatically adjusting the smoothness properties of the empirical distributions is proposed. Such a procedure is crucial in situations when the number of data samples (supporting a certain segmentation class) varies considerably in the course of the evolution of the active contour. In this case, the smoothness properties of the empirical distributions have to be properly adjusted to avoid either over- or underestimation artifacts. Finally, a number of relevant segmentation results are demonstrated and some further research directions are discussed.     

Robust real-time segmentation of images and videos using a smooth-spline snake-based algorithm.

This paper deals with fast image and video segmentation using active contours. Region-based active contours using level sets are powerful techniques for video segmentation, but they suffer from large computational cost. A parametric active contour method based on B-Spline interpolation has been proposed in to highly reduce the computational cost, but this method is sensitive to noise. Here, we choose to relax the rigid interpolation constraint in order to robustify our method in the presence of noise: by using smoothing splines, we trade a tunable amount of interpolation error for a smoother spline curve. We show by experiments on natural sequences that this new flexibility yields segmentation results of higher quality at no additional computational cost. Hence, real-time processing for moving objects segmentation is preserved.     

Curve evolution implementation of the Mumford-Shah functional forimage segmentation, denoising, interpolation, and magnification

We first address the problem of simultaneous image segmentation and smoothing by approaching the Mumford-Shah (1989) paradigm from a curve evolution perspective. In particular, we let a set of deformable contours define the boundaries between regions in an image where we model the data via piecewise smooth functions and employ a gradient flow to evolve these contours. Each gradient step involves solving an optimal estimation problem for the data within each region, connecting curve evolution and the Mumford-Shah functional with the theory of boundary-value stochastic processes. The resulting active contour model offers a tractable implementation of the original Mumford-Shah model (i.e., without resorting to elliptic approximations which have traditionally been favored for greater ease in implementation) to simultaneously segment and smoothly reconstruct the data within a given image in a coupled manner. Various implementations of this algorithm are introduced to increase its speed of convergence. We also outline a hierarchical implementation of this algorithm to handle important image features such as triple points and other multiple junctions. Next, by generalizing the data fidelity term of the original Mumford-Shah functional to incorporate a spatially varying penalty, we extend our method to problems in which data quality varies across the image and to images in which sets of pixel measurements are missing. This more general model leads us to a novel PDE-based approach for simultaneous image magnification, segmentation, and smoothing, thereby extending the traditional applications of the Mumford-Shah functional which only considers simultaneous segmentation and smoothing.     

An integrated region-, boundary-, shape-based active contour for multiple object overlap resolution in histological imagery

Active contours and active shape models (ASM) have been widely employed in image segmentation. A major limitation of active contours, however, is in their 1) inability to resolve boundaries of intersecting objects and to 2) handle occlusion. Multiple overlapping objects are typically segmented out as a single object. On the other hand, ASMs are limited by point correspondence issues since object landmarks need to be identified across multiple objects for initial object alignment. ASMs are also are constrained in that they can usually only segment a single object in an image. In this paper, we present a novel synergistic boundary and region-based active contour model that incorporates shape priors in a level set formulation with automated initialization based on watershed. We demonstrate an application of these synergistic active contour models using multiple level sets to segment nuclear and glandular structures on digitized histopathology images of breast and prostate biopsy specimens. Unlike previous related approaches, our model is able to resolve object overlap and separate occluded boundaries of multiple objects simultaneously. The energy functional of the active contour is comprised of three terms. The first term is the prior shape term, modeled on the object of interest, thereby constraining the deformation achievable by the active contour. The second term, a boundary-based term detects object boundaries from image gradients. The third term drives the shape prior and the contour towards the object boundary based on region statistics. The results of qualitative and quantitative evaluation on 100 prostate and 14 breast cancer histology images for the task of detecting and segmenting nuclei and lymphocytes reveals that the model easily outperforms two state of the art segmentation schemes (geodesic active contour and Rousson shape-based model) and on average is able to resolve up to 91% of overlapping/occluded structures in the images.     

An Active Contour Algorithm for Continuous-Time Cellular Neural Networks

A CNN-based algorithm for image segmentation by active contours is proposed here. The algorithm is based on an iterative process of expansion of the contour and its subsequent thinning guided by external and internal energy. The proposed strategy allows for a high level of control over contour evolution making their topologic transformations easier. Therefore processing of multiple contours for segmenting several objects can be carried out simultaneously.     

Integrating local distribution information with level set for boundary extraction

This paper presents a general object boundary extraction model for piecewise smooth images, which incorporates local intensity distribution information into an edge-based implicit active contour. Unlike traditional edge-based active contours that use gradient to detect edges, our model derives the neighborhood distribution and edge information with two different region-based operators: a Gaussian mixture model (GMM)-based intensity distribution estimator and the Hueckel operator. We propose the local distribution fitting model for more accurate segmentation, which incorporates the operator outcomes into the recent local binary fitting (LBF) model. The GMM and the Hueckel model parameters are estimated before contour evolution, which enables the use of the proposed model without the need for initial contour selection, i.e., the level set function is initialized with a random constant instead of a distance map. Thus our model essentially alleviates the initialization sensitivity problem of most active contours. Experiments on synthetic and real images show the improved performance of our approach over the LBF model.     

Multiple contour extraction from graylevel images using an artificial neural network.

For active contour modeling (ACM), we propose a novel self-organizing map (SOM)-based approach, called the batch-SOM (BSOM), that attempts to integrate the advantages of SOM- and snake-based ACMs in order to extract the desired contours from images. We employ feature points, in the form of an edge-map (as obtained from a standard edge-detection operation), to guide the contour (as in the case of SOM-based ACMs) along with the gradient and intensity variations in a local region to ensure that the contour does not "leak" into the object boundary in case of faulty feature points (weak or broken edges). In contrast with the snake-based ACMs, however, we do not use an explicit energy functional (based on gradient or intensity) for controlling the contour movement. We extend the BSOM to handle extraction of contours of multiple objects, by splitting a single contour into as many subcontours as the objects in the image. The BSOM and its extended version are tested on synthetic binary and gray-level images with both single and multiple objects. We also demonstrate the efficacy of the BSOM on images of objects having both convex and nonconvex boundaries. The results demonstrate the superiority of the BSOM over others. Finally, we analyze the limitations of the BSOM.     

基于C-V模型的红外图像自动分割方法研究

为解决红外图像分割中背景噪声及边界轮廓的影响,引入了基于曲线演化理论、水平集方法和M-S分割函数的C-V模型。通过将图像表达为分段常量函数来建立适当的能量函数模型,引入水平集的表示方法,在整个图像域中依据最小化分割寻找全局极小值,可令活动轮廓最终到达目标边缘。由MATLAB实现的仿真结果表明采用C-V模型对红外图像进行自动分割不受边界轮廓线连续性限制,对初始轮廓线位置不敏感,对图像噪声具有很强的鲁棒性,对均匀灰度目标分割效果良好。     

Robust contour tracking based on a coupling between geodesic active contours and conditional random fields

This paper presents a new general framework for contour tracking based on the synergy of two powerful segmentation tools, namely, spatial temporal conditional random fields (CRFs) and geodesic active contours (GACs). The contours of targets are modeled using a level set representation. The evolution of the level sets toward the target contours is formulated as one of the joint region-based (CRF) and boundary-based (GAC) segmentations under a unified Bayesian framework. A variational inference technique is used to solve this otherwise intractable inference problem, leading to approximate MAP solutions of both the new 3D spatial temporal CRF and the GAC model. The tracking result of the previous frame is used to initialize the curve in the current frame. Typical contour tracking problems are considered and experimental results are given to illustrate the robustness of the method against noise and its accurate performance in moving objects boundary localization.