Automated segmentation of brain MR images

A simple, robust and efficient image segmentation algorithm for classifying brain tissues from dual echo Magnetic Resonance (MR) images is presented. The algorithm consists of a sequence of adaptive histogram analysis, morphological operations and knowledge based rules to accurately classify various regions such as the brain matter and the cerebrospinal fluid, and detect if there are any abnormal regions. It can be completely automated and has been tested on over hundred images from several patient studies. Experimental results are provided.     

Minimising retinal vessel artefacts in optical coherence tomography images

Optical coherence tomography (OCT) is commonly used to investigate the layers of the retina including retinal nerve fiber layer (RNFL) and retinal pigment epithelium (RPE). OCT images are altered by vessels on the retinal surface producing artefacts. We propose a new approach to compensate for these artefacts and enhance quality of OCT images. A total of 28 (20 normal and 8 glaucoma subjects) OCT images were obtained using Spectralis (Heidelberg, Germany). Shadows were detected along the image and compensated by the A-Scan intensity difference from surrounding non-affected areas. Images were then segmented and the area and thickness of RNFL and RPE were measured and compared. 10 subjects were tested twice to determine the effect of this on reproducibility of measurements. Shadow-suppressed images reflected the profile of the retinal layers more closely when assessed qualitatively, minimising distortion. The segmentation of RNFL and RPE thickness demonstrated a mean change of 2.4% ± 1 and 6% ± 1 from the original images. Much larger changes were observed in areas with vessels. Reproducibility of RNFL thickness was improved, specifically in the higher density vessel location, i.e. inferior and superior. Therefore, OCT images can be enhanced by an image processing procedure. Vessel artefacts may cause errors in assessment of RNFL thickness and are a source of variability, which has clinical implications for diseases such as glaucoma where subtle changes in RNFL need to be monitored accurately over time.     

Ant Colony Optimization-based method for optic cup segmentation in retinal images

An accurate detection of the cup region in retinal images is necessary to obtain relevant measurements for glaucoma detection. In this work, we present an Ant Colony Optimization-based method for optic cup segmentation in retinal fundus images. The artificial agents will construct their solutions influenced by a heuristic that combines the intensity gradient of the optic disc area and the curvature of the vessels. On their own, the exploration capabilities of the agents are limited; however, by sharing the experience of the entire colony, they are capable of obtaining accurate cup segmentations, even in images with a weak or non-obvious pallor. This method has been tested with the RIM-ONE dataset, yielding an average overlapping error of 24.3% of the cup segmentation and an area under the curve (AUC) of 0.7957 using the cup to disc ratio for glaucoma assessment.     

A reinforcement agent for object segmentation in ultrasound images

The principal contribution of this work is to design a general framework for an intelligent system to extract one object of interest from ultrasound images. This system is based on reinforcement learning. The input image is divided into several sub-images, and the proposed system finds the appropriate local values for each of them so that it can extract the object of interest. The agent uses some images and their ground-truth (manually segmented) version to learn from. A reward function is employed to measure the similarities between the output and the manually segmented images, and to provide feedback to the agent. The information obtained can be used as valuable knowledge stored in the Q-matrix. The agent can then use this knowledge for new input images. The experimental results for prostate segmentation in trans-rectal ultrasound images show high potential of this approach in the field of ultrasound image segmentation.     

Automated segmentation and quantitative analysis of optic disc and fovea in fundus images

Multimedia Tools and Applications - Fundus image is widely used diagnosis method and involves the retinal tissues which can be important biomarkers for diagnosing diseases. Many studies have...     

A review of atlas-based segmentation for magnetic resonance brain images

Normal and abnormal brains can be segmented by registering the target image with an atlas. Here, an atlas is defined as the combination of an intensity image (template) and its segmented image (the atlas labels). After registering the atlas template and the target image, the atlas labels are propagated to the target image. We define this process as atlas-based segmentation. In recent years, researchers have investigated registration algorithms to match atlases to query subjects and also strategies for atlas construction. In this paper we present a review of the automated approaches for atlas-based segmentation of magnetic resonance brain images. We aim to point out the strengths and weaknesses of atlas-based methods and suggest new research directions. We use two different criteria to present the methods. First, we refer to the algorithms according to their atlas-based strategy: label propagation, multi-atlas methods, and probabilistic techniques. Subsequently, we classify the methods according to their medical target: the brain and its internal structures, tissue segmentation in healthy subjects, tissue segmentation in fetus, neonates and elderly subjects, and segmentation of damaged brains. A quantitative comparison of the results reported in the literature is also presented.     

