Area and Length Minimizing Flows for Shape Segmentation

©1997 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or distribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.Presented at the 1997 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, June 17-19, 1997, San Juan, Puerto Rico.DOI: 10.1109/CVPR.1997.609390Several active contour models have been proposed to unify the curve evolution framework with classical energy minimization techniques for segmentation, such as snakes. The essential idea is to evolve a curve (in 20) or a surface (in 30) under constraints from image forces so that it clings to features of interest in an intensity image. Recently the evolution equation has. been derived from first principles as the gradient flow that minimizes a modified length functional, tailored io features such as edges. However, because the flow may be slow to converge in practice, a constant (hyperbolic) term is added to keep the curve/surface moving in the desired direction. In this paper, we provide a justification for this term based on the gradient flow derived from a weighted area functional, with image dependent weighting factor. When combined with the earlier modified length gradient flow we obtain a pde which offers a number of advantages, as illustrated by several examples of shape segmentation on medical images. In many cases the weighted area flow may be used on its own, with significant computational savings

Area and length minimizing flows for shape segmentation.

Abstrac

An adaptive speed term based on homogeneity for level-set segmentation

We tested on an edge map computed from a local homogeneity measurement, which is a potential replacement for the traditional gradient-based edge map in level-set segmentation. In existing level-set methods, the gradient information is used as a stopping criteria for curve evolution, and also provides the attracting force to the zero level-set from the target boundary. However, in a discrete implementation, the gradient-based term can never fully stop the level-set evolution even for ideal edges, leakage is often unavoidable. Also the effective distance of the attracting force and blurring of edges become a trade-off in choosing the shape and support of the smoothing filter. The proposed homogeneity measurement provides easier and more robust edge estimation, and the possibility of fully stopping the level-set evolution. The homogeneity term decreasing from a homogenous region to the boundary, which dramatically increases the effective distance of the attracting force and also provides additional measurement of the overall approximation to the target boundary. Therefore, it provides a reliable criteria of adaptively changing the advent speed. By using this term, the leakage problem was avoided effectively in most cases compared to traditional level-set methods. The computation of the homogeneity is fast and its extension to the 3D case is straightforward

Application of active contours with expert knowledge to heart ventricle segmentation

Automatic heart ventricle segmentation in CT heart images can be an element of system supporting pulmonary embolism diagnosis. To solve that problem in this paper an application of two classical active contour models, snakes and geometric active contours, is proposed. The prepared implementation uses the unified model of those techniques which allows to define forces acting upon a contour only once. The nature of the images causes that the process of force construction requires additional expert knowledge since using only the information visible in the image satisfactory results cannot be obtained

Unsupervised Texture Segmentation Using Active Contour Model and Oscillating Information

Textures often occur in real-world images and may cause considerable difficulties in image segmentation. In order to segment texture images, we propose a new segmentation model that combines image decomposition model and active contour model. The former model is capable of decomposing structural and oscillating components separately from texture image, and the latter model can be used to provide smooth segmentation contour. In detail, we just replace the data term of piecewise constant/smooth approximation in CCV (convex Chan-Vese) model with that of image decomposition model-VO (Vese-Osher). Therefore, our proposed model can estimate both structural and oscillating components of texture images as well as segment textures simultaneously. In addition, we design fast Split-Bregman algorithm for our proposed model. Finally, the performance of our method is demonstrated by segmenting some synthetic and real texture images

Computer analysis of objects’ movement in image sequences: methods and applications

Computer analysis of objects’ movement in image sequences is a very complex problem, considering that it usually involves tasks for automatic detection, matching, tracking, motion analysis and deformation estimation. In spite of its complexity, this computational analysis has a wide range of important applications; for instance, in surveillance systems, clinical analysis of human gait, objects recognition, pose estimation and deformation analysis. Due to the extent of the purposes, several difficulties arise, such as the simultaneous tracking of manifold objects, their possible temporary occlusion or definitive disappearance from the image scene, changes of the viewpoints considered in images acquisition or of the illumination conditions, or even nonrigid deformations that objects may suffer in image sequences. In this paper, we present an overview of several methods that may be considered to analyze objects’ movement; namely, for their segmentation, tracking and matching in images, and for estimation of the deformation involved between images.This paper was partially done in the scope of project “Segmentation, Tracking and Motion Analysis of Deformable (2D/3D) Objects using Physical Principles”, with reference POSC/EEA-SRI/55386/2004, financially supported by FCT -Fundação para a Ciência e a Tecnologia from Portugal. The fourth, fifth and seventh authors would like to thank also the support of their PhD grants from FCT with references SFRH/BD/29012/2006, SFRH/BD/28817/2006 and SFRH/BD/12834/2003, respectively

A review of algorithms for medical image segmentation and their applications to the female pelvic cavity

This paper aims to make a review on the current segmentation algorithms used for medical images. Algorithms are classified according to their principal methodologies, namely the ones based on thresholds, the ones based on clustering techniques and the ones based on deformable models. The last type is focused on due to the intensive investigations into the deformable models that have been done in the last few decades. Typical algorithms of each type are discussed and the main ideas, application fields, advantages and disadvantages of each type are summarised. Experiments that apply these algorithms to segment the organs and tissues of the female pelvic cavity are presented to further illustrate their distinct characteristics. In the end, the main guidelines that should be considered for designing the segmentation algorithms of the pelvic cavity are proposed