Medical Image Segmentation by Water Flow

We present a new image segmentation technique based on the paradigm of water flow and apply it to medical images. The force field analogy is used to implement the major water flow attributes like water pressure, surface tension and adhesion so that the model achieves topological adaptability and geometrical flexibility. A new snake-like force functional combining edge- and region-based forces is introduced to produce capability for both range and accuracy. The method has been assessed qualitatively and quantitatively, and shows decent detection performance as well as ability to handle noise

An Interactive Algorithm for Image Smoothing and Segmentation

This work introduces an interactive algorithm for image smoothing and segmentation. A non-linear partial differential equation is employed to smooth the image while preserving contours. The segmentation is a region-growing and merging process initiated around image minima (seeds), which are automatically detected, labeled and eventually merged. The user places one marker per region of interest. Accurate and fast segmentation results can be achieved for gray and color images using this simple method

Two and three dimensional segmentation of multimodal imagery

The role of segmentation in the realms of image understanding/analysis, computer vision, pattern recognition, remote sensing and medical imaging in recent years has been significantly augmented due to accelerated scientific advances made in the acquisition of image data. This low-level analysis protocol is critical to numerous applications, with the primary goal of expediting and improving the effectiveness of subsequent high-level operations by providing a condensed and pertinent representation of image information. In this research, we propose a novel unsupervised segmentation framework for facilitating meaningful segregation of 2-D/3-D image data across multiple modalities (color, remote-sensing and biomedical imaging) into non-overlapping partitions using several spatial-spectral attributes. Initially, our framework exploits the information obtained from detecting edges inherent in the data. To this effect, by using a vector gradient detection technique, pixels without edges are grouped and individually labeled to partition some initial portion of the input image content. Pixels that contain higher gradient densities are included by the dynamic generation of segments as the algorithm progresses to generate an initial region map. Subsequently, texture modeling is performed and the obtained gradient, texture and intensity information along with the aforementioned initial partition map are used to perform a multivariate refinement procedure, to fuse groups with similar characteristics yielding the final output segmentation. Experimental results obtained in comparison to published/state-of the-art segmentation techniques for color as well as multi/hyperspectral imagery, demonstrate the advantages of the proposed method. Furthermore, for the purpose of achieving improved computational efficiency we propose an extension of the aforestated methodology in a multi-resolution framework, demonstrated on color images. Finally, this research also encompasses a 3-D extension of the aforementioned algorithm demonstrated on medical (Magnetic Resonance Imaging / Computed Tomography) volumes

Automated Hierarchical Image Segmentation Based on Merging of Quadrilaterals

Proceedings of the 6th WSEAS International Conference on Signal Processing, Computational Geometry & Artifical Vision, 2006, p. 135-140This paper proposes a quadrilateral-based and automated hierarchical segmentation method, in which quadrilaterals are first constructed from an edge map, where neighboring quadrilaterals with similar features of interest are then merged together in a hierarchical mode to form regions. When evaluated qualitatively and quantitatively, the proposed method outperforms three traditional and commonly-used techniques, namely, K-means clustering, seeded region growing and quadrilateral-based segmentation. It is shown by experimental results that our proposed method is robust in both recovering missed important regions while preventing unnecessary over-segmentation, and offers an efficient description of the segmented objects conducive to content-based applications.postprintThe 6th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial Vision (ISCGAV'06), Crete, Greece, August 2006. in Conference Proceedings, 2006, p. 135-14

Automated segmentation of tissue images for computerized IHC analysis

This paper presents two automated methods for the segmentation ofimmunohistochemical tissue images that overcome the limitations of themanual approach aswell as of the existing computerized techniques. The first independent method, based on unsupervised color clustering, recognizes automatically the target cancerous areas in the specimen and disregards the stroma; the second method, based on colors separation and morphological processing, exploits automated segmentation of the nuclear membranes of the cancerous cells. Extensive experimental results on real tissue images demonstrate the accuracy of our techniques compared to manual segmentations; additional experiments show that our techniques are more effective in immunohistochemical images than popular approaches based on supervised learning or active contours. The proposed procedure can be exploited for any applications that require tissues and cells exploration and to perform reliable and standardized measures of the activity of specific proteins involved in multi-factorial genetic pathologie

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

Hierarchical Image Segmentation using The Watershed Algorithim with A Streaming Implementation

We have implemented a graphical user interface (GUI) based semi-automatic hierarchical segmentation scheme, which works in three stages. In the first stage, we process the original image by filtering and threshold the gradient to reduce the level of noise. In the second stage, we compute the watershed segmentation of the image using the rainfalling simulation approach. In the third stage, we apply two region merging schemes, namely implicit region merging and seeded region merging, to the result of the watershed algorithm. Both the region merging schemes are based on the watershed depth of regions and serve to reduce the over segmentation produced by the watershed algorithm. Implicit region merging automatically produces a hierarchy of regions. In seeded region merging, a selected seed region can be grown from the watershed result, producing a hierarchy. A meaningful segmentation can be simply chosen from the hierarchy produced. We have also proposed and tested a streaming algorithm based on the watershed algorithm, which computes the segmentation of an image without iterative processing of adjacent blocks. We have proved that the streaming algorithm produces the same result as the serial watershed algorithm. We have also discussed the extensibility of the streaming algorithm to efficient parallel implementations