非接触指纹图像分割与增强方法的研究

非接触指纹图像的背景区域比接触式的相对复杂,且脊、谷线的对比度也比较低,用一般的接触式指纹图像处理方法很难达到很好的处理效果。本文针对非接触指纹图像的这两个特点提出了合理的分割与增强方法。采用基于照明-反射模型的同态滤波思想进行指纹图像与背景区域的分割。在对指纹图像增强时首先采用相干滤波技术进行滤波增强,再用简化的Gabor函数模板进行二次增强。实验结果表明,本文提出的方法在一定条件下能够很好的实现指纹图像的背景分割,同时本文方法的增强效果相比于以往的也有了明显的提高。     

A semi-automatic system for segmentation of cardiac M-mode images

Pixel classifiers are often adopted in pattern recognition as a suitable method for image segmentation. A common approach to the performance evaluation of classifier systems is based on the measurement of the classification errors and, at the same time, on the computational time. In general, multiclassifiers have proven to be more precise in the classification in many applications, but at the cost of a higher computational load. This paper analyzes different classifiers and proposes an evaluation of the classifiers in the case of semi-automatic processes with human interaction. Medical imaging is a typical application, where automatic or semi-automatic segmentation can be a valuable support to the diagnosis. The paper focuses on the segmentation of cardiac images of fruit flies (genetic model for analyzing human heart’s diseases). Analysis is based on M-modes, that are gray-level images derived from mono-dimensional projections of the video frames on a line. Segmentation of the M-mode images is provided by classifiers and integrated in a multiclassifier. A neural network classifier, a Bayesian classifier, and a classifier based on hidden Markov chains are joined by means of a Behavior Knowledge Space fusion rule. The comparative evaluation is discussed in terms of both accuracy and required time, in which the time to correct the classifier errors by means of human intervention is also taken into account.

A comparative evaluation of interactive segmentation algorithms

In this paper we present a comparative evaluation of four popular interactive segmentation algorithms. The evaluation was carried out as a series of user-experiments, in which participants were tasked with extracting 100 objects from a common dataset: 25 with each algorithm, constrained within a time limit of 2 min for each object. To facilitate the experiments, a “scribble-driven” segmentation tool was developed to enable interactive image segmentation by simply marking areas of foreground and background with the mouse. As the participants refined and improved their respective segmentations, the corresponding updated segmentation mask was stored along with the elapsed time. We then collected and evaluated each recorded mask against a manually segmented ground truth, thus allowing us to gauge segmentation accuracy over time. Two benchmarks were used for the evaluation: the well-known Jaccard index for measuring object accuracy, and a new fuzzy metric, proposed in this paper, designed for measuring boundary accuracy. Analysis of the experimental results demonstrates the effectiveness of the suggested measures and provides valuable insights into the performance and characteristics of the evaluated algorithms.     

Adaptive segmentation of noisy and textured images

An image segmentation algorithm is described which is based on the integration of signal model parameter estimates and maximum a posteriori labelling. The parameter estimation is based on either a maximum likelihood-based method for a quadric signal model or a maximum pseudo-likelihood based method for a Gauss-Markov signal model. The first case is applicable to standard grey-level image segmentation as well as segmentation of shaded 3D surfaces, while the second case is applicable to texture segmentation. A key aspect of the algorithm is the incorporation of a coarse to fine processing strategy which limits the search for the optimum labelling at any one resolution to a subset of labellings which are consistent with the optimum labelling at the previous coarser resolution. Consistency is in terms of a prior label model which specifies the conditional probability of a given label in terms of the labelling at the previous level of resolution. It is shown how such an approach leads to a simple relaxation procedure based on local pyramid node computations. An extension of the algorithm is also described which performs accurate inter-region boundary placement using a step-wise refinement procedure based on a simple adaptive filter. The problem of automatic determination of the number of regions is also addressed. It is shown how a simple agglomerative clustering idea, again based on pyramid node computations, can effectively solve this problem.