Science.gov

Sample records for adaptive image segmentation

  1. Adaptive image segmentation by quantization

    NASA Astrophysics Data System (ADS)

    Liu, Hui; Yun, David Y.

    1992-12-01

    Segmentation of images into textural homogeneous regions is a fundamental problem in an image understanding system. Most region-oriented segmentation approaches suffer from the problem of different thresholds selecting for different images. In this paper an adaptive image segmentation based on vector quantization is presented. It automatically segments images without preset thresholds. The approach contains a feature extraction module and a two-layer hierarchical clustering module, a vector quantizer (VQ) implemented by a competitive learning neural network in the first layer. A near-optimal competitive learning algorithm (NOLA) is employed to train the vector quantizer. NOLA combines the advantages of both Kohonen self- organizing feature map (KSFM) and K-means clustering algorithm. After the VQ is trained, the weights of the network and the number of input vectors clustered by each neuron form a 3- D topological feature map with separable hills aggregated by similar vectors. This overcomes the inability to visualize the geometric properties of data in a high-dimensional space for most other clustering algorithms. The second clustering algorithm operates in the feature map instead of the input set itself. Since the number of units in the feature map is much less than the number of feature vectors in the feature set, it is easy to check all peaks and find the `correct' number of clusters, also a key problem in current clustering techniques. In the experiments, we compare our algorithm with K-means clustering method on a variety of images. The results show that our algorithm achieves better performance.

  2. [An adaptive threshloding segmentation method for urinary sediment image].

    PubMed

    Li, Yongming; Zeng, Xiaoping; Qin, Jian; Han, Liang

    2009-02-01

    In this paper is proposed a new method to solve the segmentation of the complicated defocusing urinary sediment image. The main points of the method are: (1) using wavelet transforms and morphology to erase the effect of defocusing and realize the first segmentation, (2) using adaptive threshold processing in accordance to the subimages after wavelet processing, and (3) using 'peel off' algorithm to deal with the overlapped cells' segmentations. The experimental results showed that this method was not affected by the defocusing, and it made good use of many kinds of characteristics of the images. So this new mehtod can get very precise segmentation; it is effective for defocusing urinary sediment image segmentation.

  3. Adaptive geodesic transform for segmentation of vertebrae on CT images

    NASA Astrophysics Data System (ADS)

    Gaonkar, Bilwaj; Shu, Liao; Hermosillo, Gerardo; Zhan, Yiqiang

    2014-03-01

    Vertebral segmentation is a critical first step in any quantitative evaluation of vertebral pathology using CT images. This is especially challenging because bone marrow tissue has the same intensity profile as the muscle surrounding the bone. Thus simple methods such as thresholding or adaptive k-means fail to accurately segment vertebrae. While several other algorithms such as level sets may be used for segmentation any algorithm that is clinically deployable has to work in under a few seconds. To address these dual challenges we present here, a new algorithm based on the geodesic distance transform that is capable of segmenting the spinal vertebrae in under one second. To achieve this we extend the theory of the geodesic distance transforms proposed in1 to incorporate high level anatomical knowledge through adaptive weighting of image gradients. Such knowledge may be provided by the user directly or may be automatically generated by another algorithm. We incorporate information 'learnt' using a previously published machine learning algorithm2 to segment the L1 to L5 vertebrae. While we present a particular application here, the adaptive geodesic transform is a generic concept which can be applied to segmentation of other organs as well.

  4. Incorporating Adaptive Local Information Into Fuzzy Clustering for Image Segmentation.

    PubMed

    Liu, Guoying; Zhang, Yun; Wang, Aimin

    2015-11-01

    Fuzzy c-means (FCM) clustering with spatial constraints has attracted great attention in the field of image segmentation. However, most of the popular techniques fail to resolve misclassification problems due to the inaccuracy of their spatial models. This paper presents a new unsupervised FCM-based image segmentation method by paying closer attention to the selection of local information. In this method, region-level local information is incorporated into the fuzzy clustering procedure to adaptively control the range and strength of interactive pixels. First, a novel dissimilarity function is established by combining region-based and pixel-based distance functions together, in order to enhance the relationship between pixels which have similar local characteristics. Second, a novel prior probability function is developed by integrating the differences between neighboring regions into the mean template of the fuzzy membership function, which adaptively selects local spatial constraints by a tradeoff weight depending upon whether a pixel belongs to a homogeneous region or not. Through incorporating region-based information into the spatial constraints, the proposed method strengthens the interactions between pixels within the same region and prevents over smoothing across region boundaries. Experimental results over synthetic noise images, natural color images, and synthetic aperture radar images show that the proposed method achieves more accurate segmentation results, compared with five state-of-the-art image segmentation methods.

  5. Adaptive distance metric learning for diffusion tensor image segmentation.

    PubMed

    Kong, Youyong; Wang, Defeng; Shi, Lin; Hui, Steve C N; Chu, Winnie C W

    2014-01-01

    High quality segmentation of diffusion tensor images (DTI) is of key interest in biomedical research and clinical application. In previous studies, most efforts have been made to construct predefined metrics for different DTI segmentation tasks. These methods require adequate prior knowledge and tuning parameters. To overcome these disadvantages, we proposed to automatically learn an adaptive distance metric by a graph based semi-supervised learning model for DTI segmentation. An original discriminative distance vector was first formulated by combining both geometry and orientation distances derived from diffusion tensors. The kernel metric over the original distance and labels of all voxels were then simultaneously optimized in a graph based semi-supervised learning approach. Finally, the optimization task was efficiently solved with an iterative gradient descent method to achieve the optimal solution. With our approach, an adaptive distance metric could be available for each specific segmentation task. Experiments on synthetic and real brain DTI datasets were performed to demonstrate the effectiveness and robustness of the proposed distance metric learning approach. The performance of our approach was compared with three classical metrics in the graph based semi-supervised learning framework.

  6. Adaptive Distance Metric Learning for Diffusion Tensor Image Segmentation

    PubMed Central

    Kong, Youyong; Wang, Defeng; Shi, Lin; Hui, Steve C. N.; Chu, Winnie C. W.

    2014-01-01

    High quality segmentation of diffusion tensor images (DTI) is of key interest in biomedical research and clinical application. In previous studies, most efforts have been made to construct predefined metrics for different DTI segmentation tasks. These methods require adequate prior knowledge and tuning parameters. To overcome these disadvantages, we proposed to automatically learn an adaptive distance metric by a graph based semi-supervised learning model for DTI segmentation. An original discriminative distance vector was first formulated by combining both geometry and orientation distances derived from diffusion tensors. The kernel metric over the original distance and labels of all voxels were then simultaneously optimized in a graph based semi-supervised learning approach. Finally, the optimization task was efficiently solved with an iterative gradient descent method to achieve the optimal solution. With our approach, an adaptive distance metric could be available for each specific segmentation task. Experiments on synthetic and real brain DTI datasets were performed to demonstrate the effectiveness and robustness of the proposed distance metric learning approach. The performance of our approach was compared with three classical metrics in the graph based semi-supervised learning framework. PMID:24651858

  7. Adaptive automatic segmentation of Leishmaniasis parasite in Indirect Immunofluorescence images.

    PubMed

    Ouertani, F; Amiri, H; Bettaib, J; Yazidi, R; Ben Salah, A

    2014-01-01

    This paper describes the first steps for the automation of the serum titration process. In fact, this process requires an Indirect Immunofluorescence (IIF) diagnosis automation. We deal with the initial phase that represents the fluorescence images segmentation. Our approach consists of three principle stages: (1) a color based segmentation which aims at extracting the fluorescent foreground based on k-means clustering, (2) the segmentation of the fluorescent clustered image, and (3) a region-based feature segmentation, intended to remove the fluorescent noisy regions and to locate fluorescent parasites. We evaluated the proposed method on 40 IIF images. Experimental results show that such a method provides reliable and robust automatic segmentation of fluorescent Promastigote parasite. PMID:25571049

  8. Streak image denoising and segmentation using adaptive Gaussian guided filter.

    PubMed

    Jiang, Zhuocheng; Guo, Baoping

    2014-09-10

    In streak tube imaging lidar (STIL), streak images are obtained using a CCD camera. However, noise in the captured streak images can greatly affect the quality of reconstructed 3D contrast and range images. The greatest challenge for streak image denoising is reducing the noise while preserving details. In this paper, we propose an adaptive Gaussian guided filter (AGGF) for noise removal and detail enhancement of streak images. The proposed algorithm is based on a guided filter (GF) and part of an adaptive bilateral filter (ABF). In the AGGF, the details are enhanced by optimizing the offset parameter. AGGF-denoised streak images are significantly sharper than those denoised by the GF. Moreover, the AGGF is a fast linear time algorithm achieved by recursively implementing a Gaussian filter kernel. Experimentally, AGGF demonstrates its capacity to preserve edges and thin structures and outperforms the existing bilateral filter and domain transform filter in terms of both visual quality and peak signal-to-noise ratio performance.

  9. Streak image denoising and segmentation using adaptive Gaussian guided filter.

    PubMed

    Jiang, Zhuocheng; Guo, Baoping

    2014-09-10

    In streak tube imaging lidar (STIL), streak images are obtained using a CCD camera. However, noise in the captured streak images can greatly affect the quality of reconstructed 3D contrast and range images. The greatest challenge for streak image denoising is reducing the noise while preserving details. In this paper, we propose an adaptive Gaussian guided filter (AGGF) for noise removal and detail enhancement of streak images. The proposed algorithm is based on a guided filter (GF) and part of an adaptive bilateral filter (ABF). In the AGGF, the details are enhanced by optimizing the offset parameter. AGGF-denoised streak images are significantly sharper than those denoised by the GF. Moreover, the AGGF is a fast linear time algorithm achieved by recursively implementing a Gaussian filter kernel. Experimentally, AGGF demonstrates its capacity to preserve edges and thin structures and outperforms the existing bilateral filter and domain transform filter in terms of both visual quality and peak signal-to-noise ratio performance. PMID:25321679

  10. Shape-model-based adaptation of 3D deformable meshes for segmentation of medical images

    NASA Astrophysics Data System (ADS)

    Pekar, Vladimir; Kaus, Michael R.; Lorenz, Cristian; Lobregt, Steven; Truyen, Roel; Weese, Juergen

    2001-07-01

    Segmentation methods based on adaptation of deformable models have found numerous applications in medical image analysis. Many efforts have been made in the recent years to improve their robustness and reliability. In particular, increasingly more methods use a priori information about the shape of the anatomical structure to be segmented. This reduces the risk of the model being attracted to false features in the image and, as a consequence, makes the need of close initialization, which remains the principal limitation of elastically deformable models, less crucial for the segmentation quality. In this paper, we present a novel segmentation approach which uses a 3D anatomical statistical shape model to initialize the adaptation process of a deformable model represented by a triangular mesh. As the first step, the anatomical shape model is parametrically fitted to the structure of interest in the image. The result of this global adaptation is used to initialize the local mesh refinement based on an energy minimization. We applied our approach to segment spine vertebrae in CT datasets. The segmentation quality was quantitatively assessed for 6 vertebrae, from 2 datasets, by computing the mean and maximum distance between the adapted mesh and a manually segmented reference shape. The results of the study show that the presented method is a promising approach for segmentation of complex anatomical structures in medical images.

  11. Length-adaptive graph search for automatic segmentation of pathological features in optical coherence tomography images

    NASA Astrophysics Data System (ADS)

    Keller, Brenton; Cunefare, David; Grewal, Dilraj S.; Mahmoud, Tamer H.; Izatt, Joseph A.; Farsiu, Sina

    2016-07-01

    We introduce a metric in graph search and demonstrate its application for segmenting retinal optical coherence tomography (OCT) images of macular pathology. Our proposed "adjusted mean arc length" (AMAL) metric is an adaptation of the lowest mean arc length search technique for automated OCT segmentation. We compare this method to Dijkstra's shortest path algorithm, which we utilized previously in our popular graph theory and dynamic programming segmentation technique. As an illustrative example, we show that AMAL-based length-adaptive segmentation outperforms the shortest path in delineating the retina/vitreous boundary of patients with full-thickness macular holes when compared with expert manual grading.

  12. Research on adaptive segmentation and activity classification method of filamentous fungi image in microbe fermentation

    NASA Astrophysics Data System (ADS)

    Cai, Xiaochun; Hu, Yihua; Wang, Peng; Sun, Dujuan; Hu, Guilan

    2009-10-01

    The paper presents an adaptive segmentation and activity classification method for filamentous fungi image. Firstly, an adaptive structuring element (SE) construction algorithm is proposed for image background suppression. Based on watershed transform method, the color labeled segmentation of fungi image is taken. Secondly, the fungi elements feature space is described and the feature set for fungi hyphae activity classification is extracted. The growth rate evaluation of fungi hyphae is achieved by using SVM classifier. Some experimental results demonstrate that the proposed method is effective for filamentous fungi image processing.

  13. 3D segmentation of masses in DCE-MRI images using FCM and adaptive MRF

    NASA Astrophysics Data System (ADS)

    Zhang, Chengjie; Li, Lihua

    2014-03-01

    Dynamic contrast enhanced magnetic resonance imaging (DCE-MRI) is a sensitive imaging modality for the detection of breast cancer. Automated segmentation of breast lesions in DCE-MRI images is challenging due to inherent signal-to-noise ratios and high inter-patient variability. A novel 3D segmentation method based on FCM and MRF is proposed in this study. In this method, a MRI image is segmented by spatial FCM, firstly. And then MRF segmentation is conducted to refine the result. We combined with the 3D information of lesion in the MRF segmentation process by using segmentation result of contiguous slices to constraint the slice segmentation. At the same time, a membership matrix of FCM segmentation result is used for adaptive adjustment of Markov parameters in MRF segmentation process. The proposed method was applied for lesion segmentation on 145 breast DCE-MRI examinations (86 malignant and 59 benign cases). An evaluation of segmentation was taken using the traditional overlap rate method between the segmented region and hand-drawing ground truth. The average overlap rates for benign and malignant lesions are 0.764 and 0.755 respectively. Then we extracted five features based on the segmentation region, and used an artificial neural network (ANN) to classify between malignant and benign cases. The ANN had a classification performance measured by the area under the ROC curve of AUC=0.73. The positive and negative predictive values were 0.86 and 0.58, respectively. The results demonstrate the proposed method not only achieves a better segmentation performance in accuracy also has a reasonable classification performance.

  14. Segmentation of brain PET-CT images based on adaptive use of complementary information

    NASA Astrophysics Data System (ADS)

    Xia, Yong; Wen, Lingfeng; Eberl, Stefan; Fulham, Michael; Feng, Dagan

    2009-02-01

    Dual modality PET-CT imaging provides aligned anatomical (CT) and functional (PET) images in a single scanning session, which can potentially be used to improve image segmentation of PET-CT data. The ability to distinguish structures for segmentation is a function of structure and modality and varies across voxels. Thus optimal contribution of a particular modality to segmentation is spatially variant. Existing segmentation algorithms, however, seldom account for this characteristic of PET-CT data and the results using these algorithms are not optimal. In this study, we propose a relative discrimination index (RDI) to characterize the relative abilities of PET and CT to correctly classify each voxel into the correct structure for segmentation. The definition of RDI is based on the information entropy of the probability distribution of the voxel's class label. If the class label derived from CT data for a particular voxel has more certainty than that derived from PET data, the corresponding RDI will have a higher value. We applied the RDI matrix to balance adaptively the contributions of PET and CT data to segmentation of brain PET-CT images on a voxel-by-voxel basis, with the aim to give the modality with higher discriminatory power a larger weight. The resultant segmentation approach is distinguished from traditional approaches by its innovative and adaptive use of the dual-modality information. We compared our approach to the non-RDI version and two commonly used PET-only based segmentation algorithms for simulation and clinical data. Our results show that the RDI matrix markedly improved PET-CT image segmentation.

  15. Dual-modality brain PET-CT image segmentation based on adaptive use of functional and anatomical information.

    PubMed

    Xia, Yong; Eberl, Stefan; Wen, Lingfeng; Fulham, Michael; Feng, David Dagan

    2012-01-01

    Dual medical imaging modalities, such as PET-CT, are now a routine component of clinical practice. Medical image segmentation methods, however, have generally only been applied to single modality images. In this paper, we propose the dual-modality image segmentation model to segment brain PET-CT images into gray matter, white matter and cerebrospinal fluid. This model converts PET-CT image segmentation into an optimization process controlled simultaneously by PET and CT voxel values and spatial constraints. It is innovative in the creation and application of the modality discriminatory power (MDP) coefficient as a weighting scheme to adaptively combine the functional (PET) and anatomical (CT) information on a voxel-by-voxel basis. Our approach relies upon allowing the modality with higher discriminatory power to play a more important role in the segmentation process. We compared the proposed approach to three other image segmentation strategies, including PET-only based segmentation, combination of the results of independent PET image segmentation and CT image segmentation, and simultaneous segmentation of joint PET and CT images without an adaptive weighting scheme. Our results in 21 clinical studies showed that our approach provides the most accurate and reliable segmentation for brain PET-CT images. PMID:21719257

  16. Dual-modality brain PET-CT image segmentation based on adaptive use of functional and anatomical information.

    PubMed

    Xia, Yong; Eberl, Stefan; Wen, Lingfeng; Fulham, Michael; Feng, David Dagan

    2012-01-01

    Dual medical imaging modalities, such as PET-CT, are now a routine component of clinical practice. Medical image segmentation methods, however, have generally only been applied to single modality images. In this paper, we propose the dual-modality image segmentation model to segment brain PET-CT images into gray matter, white matter and cerebrospinal fluid. This model converts PET-CT image segmentation into an optimization process controlled simultaneously by PET and CT voxel values and spatial constraints. It is innovative in the creation and application of the modality discriminatory power (MDP) coefficient as a weighting scheme to adaptively combine the functional (PET) and anatomical (CT) information on a voxel-by-voxel basis. Our approach relies upon allowing the modality with higher discriminatory power to play a more important role in the segmentation process. We compared the proposed approach to three other image segmentation strategies, including PET-only based segmentation, combination of the results of independent PET image segmentation and CT image segmentation, and simultaneous segmentation of joint PET and CT images without an adaptive weighting scheme. Our results in 21 clinical studies showed that our approach provides the most accurate and reliable segmentation for brain PET-CT images.

  17. Local adaptive approach toward segmentation of microscopic images of activated sludge flocs

    NASA Astrophysics Data System (ADS)

    Khan, Muhammad Burhan; Nisar, Humaira; Ng, Choon Aun; Lo, Po Kim; Yap, Vooi Voon

    2015-11-01

    Activated sludge process is a widely used method to treat domestic and industrial effluents. The conditions of activated sludge wastewater treatment plant (AS-WWTP) are related to the morphological properties of flocs (microbial aggregates) and filaments, and are required to be monitored for normal operation of the plant. Image processing and analysis is a potential time-efficient monitoring tool for AS-WWTPs. Local adaptive segmentation algorithms are proposed for bright-field microscopic images of activated sludge flocs. Two basic modules are suggested for Otsu thresholding-based local adaptive algorithms with irregular illumination compensation. The performance of the algorithms has been compared with state-of-the-art local adaptive algorithms of Sauvola, Bradley, Feng, and c-mean. The comparisons are done using a number of region- and nonregion-based metrics at different microscopic magnifications and quantification of flocs. The performance metrics show that the proposed algorithms performed better and, in some cases, were comparable to the state-of the-art algorithms. The performance metrics were also assessed subjectively for their suitability for segmentations of activated sludge images. The region-based metrics such as false negative ratio, sensitivity, and negative predictive value gave inconsistent results as compared to other segmentation assessment metrics.

  18. A fully automatic framework for cell segmentation on non-confocal adaptive optics images

    NASA Astrophysics Data System (ADS)

    Liu, Jianfei; Dubra, Alfredo; Tam, Johnny

    2016-03-01

    By the time most retinal diseases are diagnosed, macroscopic irreversible cellular loss has already occurred. Earlier detection of subtle structural changes at the single photoreceptor level is now possible, using the adaptive optics scanning light ophthalmoscope (AOSLO). This work aims to develop a fully automatic segmentation framework to extract cell boundaries from non-confocal split-detection AOSLO images of the cone photoreceptor mosaic in the living human eye. Significant challenges include anisotropy, heterogeneous cell regions arising from shading effects, and low contrast between cells and background. To overcome these challenges, we propose the use of: 1) multi-scale Hessian response to detect heterogeneous cell regions, 2) convex hulls to create boundary templates, and 3) circularlyconstrained geodesic active contours to refine cell boundaries. We acquired images from three healthy subjects at eccentric retinal regions and manually contoured cells to generate ground-truth for evaluating segmentation accuracy. Dice coefficient, relative absolute area difference, and average contour distance were 82±2%, 11±6%, and 2.0±0.2 pixels (Mean±SD), respectively. We find that strong shading effects from vessels are a main factor that causes cell oversegmentation and false segmentation of non-cell regions. Our segmentation algorithm can automatically and accurately segment photoreceptor cells on non-confocal AOSLO images, which is the first step in longitudinal tracking of cellular changes in the individual eye over the time course of disease progression.

  19. An adaptive image segmentation process for the classification of lung biopsy images

    NASA Astrophysics Data System (ADS)

    McKee, Daniel W.; Land, Walker H., Jr.; Zhukov, Tatyana; Song, Dansheng; Qian, Wei

    2006-03-01

    The purpose of this study was to develop a computer-based second opinion diagnostic tool that could read microscope images of lung tissue and classify the tissue sample as normal or cancerous. This problem can be broken down into three areas: segmentation, feature extraction and measurement, and classification. We introduce a kernel-based extension of fuzzy c-means to provide a coarse initial segmentation, with heuristically-based mechanisms to improve the accuracy of the segmentation. The segmented image is then processed to extract and quantify features. Finally, the measured features are used by a Support Vector Machine (SVM) to classify the tissue sample. The performance of this approach was tested using a database of 85 images collected at the Moffitt Cancer Center and Research Institute. These images represent a wide variety of normal lung tissue samples, as well as multiple types of lung cancer. When used with a subset of the data containing images from the normal and adenocarcinoma classes, we were able to correctly classify 78% of the images, with a ROC A Z of 0.758.

  20. Automated Adaptive Brightness in Wireless Capsule Endoscopy Using Image Segmentation and Sigmoid Function.

    PubMed

    Shrestha, Ravi; Mohammed, Shahed K; Hasan, Md Mehedi; Zhang, Xuechao; Wahid, Khan A

    2016-08-01

    Wireless capsule endoscopy (WCE) plays an important role in the diagnosis of gastrointestinal (GI) diseases by capturing images of human small intestine. Accurate diagnosis of endoscopic images depends heavily on the quality of captured images. Along with image and frame rate, brightness of the image is an important parameter that influences the image quality which leads to the design of an efficient illumination system. Such design involves the choice and placement of proper light source and its ability to illuminate GI surface with proper brightness. Light emitting diodes (LEDs) are normally used as sources where modulated pulses are used to control LED's brightness. In practice, instances like under- and over-illumination are very common in WCE, where the former provides dark images and the later provides bright images with high power consumption. In this paper, we propose a low-power and efficient illumination system that is based on an automated brightness algorithm. The scheme is adaptive in nature, i.e., the brightness level is controlled automatically in real-time while the images are being captured. The captured images are segmented into four equal regions and the brightness level of each region is calculated. Then an adaptive sigmoid function is used to find the optimized brightness level and accordingly a new value of duty cycle of the modulated pulse is generated to capture future images. The algorithm is fully implemented in a capsule prototype and tested with endoscopic images. Commercial capsules like Pillcam and Mirocam were also used in the experiment. The results show that the proposed algorithm works well in controlling the brightness level accordingly to the environmental condition, and as a result, good quality images are captured with an average of 40% brightness level that saves power consumption of the capsule. PMID:27333609

  1. An efficient topology adaptation system for parametric active contour segmentation of 3D images

    NASA Astrophysics Data System (ADS)

    Abhau, Jochen; Scherzer, Otmar

    2008-03-01

    Active contour models have already been used succesfully for segmentation of organs from medical images in 3D. In implicit models, the contour is given as the isosurface of a scalar function, and therefore topology adaptations are handled naturally during a contour evolution. Nevertheless, explicit or parametric models are often preferred since user interaction and special geometric constraints are usually easier to incorporate. Although many researchers have studied topology adaptation algorithms in explicit mesh evolutions, no stable algorithm is known for interactive applications. In this paper, we present a topology adaptation system, which consists of two novel ingredients: A spatial hashing technique is used to detect self-colliding triangles of the mesh whose expected running time is linear with respect to the number of mesh vertices. For the topology change procedure, we have developed formulas by homology theory. During a contour evolution, we just have to choose between a few possible mesh retriangulations by local triangle-triangle intersection tests. Our algorithm has several advantages compared to existing ones: Since the new algorithm does not require any global mesh reparametrizations, it is very efficient. Since the topology adaptation system does not require constant sampling density of the mesh vertices nor especially smooth meshes, mesh evolution steps can be performed in a stable way with a rather coarse mesh. We apply our algorithm to 3D ultrasonic data, showing that accurate segmentation is obtained in some seconds.

  2. Automated segmentation of retinal pigment epithelium cells in fluorescence adaptive optics images.

    PubMed

    Rangel-Fonseca, Piero; Gómez-Vieyra, Armando; Malacara-Hernández, Daniel; Wilson, Mario C; Williams, David R; Rossi, Ethan A

    2013-12-01

    Adaptive optics (AO) imaging methods allow the histological characteristics of retinal cell mosaics, such as photoreceptors and retinal pigment epithelium (RPE) cells, to be studied in vivo. The high-resolution images obtained with ophthalmic AO imaging devices are rich with information that is difficult and/or tedious to quantify using manual methods. Thus, robust, automated analysis tools that can provide reproducible quantitative information about the cellular mosaics under examination are required. Automated algorithms have been developed to detect the position of individual photoreceptor cells; however, most of these methods are not well suited for characterizing the RPE mosaic. We have developed an algorithm for RPE cell segmentation and show its performance here on simulated and real fluorescence AO images of the RPE mosaic. Algorithm performance was compared to manual cell identification and yielded better than 91% correspondence. This method can be used to segment RPE cells for morphometric analysis of the RPE mosaic and speed the analysis of both healthy and diseased RPE mosaics.

  3. Directional adaptive deformable models for segmentation with application to 2D and 3D medical images

    NASA Astrophysics Data System (ADS)

    Rougon, Nicolas F.; Preteux, Francoise J.

    1993-09-01

    In this paper, we address the problem of adapting the functions controlling the material properties of 2D snakes, and show how introducing oriented smoothness constraints results in a novel class of active contour models for segmentation which extends standard isotropic inhomogeneous membrane/thin-plate stabilizers. These constraints, expressed as adaptive L2 matrix norms, are defined by two 2nd-order symmetric and positive definite tensors which are invariant with respect to rigid motions in the image plane. These tensors, equivalent to directional adaptive stretching and bending densities, are quadratic with respect to 1st- and 2nd-order derivatives of the image intensity, respectively. A representation theorem specifying their canonical form is established and a geometrical interpretation of their effects if developed. Within this framework, it is shown that, by achieving a directional control of regularization, such non-isotropic constraints consistently relate the differential properties (metric and curvature) of the deformable model with those of the underlying intensity surface, yielding a satisfying preservation of image contour characteristics.

  4. Segmentation of Brain Tissues from Magnetic Resonance Images Using Adaptively Regularized Kernel-Based Fuzzy C-Means Clustering.

    PubMed

    Elazab, Ahmed; Wang, Changmiao; Jia, Fucang; Wu, Jianhuang; Li, Guanglin; Hu, Qingmao

    2015-01-01

    An adaptively regularized kernel-based fuzzy C-means clustering framework is proposed for segmentation of brain magnetic resonance images. The framework can be in the form of three algorithms for the local average grayscale being replaced by the grayscale of the average filter, median filter, and devised weighted images, respectively. The algorithms employ the heterogeneity of grayscales in the neighborhood and exploit this measure for local contextual information and replace the standard Euclidean distance with Gaussian radial basis kernel functions. The main advantages are adaptiveness to local context, enhanced robustness to preserve image details, independence of clustering parameters, and decreased computational costs. The algorithms have been validated against both synthetic and clinical magnetic resonance images with different types and levels of noises and compared with 6 recent soft clustering algorithms. Experimental results show that the proposed algorithms are superior in preserving image details and segmentation accuracy while maintaining a low computational complexity. PMID:26793269

  5. Segmentation of Brain Tissues from Magnetic Resonance Images Using Adaptively Regularized Kernel-Based Fuzzy C-Means Clustering.

    PubMed

    Elazab, Ahmed; Wang, Changmiao; Jia, Fucang; Wu, Jianhuang; Li, Guanglin; Hu, Qingmao

    2015-01-01

    An adaptively regularized kernel-based fuzzy C-means clustering framework is proposed for segmentation of brain magnetic resonance images. The framework can be in the form of three algorithms for the local average grayscale being replaced by the grayscale of the average filter, median filter, and devised weighted images, respectively. The algorithms employ the heterogeneity of grayscales in the neighborhood and exploit this measure for local contextual information and replace the standard Euclidean distance with Gaussian radial basis kernel functions. The main advantages are adaptiveness to local context, enhanced robustness to preserve image details, independence of clustering parameters, and decreased computational costs. The algorithms have been validated against both synthetic and clinical magnetic resonance images with different types and levels of noises and compared with 6 recent soft clustering algorithms. Experimental results show that the proposed algorithms are superior in preserving image details and segmentation accuracy while maintaining a low computational complexity.

  6. Adaptive segmentation of an x-ray CT image using vector quantization

    NASA Astrophysics Data System (ADS)

    Li, Lihua; Qian, Wei; Clarke, Laurence P.

    1997-04-01

    This paper is part of a feasibility study of using an image segmentation method to automatically identify the tumor or target boundaries in each axial slice or to assist an expert physician to manually draw these boundaries.A two-stage segmentation method is proposed. In the first step, the outlying bone structure is removed from the raw CT data and the brain parenchymal area is extracted. Then a VQ-based method is applied for the segmentation of the soft tissue inside the brain area. Representative results for two sets of x-ray CT axial slice images from tow patients are presented. Problems and further modifications are discussed.

  7. Personalized articulated atlas with a dynamic adaptation strategy for bone segmentation in CT or CT/MR head and neck images

    NASA Astrophysics Data System (ADS)

    Steger, Sebastian; Jung, Florian; Wesarg, Stefan

    2014-03-01

    This paper presents a novel segmentation method for the joint segmentation of individual bones in CT- or CT/MR- head and neck images. It is based on an articulated atlas for CT images that learned the shape and appearance of the individual bones along with the articulation between them from annotated training instances. First, a novel dynamic adaptation strategy for the atlas is presented in order to increase the rate of successful adaptations. Then, if a corresponding CT image is available the atlas can be enriched with personalized information about shape, appearance and size of the individual bones from that image. Using mutual information, this personalized atlas is adapted to an MR image in order to propagate segmentations. For evaluation, a head and neck bone atlas created from 15 manually annotated training images was adapted to 58 clinically acquired head andneck CT datasets. Visual inspection showed that the automatic dynamic adaptation strategy was successful for all bones in 86% of the cases. This is a 22% improvement compared to the traditional gradient descent based approach. In leave-one-out cross validation manner the average surface distance of the correctly adapted items was found to be 0.6 8mm. In 20 cases corresponding CT/MR image pairs were available and the atlas could be personalized and adapted to the MR image. This was successful in 19 cases.

  8. ACTIVE-EYES: an adaptive pixel-by-pixel image-segmentation sensor architecture for high-dynamic-range hyperspectral imaging.

    PubMed

    Christensen, Marc P; Euliss, Gary W; McFadden, Michael J; Coyle, Kevin M; Milojkovic, Predrag; Haney, Michael W; van der Gracht, Joeseph; Athale, Ravindra A

    2002-10-10

    The ACTIVE-EYES (adaptive control for thermal imagers via electro-optic elements to yield an enhanced sensor) architecture, an adaptive image-segmentation and processing architecture, based on digital micromirror (DMD) array technology, is described. The concept provides efficient front-end processing of multispectral image data by adaptively segmenting and routing portions of the scene data concurrently to an imager and a spectrometer. The goal is to provide a large reduction in the amount of data required to be sensed in a multispectral imager by means of preprocessing the data to extract the most useful spatial and spectral information during detection. The DMD array provides the flexibility to perform a wide range of spatial and spectral analyses on the scene data. The spatial and spectral processing for different portions of the input scene can be tailored in real time to achieve a variety of preprocessing functions. Since the detected intensity of individual pixels may be controlled, the spatial image can be analyzed with gain varied on a pixel-by-pixel basis to enhance dynamic range. Coarse or fine spectral resolution can be achieved in the spectrometer by use of dynamically controllable or addressable dispersion elements. An experimental prototype, which demonstrated the segmentation between an imager and a grating spectrometer, was demonstrated and shown to achieve programmable pixelated intensity control. An information theoretic analysis of the dynamic-range control aspect was conducted to predict the performance enhancements that might be achieved with this architecture. The results indicate that, with a properly configured algorithm, the concept achieves the greatest relative information recovery from a detected image when the scene is made up of a relatively large area of moderate-dynamic-range pixels and a relatively smaller area of strong pixels that would tend to saturate a conventional sensor. PMID:12389978

  9. Image segmentation survey

    NASA Technical Reports Server (NTRS)

    Haralick, R. M.

    1982-01-01

    The methodologies and capabilities of image segmentation techniques are reviewed. Single linkage schemes, hybrid linkage schemes, centroid linkage schemes, histogram mode seeking, spatial clustering, and split and merge schemes are addressed.

  10. Scorpion image segmentation system

    NASA Astrophysics Data System (ADS)

    Joseph, E.; Aibinu, A. M.; Sadiq, B. A.; Bello Salau, H.; Salami, M. J. E.

    2013-12-01

    Death as a result of scorpion sting has been a major public health problem in developing countries. Despite the high rate of death as a result of scorpion sting, little report exists in literature of intelligent device and system for automatic detection of scorpion. This paper proposed a digital image processing approach based on the floresencing characteristics of Scorpion under Ultra-violet (UV) light for automatic detection and identification of scorpion. The acquired UV-based images undergo pre-processing to equalize uneven illumination and colour space channel separation. The extracted channels are then segmented into two non-overlapping classes. It has been observed that simple thresholding of the green channel of the acquired RGB UV-based image is sufficient for segmenting Scorpion from other background components in the acquired image. Two approaches to image segmentation have also been proposed in this work, namely, the simple average segmentation technique and K-means image segmentation. The proposed algorithm has been tested on over 40 UV scorpion images obtained from different part of the world and results obtained show an average accuracy of 97.7% in correctly classifying the pixel into two non-overlapping clusters. The proposed 1system will eliminate the problem associated with some of the existing manual approaches presently in use for scorpion detection.

  11. Intra-patient semi-automated segmentation of the cervix-uterus in CT-images for adaptive radiotherapy of cervical cancer.

    PubMed

    Bondar, M Luiza; Hoogeman, Mischa; Schillemans, Wilco; Heijmen, Ben

    2013-08-01

    For online adaptive radiotherapy of cervical cancer, fast and accurate image segmentation is required to facilitate daily treatment adaptation. Our aim was twofold: (1) to test and compare three intra-patient automated segmentation methods for the cervix-uterus structure in CT-images and (2) to improve the segmentation accuracy by including prior knowledge on the daily bladder volume or on the daily coordinates of implanted fiducial markers. The tested methods were: shape deformation (SD) and atlas-based segmentation (ABAS) using two non-rigid registration methods: demons and a hierarchical algorithm. Tests on 102 CT-scans of 13 patients demonstrated that the segmentation accuracy significantly increased by including the bladder volume predicted with a simple 1D model based on a manually defined bladder top. Moreover, manually identified implanted fiducial markers significantly improved the accuracy of the SD method. For patients with large cervix-uterus volume regression, the use of CT-data acquired toward the end of the treatment was required to improve segmentation accuracy. Including prior knowledge, the segmentation results of SD (Dice similarity coefficient 85 ± 6%, error margin 2.2 ± 2.3 mm, average time around 1 min) and of ABAS using hierarchical non-rigid registration (Dice 82 ± 10%, error margin 3.1 ± 2.3 mm, average time around 30 s) support their use for image guided online adaptive radiotherapy of cervical cancer.

  12. Intra-patient semi-automated segmentation of the cervix-uterus in CT-images for adaptive radiotherapy of cervical cancer

    NASA Astrophysics Data System (ADS)

    Luiza Bondar, M.; Hoogeman, Mischa; Schillemans, Wilco; Heijmen, Ben

    2013-08-01

    For online adaptive radiotherapy of cervical cancer, fast and accurate image segmentation is required to facilitate daily treatment adaptation. Our aim was twofold: (1) to test and compare three intra-patient automated segmentation methods for the cervix-uterus structure in CT-images and (2) to improve the segmentation accuracy by including prior knowledge on the daily bladder volume or on the daily coordinates of implanted fiducial markers. The tested methods were: shape deformation (SD) and atlas-based segmentation (ABAS) using two non-rigid registration methods: demons and a hierarchical algorithm. Tests on 102 CT-scans of 13 patients demonstrated that the segmentation accuracy significantly increased by including the bladder volume predicted with a simple 1D model based on a manually defined bladder top. Moreover, manually identified implanted fiducial markers significantly improved the accuracy of the SD method. For patients with large cervix-uterus volume regression, the use of CT-data acquired toward the end of the treatment was required to improve segmentation accuracy. Including prior knowledge, the segmentation results of SD (Dice similarity coefficient 85 ± 6%, error margin 2.2 ± 2.3 mm, average time around 1 min) and of ABAS using hierarchical non-rigid registration (Dice 82 ± 10%, error margin 3.1 ± 2.3 mm, average time around 30 s) support their use for image guided online adaptive radiotherapy of cervical cancer.

  13. Adaptive multi-level conditional random fields for detection and segmentation of small enhanced pathology in medical images.

    PubMed

    Karimaghaloo, Zahra; Arnold, Douglas L; Arbel, Tal

    2016-01-01

    Detection and segmentation of large structures in an image or within a region of interest have received great attention in the medical image processing domains. However, the problem of small pathology detection and segmentation still remains an unresolved challenge due to the small size of these pathologies, their low contrast and variable position, shape and texture. In many contexts, early detection of these pathologies is critical in diagnosis and assessing the outcome of treatment. In this paper, we propose a probabilistic Adaptive Multi-level Conditional Random Fields (AMCRF) with the incorporation of higher order cliques for detecting and segmenting such pathologies. In the first level of our graphical model, a voxel-based CRF is used to identify candidate lesions. In the second level, in order to further remove falsely detected regions, a new CRF is developed that incorporates higher order textural features, which are invariant to rotation and local intensity distortions. At this level, higher order textures are considered together with the voxel-wise cliques to refine boundaries and is therefore adaptive. The proposed algorithm is tested in the context of detecting enhancing Multiple Sclerosis (MS) lesions in brain MRI, where the problem is further complicated as many of the enhancing voxels are associated with normal structures (i.e. blood vessels) or noise in the MRI. The algorithm is trained and tested on large multi-center clinical trials from Relapsing-Remitting MS patients. The effect of several different parameter learning and inference techniques is further investigated. When tested on 120 cases, the proposed method reaches a lesion detection rate of 90%, with very few false positive lesion counts on average, ranging from 0.17 for very small (3-5 voxels) to 0 for very large (50+ voxels) regions. The proposed model is further tested on a very large clinical trial containing 2770 scans where a high sensitivity of 91% with an average false positive

  14. Robust Adaptive 3-D Segmentation of Vessel Laminae From Fluorescence Confocal Microscope Images and Parallel GPU Implementation

    PubMed Central

    Narayanaswamy, Arunachalam; Dwarakapuram, Saritha; Bjornsson, Christopher S.; Cutler, Barbara M.; Shain, William

    2010-01-01

    This paper presents robust 3-D algorithms to segment vasculature that is imaged by labeling laminae, rather than the lumenal volume. The signal is weak, sparse, noisy, nonuniform, low-contrast, and exhibits gaps and spectral artifacts, so adaptive thresholding and Hessian filtering based methods are not effective. The structure deviates from a tubular geometry, so tracing algorithms are not effective. We propose a four step approach. The first step detects candidate voxels using a robust hypothesis test based on a model that assumes Poisson noise and locally planar geometry. The second step performs an adaptive region growth to extract weakly labeled and fine vessels while rejecting spectral artifacts. To enable interactive visualization and estimation of features such as statistical confidence, local curvature, local thickness, and local normal, we perform the third step. In the third step, we construct an accurate mesh representation using marching tetrahedra, volume-preserving smoothing, and adaptive decimation algorithms. To enable topological analysis and efficient validation, we describe a method to estimate vessel centerlines using a ray casting and vote accumulation algorithm which forms the final step of our algorithm. Our algorithm lends itself to parallel processing, and yielded an 8× speedup on a graphics processor (GPU). On synthetic data, our meshes had average error per face (EPF) values of (0.1–1.6) voxels per mesh face for peak signal-to-noise ratios from (110–28 dB). Separately, the error from decimating the mesh to less than 1% of its original size, the EPF was less than 1 voxel/face. When validated on real datasets, the average recall and precision values were found to be 94.66% and 94.84%, respectively. PMID:20199906

  15. Cooperative processes in image segmentation

    NASA Technical Reports Server (NTRS)

    Davis, L. S.

    1982-01-01

    Research into the role of cooperative, or relaxation, processes in image segmentation is surveyed. Cooperative processes can be employed at several levels of the segmentation process as a preprocessing enhancement step, during supervised or unsupervised pixel classification and, finally, for the interpretation of image segments based on segment properties and relations.

  16. Bone image segmentation.

    PubMed

    Liu, Z Q; Liew, H L; Clement, J G; Thomas, C D

    1999-05-01

    Characteristics of microscopic structures in bone cross sections carry essential clues in age determination in forensic science and in the study of age-related bone developments and bone diseases. Analysis of bone cross sections represents a major area of research in bone biology. However, traditional approaches in bone biology have relied primarily on manual processes with very limited number of bone samples. As a consequence, it is difficult to reach reliable and consistent conclusions. In this paper we present an image processing system that uses microstructural and relational knowledge present in the bone cross section for bone image segmentation. This system automates the bone image analysis process and is able to produce reliable results based on quantitative measurements from a large number of bone images. As a result, using large databases of bone images to study the correlation between bone structural features and age-related bone developments becomes feasible.

  17. Segmentation of stereo terrain images

    NASA Astrophysics Data System (ADS)

    George, Debra A.; Privitera, Claudio M.; Blackmon, Theodore T.; Zbinden, Eric; Stark, Lawrence W.

    2000-06-01

    We have studied four approaches to segmentation of images: three automatic ones using image processing algorithms and a fourth approach, human manual segmentation. We were motivated toward helping with an important NASA Mars rover mission task -- replacing laborious manual path planning with automatic navigation of the rover on the Mars terrain. The goal of the automatic segmentations was to identify an obstacle map on the Mars terrain to enable automatic path planning for the rover. The automatic segmentation was first explored with two different segmentation methods: one based on pixel luminance, and the other based on pixel altitude generated through stereo image processing. The third automatic segmentation was achieved by combining these two types of image segmentation. Human manual segmentation of Martian terrain images was used for evaluating the effectiveness of the combined automatic segmentation as well as for determining how different humans segment the same images. Comparisons between two different segmentations, manual or automatic, were measured using a similarity metric, SAB. Based on this metric, the combined automatic segmentation did fairly well in agreeing with the manual segmentation. This was a demonstration of a positive step towards automatically creating the accurate obstacle maps necessary for automatic path planning and rover navigation.

  18. Fully automatic segmentation of multiple sclerosis lesions in brain MR FLAIR images using adaptive mixtures method and Markov random field model.

    PubMed

    Khayati, Rasoul; Vafadust, Mansur; Towhidkhah, Farzad; Nabavi, Massood

    2008-03-01

    In this paper, an approach is proposed for fully automatic segmentation of MS lesions in fluid attenuated inversion recovery (FLAIR) Magnetic Resonance (MR) images. The proposed approach, based on a Bayesian classifier, utilizes the adaptive mixtures method (AMM) and Markov random field (MRF) model to obtain and upgrade the class conditional probability density function (CCPDF) and the a priori probability of each class. To compare the performance of the proposed approach with those of previous approaches including manual segmentation, the similarity criteria of different slices related to 20 MS patients were calculated. Also, volumetric comparison of lesions volume between the fully automated segmentation and the gold standard was performed using correlation coefficient (CC). The results showed a better performance for the proposed approach, compared to those of previous works.

  19. Validation of various adaptive threshold methods of segmentation applied to follicular lymphoma digital images stained with 3,3’-Diaminobenzidine&Haematoxylin

    PubMed Central

    2013-01-01

    The comparative study of the results of various segmentation methods for the digital images of the follicular lymphoma cancer tissue section is described in this paper. The sensitivity and specificity and some other parameters of the following adaptive threshold methods of segmentation: the Niblack method, the Sauvola method, the White method, the Bernsen method, the Yasuda method and the Palumbo method, are calculated. Methods are applied to three types of images constructed by extraction of the brown colour information from the artificial images synthesized based on counterpart experimentally captured images. This paper presents usefulness of the microscopic image synthesis method in evaluation as well as comparison of the image processing results. The results of thoughtful analysis of broad range of adaptive threshold methods applied to: (1) the blue channel of RGB, (2) the brown colour extracted by deconvolution and (3) the ’brown component’ extracted from RGB allows to select some pairs: method and type of image for which this method is most efficient considering various criteria e.g. accuracy and precision in area detection or accuracy in number of objects detection and so on. The comparison shows that the White, the Bernsen and the Sauvola methods results are better than the results of the rest of the methods for all types of monochromatic images. All three methods segments the immunopositive nuclei with the mean accuracy of 0.9952, 0.9942 and 0.9944 respectively, when treated totally. However the best results are achieved for monochromatic image in which intensity shows brown colour map constructed by colour deconvolution algorithm. The specificity in the cases of the Bernsen and the White methods is 1 and sensitivities are: 0.74 for White and 0.91 for Bernsen methods while the Sauvola method achieves sensitivity value of 0.74 and the specificity value of 0.99. According to Bland-Altman plot the Sauvola method selected objects are segmented without

  20. Consistent depth video segmentation using adaptive surface models.

    PubMed

    Husain, Farzad; Dellen, Babette; Torras, Carme

    2015-02-01

    We propose a new approach for the segmentation of 3-D point clouds into geometric surfaces using adaptive surface models. Starting from an initial configuration, the algorithm converges to a stable segmentation through a new iterative split-and-merge procedure, which includes an adaptive mechanism for the creation and removal of segments. This allows the segmentation to adjust to changing input data along the movie, leading to stable, temporally coherent, and traceable segments. We tested the method on a large variety of data acquired with different range imaging devices, including a structured-light sensor and a time-of-flight camera, and successfully segmented the videos into surface segments. We further demonstrated the feasibility of the approach using quantitative evaluations based on ground-truth data.

  1. Adaptive thresholding algorithm based on SAR images and wind data to segment oil spills along the northwest coast of the Iberian Peninsula.

    PubMed

    Mera, David; Cotos, José M; Varela-Pet, José; Garcia-Pineda, Oscar

    2012-10-01

    Satellite Synthetic Aperture Radar (SAR) has been established as a useful tool for detecting hydrocarbon spillage on the ocean's surface. Several surveillance applications have been developed based on this technology. Environmental variables such as wind speed should be taken into account for better SAR image segmentation. This paper presents an adaptive thresholding algorithm for detecting oil spills based on SAR data and a wind field estimation as well as its implementation as a part of a functional prototype. The algorithm was adapted to an important shipping route off the Galician coast (northwest Iberian Peninsula) and was developed on the basis of confirmed oil spills. Image testing revealed 99.93% pixel labelling accuracy. By taking advantage of multi-core processor architecture, the prototype was optimized to get a nearly 30% improvement in processing time.

  2. Image segmentation using random features

    NASA Astrophysics Data System (ADS)

    Bull, Geoff; Gao, Junbin; Antolovich, Michael

    2014-01-01

    This paper presents a novel algorithm for selecting random features via compressed sensing to improve the performance of Normalized Cuts in image segmentation. Normalized Cuts is a clustering algorithm that has been widely applied to segmenting images, using features such as brightness, intervening contours and Gabor filter responses. Some drawbacks of Normalized Cuts are that computation times and memory usage can be excessive, and the obtained segmentations are often poor. This paper addresses the need to improve the processing time of Normalized Cuts while improving the segmentations. A significant proportion of the time in calculating Normalized Cuts is spent computing an affinity matrix. A new algorithm has been developed that selects random features using compressed sensing techniques to reduce the computation needed for the affinity matrix. The new algorithm, when compared to the standard implementation of Normalized Cuts for segmenting images from the BSDS500, produces better segmentations in significantly less time.

  3. Microscopic cell nuclei segmentation based on adaptive attention window.

    PubMed

    Ko, ByoungChul; Seo, MiSuk; Nam, Jae-Yeal

    2009-06-01

    This paper presents an adaptive attention window (AAW)-based microscopic cell nuclei segmentation method. For semantic AAW detection, a luminance map is used to create an initial attention window, which is then reduced close to the size of the real region of interest (ROI) using a quad-tree. The purpose of the AAW is to facilitate background removal and reduce the ROI segmentation processing time. Region segmentation is performed within the AAW, followed by region clustering and removal to produce segmentation of only ROIs. Experimental results demonstrate that the proposed method can efficiently segment one or more ROIs and produce similar segmentation results to human perception. In future work, the proposed method will be used for supporting a region-based medical image retrieval system that can generate a combined feature vector of segmented ROIs based on extraction and patient data.

  4. Bayesian segmentation of hyperspectral images

    NASA Astrophysics Data System (ADS)

    Mohammadpour, Adel; Féron, Olivier; Mohammad-Djafari, Ali

    2004-11-01

    In this paper we consider the problem of joint segmentation of hyperspectral images in the Bayesian framework. The proposed approach is based on a Hidden Markov Modeling (HMM) of the images with common segmentation, or equivalently with common hidden classification label variables which is modeled by a Potts Markov Random Field. We introduce an appropriate Markov Chain Monte Carlo (MCMC) algorithm to implement the method and show some simulation results.

  5. Segmenting Images for a Better Diagnosis

    NASA Technical Reports Server (NTRS)

    2004-01-01

    NASA's Hierarchical Segmentation (HSEG) software has been adapted by Bartron Medical Imaging, LLC, for use in segmentation feature extraction, pattern recognition, and classification of medical images. Bartron acquired licenses from NASA Goddard Space Flight Center for application of the HSEG concept to medical imaging, from the California Institute of Technology/Jet Propulsion Laboratory to incorporate pattern-matching software, and from Kennedy Space Center for data-mining and edge-detection programs. The Med-Seg[TM] united developed by Bartron provides improved diagnoses for a wide range of medical images, including computed tomography scans, positron emission tomography scans, magnetic resonance imaging, ultrasound, digitized Z-ray, digitized mammography, dental X-ray, soft tissue analysis, and moving object analysis. It also can be used in analysis of soft-tissue slides. Bartron's future plans include the application of HSEG technology to drug development. NASA is advancing it's HSEG software to learn more about the Earth's magnetosphere.

  6. Neural network segmentation of magnetic resonance images

    NASA Astrophysics Data System (ADS)

    Frederick, Blaise

    1990-07-01

    Neural networks are well adapted to the task of grouping input patterns into subsets which share some similarity. Moreover once trained they can generalize their classification rules to classify new data sets. Sets of pixel intensities from magnetic resonance (MR) images provide a natural input to a neural network by varying imaging parameters MR images can reflect various independent physical parameters of tissues in their pixel intensities. A neural net can then be trained to classify physically similar tissue types based on sets of pixel intensities resulting from different imaging studies on the same subject. A neural network classifier for image segmentation was implemented on a Sun 4/60 and was tested on the task of classifying tissues of canine head MR images. Four images of a transaxial slice with different imaging sequences were taken as input to the network (three spin-echo images and an inversion recovery image). The training set consisted of 691 representative samples of gray matter white matter cerebrospinal fluid bone and muscle preclassified by a neuroscientist. The network was trained using a fast backpropagation algorithm to derive the decision criteria to classify any location in the image by its pixel intensities and the image was subsequently segmented by the classifier. The classifier''s performance was evaluated as a function of network size number of network layers and length of training. A single layer neural network performed quite well at

  7. Image Information Mining Utilizing Hierarchical Segmentation

    NASA Technical Reports Server (NTRS)

    Tilton, James C.; Marchisio, Giovanni; Koperski, Krzysztof; Datcu, Mihai

    2002-01-01

    The Hierarchical Segmentation (HSEG) algorithm is an approach for producing high quality, hierarchically related image segmentations. The VisiMine image information mining system utilizes clustering and segmentation algorithms for reducing visual information in multispectral images to a manageable size. The project discussed herein seeks to enhance the VisiMine system through incorporating hierarchical segmentations from HSEG into the VisiMine system.

  8. Segmentation of 3D tubular objects with adaptive front propagation and minimal tree extraction for 3D medical imaging.

    PubMed

    Cohen, Laurent D; Deschamps, Thomas

    2007-08-01

    We present a new fast approach for segmentation of thin branching structures, like vascular trees, based on Fast-Marching (FM) and Level Set (LS) methods. FM allows segmentation of tubular structures by inflating a "long balloon" from a user given single point. However, when the tubular shape is rather long, the front propagation may blow up through the boundary of the desired shape close to the starting point. Our contribution is focused on a method to propagate only the useful part of the front while freezing the rest of it. We demonstrate its ability to segment quickly and accurately tubular and tree-like structures. We also develop a useful stopping criterion for the causal front propagation. We finally derive an efficient algorithm for extracting an underlying 1D skeleton of the branching objects, with minimal path techniques. Each branch being represented by its centerline, we automatically detect the bifurcations, leading to the "Minimal Tree" representation. This so-called "Minimal Tree" is very useful for visualization and quantification of the pathologies in our anatomical data sets. We illustrate our algorithms by applying it to several arteries datasets.

  9. Segmentation of 3D tubular objects with adaptive front propagation and minimal tree extraction for 3D medical imaging.

    PubMed

    Cohen, Laurent D; Deschamps, Thomas

    2007-08-01

    We present a new fast approach for segmentation of thin branching structures, like vascular trees, based on Fast-Marching (FM) and Level Set (LS) methods. FM allows segmentation of tubular structures by inflating a "long balloon" from a user given single point. However, when the tubular shape is rather long, the front propagation may blow up through the boundary of the desired shape close to the starting point. Our contribution is focused on a method to propagate only the useful part of the front while freezing the rest of it. We demonstrate its ability to segment quickly and accurately tubular and tree-like structures. We also develop a useful stopping criterion for the causal front propagation. We finally derive an efficient algorithm for extracting an underlying 1D skeleton of the branching objects, with minimal path techniques. Each branch being represented by its centerline, we automatically detect the bifurcations, leading to the "Minimal Tree" representation. This so-called "Minimal Tree" is very useful for visualization and quantification of the pathologies in our anatomical data sets. We illustrate our algorithms by applying it to several arteries datasets. PMID:17671862

  10. Colony image acquisition and segmentation

    NASA Astrophysics Data System (ADS)

    Wang, W. X.

    2007-12-01

    For counting of both colonies and plaques, there is a large number of applications including food, dairy, beverages, hygiene, environmental monitoring, water, toxicology, sterility testing, AMES testing, pharmaceuticals, paints, sterile fluids and fungal contamination. Recently, many researchers and developers have made efforts for this kind of systems. By investigation, some existing systems have some problems. The main problems are image acquisition and image segmentation. In order to acquire colony images with good quality, an illumination box was constructed as: the box includes front lightning and back lightning, which can be selected by users based on properties of colony dishes. With the illumination box, lightning can be uniform; colony dish can be put in the same place every time, which make image processing easy. The developed colony image segmentation algorithm consists of the sub-algorithms: (1) image classification; (2) image processing; and (3) colony delineation. The colony delineation algorithm main contain: the procedures based on grey level similarity, on boundary tracing, on shape information and colony excluding. In addition, a number of algorithms are developed for colony analysis. The system has been tested and satisfactory.

  11. Random walks for image segmentation.

    PubMed

    Grady, Leo

    2006-11-01

    A novel method is proposed for performing multilabel, interactive image segmentation. Given a small number of pixels with user-defined (or predefined) labels, one can analytically and quickly determine the probability that a random walker starting at each unlabeled pixel will first reach one of the prelabeled pixels. By assigning each pixel to the label for which the greatest probability is calculated, a high-quality image segmentation may be obtained. Theoretical properties of this algorithm are developed along with the corresponding connections to discrete potential theory and electrical circuits. This algorithm is formulated in discrete space (i.e., on a graph) using combinatorial analogues of standard operators and principles from continuous potential theory, allowing it to be applied in arbitrary dimension on arbitrary graphs.

  12. Estimation of breast percent density in raw and processed full field digital mammography images via adaptive fuzzy c-means clustering and support vector machine segmentation

    SciTech Connect

    Keller, Brad M.; Nathan, Diane L.; Wang Yan; Zheng Yuanjie; Gee, James C.; Conant, Emily F.; Kontos, Despina

    2012-08-15

    Purpose: The amount of fibroglandular tissue content in the breast as estimated mammographically, commonly referred to as breast percent density (PD%), is one of the most significant risk factors for developing breast cancer. Approaches to quantify breast density commonly focus on either semiautomated methods or visual assessment, both of which are highly subjective. Furthermore, most studies published to date investigating computer-aided assessment of breast PD% have been performed using digitized screen-film mammograms, while digital mammography is increasingly replacing screen-film mammography in breast cancer screening protocols. Digital mammography imaging generates two types of images for analysis, raw (i.e., 'FOR PROCESSING') and vendor postprocessed (i.e., 'FOR PRESENTATION'), of which postprocessed images are commonly used in clinical practice. Development of an algorithm which effectively estimates breast PD% in both raw and postprocessed digital mammography images would be beneficial in terms of direct clinical application and retrospective analysis. Methods: This work proposes a new algorithm for fully automated quantification of breast PD% based on adaptive multiclass fuzzy c-means (FCM) clustering and support vector machine (SVM) classification, optimized for the imaging characteristics of both raw and processed digital mammography images as well as for individual patient and image characteristics. Our algorithm first delineates the breast region within the mammogram via an automated thresholding scheme to identify background air followed by a straight line Hough transform to extract the pectoral muscle region. The algorithm then applies adaptive FCM clustering based on an optimal number of clusters derived from image properties of the specific mammogram to subdivide the breast into regions of similar gray-level intensity. Finally, a SVM classifier is trained to identify which clusters within the breast tissue are likely fibroglandular, which are then

  13. Exo-planet Direct Imaging with On-Axis and/or Segmented Apertures in Space: Adaptive Compensation of Aperture Discontinuities

    NASA Astrophysics Data System (ADS)

    Soummer, Remi

    Capitalizing on a recent breakthrough in wavefront control theory for obscured apertures made by our group, we propose to demonstrate a method to achieve high contrast exoplanet imaging with on-axis obscured apertures. Our new algorithm, which we named Adaptive Compensation of Aperture Discontinuities (ACAD), provides the ability to compensate for aperture discontinuities (segment gaps and/or secondary mirror supports) by controlling deformable mirrors in a nonlinear wavefront control regime not utilized before but conceptually similar to the beam reshaping used in PIAA coronagraphy. We propose here an in-air demonstration at 1E- 7 contrast, enabled by adding a second deformable mirror to our current test-bed. This expansion of the scope of our current efforts in exoplanet imaging technologies will enabling us to demonstrate an integrated solution for wavefront control and starlight suppression on complex aperture geometries. It is directly applicable at scales from moderate-cost exoplanet probe missions to the 2.4 m AFTA telescopes to future flagship UVOIR observatories with apertures potentially 16-20 m. Searching for nearby habitable worlds with direct imaging is one of the top scientific priorities established by the Astro2010 Decadal Survey. Achieving this ambitious goal will require 1e-10 contrast on a telescope large enough to provide angular resolution and sensitivity to planets around a significant sample of nearby stars. Such a mission must of course also be realized at an achievable cost. Lightweight segmented mirror technology allows larger diameter optics to fit in any given launch vehicle as compared to monolithic mirrors, and lowers total life-cycle costs from construction through integration & test, making it a compelling option for future large space telescopes. At smaller scales, on-axis designs with secondary obscurations and supports are less challenging to fabricate and thus more affordable than the off-axis unobscured primary mirror designs

  14. Neonatal Brain Tissue Classification with Morphological Adaptation and Unified Segmentation.

    PubMed

    Beare, Richard J; Chen, Jian; Kelly, Claire E; Alexopoulos, Dimitrios; Smyser, Christopher D; Rogers, Cynthia E; Loh, Wai Y; Matthews, Lillian G; Cheong, Jeanie L Y; Spittle, Alicia J; Anderson, Peter J; Doyle, Lex W; Inder, Terrie E; Seal, Marc L; Thompson, Deanne K

    2016-01-01

    Measuring the distribution of brain tissue types (tissue classification) in neonates is necessary for studying typical and atypical brain development, such as that associated with preterm birth, and may provide biomarkers for neurodevelopmental outcomes. Compared with magnetic resonance images of adults, neonatal images present specific challenges that require the development of specialized, population-specific methods. This paper introduces MANTiS (Morphologically Adaptive Neonatal Tissue Segmentation), which extends the unified segmentation approach to tissue classification implemented in Statistical Parametric Mapping (SPM) software to neonates. MANTiS utilizes a combination of unified segmentation, template adaptation via morphological segmentation tools and topological filtering, to segment the neonatal brain into eight tissue classes: cortical gray matter, white matter, deep nuclear gray matter, cerebellum, brainstem, cerebrospinal fluid (CSF), hippocampus and amygdala. We evaluated the performance of MANTiS using two independent datasets. The first dataset, provided by the NeoBrainS12 challenge, consisted of coronal T 2-weighted images of preterm infants (born ≤30 weeks' gestation) acquired at 30 weeks' corrected gestational age (n = 5), coronal T 2-weighted images of preterm infants acquired at 40 weeks' corrected gestational age (n = 5) and axial T 2-weighted images of preterm infants acquired at 40 weeks' corrected gestational age (n = 5). The second dataset, provided by the Washington University NeuroDevelopmental Research (WUNDeR) group, consisted of T 2-weighted images of preterm infants (born <30 weeks' gestation) acquired shortly after birth (n = 12), preterm infants acquired at term-equivalent age (n = 12), and healthy term-born infants (born ≥38 weeks' gestation) acquired within the first 9 days of life (n = 12). For the NeoBrainS12 dataset, mean Dice scores comparing MANTiS with manual segmentations were all above 0.7, except for the cortical

  15. Neonatal Brain Tissue Classification with Morphological Adaptation and Unified Segmentation

    PubMed Central

    Beare, Richard J.; Chen, Jian; Kelly, Claire E.; Alexopoulos, Dimitrios; Smyser, Christopher D.; Rogers, Cynthia E.; Loh, Wai Y.; Matthews, Lillian G.; Cheong, Jeanie L. Y.; Spittle, Alicia J.; Anderson, Peter J.; Doyle, Lex W.; Inder, Terrie E.; Seal, Marc L.; Thompson, Deanne K.

    2016-01-01

    Measuring the distribution of brain tissue types (tissue classification) in neonates is necessary for studying typical and atypical brain development, such as that associated with preterm birth, and may provide biomarkers for neurodevelopmental outcomes. Compared with magnetic resonance images of adults, neonatal images present specific challenges that require the development of specialized, population-specific methods. This paper introduces MANTiS (Morphologically Adaptive Neonatal Tissue Segmentation), which extends the unified segmentation approach to tissue classification implemented in Statistical Parametric Mapping (SPM) software to neonates. MANTiS utilizes a combination of unified segmentation, template adaptation via morphological segmentation tools and topological filtering, to segment the neonatal brain into eight tissue classes: cortical gray matter, white matter, deep nuclear gray matter, cerebellum, brainstem, cerebrospinal fluid (CSF), hippocampus and amygdala. We evaluated the performance of MANTiS using two independent datasets. The first dataset, provided by the NeoBrainS12 challenge, consisted of coronal T2-weighted images of preterm infants (born ≤30 weeks' gestation) acquired at 30 weeks' corrected gestational age (n = 5), coronal T2-weighted images of preterm infants acquired at 40 weeks' corrected gestational age (n = 5) and axial T2-weighted images of preterm infants acquired at 40 weeks' corrected gestational age (n = 5). The second dataset, provided by the Washington University NeuroDevelopmental Research (WUNDeR) group, consisted of T2-weighted images of preterm infants (born <30 weeks' gestation) acquired shortly after birth (n = 12), preterm infants acquired at term-equivalent age (n = 12), and healthy term-born infants (born ≥38 weeks' gestation) acquired within the first 9 days of life (n = 12). For the NeoBrainS12 dataset, mean Dice scores comparing MANTiS with manual segmentations were all above 0.7, except for the cortical gray

  16. Metric Learning to Enhance Hyperspectral Image Segmentation

    NASA Technical Reports Server (NTRS)

    Thompson, David R.; Castano, Rebecca; Bue, Brian; Gilmore, Martha S.

    2013-01-01

    Unsupervised hyperspectral image segmentation can reveal spatial trends that show the physical structure of the scene to an analyst. They highlight borders and reveal areas of homogeneity and change. Segmentations are independently helpful for object recognition, and assist with automated production of symbolic maps. Additionally, a good segmentation can dramatically reduce the number of effective spectra in an image, enabling analyses that would otherwise be computationally prohibitive. Specifically, using an over-segmentation of the image instead of individual pixels can reduce noise and potentially improve the results of statistical post-analysis. In this innovation, a metric learning approach is presented to improve the performance of unsupervised hyperspectral image segmentation. The prototype demonstrations attempt a superpixel segmentation in which the image is conservatively over-segmented; that is, the single surface features may be split into multiple segments, but each individual segment, or superpixel, is ensured to have homogenous mineralogy.

  17. Image segmentation using association rule features.

    PubMed

    Rushing, John A; Ranganath, Heggere; Hinke, Thomas H; Graves, Sara J

    2002-01-01

    A new type of texture feature based on association rules is described. Association rules have been used in applications such as market basket analysis to capture relationships present among items in large data sets. It is shown that association rules can be adapted to capture frequently occurring local structures in images. The frequency of occurrence of these structures can be used to characterize texture. Methods for segmentation of textured images based on association rule features are described. Simulation results using images consisting of man made and natural textures show that association rule features perform well compared to other widely used texture features. Association rule features are used to detect cumulus cloud fields in GOES satellite images and are found to achieve higher accuracy than other statistical texture features for this problem.

  18. Outstanding-objects-oriented color image segmentation using fuzzy logic

    NASA Astrophysics Data System (ADS)

    Hayasaka, Rina; Zhao, Jiying; Matsushita, Yutaka

    1997-10-01

    This paper presents a novel fuzzy-logic-based color image segmentation scheme focusing on outstanding objects to human eyes. The scheme first segments the image into rough fuzzy regions, chooses visually significant regions, and conducts fine segmentation on the chosen regions. It can not only reduce the computational load, but also make contour detection easy because the brief object externals has been previously determined. The scheme reflects human sense, and it can be sued efficiently in automatic extraction of image retrieval key, robot vision and region-adaptive image compression.

  19. Building roof segmentation from aerial images using a lineand region-based watershed segmentation technique.

    PubMed

    El Merabet, Youssef; Meurie, Cyril; Ruichek, Yassine; Sbihi, Abderrahmane; Touahni, Raja

    2015-02-02

    In this paper, we present a novel strategy for roof segmentation from aerial images (orthophotoplans) based on the cooperation of edge- and region-based segmentation methods. The proposed strategy is composed of three major steps. The first one, called the pre-processing step, consists of simplifying the acquired image with an appropriate couple of invariant and gradient, optimized for the application, in order to limit illumination changes (shadows, brightness, etc.) affecting the images. The second step is composed of two main parallel treatments: on the one hand, the simplified image is segmented by watershed regions. Even if the first segmentation of this step provides good results in general, the image is often over-segmented. To alleviate this problem, an efficient region merging strategy adapted to the orthophotoplan particularities, with a 2D modeling of roof ridges technique, is applied. On the other hand, the simplified image is segmented by watershed lines. The third step consists of integrating both watershed segmentation strategies into a single cooperative segmentation scheme in order to achieve satisfactory segmentation results. Tests have been performed on orthophotoplans containing 100 roofs with varying complexity, and the results are evaluated with the VINETcriterion using ground-truth image segmentation. A comparison with five popular segmentation techniques of the literature demonstrates the effectiveness and the reliability of the proposed approach. Indeed, we obtain a good segmentation rate of 96% with the proposed method compared to 87.5% with statistical region merging (SRM), 84% with mean shift, 82% with color structure code (CSC), 80% with efficient graph-based segmentation algorithm (EGBIS) and 71% with JSEG.

  20. Image segmentation using fuzzy LVQ clustering networks

    NASA Technical Reports Server (NTRS)

    Tsao, Eric Chen-Kuo; Bezdek, James C.; Pal, Nikhil R.

    1992-01-01

    In this note we formulate image segmentation as a clustering problem. Feature vectors extracted from a raw image are clustered into subregions, thereby segmenting the image. A fuzzy generalization of a Kohonen learning vector quantization (LVQ) which integrates the Fuzzy c-Means (FCM) model with the learning rate and updating strategies of the LVQ is used for this task. This network, which segments images in an unsupervised manner, is thus related to the FCM optimization problem. Numerical examples on photographic and magnetic resonance images are given to illustrate this approach to image segmentation.

  1. Image Segmentation, Registration, Compression, and Matching

    NASA Technical Reports Server (NTRS)

    Yadegar, Jacob; Wei, Hai; Yadegar, Joseph; Ray, Nilanjan; Zabuawala, Sakina

    2011-01-01

    A novel computational framework was developed of a 2D affine invariant matching exploiting a parameter space. Named as affine invariant parameter space (AIPS), the technique can be applied to many image-processing and computer-vision problems, including image registration, template matching, and object tracking from image sequence. The AIPS is formed by the parameters in an affine combination of a set of feature points in the image plane. In cases where the entire image can be assumed to have undergone a single affine transformation, the new AIPS match metric and matching framework becomes very effective (compared with the state-of-the-art methods at the time of this reporting). No knowledge about scaling or any other transformation parameters need to be known a priori to apply the AIPS framework. An automated suite of software tools has been created to provide accurate image segmentation (for data cleaning) and high-quality 2D image and 3D surface registration (for fusing multi-resolution terrain, image, and map data). These tools are capable of supporting existing GIS toolkits already in the marketplace, and will also be usable in a stand-alone fashion. The toolkit applies novel algorithmic approaches for image segmentation, feature extraction, and registration of 2D imagery and 3D surface data, which supports first-pass, batched, fully automatic feature extraction (for segmentation), and registration. A hierarchical and adaptive approach is taken for achieving automatic feature extraction, segmentation, and registration. Surface registration is the process of aligning two (or more) data sets to a common coordinate system, during which the transformation between their different coordinate systems is determined. Also developed here are a novel, volumetric surface modeling and compression technique that provide both quality-guaranteed mesh surface approximations and compaction of the model sizes by efficiently coding the geometry and connectivity

  2. Segmentation of branching vascular structures using adaptive subdivision surface fitting

    NASA Astrophysics Data System (ADS)

    Kitslaar, Pieter H.; van't Klooster, Ronald; Staring, Marius; Lelieveldt, Boudewijn P. F.; van der Geest, Rob J.

    2015-03-01

    This paper describes a novel method for segmentation and modeling of branching vessel structures in medical images using adaptive subdivision surfaces fitting. The method starts with a rough initial skeleton model of the vessel structure. A coarse triangular control mesh consisting of hexagonal rings and dedicated bifurcation elements is constructed from this skeleton. Special attention is paid to ensure a topological sound control mesh is created around the bifurcation areas. Then, a smooth tubular surface is obtained from this coarse mesh using a standard subdivision scheme. This subdivision surface is iteratively fitted to the image. During the fitting, the target update locations of the subdivision surface are obtained using a scanline search along the surface normals, finding the maximum gradient magnitude (of the imaging data). In addition to this surface fitting framework, we propose an adaptive mesh refinement scheme. In this step the coarse control mesh topology is updated based on the current segmentation result, enabling adaptation to varying vessel lumen diameters. This enhances the robustness and flexibility of the method and reduces the amount of prior knowledge needed to create the initial skeletal model. The method was applied to publicly available CTA data from the Carotid Bifurcation Algorithm Evaluation Framework resulting in an average dice index of 89.2% with the ground truth. Application of the method to the complex vascular structure of a coronary artery tree in CTA and to MRI images were performed to show the versatility and flexibility of the proposed framework.

  3. Image segmentation and 3D visualization for MRI mammography

    NASA Astrophysics Data System (ADS)

    Li, Lihua; Chu, Yong; Salem, Angela F.; Clark, Robert A.

    2002-05-01

    MRI mammography has a number of advantages, including the tomographic, and therefore three-dimensional (3-D) nature, of the images. It allows the application of MRI mammography to breasts with dense tissue, post operative scarring, and silicon implants. However, due to the vast quantity of images and subtlety of difference in MR sequence, there is a need for reliable computer diagnosis to reduce the radiologist's workload. The purpose of this work was to develop automatic breast/tissue segmentation and visualization algorithms to aid physicians in detecting and observing abnormalities in breast. Two segmentation algorithms were developed: one for breast segmentation, the other for glandular tissue segmentation. In breast segmentation, the MRI image is first segmented using an adaptive growing clustering method. Two tracing algorithms were then developed to refine the breast air and chest wall boundaries of breast. The glandular tissue segmentation was performed using an adaptive thresholding method, in which the threshold value was spatially adaptive using a sliding window. The 3D visualization of the segmented 2D slices of MRI mammography was implemented under IDL environment. The breast and glandular tissue rendering, slicing and animation were displayed.

  4. Image segmentation and lightness perception.

    PubMed

    Anderson, Barton L; Winawer, Jonathan

    2005-03-01

    The perception of surface albedo (lightness) is one of the most basic aspects of visual awareness. It is well known that the apparent lightness of a target depends on the context in which it is embedded, but there is extensive debate about the computations and representations underlying perceived lightness. One view asserts that the visual system explicitly separates surface reflectance from the prevailing illumination and atmospheric conditions in which it is embedded, generating layered image representations. Some recent theory has challenged this view and asserted that the human visual system derives surface lightness without explicitly segmenting images into multiple layers. Here we present new lightness illusions--the largest reported to date--that unequivocally demonstrate the effect that layered image representations can have in lightness perception. We show that the computations that underlie the decomposition of luminance into multiple layers under conditions of transparency can induce dramatic lightness illusions, causing identical texture patches to appear either black or white. These results indicate that mechanisms involved in decomposing images into layered representations can play a decisive role in the perception of surface lightness. PMID:15744303

  5. Self-adaptive algorithm for segmenting skin regions

    NASA Astrophysics Data System (ADS)

    Kawulok, Michal; Kawulok, Jolanta; Nalepa, Jakub; Smolka, Bogdan

    2014-12-01

    In this paper, we introduce a new self-adaptive algorithm for segmenting human skin regions in color images. Skin detection and segmentation is an active research topic, and many solutions have been proposed so far, especially concerning skin tone modeling in various color spaces. Such models are used for pixel-based classification, but its accuracy is limited due to high variance and low specificity of human skin color. In many works, skin model adaptation and spatial analysis were reported to improve the final segmentation outcome; however, little attention has been paid so far to the possibilities of combining these two improvement directions. Our contribution lies in learning a local skin color model on the fly, which is subsequently applied to the image to determine the seeds for the spatial analysis. Furthermore, we also take advantage of textural features for computing local propagation costs that are used in the distance transform. The results of an extensive experimental study confirmed that the new method is highly competitive, especially for extracting the hand regions in color images.

  6. Hierarchical image segmentation for learning object priors

    SciTech Connect

    Prasad, Lakshman; Yang, Xingwei; Latecki, Longin J; Li, Nan

    2010-11-10

    The proposed segmentation approach naturally combines experience based and image based information. The experience based information is obtained by training a classifier for each object class. For a given test image, the result of each classifier is represented as a probability map. The final segmentation is obtained with a hierarchial image segmentation algorithm that considers both the probability maps and the image features such as color and edge strength. We also utilize image region hierarchy to obtain not only local but also semi-global features as input to the classifiers. Moreover, to get robust probability maps, we take into account the region context information by averaging the probability maps over different levels of the hierarchical segmentation algorithm. The obtained segmentation results are superior to the state-of-the-art supervised image segmentation algorithms.

  7. Image Segmentation Using Hierarchical Merge Tree

    NASA Astrophysics Data System (ADS)

    Liu, Ting; Seyedhosseini, Mojtaba; Tasdizen, Tolga

    2016-10-01

    This paper investigates one of the most fundamental computer vision problems: image segmentation. We propose a supervised hierarchical approach to object-independent image segmentation. Starting with over-segmenting superpixels, we use a tree structure to represent the hierarchy of region merging, by which we reduce the problem of segmenting image regions to finding a set of label assignment to tree nodes. We formulate the tree structure as a constrained conditional model to associate region merging with likelihoods predicted using an ensemble boundary classifier. Final segmentations can then be inferred by finding globally optimal solutions to the model efficiently. We also present an iterative training and testing algorithm that generates various tree structures and combines them to emphasize accurate boundaries by segmentation accumulation. Experiment results and comparisons with other very recent methods on six public data sets demonstrate that our approach achieves the state-of-the-art region accuracy and is very competitive in image segmentation without semantic priors.

  8. Three-dimensional CT image segmentation by volume growing

    NASA Astrophysics Data System (ADS)

    Zhu, Dongping; Conners, Richard W.; Araman, Philip A.

    1991-11-01

    The research reported in this paper is aimed at locating, identifying, and quantifying internal (anatomical or physiological) structures, by 3-D image segmentation. Computerized tomography (CT) images of an object are first processed on a slice-by-slice basis, generating a stack of image slices that have been smoothed and pre-segmented. The image smoothing operation is executed by a spatially adaptive filter, and the 2-D pre-segmentation is achieved by a thresholding process whereby each individual pixel in the input image space is consistently assigned a label, according to its CT number, i.e., the gray-level value. Given a sequence of pre-segmented images as 3-D input scene (a stack of image slices), the spatial connectivity that exists among neighboring image pixels is utilized in a volume growing process which generates a number of well-defined volumetric regions or image solides, each representing an individual anatomical or physiological structure in the input scene. The 3-D segmentation is implemented using a volume growing process so that the aspect of pixel spatial connectivity is incorporated into the image segmentation procedure. To initialize the volume growing process for each volumetric region in the input 3-D scene, a seed location for a region is defined and loaded into a queue data structure called seed queue. The volume growing process consists of a set of procedures that perform different operations on the volumetric data of a CT image sequence. Examples of experiment of the described system with CT image data of several hardwood logs are given to demonstrate usefulness and flexibility of this approach. This allows solutions to industrial web inspection, as well as to several problems in medical image analysis where low-level image segmentation plays an important role toward successful image interpretation tasks.

  9. Metric Learning for Hyperspectral Image Segmentation

    NASA Technical Reports Server (NTRS)

    Bue, Brian D.; Thompson, David R.; Gilmore, Martha S.; Castano, Rebecca

    2011-01-01

    We present a metric learning approach to improve the performance of unsupervised hyperspectral image segmentation. Unsupervised spatial segmentation can assist both user visualization and automatic recognition of surface features. Analysts can use spatially-continuous segments to decrease noise levels and/or localize feature boundaries. However, existing segmentation methods use tasks-agnostic measures of similarity. Here we learn task-specific similarity measures from training data, improving segment fidelity to classes of interest. Multiclass Linear Discriminate Analysis produces a linear transform that optimally separates a labeled set of training classes. The defines a distance metric that generalized to a new scenes, enabling graph-based segmentation that emphasizes key spectral features. We describe tests based on data from the Compact Reconnaissance Imaging Spectrometer (CRISM) in which learned metrics improve segment homogeneity with respect to mineralogical classes.

  10. Automatic segmentation of anterior segment optical coherence tomography images

    NASA Astrophysics Data System (ADS)

    Williams, Dominic; Zheng, Yalin; Bao, Fangjun; Elsheikh, Ahmed

    2013-05-01

    Optical coherence tomography (OCT) images can provide quantitative measurements of the eye's entire anterior segment. A new technique founded on a newly proposed level set-based shape prior segmentation model has been developed for automatic segmentation of the cornea's anterior and posterior boundaries. This technique comprises three major steps: removal of regions containing irrelevant structures and artifacts, estimation of the cornea's location using a thresholding technique, and application of the new level set-based shape prior segmentation model to improve segmentation. The performance of our technique is compared to previously developed methods for analysis of the cornea in 33 OCT images of normal eyes, whereby manual annotations are used as a reference standard. The new technique achieves much improved concordance than previous methods, with a mean Dice's similarity coefficient of >0.92. This demonstrates the technique's potential to provide accurate and reliable measurements of the anterior segment geometry, which is important for many applications, including the construction of representative numerical simulations of the eye's mechanical behavior.

  11. Automatic segmentation of anterior segment optical coherence tomography images.

    PubMed

    Williams, Dominic; Zheng, Yalin; Bao, Fangjun; Elsheikh, Ahmed

    2013-05-01

    Optical coherence tomography (OCT) images can provide quantitative measurements of the eye's entire anterior segment. A new technique founded on a newly proposed level set-based shape prior segmentation model has been developed for automatic segmentation of the cornea's anterior and posterior boundaries. This technique comprises three major steps: removal of regions containing irrelevant structures and artifacts, estimation of the cornea's location using a thresholding technique, and application of the new level set-based shape prior segmentation model to improve segmentation. The performance of our technique is compared to previously developed methods for analysis of the cornea in 33 OCT images of normal eyes, whereby manual annotations are used as a reference standard. The new technique achieves much improved concordance than previous methods, with a mean Dice's similarity coefficient of > 0.92. This demonstrates the technique's potential to provide accurate and reliable measurements of the anterior segment geometry, which is important for many applications, including the construction of representative numerical simulations of the eye's mechanical behavior. PMID:23640074

  12. Improving image segmentation by learning region affinities

    SciTech Connect

    Prasad, Lakshman; Yang, Xingwei; Latecki, Longin J

    2010-11-03

    We utilize the context information of other regions in hierarchical image segmentation to learn new regions affinities. It is well known that a single choice of quantization of an image space is highly unlikely to be a common optimal quantization level for all categories. Each level of quantization has its own benefits. Therefore, we utilize the hierarchical information among different quantizations as well as spatial proximity of their regions. The proposed affinity learning takes into account higher order relations among image regions, both local and long range relations, making it robust to instabilities and errors of the original, pairwise region affinities. Once the learnt affinities are obtained, we use a standard image segmentation algorithm to get the final segmentation. Moreover, the learnt affinities can be naturally unutilized in interactive segmentation. Experimental results on Berkeley Segmentation Dataset and MSRC Object Recognition Dataset are comparable and in some aspects better than the state-of-art methods.

  13. Feature encoding for color image segmentation

    NASA Astrophysics Data System (ADS)

    Li, Ning; Li, Youfu

    2001-09-01

    An approach for color image segmentation is proposed based on the contributions of color features to segmentation rather than the choice of a particular color space. It is different from the pervious methods where SOFM is used for construct the feature encoding so that the feature-encoding can self-organize the effective features for different color images. Fuzzy clustering is applied for the final segmentation when the well-suited color features and the initial parameter are available. The proposed method has been applied in segmenting different types of color images and the experimental results show that it outperforms the classical clustering method. Our study shows that the feature encoding approach offers great promise in automating and optimizing color image segmentation.

  14. Automatic setae segmentation from Chaetoceros microscopic images.

    PubMed

    Zheng, Haiyong; Zhao, Hongmiao; Sun, Xue; Gao, Huihui; Ji, Guangrong

    2014-09-01

    A novel image processing model Grayscale Surface Direction Angle Model (GSDAM) is presented and the algorithm based on GSDAM is developed to segment setae from Chaetoceros microscopic images. The proposed model combines the setae characteristics of the microscopic images with the spatial analysis of image grayscale surface to detect and segment the direction thin and long setae from the low contrast background as well as noise which may make the commonly used segmentation methods invalid. The experimental results show that our algorithm based on GSDAM outperforms the boundary-based and region-based segmentation methods Canny edge detector, iterative threshold selection, Otsu's thresholding, minimum error thresholding, K-means clustering, and marker-controlled watershed on the setae segmentation more accurately and completely. PMID:24913015

  15. Generalization of Hindi OCR Using Adaptive Segmentation and Font Files

    NASA Astrophysics Data System (ADS)

    Agrawal, Mudit; Ma, Huanfeng; Doermann, David

    In this chapter, we describe an adaptive Indic OCR system implemented as part of a rapidly retargetable language tool effort and extend work found in [20, 2]. The system includes script identification, character segmentation, training sample creation, and character recognition. For script identification, Hindi words are identified in bilingual or multilingual document images using features of the Devanagari script and support vector machine (SVM). Identified words are then segmented into individual characters, using a font-model-based intelligent character segmentation and recognition system. Using characteristics of structurally similar TrueType fonts, our system automatically builds a model to be used for the segmentation and recognition of the new script, independent of glyph composition. The key is a reliance on known font attributes. In our recognition system three feature extraction methods are used to demonstrate the importance of appropriate features for classification. The methods are tested on both Latin and non-Latin scripts. Results show that the character-level recognition accuracy exceeds 92% for non-Latin and 96% for Latin text on degraded documents. This work is a step toward the recognition of scripts of low-density languages which typically do not warrant the development of commercial OCR, yet often have complete TrueType font descriptions.

  16. Regression Segmentation for M³ Spinal Images.

    PubMed

    Wang, Zhijie; Zhen, Xiantong; Tay, KengYeow; Osman, Said; Romano, Walter; Li, Shuo

    2015-08-01

    Clinical routine often requires to analyze spinal images of multiple anatomic structures in multiple anatomic planes from multiple imaging modalities (M(3)). Unfortunately, existing methods for segmenting spinal images are still limited to one specific structure, in one specific plane or from one specific modality (S(3)). In this paper, we propose a novel approach, Regression Segmentation, that is for the first time able to segment M(3) spinal images in one single unified framework. This approach formulates the segmentation task innovatively as a boundary regression problem: modeling a highly nonlinear mapping function from substantially diverse M(3) images directly to desired object boundaries. Leveraging the advancement of sparse kernel machines, regression segmentation is fulfilled by a multi-dimensional support vector regressor (MSVR) which operates in an implicit, high dimensional feature space where M(3) diversity and specificity can be systematically categorized, extracted, and handled. The proposed regression segmentation approach was thoroughly tested on images from 113 clinical subjects including both disc and vertebral structures, in both sagittal and axial planes, and from both MRI and CT modalities. The overall result reaches a high dice similarity index (DSI) 0.912 and a low boundary distance (BD) 0.928 mm. With our unified and expendable framework, an efficient clinical tool for M(3) spinal image segmentation can be easily achieved, and will substantially benefit the diagnosis and treatment of spinal diseases.

  17. Adaptive Image Denoising by Mixture Adaptation

    NASA Astrophysics Data System (ADS)

    Luo, Enming; Chan, Stanley H.; Nguyen, Truong Q.

    2016-10-01

    We propose an adaptive learning procedure to learn patch-based image priors for image denoising. The new algorithm, called the Expectation-Maximization (EM) adaptation, takes a generic prior learned from a generic external database and adapts it to the noisy image to generate a specific prior. Different from existing methods that combine internal and external statistics in ad-hoc ways, the proposed algorithm is rigorously derived from a Bayesian hyper-prior perspective. There are two contributions of this paper: First, we provide full derivation of the EM adaptation algorithm and demonstrate methods to improve the computational complexity. Second, in the absence of the latent clean image, we show how EM adaptation can be modified based on pre-filtering. Experimental results show that the proposed adaptation algorithm yields consistently better denoising results than the one without adaptation and is superior to several state-of-the-art algorithms.

  18. Adaptive segmentation of wavelet transform coefficients for video compression

    NASA Astrophysics Data System (ADS)

    Wasilewski, Piotr

    2000-04-01

    This paper presents video compression algorithm suitable for inexpensive real-time hardware implementation. This algorithm utilizes Discrete Wavelet Transform (DWT) with the new Adaptive Spatial Segmentation Algorithm (ASSA). The algorithm was designed to obtain better or similar decompressed video quality in compare to H.263 recommendation and MPEG standard using lower computational effort, especially at high compression rates. The algorithm was optimized for hardware implementation in low-cost Field Programmable Gate Array (FPGA) devices. The luminance and chrominance components of every frame are encoded with 3-level Wavelet Transform with biorthogonal filters bank. The low frequency subimage is encoded with an ADPCM algorithm. For the high frequency subimages the new Adaptive Spatial Segmentation Algorithm is applied. It divides images into rectangular blocks that may overlap each other. The width and height of the blocks are set independently. There are two kinds of blocks: Low Variance Blocks (LVB) and High Variance Blocks (HVB). The positions of the blocks and the values of the WT coefficients belonging to the HVB are encoded with the modified zero-tree algorithms. LVB are encoded with the mean value. Obtained results show that presented algorithm gives similar or better quality of decompressed images in compare to H.263, even up to 5 dB in PSNR measure.

  19. An enhanced fast scanning algorithm for image segmentation

    NASA Astrophysics Data System (ADS)

    Ismael, Ahmed Naser; Yusof, Yuhanis binti

    2015-12-01

    Segmentation is an essential and important process that separates an image into regions that have similar characteristics or features. This will transform the image for a better image analysis and evaluation. An important benefit of segmentation is the identification of region of interest in a particular image. Various algorithms have been proposed for image segmentation and this includes the Fast Scanning algorithm which has been employed on food, sport and medical images. It scans all pixels in the image and cluster each pixel according to the upper and left neighbor pixels. The clustering process in Fast Scanning algorithm is performed by merging pixels with similar neighbor based on an identified threshold. Such an approach will lead to a weak reliability and shape matching of the produced segments. This paper proposes an adaptive threshold function to be used in the clustering process of the Fast Scanning algorithm. This function used the gray'value in the image's pixels and variance Also, the level of the image that is more the threshold are converted into intensity values between 0 and 1, and other values are converted into intensity values zero. The proposed enhanced Fast Scanning algorithm is realized on images of the public and private transportation in Iraq. Evaluation is later made by comparing the produced images of proposed algorithm and the standard Fast Scanning algorithm. The results showed that proposed algorithm is faster in terms the time from standard fast scanning.

  20. Hierarchical Image Segmentation Using Correlation Clustering.

    PubMed

    Alush, Amir; Goldberger, Jacob

    2016-06-01

    In this paper, we apply efficient implementations of integer linear programming to the problem of image segmentation. The image is first grouped into superpixels and then local information is extracted for each pair of spatially adjacent superpixels. Given local scores on a map of several hundred superpixels, we use correlation clustering to find the global segmentation that is most consistent with the local evidence. We show that, although correlation clustering is known to be NP-hard, finding the exact global solution is still feasible by breaking the segmentation problem down into subproblems. Each such sub-problem can be viewed as an automatically detected image part. We can further accelerate the process by using the cutting-plane method, which provides a hierarchical structure of the segmentations. The efficiency and improved performance of the proposed method is compared to several state-of-the-art methods and demonstrated on several standard segmentation data sets.

  1. Generalized nonconvex optimization for medical image segmentation

    NASA Astrophysics Data System (ADS)

    Mitra, Sunanda; Joshi, Sujit

    2000-06-01

    Design of a generalized technique for medical image segmentation is a challenging task. Currently a number of approaches are being investigated for 2-D and 3-D medical image segmentation for diagnostic and research applications. The methodology used in this work is aimed at obtaining a generalized solution of non-convex optimization problems by including a structural constraint of mass or density and the concept of additivity properties of entropy to a recently developed statistical approach to clustering and classification. The original computationally intensive procedure is made more efficient both in processing time and accuracy by employing a new similarity parameter for generating the initial clusters that are updated by minimizing an energy function relating the image entropy and expected distortion. The application of the computationally intensive yet generalized solution to nonconvex optimization to a limited set of medical images has resulted in excellent segmentation when compared to other clustering based segmentation approaches. The addition of the parametric approach to determine the initial number of clusters allows significant reduction in processing time and better design of automated segmentation procedure. This research work generalizes a deterministic annealing i.e. a specific statistical approach to solve nonconvex optimization problems by developing a more efficient technique applicable to nonconvex optimization problems (getting trapped in local minima). However, the DA approach is extremely computationally intensive for applications such as image segmentation. The new integrated approach developed in this work allows this optimization technique to be used for medical image segmentation.

  2. FISICO: Fast Image SegmentatIon COrrection

    PubMed Central

    Valenzuela, Waldo; Ferguson, Stephen J.; Ignasiak, Dominika; Diserens, Gaëlle; Häni, Levin; Wiest, Roland; Vermathen, Peter; Boesch, Chris

    2016-01-01

    Background and Purpose In clinical diagnosis, medical image segmentation plays a key role in the analysis of pathological regions. Despite advances in automatic and semi-automatic segmentation techniques, time-effective correction tools are commonly needed to improve segmentation results. Therefore, these tools must provide faster corrections with a lower number of interactions, and a user-independent solution to reduce the time frame between image acquisition and diagnosis. Methods We present a new interactive method for correcting image segmentations. Our method provides 3D shape corrections through 2D interactions. This approach enables an intuitive and natural corrections of 3D segmentation results. The developed method has been implemented into a software tool and has been evaluated for the task of lumbar muscle and knee joint segmentations from MR images. Results Experimental results show that full segmentation corrections could be performed within an average correction time of 5.5±3.3 minutes and an average of 56.5±33.1 user interactions, while maintaining the quality of the final segmentation result within an average Dice coefficient of 0.92±0.02 for both anatomies. In addition, for users with different levels of expertise, our method yields a correction time and number of interaction decrease from 38±19.2 minutes to 6.4±4.3 minutes, and 339±157.1 to 67.7±39.6 interactions, respectively. PMID:27224061

  3. Isoperimetric graph partitioning for image segmentation.

    PubMed

    Grady, Leo; Schwartz, Eric L

    2006-03-01

    Spectral graph partitioning provides a powerful approach to image segmentation. We introduce an alternate idea that finds partitions with a small isoperimetric constant, requiring solution to a linear system rather than an eigenvector problem. This approach produces the high quality segmentations of spectral methods, but with improved speed and stability.

  4. Convergent Coarseness Regulation for Segmented Images

    SciTech Connect

    Paglieroni, D W

    2004-05-27

    In segmentation of remotely sensed images, the number of pixel classes and their spectral representations are often unknown a priori. Even with prior knowledge, pixels with spectral components from multiple classes lead to classification errors and undesired small region artifacts. Coarseness regulation for segmented images is proposed as an efficient novel technique for handling these problems. Beginning with an over-segmented image, perceptually similar connected regions are iteratively merged using a method reminiscent of region growing, except the primitives are regions, not pixels. Interactive coarseness regulation is achieved by specifying the area {alpha} of the largest region eligible for merging. A region with area less than {alpha} is merged with the most spectrally similar connected region, unless the regions are perceived as spectrally dissimilar. In convergent coarseness regulation, which requires no user interaction, {alpha} is specified as the total number of pixels in the image, and the coarseness regulation output converges to a steady-state segmentation that remains unchanged as {alpha} is further increased. By applying convergent coarseness regulation to AVIRIS, IKONOS and DigitalGlobe images, and quantitatively comparing computer-generated segmentations to segmentations generated manually by a human analyst, it was found that the quality of the input segmentations was consistently and dramatically improved.

  5. A segmentation algorithm for noisy images

    SciTech Connect

    Xu, Y.; Olman, V.; Uberbacher, E.C.

    1996-12-31

    This paper presents a 2-D image segmentation algorithm and addresses issues related to its performance on noisy images. The algorithm segments an image by first constructing a minimum spanning tree representation of the image and then partitioning the spanning tree into sub-trees representing different homogeneous regions. The spanning tree is partitioned in such a way that the sum of gray-level variations over all partitioned subtrees is minimized under the constraints that each subtree has at least a specified number of pixels and two adjacent subtrees have significantly different ``average`` gray-levels. Two types of noise, transmission errors and Gaussian additive noise. are considered and their effects on the segmentation algorithm are studied. Evaluation results have shown that the segmentation algorithm is robust in the presence of these two types of noise.

  6. Cardiac image segmentation using spatiotemporal clustering

    NASA Astrophysics Data System (ADS)

    Galic, Sasa; Loncaric, Sven

    2001-07-01

    Image segmentation is an important and challenging problem in image analysis. Segmentation of moving objects in image sequences is even more difficult and computationally expensive. In this work we propose a technique for spatio- temporal segmentation of medical sequences based on K-mean clustering in the feature vector space. The motivation for spatio-temporalsegmentation approach comes from the fact that motion is a useful clue for object segmentation. Two- dimensional feature vector has been used for clustering in the feature space. In this paper we apply the proposed technique to segmentation of cardiac images. The first feature used in this particular application is image brightness, which reveals the structure of interest in the image. The second feature is the Euclidean norm of the optical flow vector. The third feature is the three- dimensional optical flow vector, which consists of computed motion in all three dimensions. The optical flow itself is computed using Horn-Schunck algorithm. The fourth feature is the mean brightness of the input image in a local neighborhood. By applying the clustering algorithm it is possible to detect moving object in the image sequence. The experiment has been conducted using a sequence of ECG-gated magnetic resonance (MR) images of a beating heart taken as in time so in the space.

  7. Variable-rate colour image quantization based on quadtree segmentation

    NASA Astrophysics Data System (ADS)

    Hu, Y. C.; Li, C. Y.; Chuang, J. C.; Lo, C. C.

    2011-09-01

    A novel variable-sized block encoding with threshold control for colour image quantization (CIQ) is presented in this paper. In CIQ, the colour palette used has a great influence on the reconstructed image quality. Typically, a higher image quality and a larger storage cost are obtained when a larger-sized palette is used in CIQ. To cut down the storage cost while preserving quality of the reconstructed images, the threshold control policy for quadtree segmentation is used in this paper. Experimental results show that the proposed method adaptively provides desired bit rates while having better image qualities comparing to CIQ with the usage of multiple palettes of different sizes.

  8. A summary of image segmentation techniques

    NASA Technical Reports Server (NTRS)

    Spirkovska, Lilly

    1993-01-01

    Machine vision systems are often considered to be composed of two subsystems: low-level vision and high-level vision. Low level vision consists primarily of image processing operations performed on the input image to produce another image with more favorable characteristics. These operations may yield images with reduced noise or cause certain features of the image to be emphasized (such as edges). High-level vision includes object recognition and, at the highest level, scene interpretation. The bridge between these two subsystems is the segmentation system. Through segmentation, the enhanced input image is mapped into a description involving regions with common features which can be used by the higher level vision tasks. There is no theory on image segmentation. Instead, image segmentation techniques are basically ad hoc and differ mostly in the way they emphasize one or more of the desired properties of an ideal segmenter and in the way they balance and compromise one desired property against another. These techniques can be categorized in a number of different groups including local vs. global, parallel vs. sequential, contextual vs. noncontextual, interactive vs. automatic. In this paper, we categorize the schemes into three main groups: pixel-based, edge-based, and region-based. Pixel-based segmentation schemes classify pixels based solely on their gray levels. Edge-based schemes first detect local discontinuities (edges) and then use that information to separate the image into regions. Finally, region-based schemes start with a seed pixel (or group of pixels) and then grow or split the seed until the original image is composed of only homogeneous regions. Because there are a number of survey papers available, we will not discuss all segmentation schemes. Rather than a survey, we take the approach of a detailed overview. We focus only on the more common approaches in order to give the reader a flavor for the variety of techniques available yet present enough

  9. Toward a generic evaluation of image segmentation.

    PubMed

    Cardoso, Jaime S; Corte-Real, Luís

    2005-11-01

    Image segmentation plays a major role in a broad range of applications. Evaluating the adequacy of a segmentation algorithm for a given application is a requisite both to allow the appropriate selection of segmentation algorithms as well as to tune their parameters for optimal performance. However, objective segmentation quality evaluation is far from being a solved problem. In this paper, a generic framework for segmentation evaluation is introduced after a brief review of previous work. A metric based on the distance between segmentation partitions is proposed to overcome some of the limitations of existing approaches. Symmetric and asymmetric distance metric alternatives are presented to meet the specificities of a wide class of applications. Experimental results confirm the potential of the proposed measures. PMID:16279178

  10. Improved Segmentation of White Matter Tracts with Adaptive Riemannian Metrics

    PubMed Central

    Hao, Xiang; Zygmunt, Kristen; Whitaker, Ross T.; Fletcher, P. Thomas

    2014-01-01

    We present a novel geodesic approach to segmentation of white matter tracts from diffusion tensor imaging (DTI). Compared to deterministic and stochastic tractography, geodesic approaches treat the geometry of the brain white matter as a manifold, often using the inverse tensor field as a Riemannian metric. The white matter pathways are then inferred from the resulting geodesics, which have the desirable property that they tend to follow the main eigenvectors of the tensors, yet still have the flexibility to deviate from these directions when it results in lower costs. While this makes such methods more robust to noise, the choice of Riemannian metric in these methods is ad hoc. A serious drawback of current geodesic methods is that geodesics tend to deviate from the major eigenvectors in high-curvature areas in order to achieve the shortest path. In this paper we propose a method for learning an adaptive Riemannian metric from the DTI data, where the resulting geodesics more closely follow the principal eigenvector of the diffusion tensors even in high-curvature regions. We also develop a way to automatically segment the white matter tracts based on the computed geodesics. We show the robustness of our method on simulated data with different noise levels. We also compare our method with tractography methods and geodesic approaches using other Riemannian metrics and demonstrate that the proposed method results in improved geodesics and segmentations using both synthetic and real DTI data. PMID:24211814

  11. Robust image modeling technique with a bioluminescence image segmentation application

    NASA Astrophysics Data System (ADS)

    Zhong, Jianghong; Wang, Ruiping; Tian, Jie

    2009-02-01

    A robust pattern classifier algorithm for the variable symmetric plane model, where the driving noise is a mixture of a Gaussian and an outlier process, is developed. The veracity and high-speed performance of the pattern recognition algorithm is proved. Bioluminescence tomography (BLT) has recently gained wide acceptance in the field of in vivo small animal molecular imaging. So that it is very important for BLT to how to acquire the highprecision region of interest in a bioluminescence image (BLI) in order to decrease loss of the customers because of inaccuracy in quantitative analysis. An algorithm in the mode is developed to improve operation speed, which estimates parameters and original image intensity simultaneously from the noise corrupted image derived from the BLT optical hardware system. The focus pixel value is obtained from the symmetric plane according to a more realistic assumption for the noise sequence in the restored image. The size of neighborhood is adaptive and small. What's more, the classifier function is base on the statistic features. If the qualifications for the classifier are satisfied, the focus pixel intensity is setup as the largest value in the neighborhood.Otherwise, it will be zeros.Finally,pseudo-color is added up to the result of the bioluminescence segmented image. The whole process has been implemented in our 2D BLT optical system platform and the model is proved.

  12. Review methods for image segmentation from computed tomography images

    SciTech Connect

    Mamat, Nurwahidah; Rahman, Wan Eny Zarina Wan Abdul; Soh, Shaharuddin Cik; Mahmud, Rozi

    2014-12-04

    Image segmentation is a challenging process in order to get the accuracy of segmentation, automation and robustness especially in medical images. There exist many segmentation methods that can be implemented to medical images but not all methods are suitable. For the medical purposes, the aims of image segmentation are to study the anatomical structure, identify the region of interest, measure tissue volume to measure growth of tumor and help in treatment planning prior to radiation therapy. In this paper, we present a review method for segmentation purposes using Computed Tomography (CT) images. CT images has their own characteristics that affect the ability to visualize anatomic structures and pathologic features such as blurring of the image and visual noise. The details about the methods, the goodness and the problem incurred in the methods will be defined and explained. It is necessary to know the suitable segmentation method in order to get accurate segmentation. This paper can be a guide to researcher to choose the suitable segmentation method especially in segmenting the images from CT scan.

  13. Fully automatic segmentation of complex organ systems: example of trachea, esophagus and heart segmentation in CT images

    NASA Astrophysics Data System (ADS)

    Meyer, Carsten; Peters, Jochen; Weese, Jürgen

    2011-03-01

    Automatic segmentation is a prerequisite to efficiently analyze the large amount of image data produced by modern imaging modalities. Many algorithms exist to segment individual organs or organ systems. However, new clinical applications and the progress in imaging technology will require the segmentation of more and more complex organ systems composed of a number of substructures, e.g., the heart, the trachea, and the esophagus. The goal of this work is to demonstrate that such complex organ systems can be successfully segmented by integrating the individual organs into a general model-based segmentation framework, without tailoring the core adaptation engine to the individual organs. As an example, we address the fully automatic segmentation of the trachea (around its main bifurcation, including the proximal part of the two main bronchi) and the esophagus in addition to the heart with all chambers and attached major vessels. To this end, we integrate the trachea and the esophagus into a model-based cardiac segmentation framework. Specifically, in a first parametric adaptation step of the segmentation workflow, the trachea and the esophagus share global model transformations with adjacent heart structures. This allows to obtain a robust, approximate segmentation for the trachea even if it is only partly inside the field-of-view, and for the esophagus in spite of limited contrast. The segmentation is then refined in a subsequent deformable adaptation step. We obtained a mean segmentation error of about 0.6mm for the trachea and 2.3mm for the esophagus on a database of 23 volumetric cardiovascular CT images. Furthermore, we show by quantitative evaluation that our integrated framework outperforms individual esophagus segmentation, and individual trachea segmentation if the trachea is only partly inside the field-of-view.

  14. An adaptive level set segmentation on a triangulated mesh.

    PubMed

    Xu, Meihe; Thompson, Paul M; Toga, Arthur W

    2004-02-01

    Level set methods offer highly robust and accurate methods for detecting interfaces of complex structures. Efficient techniques are required to transform an interface to a globally defined level set function. In this paper, a novel level set method based on an adaptive triangular mesh is proposed for segmentation of medical images. Special attention is paid to an adaptive mesh refinement and redistancing technique for level set propagation, in order to achieve higher resolution at the interface with minimum expense. First, a narrow band around the interface is built in an upwind fashion. An active square technique is used to determine the shortest distance correspondence (SDC) for each grid vertex. Simultaneously, we also give an efficient approach for signing the distance field. Then, an adaptive improvement algorithm is proposed, which essentially combines two basic techniques: a long-edge-based vertex insertion strategy, and a local improvement. These guarantee that the refined triangulation is related to features along the front and has elements with appropriate size and shape, which fit the front well. We propose a short-edge elimination scheme to coarsen the refined triangular mesh, in order to reduce the extra storage. Finally, we reformulate the general evolution equation by updating 1) the velocities and 2) the gradient of level sets on the triangulated mesh. We give an approach for tracing contours from the level set on the triangulated mesh. Given a two-dimensional image with N grids along a side, the proposed algorithms run in O(kN) time at each iteration. Quantitative analysis shows that our algorithm is of first order accuracy; and when the interface-fitted property is involved in the mesh refinement, both the convergence speed and numerical accuracy are greatly improved. We also analyze the effect of redistancing frequency upon convergence speed and accuracy. Numerical examples include the extraction of inner and outer surfaces of the cerebral cortex

  15. Hyperspectral image segmentation using a cooperative nonparametric approach

    NASA Astrophysics Data System (ADS)

    Taher, Akar; Chehdi, Kacem; Cariou, Claude

    2013-10-01

    In this paper a new unsupervised nonparametric cooperative and adaptive hyperspectral image segmentation approach is presented. The hyperspectral images are partitioned band by band in parallel and intermediate classification results are evaluated and fused, to get the final segmentation result. Two unsupervised nonparametric segmentation methods are used in parallel cooperation, namely the Fuzzy C-means (FCM) method, and the Linde-Buzo-Gray (LBG) algorithm, to segment each band of the image. The originality of the approach relies firstly on its local adaptation to the type of regions in an image (textured, non-textured), and secondly on the introduction of several levels of evaluation and validation of intermediate segmentation results before obtaining the final partitioning of the image. For the management of similar or conflicting results issued from the two classification methods, we gradually introduced various assessment steps that exploit the information of each spectral band and its adjacent bands, and finally the information of all the spectral bands. In our approach, the detected textured and non-textured regions are treated separately from feature extraction step, up to the final classification results. This approach was first evaluated on a large number of monocomponent images constructed from the Brodatz album. Then it was evaluated on two real applications using a respectively multispectral image for Cedar trees detection in the region of Baabdat (Lebanon) and a hyperspectral image for identification of invasive and non invasive vegetation in the region of Cieza (Spain). A correct classification rate (CCR) for the first application is over 97% and for the second application the average correct classification rate (ACCR) is over 99%.

  16. Simplified labeling process for medical image segmentation.

    PubMed

    Gao, Mingchen; Huang, Junzhou; Huang, Xiaolei; Zhang, Shaoting; Metaxas, Dimitris N

    2012-01-01

    Image segmentation plays a crucial role in many medical imaging applications by automatically locating the regions of interest. Typically supervised learning based segmentation methods require a large set of accurately labeled training data. However, thel labeling process is tedious, time consuming and sometimes not necessary. We propose a robust logistic regression algorithm to handle label outliers such that doctors do not need to waste time on precisely labeling images for training set. To validate its effectiveness and efficiency, we conduct carefully designed experiments on cervigram image segmentation while there exist label outliers. Experimental results show that the proposed robust logistic regression algorithms achieve superior performance compared to previous methods, which validates the benefits of the proposed algorithms. PMID:23286072

  17. [Medical image automatic adjusting window and segmentation].

    PubMed

    Zhou, Zhenhuan; Chen, Siping; Tao, Duchun; Chen, Xinhai

    2005-04-01

    Image guided surgical navigation system is the most advanced surgical apparatus, which develops most rapidly and has great application prospects in neurosurgery, orthopaedics, E.N.T. department etc. In current surgical navigation systems, windowing, segmenting and registration of medical images all depend on manual operation, and automation of image processing is urgently needed. This paper proposes the algorithm which realizes very well automatic windowing and segmentation of medical images: first, we analyze a lot of MRI and CT images and propose corresponding windowing algorithm according to their common features of intensity distribution. Experiments show that the effects of windowing of most MRI and CT images are optimized. Second, we propose the seed growing algorithm based on intensity connectivity,which can segment tumor and its boundary exactly by simply clicking the mouse, and control dynamically the results in real time. If computer memory permits, the algorithm can segment 3D images directly. Tests show that this function is able to shorten the time of surgical planning, lower the complexity, and improve the efficiency in navigation surgery. PMID:15884547

  18. Space Adaptation of Active Mirror Segment Concepts

    NASA Technical Reports Server (NTRS)

    Ames, Gregory H.

    1999-01-01

    This report summarizes the results of a three year effort by Blue Line Engineering Co. to advance the state of segmented mirror systems in several separate but related areas. The initial set of tasks were designed to address the issues of system level architecture, digital processing system, cluster level support structures, and advanced mirror fabrication concepts. Later in the project new tasks were added to provide support to the existing segmented mirror testbed at Marshall Space Flight Center (MSFC) in the form of upgrades to the 36 subaperture wavefront sensor. Still later, tasks were added to build and install a new system processor based on the results of the new system architecture. The project was successful in achieving a number of important results. These include the following most notable accomplishments: 1) The creation of a new modular digital processing system that is extremely capable and may be applied to a wide range of segmented mirror systems as well as many classes of Multiple Input Multiple Output (MIMO) control systems such as active structures or industrial automation. 2) A new graphical user interface was created for operation of segmented mirror systems. 3) The development of a high bit rate serial data loop that permits bi-directional flow of data to and from as many as 39 segments daisy-chained to form a single cluster of segments. 4) Upgrade of the 36 subaperture Hartmann type Wave Front Sensor (WFS) of the Phased Array Mirror, Extendible Large Aperture (PAMELA) testbed at MSFC resulting in a 40 to 5OX improvement in SNR which in turn enabled NASA personnel to achieve many significant strides in improved closed-loop system operation in 1998. 5) A new system level processor was built and delivered to MSFC for use with the PAMELA testbed. This new system featured a new graphical user interface to replace the obsolete and non-supported menu system originally delivered with the PAMELA system. The hardware featured Blue Line's new stackable

  19. MBIS: multivariate Bayesian image segmentation tool.

    PubMed

    Esteban, Oscar; Wollny, Gert; Gorthi, Subrahmanyam; Ledesma-Carbayo, María-J; Thiran, Jean-Philippe; Santos, Andrés; Bach-Cuadra, Meritxell

    2014-07-01

    We present MBIS (Multivariate Bayesian Image Segmentation tool), a clustering tool based on the mixture of multivariate normal distributions model. MBIS supports multichannel bias field correction based on a B-spline model. A second methodological novelty is the inclusion of graph-cuts optimization for the stationary anisotropic hidden Markov random field model. Along with MBIS, we release an evaluation framework that contains three different experiments on multi-site data. We first validate the accuracy of segmentation and the estimated bias field for each channel. MBIS outperforms a widely used segmentation tool in a cross-comparison evaluation. The second experiment demonstrates the robustness of results on atlas-free segmentation of two image sets from scan-rescan protocols on 21 healthy subjects. Multivariate segmentation is more replicable than the monospectral counterpart on T1-weighted images. Finally, we provide a third experiment to illustrate how MBIS can be used in a large-scale study of tissue volume change with increasing age in 584 healthy subjects. This last result is meaningful as multivariate segmentation performs robustly without the need for prior knowledge.

  20. Building Roof Segmentation from Aerial Images Using a Line-and Region-Based Watershed Segmentation Technique

    PubMed Central

    Merabet, Youssef El; Meurie, Cyril; Ruichek, Yassine; Sbihi, Abderrahmane; Touahni, Raja

    2015-01-01

    In this paper, we present a novel strategy for roof segmentation from aerial images (orthophotoplans) based on the cooperation of edge- and region-based segmentation methods. The proposed strategy is composed of three major steps. The first one, called the pre-processing step, consists of simplifying the acquired image with an appropriate couple of invariant and gradient, optimized for the application, in order to limit illumination changes (shadows, brightness, etc.) affecting the images. The second step is composed of two main parallel treatments: on the one hand, the simplified image is segmented by watershed regions. Even if the first segmentation of this step provides good results in general, the image is often over-segmented. To alleviate this problem, an efficient region merging strategy adapted to the orthophotoplan particularities, with a 2D modeling of roof ridges technique, is applied. On the other hand, the simplified image is segmented by watershed lines. The third step consists of integrating both watershed segmentation strategies into a single cooperative segmentation scheme in order to achieve satisfactory segmentation results. Tests have been performed on orthophotoplans containing 100 roofs with varying complexity, and the results are evaluated with the VINETcriterion using ground-truth image segmentation. A comparison with five popular segmentation techniques of the literature demonstrates the effectiveness and the reliability of the proposed approach. Indeed, we obtain a good segmentation rate of 96% with the proposed method compared to 87.5% with statistical region merging (SRM), 84% with mean shift, 82% with color structure code (CSC), 80% with efficient graph-based segmentation algorithm (EGBIS) and 71% with JSEG. PMID:25648706

  1. OCT image segmentation of the prostate nerves

    NASA Astrophysics Data System (ADS)

    Chitchian, Shahab; Weldon, Thomas P.; Fried, Nathaniel M.

    2009-08-01

    The cavernous nerves course along the surface of the prostate and are responsible for erectile function. Improvements in identification, imaging, and visualization of the cavernous nerves during prostate cancer surgery may improve nerve preservation and postoperative sexual potency. In this study, 2-D OCT images of the rat prostate were segmented to differentiate the cavernous nerves from the prostate gland. Three image features were employed: Gabor filter, Daubechies wavelet, and Laws filter. The features were segmented using a nearestneighbor classifier. N-ary morphological post-processing was used to remove small voids. The cavernous nerves were differentiated from the prostate gland with a segmentation error rate of only 0.058 +/- 0.019.

  2. Computer Based Melanocytic and Nevus Image Enhancement and Segmentation

    PubMed Central

    Jamil, Uzma; Khalid, Shehzad; Abbas, Sarmad; Saleem, Kashif

    2016-01-01

    Digital dermoscopy aids dermatologists in monitoring potentially cancerous skin lesions. Melanoma is the 5th common form of skin cancer that is rare but the most dangerous. Melanoma is curable if it is detected at an early stage. Automated segmentation of cancerous lesion from normal skin is the most critical yet tricky part in computerized lesion detection and classification. The effectiveness and accuracy of lesion classification are critically dependent on the quality of lesion segmentation. In this paper, we have proposed a novel approach that can automatically preprocess the image and then segment the lesion. The system filters unwanted artifacts including hairs, gel, bubbles, and specular reflection. A novel approach is presented using the concept of wavelets for detection and inpainting the hairs present in the cancer images. The contrast of lesion with the skin is enhanced using adaptive sigmoidal function that takes care of the localized intensity distribution within a given lesion's images. We then present a segmentation approach to precisely segment the lesion from the background. The proposed approach is tested on the European database of dermoscopic images. Results are compared with the competitors to demonstrate the superiority of the suggested approach. PMID:27774454

  3. Hierarchical Segmentation Enhances Diagnostic Imaging

    NASA Technical Reports Server (NTRS)

    2007-01-01

    Bartron Medical Imaging LLC (BMI), of New Haven, Connecticut, gained a nonexclusive license from Goddard Space Flight Center to use the RHSEG software in medical imaging. To manage image data, BMI then licensed two pattern-matching software programs from NASA's Jet Propulsion Laboratory that were used in image analysis and three data-mining and edge-detection programs from Kennedy Space Center. More recently, BMI made NASA history by being the first company to partner with the Space Agency through a Cooperative Research and Development Agreement to develop a 3-D version of RHSEG. With U.S. Food and Drug Administration clearance, BMI will sell its Med-Seg imaging system with the 2-D version of the RHSEG software to analyze medical imagery from CAT and PET scans, MRI, ultrasound, digitized X-rays, digitized mammographies, dental X-rays, soft tissue analyses, moving object analyses, and soft-tissue slides such as Pap smears for the diagnoses and management of diseases. Extending the software's capabilities to three dimensions will eventually enable production of pixel-level views of a tumor or lesion, early identification of plaque build-up in arteries, and identification of density levels of microcalcification in mammographies.

  4. Simultaneous registration and segmentation of images in wavelet domain

    NASA Astrophysics Data System (ADS)

    Yoshida, Hiroyuki

    1999-10-01

    A novel method for simultaneous registration and segmentation is developed. The method is designed to register two similar images while a region with significant difference is adaptively segmented. This is achieved by minimization of a non-linear functional that models the statistical properties of the subtraction of the two images. Minimization is performed in the wavelet domain by a coarse- to-fine approach to yield a mapping that yields the registration and the boundary that yields the segmentation. The new method was applied to the registration of the left and the right lung regions in chest radiographs for extraction of lung nodules while the normal anatomic structures such as ribs are removed. A preliminary result shows that our method is very effective in reducing the number of false detections obtained with our computer-aided diagnosis scheme for detection of lung nodules in chest radiographs.

  5. A statistically based flow for image segmentation.

    PubMed

    Pichon, Eric; Tannenbaum, Allen; Kikinis, Ron

    2004-09-01

    In this paper we present a new algorithm for 3D medical image segmentation. The algorithm is versatile, fast, relatively simple to implement, and semi-automatic. It is based on minimizing a global energy defined from a learned non-parametric estimation of the statistics of the region to be segmented. Implementation details are discussed and source code is freely available as part of the 3D Slicer project. In addition, a new unified set of validation metrics is proposed. Results on artificial and real MRI images show that the algorithm performs well on large brain structures both in terms of accuracy and robustness to noise. PMID:15450221

  6. Combination strategies in multi-atlas image segmentation: application to brain MR data.

    PubMed

    Artaechevarria, Xabier; Munoz-Barrutia, Arrate; Ortiz-de-Solorzano, Carlos

    2009-08-01

    It has been shown that employing multiple atlas images improves segmentation accuracy in atlas-based medical image segmentation. Each atlas image is registered to the target image independently and the calculated transformation is applied to the segmentation of the atlas image to obtain a segmented version of the target image. Several independent candidate segmentations result from the process, which must be somehow combined into a single final segmentation. Majority voting is the generally used rule to fuse the segmentations, but more sophisticated methods have also been proposed. In this paper, we show that the use of global weights to ponderate candidate segmentations has a major limitation. As a means to improve segmentation accuracy, we propose the generalized local weighting voting method. Namely, the fusion weights adapt voxel-by-voxel according to a local estimation of segmentation performance. Using digital phantoms and MR images of the human brain, we demonstrate that the performance of each combination technique depends on the gray level contrast characteristics of the segmented region, and that no fusion method yields better results than the others for all the regions. In particular, we show that local combination strategies outperform global methods in segmenting high-contrast structures, while global techniques are less sensitive to noise when contrast between neighboring structures is low. We conclude that, in order to achieve the highest overall segmentation accuracy, the best combination method for each particular structure must be selected. PMID:19228554

  7. Real-Time Adaptive Color Segmentation by Neural Networks

    NASA Technical Reports Server (NTRS)

    Duong, Tuan A.

    2004-01-01

    Artificial neural networks that would utilize the cascade error projection (CEP) algorithm have been proposed as means of autonomous, real-time, adaptive color segmentation of images that change with time. In the original intended application, such a neural network would be used to analyze digitized color video images of terrain on a remote planet as viewed from an uninhabited spacecraft approaching the planet. During descent toward the surface of the planet, information on the segmentation of the images into differently colored areas would be updated adaptively in real time to capture changes in contrast, brightness, and resolution, all in an effort to identify a safe and scientifically productive landing site and provide control feedback to steer the spacecraft toward that site. Potential terrestrial applications include monitoring images of crops to detect insect invasions and monitoring of buildings and other facilities to detect intruders. The CEP algorithm is reliable and is well suited to implementation in very-large-scale integrated (VLSI) circuitry. It was chosen over other neural-network learning algorithms because it is better suited to realtime learning: It provides a self-evolving neural-network structure, requires fewer iterations to converge and is more tolerant to low resolution (that is, fewer bits) in the quantization of neural-network synaptic weights. Consequently, a CEP neural network learns relatively quickly, and the circuitry needed to implement it is relatively simple. Like other neural networks, a CEP neural network includes an input layer, hidden units, and output units (see figure). As in other neural networks, a CEP network is presented with a succession of input training patterns, giving rise to a set of outputs that are compared with the desired outputs. Also as in other neural networks, the synaptic weights are updated iteratively in an effort to bring the outputs closer to target values. A distinctive feature of the CEP neural

  8. Automated segmentation of three-dimensional MR brain images

    NASA Astrophysics Data System (ADS)

    Park, Jonggeun; Baek, Byungjun; Ahn, Choong-Il; Ku, Kyo Bum; Jeong, Dong Kyun; Lee, Chulhee

    2006-03-01

    Brain segmentation is a challenging problem due to the complexity of the brain. In this paper, we propose an automated brain segmentation method for 3D magnetic resonance (MR) brain images which are represented as a sequence of 2D brain images. The proposed method consists of three steps: pre-processing, removal of non-brain regions (e.g., the skull, meninges, other organs, etc), and spinal cord restoration. In pre-processing, we perform adaptive thresholding which takes into account variable intensities of MR brain images corresponding to various image acquisition conditions. In segmentation process, we iteratively apply 2D morphological operations and masking for the sequences of 2D sagittal, coronal, and axial planes in order to remove non-brain tissues. Next, final 3D brain regions are obtained by applying OR operation for segmentation results of three planes. Finally we reconstruct the spinal cord truncated during the previous processes. Experiments are performed with fifteen 3D MR brain image sets with 8-bit gray-scale. Experiment results show the proposed algorithm is fast, and provides robust and satisfactory results.

  9. Adaptive wiener image restoration kernel

    DOEpatents

    Yuan, Ding

    2007-06-05

    A method and device for restoration of electro-optical image data using an adaptive Wiener filter begins with constructing imaging system Optical Transfer Function, and the Fourier Transformations of the noise and the image. A spatial representation of the imaged object is restored by spatial convolution of the image using a Wiener restoration kernel.

  10. Multiple LREK active contours for knee meniscus ultrasound image segmentation.

    PubMed

    Faisal, Amir; Ng, Siew-Cheok; Goh, Siew-Li; George, John; Supriyanto, Eko; Lai, Khin W

    2015-10-01

    Quantification of knee meniscus degeneration and displacement in an ultrasound image requires simultaneous segmentation of femoral condyle, meniscus, and tibial plateau in order to determine the area and the position of the meniscus. In this paper, we present an active contour for image segmentation that uses scalable local regional information on expandable kernel (LREK). It includes using a strategy to adapt the size of a local window in order to avoid being confined locally in a homogeneous region during the segmentation process. We also provide a multiple active contours framework called multiple LREK (MLREK) to deal with multiple object segmentation without merging and overlapping between the neighboring contours in the shared boundaries of separate regions. We compare its performance to other existing active contour models and show an improvement offered by our model. We then investigate the choice of various parameters in the proposed framework in response to the segmentation outcome. Dice coefficient and Hausdorff distance measures over a set of real knee meniscus ultrasound images indicate a potential application of MLREK for assessment of knee meniscus degeneration and displacement. PMID:25910057

  11. Color Image Segmentation in a Quaternion Framework

    PubMed Central

    Subakan, Özlem N.; Vemuri, Baba C.

    2010-01-01

    In this paper, we present a feature/detail preserving color image segmentation framework using Hamiltonian quaternions. First, we introduce a novel Quaternionic Gabor Filter (QGF) which can combine the color channels and the orientations in the image plane. Using the QGFs, we extract the local orientation information in the color images. Second, in order to model this derived orientation information, we propose a continuous mixture of appropriate hypercomplex exponential basis functions. We derive a closed form solution for this continuous mixture model. This analytic solution is in the form of a spatially varying kernel which, when convolved with the signed distance function of an evolving contour (placed in the color image), yields a detail preserving segmentation. PMID:21243101

  12. Multiresolution segmentation technique for spine MRI images

    NASA Astrophysics Data System (ADS)

    Li, Haiyun; Yan, Chye H.; Ong, Sim Heng; Chui, Cheekong K.; Teoh, Swee H.

    2002-05-01

    In this paper, we describe a hybrid method for segmentation of spinal magnetic resonance imaging that has been developed based on the natural phenomenon of stones appearing as water recedes. The candidate segmentation region corresponds to the stones with characteristics similar to that of intensity extrema, edges, intensity ridge and grey-level blobs. The segmentation method is implemented based on a combination of wavelet multiresolution decomposition and fuzzy clustering. First thresholding is performed dynamically according to local characteristic to detect possible target areas, We then use fuzzy c-means clustering in concert with wavelet multiscale edge detection to identify the maximum likelihood anatomical and functional target areas. Fuzzy C-Means uses iterative optimization of an objective function based on a weighted similarity measure between the pixels in the image and each of c cluster centers. Local extrema of this objective function are indicative of an optimal clustering of the input data. The multiscale edges can be detected and characterized from local maxima of the modulus of the wavelet transform while the noise can be reduced to some extent by enacting thresholds. The method provides an efficient and robust algorithm for spinal image segmentation. Examples are presented to demonstrate the efficiency of the technique on some spinal MRI images.

  13. Estimation of generalized mixtures and its application in image segmentation.

    PubMed

    Delignon, Y; Marzouki, A; Pieczynski, W

    1997-01-01

    We introduce the notion of a generalized mixture and propose some methods for estimating it, along with applications to unsupervised statistical image segmentation. A distribution mixture is said to be "generalized" when the exact nature of the components is not known, but each belongs to a finite known set of families of distributions. For instance, we can consider a mixture of three distributions, each being exponential or Gaussian. The problem of estimating such a mixture contains thus a new difficulty: we have to label each of three components (there are eight possibilities). We show that the classical mixture estimation algorithms-expectation-maximization (EM), stochastic EM (SEM), and iterative conditional estimation (ICE)-can be adapted to such situations once as we dispose of a method of recognition of each component separately. That is, when we know that a sample proceeds from one family of the set considered, we have a decision rule for what family it belongs to. Considering the Pearson system, which is a set of eight families, the decision rule above is defined by the use of "skewness" and "kurtosis". The different algorithms so obtained are then applied to the problem of unsupervised Bayesian image segmentation, We propose the adaptive versions of SEM, EM, and ICE in the case of "blind", i.e., "pixel by pixel", segmentation. "Global" segmentation methods require modeling by hidden random Markov fields, and we propose adaptations of two traditional parameter estimation algorithms: Gibbsian EM (GEM) and ICE allowing the estimation of generalized mixtures corresponding to Pearson's system. The efficiency of different methods is compared via numerical studies, and the results of unsupervised segmentation of three real radar images by different methods are presented.

  14. Adaptive local multi-atlas segmentation: application to the heart and the caudate nucleus.

    PubMed

    van Rikxoort, Eva M; Isgum, Ivana; Arzhaeva, Yulia; Staring, Marius; Klein, Stefan; Viergever, Max A; Pluim, Josien P W; van Ginneken, Bram

    2010-02-01

    Atlas-based segmentation is a powerful generic technique for automatic delineation of structures in volumetric images. Several studies have shown that multi-atlas segmentation methods outperform schemes that use only a single atlas, but running multiple registrations on volumetric data is time-consuming. Moreover, for many scans or regions within scans, a large number of atlases may not be required to achieve good segmentation performance and may even deteriorate the results. It would therefore be worthwhile to include the decision which and how many atlases to use for a particular target scan in the segmentation process. To this end, we propose two generally applicable multi-atlas segmentation methods, adaptive multi-atlas segmentation (AMAS) and adaptive local multi-atlas segmentation (ALMAS). AMAS automatically selects the most appropriate atlases for a target image and automatically stops registering atlases when no further improvement is expected. ALMAS takes this concept one step further by locally deciding how many and which atlases are needed to segment a target image. The methods employ a computationally cheap atlas selection strategy, an automatic stopping criterion, and a technique to locally inspect registration results and determine how much improvement can be expected from further registrations. AMAS and ALMAS were applied to segmentation of the heart in computed tomography scans of the chest and compared to a conventional multi-atlas method (MAS). The results show that ALMAS achieves the same performance as MAS at a much lower computational cost. When the available segmentation time is fixed, both AMAS and ALMAS perform significantly better than MAS. In addition, AMAS was applied to an online segmentation challenge for delineation of the caudate nucleus in brain MRI scans where it achieved the best score of all results submitted to date.

  15. Automatic lumen segmentation in IVOCT images using binary morphological reconstruction

    PubMed Central

    2013-01-01

    Background Atherosclerosis causes millions of deaths, annually yielding billions in expenses round the world. Intravascular Optical Coherence Tomography (IVOCT) is a medical imaging modality, which displays high resolution images of coronary cross-section. Nonetheless, quantitative information can only be obtained with segmentation; consequently, more adequate diagnostics, therapies and interventions can be provided. Since it is a relatively new modality, many different segmentation methods, available in the literature for other modalities, could be successfully applied to IVOCT images, improving accuracies and uses. Method An automatic lumen segmentation approach, based on Wavelet Transform and Mathematical Morphology, is presented. The methodology is divided into three main parts. First, the preprocessing stage attenuates and enhances undesirable and important information, respectively. Second, in the feature extraction block, wavelet is associated with an adapted version of Otsu threshold; hence, tissue information is discriminated and binarized. Finally, binary morphological reconstruction improves the binary information and constructs the binary lumen object. Results The evaluation was carried out by segmenting 290 challenging images from human and pig coronaries, and rabbit iliac arteries; the outcomes were compared with the gold standards made by experts. The resultant accuracy was obtained: True Positive (%) = 99.29 ± 2.96, False Positive (%) = 3.69 ± 2.88, False Negative (%) = 0.71 ± 2.96, Max False Positive Distance (mm) = 0.1 ± 0.07, Max False Negative Distance (mm) = 0.06 ± 0.1. Conclusions In conclusion, by segmenting a number of IVOCT images with various features, the proposed technique showed to be robust and more accurate than published studies; in addition, the method is completely automatic, providing a new tool for IVOCT segmentation. PMID:23937790

  16. Locally adaptive MR intensity models and MRF-based segmentation of multiple sclerosis lesions

    NASA Astrophysics Data System (ADS)

    Galimzianova, Alfiia; Lesjak, Žiga; Likar, Boštjan; Pernuš, Franjo; Špiclin, Žiga

    2015-03-01

    Neuroimaging biomarkers are an important paraclinical tool used to characterize a number of neurological diseases, however, their extraction requires accurate and reliable segmentation of normal and pathological brain structures. For MR images of healthy brains the intensity models of normal-appearing brain tissue (NABT) in combination with Markov random field (MRF) models are known to give reliable and smooth NABT segmentation. However, the presence of pathology, MR intensity bias and natural tissue-dependent intensity variability altogether represent difficult challenges for a reliable estimation of NABT intensity model based on MR images. In this paper, we propose a novel method for segmentation of normal and pathological structures in brain MR images of multiple sclerosis (MS) patients that is based on locally-adaptive NABT model, a robust method for the estimation of model parameters and a MRF-based segmentation framework. Experiments on multi-sequence brain MR images of 27 MS patients show that, compared to whole-brain model and compared to the widely used Expectation-Maximization Segmentation (EMS) method, the locally-adaptive NABT model increases the accuracy of MS lesion segmentation.

  17. Segmentation of prostate cancer tissue microarray images

    NASA Astrophysics Data System (ADS)

    Cline, Harvey E.; Can, Ali; Padfield, Dirk

    2006-02-01

    Prostate cancer is diagnosed by histopathology interpretation of hematoxylin and eosin (H and E)-stained tissue sections. Gland and nuclei distributions vary with the disease grade. The morphological features vary with the advance of cancer where the epithelial regions grow into the stroma. An efficient pathology slide image analysis method involved using a tissue microarray with known disease stages. Digital 24-bit RGB images were acquired for each tissue element on the slide with both 10X and 40X objectives. Initial segmentation at low magnification was accomplished using prior spectral characteristics from a training tissue set composed of four tissue clusters; namely, glands, epithelia, stroma and nuclei. The segmentation method was automated by using the training RGB values as an initial guess and iterating the averaging process 10 times to find the four cluster centers. Labels were assigned to the nearest cluster center in red-blue spectral feature space. An automatic threshold algorithm separated the glands from the tissue. A visual pseudo color representation of 60 segmented tissue microarray image was generated where white, pink, red, blue colors represent glands, epithelia, stroma and nuclei, respectively. The higher magnification images provided refined nuclei morphology. The nuclei were detected with a RGB color space principle component analysis that resulted in a grey scale image. The shape metrics such as compactness, elongation, minimum and maximum diameters were calculated based on the eigenvalues of the best-fitting ellipses to the nuclei.

  18. Hepatic lesions segmentation in ultrasound nonlinear imaging

    NASA Astrophysics Data System (ADS)

    Kissi, Adelaide A.; Cormier, Stephane; Pourcelot, Leandre; Tranquart, Francois

    2005-04-01

    Doppler has been used for many years for cardiovascular exploration in order to visualize the vessels walls and anatomical or functional diseases. The use of ultrasound contrast agents makes it possible to improve ultrasonic information. Nonlinear ultrasound imaging highlights the detection of these agents within an organ and hence is a powerful technique to image perfusion of an organ in real-time. The visualization of flow and perfusion provides important information for the diagnosis of various diseases as well as for the detection of tumors. However, the images are buried in noise, the speckle, inherent in the image formation. Furthermore at portal phase, there is often an absence of clear contrast between lesions and surrounding tissues because the organ is filled with agents. In this context, we propose a new method of automatic liver lesions segmentation in nonlinear imaging sequences for the quantification of perfusion. Our method of segmentation is divided into two stages. Initially, we developed an anisotropic diffusion step which raised the structural characteristics to eliminate the speckle. Then, a fuzzy competitive clustering process allowed us to delineate liver lesions. This method has been used to detect focal hepatic lesions (metastasis, nodular hyperplasia, adenoma). Compared to medical expert"s report obtained on 15 varied lesions, the automatic segmentation allows us to identify and delineate focal liver lesions during the portal phase which high accuracy. Our results show that this method improves markedly the recognition of focal hepatic lesions and opens the way for future precise quantification of contrast enhancement.

  19. Adaptive thresholding of digital subtraction angiography images

    NASA Astrophysics Data System (ADS)

    Sang, Nong; Li, Heng; Peng, Weixue; Zhang, Tianxu

    2005-10-01

    In clinical practice, digital subtraction angiography (DSA) is a powerful technique for the visualization of blood vessels in the human body. Blood vessel segmentation is a main problem for 3D vascular reconstruction. In this paper, we propose a new adaptive thresholding method for the segmentation of DSA images. Each pixel of the DSA images is declared to be a vessel/background point with regard to a threshold and a few local characteristic limits depending on some information contained in the pixel neighborhood window. The size of the neighborhood window is set according to a priori knowledge of the diameter of vessels to make sure that each window contains the background definitely. Some experiments on cerebral DSA images are given, which show that our proposed method yields better results than global thresholding methods and some other local thresholding methods do.

  20. Automatic segmentation of mammogram and tomosynthesis images

    NASA Astrophysics Data System (ADS)

    Sargent, Dusty; Park, Sun Young

    2016-03-01

    Breast cancer is a one of the most common forms of cancer in terms of new cases and deaths both in the United States and worldwide. However, the survival rate with breast cancer is high if it is detected and treated before it spreads to other parts of the body. The most common screening methods for breast cancer are mammography and digital tomosynthesis, which involve acquiring X-ray images of the breasts that are interpreted by radiologists. The work described in this paper is aimed at optimizing the presentation of mammography and tomosynthesis images to the radiologist, thereby improving the early detection rate of breast cancer and the resulting patient outcomes. Breast cancer tissue has greater density than normal breast tissue, and appears as dense white image regions that are asymmetrical between the breasts. These irregularities are easily seen if the breast images are aligned and viewed side-by-side. However, since the breasts are imaged separately during mammography, the images may be poorly centered and aligned relative to each other, and may not properly focus on the tissue area. Similarly, although a full three dimensional reconstruction can be created from digital tomosynthesis images, the same centering and alignment issues can occur for digital tomosynthesis. Thus, a preprocessing algorithm that aligns the breasts for easy side-by-side comparison has the potential to greatly increase the speed and accuracy of mammogram reading. Likewise, the same preprocessing can improve the results of automatic tissue classification algorithms for mammography. In this paper, we present an automated segmentation algorithm for mammogram and tomosynthesis images that aims to improve the speed and accuracy of breast cancer screening by mitigating the above mentioned problems. Our algorithm uses information in the DICOM header to facilitate preprocessing, and incorporates anatomical region segmentation and contour analysis, along with a hidden Markov model (HMM) for

  1. Automatic Iceball Segmentation With Adapted Shape Priors for MRI-Guided Cryoablation

    PubMed Central

    Liu, Xinyang; Tuncali, Kemal; Wells, William M.; Zientara, Gary P.

    2014-01-01

    Purpose To develop and evaluate an automatic segmentation method that extracts the 3D configuration of the ablation zone, the iceball, from images acquired during the freezing phase of MRI-guided cryoablation. Materials and Methods Intraprocedural images at 63 timepoints from 13 kidney tumor cryoablation procedures were examined retrospectively. The images were obtained using a 3 Tesla wide-bore MRI scanner and axial HASTE sequence. Initialized with semiautomatically localized cryoprobes, the iceball was segmented automatically at each timepoint using the graph cut (GC) technique with adapted shape priors. Results The average Dice Similarity Coefficients (DSC), compared with manual segmentations, were 0.88, 0.92, 0.92, 0.93, and 0.93 at 3, 6, 9, 12, and 15 min time-points, respectively, and the average DSC of the total 63 segmentations was 0.92 ± 0.03. The proposed method improved the accuracy significantly compared with the approach without shape prior adaptation (P = 0.026). The number of probes involved in the procedure had no apparent influence on the segmentation results using our technique. The average computation time was 20 s, which was compatible with an intraprocedural setting. Conclusion Our automatic iceball segmentation method demonstrated high accuracy and robustness for practical use in monitoring the progress of MRI-guided cryoablation. PMID:24338961

  2. Automatic scale selection for medical image segmentation

    NASA Astrophysics Data System (ADS)

    Bayram, Ersin; Wyatt, Christopher L.; Ge, Yaorong

    2001-07-01

    The scale of interesting structures in medical images is space variant because of partial volume effects, spatial dependence of resolution in many imaging modalities, and differences in tissue properties. Existing segmentation methods either apply a single scale to the entire image or try fine-to-coarse/coarse-to-fine tracking of structures over multiple scales. While single scale approaches fail to fully recover the perceptually important structures, multi-scale methods have problems in providing reliable means to select proper scales and integrating information over multiple scales. A recent approach proposed by Elder and Zucker addresses the scale selection problem by computing a minimal reliable scale for each image pixel. The basic premise of this approach is that, while the scale of structures within an image vary spatially, the imaging system is fixed. Hence, sensor noise statistics can be calculated. Based on a model of edges to be detected, and operators to be used for detection, one can locally compute a unique minimal reliable scale at which the likelihood of error due to sensor noise is less than or equal to a predetermined threshold. In this paper, we improve the segmentation method based on the minimal reliable scale selection and evaluate its effectiveness with both simulated and actual medical data.

  3. Unsupervised texture image segmentation by improved neural network ART2

    NASA Technical Reports Server (NTRS)

    Wang, Zhiling; Labini, G. Sylos; Mugnuolo, R.; Desario, Marco

    1994-01-01

    We here propose a segmentation algorithm of texture image for a computer vision system on a space robot. An improved adaptive resonance theory (ART2) for analog input patterns is adapted to classify the image based on a set of texture image features extracted by a fast spatial gray level dependence method (SGLDM). The nonlinear thresholding functions in input layer of the neural network have been constructed by two parts: firstly, to reduce the effects of image noises on the features, a set of sigmoid functions is chosen depending on the types of the feature; secondly, to enhance the contrast of the features, we adopt fuzzy mapping functions. The cluster number in output layer can be increased by an autogrowing mechanism constantly when a new pattern happens. Experimental results and original or segmented pictures are shown, including the comparison between this approach and K-means algorithm. The system written in C language is performed on a SUN-4/330 sparc-station with an image board IT-150 and a CCD camera.

  4. Fast planar segmentation of depth images

    NASA Astrophysics Data System (ADS)

    Javan Hemmat, Hani; Pourtaherian, Arash; Bondarev, Egor; de With, Peter H. N.

    2015-03-01

    One of the major challenges for applications dealing with the 3D concept is the real-time execution of the algorithms. Besides this, for the indoor environments, perceiving the geometry of surrounding structures plays a prominent role in terms of application performance. Since indoor structures mainly consist of planar surfaces, fast and accurate detection of such features has a crucial impact on quality and functionality of the 3D applications, e.g. decreasing model size (decimation), enhancing localization, mapping, and semantic reconstruction. The available planar-segmentation algorithms are mostly developed using surface normals and/or curvatures. Therefore, they are computationally expensive and challenging for real-time performance. In this paper, we introduce a fast planar-segmentation method for depth images avoiding surface normal calculations. Firstly, the proposed method searches for 3D edges in a depth image and finds the lines between identified edges. Secondly, it merges all the points on each pair of intersecting lines into a plane. Finally, various enhancements (e.g. filtering) are applied to improve the segmentation quality. The proposed algorithm is capable of handling VGA-resolution depth images at a 6 FPS frame-rate with a single-thread implementation. Furthermore, due to the multi-threaded design of the algorithm, we achieve a factor of 10 speedup by deploying a GPU implementation.

  5. Cerebral microbleed segmentation from susceptibility weighted images

    NASA Astrophysics Data System (ADS)

    Roy, Snehashis; Jog, Amod; Magrath, Elizabeth; Butman, John A.; Pham, Dzung L.

    2015-03-01

    Cerebral microbleeds (CMB) are a common marker of traumatic brain injury. Accurate detection and quantification of the CMBs are important for better understanding the progression and prognosis of the injury. Previous microbleed detection methods have suffered from a high rate of false positives, which is time consuming to manually correct. In this paper, we propose a fully automatic, example-based method to segment CMBs from susceptibility-weighted (SWI) scans, where examples from an already segmented template SWI image are used to detect CMBs in a new image. First, multiple radial symmetry transforms (RST) are performed on the template SWI to detect small ellipsoidal structures, which serve as potential microbleed candidates. Then 3D patches from the SWI and its RSTs are combined to form a feature vector at each voxel of the image. A random forest regression is trained using the feature vectors, where the dependent variable is the binary segmentation voxel of the template. Once the regression is learnt, it is applied to a new SWI scan, whose feature vectors contain patches from SWI and its RSTs. Experiments on 26 subjects with mild to severe brain injury show a CMB detection sensitivity of 85:7%, specificity 99:5%, and a false positive to true positive ratio of 1:73, which is competitive with published methods while providing a significant reduction in computation time.

  6. Pulmonary airways tree segmentation from CT examinations using adaptive volume of interest

    NASA Astrophysics Data System (ADS)

    Park, Sang Cheol; Kim, Won Pil; Zheng, Bin; Leader, Joseph K.; Pu, Jiantao; Tan, Jun; Gur, David

    2009-02-01

    Airways tree segmentation is an important step in quantitatively assessing the severity of and changes in several lung diseases such as chronic obstructive pulmonary disease (COPD), asthma, and cystic fibrosis. It can also be used in guiding bronchoscopy. The purpose of this study is to develop an automated scheme for segmenting the airways tree structure depicted on chest CT examinations. After lung volume segmentation, the scheme defines the first cylinder-like volume of interest (VOI) using a series of images depicting the trachea. The scheme then iteratively defines and adds subsequent VOIs using a region growing algorithm combined with adaptively determined thresholds in order to trace possible sections of airways located inside the combined VOI in question. The airway tree segmentation process is automatically terminated after the scheme assesses all defined VOIs in the iteratively assembled VOI list. In this preliminary study, ten CT examinations with 1.25mm section thickness and two different CT image reconstruction kernels ("bone" and "standard") were selected and used to test the proposed airways tree segmentation scheme. The experiment results showed that (1) adopting this approach affectively prevented the scheme from infiltrating into the parenchyma, (2) the proposed method reasonably accurately segmented the airways trees with lower false positive identification rate as compared with other previously reported schemes that are based on 2-D image segmentation and data analyses, and (3) the proposed adaptive, iterative threshold selection method for the region growing step in each identified VOI enables the scheme to segment the airways trees reliably to the 4th generation in this limited dataset with successful segmentation up to the 5th generation in a fraction of the airways tree branches.

  7. Infrared active polarimetric imaging system controlled by image segmentation algorithms: application to decamouflage

    NASA Astrophysics Data System (ADS)

    Vannier, Nicolas; Goudail, François; Plassart, Corentin; Boffety, Matthieu; Feneyrou, Patrick; Leviandier, Luc; Galland, Frédéric; Bertaux, Nicolas

    2016-05-01

    We describe an active polarimetric imager with laser illumination at 1.5 µm that can generate any illumination and analysis polarization state on the Poincar sphere. Thanks to its full polarization agility and to image analysis of the scene with an ultrafast active-contour based segmentation algorithm, it can perform adaptive polarimetric contrast optimization. We demonstrate the capacity of this imager to detect manufactured objects in different types of environments for such applications as decamouflage and hazardous object detection. We compare two imaging modes having different number of polarimetric degrees of freedom and underline the characteristics that a polarimetric imager aimed at this type of applications should possess.

  8. Retinal Imaging: Adaptive Optics

    NASA Astrophysics Data System (ADS)

    Goncharov, A. S.; Iroshnikov, N. G.; Larichev, Andrey V.

    This chapter describes several factors influencing the performance of ophthalmic diagnostic systems with adaptive optics compensation of human eye aberration. Particular attention is paid to speckle modulation, temporal behavior of aberrations, and anisoplanatic effects. The implementation of a fundus camera with adaptive optics is considered.

  9. Patterns of Transfer of Adaptation Among Body Segments

    NASA Technical Reports Server (NTRS)

    Seidler, R. D.; Bloomberg, J. J.; Stelmach, George E.

    2000-01-01

    Two experiments were conducted in order to determine the patterns of transfer of visuomotor adaptation between arm and head pointing. An altered gain of display of pointing movements was used to induce a conflict between visual and somatosensory representations. Two subject groups participated in Experiment One: group 1 adapted shoulder pointing movements, and group 2 adapted wrist pointing movements to a 0.5 gain of display. Following the adaptation regimen, subjects performed a transfer test in which the shoulder group performed wrist movements and the wrist group performed shoulder movements. The results demonstrated that both groups displayed typical adaptation curves, initially undershooting the target followed by a return to baseline performance. Transfer tests revealed that both groups had high transfer of the acquired adaptation to the other joint. Experiment Two followed a similar design except that group 1 adapted head pointing movements and group 2 adapted arm pointing movements. The arm adaptation had high transfer to head pointing while the head adaptation had very little transfer to arm pointing. These results imply that, while the arm segments may share a common target representation for goal-directed actions, individual but functionally dependent target representations may exist for the control of head and arm movements.

  10. Patterns of transfer of adaptation among body segments

    NASA Technical Reports Server (NTRS)

    Seidler, R. D.; Bloomberg, J. J.; Stelmach, G. E.

    2001-01-01

    Two experiments were conducted in order to determine the patterns of transfer of visuomotor adaptation between arm and head pointing. An altered gain of display of pointing movements was used to induce a conflict between visual and somatosensory representations. Two subject groups participated in Experiment 1: group 1 adapted shoulder pointing movements, and group 2 adapted wrist pointing movements to a 0.5 gain of display. Following the adaptation regimen, subjects performed a transfer test in which the shoulder group performed wrist movements and the wrist group performed shoulder movements. The results demonstrated that both groups displayed typical adaptation curves, initially undershooting the target followed by a return to baseline performance. Transfer tests revealed that both groups had high transfer of the acquired adaptation to the other joint. Experiment 2 followed a similar design except that group 1 adapted head pointing movements and group 2 adapted arm pointing movements. The arm adaptation had high transfer to head pointing while the head adaptation had very little transfer to arm pointing. These results imply that, while the arm segments may share a common target representation for goal-directed actions, individual but functionally dependent target representations may exist for the control of head and arm movements.

  11. Optimal retinal cyst segmentation from OCT images

    NASA Astrophysics Data System (ADS)

    Oguz, Ipek; Zhang, Li; Abramoff, Michael D.; Sonka, Milan

    2016-03-01

    Accurate and reproducible segmentation of cysts and fluid-filled regions from retinal OCT images is an important step allowing quantification of the disease status, longitudinal disease progression, and response to therapy in wet-pathology retinal diseases. However, segmentation of fluid-filled regions from OCT images is a challenging task due to their inhomogeneous appearance, the unpredictability of their number, size and location, as well as the intensity profile similarity between such regions and certain healthy tissue types. While machine learning techniques can be beneficial for this task, they require large training datasets and are often over-fitted to the appearance models of specific scanner vendors. We propose a knowledge-based approach that leverages a carefully designed cost function and graph-based segmentation techniques to provide a vendor-independent solution to this problem. We illustrate the results of this approach on two publicly available datasets with a variety of scanner vendors and retinal disease status. Compared to a previous machine-learning based approach, the volume similarity error was dramatically reduced from 81:3+/-56:4% to 22:2+/-21:3% (paired t-test, p << 0:001).

  12. Embedded Implementation of VHR Satellite Image Segmentation.

    PubMed

    Li, Chao; Balla-Arabé, Souleymane; Ginhac, Dominique; Yang, Fan

    2016-05-27

    Processing and analysis of Very High Resolution (VHR) satellite images provide a mass of crucial information, which can be used for urban planning, security issues or environmental monitoring. However, they are computationally expensive and, thus, time consuming, while some of the applications, such as natural disaster monitoring and prevention, require high efficiency performance. Fortunately, parallel computing techniques and embedded systems have made great progress in recent years, and a series of massively parallel image processing devices, such as digital signal processors or Field Programmable Gate Arrays (FPGAs), have been made available to engineers at a very convenient price and demonstrate significant advantages in terms of running-cost, embeddability, power consumption flexibility, etc. In this work, we designed a texture region segmentation method for very high resolution satellite images by using the level set algorithm and the multi-kernel theory in a high-abstraction C environment and realize its register-transfer level implementation with the help of a new proposed high-level synthesis-based design flow. The evaluation experiments demonstrate that the proposed design can produce high quality image segmentation with a significant running-cost advantage.

  13. Embedded Implementation of VHR Satellite Image Segmentation.

    PubMed

    Li, Chao; Balla-Arabé, Souleymane; Ginhac, Dominique; Yang, Fan

    2016-01-01

    Processing and analysis of Very High Resolution (VHR) satellite images provide a mass of crucial information, which can be used for urban planning, security issues or environmental monitoring. However, they are computationally expensive and, thus, time consuming, while some of the applications, such as natural disaster monitoring and prevention, require high efficiency performance. Fortunately, parallel computing techniques and embedded systems have made great progress in recent years, and a series of massively parallel image processing devices, such as digital signal processors or Field Programmable Gate Arrays (FPGAs), have been made available to engineers at a very convenient price and demonstrate significant advantages in terms of running-cost, embeddability, power consumption flexibility, etc. In this work, we designed a texture region segmentation method for very high resolution satellite images by using the level set algorithm and the multi-kernel theory in a high-abstraction C environment and realize its register-transfer level implementation with the help of a new proposed high-level synthesis-based design flow. The evaluation experiments demonstrate that the proposed design can produce high quality image segmentation with a significant running-cost advantage. PMID:27240370

  14. Embedded Implementation of VHR Satellite Image Segmentation

    PubMed Central

    Li, Chao; Balla-Arabé, Souleymane; Ginhac, Dominique; Yang, Fan

    2016-01-01

    Processing and analysis of Very High Resolution (VHR) satellite images provide a mass of crucial information, which can be used for urban planning, security issues or environmental monitoring. However, they are computationally expensive and, thus, time consuming, while some of the applications, such as natural disaster monitoring and prevention, require high efficiency performance. Fortunately, parallel computing techniques and embedded systems have made great progress in recent years, and a series of massively parallel image processing devices, such as digital signal processors or Field Programmable Gate Arrays (FPGAs), have been made available to engineers at a very convenient price and demonstrate significant advantages in terms of running-cost, embeddability, power consumption flexibility, etc. In this work, we designed a texture region segmentation method for very high resolution satellite images by using the level set algorithm and the multi-kernel theory in a high-abstraction C environment and realize its register-transfer level implementation with the help of a new proposed high-level synthesis-based design flow. The evaluation experiments demonstrate that the proposed design can produce high quality image segmentation with a significant running-cost advantage. PMID:27240370

  15. Improved automatic detection and segmentation of cell nuclei in histopathology images.

    PubMed

    Al-Kofahi, Yousef; Lassoued, Wiem; Lee, William; Roysam, Badrinath

    2010-04-01

    Automatic segmentation of cell nuclei is an essential step in image cytometry and histometry. Despite substantial progress, there is a need to improve accuracy, speed, level of automation, and adaptability to new applications. This paper presents a robust and accurate novel method for segmenting cell nuclei using a combination of ideas. The image foreground is extracted automatically using a graph-cuts-based binarization. Next, nuclear seed points are detected by a novel method combining multiscale Laplacian-of-Gaussian filtering constrained by distance-map-based adaptive scale selection. These points are used to perform an initial segmentation that is refined using a second graph-cuts-based algorithm incorporating the method of alpha expansions and graph coloring to reduce computational complexity. Nuclear segmentation results were manually validated over 25 representative images (15 in vitro images and 10 in vivo images, containing more than 7400 nuclei) drawn from diverse cancer histopathology studies, and four types of segmentation errors were investigated. The overall accuracy of the proposed segmentation algorithm exceeded 86%. The accuracy was found to exceed 94% when only over- and undersegmentation errors were considered. The confounding image characteristics that led to most detection/segmentation errors were high cell density, high degree of clustering, poor image contrast and noisy background, damaged/irregular nuclei, and poor edge information. We present an efficient semiautomated approach to editing automated segmentation results that requires two mouse clicks per operation.

  16. Segmentation of Tracking Sequences Using Dynamically Updated Adaptive Learning

    PubMed Central

    Michailovich, Oleg; Tannenbaum, Allen

    2009-01-01

    The problem of segmentation of tracking sequences is of central importance in a multitude of applications. In the current paper, a different approach to the problem is discussed. Specifically, the proposed segmentation algorithm is implemented in conjunction with estimation of the dynamic parameters of moving objects represented by the tracking sequence. While the information on objects’ motion allows one to transfer some valuable segmentation priors along the tracking sequence, the segmentation allows substantially reducing the complexity of motion estimation, thereby facilitating the computation. Thus, in the proposed methodology, the processes of segmentation and motion estimation work simultaneously, in a sort of “collaborative” manner. The Bayesian estimation framework is used here to perform the segmentation, while Kalman filtering is used to estimate the motion and to convey useful segmentation information along the image sequence. The proposed method is demonstrated on a number of both computed-simulated and real-life examples, and the obtained results indicate its advantages over some alternative approaches. PMID:19004712

  17. Poisson and Multinomial Mixture Models for Multivariate SIMS Image Segmentation

    SciTech Connect

    Willse, Alan R.; Tyler, Bonnie

    2002-11-08

    Multivariate statistical methods have been advocated for analysis of spectral images, such as those obtained with imaging time-of-flight secondary ion mass spectrometry (TOF-SIMS). TOF-SIMS images using total secondary ion counts or secondary ion counts at individual masses often fail to reveal all salient chemical patterns on the surface. Multivariate methods simultaneously analyze peak intensities at all masses. We propose multivariate methods based on Poisson and multinomial mixture models to segment SIMS images into chemically homogeneous regions. The Poisson mixture model is derived from the assumption that secondary ion counts at any mass in a chemically homogeneous region vary according to the Poisson distribution. The multinomial model is derived as a standardized Poisson mixture model, which is analogous to standardizing the data by dividing by total secondary ion counts. The methods are adapted for contextual image segmentation, allowing for spatial correlation of neighboring pixels. The methods are applied to 52 mass units of a SIMS image with known chemical components. The spectral profile and relative prevalence for each chemical phase are obtained from estimates of model parameters.

  18. Segmentation of polycystic kidneys from MR images

    NASA Astrophysics Data System (ADS)

    Racimora, Dimitri; Vivier, Pierre-Hugues; Chandarana, Hersh; Rusinek, Henry

    2010-03-01

    Polycystic kidney disease (PKD) is a disorder characterized by the growth of numerous fluid filled cysts in the kidneys. Measuring cystic kidney volume is thus crucial to monitoring the evolution of the disease. While T2-weighted MRI delineates the organ, automatic segmentation is very difficult due to highly variable shape and image contrast. The interactive stereology methods used currently involve a compromise between segmentation accuracy and time. We have investigated semi-automated methods: active contours and a sub-voxel morphology based algorithm. Coronal T2- weighted images of 17 patients were acquired in four breath-holds using the HASTE sequence on a 1.5 Tesla MRI unit. The segmentation results were compared to ground truth kidney masks obtained as a consensus of experts. Automatic active contour algorithm yielded an average 22% +/- 8.6% volume error. A recently developed method (Bridge Burner) based on thresholding and constrained morphology failed to separate PKD from the spleen, yielding 37.4% +/- 8.7% volume error. Manual post-editing reduced the volume error to 3.2% +/- 0.8% for active contours and 3.2% +/- 0.6% for Bridge Burner. The total time (automated algorithm plus editing) was 15 min +/- 5 min for active contours and 19 min +/- 11 min for Bridge Burner. The average volume errors for stereology method were 5.9%, 6.2%, 5.4% for mesh size 6.6, 11, 16.5 mm. The average processing times were 17, 7, 4 min. These results show that nearly two-fold improvement in PKD segmentation accuracy over stereology technique can be achieved with a combination of active contours and postediting.

  19. A general framework for image segmentation using ordered spatial dependency.

    PubMed

    Rousson, Mikaël; Xu, Chenyang

    2006-01-01

    The segmentation problem appears in most medical imaging applications. Many research groups are pushing toward a whole body segmentation based on atlases. With a similar objective, we propose a general framework to segment several structures. Rather than inventing yet another segmentation algorithm, we introduce inter-structure spatial dependencies to work with existing segmentation algorithms. Ranking the structures according to their dependencies, we end up with a hierarchical approach that improves each individual segmentation and provides automatic initializations. The best ordering of the structures can be learned off-line. We apply this framework to the segmentation of several structures in brain MR images.

  20. Segmentation of moving images by the human visual system.

    PubMed

    Chantelau, K

    1997-08-01

    New segments appearing in an image sequence or spontaneously accelerated segments are band limited by the visual system due to a nonperfect tracking of these segments by eye movements. In spite of this band limitation and acceleration of segments, a coarse segmentation (initial segmentation phase) can be performed by the visual system. This is interesting for the development of purely automatic segmentation algorithms for multimedia applications. In this paper the segmentation of the visual system is modelled and used in an automatic coarse initial segmentation. A suitable model for motion processing based on a spectral representation is presented and applied to the segmentation of synthetic and real image sequences with band limited and accelerated moving foreground and background segments.

  1. Study on algorithm for night vision panoramic image basing on image segmentation and multimode displaying technology

    NASA Astrophysics Data System (ADS)

    Zhang, Zhenhai; Li, Kejie

    2009-07-01

    Based on single panoramic annular lens optical system and external-low-luminance CCD sensors, 360-degree panoramic night vision image processing hardware platform were established. The night vision panoramic image algorithm was presented, grounding on the image segmentation and multimode displaying technology. The annular image can be unwrapped and corrected to conventional rectangular panorama by the panoramic image unwrapping algorithm. The night vision image enhancement algorithm, based on adaptive piecewise linear gray transformation (APLGT) and Laplacian of Gaussian (LOG) edge detection, were given. APLGT algorithm can be adaptively truncate the image histogram on both ends to obtain a smaller dynamic range so as to enhance the contrast of the night vision image. LOG algorithm can be propitious to find and detect dim small targets in night vision circumstance. After abundant experiment, the algorithm for night vision panoramic image was successfully implemented in TMS320DM642, basing on the image Segmentation and multimode displaying algorithm. And the system can reliably and dynamically detect 360-degree view field of panoramic night vision image.

  2. Unsupervised segmentation of ultrasound images by fusion of spatio-frequential textural features

    NASA Astrophysics Data System (ADS)

    Benameur, S.; Mignotte, M.; Lavoie, F.

    2011-03-01

    Image segmentation plays an important role in both qualitative and quantitative analysis of medical ultrasound images. However, due to their poor resolution and strong speckle noise, segmenting objects from this imaging modality remains a challenging task and may not be satisfactory with traditional image segmentation methods. To this end, this paper presents a simple, reliable, and conceptually different segmentation technique to locate and extract bone contours from ultrasound images. Instead of considering a new elaborate (texture) segmentation model specifically adapted for the ultrasound images, our technique proposes to fuse (i.e. efficiently combine) several segmentation maps associated with simpler segmentation models in order to get a final reliable and accurate segmentation result. More precisely, our segmentation model aims at fusing several K-means clustering results, each one exploiting, as simple cues, a set of complementary textural features, either spatial or frequential. Eligible models include the gray-level co-occurrence matrix, the re-quantized histogram, the Gabor filter bank, and local DCT coefficients. The experiments reported in this paper demonstrate the efficiency and illustrate all the potential of this segmentation approach.

  3. Learning image context for segmentation of the prostate in CT-guided radiotherapy

    NASA Astrophysics Data System (ADS)

    Li, Wei; Liao, Shu; Feng, Qianjin; Chen, Wufan; Shen, Dinggang

    2012-03-01

    Accurate segmentation of the prostate is the key to the success of external beam radiotherapy of prostate cancer. However, accurate segmentation of the prostate in computer tomography (CT) images remains challenging mainly due to three factors: (1) low image contrast between the prostate and its surrounding tissues, (2) unpredictable prostate motion across different treatment days and (3) large variations of intensities and shapes of the bladder and rectum around the prostate. In this paper, an online-learning and patient-specific classification method based on the location-adaptive image context is presented to deal with all these challenging issues and achieve the precise segmentation of the prostate in CT images. Specifically, two sets of location-adaptive classifiers are placed, respectively, along the two coordinate directions of the planning image space of a patient, and further trained with the planning image and also the previous-segmented treatment images of the same patient to jointly perform prostate segmentation for a new treatment image (of the same patient). In particular, each location-adaptive classifier, which itself consists of a set of sequential sub-classifiers, is recursively trained with both the static image appearance features and the iteratively updated image context features (extracted at different scales and orientations) for better identification of each prostate region. The proposed learning-based prostate segmentation method has been extensively evaluated on 161 images of 11 patients, each with more than nine daily treatment three-dimensional CT images. Our method achieves the mean Dice value 0.908 and the mean ± SD of average surface distance value 1.40 ± 0.57 mm. Its performance is also compared with three prostate segmentation methods, indicating the best segmentation accuracy by the proposed method among all methods under comparison.

  4. Adaptive Breast Radiation Therapy Using Modeling of Tissue Mechanics: A Breast Tissue Segmentation Study

    SciTech Connect

    Juneja, Prabhjot; Harris, Emma J.; Kirby, Anna M.; Evans, Philip M.

    2012-11-01

    Purpose: To validate and compare the accuracy of breast tissue segmentation methods applied to computed tomography (CT) scans used for radiation therapy planning and to study the effect of tissue distribution on the segmentation accuracy for the purpose of developing models for use in adaptive breast radiation therapy. Methods and Materials: Twenty-four patients receiving postlumpectomy radiation therapy for breast cancer underwent CT imaging in prone and supine positions. The whole-breast clinical target volume was outlined. Clinical target volumes were segmented into fibroglandular and fatty tissue using the following algorithms: physical density thresholding; interactive thresholding; fuzzy c-means with 3 classes (FCM3) and 4 classes (FCM4); and k-means. The segmentation algorithms were evaluated in 2 stages: first, an approach based on the assumption that the breast composition should be the same in both prone and supine position; and second, comparison of segmentation with tissue outlines from 3 experts using the Dice similarity coefficient (DSC). Breast datasets were grouped into nonsparse and sparse fibroglandular tissue distributions according to expert assessment and used to assess the accuracy of the segmentation methods and the agreement between experts. Results: Prone and supine breast composition analysis showed differences between the methods. Validation against expert outlines found significant differences (P<.001) between FCM3 and FCM4. Fuzzy c-means with 3 classes generated segmentation results (mean DSC = 0.70) closest to the experts' outlines. There was good agreement (mean DSC = 0.85) among experts for breast tissue outlining. Segmentation accuracy and expert agreement was significantly higher (P<.005) in the nonsparse group than in the sparse group. Conclusions: The FCM3 gave the most accurate segmentation of breast tissues on CT data and could therefore be used in adaptive radiation therapy-based on tissue modeling. Breast tissue segmentation

  5. Intensity-based segmentation of microarray images.

    PubMed

    Nagarajan, Radhakrishnan

    2003-07-01

    The underlying principle in microarray image analysis is that the spot intensity is a measure of the gene expression. This implicitly assumes the gene expression of a spot to be governed entirely by the distribution of the pixel intensities. Thus, a segmentation technique based on the distribution of the pixel intensities is appropriate for the current problem. In this paper, clustering-based segmentation is described to extract the target intensity of the spots. The approximate boundaries of the spots in the microarray are determined by manual adjustment of rectilinear grids. The distribution of the pixel intensity in a grid containing a spot is assumed to be the superposition of the foreground and the local background. The k-means clustering technique and the partitioning around medoids (PAM) were used to generate a binary partition of the pixel intensity distribution. The median (k-means) and the medoid (PAM) of the cluster members are chosen as the cluster representatives. The effectiveness of the clustering-based segmentation techniques was tested on publicly available arrays generated in a lipid metabolism experiment (Callow et al., 2000). The results are compared against those obtained using the region-growing approach (SPOT) (Yang et al., 2001). The effect of additive white Gaussian noise is also investigated. PMID:12906242

  6. a Minimum Spanning Tree Based Method for Uav Image Segmentation

    NASA Astrophysics Data System (ADS)

    Wang, Ping; Wei, Zheng; Cui, Weihong; Lin, Zhiyong

    2016-06-01

    This paper proposes a Minimum Span Tree (MST) based image segmentation method for UAV images in coastal area. An edge weight based optimal criterion (merging predicate) is defined, which based on statistical learning theory (SLT). And we used a scale control parameter to control the segmentation scale. Experiments based on the high resolution UAV images in coastal area show that the proposed merging predicate can keep the integrity of the objects and prevent results from over segmentation. The segmentation results proves its efficiency in segmenting the rich texture images with good boundary of objects.

  7. Segmentation Fusion Techniques with Application to Plenoptic Images: A Survey.

    NASA Astrophysics Data System (ADS)

    Evin, D.; Hadad, A.; Solano, A.; Drozdowicz, B.

    2016-04-01

    The segmentation of anatomical and pathological structures plays a key role in the characterization of clinically relevant evidence from digital images. Recently, plenoptic imaging has emerged as a new promise to enrich the diagnostic potential of conventional photography. Since the plenoptic images comprises a set of slightly different versions of the target scene, we propose to make use of those images to improve the segmentation quality in relation to the scenario of a single image segmentation. The problem of finding a segmentation solution from multiple images of a single scene, is called segmentation fusion. This paper reviews the issue of segmentation fusion in order to find solutions that can be applied to plenoptic images, particularly images from the ophthalmological domain.

  8. Towards Automatic Image Segmentation Using Optimised Region Growing Technique

    NASA Astrophysics Data System (ADS)

    Alazab, Mamoun; Islam, Mofakharul; Venkatraman, Sitalakshmi

    Image analysis is being adopted extensively in many applications such as digital forensics, medical treatment, industrial inspection, etc. primarily for diagnostic purposes. Hence, there is a growing interest among researches in developing new segmentation techniques to aid the diagnosis process. Manual segmentation of images is labour intensive, extremely time consuming and prone to human errors and hence an automated real-time technique is warranted in such applications. There is no universally applicable automated segmentation technique that will work for all images as the image segmentation is quite complex and unique depending upon the domain application. Hence, to fill the gap, this paper presents an efficient segmentation algorithm that can segment a digital image of interest into a more meaningful arrangement of regions and objects. Our algorithm combines region growing approach with optimised elimination of false boundaries to arrive at more meaningful segments automatically. We demonstrate this using X-ray teeth images that were taken for real-life dental diagnosis.

  9. Monitoring Change Through Hierarchical Segmentation of Remotely Sensed Image Data

    NASA Technical Reports Server (NTRS)

    Tilton, James C.; Lawrence, William T.

    2005-01-01

    NASA's Goddard Space Flight Center has developed a fast and effective method for generating image segmentation hierarchies. These segmentation hierarchies organize image data in a manner that makes their information content more accessible for analysis. Image segmentation enables analysis through the examination of image regions rather than individual image pixels. In addition, the segmentation hierarchy provides additional analysis clues through the tracing of the behavior of image region characteristics at several levels of segmentation detail. The potential for extracting the information content from imagery data based on segmentation hierarchies has not been fully explored for the benefit of the Earth and space science communities. This paper explores the potential of exploiting these segmentation hierarchies for the analysis of multi-date data sets, and for the particular application of change monitoring.

  10. Efficient segmentation of skin epidermis in whole slide histopathological images.

    PubMed

    Xu, Hongming; Mandal, Mrinal

    2015-08-01

    Segmentation of epidermis areas is an important step towards automatic analysis of skin histopathological images. This paper presents a robust technique for epidermis segmentation in whole slide skin histopathological images. The proposed technique first performs a coarse epidermis segmentation using global thresholding and shape analysis. The epidermis thickness is then estimated by a series of line segments perpendicular to the main axis of the initially segmented epidermis mask. If the segmented epidermis mask has a thickness greater than a predefined threshold, the segmentation is suspected to be inaccurate. A second pass of fine segmentation using k-means algorithm is then carried out over these coarsely segmented result to enhance the performance. Experimental results on 64 different skin histopathological images show that the proposed technique provides a superior performance compared to the existing techniques. PMID:26737135

  11. A Review on Segmentation of Positron Emission Tomography Images

    PubMed Central

    Foster, Brent; Bagci, Ulas; Mansoor, Awais; Xu, Ziyue; Mollura, Daniel J.

    2014-01-01

    Positron Emission Tomography (PET), a non-invasive functional imaging method at the molecular level, images the distribution of biologically targeted radiotracers with high sensitivity. PET imaging provides detailed quantitative information about many diseases and is often used to evaluate inflammation, infection, and cancer by detecting emitted photons from a radiotracer localized to abnormal cells. In order to differentiate abnormal tissue from surrounding areas in PET images, image segmentation methods play a vital role; therefore, accurate image segmentation is often necessary for proper disease detection, diagnosis, treatment planning, and follow-ups. In this review paper, we present state-of-the-art PET image segmentation methods, as well as the recent advances in image segmentation techniques. In order to make this manuscript self-contained, we also briefly explain the fundamentals of PET imaging, the challenges of diagnostic PET image analysis, and the effects of these challenges on the segmentation results. PMID:24845019

  12. Novel multiresolution mammographic density segmentation using pseudo 3D features and adaptive cluster merging

    NASA Astrophysics Data System (ADS)

    He, Wenda; Juette, Arne; Denton, Erica R. E.; Zwiggelaar, Reyer

    2015-03-01

    Breast cancer is the most frequently diagnosed cancer in women. Early detection, precise identification of women at risk, and application of appropriate disease prevention measures are by far the most effective ways to overcome the disease. Successful mammographic density segmentation is a key aspect in deriving correct tissue composition, ensuring an accurate mammographic risk assessment. However, mammographic densities have not yet been fully incorporated with non-image based risk prediction models, (e.g. the Gail and the Tyrer-Cuzick model), because of unreliable segmentation consistency and accuracy. This paper presents a novel multiresolution mammographic density segmentation, a concept of stack representation is proposed, and 3D texture features were extracted by adapting techniques based on classic 2D first-order statistics. An unsupervised clustering technique was employed to achieve mammographic segmentation, in which two improvements were made; 1) consistent segmentation by incorporating an optimal centroids initialisation step, and 2) significantly reduced the number of missegmentation by using an adaptive cluster merging technique. A set of full field digital mammograms was used in the evaluation. Visual assessment indicated substantial improvement on segmented anatomical structures and tissue specific areas, especially in low mammographic density categories. The developed method demonstrated an ability to improve the quality of mammographic segmentation via clustering, and results indicated an improvement of 26% in segmented image with good quality when compared with the standard clustering approach. This in turn can be found useful in early breast cancer detection, risk-stratified screening, and aiding radiologists in the process of decision making prior to surgery and/or treatment.

  13. AIDA: Adaptive Image Deconvolution Algorithm

    NASA Astrophysics Data System (ADS)

    Hom, Erik; Haase, Sebastian; Marchis, Franck

    2013-10-01

    AIDA is an implementation and extension of the MISTRAL myopic deconvolution method developed by Mugnier et al. (2004) (see J. Opt. Soc. Am. A 21:1841-1854). The MISTRAL approach has been shown to yield object reconstructions with excellent edge preservation and photometric precision when used to process astronomical images. AIDA improves upon the original MISTRAL implementation. AIDA, written in Python, can deconvolve multiple frame data and three-dimensional image stacks encountered in adaptive optics and light microscopic imaging.

  14. Microscopy image segmentation tool: Robust image data analysis

    SciTech Connect

    Valmianski, Ilya Monton, Carlos; Schuller, Ivan K.

    2014-03-15

    We present a software package called Microscopy Image Segmentation Tool (MIST). MIST is designed for analysis of microscopy images which contain large collections of small regions of interest (ROIs). Originally developed for analysis of porous anodic alumina scanning electron images, MIST capabilities have been expanded to allow use in a large variety of problems including analysis of biological tissue, inorganic and organic film grain structure, as well as nano- and meso-scopic structures. MIST provides a robust segmentation algorithm for the ROIs, includes many useful analysis capabilities, and is highly flexible allowing incorporation of specialized user developed analysis. We describe the unique advantages MIST has over existing analysis software. In addition, we present a number of diverse applications to scanning electron microscopy, atomic force microscopy, magnetic force microscopy, scanning tunneling microscopy, and fluorescent confocal laser scanning microscopy.

  15. Model-based segmentation of medical x-ray images

    NASA Astrophysics Data System (ADS)

    Hoare, Frederick; de Jager, Gerhard

    1994-03-01

    This paper discusses the methods used to model the structure of x-ray images of the human body and the individual organs within the body. A generic model of a region is built up from x-ray images to aid in automatic segmentation. By using the ribs from a chest x-ray image as an example, it is shown how models of the different organs can be generated. The generic model of the chest region is built up by using a priori knowledge of the physical structure of the human body. The models of the individual organs are built up by using knowledge of the structure of the organs as well as other information contained within each image. Each image is unique and therefore information from the region surrounding the organs in the image has to be taken into account when adapting the generic model to individual images. Results showing the application of these techniques to x-ray images of the chest region, the labelling of individual organs, and the generation of models of the ribs are presented.

  16. [Automatic segmentation of three dimension medical image series].

    PubMed

    Ding, Siyi; Yang, Jie; Yao, Lixiu; Xu, Qing

    2006-08-01

    We propose an improved version of regional competition algorithm in this paper, and apply it to the automatic segmentation of medical image series, particularly in the segmentation and recognition of brain tumor. The traditional regional competition is enhanced by combining the attractive aspects of fuzzy segmentation, and thus it provides an efficient approach to segment the fuzzy and heterogeneous medical images. In order to perform regional competition on medical image series, we utilize the segmentation result of a slice to initiate the next segmented slice, while the first slice is initialized using regional growing algorithm. Moreover, we develop an algorithm to recognize the tumors automatically, taking into account its characters. Experimental results show that our algorithm performs well on the segmentation of magnetic resonance imaging (MRI) image series with high speed and precision. PMID:17002088

  17. Proximity graphs based multi-scale image segmentation

    SciTech Connect

    Skurikhin, Alexei N

    2008-01-01

    We present a novel multi-scale image segmentation approach based on irregular triangular and polygonal tessellations produced by proximity graphs. Our approach consists of two separate stages: polygonal seeds generation followed by an iterative bottom-up polygon agglomeration into larger chunks. We employ constrained Delaunay triangulation combined with the principles known from the visual perception to extract an initial ,irregular polygonal tessellation of the image. These initial polygons are built upon a triangular mesh composed of irregular sized triangles and their shapes are ad'apted to the image content. We then represent the image as a graph with vertices corresponding to the polygons and edges reflecting polygon relations. The segmentation problem is then formulated as Minimum Spanning Tree extraction. We build a successive fine-to-coarse hierarchy of irregular polygonal grids by an iterative graph contraction constructing Minimum Spanning Tree. The contraction uses local information and merges the polygons bottom-up based on local region-and edge-based characteristics.

  18. Image Segmentation for Connectomics Using Machine Learning

    SciTech Connect

    Tasdizen, Tolga; Seyedhosseini, Mojtaba; Liu, TIng; Jones, Cory; Jurrus, Elizabeth R.

    2014-12-01

    Reconstruction of neural circuits at the microscopic scale of individual neurons and synapses, also known as connectomics, is an important challenge for neuroscience. While an important motivation of connectomics is providing anatomical ground truth for neural circuit models, the ability to decipher neural wiring maps at the individual cell level is also important in studies of many neurodegenerative diseases. Reconstruction of a neural circuit at the individual neuron level requires the use of electron microscopy images due to their extremely high resolution. Computational challenges include pixel-by-pixel annotation of these images into classes such as cell membrane, mitochondria and synaptic vesicles and the segmentation of individual neurons. State-of-the-art image analysis solutions are still far from the accuracy and robustness of human vision and biologists are still limited to studying small neural circuits using mostly manual analysis. In this chapter, we describe our image analysis pipeline that makes use of novel supervised machine learning techniques to tackle this problem.

  19. Passive adaptive imaging through turbulence

    NASA Astrophysics Data System (ADS)

    Tofsted, David

    2016-05-01

    Standard methods for improved imaging system performance under degrading optical turbulence conditions typically involve active adaptive techniques or post-capture image processing. Here, passive adaptive methods are considered where active sources are disallowed, a priori. Theoretical analyses of short-exposure turbulence impacts indicate that varying aperture sizes experience different degrees of turbulence impacts. Smaller apertures often outperform larger aperture systems as turbulence strength increases. This suggests a controllable aperture system is advantageous. In addition, sub-aperture sampling of a set of training images permits the system to sense tilts in different sub-aperture regions through image acquisition and image cross-correlation calculations. A four sub-aperture pattern supports corrections involving five realizable operating modes (beyond tip and tilt) for removing aberrations over an annular pattern. Progress to date will be discussed regarding development and field trials of a prototype system.

  20. Segmentation of thermographic images of hands using a genetic algorithm

    NASA Astrophysics Data System (ADS)

    Ghosh, Payel; Mitchell, Melanie; Gold, Judith

    2010-01-01

    This paper presents a new technique for segmenting thermographic images using a genetic algorithm (GA). The individuals of the GA also known as chromosomes consist of a sequence of parameters of a level set function. Each chromosome represents a unique segmenting contour. An initial population of segmenting contours is generated based on the learned variation of the level set parameters from training images. Each segmenting contour (an individual) is evaluated for its fitness based on the texture of the region it encloses. The fittest individuals are allowed to propagate to future generations of the GA run using selection, crossover and mutation. The dataset consists of thermographic images of hands of patients suffering from upper extremity musculo-skeletal disorders (UEMSD). Thermographic images are acquired to study the skin temperature as a surrogate for the amount of blood flow in the hands of these patients. Since entire hands are not visible on these images, segmentation of the outline of the hands on these images is typically performed by a human. In this paper several different methods have been tried for segmenting thermographic images: Gabor-wavelet-based texture segmentation method, the level set method of segmentation and our GA which we termed LSGA because it combines level sets with genetic algorithms. The results show a comparative evaluation of the segmentation performed by all the methods. We conclude that LSGA successfully segments entire hands on images in which hands are only partially visible.

  1. Image segmentation using an improved differential algorithm

    NASA Astrophysics Data System (ADS)

    Gao, Hao; Shi, Yujiao; Wu, Dongmei

    2014-10-01

    Among all the existing segmentation techniques, the thresholding technique is one of the most popular due to its simplicity, robustness, and accuracy (e.g. the maximum entropy method, Otsu's method, and K-means clustering). However, the computation time of these algorithms grows exponentially with the number of thresholds due to their exhaustive searching strategy. As a population-based optimization algorithm, differential algorithm (DE) uses a population of potential solutions and decision-making processes. It has shown considerable success in solving complex optimization problems within a reasonable time limit. Thus, applying this method into segmentation algorithm should be a good choice during to its fast computational ability. In this paper, we first propose a new differential algorithm with a balance strategy, which seeks a balance between the exploration of new regions and the exploitation of the already sampled regions. Then, we apply the new DE into the traditional Otsu's method to shorten the computation time. Experimental results of the new algorithm on a variety of images show that, compared with the EA-based thresholding methods, the proposed DE algorithm gets more effective and efficient results. It also shortens the computation time of the traditional Otsu method.

  2. Segmentation of neuroanatomy in magnetic resonance images

    NASA Astrophysics Data System (ADS)

    Simmons, Andrew; Arridge, Simon R.; Barker, G. J.; Tofts, Paul S.

    1992-06-01

    Segmentation in neurological magnetic resonance imaging (MRI) is necessary for feature extraction, volume measurement and for the three-dimensional display of neuroanatomy. Automated and semi-automated methods offer considerable advantages over manual methods because of their lack of subjectivity, their data reduction capabilities, and the time savings they give. We have used dual echo multi-slice spin-echo data sets which take advantage of the intrinsically multispectral nature of MRI. As a pre-processing step, a rf non-uniformity correction is applied and if the data is noisy the images are smoothed using a non-isotropic blurring method. Edge-based processing is used to identify the skin (the major outer contour) and the eyes. Edge-focusing has been used to significantly simplify edge images and thus allow simple postprocessing to pick out the brain contour in each slice of the data set. Edge- focusing is a technique which locates significant edges using a high degree of smoothing at a coarse level and tracks these edges to a fine level where the edges can be determined with high positional accuracy. Both 2-D and 3-D edge-detection methods have been compared. Once isolated, the brain is further processed to identify CSF, and, depending upon the MR pulse sequence used, the brain itself may be sub-divided into gray matter and white matter using semi-automatic contrast enhancement and clustering methods.

  3. A global/local affinity graph for image segmentation.

    PubMed

    Xiaofang Wang; Yuxing Tang; Masnou, Simon; Liming Chen

    2015-04-01

    Construction of a reliable graph capturing perceptual grouping cues of an image is fundamental for graph-cut based image segmentation methods. In this paper, we propose a novel sparse global/local affinity graph over superpixels of an input image to capture both short- and long-range grouping cues, and thereby enabling perceptual grouping laws, including proximity, similarity, continuity, and to enter in action through a suitable graph-cut algorithm. Moreover, we also evaluate three major visual features, namely, color, texture, and shape, for their effectiveness in perceptual segmentation and propose a simple graph fusion scheme to implement some recent findings from psychophysics, which suggest combining these visual features with different emphases for perceptual grouping. In particular, an input image is first oversegmented into superpixels at different scales. We postulate a gravitation law based on empirical observations and divide superpixels adaptively into small-, medium-, and large-sized sets. Global grouping is achieved using medium-sized superpixels through a sparse representation of superpixels' features by solving a ℓ0-minimization problem, and thereby enabling continuity or propagation of local smoothness over long-range connections. Small- and large-sized superpixels are then used to achieve local smoothness through an adjacent graph in a given feature space, and thus implementing perceptual laws, for example, similarity and proximity. Finally, a bipartite graph is also introduced to enable propagation of grouping cues between superpixels of different scales. Extensive experiments are carried out on the Berkeley segmentation database in comparison with several state-of-the-art graph constructions. The results show the effectiveness of the proposed approach, which outperforms state-of-the-art graphs using four different objective criteria, namely, the probabilistic rand index, the variation of information, the global consistency error, and the

  4. A global/local affinity graph for image segmentation.

    PubMed

    Xiaofang Wang; Yuxing Tang; Masnou, Simon; Liming Chen

    2015-04-01

    Construction of a reliable graph capturing perceptual grouping cues of an image is fundamental for graph-cut based image segmentation methods. In this paper, we propose a novel sparse global/local affinity graph over superpixels of an input image to capture both short- and long-range grouping cues, and thereby enabling perceptual grouping laws, including proximity, similarity, continuity, and to enter in action through a suitable graph-cut algorithm. Moreover, we also evaluate three major visual features, namely, color, texture, and shape, for their effectiveness in perceptual segmentation and propose a simple graph fusion scheme to implement some recent findings from psychophysics, which suggest combining these visual features with different emphases for perceptual grouping. In particular, an input image is first oversegmented into superpixels at different scales. We postulate a gravitation law based on empirical observations and divide superpixels adaptively into small-, medium-, and large-sized sets. Global grouping is achieved using medium-sized superpixels through a sparse representation of superpixels' features by solving a ℓ0-minimization problem, and thereby enabling continuity or propagation of local smoothness over long-range connections. Small- and large-sized superpixels are then used to achieve local smoothness through an adjacent graph in a given feature space, and thus implementing perceptual laws, for example, similarity and proximity. Finally, a bipartite graph is also introduced to enable propagation of grouping cues between superpixels of different scales. Extensive experiments are carried out on the Berkeley segmentation database in comparison with several state-of-the-art graph constructions. The results show the effectiveness of the proposed approach, which outperforms state-of-the-art graphs using four different objective criteria, namely, the probabilistic rand index, the variation of information, the global consistency error, and the

  5. Applications of magnetic resonance image segmentation in neurology

    NASA Astrophysics Data System (ADS)

    Heinonen, Tomi; Lahtinen, Antti J.; Dastidar, Prasun; Ryymin, Pertti; Laarne, Paeivi; Malmivuo, Jaakko; Laasonen, Erkki; Frey, Harry; Eskola, Hannu

    1999-05-01

    After the introduction of digital imagin devices in medicine computerized tissue recognition and classification have become important in research and clinical applications. Segmented data can be applied among numerous research fields including volumetric analysis of particular tissues and structures, construction of anatomical modes, 3D visualization, and multimodal visualization, hence making segmentation essential in modern image analysis. In this research project several PC based software were developed in order to segment medical images, to visualize raw and segmented images in 3D, and to produce EEG brain maps in which MR images and EEG signals were integrated. The software package was tested and validated in numerous clinical research projects in hospital environment.

  6. Hierarchical nucleus segmentation in digital pathology images

    NASA Astrophysics Data System (ADS)

    Gao, Yi; Ratner, Vadim; Zhu, Liangjia; Diprima, Tammy; Kurc, Tahsin; Tannenbaum, Allen; Saltz, Joel

    2016-03-01

    Extracting nuclei is one of the most actively studied topic in the digital pathology researches. Most of the studies directly search the nuclei (or seeds for the nuclei) from the finest resolution available. While the richest information has been utilized by such approaches, it is sometimes difficult to address the heterogeneity of nuclei in different tissues. In this work, we propose a hierarchical approach which starts from the lower resolution level and adaptively adjusts the parameters while progressing into finer and finer resolution. The algorithm is tested on brain and lung cancers images from The Cancer Genome Atlas data set.

  7. Hierarchical nucleus segmentation in digital pathology images

    PubMed Central

    Gao, Yi; Ratner, Vadim; Zhu, Liangjia; Diprima, Tammy; Kurc, Tahsin; Tannenbaum, Allen; Saltz, Joel

    2016-01-01

    Extracting nuclei is one of the most actively studied topic in the digital pathology researches. Most of the studies directly search the nuclei (or seeds for the nuclei) from the finest resolution available. While the richest information has been utilized by such approaches, it is sometimes difficult to address the heterogeneity of nuclei in different tissues. In this work, we propose a hierarchical approach which starts from the lower resolution level and adaptively adjusts the parameters while progressing into finer and finer resolution. The algorithm is tested on brain and lung cancers images from The Cancer Genome Atlas data set. PMID:27375315

  8. Probabilistic winner-take-all segmentation of images with application to ship detection.

    PubMed

    Osman, H; Blostein, S D

    2000-01-01

    A recent neural clustering scheme called "probabilistic winner-take-all (PWTA)" is applied to image segmentation. It is demonstrated that PWTA avoids underutilization of clusters by adapting the form of the cluster-conditional probability density function as clustering proceeds. A modification to PWTA is introduced so as to explicitly utilize the spatial continuity of image regions and thus improve the PWTA segmentation performance. The effectiveness of PWTA is then demonstrated through the segmentation of airborne synthetic aperture radar (SAR) images of ocean surfaces so as to detect ship signatures, where an approach is proposed to find a suitable value for the number of clusters required for this application. Results show that PWTA gives high segmentation quality and significantly outperforms four other segmentation techniques, namely, 1) K-means, 2) maximum likelihood (ML), 3) backpropagation network (BPN), and 4) histogram thresholding.

  9. Probabilistic winner-take-all segmentation of images with application to ship detection.

    PubMed

    Osman, H; Blostein, S D

    2000-01-01

    A recent neural clustering scheme called "probabilistic winner-take-all (PWTA)" is applied to image segmentation. It is demonstrated that PWTA avoids underutilization of clusters by adapting the form of the cluster-conditional probability density function as clustering proceeds. A modification to PWTA is introduced so as to explicitly utilize the spatial continuity of image regions and thus improve the PWTA segmentation performance. The effectiveness of PWTA is then demonstrated through the segmentation of airborne synthetic aperture radar (SAR) images of ocean surfaces so as to detect ship signatures, where an approach is proposed to find a suitable value for the number of clusters required for this application. Results show that PWTA gives high segmentation quality and significantly outperforms four other segmentation techniques, namely, 1) K-means, 2) maximum likelihood (ML), 3) backpropagation network (BPN), and 4) histogram thresholding. PMID:18252379

  10. An automatic segmentation method for multi-tomatoes image under complicated natural background

    NASA Astrophysics Data System (ADS)

    Yin, Jianjun; Mao, Hanping; Hu, Yongguang; Wang, Xinzhong; Chen, Shuren

    2006-12-01

    It is a fundamental work to realize intelligent fruit-picking that mature fruits are distinguished from complicated backgrounds and determined their three-dimensional location. Various methods for fruit identification can be found from the literatures. However, surprisingly little attention has been paid to image segmentation of multi-fruits which growth states are separated, connected, overlapped and partially covered by branches and leaves of plant under the natural illumination condition. In this paper we present an automatic segmentation method that comprises of three main steps. Firstly, Red and Green component image are extracted from RGB color image, and Green component subtracted from Red component gives RG of chromatic aberration gray-level image. Gray-level value between objects and background has obviously difference in RG image. By the feature, Ostu's threshold method is applied to do adaptive RG image segmentation. And then, marker-controlled watershed segmentation based on morphological grayscale reconstruction is applied into Red component image to search boundary of connected or overlapped tomatoes. Finally, intersection operation is done by operation results of above two steps to get binary image of final segmentation. The tests show that the automatic segmentation method has satisfactory effect upon multi-tomatoes image of various growth states under the natural illumination condition. Meanwhile, it has very robust for different maturity of multi-tomatoes image.

  11. Hybrid segmentation framework for 3D medical image analysis

    NASA Astrophysics Data System (ADS)

    Chen, Ting; Metaxas, Dimitri N.

    2003-05-01

    Medical image segmentation is the process that defines the region of interest in the image volume. Classical segmentation methods such as region-based methods and boundary-based methods cannot make full use of the information provided by the image. In this paper we proposed a general hybrid framework for 3D medical image segmentation purposes. In our approach we combine the Gibbs Prior model, and the deformable model. First, Gibbs Prior models are applied onto each slice in a 3D medical image volume and the segmentation results are combined to a 3D binary masks of the object. Then we create a deformable mesh based on this 3D binary mask. The deformable model will be lead to the edge features in the volume with the help of image derived external forces. The deformable model segmentation result can be used to update the parameters for Gibbs Prior models. These methods will then work recursively to reach a global segmentation solution. The hybrid segmentation framework has been applied to images with the objective of lung, heart, colon, jaw, tumor, and brain. The experimental data includes MRI (T1, T2, PD), CT, X-ray, Ultra-Sound images. High quality results are achieved with relatively efficient time cost. We also did validation work using expert manual segmentation as the ground truth. The result shows that the hybrid segmentation may have further clinical use.

  12. [Segmentation Method for Liver Organ Based on Image Sequence Context].

    PubMed

    Zhang, Meiyun; Fang, Bin; Wang, Yi; Zhong, Nanchang

    2015-10-01

    In view of the problems of more artificial interventions and segmentation defects in existing two-dimensional segmentation methods and abnormal liver segmentation errors in three-dimensional segmentation methods, this paper presents a semi-automatic liver organ segmentation method based on the image sequence context. The method takes advantage of the existing similarity between the image sequence contexts of the prior knowledge of liver organs, and combines region growing and level set method to carry out semi-automatic segmentation of livers, along with the aid of a small amount of manual intervention to deal with liver mutation situations. The experiment results showed that the liver segmentation algorithm presented in this paper had a high precision, and a good segmentation effect on livers which have greater variability, and can meet clinical application demands quite well.

  13. Automatic bone segmentation in knee MR images using a coarse-to-fine strategy

    NASA Astrophysics Data System (ADS)

    Park, Sang Hyun; Lee, Soochahn; Yun, Il Dong; Lee, Sang Uk

    2012-02-01

    Segmentation of bone and cartilage from a three dimensional knee magnetic resonance (MR) image is a crucial element in monitoring and understanding of development and progress of osteoarthritis. Until now, various segmentation methods have been proposed to separate the bone from other tissues, but it still remains challenging problem due to different modality of MR images, low contrast between bone and tissues, and shape irregularity. In this paper, we present a new fully-automatic segmentation method of bone compartments using relevant bone atlases from a training set. To find the relevant bone atlases and obtain the segmentation, a coarse-to-fine strategy is proposed. In the coarse step, the best atlas among the training set and an initial segmentation are simultaneously detected using branch and bound tree search. Since the best atlas in the coarse step is not accurately aligned, all atlases from the training set are aligned to the initial segmentation, and the best aligned atlas is selected in the middle step. Finally, in the fine step, segmentation is conducted as adaptively integrating shape of the best aligned atlas and appearance prior based on characteristics of local regions. For experiment, femur and tibia bones of forty test MR images are segmented by the proposed method using sixty training MR images. Experimental results show that a performance of the segmentation and the registration becomes better as going near the fine step, and the proposed method obtain the comparable performance with the state-of-the-art methods.

  14. Automated segmentation of MR images of brain tumors.

    PubMed

    Kaus, M R; Warfield, S K; Nabavi, A; Black, P M; Jolesz, F A; Kikinis, R

    2001-02-01

    An automated brain tumor segmentation method was developed and validated against manual segmentation with three-dimensional magnetic resonance images in 20 patients with meningiomas and low-grade gliomas. The automated method (operator time, 5-10 minutes) allowed rapid identification of brain and tumor tissue with an accuracy and reproducibility comparable to those of manual segmentation (operator time, 3-5 hours), making automated segmentation practical for low-grade gliomas and meningiomas. PMID:11161183

  15. Multimodal Correlative Preclinical Whole Body Imaging and Segmentation

    PubMed Central

    Akselrod-Ballin, Ayelet; Dafni, Hagit; Addadi, Yoseph; Biton, Inbal; Avni, Reut; Brenner, Yafit; Neeman, Michal

    2016-01-01

    Segmentation of anatomical structures and particularly abdominal organs is a fundamental problem for quantitative image analysis in preclinical research. This paper presents a novel approach for whole body segmentation of small animals in a multimodal setting of MR, CT and optical imaging. The algorithm integrates multiple imaging sequences into a machine learning framework, which generates supervoxels by an efficient hierarchical agglomerative strategy and utilizes multiple SVM-kNN classifiers each constrained by a heatmap prior region to compose the segmentation. We demonstrate results showing segmentation of mice images into several structures including the heart, lungs, liver, kidneys, stomach, vena cava, bladder, tumor, and skeleton structures. Experimental validation on a large set of mice and organs, indicated that our system outperforms alternative state of the art approaches. The system proposed can be generalized to various tissues and imaging modalities to produce automatic atlas-free segmentation, thereby enabling a wide range of applications in preclinical studies of small animal imaging. PMID:27325178

  16. Multimodal Correlative Preclinical Whole Body Imaging and Segmentation.

    PubMed

    Akselrod-Ballin, Ayelet; Dafni, Hagit; Addadi, Yoseph; Biton, Inbal; Avni, Reut; Brenner, Yafit; Neeman, Michal

    2016-01-01

    Segmentation of anatomical structures and particularly abdominal organs is a fundamental problem for quantitative image analysis in preclinical research. This paper presents a novel approach for whole body segmentation of small animals in a multimodal setting of MR, CT and optical imaging. The algorithm integrates multiple imaging sequences into a machine learning framework, which generates supervoxels by an efficient hierarchical agglomerative strategy and utilizes multiple SVM-kNN classifiers each constrained by a heatmap prior region to compose the segmentation. We demonstrate results showing segmentation of mice images into several structures including the heart, lungs, liver, kidneys, stomach, vena cava, bladder, tumor, and skeleton structures. Experimental validation on a large set of mice and organs, indicated that our system outperforms alternative state of the art approaches. The system proposed can be generalized to various tissues and imaging modalities to produce automatic atlas-free segmentation, thereby enabling a wide range of applications in preclinical studies of small animal imaging. PMID:27325178

  17. Automatic segmentation of canine retinal OCT using adaptive gradient enhancement and region growing

    NASA Astrophysics Data System (ADS)

    He, Yufan; Sun, Yankui; Chen, Min; Zheng, Yuanjie; Liu, Hui; Leon, Cecilia; Beltran, William; Gee, James C.

    2016-03-01

    In recent years, several studies have shown that the canine retina model offers important insight for our understanding of human retinal diseases. Several therapies developed to treat blindness in such models have already moved onto human clinical trials, with more currently under development [1]. Optical coherence tomography (OCT) offers a high resolution imaging modality for performing in-vivo analysis of the retinal layers. However, existing algorithms for automatically segmenting and analyzing such data have been mostly focused on the human retina. As a result, canine retinal images are often still being analyzed using manual segmentations, which is a slow and laborious task. In this work, we propose a method for automatically segmenting 5 boundaries in canine retinal OCT. The algorithm employs the position relationships between different boundaries to adaptively enhance the gradient map. A region growing algorithm is then used on the enhanced gradient maps to find the five boundaries separately. The automatic segmentation was compared against manual segmentations showing an average absolute error of 5.82 +/- 4.02 microns.

  18. Segmentation and learning in the quantitative analysis of microscopy images

    NASA Astrophysics Data System (ADS)

    Ruggiero, Christy; Ross, Amy; Porter, Reid

    2015-02-01

    In material science and bio-medical domains the quantity and quality of microscopy images is rapidly increasing and there is a great need to automatically detect, delineate and quantify particles, grains, cells, neurons and other functional "objects" within these images. These are challenging problems for image processing because of the variability in object appearance that inevitably arises in real world image acquisition and analysis. One of the most promising (and practical) ways to address these challenges is interactive image segmentation. These algorithms are designed to incorporate input from a human operator to tailor the segmentation method to the image at hand. Interactive image segmentation is now a key tool in a wide range of applications in microscopy and elsewhere. Historically, interactive image segmentation algorithms have tailored segmentation on an image-by-image basis, and information derived from operator input is not transferred between images. But recently there has been increasing interest to use machine learning in segmentation to provide interactive tools that accumulate and learn from the operator input over longer periods of time. These new learning algorithms reduce the need for operator input over time, and can potentially provide a more dynamic balance between customization and automation for different applications. This paper reviews the state of the art in this area, provides a unified view of these algorithms, and compares the segmentation performance of various design choices.

  19. Interactive prostate segmentation using atlas-guided semi-supervised learning and adaptive feature selection

    SciTech Connect

    Park, Sang Hyun; Gao, Yaozong; Shi, Yinghuan; Shen, Dinggang

    2014-11-01

    Purpose: Accurate prostate segmentation is necessary for maximizing the effectiveness of radiation therapy of prostate cancer. However, manual segmentation from 3D CT images is very time-consuming and often causes large intra- and interobserver variations across clinicians. Many segmentation methods have been proposed to automate this labor-intensive process, but tedious manual editing is still required due to the limited performance. In this paper, the authors propose a new interactive segmentation method that can (1) flexibly generate the editing result with a few scribbles or dots provided by a clinician, (2) fast deliver intermediate results to the clinician, and (3) sequentially correct the segmentations from any type of automatic or interactive segmentation methods. Methods: The authors formulate the editing problem as a semisupervised learning problem which can utilize a priori knowledge of training data and also the valuable information from user interactions. Specifically, from a region of interest near the given user interactions, the appropriate training labels, which are well matched with the user interactions, can be locally searched from a training set. With voting from the selected training labels, both confident prostate and background voxels, as well as unconfident voxels can be estimated. To reflect informative relationship between voxels, location-adaptive features are selected from the confident voxels by using regression forest and Fisher separation criterion. Then, the manifold configuration computed in the derived feature space is enforced into the semisupervised learning algorithm. The labels of unconfident voxels are then predicted by regularizing semisupervised learning algorithm. Results: The proposed interactive segmentation method was applied to correct automatic segmentation results of 30 challenging CT images. The correction was conducted three times with different user interactions performed at different time periods, in order to

  20. Joint Lung CT Image Segmentation: A Hierarchical Bayesian Approach

    PubMed Central

    Cheng, Wenjun; Ma, Luyao; Yang, Tiejun; Liang, Jiali

    2016-01-01

    Accurate lung CT image segmentation is of great clinical value, especially when it comes to delineate pathological regions including lung tumor. In this paper, we present a novel framework that jointly segments multiple lung computed tomography (CT) images via hierarchical Dirichlet process (HDP). In specifics, based on the assumption that lung CT images from different patients share similar image structure (organ sets and relative positioning), we derive a mathematical model to segment them simultaneously so that shared information across patients could be utilized to regularize each individual segmentation. Moreover, compared to many conventional models, the algorithm requires little manual involvement due to the nonparametric nature of Dirichlet process (DP). We validated proposed model upon clinical data consisting of healthy and abnormal (lung cancer) patients. We demonstrate that, because of the joint segmentation fashion, more accurate and consistent segmentations could be obtained. PMID:27611188

  1. Joint Lung CT Image Segmentation: A Hierarchical Bayesian Approach.

    PubMed

    Cheng, Wenjun; Ma, Luyao; Yang, Tiejun; Liang, Jiali; Zhang, Yan

    2016-01-01

    Accurate lung CT image segmentation is of great clinical value, especially when it comes to delineate pathological regions including lung tumor. In this paper, we present a novel framework that jointly segments multiple lung computed tomography (CT) images via hierarchical Dirichlet process (HDP). In specifics, based on the assumption that lung CT images from different patients share similar image structure (organ sets and relative positioning), we derive a mathematical model to segment them simultaneously so that shared information across patients could be utilized to regularize each individual segmentation. Moreover, compared to many conventional models, the algorithm requires little manual involvement due to the nonparametric nature of Dirichlet process (DP). We validated proposed model upon clinical data consisting of healthy and abnormal (lung cancer) patients. We demonstrate that, because of the joint segmentation fashion, more accurate and consistent segmentations could be obtained. PMID:27611188

  2. Segmentation of knee injury swelling on infrared images

    NASA Astrophysics Data System (ADS)

    Puentes, John; Langet, Hélène; Herry, Christophe; Frize, Monique

    2011-03-01

    Interpretation of medical infrared images is complex due to thermal noise, absence of texture, and small temperature differences in pathological zones. Acute inflammatory response is a characteristic symptom of some knee injuries like anterior cruciate ligament sprains, muscle or tendons strains, and meniscus tear. Whereas artificial coloring of the original grey level images may allow to visually assess the extent inflammation in the area, their automated segmentation remains a challenging problem. This paper presents a hybrid segmentation algorithm to evaluate the extent of inflammation after knee injury, in terms of temperature variations and surface shape. It is based on the intersection of rapid color segmentation and homogeneous region segmentation, to which a Laplacian of a Gaussian filter is applied. While rapid color segmentation enables to properly detect the observed core of swollen area, homogeneous region segmentation identifies possible inflammation zones, combining homogeneous grey level and hue area segmentation. The hybrid segmentation algorithm compares the potential inflammation regions partially detected by each method to identify overlapping areas. Noise filtering and edge segmentation are then applied to common zones in order to segment the swelling surfaces of the injury. Experimental results on images of a patient with anterior cruciate ligament sprain show the improved performance of the hybrid algorithm with respect to its separated components. The main contribution of this work is a meaningful automatic segmentation of abnormal skin temperature variations on infrared thermography images of knee injury swelling.

  3. Automated image segmentation using support vector machines

    NASA Astrophysics Data System (ADS)

    Powell, Stephanie; Magnotta, Vincent A.; Andreasen, Nancy C.

    2007-03-01

    Neurodegenerative and neurodevelopmental diseases demonstrate problems associated with brain maturation and aging. Automated methods to delineate brain structures of interest are required to analyze large amounts of imaging data like that being collected in several on going multi-center studies. We have previously reported on using artificial neural networks (ANN) to define subcortical brain structures including the thalamus (0.88), caudate (0.85) and the putamen (0.81). In this work, apriori probability information was generated using Thirion's demons registration algorithm. The input vector consisted of apriori probability, spherical coordinates, and an iris of surrounding signal intensity values. We have applied the support vector machine (SVM) machine learning algorithm to automatically segment subcortical and cerebellar regions using the same input vector information. SVM architecture was derived from the ANN framework. Training was completed using a radial-basis function kernel with gamma equal to 5.5. Training was performed using 15,000 vectors collected from 15 training images in approximately 10 minutes. The resulting support vectors were applied to delineate 10 images not part of the training set. Relative overlap calculated for the subcortical structures was 0.87 for the thalamus, 0.84 for the caudate, 0.84 for the putamen, and 0.72 for the hippocampus. Relative overlap for the cerebellar lobes ranged from 0.76 to 0.86. The reliability of the SVM based algorithm was similar to the inter-rater reliability between manual raters and can be achieved without rater intervention.

  4. A Marker-Based Approach for the Automated Selection of a Single Segmentation from a Hierarchical Set of Image Segmentations

    NASA Technical Reports Server (NTRS)

    Tarabalka, Y.; Tilton, J. C.; Benediktsson, J. A.; Chanussot, J.

    2012-01-01

    The Hierarchical SEGmentation (HSEG) algorithm, which combines region object finding with region object clustering, has given good performances for multi- and hyperspectral image analysis. This technique produces at its output a hierarchical set of image segmentations. The automated selection of a single segmentation level is often necessary. We propose and investigate the use of automatically selected markers for this purpose. In this paper, a novel Marker-based HSEG (M-HSEG) method for spectral-spatial classification of hyperspectral images is proposed. Two classification-based approaches for automatic marker selection are adapted and compared for this purpose. Then, a novel constrained marker-based HSEG algorithm is applied, resulting in a spectral-spatial classification map. Three different implementations of the M-HSEG method are proposed and their performances in terms of classification accuracies are compared. The experimental results, presented for three hyperspectral airborne images, demonstrate that the proposed approach yields accurate segmentation and classification maps, and thus is attractive for remote sensing image analysis.

  5. MAP segmentation of magnetic resonance images using mean field annealing

    NASA Astrophysics Data System (ADS)

    Logenthiran, Ambalavaner; Snyder, Wesley E.; Santago, Peter, II; Link, Kerry M.

    1991-06-01

    An algorithm is described which segments magnetic resonance images while removing the noise from the images without blurring or other distortion of edges. The problem of segmentation and noise removal is posed as a restoration of an uncorrupted image, given additive white Gaussian noise and a segmentation cost. The problem is solved using a strategy called Mean Field Annealing. An a priori statistical model of the image, which includes the region classification, is chosen which drives the minimization toward solutions which are locally homogeneous and globally classified. Application of the algorithm to brain and knee images is presented.

  6. Segmentation of cervical cell images using mean-shift filtering and morphological operators

    NASA Astrophysics Data System (ADS)

    Bergmeir, C.; García Silvente, M.; Esquivias López-Cuervo, J.; Benítez, J. M.

    2010-03-01

    Screening plays an important role within the fight against cervical cancer. One of the most challenging parts in order to automate the screening process is the segmentation of nuclei in the cervical cell images, as the difficulty for performing this segmentation accurately varies widely within the nuclei. We present an algorithm to perform this task. After background determination in an overview image, and interactive identification of regions of interest (ROIs) at lower magnification levels, ROIs are extracted and processed at the full magnification level of 40x. Subsequent to initial background removal, the image regions are smoothed by mean-shift and median filtering. Then, segmentations are generated by an adaptive threshold. The connected components in the resulting segmentations are filtered with morphological operators by characteristics such as shape, size and roundness. The algorithm was tested on a set of 50 images and was found to outperform other methods.

  7. A new level set model for cell image segmentation

    NASA Astrophysics Data System (ADS)

    Ma, Jing-Feng; Hou, Kai; Bao, Shang-Lian; Chen, Chun

    2011-02-01

    In this paper we first determine three phases of cell images: background, cytoplasm and nucleolus according to the general physical characteristics of cell images, and then develop a variational model, based on these characteristics, to segment nucleolus and cytoplasm from their relatively complicated backgrounds. In the meantime, the preprocessing obtained information of cell images using the OTSU algorithm is used to initialize the level set function in the model, which can speed up the segmentation and present satisfactory results in cell image processing.

  8. A hybrid and adaptive segmentation method using color and texture information

    NASA Astrophysics Data System (ADS)

    Meurie, C.; Ruichek, Y.; Cohen, A.; Marais, J.

    2010-01-01

    This paper presents a new image segmentation method based on the combination of texture and color informations. The method first computes the morphological color and texture gradients. The color gradient is analyzed taking into account the different color spaces. The texture gradient is computed using the luminance component of the HSL color space. The texture gradient procedure is achieved using a morphological filter and a granulometric and local energy analysis. To overcome the limitations of a linear/barycentric combination, the two morphological gradients are then mixed using a gradient component fusion strategy (to fuse the three components of the color gradient and the unique component of the texture gradient) and an adaptive technique to choose the weighting coefficients. The segmentation process is finally performed by applying the watershed technique using different type of germ images. The segmentation method is evaluated in different object classification applications using the k-means algorithm. The obtained results are compared with other known segmentation methods. The evaluation analysis shows that the proposed method gives better results, especially with hard image acquisition conditions.

  9. Robust image segmentation using local robust statistics and correntropy-based K-means clustering

    NASA Astrophysics Data System (ADS)

    Huang, Chencheng; Zeng, Li

    2015-03-01

    It is an important work to segment the real world images with intensity inhomogeneity such as magnetic resonance (MR) and computer tomography (CT) images. In practice, such images are often polluted by noise which make them difficult to be segmented by traditional level set based segmentation models. In this paper, we propose a robust level set image segmentation model combining local with global fitting energies to segment noised images. In the proposed model, the local fitting energy is based on the local robust statistics (LRS) information of an input image, which can efficiently reduce the effects of the noise, and the global fitting energy utilizes the correntropy-based K-means (CK) method, which can adaptively emphasize the samples that are close to their corresponding cluster centers. By integrating the advantages of global information and local robust statistics characteristics, the proposed model can efficiently segment images with intensity inhomogeneity and noise. Then, a level set regularization term is used to avoid re-initialization procedures in the process of curve evolution. In addition, the Gaussian filter is utilized to keep the level set smoothing in the curve evolution process. The proposed model first appeared as a two-phase model and then extended to a multi-phase one. Experimental results show the advantages of our model in terms of accuracy and robustness to the noise. In particular, our method has been applied on some synthetic and real images with desirable results.

  10. Segmentation algorithms for ear image data towards biomechanical studies.

    PubMed

    Ferreira, Ana; Gentil, Fernanda; Tavares, João Manuel R S

    2014-01-01

    In recent years, the segmentation, i.e. the identification, of ear structures in video-otoscopy, computerised tomography (CT) and magnetic resonance (MR) image data, has gained significant importance in the medical imaging area, particularly those in CT and MR imaging. Segmentation is the fundamental step of any automated technique for supporting the medical diagnosis and, in particular, in biomechanics studies, for building realistic geometric models of ear structures. In this paper, a review of the algorithms used in ear segmentation is presented. The review includes an introduction to the usually biomechanical modelling approaches and also to the common imaging modalities. Afterwards, several segmentation algorithms for ear image data are described, and their specificities and difficulties as well as their advantages and disadvantages are identified and analysed using experimental examples. Finally, the conclusions are presented as well as a discussion about possible trends for future research concerning the ear segmentation.

  11. Analysis of image thresholding segmentation algorithms based on swarm intelligence

    NASA Astrophysics Data System (ADS)

    Zhang, Yi; Lu, Kai; Gao, Yinghui; Yang, Bo

    2013-03-01

    Swarm intelligence-based image thresholding segmentation algorithms are playing an important role in the research field of image segmentation. In this paper, we briefly introduce the theories of four existing image segmentation algorithms based on swarm intelligence including fish swarm algorithm, artificial bee colony, bacteria foraging algorithm and particle swarm optimization. Then some image benchmarks are tested in order to show the differences of the segmentation accuracy, time consumption, convergence and robustness for Salt & Pepper noise and Gaussian noise of these four algorithms. Through these comparisons, this paper gives qualitative analyses for the performance variance of the four algorithms. The conclusions in this paper would give a significant guide for the actual image segmentation.

  12. Cellular image segmentation using n-agent cooperative game theory

    NASA Astrophysics Data System (ADS)

    Dimock, Ian B.; Wan, Justin W. L.

    2016-03-01

    Image segmentation is an important problem in computer vision and has significant applications in the segmentation of cellular images. Many different imaging techniques exist and produce a variety of image properties which pose difficulties to image segmentation routines. Bright-field images are particularly challenging because of the non-uniform shape of the cells, the low contrast between cells and background, and imaging artifacts such as halos and broken edges. Classical segmentation techniques often produce poor results on these challenging images. Previous attempts at bright-field imaging are often limited in scope to the images that they segment. In this paper, we introduce a new algorithm for automatically segmenting cellular images. The algorithm incorporates two game theoretic models which allow each pixel to act as an independent agent with the goal of selecting their best labelling strategy. In the non-cooperative model, the pixels choose strategies greedily based only on local information. In the cooperative model, the pixels can form coalitions, which select labelling strategies that benefit the entire group. Combining these two models produces a method which allows the pixels to balance both local and global information when selecting their label. With the addition of k-means and active contour techniques for initialization and post-processing purposes, we achieve a robust segmentation routine. The algorithm is applied to several cell image datasets including bright-field images, fluorescent images and simulated images. Experiments show that the algorithm produces good segmentation results across the variety of datasets which differ in cell density, cell shape, contrast, and noise levels.

  13. Image segmentation with genetic algorithms: a formulation and implementation

    NASA Astrophysics Data System (ADS)

    Seetharaman, Gunasekaran; Narasimhan, Amruthur; Sathe, Anand; Storc, Lisa

    1991-10-01

    Image segmentation is an important step in any computer vision system. Segmentation refers to the partitioning of the image plane into several regions, such that each region corresponds to a logical entity present in the scene. The problem is inherently NP, and the theory on the existence and uniqueness of the ideal segmentation is not yet established. Several methods have been proposed in literature for image segmentation. With the exception of the state-space approach to segmentation, other methods lack generality. The state-space approach, however, amounts to searching for the solution in a large search space of 22n(2) possibilities for a n X n image. In this paper, a classic approach based on state-space techniques for segmentation due to Brice and Fennema is reformulated using genetic algorithms. The state space representation of a partially segmented image lends itself to binary strings, in which the dominant substrings are easily explained in terms of chromosomes. Also the operations such as crossover and mutations are easily abstracted. In particular, when multiple images are segmented from an image sequence, fusion of constraints from one to the other becomes clear under this formulation.

  14. Anterior segment imaging in glaucoma: An updated review

    PubMed Central

    Maslin, Jessica S; Barkana, Yaniv; Dorairaj, Syril K

    2015-01-01

    Anterior segment imaging allows for an objective method of visualizing the anterior segment angle. Two of the most commonly used devices for anterior segment imaging include the anterior segment optical coherence tomography (AS-OCT) and the ultrasound biomicroscopy (UBM). AS-OCT technology has several types, including time-domain, swept-source, and spectral-domain-based configurations. We performed a literature search on PubMed for articles containing the text “anterior segment OCT,” “ultrasound biomicroscopy,” and “anterior segment imaging” since 2004, with some pertinent references before 2004 included for completeness. This review compares the advantages and disadvantages of AS-OCT and UBM, and summarizes the most recent literature regarding the importance of these devices in glaucoma diagnosis and management. These devices not only aid in visualization of the angle, but also have important postsurgical applications in bleb and tube imaging. PMID:26576519

  15. Single 3D cell segmentation from optical CT microscope images

    NASA Astrophysics Data System (ADS)

    Xie, Yiting; Reeves, Anthony P.

    2014-03-01

    The automated segmentation of the nucleus and cytoplasm regions in 3D optical CT microscope images has been achieved with two methods, a global threshold gradient based approach and a graph-cut approach. For the first method, the first two peaks of a gradient figure of merit curve are selected as the thresholds for cytoplasm and nucleus segmentation. The second method applies a graph-cut segmentation twice: the first identifies the nucleus region and the second identifies the cytoplasm region. Image segmentation of single cells is important for automated disease diagnostic systems. The segmentation methods were evaluated with 200 3D images consisting of 40 samples of 5 different cell types. The cell types consisted of columnar, macrophage, metaplastic and squamous human cells and cultured A549 cancer cells. The segmented cells were compared with both 2D and 3D reference images and the quality of segmentation was determined by the Dice Similarity Coefficient (DSC). In general, the graph-cut method had a superior performance to the gradient-based method. The graph-cut method achieved an average DSC of 86% and 72% for nucleus and cytoplasm segmentations respectively for the 2D reference images and 83% and 75% for the 3D reference images. The gradient method achieved an average DSC of 72% and 51% for nucleus and cytoplasm segmentation for the 2D reference images and 71% and 51% for the 3D reference images. The DSC of cytoplasm segmentation was significantly lower than for the nucleus since the cytoplasm was not differentiated as well by image intensity from the background.

  16. Image analysis for neuroblastoma classification: segmentation of cell nuclei.

    PubMed

    Gurcan, Metin N; Pan, Tony; Shimada, Hiro; Saltz, Joel

    2006-01-01

    Neuroblastoma is a childhood cancer of the nervous system. Current prognostic classification of this disease partly relies on morphological characteristics of the cells from H&E-stained images. In this work, an automated cell nuclei segmentation method is developed. This method employs morphological top-hat by reconstruction algorithm coupled with hysteresis thresholding to both detect and segment the cell nuclei. Accuracy of the automated cell nuclei segmentation algorithm is measured by comparing its outputs to manual segmentation. The average segmentation accuracy is 90.24+/-5.14% PMID:17947119

  17. Improved document image segmentation algorithm using multiresolution morphology

    NASA Astrophysics Data System (ADS)

    Bukhari, Syed Saqib; Shafait, Faisal; Breuel, Thomas M.

    2011-01-01

    Page segmentation into text and non-text elements is an essential preprocessing step before optical character recognition (OCR) operation. In case of poor segmentation, an OCR classification engine produces garbage characters due to the presence of non-text elements. This paper describes modifications to the text/non-text segmentation algorithm presented by Bloomberg,1 which is also available in his open-source Leptonica library.2The modifications result in significant improvements and achieved better segmentation accuracy than the original algorithm for UW-III, UNLV, ICDAR 2009 page segmentation competition test images and circuit diagram datasets.

  18. On the Performance of Stochastic Model-Based Image Segmentation

    NASA Astrophysics Data System (ADS)

    Lei, Tianhu; Sewchand, Wilfred

    1989-11-01

    A new stochastic model-based image segmentation technique for X-ray CT image has been developed and has been extended to the more general nondiffraction CT images which include MRI, SPELT, and certain type of ultrasound images [1,2]. The nondiffraction CT image is modeled by a Finite Normal Mixture. The technique utilizes the information theoretic criterion to detect the number of the region images, uses the Expectation-Maximization algorithm to estimate the parameters of the image, and uses the Bayesian classifier to segment the observed image. How does this technique over/under-estimate the number of the region images? What is the probability of errors in the segmentation of this technique? This paper addresses these two problems and is a continuation of [1,2].

  19. Fast globally optimal segmentation of cells in fluorescence microscopy images.

    PubMed

    Bergeest, Jan-Philip; Rohr, Karl

    2011-01-01

    Accurate and efficient segmentation of cells in fluorescence microscopy images is of central importance for the quantification of protein expression in high-throughput screening applications. We propose a new approach for segmenting cell nuclei which is based on active contours and convex energy functionals. Compared to previous work, our approach determines the global solution. Thus, the approach does not suffer from local minima and the segmentation result does not depend on the initialization. We also suggest a numeric approach for efficiently computing the solution. The performance of our approach has been evaluated using fluorescence microscopy images of different cell types. We have also performed a quantitative comparison with previous segmentation approaches.

  20. Multiscale Segmentation of Polarimetric SAR Image Based on Srm Superpixels

    NASA Astrophysics Data System (ADS)

    Lang, F.; Yang, J.; Wu, L.; Li, D.

    2016-06-01

    Multi-scale segmentation of remote sensing image is more systematic and more convenient for the object-oriented image analysis compared to single-scale segmentation. However, the existing pixel-based polarimetric SAR (PolSAR) image multi-scale segmentation algorithms are usually inefficient and impractical. In this paper, we proposed a superpixel-based binary partition tree (BPT) segmentation algorithm by combining the generalized statistical region merging (GSRM) algorithm and the BPT algorithm. First, superpixels are obtained by setting a maximum region number threshold to GSRM. Then, the region merging process of the BPT algorithm is implemented based on superpixels but not pixels. The proposed algorithm inherits the advantages of both GSRM and BPT. The operation efficiency is obviously improved compared to the pixel-based BPT segmentation. Experiments using the Lband ESAR image over the Oberpfaffenhofen test site proved the effectiveness of the proposed method.

  1. Segmenting images analytically in shape space

    NASA Astrophysics Data System (ADS)

    Rathi, Yogesh; Dambreville, Samuel; Niethammer, Marc; Malcolm, James; Levitt, James; Shenton, Martha E.; Tannenbaum, Allen

    2008-03-01

    This paper presents a novel analytic technique to perform shape-driven segmentation. In our approach, shapes are represented using binary maps, and linear PCA is utilized to provide shape priors for segmentation. Intensity based probability distributions are then employed to convert a given test volume into a binary map representation, and a novel energy functional is proposed whose minimum can be analytically computed to obtain the desired segmentation in the shape space. We compare the proposed method with the log-likelihood based energy to elucidate some key differences. Our algorithm is applied to the segmentation of brain caudate nucleus and hippocampus from MRI data, which is of interest in the study of schizophrenia and Alzheimer's disease. Our validation (we compute the Hausdorff distance and the DICE coefficient between the automatic segmentation and ground-truth) shows that the proposed algorithm is very fast, requires no initialization and outperforms the log-likelihood based energy.

  2. Efficient text segmentation and adaptive color error diffusion for text enhancement

    NASA Astrophysics Data System (ADS)

    Kwon, Jae-Hyun; Park, Tae-Yong; Kim, Yun-Tae; Cho, Yang-Ho; Ha, Yeong-Ho

    2005-01-01

    This paper proposes an adaptive error diffusion algorithm for text enhancement followed by an efficient text segmentation that uses the maximum gradient difference (MGD). The gradients are calculated along with scan lines, then the MGD values are filled within a local window to merge text segments. If the value is above a threshold, the pixel is considered as potential text. Isolated segments are then eliminated in a non-text region filtering process. After the text segmentation, a conventional error diffusion method is applied to the background, while edge enhancement error diffusion is used for the text. Since it is inevitable that visually objectionable artifacts are generated when using two different halftoning algorithms, gradual dilation is proposed to minimize the boundary artifacts in the segmented text blocks before halftoning. Sharpening based on the gradually dilated text region (GDTR) then prevents the printing of successive dots around the text region boundaries. The method is extended to halftone color images to sharpen the text regions. The proposed adaptive error diffusion algorithm involves color halftoning that controls the amount of edge enhancement using a general error filter. However, edge enhancement unfortunately produces color distortion, as edge enhancement and color difference are trade-offs. The multiplicative edge enhancement parameters are selected based on the amount of edge sharpening and color difference. Plus, an additional error factor is introduced to reduce the dot elimination artifact generated by the edge enhancement error diffusion. In experiments, the text of a scanned image was sharper when using the proposed algorithm than with conventional error diffusion without changing the background.

  3. Efficient text segmentation and adaptive color error diffusion for text enhancement

    NASA Astrophysics Data System (ADS)

    Kwon, Jae-Hyun; Park, Tae-Yong; Kim, Yun-Tae; Cho, Yang-Ho; Ha, Yeong-Ho

    2004-12-01

    This paper proposes an adaptive error diffusion algorithm for text enhancement followed by an efficient text segmentation that uses the maximum gradient difference (MGD). The gradients are calculated along with scan lines, then the MGD values are filled within a local window to merge text segments. If the value is above a threshold, the pixel is considered as potential text. Isolated segments are then eliminated in a non-text region filtering process. After the text segmentation, a conventional error diffusion method is applied to the background, while edge enhancement error diffusion is used for the text. Since it is inevitable that visually objectionable artifacts are generated when using two different halftoning algorithms, gradual dilation is proposed to minimize the boundary artifacts in the segmented text blocks before halftoning. Sharpening based on the gradually dilated text region (GDTR) then prevents the printing of successive dots around the text region boundaries. The method is extended to halftone color images to sharpen the text regions. The proposed adaptive error diffusion algorithm involves color halftoning that controls the amount of edge enhancement using a general error filter. However, edge enhancement unfortunately produces color distortion, as edge enhancement and color difference are trade-offs. The multiplicative edge enhancement parameters are selected based on the amount of edge sharpening and color difference. Plus, an additional error factor is introduced to reduce the dot elimination artifact generated by the edge enhancement error diffusion. In experiments, the text of a scanned image was sharper when using the proposed algorithm than with conventional error diffusion without changing the background.

  4. Automated Tumor Volumetry Using Computer-Aided Image Segmentation

    PubMed Central

    Bilello, Michel; Sadaghiani, Mohammed Salehi; Akbari, Hamed; Atthiah, Mark A.; Ali, Zarina S.; Da, Xiao; Zhan, Yiqang; O'Rourke, Donald; Grady, Sean M.; Davatzikos, Christos

    2015-01-01

    Rationale and Objectives Accurate segmentation of brain tumors, and quantification of tumor volume, is important for diagnosis, monitoring, and planning therapeutic intervention. Manual segmentation is not widely used because of time constraints. Previous efforts have mainly produced methods that are tailored to a particular type of tumor or acquisition protocol and have mostly failed to produce a method that functions on different tumor types and is robust to changes in scanning parameters, resolution, and image quality, thereby limiting their clinical value. Herein, we present a semiautomatic method for tumor segmentation that is fast, accurate, and robust to a wide variation in image quality and resolution. Materials and Methods A semiautomatic segmentation method based on the geodesic distance transform was developed and validated by using it to segment 54 brain tumors. Glioblastomas, meningiomas, and brain metastases were segmented. Qualitative validation was based on physician ratings provided by three clinical experts. Quantitative validation was based on comparing semiautomatic and manual segmentations. Results Tumor segmentations obtained using manual and automatic methods were compared quantitatively using the Dice measure of overlap. Subjective evaluation was performed by having human experts rate the computerized segmentations on a 0–5 rating scale where 5 indicated perfect segmentation. Conclusions The proposed method addresses a significant, unmet need in the field of neuro-oncology. Specifically, this method enables clinicians to obtain accurate and reproducible tumor volumes without the need for manual segmentation. PMID:25770633

  5. Validation of image segmentation by estimating rater bias and variance.

    PubMed

    Warfield, Simon K; Zou, Kelly H; Wells, William M

    2006-01-01

    The accuracy and precision of segmentations of medical images has been difficult to quantify in the absence of a "ground truth" or reference standard segmentation for clinical data. Although physical or digital phantoms can help by providing a reference standard, they do not allow the reproduction of the full range of imaging and anatomical characteristics observed in clinical data. An alternative assessment approach is to compare to segmentations generated by domain experts. Segmentations may be generated by raters who are trained experts or by automated image analysis algorithms. Typically these segmentations differ due to intra-rater and inter-rater variability. The most appropriate way to compare such segmentations has been unclear. We present here a new algorithm to enable the estimation of performance characteristics, and a true labeling, from observations of segmentations of imaging data where segmentation labels may be ordered or continuous measures. This approach may be used with, amongst others, surface, distance transform or level set representations of segmentations, and can be used to assess whether or not a rater consistently over-estimates or under-estimates the position of a boundary. PMID:17354851

  6. Validation of image segmentation by estimating rater bias and variance.

    PubMed

    Warfield, Simon K; Zou, Kelly H; Wells, William M

    2008-07-13

    The accuracy and precision of segmentations of medical images has been difficult to quantify in the absence of a 'ground truth' or reference standard segmentation for clinical data. Although physical or digital phantoms can help by providing a reference standard, they do not allow the reproduction of the full range of imaging and anatomical characteristics observed in clinical data. An alternative assessment approach is to compare with segmentations generated by domain experts. Segmentations may be generated by raters who are trained experts or by automated image analysis algorithms. Typically, these segmentations differ due to intra-rater and inter-rater variability. The most appropriate way to compare such segmentations has been unclear. We present here a new algorithm to enable the estimation of performance characteristics, and a true labelling, from observations of segmentations of imaging data where segmentation labels may be ordered or continuous measures. This approach may be used with, among others, surface, distance transform or level-set representations of segmentations, and can be used to assess whether or not a rater consistently overestimates or underestimates the position of a boundary. PMID:18407896

  7. Pixel classification based color image segmentation using quaternion exponent moments.

    PubMed

    Wang, Xiang-Yang; Wu, Zhi-Fang; Chen, Liang; Zheng, Hong-Liang; Yang, Hong-Ying

    2016-02-01

    Image segmentation remains an important, but hard-to-solve, problem since it appears to be application dependent with usually no a priori information available regarding the image structure. In recent years, many image segmentation algorithms have been developed, but they are often very complex and some undesired results occur frequently. In this paper, we propose a pixel classification based color image segmentation using quaternion exponent moments. Firstly, the pixel-level image feature is extracted based on quaternion exponent moments (QEMs), which can capture effectively the image pixel content by considering the correlation between different color channels. Then, the pixel-level image feature is used as input of twin support vector machines (TSVM) classifier, and the TSVM model is trained by selecting the training samples with Arimoto entropy thresholding. Finally, the color image is segmented with the trained TSVM model. The proposed scheme has the following advantages: (1) the effective QEMs is introduced to describe color image pixel content, which considers the correlation between different color channels, (2) the excellent TSVM classifier is utilized, which has lower computation time and higher classification accuracy. Experimental results show that our proposed method has very promising segmentation performance compared with the state-of-the-art segmentation approaches recently proposed in the literature.

  8. Pixel classification based color image segmentation using quaternion exponent moments.

    PubMed

    Wang, Xiang-Yang; Wu, Zhi-Fang; Chen, Liang; Zheng, Hong-Liang; Yang, Hong-Ying

    2016-02-01

    Image segmentation remains an important, but hard-to-solve, problem since it appears to be application dependent with usually no a priori information available regarding the image structure. In recent years, many image segmentation algorithms have been developed, but they are often very complex and some undesired results occur frequently. In this paper, we propose a pixel classification based color image segmentation using quaternion exponent moments. Firstly, the pixel-level image feature is extracted based on quaternion exponent moments (QEMs), which can capture effectively the image pixel content by considering the correlation between different color channels. Then, the pixel-level image feature is used as input of twin support vector machines (TSVM) classifier, and the TSVM model is trained by selecting the training samples with Arimoto entropy thresholding. Finally, the color image is segmented with the trained TSVM model. The proposed scheme has the following advantages: (1) the effective QEMs is introduced to describe color image pixel content, which considers the correlation between different color channels, (2) the excellent TSVM classifier is utilized, which has lower computation time and higher classification accuracy. Experimental results show that our proposed method has very promising segmentation performance compared with the state-of-the-art segmentation approaches recently proposed in the literature. PMID:26618250

  9. [Research on maize multispectral image accurate segmentation and chlorophyll index estimation].

    PubMed

    Wu, Qian; Sun, Hong; Li, Min-zan; Song, Yuan-yuan; Zhang, Yan-e

    2015-01-01

    In order to rapidly acquire maize growing information in the field, a non-destructive method of maize chlorophyll content index measurement was conducted based on multi-spectral imaging technique and imaging processing technology. The experiment was conducted at Yangling in Shaanxi province of China and the crop was Zheng-dan 958 planted in about 1 000 m X 600 m experiment field. Firstly, a 2-CCD multi-spectral image monitoring system was available to acquire the canopy images. The system was based on a dichroic prism, allowing precise separation of the visible (Blue (B), Green (G), Red (R): 400-700 nm) and near-infrared (NIR, 760-1 000 nm) band. The multispectral images were output as RGB and NIR images via the system vertically fixed to the ground with vertical distance of 2 m and angular field of 50°. SPAD index of each sample was'measured synchronously to show the chlorophyll content index. Secondly, after the image smoothing using adaptive smooth filtering algorithm, the NIR maize image was selected to segment the maize leaves from background, because there was a big difference showed in gray histogram between plant and soil background. The NIR image segmentation algorithm was conducted following steps of preliminary and accuracy segmentation: (1) The results of OTSU image segmentation method and the variable threshold algorithm were discussed. It was revealed that the latter was better one in corn plant and weed segmentation. As a result, the variable threshold algorithm based on local statistics was selected for the preliminary image segmentation. The expansion and corrosion were used to optimize the segmented image. (2) The region labeling algorithm was used to segment corn plants from soil and weed background with an accuracy of 95. 59 %. And then, the multi-spectral image of maize canopy was accurately segmented in R, G and B band separately. Thirdly, the image parameters were abstracted based on the segmented visible and NIR images. The average gray

  10. Adaptive optical ghost imaging through atmospheric turbulence.

    PubMed

    Shi, Dongfeng; Fan, Chengyu; Zhang, Pengfei; Zhang, Jinghui; Shen, Hong; Qiao, Chunhong; Wang, Yingjian

    2012-12-17

    We demonstrate for the first time (to our knowledge) that a high-quality image can still be obtained in atmospheric turbulence by applying adaptive optical ghost imaging (AOGI) system even when conventional ghost imaging system fails to produce an image. The performance of AOGI under different strength of atmospheric turbulence is investigated by simulation. The influence of adaptive optics system with different numbers of adaptive mirror elements on obtained image quality is also studied.

  11. Graph run-length matrices for histopathological image segmentation.

    PubMed

    Tosun, Akif Burak; Gunduz-Demir, Cigdem

    2011-03-01

    The histopathological examination of tissue specimens is essential for cancer diagnosis and grading. However, this examination is subject to a considerable amount of observer variability as it mainly relies on visual interpretation of pathologists. To alleviate this problem, it is very important to develop computational quantitative tools, for which image segmentation constitutes the core step. In this paper, we introduce an effective and robust algorithm for the segmentation of histopathological tissue images. This algorithm incorporates the background knowledge of the tissue organization into segmentation. For this purpose, it quantifies spatial relations of cytological tissue components by constructing a graph and uses this graph to define new texture features for image segmentation. This new texture definition makes use of the idea of gray-level run-length matrices. However, it considers the runs of cytological components on a graph to form a matrix, instead of considering the runs of pixel intensities. Working with colon tissue images, our experiments demonstrate that the texture features extracted from "graph run-length matrices" lead to high segmentation accuracies, also providing a reasonable number of segmented regions. Compared with four other segmentation algorithms, the results show that the proposed algorithm is more effective in histopathological image segmentation.

  12. Adaptive local thresholding for robust nucleus segmentation utilizing shape priors

    NASA Astrophysics Data System (ADS)

    Wang, Xiuzhong; Srinivas, Chukka

    2016-03-01

    This paper describes a novel local thresholding method for foreground detection. First, a Canny edge detection method is used for initial edge detection. Then, tensor voting is applied on the initial edge pixels, using a nonsymmetric tensor field tailored to encode prior information about nucleus size, shape, and intensity spatial distribution. Tensor analysis is then performed to generate the saliency image and, based on that, the refined edge. Next, the image domain is divided into blocks. In each block, at least one foreground and one background pixel are sampled for each refined edge pixel. The saliency weighted foreground histogram and background histogram are then created. These two histograms are used to calculate a threshold by minimizing the background and foreground pixel classification error. The block-wise thresholds are then used to generate the threshold for each pixel via interpolation. Finally, the foreground is obtained by comparing the original image with the threshold image. The effective use of prior information, combined with robust techniques, results in far more reliable foreground detection, which leads to robust nucleus segmentation.

  13. An automated method for segmentation of epithelial cervical cells in images of ThinPrep.

    PubMed

    Harandi, Negar M; Sadri, Saeed; Moghaddam, Noushin A; Amirfattahi, Rassul

    2010-12-01

    We present an automated method for segmentation of epithelial cells in images taken from ThinPrep scenes by a digital camera in a cytology lab. The method covers both steps of localization of cell objects in low resolution and detection of cytoplasm and nucleus boundary in high resolution. The underlying method makes use of geometric active contours as a powerful tool of segmentation. We also provide the analysis of the connected cells. For this purpose an automatic circular decomposition method is incorporated and adapted to the application by changing its segmentation condition. The results are evaluated numerically and compared with those of previous work in literature. PMID:20703603

  14. GPU-accelerated MRF segmentation algorithm for SAR images

    NASA Astrophysics Data System (ADS)

    Sui, Haigang; Peng, Feifei; Xu, Chuan; Sun, Kaimin; Gong, Jianya

    2012-06-01

    Markov Random Field (MRF) approaches have been widely studied for Synthetic Aperture Radar (SAR) image segmentation, but they have a large computational cost and hence are not widely used in practice. Fortunately parallel algorithms have been documented to enjoy significant speedups when ported to run on a graphics processing units (GPUs) instead of a standard CPU. Presented here is an implementation of graphics processing units in General Purpose Computation (GPGPU) for SAR image segmentation based on the MRF method, using the C-oriented Compute Unified Device Architecture (CUDA) developed by NVIDIA. This experiment with GPGPU shows that the speed of segmentation can be increased by a factor of 10 for large images.

  15. Objective measurements to evaluate glottal space segmentation from laryngeal images.

    PubMed

    Gutiérrez-Arriola, J M; Osma-Ruiz, V; Sáenz-Lechón, N; Godino-Llorente, J I; Fraile, R; Arias-Londoño, J D

    2012-01-01

    Objective evaluation of the results of medical image segmentation is a known problem. Applied to the task of automatically detecting the glottal area from laryngeal images, this paper proposes a new objective measurement to evaluate the quality of a segmentation algorithm by comparing with the results given by a human expert. The new figure of merit is called Area Index, and its effectiveness is compared with one of the most used figures of merit found in the literature: the Pratt Index. Results over 110 laryngeal images presented high correlations between both indexes, demonstrating that the proposed measure is comparable to the Pratt Index and it is a good indicator of the segmentation quality.

  16. 3D Prostate Segmentation of Ultrasound Images Combining Longitudinal Image Registration and Machine Learning

    PubMed Central

    Yang, Xiaofeng; Fei, Baowei

    2012-01-01

    We developed a three-dimensional (3D) segmentation method for transrectal ultrasound (TRUS) images, which is based on longitudinal image registration and machine learning. Using longitudinal images of each individual patient, we register previously acquired images to the new images of the same subject. Three orthogonal Gabor filter banks were used to extract texture features from each registered image. Patient-specific Gabor features from the registered images are used to train kernel support vector machines (KSVMs) and then to segment the newly acquired prostate image. The segmentation method was tested in TRUS data from five patients. The average surface distance between our and manual segmentation is 1.18 ± 0.31 mm, indicating that our automatic segmentation method based on longitudinal image registration is feasible for segmenting the prostate in TRUS images. PMID:24027622

  17. Understanding the optics to aid microscopy image segmentation.

    PubMed

    Yin, Zhaozheng; Li, Kang; Kanade, Takeo; Chen, Mei

    2010-01-01

    Image segmentation is essential for many automated microscopy image analysis systems. Rather than treating microscopy images as general natural images and rushing into the image processing warehouse for solutions, we propose to study a microscope's optical properties to model its image formation process first using phase contrast microscopy as an exemplar. It turns out that the phase contrast imaging system can be relatively well explained by a linear imaging model. Using this model, we formulate a quadratic optimization function with sparseness and smoothness regularizations to restore the "authentic" phase contrast images that directly correspond to specimen's optical path length without phase contrast artifacts such as halo and shade-off. With artifacts removed, high quality segmentation can be achieved by simply thresholding the restored images. The imaging model and restoration method are quantitatively evaluated on two sequences with thousands of cells captured over several days. PMID:20879233

  18. Sonar image segmentation using an unsupervised hierarchical MRF model.

    PubMed

    Mignotte, M; Collet, C; Perez, P; Bouthemy, P

    2000-01-01

    This paper is concerned with hierarchical Markov random field (MRP) models and their application to sonar image segmentation. We present an original hierarchical segmentation procedure devoted to images given by a high-resolution sonar. The sonar image is segmented into two kinds of regions: shadow (corresponding to a lack of acoustic reverberation behind each object lying on the sea-bed) and sea-bottom reverberation. The proposed unsupervised scheme takes into account the variety of the laws in the distribution mixture of a sonar image, and it estimates both the parameters of noise distributions and the parameters of the Markovian prior. For the estimation step, we use an iterative technique which combines a maximum likelihood approach (for noise model parameters) with a least-squares method (for MRF-based prior). In order to model more precisely the local and global characteristics of image content at different scales, we introduce a hierarchical model involving a pyramidal label field. It combines coarse-to-fine causal interactions with a spatial neighborhood structure. This new method of segmentation, called the scale causal multigrid (SCM) algorithm, has been successfully applied to real sonar images and seems to be well suited to the segmentation of very noisy images. The experiments reported in this paper demonstrate that the discussed method performs better than other hierarchical schemes for sonar image segmentation.

  19. Pathological leucocyte segmentation algorithm based on hyperspectral imaging technique

    NASA Astrophysics Data System (ADS)

    Guan, Yana; Li, Qingli; Wang, Yiting; Liu, Hongying; Zhu, Ziqiang

    2012-05-01

    White blood cells (WBC) are comparatively significant components in the human blood system, and they have a pathological relationship with some blood-related diseases. To analyze the disease information accurately, the most essential work is to segment WBCs. We propose a new method for pathological WBC segmentation based on a hyperspectral imaging system. This imaging system is used to capture WBC images, which is characterized by acquiring 1-D spectral information and 2-D spatial information for each pixel. A spectral information divergence algorithm is presented to segment pathological WBCs into four parts. In order to evaluate the performance of the new approach, K-means and spectral angle mapper-based segmental methods are tested in contrast on six groups of blood smears. Experimental results show that the presented method can segment pathological WBCs more accurately, regardless of their irregular shapes, sizes, and gray-values.

  20. A Bayesian Approach for Image Segmentation with Shape Priors

    SciTech Connect

    Chang, Hang; Yang, Qing; Parvin, Bahram

    2008-06-20

    Color and texture have been widely used in image segmentation; however, their performance is often hindered by scene ambiguities, overlapping objects, or missingparts. In this paper, we propose an interactive image segmentation approach with shape prior models within a Bayesian framework. Interactive features, through mouse strokes, reduce ambiguities, and the incorporation of shape priors enhances quality of the segmentation where color and/or texture are not solely adequate. The novelties of our approach are in (i) formulating the segmentation problem in a well-de?ned Bayesian framework with multiple shape priors, (ii) ef?ciently estimating parameters of the Bayesian model, and (iii) multi-object segmentation through user-speci?ed priors. We demonstrate the effectiveness of our method on a set of natural and synthetic images.

  1. An improved level set method for vertebra CT image segmentation

    PubMed Central

    2013-01-01

    Background Clinical diagnosis and therapy for the lumbar disc herniation requires accurate vertebra segmentation. The complex anatomical structure and the degenerative deformations of the vertebrae makes its segmentation challenging. Methods An improved level set method, namely edge- and region-based level set method (ERBLS), is proposed for vertebra CT images segmentation. By considering the gradient information and local region characteristics of images, the proposed model can efficiently segment images with intensity inhomogeneity and blurry or discontinuous boundaries. To reduce the dependency on manual initialization in many active contour models and for an automatic segmentation, a simple initialization method for the level set function is built, which utilizes the Otsu threshold. In addition, the need of the costly re-initialization procedure is completely eliminated. Results Experimental results on both synthetic and real images demonstrated that the proposed ERBLS model is very robust and efficient. Compared with the well-known local binary fitting (LBF) model, our method is much more computationally efficient and much less sensitive to the initial contour. The proposed method has also applied to 56 patient data sets and produced very promising results. Conclusions An improved level set method suitable for vertebra CT images segmentation is proposed. It has the flexibility of segmenting the vertebra CT images with blurry or discontinuous edges, internal inhomogeneity and no need of re-initialization. PMID:23714300

  2. Segmentation of tongue muscles from super-resolution magnetic resonance images.

    PubMed

    Ibragimov, Bulat; Prince, Jerry L; Murano, Emi Z; Woo, Jonghye; Stone, Maureen; Likar, Boštjan; Pernuš, Franjo; Vrtovec, Tomaž

    2015-02-01

    Imaging and quantification of tongue anatomy is helpful in surgical planning, post-operative rehabilitation of tongue cancer patients, and studying of how humans adapt and learn new strategies for breathing, swallowing and speaking to compensate for changes in function caused by disease, medical interventions or aging. In vivo acquisition of high-resolution three-dimensional (3D) magnetic resonance (MR) images with clearly visible tongue muscles is currently not feasible because of breathing and involuntary swallowing motions that occur over lengthy imaging times. However, recent advances in image reconstruction now allow the generation of super-resolution 3D MR images from sets of orthogonal images, acquired at a high in-plane resolution and combined using super-resolution techniques. This paper presents, to the best of our knowledge, the first attempt towards automatic tongue muscle segmentation from MR images. We devised a database of ten super-resolution 3D MR images, in which the genioglossus and inferior longitudinalis tongue muscles were manually segmented and annotated with landmarks. We demonstrate the feasibility of segmenting the muscles of interest automatically by applying the landmark-based game-theoretic framework (GTF), where a landmark detector based on Haar-like features and an optimal assignment-based shape representation were integrated. The obtained segmentation results were validated against an independent manual segmentation performed by a second observer, as well as against B-splines and demons atlasing approaches. The segmentation performance resulted in mean Dice coefficients of 85.3%, 81.8%, 78.8% and 75.8% for the second observer, GTF, B-splines atlasing and demons atlasing, respectively. The obtained level of segmentation accuracy indicates that computerized tongue muscle segmentation may be used in surgical planning and treatment outcome analysis of tongue cancer patients, and in studies of normal subjects and subjects with speech and

  3. Segmentation of tongue muscles from super-resolution magnetic resonance images.

    PubMed

    Ibragimov, Bulat; Prince, Jerry L; Murano, Emi Z; Woo, Jonghye; Stone, Maureen; Likar, Boštjan; Pernuš, Franjo; Vrtovec, Tomaž

    2015-02-01

    Imaging and quantification of tongue anatomy is helpful in surgical planning, post-operative rehabilitation of tongue cancer patients, and studying of how humans adapt and learn new strategies for breathing, swallowing and speaking to compensate for changes in function caused by disease, medical interventions or aging. In vivo acquisition of high-resolution three-dimensional (3D) magnetic resonance (MR) images with clearly visible tongue muscles is currently not feasible because of breathing and involuntary swallowing motions that occur over lengthy imaging times. However, recent advances in image reconstruction now allow the generation of super-resolution 3D MR images from sets of orthogonal images, acquired at a high in-plane resolution and combined using super-resolution techniques. This paper presents, to the best of our knowledge, the first attempt towards automatic tongue muscle segmentation from MR images. We devised a database of ten super-resolution 3D MR images, in which the genioglossus and inferior longitudinalis tongue muscles were manually segmented and annotated with landmarks. We demonstrate the feasibility of segmenting the muscles of interest automatically by applying the landmark-based game-theoretic framework (GTF), where a landmark detector based on Haar-like features and an optimal assignment-based shape representation were integrated. The obtained segmentation results were validated against an independent manual segmentation performed by a second observer, as well as against B-splines and demons atlasing approaches. The segmentation performance resulted in mean Dice coefficients of 85.3%, 81.8%, 78.8% and 75.8% for the second observer, GTF, B-splines atlasing and demons atlasing, respectively. The obtained level of segmentation accuracy indicates that computerized tongue muscle segmentation may be used in surgical planning and treatment outcome analysis of tongue cancer patients, and in studies of normal subjects and subjects with speech and

  4. A translational registration system for LANDSAT image segments

    NASA Technical Reports Server (NTRS)

    Parada, N. D. J. (Principal Investigator); Erthal, G. J.; Velasco, F. R. D.; Mascarenhas, N. D. D.

    1983-01-01

    The use of satellite images obtained from various dates is essential for crop forecast systems. In order to make possible a multitemporal analysis, it is necessary that images belonging to each acquisition have pixel-wise correspondence. A system developed to obtain, register and record image segments from LANDSAT images in computer compatible tapes is described. The translational registration of the segments is performed by correlating image edges in different acquisitions. The system was constructed for the Burroughs B6800 computer in ALGOL language.

  5. Three-dimensional segmentation of bone structures in CT images

    NASA Astrophysics Data System (ADS)

    Boehm, Guenther; Knoll, Christian J.; Grau Colomer, Vincente; Alcaniz-Raya, Mariano L.; Albalat, Salvador E.

    1999-05-01

    This work is concerned with the implementation of a fully 3D-consistent, automatic segmentation of bone structures in CT images. The morphological watersheds algorithm has been chosen as the base of the low-level segmentation. The over- segmentation, a phenomenon normally involved with this transformation, has been sorted out successfully by inserting modifying modules that act already within the algorithm. When dealing with a maxillofacial image, this approach also includes the possibility to provide two different divisions of the image: a fine-grained tessellation geared to the following high-level segmentation and a more coarse-grained one for the segmentation of the teeth. In the knowledge-based high-level segmentation, probabilistic considerations make use of specific properties of the 3D low-level regions to find the most probable tissue for each region. Low-level regions that cannot be classified with the necessary certainty are passed to a second stage, where--embedded in their respective environment--they are compared with structural patterns deduced from anatomical knowledge. The tooth segmentation takes the coarse-grained tessellation as its starting point. The few regions making up each tooth are grouped to 3D envelopes--one envelope per tooth. Matched filtering detects the bases of these envelopes. After a refinement they are fitted into the fine- grained, high-level segmented image.

  6. Optimized adaptation algorithm for HEVC/H.265 dynamic adaptive streaming over HTTP using variable segment duration

    NASA Astrophysics Data System (ADS)

    Irondi, Iheanyi; Wang, Qi; Grecos, Christos

    2016-04-01

    Adaptive video streaming using HTTP has become popular in recent years for commercial video delivery. The recent MPEG-DASH standard allows interoperability and adaptability between servers and clients from different vendors. The delivery of the MPD (Media Presentation Description) files in DASH and the DASH client behaviours are beyond the scope of the DASH standard. However, the different adaptation algorithms employed by the clients do affect the overall performance of the system and users' QoE (Quality of Experience), hence the need for research in this field. Moreover, standard DASH delivery is based on fixed segments of the video. However, there is no standard segment duration for DASH where various fixed segment durations have been employed by different commercial solutions and researchers with their own individual merits. Most recently, the use of variable segment duration in DASH has emerged but only a few preliminary studies without practical implementation exist. In addition, such a technique requires a DASH client to be aware of segment duration variations, and this requirement and the corresponding implications on the DASH system design have not been investigated. This paper proposes a segment-duration-aware bandwidth estimation and next-segment selection adaptation strategy for DASH. Firstly, an MPD file extension scheme to support variable segment duration is proposed and implemented in a realistic hardware testbed. The scheme is tested on a DASH client, and the tests and analysis have led to an insight on the time to download next segment and the buffer behaviour when fetching and switching between segments of different playback durations. Issues like sustained buffering when switching between segments of different durations and slow response to changing network conditions are highlighted and investigated. An enhanced adaptation algorithm is then proposed to accurately estimate the bandwidth and precisely determine the time to download the next

  7. Unified wavelet and gaussian filtering for segmentation of CT images; application in segmentation of bone in pelvic CT images

    PubMed Central

    Vasilache, Simina; Ward, Kevin; Cockrell, Charles; Ha, Jonathan; Najarian, Kayvan

    2009-01-01

    Background The analysis of pelvic CT scans is a crucial step for detecting and assessing the severity of Traumatic Pelvic Injuries. Automating the processing of pelvic CT scans could impact decision accuracy, decrease the time for decision making, and reduce health care cost. This paper discusses a method to automate the segmentation of bone from pelvic CT images. Accurate segmentation of bone is very important for developing an automated assisted-decision support system for Traumatic Pelvic Injury diagnosis and treatment. Methods The automated method for pelvic CT bone segmentation is a hierarchical approach that combines filtering and histogram equalization, for image enhancement, wavelet analysis and automated seeded region growing. Initial results of segmentation are used to identify the region where bone is present and to target histogram equalization towards the specific area. Speckle Reducing Anisotropic Didffusion (SRAD) filter is applied to accentuate the desired features in the region. Automated seeded region growing is performed to refine the initial bone segmentation results. Results The proposed method automatically processes pelvic CT images and produces accurate segmentation. Bone connectivity is achieved and the contours and sizes of bones are true to the actual contour and size displayed in the original image. Results are promising and show great potential for fracture detection and assessing hemorrhage presence and severity. Conclusion Preliminary experimental results of the automated method show accurate bone segmentation. The novelty of the method lies in the unique hierarchical combination of image enhancement and segmentation methods that aims at maximizing the advantages of the combined algorithms. The proposed method has the following advantages: it produces accurate bone segmentation with maintaining bone contour and size true to the original image and is suitable for automated bone segmentation from pelvic CT images. PMID:19891802

  8. Comparison of automated and manual segmentation of hippocampus MR images

    NASA Astrophysics Data System (ADS)

    Haller, John W.; Christensen, Gary E.; Miller, Michael I.; Joshi, Sarang C.; Gado, Mokhtar; Csernansky, John G.; Vannier, Michael W.

    1995-05-01

    The precision and accuracy of area estimates from magnetic resonance (MR) brain images and using manual and automated segmentation methods are determined. Areas of the human hippocampus were measured to compare a new automatic method of segmentation with regions of interest drawn by an expert. MR images of nine normal subjects and nine schizophrenic patients were acquired with a 1.5-T unit (Siemens Medical Systems, Inc., Iselin, New Jersey). From each individual MPRAGE 3D volume image a single comparable 2-D slice (matrix equals 256 X 256) was chosen which corresponds to the same coronal slice of the hippocampus. The hippocampus was first manually segmented, then segmented using high dimensional transformations of a digital brain atlas to individual brain MR images. The repeatability of a trained rater was assessed by comparing two measurements from each individual subject. Variability was also compared within and between subject groups of schizophrenics and normal subjects. Finally, the precision and accuracy of automated segmentation of hippocampal areas were determined by comparing automated measurements to manual segmentation measurements made by the trained rater on MR and brain slice images. The results demonstrate the high repeatability of area measurement from MR images of the human hippocampus. Automated segmentation using high dimensional transformations from a digital brain atlas provides repeatability superior to that of manual segmentation. Furthermore, the validity of automated measurements was demonstrated by a high correlation with manual segmentation measurements made by a trained rater. Quantitative morphometry of brain substructures (e.g. hippocampus) is feasible by use of a high dimensional transformation of a digital brain atlas to an individual MR image. This method automates the search for neuromorphological correlates of schizophrenia by a new mathematically robust method with unprecedented sensitivity to small local and regional differences.

  9. Image segmentation evaluation for very-large datasets

    NASA Astrophysics Data System (ADS)

    Reeves, Anthony P.; Liu, Shuang; Xie, Yiting

    2016-03-01

    With the advent of modern machine learning methods and fully automated image analysis there is a need for very large image datasets having documented segmentations for both computer algorithm training and evaluation. Current approaches of visual inspection and manual markings do not scale well to big data. We present a new approach that depends on fully automated algorithm outcomes for segmentation documentation, requires no manual marking, and provides quantitative evaluation for computer algorithms. The documentation of new image segmentations and new algorithm outcomes are achieved by visual inspection. The burden of visual inspection on large datasets is minimized by (a) customized visualizations for rapid review and (b) reducing the number of cases to be reviewed through analysis of quantitative segmentation evaluation. This method has been applied to a dataset of 7,440 whole-lung CT images for 6 different segmentation algorithms designed to fully automatically facilitate the measurement of a number of very important quantitative image biomarkers. The results indicate that we could achieve 93% to 99% successful segmentation for these algorithms on this relatively large image database. The presented evaluation method may be scaled to much larger image databases.

  10. On the convergence of EM-like algorithms for image segmentation using Markov random fields.

    PubMed

    Roche, Alexis; Ribes, Delphine; Bach-Cuadra, Meritxell; Krüger, Gunnar

    2011-12-01

    Inference of Markov random field images segmentation models is usually performed using iterative methods which adapt the well-known expectation-maximization (EM) algorithm for independent mixture models. However, some of these adaptations are ad hoc and may turn out numerically unstable. In this paper, we review three EM-like variants for Markov random field segmentation and compare their convergence properties both at the theoretical and practical levels. We specifically advocate a numerical scheme involving asynchronous voxel updating, for which general convergence results can be established. Our experiments on brain tissue classification in magnetic resonance images provide evidence that this algorithm may achieve significantly faster convergence than its competitors while yielding at least as good segmentation results.

  11. Mammographic images segmentation based on chaotic map clustering algorithm

    PubMed Central

    2014-01-01

    Background This work investigates the applicability of a novel clustering approach to the segmentation of mammographic digital images. The chaotic map clustering algorithm is used to group together similar subsets of image pixels resulting in a medically meaningful partition of the mammography. Methods The image is divided into pixels subsets characterized by a set of conveniently chosen features and each of the corresponding points in the feature space is associated to a map. A mutual coupling strength between the maps depending on the associated distance between feature space points is subsequently introduced. On the system of maps, the simulated evolution through chaotic dynamics leads to its natural partitioning, which corresponds to a particular segmentation scheme of the initial mammographic image. Results The system provides a high recognition rate for small mass lesions (about 94% correctly segmented inside the breast) and the reproduction of the shape of regions with denser micro-calcifications in about 2/3 of the cases, while being less effective on identification of larger mass lesions. Conclusions We can summarize our analysis by asserting that due to the particularities of the mammographic images, the chaotic map clustering algorithm should not be used as the sole method of segmentation. It is rather the joint use of this method along with other segmentation techniques that could be successfully used for increasing the segmentation performance and for providing extra information for the subsequent analysis stages such as the classification of the segmented ROI. PMID:24666766

  12. Comparison of algorithms for ultrasound image segmentation without ground truth

    NASA Astrophysics Data System (ADS)

    Sikka, Karan; Deserno, Thomas M.

    2010-02-01

    Image segmentation is a pre-requisite to medical image analysis. A variety of segmentation algorithms have been proposed, and most are evaluated on a small dataset or based on classification of a single feature. The lack of a gold standard (ground truth) further adds to the discrepancy in these comparisons. This work proposes a new methodology for comparing image segmentation algorithms without ground truth by building a matrix called region-correlation matrix. Subsequently, suitable distance measures are proposed for quantitative assessment of similarity. The first measure takes into account the degree of region overlap or identical match. The second considers the degree of splitting or misclassification by using an appropriate penalty term. These measures are shown to satisfy the axioms of a quasi-metric. They are applied for a comparative analysis of synthetic segmentation maps to show their direct correlation with human intuition of similar segmentation. Since ultrasound images are difficult to segment and usually lack a ground truth, the measures are further used to compare the recently proposed spectral clustering algorithm (encoding spatial and edge information) with standard k-means over abdominal ultrasound images. Improving the parameterization and enlarging the feature space for k-means steadily increased segmentation quality to that of spectral clustering.

  13. Real-time kidney ultrasound image segmentation: a prospective study

    NASA Astrophysics Data System (ADS)

    Dahdouh, S.; Frenoux, E.; Osorio, A.

    2009-02-01

    Segmentation of ultrasound kidney images represents a challenge due to low quality data. Speckle, shadows, signal dropout and low contrast make segmentation a harsh task. In addition, kidney ultrasound imaging presents a great variability concerning the organ's shape on the image. This characteristic makes learning methods hard to use. The aim of this study is to develop a real time kidney ultrasound image segmentation method usable during surgical operations such as punctures. To deal with real time constraints, we decided to focus on region based methods and particularly split and merge algorithm. In this prospective study, the selection of the interesting area in the initial image is made by the physician, drawing a coarse bounding box around the organ. A pre-processing phase is first performed to correct image's artefacts. This phase is composed of three major steps. First, an image specification is made between the image to segment and a reference one. Then, a Haar wavelet filtering method is applied on the resulting image and finally an anisotropic diffusion filter is applied to smooth the result. Then, a split and merge algorithm is applied on the resulting image. Both split and merge criteria are based on regions statistics. Our method has been successfully applied on a set of 22 clinical images coming from 10 different patients and presenting different points of view regarding kidney's shape. We obtained very good results, for an average computational time of 8.5 seconds per image.

  14. Skin lesion image segmentation using Delaunay Triangulation for melanoma detection.

    PubMed

    Pennisi, Andrea; Bloisi, Domenico D; Nardi, Daniele; Giampetruzzi, Anna Rita; Mondino, Chiara; Facchiano, Antonio

    2016-09-01

    Developing automatic diagnostic tools for the early detection of skin cancer lesions in dermoscopic images can help to reduce melanoma-induced mortality. Image segmentation is a key step in the automated skin lesion diagnosis pipeline. In this paper, a fast and fully-automatic algorithm for skin lesion segmentation in dermoscopic images is presented. Delaunay Triangulation is used to extract a binary mask of the lesion region, without the need of any training stage. A quantitative experimental evaluation has been conducted on a publicly available database, by taking into account six well-known state-of-the-art segmentation methods for comparison. The results of the experimental analysis demonstrate that the proposed approach is highly accurate when dealing with benign lesions, while the segmentation accuracy significantly decreases when melanoma images are processed. This behavior led us to consider geometrical and color features extracted from the binary masks generated by our algorithm for classification, achieving promising results for melanoma detection.

  15. Skin lesion image segmentation using Delaunay Triangulation for melanoma detection.

    PubMed

    Pennisi, Andrea; Bloisi, Domenico D; Nardi, Daniele; Giampetruzzi, Anna Rita; Mondino, Chiara; Facchiano, Antonio

    2016-09-01

    Developing automatic diagnostic tools for the early detection of skin cancer lesions in dermoscopic images can help to reduce melanoma-induced mortality. Image segmentation is a key step in the automated skin lesion diagnosis pipeline. In this paper, a fast and fully-automatic algorithm for skin lesion segmentation in dermoscopic images is presented. Delaunay Triangulation is used to extract a binary mask of the lesion region, without the need of any training stage. A quantitative experimental evaluation has been conducted on a publicly available database, by taking into account six well-known state-of-the-art segmentation methods for comparison. The results of the experimental analysis demonstrate that the proposed approach is highly accurate when dealing with benign lesions, while the segmentation accuracy significantly decreases when melanoma images are processed. This behavior led us to consider geometrical and color features extracted from the binary masks generated by our algorithm for classification, achieving promising results for melanoma detection. PMID:27215953

  16. Neural cell image segmentation method based on support vector machine

    NASA Astrophysics Data System (ADS)

    Niu, Shiwei; Ren, Kan

    2015-10-01

    In the analysis of neural cell images gained by optical microscope, accurate and rapid segmentation is the foundation of nerve cell detection system. In this paper, a modified image segmentation method based on Support Vector Machine (SVM) is proposed to reduce the adverse impact caused by low contrast ratio between objects and background, adherent and clustered cells' interference etc. Firstly, Morphological Filtering and OTSU Method are applied to preprocess images for extracting the neural cells roughly. Secondly, the Stellate Vector, Circularity and Histogram of Oriented Gradient (HOG) features are computed to train SVM model. Finally, the incremental learning SVM classifier is used to classify the preprocessed images, and the initial recognition areas identified by the SVM classifier are added to the library as the positive samples for training SVM model. Experiment results show that the proposed algorithm can achieve much better segmented results than the classic segmentation algorithms.

  17. Spectral segmentation of polygonized images with normalized cuts

    SciTech Connect

    Matsekh, Anna; Skurikhin, Alexei; Rosten, Edward

    2009-01-01

    We analyze numerical behavior of the eigenvectors corresponding to the lowest eigenvalues of the generalized graph Laplacians arising in the Normalized Cuts formulations of the image segmentation problem on coarse polygonal grids.

  18. Object segmentation based on guided layering from video image

    NASA Astrophysics Data System (ADS)

    Lin, Guangfeng; Zhu, Hong; Fan, Caixia; Zhang, Erhu

    2011-09-01

    When the object is similar to the background, it is difficult to segment the completed human body object from video images. To solve the problem, this paper proposes an object segmentation algorithm based on guided layering from video images. This algorithm adopts the structure of advance by degrees, including three parts altogether. Each part constructs the different energy function in terms of the spatiotemporal information to maximize the posterior probability of segmentation label. In part one, the energy functions are established, respectively, with the frame difference information in the first layer and second layer. By optimization, the initial segmentation is solved in the first layer, and then the amended segmentation is obtained in the second layer. In part two, the energy function is built in the interframe with the shape feature as the prior guiding to eliminate the interframe difference of the segmentation result. In art three, the segmentation results in the previous two parts are fused to suppress or inhibit the over-repairing segmentation and the object shape variations in the adjacent two-frame. The results from the compared experiment indicate that this algorithm can obtain the completed human body object in the case of the video image with similarity between object and background.

  19. Fuzzy local Gaussian mixture model for brain MR image segmentation.

    PubMed

    Ji, Zexuan; Xia, Yong; Sun, Quansen; Chen, Qiang; Xia, Deshen; Feng, David Dagan

    2012-05-01

    Accurate brain tissue segmentation from magnetic resonance (MR) images is an essential step in quantitative brain image analysis. However, due to the existence of noise and intensity inhomogeneity in brain MR images, many segmentation algorithms suffer from limited accuracy. In this paper, we assume that the local image data within each voxel's neighborhood satisfy the Gaussian mixture model (GMM), and thus propose the fuzzy local GMM (FLGMM) algorithm for automated brain MR image segmentation. This algorithm estimates the segmentation result that maximizes the posterior probability by minimizing an objective energy function, in which a truncated Gaussian kernel function is used to impose the spatial constraint and fuzzy memberships are employed to balance the contribution of each GMM. We compared our algorithm to state-of-the-art segmentation approaches in both synthetic and clinical data. Our results show that the proposed algorithm can largely overcome the difficulties raised by noise, low contrast, and bias field, and substantially improve the accuracy of brain MR image segmentation.

  20. Optical image segmentation using neural-based wavelet filtering techniques

    NASA Astrophysics Data System (ADS)

    Veronin, Christopher P.; Priddy, Kevin L.; Rogers, Steven K.; Ayer, Kevin W.; Kabrisky, Matthew; Welsh, Byron M.

    1992-02-01

    This paper presents a neural based optical image segmentation scheme for locating potential targets in cluttered FLIR images. The advantage of such a scheme is speed, i.e., the speed of light. Such a design is critical to achieve real-time segmentation and classification for machine vision applications. The segmentation scheme used was based on texture discrimination and employed biologically based orientation specific filters (wavelet filters) as its main component. These filters are well understood impulse response functions of mammalian vision systems from input to striate cortex. By using the proper choice of aperture pair separation, dilation, and orientation, targets in FLIR imagery were optically segmented. Wavelet filtering is illustrated for glass template slides, as well as segmentation for static and real-time FLIR imagery displayed on a liquid crystal television.

  1. Watershed Merge Tree Classification for Electron Microscopy Image Segmentation

    SciTech Connect

    Liu, TIng; Jurrus, Elizabeth R.; Seyedhosseini, Mojtaba; Ellisman, Mark; Tasdizen, Tolga

    2012-11-11

    Automated segmentation of electron microscopy (EM) images is a challenging problem. In this paper, we present a novel method that utilizes a hierarchical structure and boundary classification for 2D neuron segmentation. With a membrane detection probability map, a watershed merge tree is built for the representation of hierarchical region merging from the watershed algorithm. A boundary classifier is learned with non-local image features to predict each potential merge in the tree, upon which merge decisions are made with consistency constraints in the sense of optimization to acquire the final segmentation. Independent of classifiers and decision strategies, our approach proposes a general framework for efficient hierarchical segmentation with statistical learning. We demonstrate that our method leads to a substantial improvement in segmentation accuracy.

  2. Fuzzy fusion of results of medical image segmentation

    NASA Astrophysics Data System (ADS)

    Guliato, Denise; Rangayyan, Rangaraj M.; Carnielli, Walter A.; Zuffo, Joao A.; Desautels, J. E. Leo

    1999-05-01

    We propose an abstract concept of data fusion based on finite automata and fuzzy sets to integrate and evaluate different sources of information, in particular results of multiple image segmentation procedures. We give an example of how the method may be applied to the problem of mammographic image segmentation to combine results of region growing and closed- contour detection techniques. We further propose a measure of fuzziness to assess the agreement between a segmented region and a reference contour. Results of application to breast tumor detection in mammograms indicate that the fusion results agree with reference contours provided by a radiologist to a higher extent than the results of the individual methods.

  3. A segmentation algorithm of intracranial hemorrhage CT image

    NASA Astrophysics Data System (ADS)

    Wang, Haibo; Chen, Zhiguo; Wang, Jianzhi

    2011-10-01

    To develop a computer aided detection (CAD) system that improves diagnostic accuracy of intracranial hemorrhage on cerebral CT. A method for CT image segmentation of brain is proposed, with which, several regions that are suspicious of hemorrhage can be segmented rapidly and effectively. Extracting intracranial area algorithm is introduced firstly to extract intracranial area. Secondly, FCM is employed twice, we named it with TFCM. FCM is first employed to identify areas of intracranial hemorrhage. Finally, FCM is employed to segment the lesions. Experimental results on real medical images demonstrate the efficiency and effectiveness.

  4. Adaptive deformable model for colonic polyp segmentation and measurement on CT colonography

    SciTech Connect

    Yao Jianhua; Summers, Ronald M.

    2007-05-15

    Polyp size is one important biomarker for the malignancy risk of a polyp. This paper presents an improved approach for colonic polyp segmentation and measurement on CT colonography images. The method is based on a combination of knowledge-guided intensity adjustment, fuzzy clustering, and adaptive deformable model. Since polyps on haustral folds are the most difficult to be segmented, we propose a dual-distance algorithm to first identify voxels on the folds, and then introduce a counter-force to control the model evolution. We derive linear and volumetric measurements from the segmentation. The experiment was conducted on 395 patients with 83 polyps, of which 43 polyps were on haustral folds. The results were validated against manual measurement from the optical colonoscopy and the CT colonography. The paired t-test showed no significant difference, and the R{sup 2} correlation was 0.61 for the linear measurement and 0.98 for the volumetric measurement. The mean Dice coefficient for volume overlap between automatic and manual segmentation was 0.752 (standard deviation 0.154)

  5. 3D segmentation of the true and false lumens on CT aortic dissection images

    NASA Astrophysics Data System (ADS)

    Fetnaci, Nawel; Łubniewski, Paweł; Miguel, Bruno; Lohou, Christophe

    2013-03-01

    Our works are related to aortic dissections which are a medical emergency and can quickly lead to death. In this paper, we want to retrieve in CT images the false and the true lumens which are aortic dissection features. Our aim is to provide a 3D view of the lumens that we can difficultly obtain either by volume rendering or by another visualization tool which only directly gives the outer contour of the aorta; or by other segmentation methods because they mainly directly segment either only the outer contour of the aorta or other connected arteries and organs both. In our work, we need to segment the two lumens separately; this segmentation will allow us to: distinguish them automatically, facilitate the landing of the aortic prosthesis, propose a virtual 3d navigation and do quantitative analysis. We chose to segment these data by using a deformable model based on the fast marching method. In the classical fast marching approach, a speed function is used to control the front propagation of a deforming curve. The speed function is only based on the image gradient. In our CT images, due to the low resolution, with the fast marching the front propagates from a lumen to the other; therefore, the gradient data is insufficient to have accurate segmentation results. In the paper, we have adapted the fast marching method more particularly by modifying the speed function and we succeed in segmenting the two lumens separately.

  6. A Unified Framework for Brain Segmentation in MR Images

    PubMed Central

    Yazdani, S.; Yusof, R.; Karimian, A.; Riazi, A. H.; Bennamoun, M.

    2015-01-01

    Brain MRI segmentation is an important issue for discovering the brain structure and diagnosis of subtle anatomical changes in different brain diseases. However, due to several artifacts brain tissue segmentation remains a challenging task. The aim of this paper is to improve the automatic segmentation of brain into gray matter, white matter, and cerebrospinal fluid in magnetic resonance images (MRI). We proposed an automatic hybrid image segmentation method that integrates the modified statistical expectation-maximization (EM) method and the spatial information combined with support vector machine (SVM). The combined method has more accurate results than what can be achieved with its individual techniques that is demonstrated through experiments on both real data and simulated images. Experiments are carried out on both synthetic and real MRI. The results of proposed technique are evaluated against manual segmentation results and other methods based on real T1-weighted scans from Internet Brain Segmentation Repository (IBSR) and simulated images from BrainWeb. The Kappa index is calculated to assess the performance of the proposed framework relative to the ground truth and expert segmentations. The results demonstrate that the proposed combined method has satisfactory results on both simulated MRI and real brain datasets. PMID:26089978

  7. Segmentation and image navigation in digitized spine x rays

    NASA Astrophysics Data System (ADS)

    Long, L. Rodney; Thoma, George R.

    2000-06-01

    The National Library of Medicine has archived a collection of 17,000 digitized x-rays of the cervical and lumbar spines. Extensive health information has been collected on the subjects of these x-rays, but no information has been derived from the image contents themselves. We are researching algorithms to segment anatomy in these images and to derive from the segmented data measurements useful for indexing this image set for characteristics important to researchers in rheumatology, bone morphometry, and related areas. Active Shape Modeling is currently being investigated for use in location and boundary definition for the vertebrae in these images.

  8. A Generative Model for Image Segmentation Based on Label Fusion

    PubMed Central

    Thomas Yeo, B. T.; Van Leemput, Koen; Fischl, Bruce; Golland, Polina

    2012-01-01

    We propose a nonparametric, probabilistic model for the automatic segmentation of medical images, given a training set of images and corresponding label maps. The resulting inference algorithms rely on pairwise registrations between the test image and individual training images. The training labels are then transferred to the test image and fused to compute the final segmentation of the test subject. Such label fusion methods have been shown to yield accurate segmentation, since the use of multiple registrations captures greater inter-subject anatomical variability and improves robustness against occasional registration failures. To the best of our knowledge, this manuscript presents the first comprehensive probabilistic framework that rigorously motivates label fusion as a segmentation approach. The proposed framework allows us to compare different label fusion algorithms theoretically and practically. In particular, recent label fusion or multiatlas segmentation algorithms are interpreted as special cases of our framework. We conduct two sets of experiments to validate the proposed methods. In the first set of experiments, we use 39 brain MRI scans—with manually segmented white matter, cerebral cortex, ventricles and subcortical structures—to compare different label fusion algorithms and the widely-used FreeSurfer whole-brain segmentation tool. Our results indicate that the proposed framework yields more accurate segmentation than FreeSurfer and previous label fusion algorithms. In a second experiment, we use brain MRI scans of 282 subjects to demonstrate that the proposed segmentation tool is sufficiently sensitive to robustly detect hippocampal volume changes in a study of aging and Alzheimer’s Disease. PMID:20562040

  9. A variational approach to bone segmentation in CT images

    NASA Astrophysics Data System (ADS)

    Calder, Jeff; Tahmasebi, Amir M.; Mansouri, Abdol-Reza

    2011-03-01

    We present a variational approach for segmenting bone structures in Computed Tomography (CT) images. We introduce a novel functional on the space of image segmentations, and subsequently minimize this functional through a gradient descent partial differential equation. The functional we propose provides a measure of similarity of the intensity characteristics of the bone and tissue regions through a comparison of their cumulative distribution functions; minimizing this similarity measure therefore yields the maximal separation between the two regions. We perform the minimization of our proposed functional using level set partial differential equations; in addition to numerical stability, this yields topology independence, which is especially useful in the context of CT bone segmentation where a bone region may consist of several disjoint pieces. Finally, we present an extensive validation of our method against expert manual segmentation on CT images of the wrist, ankle, foot, and pelvis.

  10. Leaf image segmentation method based on multifractal detrended fluctuation analysis

    NASA Astrophysics Data System (ADS)

    Wang, Fang; Li, Jin-Wei; Shi, Wen; Liao, Gui-Ping

    2013-12-01

    To identify singular regions of crop leaf affected by diseases, based on multifractal detrended fluctuation analysis (MF-DFA), an image segmentation method is proposed. In the proposed method, first, we defend a new texture descriptor: local generalized Hurst exponent, recorded as LHq based on MF-DFA. And then, box-counting dimension f(LHq) is calculated for sub-images constituted by the LHq of some pixels, which come from a specific region. Consequently, series of f(LHq) of the different regions can be obtained. Finally, the singular regions are segmented according to the corresponding f(LHq). Six kinds of corn diseases leaf's images are tested in our experiments. Both the proposed method and other two segmentation methods—multifractal spectrum based and fuzzy C-means clustering have been compared in the experiments. The comparison results demonstrate that the proposed method can recognize the lesion regions more effectively and provide more robust segmentations.

  11. Segmentation method for in vivo meibomian gland OCT image

    NASA Astrophysics Data System (ADS)

    Shin, Jun Geun; Lee, Byeong Ha; Eom, Tae Joong

    2014-02-01

    We demonstrate segmentation of human MGs based on several image processing technic. 3D volumetric data of upper eyelid was acquired from real-time FD-OCT, and its acini area of MGs was segmented. Three dimensional volume informations of meibomian glands should be helpful to diagnose meibomian gland related disease. In order to reveal boundary between tarsal plate and acini, each B-scan images were obtained before averaged three times. Imaging area was 10x10mm and 700x1000x500 voxels. The acquisition time was 60ms for B-scan and 30sec for C-scan. The 3D data was flattened to remove curvature and axial vibration, and resized to reduce computational costs, and filtered to minimize speckles, and segmented. Marker based watershed transform was employed to segment each acini area of meibomian gland.

  12. Automatic image segmentation by dynamic region growth and multiresolution merging.

    PubMed

    Ugarriza, Luis Garcia; Saber, Eli; Vantaram, Sreenath Rao; Amuso, Vincent; Shaw, Mark; Bhaskar, Ranjit

    2009-10-01

    Image segmentation is a fundamental task in many computer vision applications. In this paper, we propose a new unsupervised color image segmentation algorithm, which exploits the information obtained from detecting edges in color images in the CIE L *a *b * color space. To this effect, by using a color gradient detection technique, pixels without edges are clustered and labeled individually to identify some initial portion of the input image content. Elements that contain higher gradient densities are included by the dynamic generation of clusters as the algorithm progresses. Texture modeling is performed by color quantization and local entropy computation of the quantized image. The obtained texture and color information along with a region growth map consisting of all fully grown regions are used to perform a unique multiresolution merging procedure to blend regions with similar characteristics. Experimental results obtained in comparison to published segmentation techniques demonstrate the performance advantages of the proposed method. PMID:19535323

  13. Segmentation and tracking of facial regions in color image sequences

    NASA Astrophysics Data System (ADS)

    Menser, Bernd; Wien, Mathias

    2000-05-01

    In this paper a new algorithm for joint detection and segmentation of human faces in color images sequence is presented. A skin probability image is generated using a model for skin color. Instead of a binary segmentation to detect skin regions, connected operators are used to analyze the skin probability image at different threshold levels. A hierarchical scheme of operators using shape and texture simplifies the skin probability image. For the remaining connected components, the likelihood of being a face is estimated using principal components analysis. To track a detected face region through the sequence, the connected component that represent the face in the previous frame is projected into the current frame. Using the projected segment as a marker, connected operators extract the actual face region from the skin probability image.

  14. Performance benchmarking of liver CT image segmentation and volume estimation

    NASA Astrophysics Data System (ADS)

    Xiong, Wei; Zhou, Jiayin; Tian, Qi; Liu, Jimmy J.; Qi, Yingyi; Leow, Wee Kheng; Han, Thazin; Wang, Shih-chang

    2008-03-01

    In recent years more and more computer aided diagnosis (CAD) systems are being used routinely in hospitals. Image-based knowledge discovery plays important roles in many CAD applications, which have great potential to be integrated into the next-generation picture archiving and communication systems (PACS). Robust medical image segmentation tools are essentials for such discovery in many CAD applications. In this paper we present a platform with necessary tools for performance benchmarking for algorithms of liver segmentation and volume estimation used for liver transplantation planning. It includes an abdominal computer tomography (CT) image database (DB), annotation tools, a ground truth DB, and performance measure protocols. The proposed architecture is generic and can be used for other organs and imaging modalities. In the current study, approximately 70 sets of abdominal CT images with normal livers have been collected and a user-friendly annotation tool is developed to generate ground truth data for a variety of organs, including 2D contours of liver, two kidneys, spleen, aorta and spinal canal. Abdominal organ segmentation algorithms using 2D atlases and 3D probabilistic atlases can be evaluated on the platform. Preliminary benchmark results from the liver segmentation algorithms which make use of statistical knowledge extracted from the abdominal CT image DB are also reported. We target to increase the CT scans to about 300 sets in the near future and plan to make the DBs built available to medical imaging research community for performance benchmarking of liver segmentation algorithms.

  15. Vectorized image segmentation via trixel agglomeration

    DOEpatents

    Prasad, Lakshman; Skourikhine, Alexei N.

    2006-10-24

    A computer implemented method transforms an image comprised of pixels into a vectorized image specified by a plurality of polygons that can be subsequently used to aid in image processing and understanding. The pixelated image is processed to extract edge pixels that separate different colors and a constrained Delaunay triangulation of the edge pixels forms a plurality of triangles having edges that cover the pixelated image. A color for each one of the plurality of triangles is determined from the color pixels within each triangle. A filter is formed with a set of grouping rules related to features of the pixelated image and applied to the plurality of triangle edges to merge adjacent triangles consistent with the filter into polygons having a plurality of vertices. The pixelated image may be then reformed into an array of the polygons, that can be represented collectively and efficiently by standard vector image.

  16. Automatic labeling and segmentation of vertebrae in CT images

    NASA Astrophysics Data System (ADS)

    Rasoulian, Abtin; Rohling, Robert N.; Abolmaesumi, Purang

    2014-03-01

    Labeling and segmentation of the spinal column from CT images is a pre-processing step for a range of image- guided interventions. State-of-the art techniques have focused either on image feature extraction or template matching for labeling of the vertebrae followed by segmentation of each vertebra. Recently, statistical multi- object models have been introduced to extract common statistical characteristics among several anatomies. In particular, we have created models for segmentation of the lumbar spine which are robust, accurate, and computationally tractable. In this paper, we reconstruct a statistical multi-vertebrae pose+shape model and utilize it in a novel framework for labeling and segmentation of the vertebra in a CT image. We validate our technique in terms of accuracy of the labeling and segmentation of CT images acquired from 56 subjects. The method correctly labels all vertebrae in 70% of patients and is only one level off for the remaining 30%. The mean distance error achieved for the segmentation is 2.1 +/- 0.7 mm.

  17. Automatic segmentation of the striatum and globus pallidus using MIST: Multimodal Image Segmentation Tool.

    PubMed

    Visser, Eelke; Keuken, Max C; Douaud, Gwenaëlle; Gaura, Veronique; Bachoud-Levi, Anne-Catherine; Remy, Philippe; Forstmann, Birte U; Jenkinson, Mark

    2016-01-15

    Accurate segmentation of the subcortical structures is frequently required in neuroimaging studies. Most existing methods use only a T1-weighted MRI volume to segment all supported structures and usually rely on a database of training data. We propose a new method that can use multiple image modalities simultaneously and a single reference segmentation for initialisation, without the need for a manually labelled training set. The method models intensity profiles in multiple images around the boundaries of the structure after nonlinear registration. It is trained using a set of unlabelled training data, which may be the same images that are to be segmented, and it can automatically infer the location of the physical boundary using user-specified priors. We show that the method produces high-quality segmentations of the striatum, which is clearly visible on T1-weighted scans, and the globus pallidus, which has poor contrast on such scans. The method compares favourably to existing methods, showing greater overlap with manual segmentations and better consistency. PMID:26477650

  18. Image segmentation for automated dental identification

    NASA Astrophysics Data System (ADS)

    Haj Said, Eyad; Nassar, Diaa Eldin M.; Ammar, Hany H.

    2006-02-01

    Dental features are one of few biometric identifiers that qualify for postmortem identification; therefore, creation of an Automated Dental Identification System (ADIS) with goals and objectives similar to the Automated Fingerprint Identification System (AFIS) has received increased attention. As a part of ADIS, teeth segmentation from dental radiographs films is an essential step in the identification process. In this paper, we introduce a fully automated approach for teeth segmentation with goal to extract at least one tooth from the dental radiograph film. We evaluate our approach based on theoretical and empirical basis, and we compare its performance with the performance of other approaches introduced in the literature. The results show that our approach exhibits the lowest failure rate and the highest optimality among all full automated approaches introduced in the literature.

  19. Segmentation of the heart and major vascular structures in cardiovascular CT images

    NASA Astrophysics Data System (ADS)

    Peters, J.; Ecabert, O.; Lorenz, C.; von Berg, J.; Walker, M. J.; Ivanc, T. B.; Vembar, M.; Olszewski, M. E.; Weese, J.

    2008-03-01

    Segmentation of organs in medical images can be successfully performed with shape-constrained deformable models. A surface mesh is attracted to detected image boundaries by an external energy, while an internal energy keeps the mesh similar to expected shapes. Complex organs like the heart with its four chambers can be automatically segmented using a suitable shape variablility model based on piecewise affine degrees of freedom. In this paper, we extend the approach to also segment highly variable vascular structures. We introduce a dedicated framework to adapt an extended mesh model to freely bending vessels. This is achieved by subdividing each vessel into (short) tube-shaped segments ("tubelets"). These are assigned to individual similarity transformations for local orientation and scaling. Proper adaptation is achieved by progressively adapting distal vessel parts to the image only after proximal neighbor tubelets have already converged. In addition, each newly activated tubelet inherits the local orientation and scale of the preceeding one. To arrive at a joint segmentation of chambers and vasculature, we extended a previous model comprising endocardial surfaces of the four chambers, the left ventricular epicardium, and a pulmonary artery trunk. Newly added are the aorta (ascending and descending plus arch), superior and inferior vena cava, coronary sinus, and four pulmonary veins. These vessels are organized as stacks of triangulated rings. This mesh configuration is most suitable to define tubelet segments. On 36 CT data sets reconstructed at several cardiac phases from 17 patients, segmentation accuracies of 0.61-0.80mm are obtained for the cardiac chambers. For the visible parts of the newly added great vessels, surface accuracies of 0.47-1.17mm are obtained (larger errors are asscociated with faintly contrasted venous structures).

  20. Colony image acquisition and genetic segmentation algorithm and colony analyses

    NASA Astrophysics Data System (ADS)

    Wang, W. X.

    2012-01-01

    Colony anaysis is used in a large number of engineerings such as food, dairy, beverages, hygiene, environmental monitoring, water, toxicology, sterility testing. In order to reduce laboring and increase analysis acuracy, many researchers and developers have made efforts for image analysis systems. The main problems in the systems are image acquisition, image segmentation and image analysis. In this paper, to acquire colony images with good quality, an illumination box was constructed. In the box, the distances between lights and dishe, camra lens and lights, and camera lens and dishe are adjusted optimally. In image segmentation, It is based on a genetic approach that allow one to consider the segmentation problem as a global optimization,. After image pre-processing and image segmentation, the colony analyses are perfomed. The colony image analysis consists of (1) basic colony parameter measurements; (2) colony size analysis; (3) colony shape analysis; and (4) colony surface measurements. All the above visual colony parameters can be selected and combined together, used to make a new engineeing parameters. The colony analysis can be applied into different applications.

  1. Learning evaluation of ultrasound image segmentation using combined measures

    NASA Astrophysics Data System (ADS)

    Fang, Mengjie; Luo, Yongkang; Ding, Mingyue

    2016-03-01

    Objective evaluation of medical image segmentation is one of the important steps for proving its validity and clinical applicability. Although there are many researches presenting segmentation methods on medical image, while with few studying the evaluation methods on their results, this paper presents a learning evaluation method with combined measures to make it as close as possible to the clinicians' judgment. This evaluation method is more quantitative and precise for the clinical diagnose. In our experiment, the same data sets include 120 segmentation results of lumen-intima boundary (LIB) and media-adventitia boundary (MAB) of carotid ultrasound images respectively. And the 15 measures of goodness method and discrepancy method are used to evaluate the different segmentation results alone. Furthermore, the experimental results showed that compared with the discrepancy method, the accuracy with the measures of goodness method is poor. Then, by combining with the measures of two methods, the average accuracy and the area under the receiver operating characteristic (ROC) curve of 2 segmentation groups are higher than 93% and 0.9 respectively. And the results of MAB are better than LIB, which proved that this novel method can effectively evaluate the segmentation results. Moreover, it lays the foundation for the non-supervised segmentation evaluation system.

  2. A New Markov Random Field Segmentation Method for Breast Lesion Segmentation in MR images.

    PubMed

    Azmi, Reza; Norozi, Narges

    2011-07-01

    Breast cancer is a major public health problem for women in the Iran and many other parts of the world. Dynamic contrast-enhanced magnetic resonance imaging (DCE-MRI) plays a pivotal role in breast cancer care, including detection, diagnosis, and treatment monitoring. But segmentation of these images which is seriously affected by intensity inhomogeneities created by radio-frequency coils is a challenging task. Markov Random Field (MRF) is used widely in medical image segmentation especially in MR images. It is because this method can model intensity inhomogeneities occurring in these images. But this method has two critical weaknesses: Computational complexity and sensitivity of the results to the models parameters. To overcome these problems, in this paper, we present Improved-Markov Random Field (I-MRF) method for breast lesion segmentation in MR images. Unlike the conventional MRF, in the proposed approach, we don't use the Iterative Conditional Mode (ICM) method or Simulated Annealing (SA) for class membership estimation of each pixel (lesion and non-lesion). The prior distribution of the class membership is modeled as a ratio of two conditional probability distributions in a neighborhood which is defined for each pixel: probability distribution of similar pixels and non-similar ones. Since our proposed approach don't use an iterative method for maximizing the posterior probability, above mentioned problems are solved. Experimental results show that performance of segmentation in this approach is higher than conventional MRF in terms of accuracy, precision, and Computational complexity.

  3. Image segmentation by hierarchial agglomeration of polygons using ecological statistics

    DOEpatents

    Prasad, Lakshman; Swaminarayan, Sriram

    2013-04-23

    A method for rapid hierarchical image segmentation based on perceptually driven contour completion and scene statistics is disclosed. The method begins with an initial fine-scale segmentation of an image, such as obtained by perceptual completion of partial contours into polygonal regions using region-contour correspondences established by Delaunay triangulation of edge pixels as implemented in VISTA. The resulting polygons are analyzed with respect to their size and color/intensity distributions and the structural properties of their boundaries. Statistical estimates of granularity of size, similarity of color, texture, and saliency of intervening boundaries are computed and formulated into logical (Boolean) predicates. The combined satisfiability of these Boolean predicates by a pair of adjacent polygons at a given segmentation level qualifies them for merging into a larger polygon representing a coarser, larger-scale feature of the pixel image and collectively obtains the next level of polygonal segments in a hierarchy of fine-to-coarse segmentations. The iterative application of this process precipitates textured regions as polygons with highly convolved boundaries and helps distinguish them from objects which typically have more regular boundaries. The method yields a multiscale decomposition of an image into constituent features that enjoy a hierarchical relationship with features at finer and coarser scales. This provides a traversable graph structure from which feature content and context in terms of other features can be derived, aiding in automated image understanding tasks. The method disclosed is highly efficient and can be used to decompose and analyze large images.

  4. Segmentation of confocal microscopic image of insect brain

    NASA Astrophysics Data System (ADS)

    Wu, Ming-Jin; Lin, Chih-Yang; Ching, Yu-Tai

    2002-05-01

    Accurate analysis of insect brain structures in digital confocal microscopic images is valuable and important to biology research needs. The first step is to segment meaningful structures from images. Active contour model, known as snakes, is widely used for segmentation of medical images. A new class of active contour model called gradient vector flow snake has been introduced in 1998 to overcome some critical problems encountered in the traditional snake. In this paper, we use gradient vector flow snake to segment the mushroom body and the central body from the confocal microscopic insect brain images. First, an edge map is created from images by some edge filters. Second, a gradient vector flow field is calculated from the edge map using a computational diffusion process. Finally, a traditional snake deformation process starts until it reaches a stable configuration. User interface is also provided here, allowing users to edit the snake during deformation process, if desired. Using the gradient vector flow snake as the main segmentation method and assist with user interface, we can properly segment the confocal microscopic insect brain image for most of the cases. The identified mushroom and central body can then be used as the preliminary results toward a 3-D reconstruction process for further biology researches.

  5. Robust Prostate Segmentation Using Intrinsic Properties of TRUS Images.

    PubMed

    Wu, Pengfei; Liu, Yiguang; Li, Yongzhong; Liu, Bingbing

    2015-06-01

    Accurate segmentation is usually crucial in transrectal ultrasound (TRUS) image based prostate diagnosis; however, it is always hampered by heavy speckles. Contrary to the traditional view that speckles are adverse to segmentation, we exploit intrinsic properties induced by speckles to facilitate the task, based on the observations that sizes and orientations of speckles provide salient cues to determine the prostate boundary. Since the speckle orientation changes in accordance with a statistical prior rule, rotation-invariant texture feature is extracted along the orientations revealed by the rule. To address the problem of feature changes due to different speckle sizes, TRUS images are split into several arc-like strips. In each strip, every individual feature vector is sparsely represented, and representation residuals are obtained. The residuals, along with the spatial coherence inherited from biological tissues, are combined to segment the prostate preliminarily via graph cuts. After that, the segmentation is fine-tuned by a novel level sets model, which integrates (1) the prostate shape prior, (2) dark-to-light intensity transition near the prostate boundary, and (3) the texture feature just obtained. The proposed method is validated on two 2-D image datasets obtained from two different sonographic imaging systems, with the mean absolute distance on the mid gland images only 1.06±0.53 mm and 1.25±0.77 mm, respectively. The method is also extended to segment apex and base images, producing competitive results over the state of the art.

  6. Supervised segmentation methods for the hippocampus in MR images

    NASA Astrophysics Data System (ADS)

    van Stralen, Marijn; Geerlings, Mirjam I.; Vincken, Koen L.; Pluim, Josien P. W.

    2011-03-01

    This study compares three different types of fully automated supervised methods for segmentation of the hippocampus in MR images. Many of such methods, trained using example data, have been presented for various medical imaging applications, but comparison of the methods is obscured because of optimization for, and evaluation on, different data. We compare three methods based on different methodological bases: atlas-based segmentation (ABS), active appearance model segmentation (AAM) and k-nearest neighbor voxel classification (KNN). All three methods are trained on 100 T1-weighted images with manual segmentations of the right hippocampus, and applied to 103 different images from the same study. Straightforward implementation of each of the three methods resulted in competitive segmentations, both mutually, as compared with methods currently reported in literature. AAM and KNN are favorable in terms of computational costs, requiring only a fraction of the time needed for ABS. The high accuracy and low computational cost make KNN the most favorable method based on this study. AAM achieves similar results as ABS in significantly less computation time. Further improvements might be achieved by fusion of the presented techniques, either methodologically or by direct fusion of the segmentation results.

  7. Compton imager based on a single planar segmented HPGe detector

    NASA Astrophysics Data System (ADS)

    Khaplanov, A.; Pettersson, J.; Cederwall, B.

    2007-10-01

    A collimator-free Compton imaging system has been developed based on a single high-purity germanium detector and used to generate images of radioactive sources emitting γ rays. The detector has a planar crystal with one pixellated contact with a total of 25 segments. Pulse shape analysis has been applied to achieve a 3D-position sensitivity of the detector. The first imaging results from this detector are presented, based on the reconstruction of events where a γ ray is fully absorbed after scattering between adjacent segments.

  8. Volumetric segmentation of range images for printed circuit board inspection

    NASA Astrophysics Data System (ADS)

    Van Dop, Erik R.; Regtien, Paul P. L.

    1996-10-01

    Conventional computer vision approaches towards object recognition and pose estimation employ 2D grey-value or color imaging. As a consequence these images contain information about projections of a 3D scene only. The subsequent image processing will then be difficult, because the object coordinates are represented with just image coordinates. Only complicated low-level vision modules like depth from stereo or depth from shading can recover some of the surface geometry of the scene. Recent advances in fast range imaging have however paved the way towards 3D computer vision, since range data of the scene can now be obtained with sufficient accuracy and speed for object recognition and pose estimation purposes. This article proposes the coded-light range-imaging method together with superquadric segmentation to approach this task. Superquadric segments are volumetric primitives that describe global object properties with 5 parameters, which provide the main features for object recognition. Besides, the principle axes of a superquadric segment determine the phase of an object in the scene. The volumetric segmentation of a range image can be used to detect missing, false or badly placed components on assembled printed circuit boards. Furthermore, this approach will be useful to recognize and extract valuable or toxic electronic components on printed circuit boards scrap that currently burden the environment during electronic waste processing. Results on synthetic range images with errors constructed according to a verified noise model illustrate the capabilities of this approach.

  9. Fuzzy object models for newborn brain MR image segmentation

    NASA Astrophysics Data System (ADS)

    Kobashi, Syoji; Udupa, Jayaram K.

    2013-03-01

    Newborn brain MR image segmentation is a challenging problem because of variety of size, shape and MR signal although it is the fundamental study for quantitative radiology in brain MR images. Because of the large difference between the adult brain and the newborn brain, it is difficult to directly apply the conventional methods for the newborn brain. Inspired by the original fuzzy object model introduced by Udupa et al. at SPIE Medical Imaging 2011, called fuzzy shape object model (FSOM) here, this paper introduces fuzzy intensity object model (FIOM), and proposes a new image segmentation method which combines the FSOM and FIOM into fuzzy connected (FC) image segmentation. The fuzzy object models are built from training datasets in which the cerebral parenchyma is delineated by experts. After registering FSOM with the evaluating image, the proposed method roughly recognizes the cerebral parenchyma region based on a prior knowledge of location, shape, and the MR signal given by the registered FSOM and FIOM. Then, FC image segmentation delineates the cerebral parenchyma using the fuzzy object models. The proposed method has been evaluated using 9 newborn brain MR images using the leave-one-out strategy. The revised age was between -1 and 2 months. Quantitative evaluation using false positive volume fraction (FPVF) and false negative volume fraction (FNVF) has been conducted. Using the evaluation data, a FPVF of 0.75% and FNVF of 3.75% were achieved. More data collection and testing are underway.

  10. Weakly supervised histopathology cancer image segmentation and classification.

    PubMed

    Xu, Yan; Zhu, Jun-Yan; Chang, Eric I-Chao; Lai, Maode; Tu, Zhuowen

    2014-04-01

    Labeling a histopathology image as having cancerous regions or not is a critical task in cancer diagnosis; it is also clinically important to segment the cancer tissues and cluster them into various classes. Existing supervised approaches for image classification and segmentation require detailed manual annotations for the cancer pixels, which are time-consuming to obtain. In this paper, we propose a new learning method, multiple clustered instance learning (MCIL) (along the line of weakly supervised learning) for histopathology image segmentation. The proposed MCIL method simultaneously performs image-level classification (cancer vs. non-cancer image), medical image segmentation (cancer vs. non-cancer tissue), and patch-level clustering (different classes). We embed the clustering concept into the multiple instance learning (MIL) setting and derive a principled solution to performing the above three tasks in an integrated framework. In addition, we introduce contextual constraints as a prior for MCIL, which further reduces the ambiguity in MIL. Experimental results on histopathology colon cancer images and cytology images demonstrate the great advantage of MCIL over the competing methods.

  11. Segmentation of bionano images for understanding cell dynamics.

    PubMed

    Mukewar, Pushkar; Wang, Geoffrey; Henning, Peter; Bao, Gang; Wang, May

    2004-01-01

    The use of quantum dots (QDs) and molecular beacons (MBs) is a recent advance in the field of nanotechnology. These techniques have enabled us to detect a single molecule in a cell, which helps in understanding the dynamics of a cell. The success of these techniques depends on the accurate and efficient analysis of the imaging data these techniques produce. The processing involves--segmentation of the particles, colocalisation and their tracking over multiple frames in 2D and 3D space. In this paper we have used the active contour models: snakes and their variation--GVF (gradient vector field) snakes for segmentation of nano(QD) and cell(MB) images. The results of segmentation have been used to measure the degree of colocalisation for quantum dot images and the gene expression values for molecular beacon images.

  12. Bacterial foraging based edge detection for cell image segmentation.

    PubMed

    Pan, Yongsheng; Zhou, Tao; Xia, Yong

    2015-01-01

    Edge detection is the most popular and common choices for cell image segmentation, in which local searching strategies are commonly used. In spite of their computational efficiency, traditional edge detectors, however, may either produce discontinued edges or rely heavily on initializations. In this paper, we propose a bacterial foraging based edge detection (BFED) algorithm for cell image segmentation. We model the gradients of intensities as the nutrient concentration and propel bacteria to forage along nutrient-rich locations via mimicking the behavior of Escherichia coli, including the chemotaxis, swarming, reproduction, elimination and dispersal. As a nature-inspired evolutionary technique, this algorithm can identify the desired edges and mark them as the tracks of bacteria. We have evaluated the proposed algorithm against the Canny, SUSAN, Verma's and an active contour model (ACM) based edge detectors on both synthetic and real cell images. Our results suggest that the BFED algorithm can identify boundaries more effectively and provide more accurate cell image segmentation. PMID:26737139

  13. Adaptive filtering image preprocessing for smart FPA technology

    NASA Astrophysics Data System (ADS)

    Brooks, Geoffrey W.

    1995-05-01

    This paper discusses two applications of adaptive filters for image processing on parallel architectures. The first, based on the results of previously accomplished work, summarizes the analyses of various adaptive filters implemented for pixel-level image prediction. FIR filters, fixed and adaptive IIR filters, and various variable step size algorithms were compared with a focus on algorithm complexity against the ability to predict future pixel values. A gaussian smoothing operation with varying spatial and temporal constants were also applied for comparisons of random noise reductions. The second application is a suggestion to use memory-adaptive IIR filters for detecting and tracking motion within an image. Objects within an image are made of edges, or segments, with varying degrees of motion. An application has been previously published that describes FIR filters connecting pixels and using correlations to determine motion and direction. This implementation seems limited to detecting motion coinciding with FIR filter operation rate and the associated harmonics. Upgrading the FIR structures with adaptive IIR structures can eliminate these limitations. These and any other pixel-level adaptive filtering application require data memory for filter parameters and some basic computational capability. Tradeoffs have to be made between chip real estate and these desired features. System tradeoffs will also have to be made as to where it makes the most sense to do which level of processing. Although smart pixels may not be ready to implement adaptive filters, applications such as these should give the smart pixel designer some long range goals.

  14. MASCG: Multi-Atlas Segmentation Constrained Graph method for accurate segmentation of hip CT images.

    PubMed

    Chu, Chengwen; Bai, Junjie; Wu, Xiaodong; Zheng, Guoyan

    2015-12-01

    This paper addresses the issue of fully automatic segmentation of a hip CT image with the goal to preserve the joint structure for clinical applications in hip disease diagnosis and treatment. For this purpose, we propose a Multi-Atlas Segmentation Constrained Graph (MASCG) method. The MASCG method uses multi-atlas based mesh fusion results to initialize a bone sheetness based multi-label graph cut for an accurate hip CT segmentation which has the inherent advantage of automatic separation of the pelvic region from the bilateral proximal femoral regions. We then introduce a graph cut constrained graph search algorithm to further improve the segmentation accuracy around the bilateral hip joint regions. Taking manual segmentation as the ground truth, we evaluated the present approach on 30 hip CT images (60 hips) with a 15-fold cross validation. When the present approach was compared to manual segmentation, an average surface distance error of 0.30 mm, 0.29 mm, and 0.30 mm was found for the pelvis, the left proximal femur, and the right proximal femur, respectively. A further look at the bilateral hip joint regions demonstrated an average surface distance error of 0.16 mm, 0.21 mm and 0.20 mm for the acetabulum, the left femoral head, and the right femoral head, respectively.

  15. Adaptation of multifractal analysis to segmentation of microcalcifications in digital mammograms

    NASA Astrophysics Data System (ADS)

    Stojić, Tomislav; Reljin, Irini; Reljin, Branimir

    2006-07-01

    A method for detecting microcalcifications in digital mammograms is proposed. After recognizing basic features of microcalcifications we introduced several modifications in multifractal analysis, obtaining an efficient method adapted to enhance only small light parts not belonging to surrounding tissue, possibly microcalcifications. Started with a mammogram image, a method creates corresponding multifractal image from which a radiologist has the freedom to change the level of segmentation in an interactive manner and to find suspicious regions, which may contain microcalcifications. Additional postprocessing, based on mathematical morphology, refines the procedure by selecting and outlining regions that contain clusters with microcalcifications. The proposed method was tested through referent mammograms from MiniMIAS database, which is available at public domain. The proposed method successfully extracted microcalcifications in all (clinically approved) cases belonging to this database.

  16. Simultaneous detection of multiple elastic surfaces with application to tumor segmentation in CT images

    NASA Astrophysics Data System (ADS)

    Li, Kang; Jolly, Marie-Pierre

    2008-03-01

    We present a new semi-supervised method for segmenting multiple interrelated object boundaries with spherical topology in volumetric images. The core of our method is a novel graph-theoretic algorithm that simultaneously detects multiple surfaces under smoothness, distance, and elasticity constraints. The algorithm computes the global optimum of an objective function that incorporates boundary, regional and surface elasticity information. A single straight line drawn by the user in a cross-sectional slice is the sole user input, which roughly indicates the extent of the object. We employ a multi-seeded Dijkstra-based range competition algorithm to pre-segment the object on two orthogonal multiplanar reformatted (MPR) planes that pass through the input line. Based on the 2D pre-segmentation results, we estimate the object and background intensity histograms, and employ an adaptive mean-shift mode-seeking process on the object histogram to automatically determine the number of surface layers to be segmented. The final multiple-surface segmentation is performed in an ellipsoidal coordinate frame constructed by an automated ellipsoid fitting procedure. We apply our method to the segmentation of liver lesions with necrosis or calcification, and various other tumors in CT images. For liver tumor segmentation, our method can simultaneously delineate both tumor and necrosis boundaries. This capability is unprecedented and is valuable for cancer diagnosis, treatment planning, and evaluation.

  17. The use of the Kalman filter in the automated segmentation of EIT lung images.

    PubMed

    Zifan, A; Liatsis, P; Chapman, B E

    2013-06-01

    In this paper, we present a new pipeline for the fast and accurate segmentation of impedance images of the lungs using electrical impedance tomography (EIT). EIT is an emerging, promising, non-invasive imaging modality that produces real-time, low spatial but high temporal resolution images of impedance inside a body. Recovering impedance itself constitutes a nonlinear ill-posed inverse problem, therefore the problem is usually linearized, which produces impedance-change images, rather than static impedance ones. Such images are highly blurry and fuzzy along object boundaries. We provide a mathematical reasoning behind the high suitability of the Kalman filter when it comes to segmenting and tracking conductivity changes in EIT lung images. Next, we use a two-fold approach to tackle the segmentation problem. First, we construct a global lung shape to restrict the search region of the Kalman filter. Next, we proceed with augmenting the Kalman filter by incorporating an adaptive foreground detection system to provide the boundary contours for the Kalman filter to carry out the tracking of the conductivity changes as the lungs undergo deformation in a respiratory cycle. The proposed method has been validated by using performance statistics such as misclassified area, and false positive rate, and compared to previous approaches. The results show that the proposed automated method can be a fast and reliable segmentation tool for EIT imaging.

  18. Semiautomatic segmentation of liver metastases on volumetric CT images

    SciTech Connect

    Yan, Jiayong; Schwartz, Lawrence H.; Zhao, Binsheng

    2015-11-15

    Purpose: Accurate segmentation and quantification of liver metastases on CT images are critical to surgery/radiation treatment planning and therapy response assessment. To date, there are no reliable methods to perform such segmentation automatically. In this work, the authors present a method for semiautomatic delineation of liver metastases on contrast-enhanced volumetric CT images. Methods: The first step is to manually place a seed region-of-interest (ROI) in the lesion on an image. This ROI will (1) serve as an internal marker and (2) assist in automatically identifying an external marker. With these two markers, lesion contour on the image can be accurately delineated using traditional watershed transformation. Density information will then be extracted from the segmented 2D lesion and help determine the 3D connected object that is a candidate of the lesion volume. The authors have developed a robust strategy to automatically determine internal and external markers for marker-controlled watershed segmentation. By manually placing a seed region-of-interest in the lesion to be delineated on a reference image, the method can automatically determine dual threshold values to approximately separate the lesion from its surrounding structures and refine the thresholds from the segmented lesion for the accurate segmentation of the lesion volume. This method was applied to 69 liver metastases (1.1–10.3 cm in diameter) from a total of 15 patients. An independent radiologist manually delineated all lesions and the resultant lesion volumes served as the “gold standard” for validation of the method’s accuracy. Results: The algorithm received a median overlap, overestimation ratio, and underestimation ratio of 82.3%, 6.0%, and 11.5%, respectively, and a median average boundary distance of 1.2 mm. Conclusions: Preliminary results have shown that volumes of liver metastases on contrast-enhanced CT images can be accurately estimated by a semiautomatic segmentation

  19. Active contour based segmentation of resected livers in CT images

    NASA Astrophysics Data System (ADS)

    Oelmann, Simon; Oyarzun Laura, Cristina; Drechsler, Klaus; Wesarg, Stefan

    2015-03-01

    The majority of state of the art segmentation algorithms are able to give proper results in healthy organs but not in pathological ones. However, many clinical applications require an accurate segmentation of pathological organs. The determination of the target boundaries for radiotherapy or liver volumetry calculations are examples of this. Volumetry measurements are of special interest after tumor resection for follow up of liver regrow. The segmentation of resected livers presents additional challenges that were not addressed by state of the art algorithms. This paper presents a snakes based algorithm specially developed for the segmentation of resected livers. The algorithm is enhanced with a novel dynamic smoothing technique that allows the active contour to propagate with different speeds depending on the intensities visible in its neighborhood. The algorithm is evaluated in 6 clinical CT images as well as 18 artificial datasets generated from additional clinical CT images.

  20. Automated Segmentability Index for Layer Segmentation of Macular SD-OCT Images

    PubMed Central

    Lee, Kyungmoo; Buitendijk, Gabriëlle H.S.; Bogunovic, Hrvoje; Springelkamp, Henriët; Hofman, Albert; Wahle, Andreas; Sonka, Milan; Vingerling, Johannes R.; Klaver, Caroline C.W.; Abràmoff, Michael D.

    2016-01-01

    Purpose To automatically identify which spectral-domain optical coherence tomography (SD-OCT) scans will provide reliable automated layer segmentations for more accurate layer thickness analyses in population studies. Methods Six hundred ninety macular SD-OCT image volumes (6.0 × 6.0 × 2.3 mm3) were obtained from one eyes of 690 subjects (74.6 ± 9.7 [mean ± SD] years, 37.8% of males) randomly selected from the population-based Rotterdam Study. The dataset consisted of 420 OCT volumes with successful automated retinal nerve fiber layer (RNFL) segmentations obtained from our previously reported graph-based segmentation method and 270 volumes with failed segmentations. To evaluate the reliability of the layer segmentations, we have developed a new metric, segmentability index SI, which is obtained from a random forest regressor based on 12 features using OCT voxel intensities, edge-based costs, and on-surface costs. The SI was compared with well-known quality indices, quality index (QI), and maximum tissue contrast index (mTCI), using receiver operating characteristic (ROC) analysis. Results The 95% confidence interval (CI) and the area under the curve (AUC) for the QI are 0.621 to 0.805 with AUC 0.713, for the mTCI 0.673 to 0.838 with AUC 0.756, and for the SI 0.784 to 0.920 with AUC 0.852. The SI AUC is significantly larger than either the QI or mTCI AUC (P < 0.01). Conclusions The segmentability index SI is well suited to identify SD-OCT scans for which successful automated intraretinal layer segmentations can be expected. Translational Relevance Interpreting the quantification of SD-OCT images requires the underlying segmentation to be reliable, but standard SD-OCT quality metrics do not predict which segmentations are reliable and which are not. The segmentability index SI presented in this study does allow reliable segmentations to be identified, which is important for more accurate layer thickness analyses in research and population studies. PMID:27066311

  1. Segment fusion of ToF-SIMS images.

    PubMed

    Milillo, Tammy M; Miller, Mary E; Fischione, Remo; Montes, Angelina; Gardella, Joseph A

    2016-06-08

    The imaging capabilities of time-of-flight secondary ion mass spectrometry (ToF-SIMS) have not been used to their full potential in the analysis of polymer and biological samples. Imaging has been limited by the size of the dataset and the chemical complexity of the sample being imaged. Pixel and segment based image fusion algorithms commonly used in remote sensing, ecology, geography, and geology provide a way to improve spatial resolution and classification of biological images. In this study, a sample of Arabidopsis thaliana was treated with silver nanoparticles and imaged with ToF-SIMS. These images provide insight into the uptake mechanism for the silver nanoparticles into the plant tissue, giving new understanding to the mechanism of uptake of heavy metals in the environment. The Munechika algorithm was programmed in-house and applied to achieve pixel based fusion, which improved the spatial resolution of the image obtained. Multispectral and quadtree segment or region based fusion algorithms were performed using ecognition software, a commercially available remote sensing software suite, and used to classify the images. The Munechika fusion improved the spatial resolution for the images containing silver nanoparticles, while the segment fusion allowed classification and fusion based on the tissue types in the sample, suggesting potential pathways for the uptake of the silver nanoparticles.

  2. Breast image pre-processing for mammographic tissue segmentation.

    PubMed

    He, Wenda; Hogg, Peter; Juette, Arne; Denton, Erika R E; Zwiggelaar, Reyer

    2015-12-01

    During mammographic image acquisition, a compression paddle is used to even the breast thickness in order to obtain optimal image quality. Clinical observation has indicated that some mammograms may exhibit abrupt intensity change and low visibility of tissue structures in the breast peripheral areas. Such appearance discrepancies can affect image interpretation and may not be desirable for computer aided mammography, leading to incorrect diagnosis and/or detection which can have a negative impact on sensitivity and specificity of screening mammography. This paper describes a novel mammographic image pre-processing method to improve image quality for analysis. An image selection process is incorporated to better target problematic images. The processed images show improved mammographic appearances not only in the breast periphery but also across the mammograms. Mammographic segmentation and risk/density classification were performed to facilitate a quantitative and qualitative evaluation. When using the processed images, the results indicated more anatomically correct segmentation in tissue specific areas, and subsequently better classification accuracies were achieved. Visual assessments were conducted in a clinical environment to determine the quality of the processed images and the resultant segmentation. The developed method has shown promising results. It is expected to be useful in early breast cancer detection, risk-stratified screening, and aiding radiologists in the process of decision making prior to surgery and/or treatment.

  3. Segment fusion of ToF-SIMS images.

    PubMed

    Milillo, Tammy M; Miller, Mary E; Fischione, Remo; Montes, Angelina; Gardella, Joseph A

    2016-06-01

    The imaging capabilities of time-of-flight secondary ion mass spectrometry (ToF-SIMS) have not been used to their full potential in the analysis of polymer and biological samples. Imaging has been limited by the size of the dataset and the chemical complexity of the sample being imaged. Pixel and segment based image fusion algorithms commonly used in remote sensing, ecology, geography, and geology provide a way to improve spatial resolution and classification of biological images. In this study, a sample of Arabidopsis thaliana was treated with silver nanoparticles and imaged with ToF-SIMS. These images provide insight into the uptake mechanism for the silver nanoparticles into the plant tissue, giving new understanding to the mechanism of uptake of heavy metals in the environment. The Munechika algorithm was programmed in-house and applied to achieve pixel based fusion, which improved the spatial resolution of the image obtained. Multispectral and quadtree segment or region based fusion algorithms were performed using ecognition software, a commercially available remote sensing software suite, and used to classify the images. The Munechika fusion improved the spatial resolution for the images containing silver nanoparticles, while the segment fusion allowed classification and fusion based on the tissue types in the sample, suggesting potential pathways for the uptake of the silver nanoparticles. PMID:26746167

  4. Interactive image segmentation framework based on control theory

    NASA Astrophysics Data System (ADS)

    Zhu, Liangjia; Kolesov, Ivan; Ratner, Vadim; Karasev, Peter; Tannenbaum, Allen

    2015-03-01

    Segmentation of anatomical structures in medical imagery is a key step in a variety of clinical applications. Designing a generic, automated method that works for various structures and imaging modalities is a daunting task. Instead of proposing a new specific segmentation algorithm, in this paper, we present a general design principle on how to integrate user interactions from the perspective of control theory. In this formulation, Lyapunov stability analysis is employed to design an interactive segmentation system. The effectiveness and robustness of the proposed method are demonstrated.

  5. Automatic watershed segmentation of randomly textured color images.

    PubMed

    Shafarenko, L; Petrou, M; Kittler, J

    1997-01-01

    A new method is proposed for processing randomly textured color images. The method is based on a bottom-up segmentation algorithm that takes into consideration both color and texture properties of the image. An LUV gradient is introduced, which provides both a color similarity measure and a basis for applying the watershed transform. The patches of watershed mosaic are merged according to their color contrast until a termination criterion is met. This criterion is based on the topology of the typical processed image. The resulting algorithm does not require any additional information, be it various thresholds, marker extraction rules, and suchlike, thus being suitable for automatic processing of color images. The algorithm is demonstrated within the framework of the problem of automatic granite inspection. The segmentation procedure has been found to be very robust, producing good results not only on granite images, but on the wide range of other noisy color images as well, subject to the termination criterion.

  6. Bladder segmentation in MR images with watershed segmentation and graph cut algorithm

    NASA Astrophysics Data System (ADS)

    Blaffert, Thomas; Renisch, Steffen; Schadewaldt, Nicole; Schulz, Heinrich; Wiemker, Rafael

    2014-03-01

    Prostate and cervix cancer diagnosis and treatment planning that is based on MR images benefit from superior soft tissue contrast compared to CT images. For these images an automatic delineation of the prostate or cervix and the organs at risk such as the bladder is highly desirable. This paper describes a method for bladder segmentation that is based on a watershed transform on high image gradient values and gray value valleys together with the classification of watershed regions into bladder contents and tissue by a graph cut algorithm. The obtained results are superior if compared to a simple region-after-region classification.

  7. Locally adaptive bilateral clustering for universal image denoising

    NASA Astrophysics Data System (ADS)

    Toh, K. K. V.; Mat Isa, N. A.

    2012-12-01

    This paper presents a novel and efficient locally adaptive denoising method based on clustering of pixels into regions of similar geometric and radiometric structures. Clustering is performed by adaptively segmenting pixels in the local kernel based on their augmented variational series. Then, noise pixels are restored by selectively considering the radiometric and spatial properties of every pixel in the formed clusters. The proposed method is exceedingly robust in conveying reliable local structural information even in the presence of noise. As a result, the proposed method substantially outperforms other state-of-the-art methods in terms of image restoration and computational cost. We support our claims with ample simulated and real data experiments. The relatively fast runtime from extensive simulations also suggests that the proposed method is suitable for a variety of image-based products — either embedded in image capturing devices or applied as image enhancement software.

  8. Correlation-based discrimination between cardiac tissue and blood for segmentation of 3D echocardiographic images

    NASA Astrophysics Data System (ADS)

    Saris, Anne E. C. M.; Nillesen, Maartje M.; Lopata, Richard G. P.; de Korte, Chris L.

    2013-03-01

    Automated segmentation of 3D echocardiographic images in patients with congenital heart disease is challenging, because the boundary between blood and cardiac tissue is poorly defined in some regions. Cardiologists mentally incorporate movement of the heart, using temporal coherence of structures to resolve ambiguities. Therefore, we investigated the merit of temporal cross-correlation for automated segmentation over the entire cardiac cycle. Optimal settings for maximum cross-correlation (MCC) calculation, based on a 3D cross-correlation based displacement estimation algorithm, were determined to obtain the best contrast between blood and myocardial tissue over the entire cardiac cycle. Resulting envelope-based as well as RF-based MCC values were used as additional external force in a deformable model approach, to segment the left-ventricular cavity in entire systolic phase. MCC values were tested against, and combined with, adaptive filtered, demodulated RF-data. Segmentation results were compared with manually segmented volumes using a 3D Dice Similarity Index (3DSI). Results in 3D pediatric echocardiographic images sequences (n = 4) demonstrate that incorporation of temporal information improves segmentation. The use of MCC values, either alone or in combination with adaptive filtered, demodulated RF-data, resulted in an increase of the 3DSI in 75% of the cases (average 3DSI increase: 0.71 to 0.82). Results might be further improved by optimizing MCC-contrast locally, in regions with low blood-tissue contrast. Reducing underestimation of the endocardial volume due to MCC processing scheme (choice of window size) and consequential border-misalignment, could also lead to more accurate segmentations. Furthermore, increasing the frame rate will also increase MCC-contrast and thus improve segmentation.

  9. Phase contrast image segmentation using a Laue analyser crystal

    NASA Astrophysics Data System (ADS)

    Kitchen, Marcus J.; Paganin, David M.; Uesugi, Kentaro; Allison, Beth J.; Lewis, Robert A.; Hooper, Stuart B.; Pavlov, Konstantin M.

    2011-02-01

    Dual-energy x-ray imaging is a powerful tool enabling two-component samples to be separated into their constituent objects from two-dimensional images. Phase contrast x-ray imaging can render the boundaries between media of differing refractive indices visible, despite them having similar attenuation properties; this is important for imaging biological soft tissues. We have used a Laue analyser crystal and a monochromatic x-ray source to combine the benefits of both techniques. The Laue analyser creates two distinct phase contrast images that can be simultaneously acquired on a high-resolution detector. These images can be combined to separate the effects of x-ray phase, absorption and scattering and, using the known complex refractive indices of the sample, to quantitatively segment its component materials. We have successfully validated this phase contrast image segmentation (PCIS) using a two-component phantom, containing an iodinated contrast agent, and have also separated the lungs and ribcage in images of a mouse thorax. Simultaneous image acquisition has enabled us to perform functional segmentation of the mouse thorax throughout the respiratory cycle during mechanical ventilation.

  10. Classifying and segmenting microscopy images with deep multiple instance learning

    PubMed Central

    Kraus, Oren Z.; Ba, Jimmy Lei; Frey, Brendan J.

    2016-01-01

    Motivation: High-content screening (HCS) technologies have enabled large scale imaging experiments for studying cell biology and for drug screening. These systems produce hundreds of thousands of microscopy images per day and their utility depends on automated image analysis. Recently, deep learning approaches that learn feature representations directly from pixel intensity values have dominated object recognition challenges. These tasks typically have a single centered object per image and existing models are not directly applicable to microscopy datasets. Here we develop an approach that combines deep convolutional neural networks (CNNs) with multiple instance learning (MIL) in order to classify and segment microscopy images using only whole image level annotations. Results: We introduce a new neural network architecture that uses MIL to simultaneously classify and segment microscopy images with populations of cells. We base our approach on the similarity between the aggregation function used in MIL and pooling layers used in CNNs. To facilitate aggregating across large numbers of instances in CNN feature maps we present the Noisy-AND pooling function, a new MIL operator that is robust to outliers. Combining CNNs with MIL enables training CNNs using whole microscopy images with image level labels. We show that training end-to-end MIL CNNs outperforms several previous methods on both mammalian and yeast datasets without requiring any segmentation steps. Availability and implementation: Torch7 implementation available upon request. Contact: oren.kraus@mail.utoronto.ca PMID:27307644

  11. Image Segmentation of Historical Handwriting from Palm Leaf Manuscripts

    NASA Astrophysics Data System (ADS)

    Surinta, Olarik; Chamchong, Rapeeporn

    Palm leaf manuscripts were one of the earliest forms of written media and were used in Southeast Asia to store early written knowledge about subjects such as medicine, Buddhist doctrine and astrology. Therefore, historical handwritten palm leaf manuscripts are important for people who like to learn about historical documents, because we can learn more experience from them. This paper presents an image segmentation of historical handwriting from palm leaf manuscripts. The process is composed of three steps: 1) background elimination to separate text and background by Otsu's algorithm 2) line segmentation and 3) character segmentation by histogram of image. The end result is the character's image. The results from this research may be applied to optical character recognition (OCR) in the future.

  12. Sub-Markov Random Walk for Image Segmentation.

    PubMed

    Dong, Xingping; Shen, Jianbing; Shao, Ling; Van Gool, Luc

    2016-02-01

    A novel sub-Markov random walk (subRW) algorithm with label prior is proposed for seeded image segmentation, which can be interpreted as a traditional random walker on a graph with added auxiliary nodes. Under this explanation, we unify the proposed subRW and other popular random walk (RW) algorithms. This unifying view will make it possible for transferring intrinsic findings between different RW algorithms, and offer new ideas for designing novel RW algorithms by adding or changing auxiliary nodes. To verify the second benefit, we design a new subRW algorithm with label prior to solve the segmentation problem of objects with thin and elongated parts. The experimental results on both synthetic and natural images with twigs demonstrate that the proposed subRW method outperforms previous RW algorithms for seeded image segmentation.

  13. Novel technique in the segmentation of magnetic resonance image

    NASA Astrophysics Data System (ADS)

    Chan, Kwok-Leung

    1996-04-01

    In this investigation, automatic image segmentation is carried out on magnetic resonance image (MRI). A novel technique based on the maximum minimum measure is devised. The measure is improved by combining the smoothing and counting processes, and then normalizing the number of maximum and minimum positions over the region of interest (ROI). Two parameters (MM_H and MM_V) are generated and used for the segmentation. The technique is tested on some brain MRIs of a human male from the Visible Human Project of the National Library of Medicine, National Institutes of Health, USA. Preliminary results indicate that the maximum minimum measure can provide effective parameters for human tissue characterization and image segmentation with an added advantage of faster computation.

  14. Anterior Segment Imaging in Ocular Surface Squamous Neoplasia

    PubMed Central

    Vora, Gargi K.

    2016-01-01

    Recent advances in anterior segment imaging have transformed the way ocular surface squamous neoplasia (OSSN) is diagnosed and monitored. Ultrasound biomicroscopy (UBM) has been reported to be useful primarily in the assessment of intraocular invasion and metastasis. In vivo confocal microscopy (IVCM) shows enlarged and irregular nuclei with hyperreflective cells in OSSN lesions and this has been found to correlate with histopathology findings. Anterior segment optical coherence tomography (AS-OCT) demonstrates thickened hyperreflective epithelium with an abrupt transition between abnormal and normal epithelium in OSSN lesions and this has also been shown to mimic histopathology findings. Although there are limitations to each of these imaging modalities, they can be useful adjunctive tools in the diagnosis of OSSN and could greatly assist the clinician in the management of OSSN patients. Nevertheless, anterior segment imaging has not replaced histopathology's role as the gold standard in confirming diagnosis. PMID:27800176

  15. Image segmentation using fuzzy rules derived from K-means clusters

    NASA Astrophysics Data System (ADS)

    Chi, Zheru; Yan, Hong

    1995-04-01

    Image segmentation is one of the most important steps in computerized systems for analyzing geographic map images. We present a segmentation technique, based on fuzzy rules derived from the K-means clusters, that is aimed at achieving humanlike performance. In this technique, the K-means clustering algorithm is first used to obtain mixed-class clusters of training examples, whose centers and variances are then used to determine membership functions. Based on the derived membership functions, fuzzy rules are learned from the K- means cluster centers. In the map image segmentation, we make use of three features-- difference intensity, standard deviation, and a measure of the local contrast, to classify each pixel to the foreground, which consists of character and line patterns, and to the background. A centroid defuzzification algorithm is adopted in the classification step. Experimental results on a database of 22 grayscale map images show that the technique achieves good and reliable results, and is compared favorably with an adaptive thresholding method. By using K-means clustering, we can build a segmentation system of fewer rules that achieves a segmentation quality similar to that of using the uniformly distributed triangular membership functions with the fuzzy rules learned from all the training examples.

  16. Optimal Co-segmentation of Tumor in PET-CT Images with Context Information

    PubMed Central

    Song, Qi; Bai, Junjie; Han, Dongfeng; Bhatia, Sudershan; Sun, Wenqing; Rockey, William; Bayouth, John E.; Buatti, John M.

    2014-01-01

    PET-CT images have been widely used in clinical practice for radiotherapy treatment planning of the radiotherapy. Many existing segmentation approaches only work for a single imaging modality, which suffer from the low spatial resolution in PET or low contrast in CT. In this work we propose a novel method for the co-segmentation of the tumor in both PET and CT images, which makes use of advantages from each modality: the functionality information from PET and the anatomical structure information from CT. The approach formulates the segmentation problem as a minimization problem of a Markov Random Field (MRF) model, which encodes the information from both modalities. The optimization is solved using a graph-cut based method. Two sub-graphs are constructed for the segmentation of the PET and the CT images, respectively. To achieve consistent results in two modalities, an adaptive context cost is enforced by adding context arcs between the two subgraphs. An optimal solution can be obtained by solving a single maximum flow problem, which leads to simultaneous segmentation of the tumor volumes in both modalities. The proposed algorithm was validated in robust delineation of lung tumors on 23 PET-CT datasets and two head-and-neck cancer subjects. Both qualitative and quantitative results show significant improvement compared to the graph cut methods solely using PET or CT. PMID:23693127

  17. Denoising human cardiac diffusion tensor magnetic resonance images using sparse representation combined with segmentation.

    PubMed

    Bao, L J; Zhu, Y M; Liu, W Y; Croisille, P; Pu, Z B; Robini, M; Magnin, I E

    2009-03-21

    Cardiac diffusion tensor magnetic resonance imaging (DT-MRI) is noise sensitive, and the noise can induce numerous systematic errors in subsequent parameter calculations. This paper proposes a sparse representation-based method for denoising cardiac DT-MRI images. The method first generates a dictionary of multiple bases according to the features of the observed image. A segmentation algorithm based on nonstationary degree detector is then introduced to make the selection of atoms in the dictionary adapted to the image's features. The denoising is achieved by gradually approximating the underlying image using the atoms selected from the generated dictionary. The results on both simulated image and real cardiac DT-MRI images from ex vivo human hearts show that the proposed denoising method performs better than conventional denoising techniques by preserving image contrast and fine structures. PMID:19218737

  18. Convex-relaxed kernel mapping for image segmentation.

    PubMed

    Ben Salah, Mohamed; Ben Ayed, Ismail; Jing Yuan; Hong Zhang

    2014-03-01

    This paper investigates a convex-relaxed kernel mapping formulation of image segmentation. We optimize, under some partition constraints, a functional containing two characteristic terms: 1) a data term, which maps the observation space to a higher (possibly infinite) dimensional feature space via a kernel function, thereby evaluating nonlinear distances between the observations and segments parameters and 2) a total-variation term, which favors smooth segment surfaces (or boundaries). The algorithm iterates two steps: 1) a convex-relaxation optimization with respect to the segments by solving an equivalent constrained problem via the augmented Lagrange multiplier method and 2) a convergent fixed-point optimization with respect to the segments parameters. The proposed algorithm can bear with a variety of image types without the need for complex and application-specific statistical modeling, while having the computational benefits of convex relaxation. Our solution is amenable to parallelized implementations on graphics processing units (GPUs) and extends easily to high dimensions. We evaluated the proposed algorithm with several sets of comprehensive experiments and comparisons, including: 1) computational evaluations over 3D medical-imaging examples and high-resolution large-size color photographs, which demonstrate that a parallelized implementation of the proposed method run on a GPU can bring a significant speed-up and 2) accuracy evaluations against five state-of-the-art methods over the Berkeley color-image database and a multimodel synthetic data set, which demonstrates competitive performances of the algorithm. PMID:24723519

  19. [Graph-based interactive three-dimensional segmentation of magnetic resonance images of brain tumors].

    PubMed

    Li, Wei; Chen, Wu-fan

    2009-01-01

    We propose a graph-based three-dimensional (3D) algorithm to automatically segment brain tumors from magnetic resonance images (MRI). The algorithm uses minimum s/t cut criteria to obtain a global optimal result of objective function formed according to Markov Random Field Model and Maximum a posteriori (MAP-MRF) theory, and by combining the expectation-maximization (EM) algorithm to estimate the parameters of mixed Gaussian model for normal brain and tumor tissues. 3D segmentation results of brain tumors are fast achieved by our algorithm. The validation of the algorithm was tested and showed good accuracy and adaptation under simple interactions with the physicians. PMID:19218135

  20. [Image segmentation in tumor CT based on the improved C-V model].

    PubMed

    Zhang, Jianguo; Zhang, Rongguo; Xue, Fei; Liu, Kun

    2012-04-01

    Aiming at the shortcomings of slow convergence and inaccuracy segmentation in non-homogeneous images, improvements were made on the traditional C-V model in two aspects. Firstly, using a novel model based on local gradient, the initial contour of the C-V model was quickly moved near the target border, greatly reducing the evolution time. Secondly, combining the characteristics of GVF model from two directions to the target border, an adaptive velocity reconciling item was added for velocity equation of the C-V model to make the model converge to the true border. The segmentation experiments for liver tumors in CT showed that the proposed method could be effective.

  1. Automatic segmentation applied to obstetric images

    NASA Astrophysics Data System (ADS)

    Vuwong, Vanee; Hiller, John B.; Jin, Jesse S.

    1998-06-01

    This paper presents a shape-based approach for searching and extracting fetal skull boundaries from an obstetric image. The proposed method relies on two major steps. Firstly, we apply the reference axes to scan the image for all potential skull boundaries. The possible skull boundaries are determined whether they are candidates. The candidate with the highest confident value will be selected as the expected head boundary. Then, the position of the expected head boundary is initialized. Secondly, we refine the initial skull boundary using the fuzzy contour model modified from the active contour basis. This results the continuous and smooth fetal skull boundary that we can use for the medical parameter measurement.

  2. An efficient two-objective automatic SAR image segmentation framework using artificial immune system

    NASA Astrophysics Data System (ADS)

    Yang, Dongdong; Niu, Ruican; Fei, Rong; Jiang, Qiaoyong; Li, Hongye; Cao, Zijian

    2015-12-01

    Here, an efficient multi-objective automatic segmentation framework (MASF) is formulated and applied to synthetic aperture radar (SAR) image unsupervised classification. In the framework, three important issues are presented: 1) two reasonable image preprocessing techniques, including spatial filtering and watershed operator, are discussed at the initial stage of the framework; 2)then, an efficient immune multi-objective optimization algorithm with uniform clone, adaptive selection by online nondominated solutions, and dynamic deletion in diversity maintenance is proposed; 3 two very simple, but very efficient conflicting clustering validity indices are incorporated into the framework and simultaneously optimized. Two simulated SAR data and two complicated real images are used to quantitatively validate its effectiveness. In addition, four other state-of-the-art image segmentation methods are employed for comparison.

  3. Statistical Validation of Image Segmentation Quality Based on a Spatial Overlap Index1

    PubMed Central

    Zou, Kelly H.; Warfield, Simon K.; Bharatha, Aditya; Tempany, Clare M.C.; Kaus, Michael R.; Haker, Steven J.; Wells, William M.; Jolesz, Ferenc A.; Kikinis, Ron

    2005-01-01

    Rationale and Objectives To examine a statistical validation method based on the spatial overlap between two sets of segmentations of the same anatomy. Materials and Methods The Dice similarity coefficient (DSC) was used as a statistical validation metric to evaluate the performance of both the reproducibility of manual segmentations and the spatial overlap accuracy of automated probabilistic fractional segmentation of MR images, illustrated on two clinical examples. Example 1: 10 consecutive cases of prostate brachytherapy patients underwent both preoperative 1.5T and intraoperative 0.5T MR imaging. For each case, 5 repeated manual segmentations of the prostate peripheral zone were performed separately on preoperative and on intraoperative images. Example 2: A semi-automated probabilistic fractional segmentation algorithm was applied to MR imaging of 9 cases with 3 types of brain tumors. DSC values were computed and logit-transformed values were compared in the mean with the analysis of variance (ANOVA). Results Example 1: The mean DSCs of 0.883 (range, 0.876–0.893) with 1.5T preoperative MRI and 0.838 (range, 0.819–0.852) with 0.5T intraoperative MRI (P < .001) were within and at the margin of the range of good reproducibility, respectively. Example 2: Wide ranges of DSC were observed in brain tumor segmentations: Meningiomas (0.519–0.893), astrocytomas (0.487–0.972), and other mixed gliomas (0.490–0.899). Conclusion The DSC value is a simple and useful summary measure of spatial overlap, which can be applied to studies of reproducibility and accuracy in image segmentation. We observed generally satisfactory but variable validation results in two clinical applications. This metric may be adapted for similar validation tasks. PMID:14974593

  4. Efficient Fuzzy C-Means Architecture for Image Segmentation

    PubMed Central

    Li, Hui-Ya; Hwang, Wen-Jyi; Chang, Chia-Yen

    2011-01-01

    This paper presents a novel VLSI architecture for image segmentation. The architecture is based on the fuzzy c-means algorithm with spatial constraint for reducing the misclassification rate. In the architecture, the usual iterative operations for updating the membership matrix and cluster centroid are merged into one single updating process to evade the large storage requirement. In addition, an efficient pipelined circuit is used for the updating process for accelerating the computational speed. Experimental results show that the the proposed circuit is an effective alternative for real-time image segmentation with low area cost and low misclassification rate. PMID:22163980

  5. Segmentation of virus particle candidates in transmission electron microscopy images.

    PubMed

    Kylberg, G; Uppström, M; Hedlund, K-O; Borgefors, G; Sintorn, I-M

    2012-02-01

    In this paper, we present an automatic segmentation method that detects virus particles of various shapes in transmission electron microscopy images. The method is based on a statistical analysis of local neighbourhoods of all the pixels in the image followed by an object width discrimination and finally, for elongated objects, a border refinement step. It requires only one input parameter, the approximate width of the virus particles searched for. The proposed method is evaluated on a large number of viruses. It successfully segments viruses regardless of shape, from polyhedral to highly pleomorphic.

  6. Segmented infrared image analysis for rotating machinery fault diagnosis

    NASA Astrophysics Data System (ADS)

    Duan, Lixiang; Yao, Mingchao; Wang, Jinjiang; Bai, Tangbo; Zhang, Laibin

    2016-07-01

    As a noncontact and non-intrusive technique, infrared image analysis becomes promising for machinery defect diagnosis. However, the insignificant information and strong noise in infrared image limit its performance. To address this issue, this paper presents an image segmentation approach to enhance the feature extraction in infrared image analysis. A region selection criterion named dispersion degree is also formulated to discriminate fault representative regions from unrelated background information. Feature extraction and fusion methods are then applied to obtain features from selected regions for further diagnosis. Experimental studies on a rotor fault simulator demonstrate that the presented segmented feature enhancement approach outperforms the one from the original image using both Naïve Bayes classifier and support vector machine.

  7. Computer aided segmentation of kidneys using locally shape constrained deformable models on CT images

    NASA Astrophysics Data System (ADS)

    Erdt, Marius; Sakas, Georgios

    2010-03-01

    This work presents a novel approach for model based segmentation of the kidney in images acquired by Computed Tomography (CT). The developed computer aided segmentation system is expected to support computer aided diagnosis and operation planning. We have developed a deformable model based approach based on local shape constraints that prevents the model from deforming into neighboring structures while allowing the global shape to adapt freely to the data. Those local constraints are derived from the anatomical structure of the kidney and the presence and appearance of neighboring organs. The adaptation process is guided by a rule-based deformation logic in order to improve the robustness of the segmentation in areas of diffuse organ boundaries. Our work flow consists of two steps: 1.) a user guided positioning and 2.) an automatic model adaptation using affine and free form deformation in order to robustly extract the kidney. In cases which show pronounced pathologies, the system also offers real time mesh editing tools for a quick refinement of the segmentation result. Evaluation results based on 30 clinical cases using CT data sets show an average dice correlation coefficient of 93% compared to the ground truth. The results are therefore in most cases comparable to manual delineation. Computation times of the automatic adaptation step are lower than 6 seconds which makes the proposed system suitable for an application in clinical practice.

  8. Automated Segmentation of Nuclei in Breast Cancer Histopathology Images

    PubMed Central

    Paramanandam, Maqlin; O’Byrne, Michael; Ghosh, Bidisha; Mammen, Joy John; Manipadam, Marie Therese; Thamburaj, Robinson; Pakrashi, Vikram

    2016-01-01

    The process of Nuclei detection in high-grade breast cancer images is quite challenging in the case of image processing techniques due to certain heterogeneous characteristics of cancer nuclei such as enlarged and irregularly shaped nuclei, highly coarse chromatin marginalized to the nuclei periphery and visible nucleoli. Recent reviews state that existing techniques show appreciable segmentation accuracy on breast histopathology images whose nuclei are dispersed and regular in texture and shape; however, typical cancer nuclei are often clustered and have irregular texture and shape properties. This paper proposes a novel segmentation algorithm for detecting individual nuclei from Hematoxylin and Eosin (H&E) stained breast histopathology images. This detection framework estimates a nuclei saliency map using tensor voting followed by boundary extraction of the nuclei on the saliency map using a Loopy Back Propagation (LBP) algorithm on a Markov Random Field (MRF). The method was tested on both whole-slide images and frames of breast cancer histopathology images. Experimental results demonstrate high segmentation performance with efficient precision, recall and dice-coefficient rates, upon testing high-grade breast cancer images containing several thousand nuclei. In addition to the optimal performance on the highly complex images presented in this paper, this method also gave appreciable results in comparison with two recently published methods—Wienert et al. (2012) and Veta et al. (2013), which were tested using their own datasets. PMID:27649496

  9. Automated Segmentation of Nuclei in Breast Cancer Histopathology Images.

    PubMed

    Paramanandam, Maqlin; O'Byrne, Michael; Ghosh, Bidisha; Mammen, Joy John; Manipadam, Marie Therese; Thamburaj, Robinson; Pakrashi, Vikram

    2016-01-01

    The process of Nuclei detection in high-grade breast cancer images is quite challenging in the case of image processing techniques due to certain heterogeneous characteristics of cancer nuclei such as enlarged and irregularly shaped nuclei, highly coarse chromatin marginalized to the nuclei periphery and visible nucleoli. Recent reviews state that existing techniques show appreciable segmentation accuracy on breast histopathology images whose nuclei are dispersed and regular in texture and shape; however, typical cancer nuclei are often clustered and have irregular texture and shape properties. This paper proposes a novel segmentation algorithm for detecting individual nuclei from Hematoxylin and Eosin (H&E) stained breast histopathology images. This detection framework estimates a nuclei saliency map using tensor voting followed by boundary extraction of the nuclei on the saliency map using a Loopy Back Propagation (LBP) algorithm on a Markov Random Field (MRF). The method was tested on both whole-slide images and frames of breast cancer histopathology images. Experimental results demonstrate high segmentation performance with efficient precision, recall and dice-coefficient rates, upon testing high-grade breast cancer images containing several thousand nuclei. In addition to the optimal performance on the highly complex images presented in this paper, this method also gave appreciable results in comparison with two recently published methods-Wienert et al. (2012) and Veta et al. (2013), which were tested using their own datasets. PMID:27649496

  10. Automated Segmentation of Nuclei in Breast Cancer Histopathology Images.

    PubMed

    Paramanandam, Maqlin; O'Byrne, Michael; Ghosh, Bidisha; Mammen, Joy John; Manipadam, Marie Therese; Thamburaj, Robinson; Pakrashi, Vikram

    2016-01-01

    The process of Nuclei detection in high-grade breast cancer images is quite challenging in the case of image processing techniques due to certain heterogeneous characteristics of cancer nuclei such as enlarged and irregularly shaped nuclei, highly coarse chromatin marginalized to the nuclei periphery and visible nucleoli. Recent reviews state that existing techniques show appreciable segmentation accuracy on breast histopathology images whose nuclei are dispersed and regular in texture and shape; however, typical cancer nuclei are often clustered and have irregular texture and shape properties. This paper proposes a novel segmentation algorithm for detecting individual nuclei from Hematoxylin and Eosin (H&E) stained breast histopathology images. This detection framework estimates a nuclei saliency map using tensor voting followed by boundary extraction of the nuclei on the saliency map using a Loopy Back Propagation (LBP) algorithm on a Markov Random Field (MRF). The method was tested on both whole-slide images and frames of breast cancer histopathology images. Experimental results demonstrate high segmentation performance with efficient precision, recall and dice-coefficient rates, upon testing high-grade breast cancer images containing several thousand nuclei. In addition to the optimal performance on the highly complex images presented in this paper, this method also gave appreciable results in comparison with two recently published methods-Wienert et al. (2012) and Veta et al. (2013), which were tested using their own datasets.

  11. Image Segmentation Analysis for NASA Earth Science Applications

    NASA Technical Reports Server (NTRS)

    Tilton, James C.

    2010-01-01

    NASA collects large volumes of imagery data from satellite-based Earth remote sensing sensors. Nearly all of the computerized image analysis of this data is performed pixel-by-pixel, in which an algorithm is applied directly to individual image pixels. While this analysis approach is satisfactory in many cases, it is usually not fully effective in extracting the full information content from the high spatial resolution image data that s now becoming increasingly available from these sensors. The field of object-based image analysis (OBIA) has arisen in recent years to address the need to move beyond pixel-based analysis. The Recursive Hierarchical Segmentation (RHSEG) software developed by the author is being used to facilitate moving from pixel-based image analysis to OBIA. The key unique aspect of RHSEG is that it tightly intertwines region growing segmentation, which produces spatially connected region objects, with region object classification, which groups sets of region objects together into region classes. No other practical, operational image segmentation approach has this tight integration of region growing object finding with region classification This integration is made possible by the recursive, divide-and-conquer implementation utilized by RHSEG, in which the input image data is recursively subdivided until the image data sections are small enough to successfully mitigat the combinatorial explosion caused by the need to compute the dissimilarity between each pair of image pixels. RHSEG's tight integration of region growing object finding and region classification is what enables the high spatial fidelity of the image segmentations produced by RHSEG. This presentation will provide an overview of the RHSEG algorithm and describe how it is currently being used to support OBIA or Earth Science applications such as snow/ice mapping and finding archaeological sites from remotely sensed data.

  12. Prioritization of brain MRI volumes using medical image perception model and tumor region segmentation.

    PubMed

    Mehmood, Irfan; Ejaz, Naveed; Sajjad, Muhammad; Baik, Sung Wook

    2013-10-01

    The objective of the present study is to explore prioritization methods in diagnostic imaging modalities to automatically determine the contents of medical images. In this paper, we propose an efficient prioritization of brain MRI. First, the visual perception of the radiologists is adapted to identify salient regions. Then this saliency information is used as an automatic label for accurate segmentation of brain lesion to determine the scientific value of that image. The qualitative and quantitative results prove that the rankings generated by the proposed method are closer to the rankings created by radiologists. PMID:24034739

  13. Enhancement dark channel algorithm of color fog image based on the local segmentation

    NASA Astrophysics Data System (ADS)

    Yun, Lijun; Gao, Yin; Shi, Jun-sheng; Xu, Ling-zhang

    2015-04-01

    The classical dark channel theory algorithm has yielded good results in the processing of single fog image, but in some larger contrast regions, it appears image hue, brightness and saturation distortion problems to a certain degree, and also produces halo phenomenon. In the view of the above situation, through a lot of experiments, this paper has found some factors causing the halo phenomenon. The enhancement dark channel algorithm of color fog image based on the local segmentation is proposed. On the basis of the dark channel theory, first of all, the classic dark channel theory of mathematical model is modified, which is mainly to correct the brightness and saturation of image. Then, according to the local adaptive segmentation theory, it process the block of image, and overlap the local image. On the basis of the statistical rules, it obtains each pixel value from the segmentation processing, so as to obtain the local image. At last, using the dark channel theory, it achieves the enhanced fog image. Through the subjective observation and objective evaluation, the algorithm is better than the classic dark channel algorithm in the overall and details.

  14. Segmentation and feature extraction of cervical spine x-ray images

    NASA Astrophysics Data System (ADS)

    Long, L. Rodney; Thoma, George R.

    1999-05-01

    As part of an R&D project in mixed text/image database design, the National Library of Medicine has archived a collection of 17,000 digitized x-ray images of the cervical and lumbar spine which were collected as part of the second National Health and Nutrition Examination Survey (NHANES II). To make this image data available and usable to a wide audience, we are investigating techniques for indexing the image content by automated or semi-automated means. Indexing of the images by features of interest to researchers in spine disease and structure requires effective segmentation of the vertebral anatomy. This paper describes work in progress toward this segmentation of the cervical spine images into anatomical components of interest, including anatomical landmarks for vertebral location, and segmentation and identification of individual vertebrae. Our work includes developing a reliable method for automatically fixing an anatomy-based coordinate system in the images, and work to adaptively threshold the images, using methods previously applied by researchers in cardioangiography. We describe the motivation for our work and present our current results in both areas.

  15. Image Segmentation Using Higher-Order Correlation Clustering.

    PubMed

    Kim, Sungwoong; Yoo, Chang D; Nowozin, Sebastian; Kohli, Pushmeet

    2014-09-01

    In this paper, a hypergraph-based image segmentation framework is formulated in a supervised manner for many high-level computer vision tasks. To consider short- and long-range dependency among various regions of an image and also to incorporate wider selection of features, a higher-order correlation clustering (HO-CC) is incorporated in the framework. Correlation clustering (CC), which is a graph-partitioning algorithm, was recently shown to be effective in a number of applications such as natural language processing, document clustering, and image segmentation. It derives its partitioning result from a pairwise graph by optimizing a global objective function such that it simultaneously maximizes both intra-cluster similarity and inter-cluster dissimilarity. In the HO-CC, the pairwise graph which is used in the CC is generalized to a hypergraph which can alleviate local boundary ambiguities that can occur in the CC. Fast inference is possible by linear programming relaxation, and effective parameter learning by structured support vector machine is also possible by incorporating a decomposable structured loss function. Experimental results on various data sets show that the proposed HO-CC outperforms other state-of-the-art image segmentation algorithms. The HO-CC framework is therefore an efficient and flexible image segmentation framework. PMID:26352230

  16. Automatic comic page image understanding based on edge segment analysis

    NASA Astrophysics Data System (ADS)

    Liu, Dong; Wang, Yongtao; Tang, Zhi; Li, Luyuan; Gao, Liangcai

    2013-12-01

    Comic page image understanding aims to analyse the layout of the comic page images by detecting the storyboards and identifying the reading order automatically. It is the key technique to produce the digital comic documents suitable for reading on mobile devices. In this paper, we propose a novel comic page image understanding method based on edge segment analysis. First, we propose an efficient edge point chaining method to extract Canny edge segments (i.e., contiguous chains of Canny edge points) from the input comic page image; second, we propose a top-down scheme to detect line segments within each obtained edge segment; third, we develop a novel method to detect the storyboards by selecting the border lines and further identify the reading order of these storyboards. The proposed method is performed on a data set consisting of 2000 comic page images from ten printed comic series. The experimental results demonstrate that the proposed method achieves satisfactory results on different comics and outperforms the existing methods.

  17. An approach toward fast gradient-based image segmentation.

    PubMed

    Hell, Benjamin; Kassubeck, Marc; Bauszat, Pablo; Eisemann, Martin; Magnor, Marcus

    2015-09-01

    In this paper, we present and investigate an approach to fast multilabel color image segmentation using convex optimization techniques. The presented model is in some ways related to the well-known Mumford-Shah model, but deviates in certain important aspects. The optimization problem has been designed with two goals in mind. The objective function should represent fundamental concepts of image segmentation, such as incorporation of weighted curve length and variation of intensity in the segmented regions, while allowing transformation into a convex concave saddle point problem that is computationally inexpensive to solve. This paper introduces such a model, the nontrivial transformation of this model into a convex-concave saddle point problem, and the numerical treatment of the problem. We evaluate our approach by applying our algorithm to various images and show that our results are competitive in terms of quality at unprecedentedly low computation times. Our algorithm allows high-quality segmentation of megapixel images in a few seconds and achieves interactive performance for low resolution images.

  18. Automatic segmentation of MR brain images in multiple sclerosis patients

    NASA Astrophysics Data System (ADS)

    Avula, Ramesh T. V.; Erickson, Bradley J.

    1996-04-01

    A totally automatic scheme for segmenting brain from extracranial tissues and to classify all intracranial voxels as CSF, gray matter (GM), white matter (WM), or abnormality such as multiple sclerosis (MS) lesions is presented in this paper. It is observed that in MR head images, if a tissue's intensity values are normalized, its relationship to the other tissues is essentially constant for a given type of image. Based on this approach, the subcutaneous fat surrounding the head is normalized to classify other tissues. Spatially registered 3 mm MR head image slices of T1 weighted, fast spin echo [dual echo T2 weighted and proton density (PD) weighted images] and fast fluid attenuated inversion recovery (FLAIR) sequences are used for segmentation. Subcutaneous fat surrounding the skull was identified based on intensity thresholding from T1 weighted images. A multiparametric space map was developed for CSF, GM and WM by normalizing each tissue with respect to the mean value of corresponding subcutaneous fat on each pulse sequence. To reduce the low frequency noise without blurring the fine morphological high frequency details an anisotropic diffusion filter was applied to all images before segmentation. An initial slice by slice classification was followed by morphological operations to delete any brides connecting extracranial segments. Finally 3-dimensional region growing of the segmented brain extracts GM, WM and pathology. The algorithm was tested on sequential scans of 10 patients with MS lesions. For well registered sequences, tissues and pathology have been accurately classified. This procedure does not require user input or image training data sets, and shows promise for automatic classification of brain and pathology.

  19. Automatic segmentation and classification of seven-segment display digits on auroral images

    NASA Astrophysics Data System (ADS)

    Savolainen, Tuomas; Whiter, Daniel Keith; Partamies, Noora

    2016-07-01

    In this paper we describe a new and fully automatic method for segmenting and classifying digits in seven-segment displays. The method is applied to a dataset consisting of about 7 million auroral all-sky images taken during the time period of 1973-1997 at camera stations centred around Sodankylä observatory in northern Finland. In each image there is a clock display for the date and time together with the reflection of the whole night sky through a spherical mirror. The digitised film images of the night sky contain valuable scientific information but are impractical to use without an automatic method for extracting the date-time from the display. We describe the implementation and the results of such a method in detail in this paper.

  20. Interactive Medical Image Segmentation using PDE Control of Active Contours

    PubMed Central

    Karasev, Peter; Kolesov, Ivan; Fritscher, Karl; Vela, Patricio; Mitchell, Phillip; Tannenbaum, Allen

    2014-01-01

    Segmentation of injured or unusual anatomic structures in medical imagery is a problem that has continued to elude fully automated solutions. In this paper, the goal of easy-to-use and consistent interactive segmentation is transformed into a control synthesis problem. A nominal level set PDE is assumed to be given; this open-loop system achieves correct segmentation under ideal conditions, but does not agree with a human expert's ideal boundary for real image data. Perturbing the state and dynamics of a level set PDE via the accumulated user input and an observer-like system leads to desirable closed-loop behavior. The input structure is designed such that a user can stabilize the boundary in some desired state without needing to understand any mathematical parameters. Effectiveness of the technique is illustrated with applications to the challenging segmentations of a patellar tendon in MR and a shattered femur in CT. PMID:23893712

  1. Automatic layer segmentation of H&E microscopic images of mice skin

    NASA Astrophysics Data System (ADS)

    Hussein, Saif; Selway, Joanne; Jassim, Sabah; Al-Assam, Hisham

    2016-05-01

    Mammalian skin is a complex organ composed of a variety of cells and tissue types. The automatic detection and quantification of changes in skin structures has a wide range of applications for biological research. To accurately segment and quantify nuclei, sebaceous gland, hair follicles, and other skin structures, there is a need for a reliable segmentation of different skin layers. This paper presents an efficient segmentation algorithm to segment the three main layers of mice skin, namely epidermis, dermis, and subcutaneous layers. It also segments the epidermis layer into two sub layers, basal and cornified layers. The proposed algorithm uses adaptive colour deconvolution technique on H&E stain images to separate different tissue structures, inter-modes and Otsu thresholding techniques were effectively combined to segment the layers. It then uses a set of morphological and logical operations on each layer to removing unwanted objects. A dataset of 7000 H&E microscopic images of mutant and wild type mice were used to evaluate the effectiveness of the algorithm. Experimental results examined by domain experts have confirmed the viability of the proposed algorithms.

  2. Multimodality medical image fusion: probabilistic quantification, segmentation, and registration

    NASA Astrophysics Data System (ADS)

    Wang, Yue J.; Freedman, Matthew T.; Xuan, Jian Hua; Zheng, Qinfen; Mun, Seong K.

    1998-06-01

    Multimodality medical image fusion is becoming increasingly important in clinical applications, which involves information processing, registration and visualization of interventional and/or diagnostic images obtained from different modalities. This work is to develop a multimodality medical image fusion technique through probabilistic quantification, segmentation, and registration, based on statistical data mapping, multiple feature correlation, and probabilistic mean ergodic theorems. The goal of image fusion is to geometrically align two or more image areas/volumes so that pixels/voxels representing the same underlying anatomical structure can be superimposed meaningfully. Three steps are involved. To accurately extract the regions of interest, we developed the model supported Bayesian relaxation labeling, and edge detection and region growing integrated algorithms to segment the images into objects. After identifying the shift-invariant features (i.e., edge and region information), we provided an accurate and robust registration technique which is based on matching multiple binary feature images through a site model based image re-projection. The image was initially segmented into specified number of regions. A rough contour can be obtained by delineating and merging some of the segmented regions. We applied region growing and morphological filtering to extract the contour and get rid of some disconnected residual pixels after segmentation. The matching algorithm is implemented as follows: (1) the centroids of PET/CT and MR images are computed and then translated to the center of both images. (2) preliminary registration is performed first to determine an initial range of scaling factors and rotations, and the MR image is then resampled according to the specified parameters. (3) the total binary difference of the corresponding binary maps in both images is calculated for the selected registration parameters, and the final registration is achieved when the

  3. Filter Design and Performance Evaluation for Fingerprint Image Segmentation.

    PubMed

    Thai, Duy Hoang; Huckemann, Stephan; Gottschlich, Carsten

    2016-01-01

    Fingerprint recognition plays an important role in many commercial applications and is used by millions of people every day, e.g. for unlocking mobile phones. Fingerprint image segmentation is typically the first processing step of most fingerprint algorithms and it divides an image into foreground, the region of interest, and background. Two types of error can occur during this step which both have a negative impact on the recognition performance: 'true' foreground can be labeled as background and features like minutiae can be lost, or conversely 'true' background can be misclassified as foreground and spurious features can be introduced. The contribution of this paper is threefold: firstly, we propose a novel factorized directional bandpass (FDB) segmentation method for texture extraction based on the directional Hilbert transform of a Butterworth bandpass (DHBB) filter interwoven with soft-thresholding. Secondly, we provide a manually marked ground truth segmentation for 10560 images as an evaluation benchmark. Thirdly, we conduct a systematic performance comparison between the FDB method and four of the most often cited fingerprint segmentation algorithms showing that the FDB segmentation method clearly outperforms these four widely used methods. The benchmark and the implementation of the FDB method are made publicly available.

  4. Filter Design and Performance Evaluation for Fingerprint Image Segmentation.

    PubMed

    Thai, Duy Hoang; Huckemann, Stephan; Gottschlich, Carsten

    2016-01-01

    Fingerprint recognition plays an important role in many commercial applications and is used by millions of people every day, e.g. for unlocking mobile phones. Fingerprint image segmentation is typically the first processing step of most fingerprint algorithms and it divides an image into foreground, the region of interest, and background. Two types of error can occur during this step which both have a negative impact on the recognition performance: 'true' foreground can be labeled as background and features like minutiae can be lost, or conversely 'true' background can be misclassified as foreground and spurious features can be introduced. The contribution of this paper is threefold: firstly, we propose a novel factorized directional bandpass (FDB) segmentation method for texture extraction based on the directional Hilbert transform of a Butterworth bandpass (DHBB) filter interwoven with soft-thresholding. Secondly, we provide a manually marked ground truth segmentation for 10560 images as an evaluation benchmark. Thirdly, we conduct a systematic performance comparison between the FDB method and four of the most often cited fingerprint segmentation algorithms showing that the FDB segmentation method clearly outperforms these four widely used methods. The benchmark and the implementation of the FDB method are made publicly available. PMID:27171150

  5. Filter Design and Performance Evaluation for Fingerprint Image Segmentation

    PubMed Central

    Thai, Duy Hoang; Huckemann, Stephan; Gottschlich, Carsten

    2016-01-01

    Fingerprint recognition plays an important role in many commercial applications and is used by millions of people every day, e.g. for unlocking mobile phones. Fingerprint image segmentation is typically the first processing step of most fingerprint algorithms and it divides an image into foreground, the region of interest, and background. Two types of error can occur during this step which both have a negative impact on the recognition performance: ‘true’ foreground can be labeled as background and features like minutiae can be lost, or conversely ‘true’ background can be misclassified as foreground and spurious features can be introduced. The contribution of this paper is threefold: firstly, we propose a novel factorized directional bandpass (FDB) segmentation method for texture extraction based on the directional Hilbert transform of a Butterworth bandpass (DHBB) filter interwoven with soft-thresholding. Secondly, we provide a manually marked ground truth segmentation for 10560 images as an evaluation benchmark. Thirdly, we conduct a systematic performance comparison between the FDB method and four of the most often cited fingerprint segmentation algorithms showing that the FDB segmentation method clearly outperforms these four widely used methods. The benchmark and the implementation of the FDB method are made publicly available. PMID:27171150

  6. Deploying swarm intelligence in medical imaging identifying metastasis, micro-calcifications and brain image segmentation.

    PubMed

    al-Rifaie, Mohammad Majid; Aber, Ahmed; Hemanth, Duraiswamy Jude

    2015-12-01

    This study proposes an umbrella deployment of swarm intelligence algorithm, such as stochastic diffusion search for medical imaging applications. After summarising the results of some previous works which shows how the algorithm assists in the identification of metastasis in bone scans and microcalcifications on mammographs, for the first time, the use of the algorithm in assessing the CT images of the aorta is demonstrated along with its performance in detecting the nasogastric tube in chest X-ray. The swarm intelligence algorithm presented in this study is adapted to address these particular tasks and its functionality is investigated by running the swarms on sample CT images and X-rays whose status have been determined by senior radiologists. In addition, a hybrid swarm intelligence-learning vector quantisation (LVQ) approach is proposed in the context of magnetic resonance (MR) brain image segmentation. The particle swarm optimisation is used to train the LVQ which eliminates the iteration-dependent nature of LVQ. The proposed methodology is used to detect the tumour regions in the abnormal MR brain images. PMID:26577158

  7. User-agent cooperation in multiagent IVUS image segmentation.

    PubMed

    Bovenkamp, E G P; Dijkstra, J; Bosch, J G; Reiber, J H C

    2009-01-01

    Automated interpretation of complex images requires elaborate knowledge and model-based image analysis, but often needs interaction with an expert as well. This research describes expert interaction with a multiagent image interpretation system using only a restricted vocabulary of high-level user interactions. The aim is to minimize inter- and intra-observer variability by keeping the total number of interactions as low and simple as possible. The multiagent image interpretation system has elaborate high-level knowledge-based control over low-level image segmentation algorithms. Agents use contextual knowledge to keep the number of interactions low but, when in doubt, present the user with the most likely interpretation of the situation. The user, in turn, can correct, supplement, and/or confirm the results of image-processing agents. This is done at a very high level of abstraction such that no knowledge of the underlying segmentation methods, parameters or agent functioning is needed. High-level interaction thereby replaces more traditional contour correction methods like inserting points and/or (re)drawing contours. This makes it easier for the user to obtain good results, while inter- and intra-observer variability are kept minimal, since the image segmentation itself remains under control of image-processing agents. The system has been applied to intravascular ultrasound (IVUS) images. Experiments show that with an average of 2-3 high-level user interactions per correction, segmentation results substantially improve while the variation is greatly reduced. The achieved level of accuracy and repeatability is equivalent to that of manual drawing by an expert. PMID:19116192

  8. Quantitative measure in image segmentation for skin lesion images: A preliminary study

    NASA Astrophysics Data System (ADS)

    Azmi, Nurulhuda Firdaus Mohd; Ibrahim, Mohd Hakimi Aiman; Keng, Lau Hui; Ibrahim, Nuzulha Khilwani; Sarkan, Haslina Md

    2014-12-01

    Automatic Skin Lesion Diagnosis (ASLD) allows skin lesion diagnosis by using a computer or mobile devices. The idea of using a computer to assist in diagnosis of skin lesions was first proposed in the literature around 1985. Images of skin lesions are analyzed by the computer to capture certain features thought to be characteristic of skin diseases. These features (expressed as numeric values) are then used to classify the image and report a diagnosis. Image segmentation is often a critical step in image analysis and it may use statistical classification, thresholding, edge detection, region detection, or any combination of these techniques. Nevertheless, image segmentation of skin lesion images is yet limited to superficial evaluations which merely display images of the segmentation results and appeal to the reader's intuition for evaluation. There is a consistent lack of quantitative measure, thus, it is difficult to know which segmentation present useful results and in which situations they do so. If segmentation is done well, then, all other stages in image analysis are made simpler. If significant features (that are crucial for diagnosis) are not extracted from images, it will affect the accuracy of the automated diagnosis. This paper explore the existing quantitative measure in image segmentation ranging in the application of pattern recognition for example hand writing, plat number, and colour. Selecting the most suitable segmentation measure is highly important so that as much relevant features can be identified and extracted.

  9. Segmented images and 3D images for studying the anatomical structures in MRIs

    NASA Astrophysics Data System (ADS)

    Lee, Yong Sook; Chung, Min Suk; Cho, Jae Hyun

    2004-05-01

    For identifying the pathological findings in MRIs, the anatomical structures in MRIs should be identified in advance. For studying the anatomical structures in MRIs, an education al tool that includes the horizontal, coronal, sagittal MRIs of entire body, corresponding segmented images, 3D images, and browsing software is necessary. Such an educational tool, however, is hard to obtain. Therefore, in this research, such an educational tool which helps medical students and doctors study the anatomical structures in MRIs was made as follows. A healthy, young Korean male adult with standard body shape was selected. Six hundred thirteen horizontal MRIs of the entire body were scanned and inputted to the personal computer. Sixty anatomical structures in the horizontal MRIs were segmented to make horizontal segmented images. Coronal, sagittal MRIs and coronal, sagittal segmented images were made. 3D images of anatomical structures in the segmented images were reconstructed by surface rendering method. Browsing software of the MRIs, segmented images, and 3D images was composed. This educational tool that includes horizontal, coronal, sagittal MRIs of entire body, corresponding segmented images, 3D images, and browsing software is expected to help medical students and doctors study anatomical structures in MRIs.

  10. Color image segmentation by the vector-valued Allen-Cahn phase-field model: a multigrid solution.

    PubMed

    Kay, David A; Tomasi, Alessandro

    2009-10-01

    We present an efficient numerical solution of a PDE-driven model for color image segmentation and give numerical examples of the results. The method combines the vector-valued Allen-Cahn phase field equation with initial data fitting terms with prescribed interface width and fidelity constants. Efficient numerical solution is achieved using a multigrid splitting of a finite element space, thereby producing an efficient and robust method for the segmentation of large images. We also present the use of adaptive mesh refinement to further speed up the segmentation process.

  11. Segmentation and separation of venous vasculatures in liver CT images

    NASA Astrophysics Data System (ADS)

    Wang, Lei; Hansen, Christian; Zidowitz, Stephan; Hahn, Horst K.

    2014-03-01

    Computer-aided analysis of venous vasculatures including hepatic veins and portal veins is important in liver surgery planning. The analysis normally consists of two important pre-processing tasks: segmenting both vasculatures and separating them from each other by assigning different labels. During the acquisition of multi-phase CT images, both of the venous vessels are enhanced by injected contrast agent and acquired either in a common phase or in two individual phases. The enhanced signals established by contrast agent are often not stably acquired due to non-optimal acquisition time. Inadequate contrast and the presence of large lesions in oncological patients, make the segmentation task quite challenging. To overcome these diffculties, we propose a framework with minimal user interactions to analyze venous vasculatures in multi-phase CT images. Firstly, presented vasculatures are automatically segmented adopting an efficient multi-scale Hessian-based vesselness filter. The initially segmented vessel trees are then converted to a graph representation, on which a series of graph filters are applied in post-processing steps to rule out irrelevant structures. Eventually, we develop a semi-automatic workow to refine the segmentation in the areas of inferior vena cava and entrance of portal veins, and to simultaneously separate hepatic veins from portal veins. Segmentation quality was evaluated with intensive tests enclosing 60 CT images from both healthy liver donors and oncological patients. To quantitatively measure the similarities between segmented and reference vessel trees, we propose three additional metrics: skeleton distance, branch coverage, and boundary surface distance, which are dedicated to quantifying the misalignment induced by both branching patterns and radii of two vessel trees.

  12. An adaptive algorithm for motion compensated color image coding

    NASA Technical Reports Server (NTRS)

    Kwatra, Subhash C.; Whyte, Wayne A.; Lin, Chow-Ming

    1987-01-01

    This paper presents an adaptive algorithm for motion compensated color image coding. The algorithm can be used for video teleconferencing or broadcast signals. Activity segmentation is used to reduce the bit rate and a variable stage search is conducted to save computations. The adaptive algorithm is compared with the nonadaptive algorithm and it is shown that with approximately 60 percent savings in computing the motion vector and 33 percent additional compression, the performance of the adaptive algorithm is similar to the nonadaptive algorithm. The adaptive algorithm results also show improvement of up to 1 bit/pel over interframe DPCM coding with nonuniform quantization. The test pictures used for this study were recorded directly from broadcast video in color.

  13. Medical image segmentation using object atlas versus object cloud models

    NASA Astrophysics Data System (ADS)

    Phellan, Renzo; Falcão, Alexandre X.; Udupa, Jayaram K.

    2015-03-01

    Medical image segmentation is crucial for quantitative organ analysis and surgical planning. Since interactive segmentation is not practical in a production-mode clinical setting, automatic methods based on 3D object appearance models have been proposed. Among them, approaches based on object atlas are the most actively investigated. A key drawback of these approaches is that they require a time-costly image registration process to build and deploy the atlas. Object cloud models (OCM) have been introduced to avoid registration, considerably speeding up the whole process, but they have not been compared to object atlas models (OAM). The present paper fills this gap by presenting a comparative analysis of the two approaches in the task of individually segmenting nine anatomical structures of the human body. Our results indicate that OCM achieve a statistically significant better accuracy for seven anatomical structures, in terms of Dice Similarity Coefficient and Average Symmetric Surface Distance.

  14. Automatic sputum color image segmentation for tuberculosis diagnosis

    NASA Astrophysics Data System (ADS)

    Forero-Vargas, Manuel G.; Sierra-Ballen, Eduard L.; Alvarez-Borrego, Josue; Pech-Pacheco, Jose L.; Cristobal-Perez, Gabriel; Alcala, Luis; Desco, Manuel

    2001-11-01

    Tuberculosis (TB) and other mycobacteriosis are serious illnesses which control is mainly based on presumptive diagnosis. Besides of clinical suspicion, the diagnosis of mycobacteriosis must be done through genus specific smears of clinical specimens. However, these techniques lack of sensitivity and consequently clinicians must wait culture results as much as two months. Computer analysis of digital images from these smears could improve sensitivity of the test and, moreover, decrease workload of the micobacteriologist. Bacteria segmentation of particular species entails a complex process. Bacteria shape is not enough as a discriminant feature, because there are many species that share the same shape. Therefore the segmentation procedure requires to be improved using the color image information. In this paper we present two segmentation procedures based on fuzzy rules and phase-only correlation techniques respectively that will provide the basis of a future automatic particle' screening.

  15. Automatic segmentation of chromosomes in Q-band images.

    PubMed

    Grisan, Enrico; Poletti, Enea; Tomelleri, Christopher; Ruggeri, Alfredo

    2007-01-01

    Karyotype analysis is a widespread procedure in cytogenetics to assess the possible presence of genetics defects. The procedure is lengthy and repetitive, so that an automatic analysis would greatly help the cytogeneticist routine work. Still, automatic segmentation and full disentangling of chromosomes are open issues. We propose an automatic procedure to obtain the separated chromosomes, which are then ready for a subsequent classification step. The segmentation is carried out by means of a space variant thresholding scheme, which proved to be successful even in presence of hyper- or hypo-fluorescent regions in the image. Then a greedy approach is used to identify and resolve touching and overlapping chromosomes, based on geometric evidence and image information. We show the effectiveness of the proposed method on routine data: 90% of the overlaps and 92% of the adjacencies are resolved, resulting in a correct segmentation of 96% of the chromosomes.

  16. Automatic segmentation of cerebral MR images using artificial neural networks

    SciTech Connect

    Alirezaie, J.; Jernigan, M.E.; Nahmias, C.

    1996-12-31

    In this paper we present an unsupervised clustering technique for multispectral segmentation of magnetic resonance (MR) images of the human brain. Our scheme utilizes the Self Organizing Feature Map (SOFM) artificial neural network for feature mapping and generates a set of codebook vectors. By extending the network with an additional layer the map will be classified and each tissue class will be labelled. An algorithm has been developed for extracting the cerebrum from the head scan prior to the segmentation. Extracting the cerebrum is performed by stripping away the skull pixels from the T2 image. Three tissue types of the brain: white matter, gray matter and cerebral spinal fluid (CSF) are segmented accurately. To compare the results with other conventional approaches we applied the c-means algorithm to the problem.

  17. Deformable M-Reps for 3D Medical Image Segmentation.

    PubMed

    Pizer, Stephen M; Fletcher, P Thomas; Joshi, Sarang; Thall, Andrew; Chen, James Z; Fridman, Yonatan; Fritsch, Daniel S; Gash, Graham; Glotzer, John M; Jiroutek, Michael R; Lu, Conglin; Muller, Keith E; Tracton, Gregg; Yushkevich, Paul; Chaney, Edward L

    2003-11-01

    M-reps (formerly called DSLs) are a multiscale medial means for modeling and rendering 3D solid geometry. They are particularly well suited to model anatomic objects and in particular to capture prior geometric information effectively in deformable models segmentation approaches. The representation is based on figural models, which define objects at coarse scale by a hierarchy of figures - each figure generally a slab representing a solid region and its boundary simultaneously. This paper focuses on the use of single figure models to segment objects of relatively simple structure. A single figure is a sheet of medial atoms, which is interpolated from the model formed by a net, i.e., a mesh or chain, of medial atoms (hence the name m-reps), each atom modeling a solid region via not only a position and a width but also a local figural frame giving figural directions and an object angle between opposing, corresponding positions on the boundary implied by the m-rep. The special capability of an m-rep is to provide spatial and orientational correspondence between an object in two different states of deformation. This ability is central to effective measurement of both geometric typicality and geometry to image match, the two terms of the objective function optimized in segmentation by deformable models. The other ability of m-reps central to effective segmentation is their ability to support segmentation at multiple levels of scale, with successively finer precision. Objects modeled by single figures are segmented first by a similarity transform augmented by object elongation, then by adjustment of each medial atom, and finally by displacing a dense sampling of the m-rep implied boundary. While these models and approaches also exist in 2D, we focus on 3D objects. The segmentation of the kidney from CT and the hippocampus from MRI serve as the major examples in this paper. The accuracy of segmentation as compared to manual, slice-by-slice segmentation is reported.

  18. Automatic tissue segmentation of neonate brain MR Images with subject-specific atlases

    NASA Astrophysics Data System (ADS)

    Cherel, Marie; Budin, Francois; Prastawa, Marcel; Gerig, Guido; Lee, Kevin; Buss, Claudia; Lyall, Amanda; Zaldarriaga Consing, Kirsten; Styner, Martin

    2015-03-01

    Automatic tissue segmentation of the neonate brain using Magnetic Resonance Images (MRI) is extremely important to study brain development and perform early diagnostics but is challenging due to high variability and inhomogeneity in contrast throughout the image due to incomplete myelination of the white matter tracts. For these reasons, current methods often totally fail or give unsatisfying results. Furthermore, most of the subcortical midbrain structures are misclassified due to a lack of contrast in these regions. We have developed a novel method that creates a probabilistic subject-specific atlas based on a population atlas currently containing a number of manually segmented cases. The generated subject-specific atlas is sharp and adapted to the subject that is being processed. We then segment brain tissue classes using the newly created atlas with a single-atlas expectation maximization based method. Our proposed method leads to a much lower failure rate in our experiments. The overall segmentation results are considerably improved when compared to using a non-subject-specific, population average atlas. Additionally, we have incorporated diffusion information obtained from Diffusion Tensor Images (DTI) to improve the detection of white matter that is not visible at this early age in structural MRI (sMRI) due to a lack of myelination. Although this necessitates the acquisition of an additional sequence, the diffusion information improves the white matter segmentation throughout the brain, especially for the mid-brain structures such as the corpus callosum and the internal capsule.

  19. Automatic Tissue Segmentation of Neonate Brain MR Images with Subject-specific Atlases

    PubMed Central

    Cherel, Marie; Budin, Francois; Prastawa, Marcel; Gerig, Guido; Lee, Kevin; Buss, Claudia; Lyall, Amanda; Consing, Kirsten Zaldarriaga; Styner, Martin

    2015-01-01

    Automatic tissue segmentation of the neonate brain using Magnetic Resonance Images (MRI) is extremely important to study brain development and perform early diagnostics but is challenging due to high variability and inhomogeneity in contrast throughout the image due to incomplete myelination of the white matter tracts. For these reasons, current methods often totally fail or give unsatisfying results. Furthermore, most of the subcortical midbrain structures are misclassified due to a lack of contrast in these regions. We have developed a novel method that creates a probabilistic subject-specific atlas based on a population atlas currently containing a number of manually segmented cases. The generated subject-specific atlas is sharp and adapted to the subject that is being processed. We then segment brain tissue classes using the newly created atlas with a single-atlas expectation maximization based method. Our proposed method leads to a much lower failure rate in our experiments. The overall segmentation results are considerably improved when compared to using a non-subject-specific, population average atlas. Additionally, we have incorporated diffusion information obtained from Diffusion Tensor Images (DTI) to improve the detection of white matter that is not visible at this early age in structural MRI (sMRI) due to a lack of myelination. Although this necessitates the acquisition of an additional sequence, the diffusion information improves the white matter segmentation throughout the brain, especially for the mid-brain structures such as the corpus callosum and the internal capsule. PMID:26089584

  20. Generalized method for partial volume estimation and tissue segmentation in cerebral magnetic resonance images

    PubMed Central

    Khademi, April; Venetsanopoulos, Anastasios; Moody, Alan R.

    2014-01-01

    Abstract. An artifact found in magnetic resonance images (MRI) called partial volume averaging (PVA) has received much attention since accurate segmentation of cerebral anatomy and pathology is impeded by this artifact. Traditional neurological segmentation techniques rely on Gaussian mixture models to handle noise and PVA, or high-dimensional feature sets that exploit redundancy in multispectral datasets. Unfortunately, model-based techniques may not be optimal for images with non-Gaussian noise distributions and/or pathology, and multispectral techniques model probabilities instead of the partial volume (PV) fraction. For robust segmentation, a PV fraction estimation approach is developed for cerebral MRI that does not depend on predetermined intensity distribution models or multispectral scans. Instead, the PV fraction is estimated directly from each image using an adaptively defined global edge map constructed by exploiting a relationship between edge content and PVA. The final PVA map is used to segment anatomy and pathology with subvoxel accuracy. Validation on simulated and real, pathology-free T1 MRI (Gaussian noise), as well as pathological fluid attenuation inversion recovery MRI (non-Gaussian noise), demonstrate that the PV fraction is accurately estimated and the resultant segmentation is robust. Comparison to model-based methods further highlight the benefits of the current approach. PMID:26158022

  1. An Investigation of Implicit Active Contours for Scientific Image Segmentation

    SciTech Connect

    Weeratunga, S K; Kamath, C

    2003-10-29

    The use of partial differential equations in image processing has become an active area of research in the last few years. In particular, active contours are being used for image segmentation, either explicitly as snakes, or implicitly through the level set approach. In this paper, we consider the use of the implicit active contour approach for segmenting scientific images of pollen grains obtained using a scanning electron microscope. Our goal is to better understand the pros and cons of these techniques and to compare them with the traditional approaches such as the Canny and SUSAN edge detectors. The preliminary results of our study show that the level set method is computationally expensive and requires the setting of several different parameters. However, it results in closed contours, which may be useful in separating objects from the background in an image.

  2. Statistical Characterization and Segmentation of Drusen in Fundus Images

    SciTech Connect

    Santos-Villalobos, Hector J; Karnowski, Thomas Paul; Aykac, Deniz; Giancardo, Luca; Li, Yaquin; Nichols, Trent L; Tobin Jr, Kenneth William; Chaum, Edward

    2011-01-01

    Age related Macular Degeneration (AMD) is a disease of the retina associated with aging. AMD progression in patients is characterized by drusen, pigmentation changes, and geographic atrophy, which can be seen using fundus imagery. The level of AMD is characterized by standard scaling methods, which can be somewhat subjective in practice. In this work we propose a statistical image processing approach to segment drusen with the ultimate goal of characterizing the AMD progression in a data set of longitudinal images. The method characterizes retinal structures with a statistical model of the colors in the retina image. When comparing the segmentation results of the method between longitudinal images with known AMD progression and those without, the method detects progression in our longitudinal data set with an area under the receiver operating characteristics curve of 0.99.

  3. Cervigram image segmentation based on reconstructive sparse representations

    NASA Astrophysics Data System (ADS)

    Zhang, Shaoting; Huang, Junzhou; Wang, Wei; Huang, Xiaolei; Metaxas, Dimitris

    2010-03-01

    We proposed an approach based on reconstructive sparse representations to segment tissues in optical images of the uterine cervix. Because of large variations in image appearance caused by the changing of the illumination and specular reflection, the color and texture features in optical images often overlap with each other and are not linearly separable. By leveraging sparse representations the data can be transformed to higher dimensions with sparse constraints and become more separated. K-SVD algorithm is employed to find sparse representations and corresponding dictionaries. The data can be reconstructed from its sparse representations and positive and/or negative dictionaries. Classification can be achieved based on comparing the reconstructive errors. In the experiments we applied our method to automatically segment the biomarker AcetoWhite (AW) regions in an archive of 60,000 images of the uterine cervix. Compared with other general methods, our approach showed lower space and time complexity and higher sensitivity.

  4. Segmentation of mosaicism in cervicographic images using support vector machines

    NASA Astrophysics Data System (ADS)

    Xue, Zhiyun; Long, L. Rodney; Antani, Sameer; Jeronimo, Jose; Thoma, George R.

    2009-02-01

    The National Library of Medicine (NLM), in collaboration with the National Cancer Institute (NCI), is creating a large digital repository of cervicographic images for the study of uterine cervix cancer prevention. One of the research goals is to automatically detect diagnostic bio-markers in these images. Reliable bio-marker segmentation in large biomedical image collections is a challenging task due to the large variation in image appearance. Methods described in this paper focus on segmenting mosaicism, which is an important vascular feature used to visually assess the degree of cervical intraepithelial neoplasia. The proposed approach uses support vector machines (SVM) trained on a ground truth dataset annotated by medical experts (which circumvents the need for vascular structure extraction). We have evaluated the performance of the proposed algorithm and experimentally demonstrated its feasibility.

  5. Automatic tissue segmentation of breast biopsies imaged by QPI

    NASA Astrophysics Data System (ADS)

    Majeed, Hassaan; Nguyen, Tan; Kandel, Mikhail; Marcias, Virgilia; Do, Minh; Tangella, Krishnarao; Balla, Andre; Popescu, Gabriel

    2016-03-01

    The current tissue evaluation method for breast cancer would greatly benefit from higher throughput and less inter-observer variation. Since quantitative phase imaging (QPI) measures physical parameters of tissue, it can be used to find quantitative markers, eliminating observer subjectivity. Furthermore, since the pixel values in QPI remain the same regardless of the instrument used, classifiers can be built to segment various tissue components without need for color calibration. In this work we use a texton-based approach to segment QPI images of breast tissue into various tissue components (epithelium, stroma or lumen). A tissue microarray comprising of 900 unstained cores from 400 different patients was imaged using Spatial Light Interference Microscopy. The training data were generated by manually segmenting the images for 36 cores and labelling each pixel (epithelium, stroma or lumen.). For each pixel in the data, a response vector was generated by the Leung-Malik (LM) filter bank and these responses were clustered using the k-means algorithm to find the centers (called textons). A random forest classifier was then trained to find the relationship between a pixel's label and the histogram of these textons in that pixel's neighborhood. The segmentation was carried out on the validation set by calculating the texton histogram in a pixel's neighborhood and generating a label based on the model learnt during training. Segmentation of the tissue into various components is an important step toward efficiently computing parameters that are markers of disease. Automated segmentation, followed by diagnosis, can improve the accuracy and speed of analysis leading to better health outcomes.

  6. A geometric deformable model for echocardiographic image segmentation

    NASA Technical Reports Server (NTRS)

    Hang, X.; Greenberg, N. L.; Thomas, J. D.

    2002-01-01

    Gradient vector flow (GVF), an elegant external force for parametric deformable models, can capture object boundaries from both sides. A new geometric deformable model is proposed that combines GVF and the geodesic active contour model. The level set method is used as the numerical method of this model. The model is applied for echocardiographic image segmentation.

  7. Liver segmentation for CT images using GVF snake

    SciTech Connect

    Liu Fan; Zhao Binsheng; Kijewski, Peter K.; Wang Liang; Schwartz, Lawrence H.

    2005-12-15

    Accurate liver segmentation on computed tomography (CT) images is a challenging task especially at sites where surrounding tissues (e.g., stomach, kidney) have densities similar to that of the liver and lesions reside at the liver edges. We have developed a method for semiautomatic delineation of the liver contours on contrast-enhanced CT images. The method utilizes a snake algorithm with a gradient vector flow (GVF) field as its external force. To improve the performance of the GVF snake in the segmentation of the liver contour, an edge map was obtained with a Canny edge detector, followed by modifications using a liver template and a concavity removal algorithm. With the modified edge map, for which unwanted edges inside the liver were eliminated, the GVF field was computed and an initial liver contour was formed. The snake algorithm was then applied to obtain the actual liver contour. This algorithm was extended to segment the liver volume in a slice-by-slice fashion, where the result of the preceding slice constrained the segmentation of the adjacent slice. 551 two-dimensional liver images from 20 volumetric images with colorectal metastases spreading throughout the livers were delineated using this method, and also manually by a radiologist for evaluation. The difference ratio, which is defined as the percentage ratio of mismatching volume between the computer and the radiologist's results, ranged from 2.9% to 7.6% with a median value of 5.3%.

  8. Registration, segmentation, and visualization of multimodal brain images.

    PubMed

    Viergever, M A; Maintz, J B; Niessen, W J; Noordmans, H J; Pluim, J P; Stokking, R; Vincken, K L

    2001-01-01

    This paper gives an overview of the studies performed at our institute over the last decade on the processing and visualization of brain images, in the context of international developments in the field. The focus is on multimodal image registration and multimodal visualization, while segmentation is touched upon as a preprocessing step for visualization. The state-of-the-art in these areas is discussed and suggestions for future research are given. PMID:11137791

  9. Community detection for fluorescent lifetime microscopy image segmentation

    NASA Astrophysics Data System (ADS)

    Hu, Dandan; Sarder, Pinaki; Ronhovde, Peter; Achilefu, Samuel; Nussinov, Zohar

    2014-03-01

    Multiresolution community detection (CD) method has been suggested in a recent work as an efficient method for performing unsupervised segmentation of fluorescence lifetime (FLT) images of live cell images containing fluorescent molecular probes.1 In the current paper, we further explore this method in FLT images of ex vivo tissue slices. The image processing problem is framed as identifying clusters with respective average FLTs against a background or "solvent" in FLT imaging microscopy (FLIM) images derived using NIR fluorescent dyes. We have identified significant multiresolution structures using replica correlations in these images, where such correlations are manifested by information theoretic overlaps of the independent solutions ("replicas") attained using the multiresolution CD method from different starting points. In this paper, our method is found to be more efficient than a current state-of-the-art image segmentation method based on mixture of Gaussian distributions. It offers more than 1:25 times diversity based on Shannon index than the latter method, in selecting clusters with distinct average FLTs in NIR FLIM images.

  10. Segmentation of prostate boundaries from ultrasound images using statistical shape model.

    PubMed

    Shen, Dinggang; Zhan, Yiqiang; Davatzikos, Christos

    2003-04-01

    This paper presents a statistical shape model for the automatic prostate segmentation in transrectal ultrasound images. A Gabor filter bank is first used to characterize the prostate boundaries in ultrasound images in both multiple scales and multiple orientations. The Gabor features are further reconstructed to be invariant to the rotation of the ultrasound probe and incorporated in the prostate model as image attributes for guiding the deformable segmentation. A hierarchical deformation strategy is then employed, in which the model adaptively focuses on the similarity of different Gabor features at different deformation stages using a multiresolution technique, i.e., coarse features first and fine features later. A number of successful experiments validate the algorithm.

  11. Automatic 3D lesion segmentation on breast ultrasound images

    NASA Astrophysics Data System (ADS)

    Kuo, Hsien-Chi; Giger, Maryellen L.; Reiser, Ingrid; Drukker, Karen; Edwards, Alexandra; Sennett, Charlene A.

    2013-02-01

    Automatically acquired and reconstructed 3D breast ultrasound images allow radiologists to detect and evaluate breast lesions in 3D. However, assessing potential cancers in 3D ultrasound can be difficult and time consuming. In this study, we evaluate a 3D lesion segmentation method, which we had previously developed for breast CT, and investigate its robustness on lesions on 3D breast ultrasound images. Our dataset includes 98 3D breast ultrasound images obtained on an ABUS system from 55 patients containing 64 cancers. Cancers depicted on 54 US images had been clinically interpreted as negative on screening mammography and 44 had been clinically visible on mammography. All were from women with breast density BI-RADS 3 or 4. Tumor centers and margins were indicated and outlined by radiologists. Initial RGI-eroded contours were automatically calculated and served as input to the active contour segmentation algorithm yielding the final lesion contour. Tumor segmentation was evaluated by determining the overlap ratio (OR) between computer-determined and manually-drawn outlines. Resulting average overlap ratios on coronal, transverse, and sagittal views were 0.60 +/- 0.17, 0.57 +/- 0.18, and 0.58 +/- 0.17, respectively. All OR values were significantly higher the 0.4, which is deemed "acceptable". Within the groups of mammogram-negative and mammogram-positive cancers, the overlap ratios were 0.63 +/- 0.17 and 0.56 +/- 0.16, respectively, on the coronal views; with similar results on the other views. The segmentation performance was not found to be correlated to tumor size. Results indicate robustness of the 3D lesion segmentation technique in multi-modality 3D breast imaging.

  12. Automated Drusen Segmentation and Quantification in SD-OCT Images

    PubMed Central

    Chen, Qiang; Leng, Theodore; Zheng, Luoluo; Kutzscher, Lauren; Ma, Jeffrey; de Sisternes, Luis; Rubin, Daniel L.

    2013-01-01

    Spectral domain optical coherence tomography (SD-OCT) is a useful tool for the visualization of drusen, a retinal abnormality seen in patients with age-related macular degeneration (AMD); however, objective assessment of drusen is thwarted by the lack of a method to robustly quantify these lesions on serial OCT images. Here, we describe an automatic drusen segmentation method for SD-OCT retinal images, which leverages a priori knowledge of normal retinal morphology and anatomical features. The highly reflective and locally connected pixels located below the retinal nerve fiber layer (RNFL) are used to generate a segmentation of the retinal pigment epithelium (RPE) layer. The observed and expected contours of the RPE layer are obtained by interpolating and fitting the shape of the segmented RPE layer, respectively. The areas located between the interpolated and fitted RPE shapes (which have nonzero area when drusen occurs) are marked as drusen. To enhance drusen quantification, we also developed a novel method of retinal projection to generate an en face retinal image based on the RPE extraction, which improves the quality of drusen visualization over the current approach to producing retinal projections from SD-OCT images based on a summed-voxel projection (SVP), and it provides a means of obtaining quantitative features of drusen in the en face projection. Visualization of the segmented drusen is refined through several post-processing steps, drusen detection to eliminate false positive detections on consecutive slices, drusen refinement on a projection view of drusen, and drusen smoothing. Experimental evaluation results demonstrate that our method is effective for drusen segmentation. In a preliminary analysis of the potential clinical utility of our methods, quantitative drusen measurements, such as area and volume, can be correlated with the drusen progression in non-exudative AMD, suggesting that our approach may produce useful quantitative imaging biomarkers

  13. Deep convolutional networks for pancreas segmentation in CT imaging

    NASA Astrophysics Data System (ADS)

    Roth, Holger R.; Farag, Amal; Lu, Le; Turkbey, Evrim B.; Summers, Ronald M.

    2015-03-01

    Automatic organ segmentation is an important prerequisite for many computer-aided diagnosis systems. The high anatomical variability of organs in the abdomen, such as the pancreas, prevents many segmentation methods from achieving high accuracies when compared to state-of-the-art segmentation of organs like the liver, heart or kidneys. Recently, the availability of large annotated training sets and the accessibility of affordable parallel computing resources via GPUs have made it feasible for "deep learning" methods such as convolutional networks (ConvNets) to succeed in image classification tasks. These methods have the advantage that used classification features are trained directly from the imaging data. We present a fully-automated bottom-up method for pancreas segmentation in computed tomography (CT) images of the abdomen. The method is based on hierarchical coarse-to-fine classification of local image regions (superpixels). Superpixels are extracted from the abdominal region using Simple Linear Iterative Clustering (SLIC). An initial probability response map is generated, using patch-level confidences and a two-level cascade of random forest classifiers, from which superpixel regions with probabilities larger 0.5 are retained. These retained superpixels serve as a highly sensitive initial input of the pancreas and its surroundings to a ConvNet that samples a bounding box around each superpixel at different scales (and random non-rigid deformations at training time) in order to assign a more distinct probability of each superpixel region being pancreas or not. We evaluate our method on CT images of 82 patients (60 for training, 2 for validation, and 20 for testing). Using ConvNets we achieve maximum Dice scores of an average 68% +/- 10% (range, 43-80%) in testing. This shows promise for accurate pancreas segmentation, using a deep learning approach and compares favorably to state-of-the-art methods.

  14. From Acoustic Segmentation to Language Processing: Evidence from Optical Imaging

    PubMed Central

    Obrig, Hellmuth; Rossi, Sonja; Telkemeyer, Silke; Wartenburger, Isabell

    2010-01-01

    During language acquisition in infancy and when learning a foreign language, the segmentation of the auditory stream into words and phrases is a complex process. Intuitively, learners use “anchors” to segment the acoustic speech stream into meaningful units like words and phrases. Regularities on a segmental (e.g., phonological) or suprasegmental (e.g., prosodic) level can provide such anchors. Regarding the neuronal processing of these two kinds of linguistic cues a left-hemispheric dominance for segmental and a right-hemispheric bias for suprasegmental information has been reported in adults. Though lateralization is common in a number of higher cognitive functions, its prominence in language may also be a key to understanding the rapid emergence of the language network in infants and the ease at which we master our language in adulthood. One question here is whether the hemispheric lateralization is driven by linguistic input per se or whether non-linguistic, especially acoustic factors, “guide” the lateralization process. Methodologically, functional magnetic resonance imaging provides unsurpassed anatomical detail for such an enquiry. However, instrumental noise, experimental constraints and interference with EEG assessment limit its applicability, pointedly in infants and also when investigating the link between auditory and linguistic processing. Optical methods have the potential to fill this gap. Here we review a number of recent studies using optical imaging to investigate hemispheric differences during segmentation and basic auditory feature analysis in language development. PMID:20725516

  15. From acoustic segmentation to language processing: evidence from optical imaging.

    PubMed

    Obrig, Hellmuth; Rossi, Sonja; Telkemeyer, Silke; Wartenburger, Isabell

    2010-01-01

    During language acquisition in infancy and when learning a foreign language, the segmentation of the auditory stream into words and phrases is a complex process. Intuitively, learners use "anchors" to segment the acoustic speech stream into meaningful units like words and phrases. Regularities on a segmental (e.g., phonological) or suprasegmental (e.g., prosodic) level can provide such anchors. Regarding the neuronal processing of these two kinds of linguistic cues a left-hemispheric dominance for segmental and a right-hemispheric bias for suprasegmental information has been reported in adults. Though lateralization is common in a number of higher cognitive functions, its prominence in language may also be a key to understanding the rapid emergence of the language network in infants and the ease at which we master our language in adulthood. One question here is whether the hemispheric lateralization is driven by linguistic input per se or whether non-linguistic, especially acoustic factors, "guide" the lateralization process. Methodologically, functional magnetic resonance imaging provides unsurpassed anatomical detail for such an enquiry. However, instrumental noise, experimental constraints and interference with EEG assessment limit its applicability, pointedly in infants and also when investigating the link between auditory and linguistic processing. Optical methods have the potential to fill this gap. Here we review a number of recent studies using optical imaging to investigate hemispheric differences during segmentation and basic auditory feature analysis in language development.

  16. A general approach to liver lesion segmentation in CT images

    NASA Astrophysics Data System (ADS)

    Cao, Li; Udupa, Jayaram K.; Odhner, Dewey; Huang, Lidong; Tong, Yubing; Torigian, Drew A.

    2016-03-01

    Lesion segmentation has remained a challenge in different body regions. Generalizability is lacking in published methods as variability in results is common, even for a given organ and modality, such that it becomes difficult to establish standardized methods of disease quantification and reporting. This paper makes an attempt at a generalizable method based on classifying lesions along with their background into groups using clinically used visual attributes. Using an Iterative Relative Fuzzy Connectedness (IRFC) delineation engine, the ideas are implemented for the task of liver lesion segmentation in computed tomography (CT) images. For lesion groups with the same background properties, a few subjects are chosen as the training set to obtain the optimal IRFC parameters for the background tissue components. For lesion groups with similar foreground properties, optimal foreground parameters for IRFC are set as the median intensity value of the training lesion subset. To segment liver lesions belonging to a certain group, the devised method requires manual loading of the corresponding parameters, and correct setting of the foreground and background seeds. The segmentation is then completed in seconds. Segmentation accuracy and repeatability with respect to seed specification are evaluated. Accuracy is assessed by the assignment of a delineation quality score (DQS) to each case. Inter-operator repeatability is assessed by the difference between segmentations carried out independently by two operators. Experiments on 80 liver lesion cases show that the proposed method achieves a mean DQS score of 4.03 and inter-operator repeatability of 92.3%.

  17. Patch-based image segmentation of satellite imagery using minimum spanning tree construction

    SciTech Connect

    Skurikhin, Alexei N

    2010-01-01

    We present a method for hierarchical image segmentation and feature extraction. This method builds upon the combination of the detection of image spectral discontinuities using Canny edge detection and the image Laplacian, followed by the construction of a hierarchy of segmented images of successively reduced levels of details. These images are represented as sets of polygonized pixel patches (polygons) attributed with spectral and structural characteristics. This hierarchy forms the basis for object-oriented image analysis. To build fine level-of-detail representation of the original image, seed partitions (polygons) are built upon a triangular mesh composed of irregular sized triangles, whose spatial arrangement is adapted to the image content. This is achieved by building the triangular mesh on the top of the detected spectral discontinuities that form a network of constraints for the Delaunay triangulation. A polygonized image is represented as a spatial network in the form of a graph with vertices which correspond to the polygonal partitions and graph edges reflecting pairwise partitions relations. Image graph partitioning is based on the iterative graph oontraction using Boruvka's Minimum Spanning Tree algorithm. An important characteristic of the approach is that the agglomeration of partitions is constrained by the detected spectral discontinuities; thus the shapes of agglomerated partitions are more likely to correspond to the outlines of real-world objects.

  18. Automated 3D renal segmentation based on image partitioning

    NASA Astrophysics Data System (ADS)

    Yeghiazaryan, Varduhi; Voiculescu, Irina D.

    2016-03-01

    Despite several decades of research into segmentation techniques, automated medical image segmentation is barely usable in a clinical context, and still at vast user time expense. This paper illustrates unsupervised organ segmentation through the use of a novel automated labelling approximation algorithm followed by a hypersurface front propagation method. The approximation stage relies on a pre-computed image partition forest obtained directly from CT scan data. We have implemented all procedures to operate directly on 3D volumes, rather than slice-by-slice, because our algorithms are dimensionality-independent. The results picture segmentations which identify kidneys, but can easily be extrapolated to other body parts. Quantitative analysis of our automated segmentation compared against hand-segmented gold standards indicates an average Dice similarity coefficient of 90%. Results were obtained over volumes of CT data with 9 kidneys, computing both volume-based similarity measures (such as the Dice and Jaccard coefficients, true positive volume fraction) and size-based measures (such as the relative volume difference). The analysis considered both healthy and diseased kidneys, although extreme pathological cases were excluded from the overall count. Such cases are difficult to segment both manually and automatically due to the large amplitude of Hounsfield unit distribution in the scan, and the wide spread of the tumorous tissue inside the abdomen. In the case of kidneys that have maintained their shape, the similarity range lies around the values obtained for inter-operator variability. Whilst the procedure is fully automated, our tools also provide a light level of manual editing.

  19. Adaptive segmentation of nuclei in H&S stained tendon microscopy

    NASA Astrophysics Data System (ADS)

    Chuang, Bo-I.; Wu, Po-Ting; Hsu, Jian-Han; Jou, I.-Ming; Su, Fong-Chin; Sun, Yung-Nien

    2015-12-01

    Tendiopathy is a popular clinical issue in recent years. In most cases like trigger finger or tennis elbow, the pathology change can be observed under H and E stained tendon microscopy. However, the qualitative analysis is too subjective and thus the results heavily depend on the observers. We develop an automatic segmentation procedure which segments and counts the nuclei in H and E stained tendon microscopy fast and precisely. This procedure first determines the complexity of images and then segments the nuclei from the image. For the complex images, the proposed method adopts sampling-based thresholding to segment the nuclei. While for the simple images, the Laplacian-based thresholding is employed to re-segment the nuclei more accurately. In the experiments, the proposed method is compared with the experts outlined results. The nuclei number of proposed method is closed to the experts counted, and the processing time of proposed method is much faster than the experts'.

  20. Automatic segmentation of lung parenchyma based on curvature of ribs using HRCT images in scleroderma studies

    NASA Astrophysics Data System (ADS)

    Prasad, M. N.; Brown, M. S.; Ahmad, S.; Abtin, F.; Allen, J.; da Costa, I.; Kim, H. J.; McNitt-Gray, M. F.; Goldin, J. G.

    2008-03-01

    Segmentation of lungs in the setting of scleroderma is a major challenge in medical image analysis. Threshold based techniques tend to leave out lung regions that have increased attenuation, for example in the presence of interstitial lung disease or in noisy low dose CT scans. The purpose of this work is to perform segmentation of the lungs using a technique that selects an optimal threshold for a given scleroderma patient by comparing the curvature of the lung boundary to that of the ribs. Our approach is based on adaptive thresholding and it tries to exploit the fact that the curvature of the ribs and the curvature of the lung boundary are closely matched. At first, the ribs are segmented and a polynomial is used to represent the ribs' curvature. A threshold value to segment the lungs is selected iteratively such that the deviation of the lung boundary from the polynomial is minimized. A Naive Bayes classifier is used to build the model for selection of the best fitting lung boundary. The performance of the new technique was compared against a standard approach using a simple fixed threshold of -400HU followed by regiongrowing. The two techniques were evaluated against manual reference segmentations using a volumetric overlap fraction (VOF) and the adaptive threshold technique was found to be significantly better than the fixed threshold technique.

  1. Superpixel Cut for Figure-Ground Image Segmentation

    NASA Astrophysics Data System (ADS)

    Yang, Michael Ying; Rosenhahn, Bodo

    2016-06-01

    Figure-ground image segmentation has been a challenging problem in computer vision. Apart from the difficulties in establishing an effective framework to divide the image pixels into meaningful groups, the notions of figure and ground often need to be properly defined by providing either user inputs or object models. In this paper, we propose a novel graph-based segmentation framework, called superpixel cut. The key idea is to formulate foreground segmentation as finding a subset of superpixels that partitions a graph over superpixels. The problem is formulated as Min-Cut. Therefore, we propose a novel cost function that simultaneously minimizes the inter-class similarity while maximizing the intra-class similarity. This cost function is optimized using parametric programming. After a small learning step, our approach is fully automatic and fully bottom-up, which requires no high-level knowledge such as shape priors and scene content. It recovers coherent components of images, providing a set of multiscale hypotheses for high-level reasoning. We evaluate our proposed framework by comparing it to other generic figure-ground segmentation approaches. Our method achieves improved performance on state-of-the-art benchmark databases.

  2. Segmentation of intensity inhomogeneous brain MR images using active contours.

    PubMed

    Akram, Farhan; Kim, Jeong Heon; Lim, Han Ul; Choi, Kwang Nam

    2014-01-01

    Segmentation of intensity inhomogeneous regions is a well-known problem in image analysis applications. This paper presents a region-based active contour method for image segmentation, which properly works in the context of intensity inhomogeneity problem. The proposed region-based active contour method embeds both region and gradient information unlike traditional methods. It contains mainly two terms, area and length, in which the area term practices a new region-based signed pressure force (SPF) function, which utilizes mean values from a certain neighborhood using the local binary fitted (LBF) energy model. In turn, the length term uses gradient information. The novelty of our method is to locally compute new SPF function, which uses local mean values and is able to detect boundaries of the homogenous regions. Finally, a truncated Gaussian kernel is used to regularize the level set function, which not only regularizes it but also removes the need of computationally expensive reinitialization. The proposed method targets the segmentation problem of intensity inhomogeneous images and reduces the time complexity among locally computed active contour methods. The experimental results show that the proposed method yields better segmentation result as well as less time complexity compared with the state-of-the-art active contour methods. PMID:25143780

  3. Unsupervised segmentation of MRI knees using image partition forests

    NASA Astrophysics Data System (ADS)

    Marčan, Marija; Voiculescu, Irina

    2016-03-01

    Nowadays many people are affected by arthritis, a condition of the joints with limited prevention measures, but with various options of treatment the most radical of which is surgical. In order for surgery to be successful, it can make use of careful analysis of patient-based models generated from medical images, usually by manual segmentation. In this work we show how to automate the segmentation of a crucial and complex joint -- the knee. To achieve this goal we rely on our novel way of representing a 3D voxel volume as a hierarchical structure of partitions which we have named Image Partition Forest (IPF). The IPF contains several partition layers of increasing coarseness, with partitions nested across layers in the form of adjacency graphs. On the basis of a set of properties (size, mean intensity, coordinates) of each node in the IPF we classify nodes into different features. Values indicating whether or not any particular node belongs to the femur or tibia are assigned through node filtering and node-based region growing. So far we have evaluated our method on 15 MRI knee images. Our unsupervised segmentation compared against a hand-segmented gold standard has achieved an average Dice similarity coefficient of 0.95 for femur and 0.93 for tibia, and an average symmetric surface distance of 0.98 mm for femur and 0.73 mm for tibia. The paper also discusses ways to introduce stricter morphological and spatial conditioning in the bone labelling process.

  4. The Multimodal Brain Tumor Image Segmentation Benchmark (BRATS)

    PubMed Central

    Jakab, Andras; Bauer, Stefan; Kalpathy-Cramer, Jayashree; Farahani, Keyvan; Kirby, Justin; Burren, Yuliya; Porz, Nicole; Slotboom, Johannes; Wiest, Roland; Lanczi, Levente; Gerstner, Elizabeth; Weber, Marc-André; Arbel, Tal; Avants, Brian B.; Ayache, Nicholas; Buendia, Patricia; Collins, D. Louis; Cordier, Nicolas; Corso, Jason J.; Criminisi, Antonio; Das, Tilak; Delingette, Hervé; Demiralp, Çağatay; Durst, Christopher R.; Dojat, Michel; Doyle, Senan; Festa, Joana; Forbes, Florence; Geremia, Ezequiel; Glocker, Ben; Golland, Polina; Guo, Xiaotao; Hamamci, Andac; Iftekharuddin, Khan M.; Jena, Raj; John, Nigel M.; Konukoglu, Ender; Lashkari, Danial; Mariz, José António; Meier, Raphael; Pereira, Sérgio; Precup, Doina; Price, Stephen J.; Raviv, Tammy Riklin; Reza, Syed M. S.; Ryan, Michael; Sarikaya, Duygu; Schwartz, Lawrence; Shin, Hoo-Chang; Shotton, Jamie; Silva, Carlos A.; Sousa, Nuno; Subbanna, Nagesh K.; Szekely, Gabor; Taylor, Thomas J.; Thomas, Owen M.; Tustison, Nicholas J.; Unal, Gozde; Vasseur, Flor; Wintermark, Max; Ye, Dong Hye; Zhao, Liang; Zhao, Binsheng; Zikic, Darko; Prastawa, Marcel; Reyes, Mauricio; Van Leemput, Koen

    2016-01-01

    In this paper we report the set-up and results of the Multimodal Brain Tumor Image Segmentation Benchmark (BRATS) organized in conjunction with the MICCAI 2012 and 2013 conferences. Twenty state-of-the-art tumor segmentation algorithms were applied to a set of 65 multi-contrast MR scans of low- and high-grade glioma patients—manually annotated by up to four raters—and to 65 comparable scans generated using tumor image simulation software. Quantitative evaluations revealed considerable disagreement between the human raters in segmenting various tumor sub-regions (Dice scores in the range 74%–85%), illustrating the difficulty of this task. We found that different algorithms worked best for different sub-regions (reaching performance comparable to human inter-rater variability), but that no single algorithm ranked in the top for all sub-regions simultaneously. Fusing several good algorithms using a hierarchical majority vote yielded segmentations that consistently ranked above all individual algorithms, indicating remaining opportunities for further methodological improvements. The BRATS image data and manual annotations continue to be publicly available through an online evaluation system as an ongoing benchmarking resource. PMID:25494501

  5. The Multimodal Brain Tumor Image Segmentation Benchmark (BRATS).

    PubMed

    Menze, Bjoern H; Jakab, Andras; Bauer, Stefan; Kalpathy-Cramer, Jayashree; Farahani, Keyvan; Kirby, Justin; Burren, Yuliya; Porz, Nicole; Slotboom, Johannes; Wiest, Roland; Lanczi, Levente; Gerstner, Elizabeth; Weber, Marc-André; Arbel, Tal; Avants, Brian B; Ayache, Nicholas; Buendia, Patricia; Collins, D Louis; Cordier, Nicolas; Corso, Jason J; Criminisi, Antonio; Das, Tilak; Delingette, Hervé; Demiralp, Çağatay; Durst, Christopher R; Dojat, Michel; Doyle, Senan; Festa, Joana; Forbes, Florence; Geremia, Ezequiel; Glocker, Ben; Golland, Polina; Guo, Xiaotao; Hamamci, Andac; Iftekharuddin, Khan M; Jena, Raj; John, Nigel M; Konukoglu, Ender; Lashkari, Danial; Mariz, José Antonió; Meier, Raphael; Pereira, Sérgio; Precup, Doina; Price, Stephen J; Raviv, Tammy Riklin; Reza, Syed M S; Ryan, Michael; Sarikaya, Duygu; Schwartz, Lawrence; Shin, Hoo-Chang; Shotton, Jamie; Silva, Carlos A; Sousa, Nuno; Subbanna, Nagesh K; Szekely, Gabor; Taylor, Thomas J; Thomas, Owen M; Tustison, Nicholas J; Unal, Gozde; Vasseur, Flor; Wintermark, Max; Ye, Dong Hye; Zhao, Liang; Zhao, Binsheng; Zikic, Darko; Prastawa, Marcel; Reyes, Mauricio; Van Leemput, Koen

    2015-10-01

    In this paper we report the set-up and results of the Multimodal Brain Tumor Image Segmentation Benchmark (BRATS) organized in conjunction with the MICCAI 2012 and 2013 conferences. Twenty state-of-the-art tumor segmentation algorithms were applied to a set of 65 multi-contrast MR scans of low- and high-grade glioma patients-manually annotated by up to four raters-and to 65 comparable scans generated using tumor image simulation software. Quantitative evaluations revealed considerable disagreement between the human raters in segmenting various tumor sub-regions (Dice scores in the range 74%-85%), illustrating the difficulty of this task. We found that different algorithms worked best for different sub-regions (reaching performance comparable to human inter-rater variability), but that no single algorithm ranked in the top for all sub-regions simultaneously. Fusing several good algorithms using a hierarchical majority vote yielded segmentations that consistently ranked above all individual algorithms, indicating remaining opportunities for further methodological improvements. The BRATS image data and manual annotations continue to be publicly available through an online evaluation system as an ongoing benchmarking resource.

  6. Cryo-EM Structure Determination Using Segmented Helical Image Reconstruction.

    PubMed

    Fromm, S A; Sachse, C

    2016-01-01

    Treating helices as single-particle-like segments followed by helical image reconstruction has become the method of choice for high-resolution structure determination of well-ordered helical viruses as well as flexible filaments. In this review, we will illustrate how the combination of latest hardware developments with optimized image processing routines have led to a series of near-atomic resolution structures of helical assemblies. Originally, the treatment of helices as a sequence of segments followed by Fourier-Bessel reconstruction revealed the potential to determine near-atomic resolution structures from helical specimens. In the meantime, real-space image processing of helices in a stack of single particles was developed and enabled the structure determination of specimens that resisted classical Fourier helical reconstruction and also facilitated high-resolution structure determination. Despite the progress in real-space analysis, the combination of Fourier and real-space processing is still commonly used to better estimate the symmetry parameters as the imposition of the correct helical symmetry is essential for high-resolution structure determination. Recent hardware advancement by the introduction of direct electron detectors has significantly enhanced the image quality and together with improved image processing procedures has made segmented helical reconstruction a very productive cryo-EM structure determination method.

  7. Object Segmentation and Ground Truth in 3D Embryonic Imaging.

    PubMed

    Rajasekaran, Bhavna; Uriu, Koichiro; Valentin, Guillaume; Tinevez, Jean-Yves; Oates, Andrew C

    2016-01-01

    Many questions in developmental biology depend on measuring the position and movement of individual cells within developing embryos. Yet, tools that provide this data are often challenged by high cell density and their accuracy is difficult to measure. Here, we present a three-step procedure to address this problem. Step one is a novel segmentation algorithm based on image derivatives that, in combination with selective post-processing, reliably and automatically segments cell nuclei from images of densely packed tissue. Step two is a quantitative validation using synthetic images to ascertain the efficiency of the algorithm with respect to signal-to-noise ratio and object density. Finally, we propose an original method to generate reliable and experimentally faithful ground truth datasets: Sparse-dense dual-labeled embryo chimeras are used to unambiguously measure segmentation errors within experimental data. Together, the three steps outlined here establish a robust, iterative procedure to fine-tune image analysis algorithms and microscopy settings associated with embryonic 3D image data sets. PMID:27332860

  8. Object Segmentation and Ground Truth in 3D Embryonic Imaging

    PubMed Central

    Rajasekaran, Bhavna; Uriu, Koichiro; Valentin, Guillaume; Tinevez, Jean-Yves; Oates, Andrew C.

    2016-01-01

    Many questions in developmental biology depend on measuring the position and movement of individual cells within developing embryos. Yet, tools that provide this data are often challenged by high cell density and their accuracy is difficult to measure. Here, we present a three-step procedure to address this problem. Step one is a novel segmentation algorithm based on image derivatives that, in combination with selective post-processing, reliably and automatically segments cell nuclei from images of densely packed tissue. Step two is a quantitative validation using synthetic images to ascertain the efficiency of the algorithm with respect to signal-to-noise ratio and object density. Finally, we propose an original method to generate reliable and experimentally faithful ground truth datasets: Sparse-dense dual-labeled embryo chimeras are used to unambiguously measure segmentation errors within experimental data. Together, the three steps outlined here establish a robust, iterative procedure to fine-tune image analysis algorithms and microscopy settings associated with embryonic 3D image data sets. PMID:27332860

  9. Cryo-EM Structure Determination Using Segmented Helical Image Reconstruction.

    PubMed

    Fromm, S A; Sachse, C

    2016-01-01

    Treating helices as single-particle-like segments followed by helical image reconstruction has become the method of choice for high-resolution structure determination of well-ordered helical viruses as well as flexible filaments. In this review, we will illustrate how the combination of latest hardware developments with optimized image processing routines have led to a series of near-atomic resolution structures of helical assemblies. Originally, the treatment of helices as a sequence of segments followed by Fourier-Bessel reconstruction revealed the potential to determine near-atomic resolution structures from helical specimens. In the meantime, real-space image processing of helices in a stack of single particles was developed and enabled the structure determination of specimens that resisted classical Fourier helical reconstruction and also facilitated high-resolution structure determination. Despite the progress in real-space analysis, the combination of Fourier and real-space processing is still commonly used to better estimate the symmetry parameters as the imposition of the correct helical symmetry is essential for high-resolution structure determination. Recent hardware advancement by the introduction of direct electron detectors has significantly enhanced the image quality and together with improved image processing procedures has made segmented helical reconstruction a very productive cryo-EM structure determination method. PMID:27572732

  10. Segmentation of ultrasound breast images based on a neutrosophic method

    NASA Astrophysics Data System (ADS)

    Zhang, Ming; Zhang, Ling; Cheng, Heng-Da

    2010-11-01

    Breast cancer is one of the leading cancers of women. Ultrasound is often used for breast cancer diagnosis because it is harmless, portable, and low-cost. However, the segmentation of breast ultrasound (BUS) images is a difficult task due to their low contrast and speckle noise. Neutrosophy studies the origin, nature, and scope of neutralities and their interactions with different ideational spectra. It is a new philosophy to extend fuzzy logic and is the basis of neutrosophic logic, neutrosophic probability theory, neutrosophic set theory, and neutrosophic statistics. In this paper, we employ neutrosophy and develop a fully automatic algorithm for BUS image segmentation. By using neutrosophy, we integrate two conflicting opinions about speckle in ultrasound image: speckle is noise and speckle includes pattern information. The experiments demonstrate that the proposed approach is accurate, effective, and robust.

  11. Minimum description length synthetic aperture radar image segmentation.

    PubMed

    Galland, Frédéric; Bertaux, Nicolas; Réfrégier, Philippe

    2003-01-01

    We present a new minimum description length (MDL) approach based on a deformable partition--a polygonal grid--for automatic segmentation of a speckled image composed of several homogeneous regions. The image segmentation thus consists in the estimation of the polygonal grid, or, more precisely, its number of regions, its number of nodes and the location of its nodes. These estimations are performed by minimizing a unique MDL criterion which takes into account the probabilistic properties of speckle fluctuations and a measure of the stochastic complexity of the polygonal grid. This approach then leads to a global MDL criterion without an undetermined parameter since no other regularization term than the stochastic complexity of the polygonal grid is necessary and noise parameters can be estimated with maximum likelihood-like approaches. The performance of this technique is illustrated on synthetic and real synthetic aperture radar images of agricultural regions and the influence of different terms of the model is analyzed.

  12. A Split-and-Merge-Based Uterine Fibroid Ultrasound Image Segmentation Method in HIFU Therapy.

    PubMed

    Xu, Menglong; Zhang, Dong; Yang, Yan; Liu, Yu; Yuan, Zhiyong; Qin, Qianqing

    2015-01-01

    High-intensity focused ultrasound (HIFU) therapy has been used to treat uterine fibroids widely and successfully. Uterine fibroid segmentation plays an important role in positioning the target region for HIFU therapy. Presently, it is completed by physicians manually, reducing the efficiency of therapy. Thus, computer-aided segmentation of uterine fibroids benefits the improvement of therapy efficiency. Recently, most computer-aided ultrasound segmentation methods have been based on the framework of contour evolution, such as snakes and level sets. These methods can achieve good performance, although they need an initial contour that influences segmentation results. It is difficult to obtain the initial contour automatically; thus, the initial contour is always obtained manually in many segmentation methods. A split-and-merge-based uterine fibroid segmentation method, which needs no initial contour to ensure less manual intervention, is proposed in this paper. The method first splits the image into many small homogeneous regions called superpixels. A new feature representation method based on texture histogram is employed to characterize each superpixel. Next, the superpixels are merged according to their similarities, which are measured by integrating their Quadratic-Chi texture histogram distances with their space adjacency. Multi-way Ncut is used as the merging criterion, and an adaptive scheme is incorporated to decrease manual intervention further. The method is implemented using Matlab on a personal computer (PC) platform with Intel Pentium Dual-Core CPU E5700. The method is validated on forty-two ultrasound images acquired from HIFU therapy. The average running time is 9.54 s. Statistical results showed that SI reaches a value as high as 87.58%, and normHD is 5.18% on average. It has been demonstrated that the proposed method is appropriate for segmentation of uterine fibroids in HIFU pre-treatment imaging and planning. PMID:25973906

  13. Image enhancement and segmentation of fluid-filled structures in 3D ultrasound images

    NASA Astrophysics Data System (ADS)

    Chalana, Vikram; Dudycha, Stephen; McMorrow, Gerald

    2003-05-01

    Segmentation of fluid-filled structures, such as the urinary bladder, from three-dimensional ultrasound images is necessary for measuring their volume. This paper describes a system for image enhancement, segmentation and volume measurement of fluid-filled structures on 3D ultrasound images. The system was applied for the measurement of urinary bladder volume. Results show an average error of less than 10% in the estimation of the total bladder volume.

  14. Survey of contemporary trends in color image segmentation

    NASA Astrophysics Data System (ADS)

    Vantaram, Sreenath Rao; Saber, Eli

    2012-10-01

    In recent years, the acquisition of image and video information for processing, analysis, understanding, and exploitation of the underlying content in various applications, ranging from remote sensing to biomedical imaging, has grown at an unprecedented rate. Analysis by human observers is quite laborious, tiresome, and time consuming, if not infeasible, given the large and continuously rising volume of data. Hence the need for systems capable of automatically and effectively analyzing the aforementioned imagery for a variety of uses that span the spectrum from homeland security to elderly care. In order to achieve the above, tools such as image segmentation provide the appropriate foundation for expediting and improving the effectiveness of subsequent high-level tasks by providing a condensed and pertinent representation of image information. We provide a comprehensive survey of color image segmentation strategies adopted over the last decade, though notable contributions in the gray scale domain will also be discussed. Our taxonomy of segmentation techniques is sampled from a wide spectrum of spatially blind (or feature-based) approaches such as clustering and histogram thresholding as well as spatially guided (or spatial domain-based) methods such as region growing/splitting/merging, energy-driven parametric/geometric active contours, supervised/unsupervised graph cuts, and watersheds, to name a few. In addition, qualitative and quantitative results of prominent algorithms on several images from the Berkeley segmentation dataset are shown in order to furnish a fair indication of the current quality of the state of the art. Finally, we provide a brief discussion on our current perspective of the field as well as its associated future trends.

  15. Solid oxide fuel cell anode image segmentation based on a novel quantum-inspired fuzzy clustering

    NASA Astrophysics Data System (ADS)

    Fu, Xiaowei; Xiang, Yuhan; Chen, Li; Xu, Xin; Li, Xi

    2015-12-01

    High quality microstructure modeling can optimize the design of fuel cells. For three-phase accurate identification of Solid Oxide Fuel Cell (SOFC) microstructure, this paper proposes a novel image segmentation method on YSZ/Ni anode Optical Microscopic (OM) images. According to Quantum Signal Processing (QSP), the proposed approach exploits a quantum-inspired adaptive fuzziness factor to adaptively estimate the energy function in the fuzzy system based on Markov Random Filed (MRF). Before defuzzification, a quantum-inspired probability distribution based on distance and gray correction is proposed, which can adaptively adjust the inaccurate probability estimation of uncertain points caused by noises and edge points. In this study, the proposed method improves accuracy and effectiveness of three-phase identification on the micro-investigation. It provides firm foundation to investigate the microstructural evolution and its related properties.

  16. An image segmentation method for apple sorting and grading using support vector machine and Otsu's method

    Technology Transfer Automated Retrieval System (TEKTRAN)

    Segmentation is the first step in image analysis to subdivide an image into meaningful regions. The segmentation result directly affects the subsequent image analysis. The objective of the research was to develop an automatic adjustable algorithm for segmentation of color images, using linear suppor...

  17. Control of multiple excited image states around segmented carbon nanotubes

    SciTech Connect

    Knörzer, J. Fey, C.; Sadeghpour, H. R.; Schmelcher, P.

    2015-11-28

    Electronic image states around segmented carbon nanotubes can be confined and shaped along the nanotube axis by engineering the image potential. We show how several such image states can be prepared simultaneously along the same nanotube. The inter-electronic distance can be controlled a priori by engineering tubes of specific geometries. High sensitivity to external electric and magnetic fields can be exploited to manipulate these states and their mutual long-range interactions. These building blocks provide access to a new kind of tailored interacting quantum systems.

  18. Colour image segmentation using unsupervised clustering technique for acute leukemia images

    NASA Astrophysics Data System (ADS)

    Halim, N. H. Abd; Mashor, M. Y.; Nasir, A. S. Abdul; Mustafa, N.; Hassan, R.

    2015-05-01

    Colour image segmentation has becoming more popular for computer vision due to its important process in most medical analysis tasks. This paper proposes comparison between different colour components of RGB(red, green, blue) and HSI (hue, saturation, intensity) colour models that will be used in order to segment the acute leukemia images. First, partial contrast stretching is applied on leukemia images to increase the visual aspect of the blast cells. Then, an unsupervised moving k-means clustering algorithm is applied on the various colour components of RGB and HSI colour models for the purpose of segmentation of blast cells from the red blood cells and background regions in leukemia image. Different colour components of RGB and HSI colour models have been analyzed in order to identify the colour component that can give the good segmentation performance. The segmented images are then processed using median filter and region growing technique to reduce noise and smooth the images. The results show that segmentation using saturation component of HSI colour model has proven to be the best in segmenting nucleus of the blast cells in acute leukemia image as compared to the other colour components of RGB and HSI colour models.

  19. An image processing pipeline to detect and segment nuclei in muscle fiber microscopic images.

    PubMed

    Guo, Yanen; Xu, Xiaoyin; Wang, Yuanyuan; Wang, Yaming; Xia, Shunren; Yang, Zhong

    2014-08-01

    Muscle fiber images play an important role in the medical diagnosis and treatment of many muscular diseases. The number of nuclei in skeletal muscle fiber images is a key bio-marker of the diagnosis of muscular dystrophy. In nuclei segmentation one primary challenge is to correctly separate the clustered nuclei. In this article, we developed an image processing pipeline to automatically detect, segment, and analyze nuclei in microscopic image of muscle fibers. The pipeline consists of image pre-processing, identification of isolated nuclei, identification and segmentation of clustered nuclei, and quantitative analysis. Nuclei are initially extracted from background by using local Otsu's threshold. Based on analysis of morphological features of the isolated nuclei, including their areas, compactness, and major axis lengths, a Bayesian network is trained and applied to identify isolated nuclei from clustered nuclei and artifacts in all the images. Then a two-step refined watershed algorithm is applied to segment clustered nuclei. After segmentation, the nuclei can be quantified for statistical analysis. Comparing the segmented results with those of manual analysis and an existing technique, we find that our proposed image processing pipeline achieves good performance with high accuracy and precision. The presented image processing pipeline can therefore help biologists increase their throughput and objectivity in analyzing large numbers of nuclei in muscle fiber images.

  20. A region-appearance-based adaptive variational model for 3D liver segmentation

    SciTech Connect

    Peng, Jialin; Dong, Fangfang; Chen, Yunmei; Kong, Dexing

    2014-04-15

    Purpose: Liver segmentation from computed tomography images is a challenging task owing to pixel intensity overlapping, ambiguous edges, and complex backgrounds. The authors address this problem with a novel active surface scheme, which minimizes an energy functional combining both edge- and region-based information. Methods: In this semiautomatic method, the evolving surface is principally attracted to strong edges but is facilitated by the region-based information where edge information is missing. As avoiding oversegmentation is the primary challenge, the authors take into account multiple features and appearance context information. Discriminative cues, such as multilayer consecutiveness and local organ deformation are also implicitly incorporated. Case-specific intensity and appearance constraints are included to cope with the typically large appearance variations over multiple images. Spatially adaptive balancing weights are employed to handle the nonuniformity of image features. Results: Comparisons and validations on difficult cases showed that the authors’ model can effectively discriminate the liver from adhering background tissues. Boundaries weak in gradient or with no local evidence (e.g., small edge gaps or parts with similar intensity to the background) were delineated without additional user constraint. With an average surface distance of 0.9 mm and an average volume overlap of 93.9% on the MICCAI data set, the authors’ model outperformed most state-of-the-art methods. Validations on eight volumes with different initial conditions had segmentation score variances mostly less than unity. Conclusions: The proposed model can efficiently delineate ambiguous liver edges from complex tissue backgrounds with reproducibility. Quantitative validations and comparative results demonstrate the accuracy and efficacy of the model.

  1. Fingerprint image segmentation based on multi-features histogram analysis

    NASA Astrophysics Data System (ADS)

    Wang, Peng; Zhang, Youguang

    2007-11-01

    An effective fingerprint image segmentation based on multi-features histogram analysis is presented. We extract a new feature, together with three other features to segment fingerprints. Two of these four features, each of which is related to one of the other two, are reciprocals with each other, so features are divided into two groups. These two features' histograms are calculated respectively to determine which feature group is introduced to segment the aim-fingerprint. The features could also divide fingerprints into two classes with high and low quality. Experimental results show that our algorithm could classify foreground and background effectively with lower computational cost, and it can also reduce pseudo-minutiae detected and improve the performance of AFIS.

  2. An efficient MRF embedded level set method for image segmentation.

    PubMed

    Yang, Xi; Gao, Xinbo; Tao, Dacheng; Li, Xuelong; Li, Jie

    2015-01-01

    This paper presents a fast and robust level set method for image segmentation. To enhance the robustness against noise, we embed a Markov random field (MRF) energy function to the conventional level set energy function. This MRF energy function builds the correlation of a pixel with its neighbors and encourages them to fall into the same region. To obtain a fast implementation of the MRF embedded level set model, we explore algebraic multigrid (AMG) and sparse field method (SFM) to increase the time step and decrease the computation domain, respectively. Both AMG and SFM can be conducted in a parallel fashion, which facilitates the processing of our method for big image databases. By comparing the proposed fast and robust level set method with the standard level set method and its popular variants on noisy synthetic images, synthetic aperture radar (SAR) images, medical images, and natural images, we comprehensively demonstrate the new method is robust against various kinds of noises. In particular, the new level set method can segment an image of size 500 × 500 within 3 s on MATLAB R2010b installed in a computer with 3.30-GHz CPU and 4-GB memory.

  3. Adaptive SVD-Based Digital Image Watermarking

    NASA Astrophysics Data System (ADS)

    Shirvanian, Maliheh; Torkamani Azar, Farah

    Digital data utilization along with the increase popularity of the Internet has facilitated information sharing and distribution. However, such applications have also raised concern about copyright issues and unauthorized modification and distribution of digital data. Digital watermarking techniques which are proposed to solve these problems hide some information in digital media and extract it whenever needed to indicate the data owner. In this paper a new method of image watermarking based on singular value decomposition (SVD) of images is proposed which considers human visual system prior to embedding watermark by segmenting the original image into several blocks of different sizes, with more density in the edges of the image. In this way the original image quality is preserved in the watermarked image. Additional advantages of the proposed technique are large capacity of watermark embedding and robustness of the method against different types of image manipulation techniques.

  4. Joint graph cut and relative fuzzy connectedness image segmentation algorithm.

    PubMed

    Ciesielski, Krzysztof Chris; Miranda, Paulo A V; Falcão, Alexandre X; Udupa, Jayaram K

    2013-12-01

    We introduce an image segmentation algorithm, called GC(sum)(max), which combines, in novel manner, the strengths of two popular algorithms: Relative Fuzzy Connectedness (RFC) and (standard) Graph Cut (GC). We show, both theoretically and experimentally, that GC(sum)(max) preserves robustness of RFC with respect to the seed choice (thus, avoiding "shrinking problem" of GC), while keeping GC's stronger control over the problem of "leaking though poorly defined boundary segments." The analysis of GC(sum)(max) is greatly facilitated by our recent theoretical results that RFC can be described within the framework of Generalized GC (GGC) segmentation algorithms. In our implementation of GC(sum)(max) we use, as a subroutine, a version of RFC algorithm (based on Image Forest Transform) that runs (provably) in linear time with respect to the image size. This results in GC(sum)(max) running in a time close to linear. Experimental comparison of GC(sum)(max) to GC, an iterative version of RFC (IRFC), and power watershed (PW), based on a variety medical and non-medical images, indicates superior accuracy performance of GC(sum)(max) over these other methods, resulting in a rank ordering of GC(sum)(max)>PW∼IRFC>GC.

  5. Automated segmentation of the melanocytes in skin histopathological images.

    PubMed

    Lu, Cheng; Mahmood, Muhammad; Jha, Naresh; Mandal, Mrinal

    2013-03-01

    In the diagnosis of skin melanoma by analyzing histopathological images, the detection of the melanocytes in the epidermis area is an important step. However, the detection of melanocytes in the epidermis area is dicult because other keratinocytes that are very similar to the melanocytes are also present. This paper proposes a novel computer-aided technique for segmentation of the melanocytes in the skin histopathological images. In order to reduce the local intensity variant, a mean-shift algorithm is applied for the initial segmentation of the image. A local region recursive segmentation algorithm is then proposed to filter out the candidate nuclei regions based on the domain prior knowledge. To distinguish the melanocytes from other keratinocytes in the epidermis area, a novel descriptor, named local double ellipse descriptor (LDED), is proposed to measure the local features of the candidate regions. The LDED uses two parameters: region ellipticity and local pattern characteristics to distinguish the melanocytes from the candidate nuclei regions. Experimental results on 28 dierent histopathological images of skin tissue with dierent zooming factors show that the proposed technique provides a superior performance.

  6. Crowdsourcing the creation of image segmentation algorithms for connectomics.

    PubMed

    Arganda-Carreras, Ignacio; Turaga, Srinivas C; Berger, Daniel R; Cireşan, Dan; Giusti, Alessandro; Gambardella, Luca M; Schmidhuber, Jürgen; Laptev, Dmitry; Dwivedi, Sarvesh; Buhmann, Joachim M; Liu, Ting; Seyedhosseini, Mojtaba; Tasdizen, Tolga; Kamentsky, Lee; Burget, Radim; Uher, Vaclav; Tan, Xiao; Sun, Changming; Pham, Tuan D; Bas, Erhan; Uzunbas, Mustafa G; Cardona, Albert; Schindelin, Johannes; Seung, H Sebastian

    2015-01-01

    To stimulate progress in automating the reconstruction of neural circuits, we organized the first international challenge on 2D segmentation of electron microscopic (EM) images of the brain. Participants submitted boundary maps predicted for a test set of images, and were scored based on their agreement with a consensus of human expert annotations. The winning team had no prior experience with EM images, and employed a convolutional network. This "deep learning" approach has since become accepted as a standard for segmentation of EM images. The challenge has continued to accept submissions, and the best so far has resulted from cooperation between two teams. The challenge has probably saturated, as algorithms cannot progress beyond limits set by ambiguities inherent in 2D scoring and the size of the test dataset. Retrospective evaluation of the challenge scoring system reveals that it was not sufficiently robust to variations in the widths of neurite borders. We propose a solution to this problem, which should be useful for a future 3D segmentation challenge. PMID:26594156

  7. Cerebral magnetic resonance image segmentation using data fusion

    SciTech Connect

    Rajapakse, J.C.; Giedd, J.N.; Krain, A.L.; Hamburger, S.D.; Rapoport, J.L.; DeCarli, C.

    1996-03-01

    A semiautomated method is described for segmenting dual echo MR head scans into gray and white matter and CSF. The method is applied to brain scans of 80 healthy children and adolescents. A probabilistic data fusion equation was used to combine simultaneously acquired T2-weighted and proton density head scans for tissue segmentation. The fusion equation optimizes the probability of a voxel being a particular tissue type, given the corresponding probabilities from both images. The algorithm accounts for the intensity inhomogeneities present in the images by fusion of local regions of the images. The method was validated using a phantom (agarose gel with iron oxide particles) and hand-segmented imager. Gray and white matter volumes for subjects aged 20-30 years were close to those previously published. White matter and CSF volume increased and gray matter volume decreased significantly across ages 4-18 years. White matter, gray matter, and CSF volumes were larger for males than for females. Males and females showed similar change of gray and white matter volumes with age. This simple, reliable, and valid method can be employed in clinical research for quantification of gray and white matter and CSF volumes in MR head scans. Increase in white matter volume may reflect ongoing axonal growth and myelination, and gray matter reductions may reflect synaptic pruning or cell death in the age span of 4-18 years. 41 refs., 5 figs., 3 tabs.

  8. Crowdsourcing the creation of image segmentation algorithms for connectomics

    PubMed Central

    Arganda-Carreras, Ignacio; Turaga, Srinivas C.; Berger, Daniel R.; Cireşan, Dan; Giusti, Alessandro; Gambardella, Luca M.; Schmidhuber, Jürgen; Laptev, Dmitry; Dwivedi, Sarvesh; Buhmann, Joachim M.; Liu, Ting; Seyedhosseini, Mojtaba; Tasdizen, Tolga; Kamentsky, Lee; Burget, Radim; Uher, Vaclav; Tan, Xiao; Sun, Changming; Pham, Tuan D.; Bas, Erhan; Uzunbas, Mustafa G.; Cardona, Albert; Schindelin, Johannes; Seung, H. Sebastian

    2015-01-01

    To stimulate progress in automating the reconstruction of neural circuits, we organized the first international challenge on 2D segmentation of electron microscopic (EM) images of the brain. Participants submitted boundary maps predicted for a test set of images, and were scored based on their agreement with a consensus of human expert annotations. The winning team had no prior experience with EM images, and employed a convolutional network. This “deep learning” approach has since become accepted as a standard for segmentation of EM images. The challenge has continued to accept submissions, and the best so far has resulted from cooperation between two teams. The challenge has probably saturated, as algorithms cannot progress beyond limits set by ambiguities inherent in 2D scoring and the size of the test dataset. Retrospective evaluation of the challenge scoring system reveals that it was not sufficiently robust to variations in the widths of neurite borders. We propose a solution to this problem, which should be useful for a future 3D segmentation challenge. PMID:26594156

  9. GPU-based relative fuzzy connectedness image segmentation

    SciTech Connect

    Zhuge Ying; Ciesielski, Krzysztof C.; Udupa, Jayaram K.; Miller, Robert W.

    2013-01-15

    Purpose:Recently, clinical radiological research and practice are becoming increasingly quantitative. Further, images continue to increase in size and volume. For quantitative radiology to become practical, it is crucial that image segmentation algorithms and their implementations are rapid and yield practical run time on very large data sets. The purpose of this paper is to present a parallel version of an algorithm that belongs to the family of fuzzy connectedness (FC) algorithms, to achieve an interactive speed for segmenting large medical image data sets. Methods: The most common FC segmentations, optimizing an Script-Small-L {sub {infinity}}-based energy, are known as relative fuzzy connectedness (RFC) and iterative relative fuzzy connectedness (IRFC). Both RFC and IRFC objects (of which IRFC contains RFC) can be found via linear time algorithms, linear with respect to the image size. The new algorithm, P-ORFC (for parallel optimal RFC), which is implemented by using NVIDIA's Compute Unified Device Architecture (CUDA) platform, considerably improves the computational speed of the above mentioned CPU based IRFC algorithm. Results: Experiments based on four data sets of small, medium, large, and super data size, achieved speedup factors of 32.8 Multiplication-Sign , 22.9 Multiplication-Sign , 20.9 Multiplication-Sign , and 17.5 Multiplication-Sign , correspondingly, on the NVIDIA Tesla C1060 platform. Although the output of P-ORFC need not precisely match that of IRFC output, it is very close to it and, as the authors prove, always lies between the RFC and IRFC objects. Conclusions: A parallel version of a top-of-the-line algorithm in the family of FC has been developed on the NVIDIA GPUs. An interactive speed of segmentation has been achieved, even for the largest medical image data set. Such GPU implementations may play a crucial role in automatic anatomy recognition in clinical radiology.

  10. Segmentation and visualization of anatomical structures from volumetric medical images

    NASA Astrophysics Data System (ADS)

    Park, Jonghyun; Park, Soonyoung; Cho, Wanhyun; Kim, Sunworl; Kim, Gisoo; Ahn, Gukdong; Lee, Myungeun; Lim, Junsik

    2011-03-01

    This paper presents a method that can extract and visualize anatomical structures from volumetric medical images by using a 3D level set segmentation method and a hybrid volume rendering technique. First, the segmentation using the level set method was conducted through a surface evolution framework based on the geometric variation principle. This approach addresses the topological changes in the deformable surface by using the geometric integral measures and level set theory. These integral measures contain a robust alignment term, an active region term, and a mean curvature term. By using the level set method with a new hybrid speed function derived from the geometric integral measures, the accurate deformable surface can be extracted from a volumetric medical data set. Second, we employed a hybrid volume rendering approach to visualize the extracted deformable structures. Our method combines indirect and direct volume rendering techniques. Segmented objects within the data set are rendered locally by surface rendering on an object-by-object basis. Globally, all the results of subsequent object rendering are obtained by direct volume rendering (DVR). Then the two rendered results are finally combined in a merging step. This is especially useful when inner structures should be visualized together with semi-transparent outer parts. This merging step is similar to the focus-plus-context approach known from information visualization. Finally, we verified the accuracy and robustness of the proposed segmentation method for various medical volume images. The volume rendering results of segmented 3D objects show that our proposed method can accurately extract and visualize human organs from various multimodality medical volume images.

  11. Image segmentation for integrated multiphoton microscopy and reflectance confocal microscopy imaging of human skin in vivo

    PubMed Central

    Chen, Guannan; Lui, Harvey

    2015-01-01

    Background Non-invasive cellular imaging of the skin in vivo can be achieved in reflectance confocal microscopy (RCM) and multiphoton microscopy (MPM) modalities to yield complementary images of the skin based on different optical properties. One of the challenges of in vivo microscopy is the delineation (i.e., segmentation) of cellular and subcellular architectural features. Methods In this work we present a method for combining watershed and level-set models for segmentation of multimodality images obtained by an integrated MPM and RCM imaging system from human skin in vivo. Results Firstly, a segmentation model based on watershed is introduced for obtaining the accurate structure of cell borders from the RCM image. Secondly,, a global region based energy level-set model is constructed for extracting the nucleus of each cell from the MPM image. Thirdly, a local region-based Lagrange Continuous level-set approach is used for segmenting cytoplasm from the MPM image. Conclusions Experimental results demonstrated that cell borders from RCM image and boundaries of cytoplasm and nucleus from MPM image can be obtained by our segmentation method with better accuracy and effectiveness. We are planning to use this method to perform quantitative analysis of MPM and RCM images of in vivo human skin to study the variations of cellular parameters such as cell size, nucleus size and other mophormetric features with skin pathologies. PMID:25694949

  12. Hyperspectral image segmentation using spatial-spectral graphs

    NASA Astrophysics Data System (ADS)

    Gillis, David B.; Bowles, Jeffrey H.

    2012-06-01

    Spectral graph theory has proven to be a useful tool in the analysis of high-dimensional data sets. Recall that, mathematically, a graph is a collection of objects (nodes) and connections between them (edges); a weighted graph additionally assigns numerical values (weights) to the edges. Graphs are represented by their adjacency whose elements are the weights between the nodes. Spectral graph theory uses the eigendecomposition of the adjacency matrix (or, more generally, the Laplacian of the graph) to derive information about the underlying graph. In this paper, we develop a spectral method based on the 'normalized cuts' algorithm to segment hyperspectral image data (HSI). In particular, we model an image as a weighted graph whose nodes are the image pixels, and edges defined as connecting spatial neighbors; the edge weights are given by a weighted combination of the spatial and spectral distances between nodes. We then use the Laplacian of the graph to recursively segment the image. The advantages of our approach are that, first, the graph structure naturally incorporates both the spatial and spectral information present in HSI; also, by using only spatial neighbors, the adjacency matrix is highly sparse; as a result, it is possible to apply our technique to much larger images than previous techniques. In the paper, we present the details of our algorithm, and include experimental results from a variety of hyperspectral images.

  13. Segmentation and classification of cell cycle phases in fluorescence imaging.

    PubMed

    Ersoy, Ilker; Bunyak, Filiz; Chagin, Vadim; Cardoso, M Christina; Palaniappan, Kannappan

    2009-01-01

    Current chemical biology methods for studying spatiotemporal correlation between biochemical networks and cell cycle phase progression in live-cells typically use fluorescence-based imaging of fusion proteins. Stable cell lines expressing fluorescently tagged protein GFP-PCNA produce rich, dynamically varying sub-cellular foci patterns characterizing the cell cycle phases, including the progress during the S-phase. Variable fluorescence patterns, drastic changes in SNR, shape and position changes and abundance of touching cells require sophisticated algorithms for reliable automatic segmentation and cell cycle classification. We extend the recently proposed graph partitioning active contours (GPAC) for fluorescence-based nucleus segmentation using regional density functions and dramatically improve its efficiency, making it scalable for high content microscopy imaging. We utilize surface shape properties of GFP-PCNA intensity field to obtain descriptors of foci patterns and perform automated cell cycle phase classification, and give quantitative performance by comparing our results to manually labeled data.

  14. Introduction to project ALIAS: adaptive-learning image analysis system

    NASA Astrophysics Data System (ADS)

    Bock, Peter

    1992-03-01

    As an alternative to preprogrammed rule-based artificial intelligence, collective learning systems theory postulates a hierarchical network of cellular automata which acquire their knowledge through learning based on a series of trial-and-error interactions with an evaluating environment, much as humans do. The input to the hierarchical network is provided by a set of sensors which perceive the external world. Using both this perceived information and past experience (memory), the learning automata synthesize collections of trial responses, periodically modifying their memories based on internal evaluations or external evaluations from the environment. Based on collective learning systems theory, an adaptive transputer- based image-processing engine comprising a three-layer hierarchical network of 32 learning cells and 33 nonlearning cells has been applied to a difficult image processing task: the scale, phase, and translation-invariant detection of anomalous features in otherwise `normal' images. Known as adaptive learning image analysis system (ALIAS), this parallel-processing engine has been constructed and tested at the Research institute for Applied Knowledge Processing (FAW) in Ulm, Germany under the sponsorship of Robert Bosch GmbH. Results demonstrate excellent detection, discrimination, and localization of anomalies in binary images. Recent enhancements include the ability to process gray-scale images and the automatic supervised segmentation and classification of images. Current research is directed toward the processing of time-series data and the hierarchical extension of ALIAS from the sub-symbolic level to the higher levels of symbolic association.

  15. Adaptive predictive image coding using local characteristics

    NASA Astrophysics Data System (ADS)

    Hsieh, C. H.; Lu, P. C.; Liou, W. G.

    1989-12-01

    The paper presents an efficient adaptive predictive coding method using the local characteristics of images. In this method, three coding schemes, namely, mean, subsampling combined with fixed DPCM, and ADPCM/PCM, are used and one of these is chosen adaptively based on the local characteristics of images. The prediction parameters of the two-dimensional linear predictor in the ADPCM/PCM are extracted on a block by block basis. Simulation results show that the proposed method is effective in reducing the slope overload distortion and the granular noise at low bit rates, and thus it can improve the visual quality of reconstructed images.

  16. Multi-atlas segmentation of biomedical images: A survey.

    PubMed

    Iglesias, Juan Eugenio; Sabuncu, Mert R

    2015-08-01

    Multi-atlas segmentation (MAS), first introduced and popularized by the pioneering work of Rohlfing, et al. (2004), Klein, et al. (2005), and Heckemann, et al. (2006), is becoming one of the most widely-used and successful image segmentation techniques in biomedical applications. By manipulating and utilizing the entire dataset of "atlases" (training images that have been previously labeled, e.g., manually by an expert), rather than some model-based average representation, MAS has the flexibility to better capture anatomical variation, thus offering superior segmentation accuracy. This benefit, however, typically comes at a high computational cost. Recent advancements in computer hardware and image processing software have been instrumental in addressing this challenge and facilitated the wide adoption of MAS. Today, MAS has come a long way and the approach includes a wide array of sophisticated algorithms that employ ideas from machine learning, probabilistic modeling, optimization, and computer vision, among other fields. This paper presents a survey of published MAS algorithms and studies that have applied these methods to various biomedical problems. In writing this survey, we have three distinct aims. Our primary goal is to document how MAS was originally conceived, later evolved, and now relates to alternative methods. Second, this paper is intended to be a detailed reference of past research activity in MAS, which now spans over a decade (2003-2014) and entails novel methodological developments and application-specific solutions. Finally, our goal is to also present a perspective on the future of MAS, which, we believe, will be one of the dominant approaches in biomedical image segmentation. PMID:26201875

  17. Multi-Atlas Segmentation of Biomedical Images: A Survey

    PubMed Central

    Iglesias, Juan Eugenio; Sabuncu, Mert R.

    2015-01-01

    Multi-atlas segmentation (MAS), first introduced and popularized by the pioneering work of Rohlfing, Brandt, Menzel and Maurer Jr (2004), Klein, Mensh, Ghosh, Tourville and Hirsch (2005), and Heckemann, Hajnal, Aljabar, Rueckert and Hammers (2006), is becoming one of the most widely-used and successful image segmentation techniques in biomedical applications. By manipulating and utilizing the entire dataset of “atlases” (training images that have been previously labeled, e.g., manually by an expert), rather than some model-based average representation, MAS has the flexibility to better capture anatomical variation, thus offering superior segmentation accuracy. This benefit, however, typically comes at a high computational cost. Recent advancements in computer hardware and image processing software have been instrumental in addressing this challenge and facilitated the wide adoption of MAS. Today, MAS has come a long way and the approach includes a wide array of sophisticated algorithms that employ ideas from machine learning, probabilistic modeling, optimization, and computer vision, among other fields. This paper presents a survey of published MAS algorithms and studies that have applied these methods to various biomedical problems. In writing this survey, we have three distinct aims. Our primary goal is to document how MAS was originally conceived, later evolved, and now relates to alternative methods. Second, this paper is intended to be a detailed reference of past research activity in MAS, which now spans over a decade (2003 – 2014) and entails novel methodological developments and application-specific solutions. Finally, our goal is to also present a perspective on the future of MAS, which, we believe, will be one of the dominant approaches in biomedical image segmentation. PMID:26201875

  18. Deformable M-Reps for 3D Medical Image Segmentation

    PubMed Central

    Pizer, Stephen M.; Fletcher, P. Thomas; Joshi, Sarang; Thall, Andrew; Chen, James Z.; Fridman, Yonatan; Fritsch, Daniel S.; Gash, Graham; Glotzer, John M.; Jiroutek, Michael R.; Lu, Conglin; Muller, Keith E.; Tracton, Gregg; Yushkevich, Paul; Chaney, Edward L.

    2013-01-01

    M-reps (formerly called DSLs) are a multiscale medial means for modeling and rendering 3D solid geometry. They are particularly well suited to model anatomic objects and in particular to capture prior geometric information effectively in deformable models segmentation approaches. The representation is based on figural models, which define objects at coarse scale by a hierarchy of figures – each figure generally a slab representing a solid region and its boundary simultaneously. This paper focuses on the use of single figure models to segment objects of relatively simple structure. A single figure is a sheet of medial atoms, which is interpolated from the model formed by a net, i.e., a mesh or chain, of medial atoms (hence the name m-reps), each atom modeling a solid region via not only a position and a width but also a local figural frame giving figural directions and an object angle between opposing, corresponding positions on the boundary implied by the m-rep. The special capability of an m-rep is to provide spatial and orientational correspondence between an object in two different states of deformation. This ability is central to effective measurement of both geometric typicality and geometry to image match, the two terms of the objective function optimized in segmentation by deformable models. The other ability of m-reps central to effective segmentation is their ability to support segmentation at multiple levels of scale, with successively finer precision. Objects modeled by single figures are segmented first by a similarity transform augmented by object elongation, then by adjustment of each medial atom, and finally by displacing a dense sampling of the m-rep implied boundary. While these models and approaches also exist in 2D, we focus on 3D objects. The segmentation of the kidney from CT and the hippocampus from MRI serve as the major examples in this paper. The accuracy of segmentation as compared to manual, slice-by-slice segmentation is reported. PMID

  19. Segmentation of magnetic resonance image using fractal dimension

    NASA Astrophysics Data System (ADS)

    Yau, Joseph K. K.; Wong, Sau-hoi; Chan, Kwok-Leung

    1997-04-01

    In recent years, much research has been conducted in the three-dimensional visualization of medical image. This requires a good segmentation technique. Many early works use first-order and second-order statistics. First-order statistical parameters can be calculated quickly but their effectiveness is influenced by many factors such as illumination, contrast and random noise of the image. Second-order statistical parameters, such as spatial gray level co-occurrence matrices statistics, take longer time to compute but can extract the textural information. In this investigating, two different parameters, namely the entropy and the fractal dimension, are employed to perform segmentation of the magnetic resonance images of the head of a male cadaver. The entropy is calculated from the spatial gray level co-occurrence matrices. The fractal dimension is calculated by the reticular cell counting method. Several regions of the human head are chosen for analysis. They are the bone, gyrus and lobe. Results show that the parameters are able to segment different types of tissue. The entropy gives very good result but it requires very long computation time and large amount of memory. The performance of the fractal dimension is comparable with the entropy. It is simple to estimate and demands lesser memory space.

  20. Nucleus segmentation in histology images with hierarchical multilevel thresholding

    NASA Astrophysics Data System (ADS)

    Ahmady Phoulady, Hady; Goldgof, Dmitry B.; Hall, Lawrence O.; Mouton, Peter R.

    2016-03-01

    Automatic segmentation of histological images is an important step for increasing throughput while maintaining high accuracy, avoiding variation from subjective bias, and reducing the costs for diagnosing human illnesses such as cancer and Alzheimer's disease. In this paper, we present a novel method for unsupervised segmentation of cell nuclei in stained histology tissue. Following an initial preprocessing step involving color deconvolution and image reconstruction, the segmentation step consists of multilevel thresholding and a series of morphological operations. The only parameter required for the method is the minimum region size, which is set according to the resolution of the image. Hence, the proposed method requires no training sets or parameter learning. Because the algorithm requires no assumptions or a priori information with regard to cell morphology, the automatic approach is generalizable across a wide range of tissues. Evaluation across a dataset consisting of diverse tissues, including breast, liver, gastric mucosa and bone marrow, shows superior performance over four other recent methods on the same dataset in terms of F-measure with precision and recall of 0.929 and 0.886, respectively.

  1. A holistic image segmentation framework for cloud detection and extraction

    NASA Astrophysics Data System (ADS)

    Shen, Dan; Xu, Haotian; Blasch, Erik; Horvath, Gregory; Pham, Khanh; Zheng, Yufeng; Ling, Haibin; Chen, Genshe

    2013-05-01

    Atmospheric clouds are commonly encountered phenomena affecting visual tracking from air-borne or space-borne sensors. Generally clouds are difficult to detect and extract because they are complex in shape and interact with sunlight in a complex fashion. In this paper, we propose a clustering game theoretic image segmentation based approach to identify, extract, and patch clouds. In our framework, the first step is to decompose a given image containing clouds. The problem of image segmentation is considered as a "clustering game". Within this context, the notion of a cluster is equivalent to a classical equilibrium concept from game theory, as the game equilibrium reflects both the internal and external (e.g., two-player) cluster conditions. To obtain the evolutionary stable strategies, we explore three evolutionary dynamics: fictitious play, replicator dynamics, and infection and immunization dynamics (InImDyn). Secondly, we use the boundary and shape features to refine the cloud segments. This step can lower the false alarm rate. In the third step, we remove the detected clouds and patch the empty spots by performing background recovery. We demonstrate our cloud detection framework on a video clip provides supportive results.

  2. An automatic fractional coefficient setting method of FODPSO for hyperspectral image segmentation

    NASA Astrophysics Data System (ADS)

    Xie, Weiying; Li, Yunsong

    2015-05-01

    In this paper, an automatic fractional coefficient setting method of fractional-order Darwinian particle swarm optimization (FODPSO) is proposed for hyperspectral image segmentation. The spectrum has been already taken into consideration by integrating various types of band selection algorithms, firstly. We provide a short overview of the hyperspectral image to select an appropriate set of bands by combining supervised, semi-supervised and unsupervised band selection algorithms. Some approaches are not limited in regards to their spectral dimension, but are limited with respect to their spatial dimension owing to low spatial resolution. The addition of spatial information will be focused on improving the performance of hyperspectral image segmentation for later fusion or classification. Many researchers have advocated that a large fractional coefficient should be in the exploration state while a small fractional coefficient should be in the exploitation, which does not mean the coefficient purely decrease with time. Due to such reasons, we propose an adaptive FODPSO by setting the fractional coefficient adaptively for the application of final hyperspectral image segmentation. In fact, the paper introduces an evolutionary factor to automatically control the fractional coefficient by using a sigmoid function. Therefore, fractional coefficient with large value will benefit the global search in the exploration state. Conversely, when the fractional coefficient has a small value, the exploitation state is detected. Hence, it can avoid optimization process get trapped into the local optima. Ultimately, the experimental segmentation results prove the validity and efficiency of our proposed automatic fractional coefficient setting method of FODPSO compared with traditional PSO, DPSO and FODPSO.

  3. Kinetic modeling based probabilistic segmentation for molecular images.

    PubMed

    Saad, Ahmed; Hamarneh, Ghassan; Möller, Torsten; Smith, Ben

    2008-01-01

    We propose a semi-supervised, kinetic modeling based segmentation technique for molecular imaging applications. It is an iterative, self-learning algorithm based on uncertainty principles, designed to alleviate low signal-to-noise ratio (SNR) and partial volume effect (PVE) problems. Synthetic fluorodeoxyglucose (FDG) and simulated Raclopride dynamic positron emission tomography (dPET) brain images with excessive noise levels are used to validate our algorithm. We show, qualitatively and quantitatively, that our algorithm outperforms state-of-the-art techniques in identifying different functional regions and recovering the kinetic parameters.

  4. Automatic optic disc segmentation based on image brightness and contrast

    NASA Astrophysics Data System (ADS)

    Lu, Shijian; Liu, Jiang; Lim, Joo Hwee; Zhang, Zhuo; Tan, Ngan Meng; Wong, Wing Kee; Li, Huiqi; Wong, Tien Yin

    2010-03-01

    Untreated glaucoma leads to permanent damage of the optic nerve and resultant visual field loss, which can progress to blindness. As glaucoma often produces additional pathological cupping of the optic disc (OD), cupdisc- ratio is one measure that is widely used for glaucoma diagnosis. This paper presents an OD localization method that automatically segments the OD and so can be applied for the cup-disc-ratio based glaucoma diagnosis. The proposed OD segmentation method is based on the observations that the OD is normally much brighter and at the same time have a smoother texture characteristics compared with other regions within retinal images. Given a retinal image we first capture the ODs smooth texture characteristic by a contrast image that is constructed based on the local maximum and minimum pixel lightness within a small neighborhood window. The centre of the OD can then be determined according to the density of the candidate OD pixels that are detected by retinal image pixels of the lowest contrast. After that, an OD region is approximately determined by a pair of morphological operations and the OD boundary is finally determined by an ellipse that is fitted by the convex hull of the detected OD region. Experiments over 71 retinal images of different qualities show that the OD region overlapping reaches up to 90.37% according to the OD boundary ellipses determined by our proposed method and the one manually plotted by an ophthalmologist.

  5. Automatic segmentation of brain images: selection of region extraction methods

    NASA Astrophysics Data System (ADS)

    Gong, Leiguang; Kulikowski, Casimir A.; Mezrich, Reuben S.

    1991-07-01

    In automatically analyzing brain structures from a MR image, the choice of low level region extraction methods depends on the characteristics of both the target object and the surrounding anatomical structures in the image. The authors have experimented with local thresholding, global thresholding, and other techniques, using various types of MR images for extracting the major brian landmarks and different types of lesions. This paper describes specifically a local- binary thresholding method and a new global-multiple thresholding technique developed for MR image segmentation and analysis. The initial testing results on their segmentation performance are presented, followed by a comparative analysis of the two methods and their ability to extract different types of normal and abnormal brain structures -- the brain matter itself, tumors, regions of edema surrounding lesions, multiple sclerosis lesions, and the ventricles of the brain. The analysis and experimental results show that the global multiple thresholding techniques are more than adequate for extracting regions that correspond to the major brian structures, while local binary thresholding is helpful for more accurate delineation of small lesions such as those produced by MS, and for the precise refinement of lesion boundaries. The detection of other landmarks, such as the interhemispheric fissure, may require other techniques, such as line-fitting. These experiments have led to the formulation of a set of generic computer-based rules for selecting the appropriate segmentation packages for particular types of problems, based on which further development of an innovative knowledge- based, goal directed biomedical image analysis framework is being made. The system will carry out the selection automatically for a given specific analysis task.

  6. Computerized segmentation and measurement of chronic wound images.

    PubMed

    Ahmad Fauzi, Mohammad Faizal; Khansa, Ibrahim; Catignani, Karen; Gordillo, Gayle; Sen, Chandan K; Gurcan, Metin N

    2015-05-01

    An estimated 6.5 million patients in the United States are affected by chronic wounds, with more than US$25 billion and countless hours spent annually for all aspects of chronic wound care. There is a need for an intelligent software tool to analyze wound images, characterize wound tissue composition, measure wound size, and monitor changes in wound in between visits. Performed manually, this process is very time-consuming and subject to intra- and inter-reader variability. In this work, our objective is to develop methods to segment, measure and characterize clinically presented chronic wounds from photographic images. The first step of our method is to generate a Red-Yellow-Black-White (RYKW) probability map, which then guides the segmentation process using either optimal thresholding or region growing. The red, yellow and black probability maps are designed to handle the granulation, slough and eschar tissues, respectively; while the white probability map is to detect the white label card for measurement calibration purposes. The innovative aspects of this work include defining a four-dimensional probability map specific to wound characteristics, a computationally efficient method to segment wound images utilizing the probability map, and auto-calibration of wound measurements using the content of the image. These methods were applied to 80 wound images, captured in a clinical setting at the Ohio State University Comprehensive Wound Center, with the ground truth independently generated by the consensus of at least two clinicians. While the mean inter-reader agreement between the readers varied between 67.4% and 84.3%, the computer achieved an average accuracy of 75.1%.

  7. A new iterative triclass thresholding technique in image segmentation.

    PubMed

    Cai, Hongmin; Yang, Zhong; Cao, Xinhua; Xia, Weiming; Xu, Xiaoyin

    2014-03-01

    We present a new method in image segmentation that is based on Otsu's method but iteratively searches for subregions of the image for segmentation, instead of treating the full image as a whole region for processing. The iterative method starts with Otsu's threshold and computes the mean values of the two classes as separated by the threshold. Based on the Otsu's threshold and the two mean values, the method separates the image into three classes instead of two as the standard Otsu's method does. The first two classes are determined as the foreground and background and they will not be processed further. The third class is denoted as a to-be-determined (TBD) region that is processed at next iteration. At the succeeding iteration, Otsu's method is applied on the TBD region to calculate a new threshold and two class means and the TBD region is again separated into three classes, namely, foreground, background, and a new TBD region, which by definition is smaller than the previous TBD regions. Then, the new TBD region is processed in the similar manner. The process stops when the Otsu's thresholds calculated between two iterations is less than a preset threshold. Then, all the intermediate foreground and background regions are, respectively, combined to create the final segmentation result. Tests on synthetic and real images showed that the new iterative method can achieve better performance than the standard Otsu's method in many challenging cases, such as identifying weak objects and revealing fine structures of complex objects while the added computational cost is minimal.

  8. Placental fetal stem segmentation in a sequence of histology images

    NASA Astrophysics Data System (ADS)

    Athavale, Prashant; Vese, Luminita A.

    2012-02-01

    Recent research in perinatal pathology argues that analyzing properties of the placenta may reveal important information on how certain diseases progress. One important property is the structure of the placental fetal stems. Analysis of the fetal stems in a placenta could be useful in the study and diagnosis of some diseases like autism. To study the fetal stem structure effectively, we need to automatically and accurately track fetal stems through a sequence of digitized hematoxylin and eosin (H&E) stained histology slides. There are many problems in successfully achieving this goal. A few of the problems are: large size of images, misalignment of the consecutive H&E slides, unpredictable inaccuracies of manual tracing, very complicated texture patterns of various tissue types without clear characteristics, just to name a few. In this paper we propose a novel algorithm to achieve automatic tracing of the fetal stem in a sequence of H&E images, based on an inaccurate manual segmentation of a fetal stem in one of the images. This algorithm combines global affine registration, local non-affine registration and a novel 'dynamic' version of the active contours model without edges. We first use global affine image registration of all the images based on displacement, scaling and rotation. This gives us approximate location of the corresponding fetal stem in the image that needs to be traced. We then use the affine registration algorithm "locally" near this location. At this point, we use a fast non-affine registration based on L2-similarity measure and diffusion regularization to get a better location of the fetal stem. Finally, we have to take into account inaccuracies in the initial tracing. This is achieved through a novel dynamic version of the active contours model without edges where the coefficients of the fitting terms are computed iteratively to ensure that we obtain a unique stem in the segmentation. The segmentation thus obtained can then be used as an

  9. Scale and orientation invariant text segmentation for born-digital compound images.

    PubMed

    Yang, Huan; Wu, Shiqian; Deng, Chenwei; Lin, Weisi

    2015-03-01

    Many recent applications require text segmentation for born-digital compound images. To this end, we propose a coarse-to-fine framework for segmenting texts of arbitrary scales and orientations in born-digital compound images. In the coarse stage, the local image activity measure is designed based upon the variation distribution of characters, to highlight the difference between textual and pictorial regions. This stage outputs a coarse textual layer including textual regions as well as a few pictorial regions with high activity. In the fine stage, a textual connected component (TCC) based refinement is proposed to eliminate the survived pictorial regions. In particular, a scale and orientation invariant grouping algorithm is proposed to adaptively generate TCCs with uniform statistical features. The minimum average distance and morphological operations are employed to assist the formation of candidate TCCs. Then, three string-level features (i.e., shapeness, color similarity, and mean activity level) are designed to distinguish the true TCCs from the false positive ones that are formed by connecting the high activity pictorial components. Extensive experiments show that the proposed framework can segment textual regions precisely from born-digital compound images, while preserving the integrity of texts with varied scales and orientations, and avoiding over-connection of textual regions. PMID:24988601

  10. An adaptive approach to centerline extraction for CT colonography using MAP-EM segmentation and distance field

    NASA Astrophysics Data System (ADS)

    Peng, Hao; Li, Lihong C.; Wang, Huafeng; Han, Hao; Pickhardt, Perry J.; Liang, Zhengrong

    2014-03-01

    In this paper, we present an adaptive approach for fully automatic centerline extraction and small intestine removal based on partial volume (PV) image segmentation and distance field modeling. Computed tomographic colonography (CTC) volume image is first segmented for the colon wall mucosa layer, which represents the PV effect around the colon wall. Then centerline extraction is performed in the presence of colon collapse and small intestine touch by the use of distance field within the segmented PV mucosa layer, where centerline breakings due to collapse are recovered and centerline branches due to small intestine tough are removed. Experimental results from 24 patient CTC scans with small intestine touch rendered 100% removal of the touch, while only 16 out of the 24 could be done by the well-known isolated component method. Our voxel-by-voxel marking strategy in the automated procedure preserves the topology and validity of the colon structure. The marked inner and outer boundaries on cleansed colon are very close to those labeled by the experts. Experimental results demonstrated the robustness and efficiency of the presented adaptive approach for CTC utility.

  11. Seamless contiguity method for parallel segmentation of remote sensing image

    NASA Astrophysics Data System (ADS)

    Wang, Geng; Wang, Guanghui; Yu, Mei; Cui, Chengling

    2015-12-01

    Seamless contiguity is the key technology for parallel segmentation of remote sensing data with large quantities. It can be effectively integrate fragments of the parallel processing into reasonable results for subsequent processes. There are numerous methods reported in the literature for seamless contiguity, such as establishing buffer, area boundary merging and data sewing. et. We proposed a new method which was also based on building buffers. The seamless contiguity processes we adopt are based on the principle: ensuring the accuracy of the boundary, ensuring the correctness of topology. Firstly, block number is computed based on data processing ability, unlike establishing buffer on both sides of block line, buffer is established just on the right side and underside of the line. Each block of data is segmented respectively and then gets the segmentation objects and their label value. Secondly, choose one block(called master block) and do stitching on the adjacent blocks(called slave block), process the rest of the block in sequence. Through the above processing, topological relationship and boundaries of master block are guaranteed. Thirdly, if the master block polygons boundaries intersect with buffer boundary and the slave blocks polygons boundaries intersect with block line, we adopt certain rules to merge and trade-offs them. Fourthly, check the topology and boundary in the buffer area. Finally, a set of experiments were conducted and prove the feasibility of this method. This novel seamless contiguity algorithm provides an applicable and practical solution for efficient segmentation of massive remote sensing image.

  12. Effect of the Keck telescope`s segmented primary on the performance on the Keck adaptive optics system

    SciTech Connect

    Gavel, D.

    1997-06-01

    The 349 degree of freedom Keck adaptive optics system will be mapped on to the 36 segment Keck primary mirror. Each telescope segment is independently controlled in piston and tilt by an active control system and each segment also has its own set of aberrations. This presents a unique set of problems for the Keck adaptive optics system, not encountered with continuous primaries. To a certain extent the low order segment aberrations, beginning with focus, can be corrected statically by the adaptive optic system. However, the discontinuous surface at the segment edges present special problems in sensing and correcting wavefront with laser guide stars or natural guide stars.

  13. Adaptive optics imaging of the retina.

    PubMed

    Battu, Rajani; Dabir, Supriya; Khanna, Anjani; Kumar, Anupama Kiran; Roy, Abhijit Sinha

    2014-01-01

    Adaptive optics is a relatively new tool that is available to ophthalmologists for study of cellular level details. In addition to the axial resolution provided by the spectral-domain optical coherence tomography, adaptive optics provides an excellent lateral resolution, enabling visualization of the photoreceptors, blood vessels and details of the optic nerve head. We attempt a mini review of the current role of adaptive optics in retinal imaging. PubMed search was performed with key words Adaptive optics OR Retina OR Retinal imaging. Conference abstracts were searched from the Association for Research in Vision and Ophthalmology (ARVO) and American Academy of Ophthalmology (AAO) meetings. In total, 261 relevant publications and 389 conference abstracts were identified.

  14. Adaptive optics imaging of the retina

    PubMed Central

    Battu, Rajani; Dabir, Supriya; Khanna, Anjani; Kumar, Anupama Kiran; Roy, Abhijit Sinha

    2014-01-01

    Adaptive optics is a relatively new tool that is available to ophthalmologists for study of cellular level details. In addition to the axial resolution provided by the spectral-domain optical coherence tomography, adaptive optics provides an excellent lateral resolution, enabling visualization of the photoreceptors, blood vessels and details of the optic nerve head. We attempt a mini review of the current role of adaptive optics in retinal imaging. PubMed search was performed with key words Adaptive optics OR Retina OR Retinal imaging. Conference abstracts were searched from the Association for Research in Vision and Ophthalmology (ARVO) and American Academy of Ophthalmology (AAO) meetings. In total, 261 relevant publications and 389 conference abstracts were identified. PMID:24492503

  15. Fuzzy Markov random fields versus chains for multispectral image segmentation.

    PubMed

    Salzenstein, Fabien; Collet, Christophe

    2006-11-01

    This paper deals with a comparison of recent statistical models based on fuzzy Markov random fields and chains for multispectral image segmentation. The fuzzy scheme takes into account discrete and continuous classes which model the imprecision of the hidden data. In this framework, we assume the dependence between bands and we express the general model for the covariance matrix. A fuzzy Markov chain model is developed in an unsupervised way. This method is compared with the fuzzy Markovian field model previously proposed by one of the authors. The segmentation task is processed with Bayesian tools, such as the well-known MPM (Mode of Posterior Marginals) criterion. Our goal is to compare the robustness and rapidity for both methods (fuzzy Markov fields versus fuzzy Markov chains). Indeed, such fuzzy-based procedures seem to be a good answer, e.g., for astronomical observations when the patterns present diffuse structures. Moreover, these approaches allow us to process missing data in one or several spectral bands which correspond to specific situations in astronomy. To validate both models, we perform and compare the segmentation on synthetic images and raw multispectral astronomical data.

  16. Character segmentation and thresholding in low-contrast scene images

    NASA Astrophysics Data System (ADS)

    Winger, Lowell L.; Jernigan, M. Ed; Robinson, John A.

    1996-03-01

    We are developing a portable text-to-speech system for the vision impaired. The input image is acquired with a lightweight CCD camera that may be poorly focused and aimed, and perhaps taken under inadequate and uneven illumination. We therefore require efficient and effective thresholding and segmentation methods which are robust with respect to character contrast, font, size, and format. In this paper, we present a fast thresholding scheme which combines a local variance measure with a logical stroke-width method. An efficient post- thresholding segmentation scheme utilizing Fisher's linear discriminant to distinguish noise and character components functions as an effective pre-processing step for the application of commercial segmentation and character recognition methods. The performance of this fast new method compared favorably with other methods for the extraction of characters from uncontrolled illumination, omnifont scene images. We demonstrate the suitability of this method for use in an automated portable reader through a software implementation running on a laptop 486 computer in our prototype device.

  17. Fuzzy Markov random fields versus chains for multispectral image segmentation.

    PubMed

    Salzenstein, Fabien; Collet, Christophe

    2006-11-01

    This paper deals with a comparison of recent statistical models based on fuzzy Markov random fields and chains for multispectral image segmentation. The fuzzy scheme takes into account discrete and continuous classes which model the imprecision of the hidden data. In this framework, we assume the dependence between bands and we express the general model for the covariance matrix. A fuzzy Markov chain model is developed in an unsupervised way. This method is compared with the fuzzy Markovian field model previously proposed by one of the authors. The segmentation task is processed with Bayesian tools, such as the well-known MPM (Mode of Posterior Marginals) criterion. Our goal is to compare the robustness and rapidity for both methods (fuzzy Markov fields versus fuzzy Markov chains). Indeed, such fuzzy-based procedures seem to be a good answer, e.g., for astronomical observations when the patterns present diffuse structures. Moreover, these approaches allow us to process missing data in one or several spectral bands which correspond to specific situations in astronomy. To validate both models, we perform and compare the segmentation on synthetic images and raw multispectral astronomical data. PMID:17063681

  18. Muscle segmentation in time series images of Drosophila metamorphosis.

    PubMed

    Yadav, Kuleesha; Lin, Feng; Wasser, Martin

    2015-01-01

    In order to study genes associated with muscular disorders, we characterize the phenotypic changes in Drosophila muscle cells during metamorphosis caused by genetic perturbations. We collect in vivo images of muscle fibers during remodeling of larval to adult muscles. In this paper, we focus on the new image processing pipeline designed to quantify the changes in shape and size of muscles. We propose a new two-step approach to muscle segmentation in time series images. First, we implement a watershed algorithm to divide the image into edge-preserving regions, and then, we classify these regions into muscle and non-muscle classes on the basis of shape and intensity. The advantage of our method is two-fold: First, better results are obtained because classification of regions is constrained by the shape of muscle cell from previous time point; and secondly, minimal user intervention results in faster processing time. The segmentation results are used to compare the changes in cell size between controls and reduction of the autophagy related gene Atg 9 during Drosophila metamorphosis.

  19. Segmentation of interstitial lung disease patterns in HRCT images

    NASA Astrophysics Data System (ADS)

    Dash, Jatindra K.; Madhavi, Vaddepalli; Mukhopadhyay, Sudipta; Khandelwal, Niranjan; Kumar, Prafulla

    2015-03-01

    Automated segmentation of pathological bearing region is the first step towards the development of lung CAD. Most of the work reported in the literature related to automated analysis of lung tissue aims towards classification of fixed sized block into one of the classes. This block level classification of lung tissues in the image never results in accurate or smooth boundaries between different regions. In this work, effort is taken to investigate the performance of three automated image segmentation algorithms those results in smooth boundaries among lung tissue patterns commonly encountered in HRCT images of the thorax. A public database that consists of HRCT images taken from patients affected with Interstitial Lung Diseases (ILDs) is used for the evaluation. The algorithms considered are Markov Random Field (MRF), Gaussian Mixture Model (GMM) and Mean Shift (MS). 2-fold cross validation approach is followed for the selection of the best parameter value for individual algorithm as well as to evaluate the performance of all the algorithms. Mean shift algorithm is observed as the best performer in terms of Jaccard Index, Modified Hausdorff Distance, accuracy, Dice Similarity Coefficient and execution speed.

  20. Semantic Segmentation of Aerial Images with AN Ensemble of Cnns

    NASA Astrophysics Data System (ADS)

    Marmanis, D.; Wegner, J. D.; Galliani, S.; Schindler, K.; Datcu, M.; Stilla, U.

    2016-06-01

    This paper describes a deep learning approach to semantic segmentation of very high resolution (aerial) images. Deep neural architectures hold the promise of end-to-end learning from raw images, making heuristic feature design obsolete. Over the last decade this idea has seen a revival, and in recent years deep convolutional neural networks (CNNs) have emerged as the method of choice for a range of image interpretation tasks like visual recognition and object detection. Still, standard CNNs do not lend themselves to per-pixel semantic segmentation, mainly because one of their fundamental principles is to gradually aggregate information over larger and larger image regions, making it hard to disentangle contributions from different pixels. Very recently two extensions of the CNN framework have made it possible to trace the semantic information back to a precise pixel position: deconvolutional network layers undo the spatial downsampling, and Fully Convolution Networks (FCNs) modify the fully connected classification layers of the network in such a way that the location of individual activations remains explicit. We design a FCN which takes as input intensity and range data and, with the help of aggressive deconvolution and recycling of early network layers, converts them into a pixelwise classification at full resolution. We discuss design choices and intricacies of such a network, and demonstrate that an ensemble of several networks achieves excellent results on challenging data such as the ISPRS semantic labeling benchmark, using only the raw data as input.

  1. Efficient color representation for image segmentation under nonwhite illumination

    NASA Astrophysics Data System (ADS)

    Park, Jae Byung

    2003-10-01

    Color image segmentation algorithms often consider object color to be a constant property of an object. If the light source dominantly exhibits a particular color, however, it becomes necessary to consider the color variation induced by the colored illuminant. This paper presents a new approach to segmenting color images that are photographed under non-white illumination conditions. It also addresses how to estimate the color of illuminant in terms of the standard RGB color values rather than the spectrum of the illuminant. With respect to the illumination axis that goes through the origin and the centroid of illuminant color clusters (prior given by the estimation process), the RGB color space is transformed into our new color coordinate system. Our new color scheme shares the intuitiveness of the HSI (HSL or HSV) space that comes from the conical (double-conical or cylindrical) structure of hue and saturation aligned with the intensity variation at its center. It has been developed by locating the ordinary RGB cube in such a way that the illumination axis aligns with the vertical axis (Z-axis) of a larger Cartesian (XYZ) space. The work in this paper uses the dichromatic reflection model [1] to interpret the physics about light and optical effects in color images. The linearity proposed in the dichromatic reflection model is essential and is well preserved in the RGB color space. By proposing a straightforward color model transduction, we suggest dimensionality reduction and provide an efficient way to analyze color images of dielectric objects under non-white illumination conditions. The feasibility of the proposed color representation has been demonstrated by our experiment that is twofold: 1) Segmentation result from a multi-modal histogram-based thresholding technique and 2) Color constancy result from discounting illumination effect further by color balancing.

  2. A non-parametric segmentation methodology for oral videocapillaroscopic images.

    PubMed

    Bellavia, Fabio; Cacioppo, Antonino; Lupaşcu, Carmen Alina; Messina, Pietro; Scardina, Giuseppe; Tegolo, Domenico; Valenti, Cesare

    2014-05-01

    We aim to describe a new non-parametric methodology to support the clinician during the diagnostic process of oral videocapillaroscopy to evaluate peripheral microcirculation. Our methodology, mainly based on wavelet analysis and mathematical morphology to preprocess the images, segments them by minimizing the within-class luminosity variance of both capillaries and background. Experiments were carried out on a set of real microphotographs to validate this approach versus handmade segmentations provided by physicians. By using a leave-one-patient-out approach, we pointed out that our methodology is robust, according to precision-recall criteria (average precision and recall are equal to 0.924 and 0.923, respectively) and it acts as a physician in terms of the Jaccard index (mean and standard deviation equal to 0.858 and 0.064, respectively). PMID:24657094

  3. A non-parametric segmentation methodology for oral videocapillaroscopic images.

    PubMed

    Bellavia, Fabio; Cacioppo, Antonino; Lupaşcu, Carmen Alina; Messina, Pietro; Scardina, Giuseppe; Tegolo, Domenico; Valenti, Cesare

    2014-05-01

    We aim to describe a new non-parametric methodology to support the clinician during the diagnostic process of oral videocapillaroscopy to evaluate peripheral microcirculation. Our methodology, mainly based on wavelet analysis and mathematical morphology to preprocess the images, segments them by minimizing the within-class luminosity variance of both capillaries and background. Experiments were carried out on a set of real microphotographs to validate this approach versus handmade segmentations provided by physicians. By using a leave-one-patient-out approach, we pointed out that our methodology is robust, according to precision-recall criteria (average precision and recall are equal to 0.924 and 0.923, respectively) and it acts as a physician in terms of the Jaccard index (mean and standard deviation equal to 0.858 and 0.064, respectively).

  4. Automatic segmentation of maxillofacial cysts in cone beam CT images.

    PubMed

    Abdolali, Fatemeh; Zoroofi, Reza Aghaeizadeh; Otake, Yoshito; Sato, Yoshinobu

    2016-05-01

    Accurate segmentation of cysts and tumors is an essential step for diagnosis, monitoring and planning therapeutic intervention. This task is usually done manually, however manual identification and segmentation is tedious. In this paper, an automatic method based on asymmetry analysis is proposed which is general enough to segment various types of jaw cysts. The key observation underlying this approach is that normal head and face structure is roughly symmetric with respect to midsagittal plane: the left part and the right part can be divided equally by an axis of symmetry. Cysts and tumors typically disturb this symmetry. The proposed approach consists of three main steps as follows: At first, diffusion filtering is used for preprocessing and symmetric axis is detected. Then, each image is divided into two parts. In the second stage, free form deformation (FFD) is used to correct slight displacement of corresponding pixels of the left part and a reflected copy of the right part. In the final stage, intensity differences are analyzed and a number of constraints are enforced to remove false positive regions. The proposed method has been validated on 97 Cone Beam Computed Tomography (CBCT) sets containing various jaw cysts which were collected from various image acquisition centers. Validation is performed using three similarity indicators (Jaccard index, Dice's coefficient and Hausdorff distance). The mean Dice's coefficient of 0.83, 0.87 and 0.80 is achieved for Radicular, Dentigerous and KCOT classes, respectively. For most of the experiments done, we achieved high true positive (TP). This means that a large number of cyst pixels are correctly classified. Quantitative results of automatic segmentation show that the proposed method is more effective than one of the recent methods in the literature.

  5. Diffusion maps clustering for magnetic resonance q-ball imaging segmentation.

    PubMed

    Wassermann, Demian; Descoteaux, Maxime; Deriche, Rachid

    2008-01-01

    White matter fiber clustering aims to get insight about anatomical structures in order to generate atlases, perform clear visualizations, and compute statistics across subjects, all important and current neuroimaging problems. In this work, we present a diffusion maps clustering method applied to diffusion MRI in order to segment complex white matter fiber bundles. It is well known that diffusion tensor imaging (DTI) is restricted in complex fiber regions with crossings and this is why recent high-angular resolution diffusion imaging (HARDI) such as Q-Ball imaging (QBI) has been introduced to overcome these limitations. QBI reconstructs the diffusion orientation distribution function (ODF), a spherical function that has its maxima agreeing with the underlying fiber populations. In this paper, we use a spherical harmonic ODF representation as input to the diffusion maps clustering method. We first show the advantage of using diffusion maps clustering over classical methods such as N-Cuts and Laplacian eigenmaps. In particular, our ODF diffusion maps requires a smaller number of hypothesis from the input data, reduces the number of artifacts in the segmentation, and automatically exhibits the number of clusters segmenting the Q-Ball image by using an adaptive scale-space parameter. We also show that our ODF diffusion maps clustering can reproduce published results using the diffusion tensor (DT) clustering with N-Cuts on simple synthetic images without crossings. On more complex data with crossings, we show that our ODF-based method succeeds to separate fiber bundles and crossing regions whereas the DT-based methods generate artifacts and exhibit wrong number of clusters. Finally, we show results on a real-brain dataset where we segment well-known fiber bundles. PMID:18317506

  6. MRI brain tumor segmentation and necrosis detection using adaptive Sobolev snakes

    NASA Astrophysics Data System (ADS)

    Nakhmani, Arie; Kikinis, Ron; Tannenbaum, Allen

    2014-03-01

    Brain tumor segmentation in brain MRI volumes is used in neurosurgical planning and illness staging. It is important to explore the tumor shape and necrosis regions at di erent points of time to evaluate the disease progression. We propose an algorithm for semi-automatic tumor segmentation and necrosis detection. Our algorithm consists of three parts: conversion of MRI volume to a probability space based on the on-line learned model, tumor probability density estimation, and adaptive segmentation in the probability space. We use manually selected acceptance and rejection classes on a single MRI slice to learn the background and foreground statistical models. Then, we propagate this model to all MRI slices to compute the most probable regions of the tumor. Anisotropic 3D di usion is used to estimate the probability density. Finally, the estimated density is segmented by the Sobolev active contour (snake) algorithm to select smoothed regions of the maximum tumor probability. The segmentation approach is robust to noise and not very sensitive to the manual initialization in the volumes tested. Also, it is appropriate for low contrast imagery. The irregular necrosis regions are detected by using the outliers of the probability distribution inside the segmented region. The necrosis regions of small width are removed due to a high probability of noisy measurements. The MRI volume segmentation results obtained by our algorithm are very similar to expert manual segmentation.

  7. Block adaptive rate controlled image data compression

    NASA Technical Reports Server (NTRS)

    Rice, R. F.; Hilbert, E.; Lee, J.-J.; Schlutsmeyer, A.

    1979-01-01

    A block adaptive rate controlled (BARC) image data compression algorithm is described. It is noted that in the algorithm's principal rate controlled mode, image lines can be coded at selected rates by combining practical universal noiseless coding techniques with block adaptive adjustments in linear quantization. Compression of any source data at chosen rates of 3.0 bits/sample and above can be expected to yield visual image quality with imperceptible degradation. Exact reconstruction will be obtained if the one-dimensional difference entropy is below the selected compression rate. It is noted that the compressor can also be operated as a floating rate noiseless coder by simply not altering the input data quantization. Here, the universal noiseless coder ensures that the code rate is always close to the entropy. Application of BARC image data compression to the Galileo orbiter mission of Jupiter is considered.

  8. Multi-Label Segmentation Propagation for Materials Science Images Incorporating Topology and Interactivity

    NASA Astrophysics Data System (ADS)

    Waggoner, Jarrell

    Segmentation propagation is the problem of transferring the segmentation of an image to a neighboring image in a sequence. This problem is of particular importance to materials science, where the accurate segmentation of a series of 2D serial-sectioned images of multiple, contiguous 3D structures has important applications. Such structures may have prior-known shape, appearance, and/or topology among the underlying structures which can be considered to improve segmentation accuracy. For example, some materials images may have structures with a specific shape or appearance in each serial section slice, which only changes minimally from slice to slice; and some materials may exhibit specific topology which constrains their structure or neighboring relations. In this work, we develop a framework for materials image segmentation that segments a variety of materials image types by repeatedly propagating a 2D segmentation from one slice to another, and we formulate each step of this propagation as an optimal labeling problem that can be efficiently solved using the graph-cut algorithm. During this propagation, we propose novel strategies to enforce the shape, appearance, and topology of the segmented structures, as well as handling local topology inconsistency. Most recent works on topology-constrained image segmentation focus on binary segmentation, where the topology is often described by the connectivity of both foreground and background. We develop a new multi-labeling approach to enforce topology in multiple-label image segmentation. In this case, we not only require each segment to be a connected region (intra-segment topology), but also require specific adjacency relations between each pair of segments (inter-segment topology). Finally, we integrate an interactive approach into the proposed framework that improves the segmentation by allowing minimal and simplistic human annotations. We justify the effectiveness of the proposed framework by testing it on various 3

  9. Watertight modeling and segmentation of bifurcated Coronary arteries for blood flow simulation using CT imaging.

    PubMed

    Zhou, Haoyin; Sun, Peng; Ha, Seongmin; Lundine, Devon; Xiong, Guanglei

    2016-10-01

    Image-based simulation of blood flow using computational fluid dynamics has been shown to play an important role in the diagnosis of ischemic coronary artery disease. Accurate extraction of complex coronary artery structures in a watertight geometry is a prerequisite, but manual segmentation is both tedious and subjective. Several semi- and fully automated coronary artery extraction approaches have been developed but have faced several challenges. Conventional voxel-based methods allow for watertight segmentation but are slow and difficult to incorporate expert knowledge. Machine learning based methods are relatively fast and capture rich information embedded in manual annotations. Although sufficient for visualization and analysis of coronary anatomy, these methods cannot be used directly for blood flow simulation if the coronary vasculature is represented as a loose combination of tubular structures and the bifurcation geometry is improperly modeled. In this paper, we propose a novel method to extract branching coronary arteries from CT imaging with a focus on explicit bifurcation modeling and application of machine learning. A bifurcation lumen is firstly modeled by generating the convex hull to join tubular vessel branches. Guided by the pre-determined centerline, machine learning based segmentation is performed to adapt the bifurcation lumen model to target vessel boundaries and smoothed by subdivision surfaces. Our experiments show the constructed coronary artery geometry from CT imaging is accurate by comparing results against the manually annotated ground-truths, and can be directly applied to coronary blood flow simulation. PMID:27490317

  10. Deformable segmentation of 3D MR prostate images via distributed discriminative dictionary and ensemble learning

    SciTech Connect

    Guo, Yanrong; Shao, Yeqin; Gao, Yaozong; Price, True; Oto, Aytekin; Shen, Dinggang

    2014-07-15

    patches of the prostate surface and trained to adaptively capture the appearance in different prostate zones, thus achieving better local tissue differentiation. For each local region, multiple classifiers are trained based on the randomly selected samples and finally assembled by a specific fusion method. In addition to this nonparametric appearance model, a prostate shape model is learned from the shape statistics using a novel approach, sparse shape composition, which can model nonGaussian distributions of shape variation and regularize the 3D mesh deformation by constraining it within the observed shape subspace. Results: The proposed method has been evaluated on two datasets consisting of T2-weighted MR prostate images. For the first (internal) dataset, the classification effectiveness of the authors' improved dictionary learning has been validated by comparing it with three other variants of traditional dictionary learning methods. The experimental results show that the authors' method yields a Dice Ratio of 89.1% compared to the manual segmentation, which is more accurate than the three state-of-the-art MR prostate segmentation methods under comparison. For the second dataset, the MICCAI 2012 challenge dataset, the authors' proposed method yields a Dice Ratio of 87.4%, which also achieves better segmentation accuracy than other methods under comparison. Conclusions: A new magnetic resonance image prostate segmentation method is proposed based on the combination of deformable model and dictionary learning methods, which achieves more accurate segmentation performance on prostate T2 MR images.

  11. Cerebella segmentation on MR images of pediatric patients with medulloblastoma

    NASA Astrophysics Data System (ADS)

    Shan, Zu Y.; Ji, Qing; Glass, John; Gajjar, Amar; Reddick, Wilburn E.

    2005-04-01

    In this study, an automated method has been developed to identify the cerebellum from T1-weighted MR brain images of patients with medulloblastoma. A new objective function that is similar to Gibbs free energy in classic physics was defined; and the brain structure delineation was viewed as a process of minimizing Gibbs free energy. We used a rigid-body registration and an active contour (snake) method to minimize the Gibbs free energy in this study. The method was applied to 20 patient data sets to generate cerebellum images and volumetric results. The generated cerebellum images were compared with two manually drawn results. Strong correlations were found between the automatically and manually generated volumetric results, the correlation coefficients with each of manual results were 0.971 and 0.974, respectively. The average Jaccard similarities with each of two manual results were 0.89 and 0.88, respectively. The average Kappa indexes with each of two manual results were 0.94 and 0.93, respectively. These results showed this method was both robust and accurate for cerebellum segmentation. The method may be applied to various research and clinical investigation in which cerebellum segmentation and quantitative MR measurement of cerebellum are needed.

  12. Development of image-processing software for automatic segmentation of brain tumors in MR images.

    PubMed

    Vijayakumar, C; Gharpure, Damayanti Chandrashekhar

    2011-07-01

    Most of the commercially available software for brain tumor segmentation have limited functionality and frequently lack the careful validation that is required for clinical studies. We have developed an image-analysis software package called 'Prometheus,' which performs neural system-based segmentation operations on MR images using pre-trained information. The software also has the capability to improve its segmentation performance by using the training module of the neural system. The aim of this article is to present the design and modules of this software. The segmentation module of Prometheus can be used primarily for image analysis in MR images. Prometheus was validated against manual segmentation by a radiologist and its mean sensitivity and specificity was found to be 85.71±4.89% and 93.2±2.87%, respectively. Similarly, the mean segmentation accuracy and mean correspondence ratio was found to be 92.35±3.37% and 0.78±0.046, respectively. PMID:21897560

  13. Adaptation and visual search in mammographic images.

    PubMed

    Kompaniez-Dunigan, Elysse; Abbey, Craig K; Boone, John M; Webster, Michael A

    2015-05-01

    Radiologists face the visually challenging task of detecting suspicious features within the complex and noisy backgrounds characteristic of medical images. We used a search task to examine whether the salience of target features in x-ray mammograms could be enhanced by prior adaptation to the spatial structure of the images. The observers were not radiologists, and thus had no diagnostic training with the images. The stimuli were randomly selected sections from normal mammograms previously classified with BIRADS Density scores of "fatty" versus "dense," corresponding to differences in the relative quantities of fat versus fibroglandular tissue. These categories reflect conspicuous differences in visual texture, with dense tissue being more likely to obscure lesion detection. The targets were simulated masses corresponding to bright Gaussian spots, superimposed by adding the luminance to the background. A single target was randomly added to each image, with contrast varied over five levels so that they varied from difficult to easy to detect. Reaction times were measured for detecting the target location, before or after adapting to a gray field or to random sequences of a different set of dense or fatty images. Observers were faster at detecting the targets in either dense or fatty images after adapting to the specific background type (dense or fatty) that they were searching within. Thus, the adaptation led to a facilitation of search performance that was selective for the background texture. Our results are consistent with the hypothesis that adaptation allows observers to more effectively suppress the specific structure of the background, thereby heightening visual salience and search efficiency.

  14. Reconstruction of Human Monte Carlo Geometry from Segmented Images

    NASA Astrophysics Data System (ADS)

    Zhao, Kai; Cheng, Mengyun; Fan, Yanchang; Wang, Wen; Long, Pengcheng; Wu, Yican

    2014-06-01

    Human computational phantoms have been used extensively for scientific experimental analysis and experimental simulation. This article presented a method for human geometry reconstruction from a series of segmented images of a Chinese visible human dataset. The phantom geometry could actually describe detailed structure of an organ and could be converted into the input file of the Monte Carlo codes for dose calculation. A whole-body computational phantom of Chinese adult female has been established by FDS Team which is named Rad-HUMAN with about 28.8 billion voxel number. For being processed conveniently, different organs on images were segmented with different RGB colors and the voxels were assigned with positions of the dataset. For refinement, the positions were first sampled. Secondly, the large sums of voxels inside the organ were three-dimensional adjacent, however, there were not thoroughly mergence methods to reduce the cell amounts for the description of the organ. In this study, the voxels on the organ surface were taken into consideration of the mergence which could produce fewer cells for the organs. At the same time, an indexed based sorting algorithm was put forward for enhancing the mergence speed. Finally, the Rad-HUMAN which included a total of 46 organs and tissues was described by the cuboids into the Monte Carlo Monte Carlo Geometry for the simulation. The Monte Carlo geometry was constructed directly from the segmented images and the voxels was merged exhaustively. Each organ geometry model was constructed without ambiguity and self-crossing, its geometry information could represent the accuracy appearance and precise interior structure of the organs. The constructed geometry largely retaining the original shape of organs could easily be described into different Monte Carlo codes input file such as MCNP. Its universal property was testified and high-performance was experimentally verified

  15. Optree: a learning-based adaptive watershed algorithm for neuron segmentation.

    PubMed

    Uzunbaş, Mustafa Gökhan; Chen, Chao; Metaxas, Dimitris

    2014-01-01

    We present a new algorithm for automatic and interactive segmentation of neuron structures from electron microscopy (EM) images. Our method selects a collection of nodes from the watershed mergng tree as the proposed segmentation. This is achieved by building a onditional random field (CRF) whose underlying graph is the merging tree. The maximum a posteriori (MAP) prediction of the CRF is the output segmentation. Our algorithm outperforms state-of-the-art methods. Both the inference and the training are very efficient as the graph is tree-structured. Furthermore, we develop an interactive segmentation framework which selects uncertain regions for a user to proofread. The uncertainty is measured by the marginals of the graphical model. Based on user corrections, our framework modifies the merging tree and thus improves the segmentation globally. PMID:25333106

  16. Segmentation of MR images for computer-assisted surgery of the lumbar spine

    NASA Astrophysics Data System (ADS)

    Hoad, C. L.; Martel, A. L.

    2002-10-01

    This paper describes a segmentation algorithm designed to separate bone from soft tissue in magnetic resonance (MR) images developed for computer-assisted surgery of the spine. The algorithm was applied to MR images of the spine of healthy volunteers. Registration experiments were carried out on a physical model of a spine generated from computed tomography (CT) data of a surgical patient. Segmented CT, manually segmented MR and MR images segmented using the developed algorithm were compared. The algorithm performed well at segmenting bone from soft tissue on images taken of healthy volunteers. Registration experiments showed similar results between the CT and MR data. The MR data, which were manually segmented, performed worse on visual verification experiments than both the CT and semi-automatic segmented data. The algorithm developed performs well at segmenting bone from soft tissue in MR images of the spine as measured using registration experiments.

  17. Multiple Hypotheses Image Segmentation and Classification With Application to Dietary Assessment

    PubMed Central

    Zhu, Fengqing; Bosch, Marc; Khanna, Nitin; Boushey, Carol J.; Delp, Edward J.

    2016-01-01

    We propose a method for dietary assessment to automatically identify and locate food in a variety of images captured during controlled and natural eating events. Two concepts are combined to achieve this: a set of segmented objects can be partitioned into perceptually similar object classes based on global and local features; and perceptually similar object classes can be used to assess the accuracy of image segmentation. These ideas are implemented by generating multiple segmentations of an image to select stable segmentations based on the classifier’s confidence score assigned to each segmented image region. Automatic segmented regions are classified using a multichannel feature classification system. For each segmented region, multiple feature spaces are formed. Feature vectors in each of the feature spaces are individually classified. The final decision is obtained by combining class decisions from individual feature spaces using decision rules. We show improved accuracy of segmenting food images with classifier feedback. PMID:25561457

  18. Automatic Segmentation and Online virtualCT in Head-and-Neck Adaptive Radiation Therapy

    SciTech Connect

    Peroni, Marta; Ciardo, Delia; Spadea, Maria Francesca; Riboldi, Marco; Comi, Stefania; Alterio, Daniela; Baroni, Guido; Orecchia, Roberto

    2012-11-01

    Purpose: The purpose of this work was to develop and validate an efficient and automatic strategy to generate online virtual computed tomography (CT) scans for adaptive radiation therapy (ART) in head-and-neck (HN) cancer treatment. Method: We retrospectively analyzed 20 patients, treated with intensity modulated radiation therapy (IMRT), for an HN malignancy. Different anatomical structures were considered: mandible, parotid glands, and nodal gross tumor volume (nGTV). We generated 28 virtualCT scans by means of nonrigid registration of simulation computed tomography (CTsim) and cone beam CT images (CBCTs), acquired for patient setup. We validated our approach by considering the real replanning CT (CTrepl) as ground truth. We computed the Dice coefficient (DSC), center of mass (COM) distance, and root mean square error (RMSE) between correspondent points located on the automatically segmented structures on CBCT and virtualCT. Results: Residual deformation between CTrepl and CBCT was below one voxel. Median DSC was around 0.8 for mandible and parotid glands, but only 0.55 for nGTV, because of the fairly homogeneous surrounding soft tissues and of its small volume. Median COM distance and RMSE were comparable with image resolution. No significant correlation between RMSE and initial or final deformation was found. Conclusion: The analysis provides evidence that deformable image registration may contribute significantly in reducing the need of full CT-based replanning in HN radiation therapy by supporting swift and objective decision-making in clinical practice. Further work is needed to strengthen algorithm potential in nGTV localization.

  19. Research on a pulmonary nodule segmentation method combining fast self-adaptive FCM and classification.

    PubMed

    Liu, Hui; Zhang, Cai-Ming; Su, Zhi-Yuan; Wang, Kai; Deng, Kai

    2015-01-01

    The key problem of computer-aided diagnosis (CAD) of lung cancer is to segment pathologically changed tissues fast and accurately. As pulmonary nodules are potential manifestation of lung cancer, we propose a fast and self-adaptive pulmonary nodules segmentation method based on a combination of FCM clustering and classification learning. The enhanced spatial function considers contributions to fuzzy membership from both the grayscale similarity between central pixels and single neighboring pixels and the spatial similarity between central pixels and neighborhood and improves effectively the convergence rate and self-adaptivity of the algorithm. Experimental results show that the proposed method can achieve more accurate segmentation of vascular adhesion, pleural adhesion, and ground glass opacity (GGO) pulmonary nodules than other typical algorithms.

  20. New variational image decomposition model for simultaneously denoising and segmenting optical coherence tomography images

    NASA Astrophysics Data System (ADS)

    Duan, Jinming; Tench, Christopher; Gottlob, Irene; Proudlock, Frank; Bai, Li

    2015-11-01

    Optical coherence tomography (OCT) imaging plays an important role in clinical diagnosis and monitoring of diseases of the human retina. Automated analysis of optical coherence tomography images is a challenging task as the images are inherently noisy. In this paper, a novel variational image decomposition model is proposed to decompose an OCT image into three components: the first component is the original image but with the noise completely removed; the second contains the set of edges representing the retinal layer boundaries present in the image; and the third is an image of noise, or in image decomposition terms, the texture, or oscillatory patterns of the original image. In addition, a fast Fourier transform based split Bregman algorithm is developed to improve computational efficiency of solving the proposed model. Extensive experiments are conducted on both synthesised and real OCT images to demonstrate that the proposed model outperforms the state-of-the-art speckle noise reduction methods and leads to accurate retinal layer segmentation.

  1. Stent segmentation in IOCT-TD images using gradient combination and mathematical morphology

    NASA Astrophysics Data System (ADS)

    Cardona Cardenas, Diego A.; Cardoso Moraes, Matheus; Furuie, Sérgio S.

    2015-01-01

    In 2010, cardiovascular disease (CVD) caused 33% of the total deaths in Brazil. Modalities such as Intravascular Optical Coherent Tomography (IOCT) provides coronary in vivo for detecting and monitoring the progression of CVDs. Specifically, this type of modality is widely used in neo-intima post stent re-stenosis investigation. Computational methods applied to IOCT images can render objective structure information, such as areas, perimeters, etc., allowing more accurate diagnostics. However, the variety of methods in the literature applied in IOCT is still small compared to other related modalities. Therefore, we propose a stent segmentation approach based on extracted features by gradient operations, and Mathematical Morphology. The methodology can be summarized as following: the lumen is segmented and the contrast stretching is generated, both to be used as auxiliary information. Second, the edges of objects were obtained by gradient computation. Next, a stent extractor finds and select relevant stent information. Finally, an interpolation procedure followed by morphological operations ends the segmentation. To evaluate the method, 160 images from pig coronaries were segmented and compared to their gold standards, the images were acquired after 30, 90 and 180 days of stent implantation. The proposed approach present good accuracy of True Positive (TP(%)) = 96.51±5.10, False Positive (FP(%)) = 6.09±5.32 , False Negative (FN(%)) = 3.49±5.10. Conclusion, the good results and the low complexity encourage the use and continuous evolution of current approach. However, only images of IOCT-TD technology were evaluated; therefore, further investigations should adapt this approach to work with IOCT-FD technology as well.

  2. A combinatorial Bayesian and Dirichlet model for prostate MR image segmentation using probabilistic image features

    NASA Astrophysics Data System (ADS)

    Li, Ang; Li, Changyang; Wang, Xiuying; Eberl, Stefan; Feng, Dagan; Fulham, Michael

    2016-08-01

    Blurred boundaries and heterogeneous intensities make accurate prostate MR image segmentation problematic. To improve prostate MR image segmentation we suggest an approach that includes: (a) an image patch division method to partition the prostate into homogeneous segments for feature extraction; (b) an image feature formulation and classification method, using the relevance vector machine, to provide probabilistic prior knowledge for graph energy construction; (c) a graph energy formulation scheme with Bayesian priors and Dirichlet graph energy and (d) a non-iterative graph energy minimization scheme, based on matrix differentiation, to perform the probabilistic pixel membership optimization. The segmentation output was obtained by assigning pixels with foreground and background labels based on derived membership probabilities. We evaluated our approach on the PROMISE-12 dataset with 50 prostate MR image volumes. Our approach achieved a mean dice similarity coefficient (DSC) of 0.90  ±  0.02, which surpassed the five best prior-based methods in the PROMISE-12 segmentation challenge.

  3. A combinatorial Bayesian and Dirichlet model for prostate MR image segmentation using probabilistic image features.

    PubMed

    Li, Ang; Li, Changyang; Wang, Xiuying; Eberl, Stefan; Feng, Dagan; Fulham, Michael

    2016-08-21

    Blurred boundaries and heterogeneous intensities make accurate prostate MR image segmentation problematic. To improve prostate MR image segmentation we suggest an approach that includes: (a) an image patch division method to partition the prostate into homogeneous segments for feature extraction; (b) an image feature formulation and classification method, using the relevance vector machine, to provide probabilistic prior knowledge for graph energy construction; (c) a graph energy formulation scheme with Bayesian priors and Dirichlet graph energy and (d) a non-iterative graph energy minimization scheme, based on matrix differentiation, to perform the probabilistic pixel membership optimization. The segmentation output was obtained by assigning pixels with foreground and background labels based on derived membership probabilities. We evaluated our approach on the PROMISE-12 dataset with 50 prostate MR image volumes. Our approach achieved a mean dice similarity coefficient (DSC) of 0.90  ±  0.02, which surpassed the five best prior-based methods in the PROMISE-12 segmentation challenge. PMID:27461085

  4. A partition-based active contour model incorporating local information for image segmentation.

    PubMed

    Shi, Jiao; Wu, Jiaji; Paul, Anand; Jiao, Licheng; Gong, Maoguo

    2014-01-01

    Active contour models are always designed on the assumption that images are approximated by regions with piecewise-constant intensities. This assumption, however, cannot be satisfied when describing intensity inhomogeneous images which frequently occur in real world images and induced considerable difficulties in image segmentation. A milder assumption that the image is statistically homogeneous within different local regions may better suit real world images. By taking local image information into consideration, an enhanced active contour model is proposed to overcome difficulties caused by intensity inhomogeneity. In addition, according to curve evolution theory, only the region near contour boundaries is supposed to be evolved in each iteration. We try to detect the regions near contour boundaries adaptively for satisfying the requirement of curve evolution theory. In the proposed method, pixels within a selected region near contour boundaries have the opportunity to be updated in each iteration, which enables the contour to be evolved gradually. Experimental results on synthetic and real world images demonstrate the advantages of the proposed model when dealing with intensity inhomogeneity images.

  5. Automatic segmentation of ground-glass opacities in lung CT images by using Markov random field-based algorithms.

    PubMed

    Zhu, Yanjie; Tan, Yongqing; Hua, Yanqing; Zhang, Guozhen; Zhang, Jianguo

    2012-06-01

    Chest radiologists rely on the segmentation and quantificational analysis of ground-glass opacities (GGO) to perform imaging diagnoses that evaluate the disease severity or recovery stages of diffuse parenchymal lung diseases. However, it is computationally difficult to segment and analyze patterns of GGO while compared with other lung diseases, since GGO usually do not have clear boundaries. In this paper, we present a new approach which automatically segments GGO in lung computed tomography (CT) images using algorithms derived from Markov random field theory. Further, we systematically evaluate the performance of the algorithms in segmenting GGO in lung CT images under different situations. CT image studies from 41 patients with diffuse lung diseases were enrolled in this research. The local distributions were modeled with both simple and adaptive (AMAP) models of maximum a posteriori (MAP). For best segmentation, we used the simulated annealing algorithm with a Gibbs sampler to solve the combinatorial optimization problem of MAP estimators, and we applied a knowledge-guided strategy to reduce false positive regions. We achieved AMAP-based GGO segmentation results of 86.94%, 94.33%, and 94.06% in average sensitivity, specificity, and accuracy, respectively, and we evaluated the performance using radiologists' subjective evaluation and quantificational analysis and diagnosis. We also compared the results of AMAP-based GGO segmentation with those of support vector machine-based methods, and we discuss the reliability and other issues of AMAP-based GGO segmentation. Our research results demonstrate the acceptability and usefulness of AMAP-based GGO segmentation for assisting radiologists in detecting GGO in high-resolution CT diagnostic procedures.

  6. Methods for segmenting curved needles in ultrasound images.

    PubMed

    Okazawa, Stephen H; Ebrahimi, Richelle; Chuang, Jason; Rohling, Robert N; Salcudean, Septimiu E

    2006-06-01

    Ultrasound-guided percutaneous needle insertions are widely used techniques in current clinical practice. Some of these procedures have a high degree of difficulty because of poor observability of the needle in the ultrasound image. There have been recent efforts to improve guidance by computer assisted needle detection. These software techniques are often limited by not representing needle curvature. We present two methods to detect the needle in 2D ultrasound that specifically address needle curvature. Firstly, we demonstrate a real-time needle segmentation algorithm based on the Hough transform which detects the needle and represents its curved shape. Secondly, we demonstrate how a new coordinate transformation can transform detection of a curved needle to a linear fit. These methods are demonstrated on ultrasound and photographic images.

  7. Image enhancement and segmentation using weighted morphological connected slope filters

    NASA Astrophysics Data System (ADS)

    Mendiola-Santibañez, Jorge D.; Terol-Villalobos, Iván R.

    2013-04-01

    The morphological connected slope filters (MCSFs) are studied as gray level transformations, and two contributions are made on these operators with the purpose of modifying the gradient criterion performance. The proposals consist of: (a) the introduction of three weighting functions and (b) the application of a displacement parameter. The displacement parameter will permit the image segmentation in a certain intensity interval and the contrast improvement at the same time. This characteristic is an important difference among the MCSFs introduced previously, together with the other transformations defined in the current literature utilized uniquely to enhance contrast. Also, an application example of the weighted morphological slope filters is provided. In such an example, white matter is separated from brain magnetic resonance images T1.

  8. A novel SAR fusion image segmentation method based on triplet Markov field

    NASA Astrophysics Data System (ADS)

    Wang, Jiajing; Jiao, Shuhong; Sun, Zhenyu

    2015-03-01

    Markov random field (MRF) has been widely used in SAR image segmentation because of the advantage of directly modeling the posterior distribution and suppresses the speckle on the influence of the segmentation result. However, when the real SAR images are nonstationary images, the unsupervised segmentation results by MRF can be poor. The recent proposed triplet Markov field (TMF) model is well appropriate for nonstationary SAR image processing due to the introduction of an auxiliary field which reflects the nonstationarity. In addition, on account of the texture features of SAR image, a fusion image segmentation method is proposed by fusing the gray level image and texture feature image. The effectiveness of the proposed method in this paper is demonstrated by a synthesis SAR image and the real SAR images segmentation experiments, and it is better than the state-of-art methods.

  9. Automated 3D ultrasound image segmentation to aid breast cancer image interpretation.

    PubMed

    Gu, Peng; Lee, Won-Mean; Roubidoux, Marilyn A; Yuan, Jie; Wang, Xueding; Carson, Paul L

    2016-02-01

    Segmentation of an ultrasound image into functional tissues is of great importance to clinical diagnosis of breast cancer. However, many studies are found to segment only the mass of interest and not all major tissues. Differences and inconsistencies in ultrasound interpretation call for an automated segmentation method to make results operator-independent. Furthermore, manual segmentation of entire three-dimensional (3D) ultrasound volumes is time-consuming, resource-intensive, and clinically impractical. Here, we propose an automated algorithm to segment 3D ultrasound volumes into three major tissue types: cyst/mass, fatty tissue, and fibro-glandular tissue. To test its efficacy and consistency, the proposed automated method was employed on a database of 21 cases of whole breast ultrasound. Experimental results show that our proposed method not only distinguishes fat and non-fat tissues correctly, but performs well in classifying cyst/mass. Comparison of density assessment between the automated method and manual segmentation demonstrates good consistency with an accuracy of 85.7%. Quantitative comparison of corresponding tissue volumes, which uses overlap ratio, gives an average similarity of 74.54%, consistent with values seen in MRI brain segmentations. Thus, our proposed method exhibits great potential as an automated approach to segment 3D whole breast ultrasound volumes into functionally distinct tissues that may help to correct ultrasound speed of sound aberrations and assist in density based prognosis of breast cancer.

  10. Markerless motion capture of multiple characters using multiview image segmentation.

    PubMed

    Liu, Yebin; Gall, Juergen; Stoll, Carsten; Dai, Qionghai; Seidel, Hans-Peter; Theobalt, Christian

    2013-11-01

    Capturing the skeleton motion and detailed time-varying surface geometry of multiple, closely interacting peoples is a very challenging task, even in a multicamera setup, due to frequent occlusions and ambiguities in feature-to-person assignments. To address this task, we propose a framework that exploits multiview image segmentation. To this end, a probabilistic shape and appearance model is employed to segment the input images and to assign each pixel uniquely to one person. Given the articulated template models of each person and the labeled pixels, a combined optimization scheme, which splits the skeleton pose optimization problem into a local one and a lower dimensional global one, is applied one by one to each individual, followed with surface estimation to capture detailed nonrigid deformations. We show on various sequences that our approach can capture the 3D motion of humans accurately even if they move rapidly, if they wear wide apparel, and if they are engaged in challenging multiperson motions, including dancing, wrestling, and hugging. PMID:24051731

  11. Hyperspectral image segmentation of the common bile duct

    NASA Astrophysics Data System (ADS)

    Samarov, Daniel; Wehner, Eleanor; Schwarz, Roderich; Zuzak, Karel; Livingston, Edward

    2013-03-01

    Over the course of the last several years hyperspectral imaging (HSI) has seen increased usage in biomedicine. Within the medical field in particular HSI has been recognized as having the potential to make an immediate impact by reducing the risks and complications associated with laparotomies (surgical procedures involving large incisions into the abdominal wall) and related procedures. There are several ongoing studies focused on such applications. Hyperspectral images were acquired during pancreatoduodenectomies (commonly referred to as Whipple procedures), a surgical procedure done to remove cancerous tumors involving the pancreas and gallbladder. As a result of the complexity of the local anatomy, identifying where the common bile duct (CBD) is can be difficult, resulting in comparatively high incidents of injury to the CBD and associated complications. It is here that HSI has the potential to help reduce the risk of such events from happening. Because the bile contained within the CBD exhibits a unique spectral signature, we are able to utilize HSI segmentation algorithms to help in identifying where the CBD is. In the work presented here we discuss approaches to this segmentation problem and present the results.

  12. Affinity functions: recognizing essential parameters in fuzzy connectedness based image segmentation

    NASA Astrophysics Data System (ADS)

    Ciesielski, Krzysztof C.; Udupa, Jayaram K.

    2009-02-01

    Fuzzy connectedness (FC) constitutes an important class of image segmentation schemas. Although affinity functions represent the core aspect (main variability parameter) of FC algorithms, they have not been studied systematically in the literature. In this paper, we present a thorough study to fill this gap. Our analysis is based on the notion of equivalent affinities: if any two equivalent affinities are used in the same FC schema to produce two versions of the algorithm, then these algorithms are equivalent in the sense that they lead to identical segmentations. We give a complete characterization of the affinity equivalence and show that many natural definitions of affinity functions and their parameters used in the literature are redundant in the sense that different definitions and values of such parameters lead to equivalent affinities. We also show that two main affinity types - homogeneity based and object feature based - are equivalent, respectively, to the difference quotient of the intensity function and Rosenfeld's degree of connectivity. In addition, we demonstrate that any segmentation obtained via relative fuzzy connectedness (RFC) algorithm can be viewed as segmentation obtained via absolute fuzzy connectedness (AFC) algorithm with an automatic and adaptive threshold detection. We finish with an analysis of possible ways of combining different component affinities that result in non equivalent affinities.

  13. Wavelength-adaptive dehazing using histogram merging-based classification for UAV images.

    PubMed

    Yoon, Inhye; Jeong, Seokhwa; Jeong, Jaeheon; Seo, Doochun; Paik, Joonki

    2015-03-19

    Since incoming light to an unmanned aerial vehicle (UAV) platform can be scattered by haze and dust in the atmosphere, the acquired image loses the original color and brightness of the subject. Enhancement of hazy images is an important task in improving the visibility of various UAV images. This paper presents a spatially-adaptive dehazing algorithm that merges color histograms with consideration of the wavelength-dependent atmospheric turbidity. Based on the wavelength-adaptive hazy image acquisition model, the proposed dehazing algorithm consists of three steps: (i) image segmentation based on geometric classes; (ii) generation of the context-adaptive transmission map; and (iii) intensity transformation for enhancing a hazy UAV image. The major contribution of the research is a novel hazy UAV image degradation model by considering the wavelength of light sources. In addition, the proposed transmission map provides a theoretical basis to differentiate visually important regions from others based on the turbidity and merged classification results.

  14. Wavelength-Adaptive Dehazing Using Histogram Merging-Based Classification for UAV Images

    PubMed Central

    Yoon, Inhye; Jeong, Seokhwa; Jeong, Jaeheon; Seo, Doochun; Paik, Joonki

    2015-01-01

    Since incoming light to an unmanned aerial vehicle (UAV) platform can be scattered by haze and dust in the atmosphere, the acquired image loses the original color and brightness of the subject. Enhancement of hazy images is an important task in improving the visibility of various UAV images. This paper presents a spatially-adaptive dehazing algorithm that merges color histograms with consideration of the wavelength-dependent atmospheric turbidity. Based on the wavelength-adaptive hazy image acquisition model, the proposed dehazing algorithm consists of three steps: (i) image segmentation based on geometric classes; (ii) generation of the context-adaptive transmission map; and (iii) intensity transformation for enhancing a hazy UAV image. The major contribution of the research is a novel hazy UAV image degradation model by considering the wavelength of light sources. In addition, the proposed transmission map provides a theoretical basis to differentiate visually important regions from others based on the turbidity and merged classification results. PMID:25808767

  15. Wavelength-adaptive dehazing using histogram merging-based classification for UAV images.

    PubMed

    Yoon, Inhye; Jeong, Seokhwa; Jeong, Jaeheon; Seo, Doochun; Paik, Joonki

    2015-01-01

    Since incoming light to an unmanned aerial vehicle (UAV) platform can be scattered by haze and dust in the atmosphere, the acquired image loses the original color and brightness of the subject. Enhancement of hazy images is an important task in improving the visibility of various UAV images. This paper presents a spatially-adaptive dehazing algorithm that merges color histograms with consideration of the wavelength-dependent atmospheric turbidity. Based on the wavelength-adaptive hazy image acquisition model, the proposed dehazing algorithm consists of three steps: (i) image segmentation based on geometric classes; (ii) generation of the context-adaptive transmission map; and (iii) intensity transformation for enhancing a hazy UAV image. The major contribution of the research is a novel hazy UAV image degradation model by considering the wavelength of light sources. In addition, the proposed transmission map provides a theoretical basis to differentiate visually important regions from others based on the turbidity and merged classification results. PMID:25808767

  16. Remote sensing image classification based on support vector machine with the multi-scale segmentation

    NASA Astrophysics Data System (ADS)

    Bao, Wenxing; Feng, Wei; Ma, Ruishi

    2015-12-01

    In this paper, we proposed a new classification method based on support vector machine (SVM) combined with multi-scale segmentation. The proposed method obtains satisfactory segmentation results which are based on both the spectral characteristics and the shape parameters of segments. SVM method is used to label all these regions after multiscale segmentation. It can effectively improve the classification results. Firstly, the homogeneity of the object spectra, texture and shape are calculated from the input image. Secondly, multi-scale segmentation method is applied to the RS image. Combining graph theory based optimization with the multi-scale image segmentations, the resulting segments are merged regarding the heterogeneity criteria. Finally, based on the segmentation result, the model of SVM combined with spectrum texture classification is constructed and applied. The results show that the proposed method can effectively improve the remote sensing image classification accuracy and classification efficiency.

  17. Approach for reconstructing anisoplanatic adaptive optics images.

    PubMed

    Aubailly, Mathieu; Roggemann, Michael C; Schulz, Timothy J

    2007-08-20

    Atmospheric turbulence corrupts astronomical images formed by ground-based telescopes. Adaptive optics systems allow the effects of turbulence-induced aberrations to be reduced for a narrow field of view corresponding approximately to the isoplanatic angle theta(0). For field angles larger than theta(0), the point spread function (PSF) gradually degrades as the field angle increases. We present a technique to estimate the PSF of an adaptive optics telescope as function of the field angle, and use this information in a space-varying image reconstruction technique. Simulated anisoplanatic intensity images of a star field are reconstructed by means of a block-processing method using the predicted local PSF. Two methods for image recovery are used: matrix inversion with Tikhonov regularization, and the Lucy-Richardson algorithm. Image reconstruction results obtained using the space-varying predicted PSF are compared to space invariant deconvolution results obtained using the on-axis PSF. The anisoplanatic reconstruction technique using the predicted PSF provides a significant improvement of the mean squared error between the reconstructed image and the object compared to the deconvolution performed using the on-axis PSF. PMID:17712366

  18. A Combined Method for Segmentation and Registration for an Advanced and Progressive Evaluation of Thermal Images

    PubMed Central

    Barcelos, Emilio Z.; Caminhas, Walmir M.; Ribeiro, Eraldo; Pimenta, Eduardo M.; Palhares, Reinaldo M.

    2014-01-01

    In this paper, a method that combines image analysis techniques, such as segmentation and registration, is proposed for an advanced and progressive evaluation of thermograms. The method is applied for the prevention of muscle injury in high-performance athletes, in collaboration with a Brazilian professional soccer club. The goal is to produce information on spatio-temporal variations of thermograms favoring the investigation of the athletes' conditions along the competition. The proposed method improves on current practice by providing a means for automatically detecting adaptive body-shaped regions of interest, instead of the manual selection of simple shapes. Specifically, our approach combines the optimization features in Otsu's method with a correction factor and post-processing techniques, enhancing thermal-image segmentation when compared to other methods. Additional contributions resulting from the combination of the segmentation and registration steps of our approach are the progressive analyses of thermograms in a unique spatial coordinate system and the accurate extraction of measurements and isotherms. PMID:25414972

  19. Image segmentation of pyramid style identifier based on Support Vector Machine for colorectal endoscopic images.

    PubMed

    Okamoto, Takumi; Koide, Tetsushi; Sugi, Koki; Shimizu, Tatsuya; Anh-Tuan Hoang; Tamaki, Toru; Raytchev, Bisser; Kaneda, Kazufumi; Kominami, Yoko; Yoshida, Shigeto; Mieno, Hiroshi; Tanaka, Shinji

    2015-08-01

    With the increase of colorectal cancer patients in recent years, the needs of quantitative evaluation of colorectal cancer are increased, and the computer-aided diagnosis (CAD) system which supports doctor's diagnosis is essential. In this paper, a hardware design of type identification module in CAD system for colorectal endoscopic images with narrow band imaging (NBI) magnification is proposed for real-time processing of full high definition image (1920 × 1080 pixel). A pyramid style image segmentation with SVMs for multi-size scan windows, which can be implemented on an FPGA with small circuit area and achieve high accuracy, is proposed for actual complex colorectal endoscopic images.

  20. Image segmentation of pyramid style identifier based on Support Vector Machine for colorectal endoscopic images.

    PubMed

    Okamoto, Takumi; Koide, Tetsushi; Sugi, Koki; Shimizu, Tatsuya; Anh-Tuan Hoang; Tamaki, Toru; Raytchev, Bisser; Kaneda, Kazufumi; Kominami, Yoko; Yoshida, Shigeto; Mieno, Hiroshi; Tanaka, Shinji

    2015-08-01

    With the increase of colorectal cancer patients in recent years, the needs of quantitative evaluation of colorectal cancer are increased, and the computer-aided diagnosis (CAD) system which supports doctor's diagnosis is essential. In this paper, a hardware design of type identification module in CAD system for colorectal endoscopic images with narrow band imaging (NBI) magnification is proposed for real-time processing of full high definition image (1920 × 1080 pixel). A pyramid style image segmentation with SVMs for multi-size scan windows, which can be implemented on an FPGA with small circuit area and achieve high accuracy, is proposed for actual complex colorectal endoscopic images. PMID:26736922

  1. Cytoplasm segmentation on cervical cell images using graph cut-based approach.

    PubMed

    Zhang, Ling; Kong, Hui; Chin, Chien Ting; Wang, Tianfu; Chen, Siping

    2014-01-01

    This paper proposes a method to segment the cytoplasm in cervical cell images using graph cut-based algorithm. First, the A* channel in CIE LAB color space is extracted for contrast enhancement. Then, in order to effectively extract cytoplasm boundaries when image histograms present non-bimodal distribution, Otsu multiple thresholding is performed on the contrast enhanced image to generate initial segments, based on which the segments are refined by the multi-way graph cut method. We use 21 cervical cell images with non-ideal imaging condition to evaluate cytoplasm segmentation performance. The proposed method achieved a 93% accuracy which outperformed state-of-the-art works.

  2. Vision 20/20: Perspectives on automated image segmentation for radiotherapy

    SciTech Connect

    Sharp, Gregory Fritscher, Karl D.; Shusharina, Nadya; Pekar, Vladimir; Peroni, Marta; Veeraraghavan, Harini; Yang, Jinzhong

    2014-05-15

    Due to rapid advances in radiation therapy (RT), especially image guidance and treatment adaptation, a fast and accurate segmentation of medical images is a very important part of the treatment. Manual delineation of target volumes and organs at risk is still the standard routine for most clinics, even though it is time consuming and prone to intra- and interobserver variations. Automated segmentation methods seek to reduce delineation workload and unify the organ boundary definition. In this paper, the authors review the current autosegmentation methods particularly relevant for applications in RT. The authors outline the methods’ strengths and limitations and propose strategies that could lead to wider acceptance of autosegmentation in routine clinical practice. The authors conclude that currently, autosegmentation technology in RT planning is an efficient tool for the clinicians to provide them with a good starting point for review and adjustment. Modern hardware platforms including GPUs allow most of the autosegmentation tasks to be done in a range of a few minutes. In the nearest future, improvements in CT-based autosegmentation tools will be achieved through standardization of imaging and contouring protocols. In the longer term, the authors expect a wider use of multimodality approaches and better understanding of correlation of imaging with biology and pathology.

  3. Vision 20/20: perspectives on automated image segmentation for radiotherapy.

    PubMed

    Sharp, Gregory; Fritscher, Karl D; Pekar, Vladimir; Peroni, Marta; Shusharina, Nadya; Veeraraghavan, Harini; Yang, Jinzhong

    2014-05-01

    Due to rapid advances in radiation therapy (RT), especially image guidance and treatment adaptation, a fast and accurate segmentation of medical images is a very important part of the treatment. Manual delineation of target volumes and organs at risk is still the standard routine for most clinics, even though it is time consuming and prone to intra- and interobserver variations. Automated segmentation methods seek to reduce delineation workload and unify the organ boundary definition. In this paper, the authors review the current autosegmentation methods particularly relevant for applications in RT. The authors outline the methods' strengths and limitations and propose strategies that could lead to wider acceptance of autosegmentation in routine clinical practice. The authors conclude that currently, autosegmentation technology in RT planning is an efficient tool for the clinicians to provide them with a good starting point for review and adjustment. Modern hardware platforms including GPUs allow most of the autosegmentation tasks to be done in a range of a few minutes. In the nearest future, improvements in CT-based autosegmentation tools will be achieved through standardization of imaging and contouring protocols. In the longer term, the authors expect a wider use of multimodality approaches and better understanding of correlation of imaging with biology and pathology.

  4. Segmentation of laser range image for pipe anomaly detection

    NASA Astrophysics Data System (ADS)

    Liu, Zheng; Krys, Dennis

    2010-04-01

    Laser-based scanning can provide a precise surface profile. It has been widely applied to the inspection of pipe inner walls and is often used along with other types of sensors, like sonar and close-circuit television (CCTV). These measurements can be used for pipe deterioration modeling and condition assessment. Geometric information needs to be extracted to characterize anomalies in the pipe profile. Since the laser scanning measures the distance, segmentation with a threshold is a straightforward way to isolate the anomalies. However, threshold with a fixed distance value does not work well for the laser range image due to the intensity inhomogeneity, which is caused the uncontrollable factors during the inspection. Thus, a local binary fitting (LBF) active contour model is employed in this work to process the laser range image and an image phase congruency algorithm is adopted to provide the initial contour as required by the LBF method. The combination of these two approaches can successfully detect the anomalies from a laser range image.

  5. Segmentation of blurred objects using wavelet transform: application to x-ray images

    NASA Astrophysics Data System (ADS)

    Barat, Cecile S.; Ducottet, Christophe; Bilgot, Anne; Desbat, Laurent

    2004-02-01

    First, we present a wavelet-based algorithm for edge detection and characterization, which is an adaptation of Mallat and Hwang"s method. This algorithm relies on a modelization of contours as smoothed singularities of three particular types (transitions, peaks and lines). On the one hand, it allows to detect and locate edges at an adapted scale. On the other hand, it is able to identify the type of each detected edge point and to measure its amplitude and smoothing size. The latter parameters represent respectively the contrast and the smoothness level of the edge point. Second, we explain that this method has been integrated in a 3D bone surface reconstruction algorithm designed for computer-assisted and minimal invasive orthopaedic surgery. In order to decrease the dose to the patient and to obtain rapidly a 3D image, we propose to identify a bone shape from few X-ray projections by using statistical shape models registered to segmented X-ray projections. We apply this approach to pedicle screw insertion (scoliosis, fractures...) where ten to forty percent of the screws are known to be misplaced. In this context, the proposed edge detection algorithm allows to overcome the major problem of vertebrae segmentation in the X-ray images.

  6. Adaptive Optics Imaging in Laser Pointer Maculopathy.

    PubMed

    Sheyman, Alan T; Nesper, Peter L; Fawzi, Amani A; Jampol, Lee M

    2016-08-01

    The authors report multimodal imaging including adaptive optics scanning laser ophthalmoscopy (AOSLO) (Apaeros retinal image system AOSLO prototype; Boston Micromachines Corporation, Boston, MA) in a case of previously diagnosed unilateral acute idiopathic maculopathy (UAIM) that demonstrated features of laser pointer maculopathy. The authors also show the adaptive optics images of a laser pointer maculopathy case previously reported. A 15-year-old girl was referred for the evaluation of a maculopathy suspected to be UAIM. The authors reviewed the patient's history and obtained fluorescein angiography, autofluorescence, optical coherence tomography, infrared reflectance, and AOSLO. The time course of disease and clinical examination did not fit with UAIM, but the linear pattern of lesions was suspicious for self-inflicted laser pointer injury. This was confirmed on subsequent questioning of the patient. The presence of linear lesions in the macula that are best highlighted with multimodal imaging techniques should alert the physician to the possibility of laser pointer injury. AOSLO further characterizes photoreceptor damage in this condition. [Ophthalmic Surg Lasers Imaging Retina. 2016;47:782-785.]. PMID:27548458

  7. Adaptive Optics Imaging in Laser Pointer Maculopathy.

    PubMed

    Sheyman, Alan T; Nesper, Peter L; Fawzi, Amani A; Jampol, Lee M

    2016-08-01

    The authors report multimodal imaging including adaptive optics scanning laser ophthalmoscopy (AOSLO) (Apaeros retinal image system AOSLO prototype; Boston Micromachines Corporation, Boston, MA) in a case of previously diagnosed unilateral acute idiopathic maculopathy (UAIM) that demonstrated features of laser pointer maculopathy. The authors also show the adaptive optics images of a laser pointer maculopathy case previously reported. A 15-year-old girl was referred for the evaluation of a maculopathy suspected to be UAIM. The authors reviewed the patient's history and obtained fluorescein angiography, autofluorescence, optical coherence tomography, infrared reflectance, and AOSLO. The time course of disease and clinical examination did not fit with UAIM, but the linear pattern of lesions was suspicious for self-inflicted laser pointer injury. This was confirmed on subsequent questioning of the patient. The presence of linear lesions in the macula that are best highlighted with multimodal imaging techniques should alert the physician to the possibility of laser pointer injury. AOSLO further characterizes photoreceptor damage in this condition. [Ophthalmic Surg Lasers Imaging Retina. 2016;47:782-785.].

  8. Design of multi-spectral images real-time segmentation system

    NASA Astrophysics Data System (ADS)

    Zhai, Bo; Qu, Youshan; Han, Yameng; Zhou, Jiang

    2015-02-01

    In order to realize the real-time segmentation processing of multi spectral images in practice, a real-time multi-spectral images segmentation system composed of four TMS320C6455 DSPs, two Virtex-4 - V4 XC4VLX80 - FPGAs and one Virtex-2 Pro - V2 Pro20 - FPGA is designed. Through the optimization of the cooperation processing of the multi DSP and multi FPGA, the parallel multitask processing ability of the DSPs and the effective interface coordination ability of the FPGAs in the built system are used fully. In order to display the processing ability, the segmentation test experiments of 10 spectra visible images, with 1024×1024, segmented by the Multi-scale Image Segmentation Method, was done in the built multi spectral images segment system. The experiment results prove that the multi DSP and multi FPGA multi spectral images processing system designed in this paper satisfies the real-time processing requirement in engineering practice.

  9. A New Feedback-Based Method for Parameter Adaptation in Image Processing Routines

    PubMed Central

    Mikut, Ralf; Reischl, Markus

    2016-01-01

    The parametrization of automatic image processing routines is time-consuming if a lot of image processing parameters are involved. An expert can tune parameters sequentially to get desired results. This may not be productive for applications with difficult image analysis tasks, e.g. when high noise and shading levels in an image are present or images vary in their characteristics due to different acquisition conditions. Parameters are required to be tuned simultaneously. We propose a framework to improve standard image segmentation methods by using feedback-based automatic parameter adaptation. Moreover, we compare algorithms by implementing them in a feedforward fashion and then adapting their parameters. This comparison is proposed to be evaluated by a benchmark data set that contains challenging image distortions in an increasing fashion. This promptly enables us to compare different standard image segmentation algorithms in a feedback vs. feedforward implementation by evaluating their segmentation quality and robustness. We also propose an efficient way of performing automatic image analysis when only abstract ground truth is present. Such a framework evaluates robustness of different image processing pipelines using a graded data set. This is useful for both end-users and experts. PMID:27764213

  10. A spectral k-means approach to bright-field cell image segmentation.

    PubMed

    Bradbury, Laura; Wan, Justin W L

    2010-01-01

    Automatic segmentation of bright-field cell images is important to cell biologists, but difficult to complete due to the complex nature of the cells in bright-field images (poor contrast, broken halo, missing boundaries). Standard approaches such as level set segmentation and active contours work well for fluorescent images where cells appear as round shape, but become less effective when optical artifacts such as halo exist in bright-field images. In this paper, we present a robust segmentation method which combines the spectral and k-means clustering techniques to locate cells in bright-field images. This approach models an image as a matrix graph and segment different regions of the image by computing the appropriate eigenvectors of the matrix graph and using the k-means algorithm. We illustrate the effectiveness of the method by segmentation results of C2C12 (muscle) cells in bright-field images. PMID:21096019

  11. Automatic lobar segmentation for diseased lungs using an anatomy-based priority knowledge in low-dose CT images

    NASA Astrophysics Data System (ADS)

    Park, Sang Joon; Kim, Jung Im; Goo, Jin Mo; Lee, Doohee

    2014-03-01

    Lung lobar segmentation in CT images is a challenging tasks because of the limitations in image quality inherent to CT image acquisition, especially low-dose CT for clinical routine environment. Besides, complex anatomy and abnormal lesions in the lung parenchyma makes segmentation difficult because contrast in CT images are determined by the differential absorption of X-rays by neighboring structures, such as tissue, vessel or several pathological conditions. Thus, we attempted to develop a robust segmentation technique for normal and diseased lung parenchyma. The images were obtained with low-dose chest CT using soft reconstruction kernel (Sensation 16, Siemens, Germany). Our PC-based in-house software segmented bronchial trees and lungs with intensity adaptive region-growing technique. Then the horizontal and oblique fissures were detected by using eigenvalues-ratio of the Hessian matrix in the lung regions which were excluded from airways and vessels. To enhance and recover the faithful 3-D fissure plane, our proposed fissure enhancing scheme were applied to the images. After finishing above steps, for careful smoothening of fissure planes, 3-D rolling-ball algorithm in xyz planes were performed. Results show that success rate of our proposed scheme was achieved up to 89.5% in the diseased lung parenchyma.

  12. AIDA: An Adaptive Image Deconvolution Algorithm

    NASA Astrophysics Data System (ADS)

    Hom, Erik; Marchis, F.; Lee, T. K.; Haase, S.; Agard, D. A.; Sedat, J. W.

    2007-10-01

    We recently described an adaptive image deconvolution algorithm (AIDA) for myopic deconvolution of multi-frame and three-dimensional data acquired through astronomical and microscopic imaging [Hom et al., J. Opt. Soc. Am. A 24, 1580 (2007)]. AIDA is a reimplementation and extension of the MISTRAL method developed by Mugnier and co-workers and shown to yield object reconstructions with excellent edge preservation and photometric precision [J. Opt. Soc. Am. A 21, 1841 (2004)]. Written in Numerical Python with calls to a robust constrained conjugate gradient method, AIDA has significantly improved run times over the original MISTRAL implementation. AIDA includes a scheme to automatically balance maximum-likelihood estimation and object regularization, which significantly decreases the amount of time and effort needed to generate satisfactory reconstructions. Here, we present a gallery of results demonstrating the effectiveness of AIDA in processing planetary science images acquired using adaptive-optics systems. Offered as an open-source alternative to MISTRAL, AIDA is available for download and further development at: http://msg.ucsf.edu/AIDA. This work was supported in part by the W. M. Keck Observatory, the National Institutes of Health, NASA, the National Science Foundation Science and Technology Center for Adaptive Optics at UC-Santa Cruz, and the Howard Hughes Medical Institute.

  13. Image segmentation of nanoscale Zernike phase contrast X-ray computed tomography images

    SciTech Connect

    Kumar, Arjun S.; Mandal, Pratiti; Zhang, Yongjie; Litster, Shawn

    2015-05-14

    Zernike phase contrast is a useful technique for nanoscale X-ray computed tomography (CT) imaging of materials with a low X-ray absorption coefficient. It enhances the image contrast by phase shifting X-ray waves to create changes in amplitude. However, it creates artifacts that hinder the use of traditional image segmentation techniques. We propose an image restoration method that models the X-ray phase contrast optics and the three-dimensional image reconstruction method. We generate artifact-free images through an optimization problem that inverts this model. Though similar approaches have been used for Zernike phase contrast in visible light microscopy, this optimization employs an effective edge detection method tailored to handle Zernike phase contrast artifacts. We characterize this optics-based restoration method by removing the artifacts in and thresholding multiple Zernike phase contrast X-ray CT images to produce segmented results that are consistent with the physical specimens. We quantitatively evaluate and compare our method to other segmentation techniques to demonstrate its high accuracy.

  14. Improving the accuracy of volumetric segmentation using pre-processing boundary detection and image reconstruction.

    PubMed

    Archibald, Rick; Hu, Jiuxiang; Gelb, Anne; Farin, Gerald

    2004-04-01

    The concentration edge -detection and Gegenbauer image-reconstruction methods were previously shown to improve the quality of segmentation in magnetic resonance imaging. In this study, these methods are utilized as a pre-processing step to the Weibull E-SD field segmentation. It is demonstrated that the combination of the concentration edge detection and Gegenbauer reconstruction method improves the accuracy of segmentation for the simulated test data and real magnetic resonance images used in this study. PMID:15376580

  15. Causal Markov random field for brain MR image segmentation.

    PubMed

    Razlighi, Qolamreza R; Orekhov, Aleksey; Laine, Andrew; Stern, Yaakov

    2012-01-01

    We propose a new Bayesian classifier, based on the recently introduced causal Markov random field (MRF) model, Quadrilateral MRF (QMRF). We use a second order inhomogeneous anisotropic QMRF to model the prior and likelihood probabilities in the maximum a posteriori (MAP) classifier, named here as MAP-QMRF. The joint distribution of QMRF is given in terms of the product of two dimensional clique distributions existing in its neighboring structure. 20 manually labeled human brain MR images are used to train and assess the MAP-QMRF classifier using the jackknife validation method. Comparing the results of the proposed classifier and FreeSurfer on the Dice overlap measure shows an average gain of 1.8%. We have performed a power analysis to demonstrate that this increase in segmentation accuracy substantially reduces the number of samples required to detect a 5% change in volume of a brain region.

  16. CAUSAL MARKOV RANDOM FIELD FOR BRAIN MR IMAGE SEGMENTATION

    PubMed Central

    Razlighi, Qolamreza R.; Orekhov, Aleksey; Laine, Andrew; Stern, Yaakov

    2013-01-01

    We propose a new Bayesian classifier, based on the recently introduced causal Markov random field (MRF) model, Quadrilateral MRF (QMRF). We use a second order inhomogeneous anisotropic QMRF to model the prior and likelihood probabilities in the maximum a posteriori (MAP) classifier, named here as MAP-QMRF. The joint distribution of QMRF is given in terms of the product of two dimensional clique distributions existing in its neighboring structure. 20 manually labeled human brain MR images are used to train and assess the MAP-QMRF classifier using the jackknife validation method. Comparing the results of the proposed classifier and FreeSurfer on the Dice overlap measure shows an average gain of 1.8%. We have performed a power analysis to demonstrate that this increase in segmentation accuracy substantially reduces the number of samples required to detect a 5% change in volume of a brain region. PMID:23366607

  17. Self-adaptive iris image acquisition system

    NASA Astrophysics Data System (ADS)

    Dong, Wenbo; Sun, Zhenan; Tan, Tieniu; Qiu, Xianchao

    2008-03-01

    Iris image acquisition is the fundamental step of the iris recognition, but capturing high-resolution iris images in real-time is very difficult. The most common systems have small capture volume and demand users to fully cooperate with machines, which has become the bottleneck of iris recognition's application. In this paper, we aim at building an active iris image acquiring system which is self-adaptive to users. Two low resolution cameras are co-located in a pan-tilt-unit (PTU), for face and iris image acquisition respectively. Once the face camera detects face region in real-time video, the system controls the PTU to move towards the eye region and automatically zooms, until the iris camera captures an clear iris image for recognition. Compared with other similar works, our contribution is that we use low-resolution cameras, which can transmit ima