WorldWideScience

Sample records for automatic image segmentation

  1. Automatic segmentation of bladder in CT images

    Institute of Scientific and Technical Information of China (English)

    Feng SHI; Jie YANG; Yue-min ZHU

    2009-01-01

    Segmentation of the bladder in computerized tomography (CT) images is an important step in radiation therapy planning of prostate cancer. We present a new segmentation scheme to automatically delineate the bladder contour in CT images with three major steps. First, we use the mean shift algorithm to obtain a clustered image containing the rough contour of the bladder, which is then extracted in the second step by applying a region-growing algorithm with the initial seed point selected from a line-by-line scanning process. The third step is to refine the bladder contour more accurately using the rolling-ball algorithm. These steps are then extended to segment the bladder volume in a slice-by-slice manner. The obtained results were compared to manual segmentation by radiation oncologists. The average values of sensitivity, specificity, positive predictive value, negative predictive value, and Hausdorff distance are 86.5%, 96.3%, 90.5%, 96.5%, and 2.8 pixels, respectively. The results show that the bladder can be accurately segmented.

  2. Automatic Vessel Segmentation on Retinal Images

    Institute of Scientific and Technical Information of China (English)

    Chun-Yuan Yu; Chia-Jen Chang; Yen-Ju Yao; Shyr-Shen Yu

    2014-01-01

    Several features of retinal vessels can be used to monitor the progression of diseases. Changes in vascular structures, for example, vessel caliber, branching angle, and tortuosity, are portents of many diseases such as diabetic retinopathy and arterial hyper-tension. This paper proposes an automatic retinal vessel segmentation method based on morphological closing and multi-scale line detection. First, an illumination correction is performed on the green band retinal image. Next, the morphological closing and subtraction processing are applied to obtain the crude retinal vessel image. Then, the multi-scale line detection is used to fine the vessel image. Finally, the binary vasculature is extracted by the Otsu algorithm. In this paper, for improving the drawbacks of multi-scale line detection, only the line detectors at 4 scales are used. The experimental results show that the accuracy is 0.939 for DRIVE (digital retinal images for vessel extraction) retinal database, which is much better than other methods.

  3. Automatic segmentation of mammogram and tomosynthesis images

    Science.gov (United States)

    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

  4. AUTOMATIC MULTILEVEL IMAGE SEGMENTATION BASED ON FUZZY REASONING

    Directory of Open Access Journals (Sweden)

    Liang Tang

    2011-05-01

    Full Text Available An automatic multilevel image segmentation method based on sup-star fuzzy reasoning (SSFR is presented. Using the well-known sup-star fuzzy reasoning technique, the proposed algorithm combines the global statistical information implied in the histogram with the local information represented by the fuzzy sets of gray-levels, and aggregates all the gray-levels into several classes characterized by the local maximum values of the histogram. The presented method has the merits of determining the number of the segmentation classes automatically, and avoiding to calculating thresholds of segmentation. Emulating and real image segmentation experiments demonstrate that the SSFR is effective.

  5. FULLY AUTOMATIC FRAMEWORK FOR SEGMENTATION OF BRAIN MRI IMAGE

    Institute of Scientific and Technical Information of China (English)

    Lin Pan; Zheng Chongxun; Yang Yong; Gu Jianwen

    2005-01-01

    Objective To propose an automatic framework for segmentation of brain image in this paper. Methods The brain MRI image segmentation framework consists of three-step segmentation procedures. First, Non-brain structures removal by level set method. Then, the non-uniformity correction method is based on computing estimates of tissue intensity variation. Finally, it uses a statistical model based on Markov random filed for MRI brain image segmentation. The brain tissue can be classified into cerebrospinal fluid, white matter and gray matter. Results To evaluate the proposed our method, we performed two sets of experiments, one on simulated MR and another on real MR brain data. Conclusion The efficacy of the brain MRI image segmentation framework has been demonstrated by the extensive experiments. In the future, we are also planning on a large-scale clinical evaluation of this segmentation framework.

  6. Automatic Image Segmentation based on MRF-MAP

    CERN Document Server

    Qiyang, Zhao

    2012-01-01

    Solving the Maximum a Posteriori on Markov Random Field, MRF-MAP, is a prevailing method in recent interactive image segmentation tools. Although mathematically explicit in its computational targets, and impressive for the segmentation quality, MRF-MAP is hard to accomplish without the interactive information from users. So it is rarely adopted in the automatic style up to today. In this paper, we present an automatic image segmentation algorithm, NegCut, based on the approximation to MRF-MAP. First we prove MRF-MAP is NP-hard when the probabilistic models are unknown, and then present an approximation function in the form of minimum cuts on graphs with negative weights. Finally, the binary segmentation is taken from the largest eigenvector of the target matrix, with a tuned version of the Lanczos eigensolver. It is shown competitive at the segmentation quality in our experiments.

  7. Automatic segmentation of seven retinal layers in SDOCT images congruent with expert manual segmentation.

    Science.gov (United States)

    Chiu, Stephanie J; Li, Xiao T; Nicholas, Peter; Toth, Cynthia A; Izatt, Joseph A; Farsiu, Sina

    2010-08-30

    Segmentation of anatomical and pathological structures in ophthalmic images is crucial for the diagnosis and study of ocular diseases. However, manual segmentation is often a time-consuming and subjective process. This paper presents an automatic approach for segmenting retinal layers in Spectral Domain Optical Coherence Tomography images using graph theory and dynamic programming. Results show that this method accurately segments eight retinal layer boundaries in normal adult eyes more closely to an expert grader as compared to a second expert grader.

  8. Automatic Image Segmentation Using Active Contours with Univariate Marginal Distribution

    Directory of Open Access Journals (Sweden)

    I. Cruz-Aceves

    2013-01-01

    Full Text Available This paper presents a novel automatic image segmentation method based on the theory of active contour models and estimation of distribution algorithms. The proposed method uses the univariate marginal distribution model to infer statistical dependencies between the control points on different active contours. These contours have been generated through an alignment process of reference shape priors, in order to increase the exploration and exploitation capabilities regarding different interactive segmentation techniques. This proposed method is applied in the segmentation of the hollow core in microscopic images of photonic crystal fibers and it is also used to segment the human heart and ventricular areas from datasets of computed tomography and magnetic resonance images, respectively. Moreover, to evaluate the performance of the medical image segmentations compared to regions outlined by experts, a set of similarity measures has been adopted. The experimental results suggest that the proposed image segmentation method outperforms the traditional active contour model and the interactive Tseng method in terms of segmentation accuracy and stability.

  9. Automatic character detection and segmentation in natural scene images

    Institute of Scientific and Technical Information of China (English)

    ZHU Kai-hua; QI Fei-hu; JIANG Ren-jie; XU Li

    2007-01-01

    We present a robust connected-component (CC) based method for automatic detection and segmentation of text in real-scene images. This technique can be applied in robot vision, sign recognition, meeting processing and video indexing. First, a Non-Linear Niblack method (NLNiblack) is proposed to decompose the image into candidate CCs. Then, all these CCs are fed into a cascade of classifiers trained by Adaboost algorithm. Each classifier in the cascade responds to one feature of the CC. Proposed here are 12 novel features which are insensitive to noise, scale, text orientation and text language. The classifier cascade allows non-text CCs of the image to be rapidly discarded while more computation is spent on promising text-like CCs. The CCs passing through the cascade are considered as text components and are used to form the segmentation result. A prototype system was built,with experimental results proving the effectiveness and efficiency of the proposed method.

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

    Science.gov (United States)

    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.

  11. Automatic segmentation of trophectoderm in microscopic images of human blastocysts.

    Science.gov (United States)

    Singh, Amarjot; Au, Jason; Saeedi, Parvaneh; Havelock, Jon

    2015-01-01

    Accurate assessment of embryos viability is an extremely important task in the optimization of in vitro fertilization treatment outcome. One of the common ways of assessing the quality of a human embryo is grading it on its fifth day of development based on morphological quality of its three main components (Trophectoderm, Inner Cell Mass, and the level of expansion or the thickness of its Zona Pellucida). In this study, we propose a fully automatic method for segmentation and measurement of TE region of blastocysts (day-5 human embryos). Here, we eliminate the inhomogeneities of the blastocysts surface using the Retinex theory and further apply a level-set algorithm to segment the TE regions. We have tested our method on a dataset of 85 images and have been able to achieve a segmentation accuracy of 84.6% for grade A, 89.0% for grade B, and 91.7% for grade C embryos.

  12. Deformable meshes for medical image segmentation accurate automatic segmentation of anatomical structures

    CERN Document Server

    Kainmueller, Dagmar

    2014-01-01

    ? Segmentation of anatomical structures in medical image data is an essential task in clinical practice. Dagmar Kainmueller introduces methods for accurate fully automatic segmentation of anatomical structures in 3D medical image data. The author's core methodological contribution is a novel deformation model that overcomes limitations of state-of-the-art Deformable Surface approaches, hence allowing for accurate segmentation of tip- and ridge-shaped features of anatomical structures. As for practical contributions, she proposes application-specific segmentation pipelines for a range of anatom

  13. Embryonic Heart Morphogenesis from Confocal Microscopy Imaging and Automatic Segmentation

    Directory of Open Access Journals (Sweden)

    Hongda Mao

    2013-01-01

    Full Text Available Embryonic heart morphogenesis (EHM is a complex and dynamic process where the heart transforms from a single tube into a four-chambered pump. This process is of great biological and clinical interest but is still poorly understood for two main reasons. On the one hand, the existing imaging modalities for investigating EHM suffered from either limited penetration depth or limited spatial resolution. On the other hand, current works typically adopted manual segmentation, which was tedious, subjective, and time consuming considering the complexity of developing heart geometry and the large size of images. In this paper, we propose to utilize confocal microscopy imaging with tissue optical immersion clearing technique to image the heart at different stages of development for EHM study. The imaging method is able to produce high spatial resolution images and achieve large penetration depth at the same time. Furthermore, we propose a novel convex active contour model for automatic image segmentation. The model has the ability to deal with intensity fall-off in depth which is characterized by confocal microscopy images. We acquired the images of embryonic quail hearts from day 6 to day 14 of incubation for EHM study. The experimental results were promising and provided us with an insight view of early heart growth pattern and also paved the road for data-driven heart growth modeling.

  14. Automatic segmentation of brain images: selection of region extraction methods

    Science.gov (United States)

    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.

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

    Science.gov (United States)

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

    2016-01-01

    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

  16. Automatic segmentation of HeLa cell images

    CERN Document Server

    Urban, Jan

    2011-01-01

    In this work, the possibilities for segmentation of cells from their background and each other in digital image were tested, combined and improoved. Lot of images with young, adult and mixture cells were able to prove the quality of described algorithms. Proper segmentation is one of the main task of image analysis and steps order differ from work to work, depending on input images. Reply for biologicaly given question was looking for in this work, including filtration, details emphasizing, segmentation and sphericity computing. Order of algorithms and way to searching for them was also described. Some questions and ideas for further work were mentioned in the conclusion part.

  17. Automatic Scheme for Fused Medical Image Segmentation with Nonsubsampled Contourlet Transform

    Directory of Open Access Journals (Sweden)

    Ch.Hima Bindu

    2012-10-01

    Full Text Available Medical image segmentation has become an essential technique in clinical and research- oriented applications. Because manual segmentation methods are tedious, and semi-automatic segmentation lacks the flexibility, fully-automatic methods have become the preferred type of medical image segmentation. This work proposes a robust fully automatic segmentation scheme based on the modified contouring technique. The entire scheme consists of three stages. In the first stage, the Nonsubsampled Contourlet Transform (NSCT of image is computed. This is followed by the fusion of coefficients using fusion method. For that fused image local threshold is computed. This is followed by the second stage in which the initial points are determined by computation of global threshold. Finally, in the third stage, searching procedure is started from each initial point to obtain closed-loop contours. The whole process is fully automatic. This avoids the disadvantages of semi-automatic schemes such as manually selecting the initial contours and points.

  18. Robust automatic segmentation of corneal layer boundaries in SDOCT images using graph theory and dynamic programming.

    Science.gov (United States)

    Larocca, Francesco; Chiu, Stephanie J; McNabb, Ryan P; Kuo, Anthony N; Izatt, Joseph A; Farsiu, Sina

    2011-06-01

    Segmentation of anatomical structures in corneal images is crucial for the diagnosis and study of anterior segment diseases. However, manual segmentation is a time-consuming and subjective process. This paper presents an automatic approach for segmenting corneal layer boundaries in Spectral Domain Optical Coherence Tomography images using graph theory and dynamic programming. Our approach is robust to the low-SNR and different artifact types that can appear in clinical corneal images. We show that our method segments three corneal layer boundaries in normal adult eyes more accurately compared to an expert grader than a second grader-even in the presence of significant imaging outliers.

  19. Automatic tissue segmentation of breast biopsies imaged by QPI

    Science.gov (United States)

    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.

  20. [Automatic houses detection with color aerial images based on image segmentation].

    Science.gov (United States)

    He, Pei-Pei; Wan, You-Chuan; Jiang, Peng-Rui; Gao, Xian-Jun; Qin, Jia-Xin

    2014-07-01

    In order to achieve housing automatic detection from high-resolution aerial imagery, the present paper utilized the color information and spectral characteristics of the roofing material, with the image segmentation theory, to study the housing automatic detection method. Firstly, This method proposed in this paper converts the RGB color space to HIS color space, uses the characteristics of each component of the HIS color space and the spectral characteristics of the roofing material for image segmentation to isolate red tiled roofs and gray cement roof areas, and gets the initial segmentation housing areas by using the marked watershed algorithm. Then, region growing is conducted in the hue component with the seed segment sample by calculating the average hue in the marked region. Finally through the elimination of small spots and rectangular fitting process to obtain a clear outline of the housing area. Compared with the traditional pixel-based region segmentation algorithm, the improved method proposed in this paper based on segment growing is in a one-dimensional color space to reduce the computation without human intervention, and can cater to the geometry information of the neighborhood pixels so that the speed and accuracy of the algorithm has been significantly improved. A case study was conducted to apply the method proposed in this paper to high resolution aerial images, and the experimental results demonstrate that this method has a high precision and rational robustness.

  1. Automatic and hierarchical segmentation of the human skeleton in CT images.

    Science.gov (United States)

    Fu, Yabo; Liu, Shi; Li, Hui Harold; Yang, Deshan

    2017-02-14

    Accurate segmentation of each bone in human skeleton is useful in many medical disciplines. Results of bone segmentation could facilitate bone disease diagnosis and post-treatment assessment, and support planning and image guidance for many treatment modalities including surgery and radiation therapy. As a medium level medical image processing task, accurate bone segmentation can facilitate automatic internal organ segmentation by providing stable structural reference for inter- or intra-patient registration and internal organ localization. Even though bones in CT images can be visually observed with minimal difficulties due to high image contrast between bony structures and surrounding soft tissues, automatic and precise segmentation of individual bones is still challenging due to many limitations in the CT images. The common limitations include low signal-to-noise ratio, insufficient spatial resolution, and indistinguishable image intensity between spongy bones and soft tissues. In this study, a novel and automatic method is proposed to segment all major individual bones of human skeleton above the upper legs in the CT images based on an articulated skeleton atlas. The reported method is capable of automatically segmenting 62 major bones, including 24 vertebrae and 24 ribs, by traversing a hierarchical anatomical tree and by using both rigid and deformable image registration. Degrees of freedom of femora and humeri are modeled to support patients in different body and limb postures. Segmentation results are evaluated using Dice coefficient and point-to-surface error (PSE) against manual segmentation results as ground truth. The results suggest that the reported method can automatically segment and label human skeleton into detailed individual bones with high accuracy. The overall average Dice coefficient is 0.90. The average PSEs are 0.41 mm for mandible, 0.62 mm for cervical vertebrae, 0.92 mm for thoracic vertebrae, and 1.45 mm for pelvis bones.

  2. Automatic and hierarchical segmentation of the human skeleton in CT images

    Science.gov (United States)

    Fu, Yabo; Liu, Shi; Li, H. Harold; Yang, Deshan

    2017-04-01

    Accurate segmentation of each bone of the human skeleton is useful in many medical disciplines. The results of bone segmentation could facilitate bone disease diagnosis and post-treatment assessment, and support planning and image guidance for many treatment modalities including surgery and radiation therapy. As a medium level medical image processing task, accurate bone segmentation can facilitate automatic internal organ segmentation by providing stable structural reference for inter- or intra-patient registration and internal organ localization. Even though bones in CT images can be visually observed with minimal difficulty due to the high image contrast between the bony structures and surrounding soft tissues, automatic and precise segmentation of individual bones is still challenging due to the many limitations of the CT images. The common limitations include low signal-to-noise ratio, insufficient spatial resolution, and indistinguishable image intensity between spongy bones and soft tissues. In this study, a novel and automatic method is proposed to segment all the major individual bones of the human skeleton above the upper legs in CT images based on an articulated skeleton atlas. The reported method is capable of automatically segmenting 62 major bones, including 24 vertebrae and 24 ribs, by traversing a hierarchical anatomical tree and by using both rigid and deformable image registration. The degrees of freedom of femora and humeri are modeled to support patients in different body and limb postures. The segmentation results are evaluated using the Dice coefficient and point-to-surface error (PSE) against manual segmentation results as the ground-truth. The results suggest that the reported method can automatically segment and label the human skeleton into detailed individual bones with high accuracy. The overall average Dice coefficient is 0.90. The average PSEs are 0.41 mm for the mandible, 0.62 mm for cervical vertebrae, 0.92 mm for thoracic

  3. Automatic segmentation of the choroid in enhanced depth imaging optical coherence tomography images.

    Science.gov (United States)

    Tian, Jing; Marziliano, Pina; Baskaran, Mani; Tun, Tin Aung; Aung, Tin

    2013-03-01

    Enhanced Depth Imaging (EDI) optical coherence tomography (OCT) provides high-definition cross-sectional images of the choroid in vivo, and hence is used in many clinical studies. However, the quantification of the choroid depends on the manual labelings of two boundaries, Bruch's membrane and the choroidal-scleral interface. This labeling process is tedious and subjective of inter-observer differences, hence, automatic segmentation of the choroid layer is highly desirable. In this paper, we present a fast and accurate algorithm that could segment the choroid automatically. Bruch's membrane is detected by searching the pixel with the biggest gradient value above the retinal pigment epithelium (RPE) and the choroidal-scleral interface is delineated by finding the shortest path of the graph formed by valley pixels using Dijkstra's algorithm. The experiments comparing automatic segmentation results with the manual labelings are conducted on 45 EDI-OCT images and the average of Dice's Coefficient is 90.5%, which shows good consistency of the algorithm with the manual labelings. The processing time for each image is about 1.25 seconds.

  4. Level set method with automatic selective local statistics for brain tumor segmentation in MR images.

    Science.gov (United States)

    Thapaliya, Kiran; Pyun, Jae-Young; Park, Chun-Su; Kwon, Goo-Rak

    2013-01-01

    The level set approach is a powerful tool for segmenting images. This paper proposes a method for segmenting brain tumor images from MR images. A new signed pressure function (SPF) that can efficiently stop the contours at weak or blurred edges is introduced. The local statistics of the different objects present in the MR images were calculated. Using local statistics, the tumor objects were identified among different objects. In this level set method, the calculation of the parameters is a challenging task. The calculations of different parameters for different types of images were automatic. The basic thresholding value was updated and adjusted automatically for different MR images. This thresholding value was used to calculate the different parameters in the proposed algorithm. The proposed algorithm was tested on the magnetic resonance images of the brain for tumor segmentation and its performance was evaluated visually and quantitatively. Numerical experiments on some brain tumor images highlighted the efficiency and robustness of this method.

  5. Automatic airway wall segmentation and thickness measurement for long-range optical coherence tomography images.

    Science.gov (United States)

    Qi, Li; Huang, Shenghai; Heidari, Andrew E; Dai, Cuixia; Zhu, Jiang; Zhang, Xuping; Chen, Zhongping

    2015-12-28

    We present an automatic segmentation method for the delineation and quantitative thickness measurement of multiple layers in endoscopic airway optical coherence tomography (OCT) images. The boundaries of the mucosa and the sub-mucosa layers are accurately extracted using a graph-theory-based dynamic programming algorithm. The algorithm was tested with sheep airway OCT images. Quantitative thicknesses of the mucosal layers are obtained automatically for smoke inhalation injury experiments.

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

    Science.gov (United States)

    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.

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

    Science.gov (United States)

    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.

  8. Effective and fully automatic image segmentation using quantum entropy and pulse-coupled neural networks

    Science.gov (United States)

    Du, Songlin; Yan, Yaping; Ma, Yide

    2015-03-01

    A novel image segmentation algorithm which uses quantum entropy and pulse-coupled neural networks (PCNN) is proposed in this paper. Optimal iteration of the PCNN is one of the key factors affecting segmentation accuracy. We borrow quantum entropy from quantum information to act as a criterion in determining optimal iteration of the PCNN. Optimal iteration is captured while total quantum entropy of the segments reaches a maximum. Moreover, compared with other PCNN-employed algorithms, the proposed algorithm works without any manual intervention, because all parameters of the PCNN are set automatically. Experimental results prove that the proposed method can achieve much lower probabilities of error segmentation than other PCNN-based image segmentation algorithms, and this suggests that higher image segmentation quality is achieved by the proposed method.

  9. Automatic segmentation of seeds and fluoroscope tracking (FTRAC) fiducial in prostate brachytherapy x-ray images

    Science.gov (United States)

    Kuo, Nathanael; Lee, Junghoon; Deguet, Anton; Song, Danny; Burdette, E. Clif; Prince, Jerry

    2010-02-01

    C-arm X-ray fluoroscopy-based radioactive seed localization for intraoperative dosimetry of prostate brachytherapy is an active area of research. The fluoroscopy tracking (FTRAC) fiducial is an image-based tracking device composed of radio-opaque BBs, lines, and ellipses that provides an effective means for pose estimation so that three-dimensional reconstruction of the implanted seeds from multiple X-ray images can be related to the ultrasound-computed prostate volume. Both the FTRAC features and the brachytherapy seeds must be segmented quickly and accurately during the surgery, but current segmentation algorithms are inhibitory in the operating room (OR). The first reason is that current algorithms require operators to manually select a region of interest (ROI), preventing automatic pipelining from image acquisition to seed reconstruction. Secondly, these algorithms fail often, requiring operators to manually correct the errors. We propose a fast and effective ROI-free automatic FTRAC and seed segmentation algorithm to minimize such human intervention. The proposed algorithm exploits recent image processing tools to make seed reconstruction as easy and convenient as possible. Preliminary results on 162 patient images show this algorithm to be fast, effective, and accurate for all features to be segmented. With near perfect success rates and subpixel differences to manual segmentation, our automatic FTRAC and seed segmentation algorithm shows promising results to save crucial time in the OR while reducing errors.

  10. Color Image Segmentation Based on Different Color Space Models Using Automatic GrabCut

    Directory of Open Access Journals (Sweden)

    Dina Khattab

    2014-01-01

    Full Text Available This paper presents a comparative study using different color spaces to evaluate the performance of color image segmentation using the automatic GrabCut technique. GrabCut is considered as one of the semiautomatic image segmentation techniques, since it requires user interaction for the initialization of the segmentation process. The automation of the GrabCut technique is proposed as a modification of the original semiautomatic one in order to eliminate the user interaction. The automatic GrabCut utilizes the unsupervised Orchard and Bouman clustering technique for the initialization phase. Comparisons with the original GrabCut show the efficiency of the proposed automatic technique in terms of segmentation, quality, and accuracy. As no explicit color space is recommended for every segmentation problem, automatic GrabCut is applied with RGB, HSV, CMY, XYZ, and YUV color spaces. The comparative study and experimental results using different color images show that RGB color space is the best color space representation for the set of the images used.

  11. A method for automatic liver segmentation from multi-phase contrast-enhanced CT images

    Science.gov (United States)

    Yuan, Rong; Luo, Ming; Wang, Shaofa; Wang, Luyao; Xie, Qingguo

    2014-03-01

    Liver segmentation is a basic and indispensable function in systems of computer aided liver surgery for volume calculation, operation designing and risk evaluation. Traditional manual segmentation is very time consuming because of the complicated contours of liver and the big amount of images. For increasing the efficiency of the clinical work, in this paper, a fully-automatic method was proposed to segment the liver from multi-phase contrast-enhanced computed tomography (CT) images. As an advanced region growing method, we applied various pre- and post-processing to get better segmentation from the different phases. Fifteen sets of clinical abdomens CT images of five patients were segmented by our algorithm, and the results were acceptable and evaluated by an experienced surgeon. The running-time is about 30 seconds for a single-phase data which includes more than 200 slices.

  12. Review of automatic segmentation methods of multiple sclerosis white matter lesions on conventional magnetic resonance imaging.

    Science.gov (United States)

    García-Lorenzo, Daniel; Francis, Simon; Narayanan, Sridar; Arnold, Douglas L; Collins, D Louis

    2013-01-01

    Magnetic resonance (MR) imaging is often used to characterize and quantify multiple sclerosis (MS) lesions in the brain and spinal cord. The number and volume of lesions have been used to evaluate MS disease burden, to track the progression of the disease and to evaluate the effect of new pharmaceuticals in clinical trials. Accurate identification of MS lesions in MR images is extremely difficult due to variability in lesion location, size and shape in addition to anatomical variability between subjects. Since manual segmentation requires expert knowledge, is time consuming and is subject to intra- and inter-expert variability, many methods have been proposed to automatically segment lesions. The objective of this study was to carry out a systematic review of the literature to evaluate the state of the art in automated multiple sclerosis lesion segmentation. From 1240 hits found initially with PubMed and Google scholar, our selection criteria identified 80 papers that described an automatic lesion segmentation procedure applied to MS. Only 47 of these included quantitative validation with at least one realistic image. In this paper, we describe the complexity of lesion segmentation, classify the automatic MS lesion segmentation methods found, and review the validation methods applied in each of the papers reviewed. Although many segmentation solutions have been proposed, including some with promising results using MRI data obtained on small groups of patients, no single method is widely employed due to performance issues related to the high variability of MS lesion appearance and differences in image acquisition. The challenge remains to provide segmentation techniques that work in all cases regardless of the type of MS, duration of the disease, or MRI protocol, and this within a comprehensive, standardized validation framework. MS lesion segmentation remains an open problem.

  13. A comparative study of automatic image segmentation algorithms for target tracking in MR-IGRT.

    Science.gov (United States)

    Feng, Yuan; Kawrakow, Iwan; Olsen, Jeff; Parikh, Parag J; Noel, Camille; Wooten, Omar; Du, Dongsu; Mutic, Sasa; Hu, Yanle

    2016-03-08

    On-board magnetic resonance (MR) image guidance during radiation therapy offers the potential for more accurate treatment delivery. To utilize the real-time image information, a crucial prerequisite is the ability to successfully segment and track regions of interest (ROI). The purpose of this work is to evaluate the performance of different segmentation algorithms using motion images (4 frames per second) acquired using a MR image-guided radiotherapy (MR-IGRT) system. Manual con-tours of the kidney, bladder, duodenum, and a liver tumor by an experienced radiation oncologist were used as the ground truth for performance evaluation. Besides the manual segmentation, images were automatically segmented using thresholding, fuzzy k-means (FKM), k-harmonic means (KHM), and reaction-diffusion level set evolution (RD-LSE) algorithms, as well as the tissue tracking algorithm provided by the ViewRay treatment planning and delivery system (VR-TPDS). The performance of the five algorithms was evaluated quantitatively by comparing with the manual segmentation using the Dice coefficient and target registration error (TRE) measured as the distance between the centroid of the manual ROI and the centroid of the automatically segmented ROI. All methods were able to successfully segment the bladder and the kidney, but only FKM, KHM, and VR-TPDS were able to segment the liver tumor and the duodenum. The performance of the thresholding, FKM, KHM, and RD-LSE algorithms degraded as the local image contrast decreased, whereas the performance of the VP-TPDS method was nearly independent of local image contrast due to the reference registration algorithm. For segmenting high-contrast images (i.e., kidney), the thresholding method provided the best speed (< 1 ms) with a satisfying accuracy (Dice = 0.95). When the image contrast was low, the VR-TPDS method had the best automatic contour. Results suggest an image quality determination procedure before segmentation and a combination of

  14. Correlation analysis-based image segmentation approach for automatic agriculture vehicle

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

    It is important to segment image correctly to extract guidance information for automatic agriculture vehicle. If we can make the computer know where the crops are, we can extract the guidance line easily. Images were divided into some rectangle small windows, then a pair of 1-D arrays was constructed in each small windows. The correlation coefficients of every small window constructed the features to segment images. The results showed that correlation analysis is a potential approach for processing complex farmland for guidance system, and more correlation analysis methods must be researched.

  15. An automatic system for segmentation, matching, anatomical labeling and measurement of airways from CT images

    DEFF Research Database (Denmark)

    Petersen, Jens; Feragen, Aasa; Owen, Megan

    Purpose: Assessing airway dimensions and attenuation from CT images is useful in the study of diseases affecting the airways such as Chronic Obstructive Pulmonary Disease (COPD). Measurements can be compared between patients and over time if specific airway segments can be identified. However......, manually finding these segments and performing such measurements is very time consuming. The purpose of the developed and validated system is to enable such measurements using automatic segmentations of the airway interior and exterior wall surfaces in three dimensions, anatomical branch labeling of all...... is used to match specific airway segments in multiple images of the same subject. The anatomical names of all segmental branches are assigned based on distances to a training set of expert labeled trees. Distances are measured in a geometric tree-space, incorporating both topology and centerline shape...

  16. Evaluation of an automatic brain segmentation method developed for neonates on adult MR brain images

    Science.gov (United States)

    Moeskops, Pim; Viergever, Max A.; Benders, Manon J. N. L.; Išgum, Ivana

    2015-03-01

    Automatic brain tissue segmentation is of clinical relevance in images acquired at all ages. The literature presents a clear distinction between methods developed for MR images of infants, and methods developed for images of adults. The aim of this work is to evaluate a method developed for neonatal images in the segmentation of adult images. The evaluated method employs supervised voxel classification in subsequent stages, exploiting spatial and intensity information. Evaluation was performed using images available within the MRBrainS13 challenge. The obtained average Dice coefficients were 85.77% for grey matter, 88.66% for white matter, 81.08% for cerebrospinal fluid, 95.65% for cerebrum, and 96.92% for intracranial cavity, currently resulting in the best overall ranking. The possibility of applying the same method to neonatal as well as adult images can be of great value in cross-sectional studies that include a wide age range.

  17. Automatic lung tumor segmentation on PET/CT images using fuzzy Markov random field model.

    Science.gov (United States)

    Guo, Yu; Feng, Yuanming; Sun, Jian; Zhang, Ning; Lin, Wang; Sa, Yu; Wang, Ping

    2014-01-01

    The combination of positron emission tomography (PET) and CT images provides complementary functional and anatomical information of human tissues and it has been used for better tumor volume definition of lung cancer. This paper proposed a robust method for automatic lung tumor segmentation on PET/CT images. The new method is based on fuzzy Markov random field (MRF) model. The combination of PET and CT image information is achieved by using a proper joint posterior probability distribution of observed features in the fuzzy MRF model which performs better than the commonly used Gaussian joint distribution. In this study, the PET and CT simulation images of 7 non-small cell lung cancer (NSCLC) patients were used to evaluate the proposed method. Tumor segmentations with the proposed method and manual method by an experienced radiation oncologist on the fused images were performed, respectively. Segmentation results obtained with the two methods were similar and Dice's similarity coefficient (DSC) was 0.85 ± 0.013. It has been shown that effective and automatic segmentations can be achieved with this method for lung tumors which locate near other organs with similar intensities in PET and CT images, such as when the tumors extend into chest wall or mediastinum.

  18. Automatic Lung Tumor Segmentation on PET/CT Images Using Fuzzy Markov Random Field Model

    Directory of Open Access Journals (Sweden)

    Yu Guo

    2014-01-01

    Full Text Available The combination of positron emission tomography (PET and CT images provides complementary functional and anatomical information of human tissues and it has been used for better tumor volume definition of lung cancer. This paper proposed a robust method for automatic lung tumor segmentation on PET/CT images. The new method is based on fuzzy Markov random field (MRF model. The combination of PET and CT image information is achieved by using a proper joint posterior probability distribution of observed features in the fuzzy MRF model which performs better than the commonly used Gaussian joint distribution. In this study, the PET and CT simulation images of 7 non-small cell lung cancer (NSCLC patients were used to evaluate the proposed method. Tumor segmentations with the proposed method and manual method by an experienced radiation oncologist on the fused images were performed, respectively. Segmentation results obtained with the two methods were similar and Dice’s similarity coefficient (DSC was 0.85 ± 0.013. It has been shown that effective and automatic segmentations can be achieved with this method for lung tumors which locate near other organs with similar intensities in PET and CT images, such as when the tumors extend into chest wall or mediastinum.

  19. Semi-automatic breast ultrasound image segmentation based on mean shift and graph cuts.

    Science.gov (United States)

    Zhou, Zhuhuang; Wu, Weiwei; Wu, Shuicai; Tsui, Po-Hsiang; Lin, Chung-Chih; Zhang, Ling; Wang, Tianfu

    2014-10-01

    Computerized tumor segmentation on breast ultrasound (BUS) images remains a challenging task. In this paper, we proposed a new method for semi-automatic tumor segmentation on BUS images using Gaussian filtering, histogram equalization, mean shift, and graph cuts. The only interaction required was to select two diagonal points to determine a region of interest (ROI) on an input image. The ROI image was shrunken by a factor of 2 using bicubic interpolation to reduce computation time. The shrunken image was smoothed by a Gaussian filter and then contrast-enhanced by histogram equalization. Next, the enhanced image was filtered by pyramid mean shift to improve homogeneity. The object and background seeds for graph cuts were automatically generated on the filtered image. Using these seeds, the filtered image was then segmented by graph cuts into a binary image containing the object and background. Finally, the binary image was expanded by a factor of 2 using bicubic interpolation, and the expanded image was processed by morphological opening and closing to refine the tumor contour. The method was implemented with OpenCV 2.4.3 and Visual Studio 2010 and tested for 38 BUS images with benign tumors and 31 BUS images with malignant tumors from different ultrasound scanners. Experimental results showed that our method had a true positive rate (TP) of 91.7%, a false positive (FP) rate of 11.9%, and a similarity (SI) rate of 85.6%. The mean run time on Intel Core 2.66 GHz CPU and 4 GB RAM was 0.49 ± 0.36 s. The experimental results indicate that the proposed method may be useful in BUS image segmentation.

  20. Automatic segmentation for brain MR images via a convex optimized segmentation and bias field correction coupled model.

    Science.gov (United States)

    Chen, Yunjie; Zhao, Bo; Zhang, Jianwei; Zheng, Yuhui

    2014-09-01

    Accurate segmentation of magnetic resonance (MR) images remains challenging mainly due to the intensity inhomogeneity, which is also commonly known as bias field. Recently active contour models with geometric information constraint have been applied, however, most of them deal with the bias field by using a necessary pre-processing step before segmentation of MR data. This paper presents a novel automatic variational method, which can segment brain MR images meanwhile correcting the bias field when segmenting images with high intensity inhomogeneities. We first define a function for clustering the image pixels in a smaller neighborhood. The cluster centers in this objective function have a multiplicative factor that estimates the bias within the neighborhood. In order to reduce the effect of the noise, the local intensity variations are described by the Gaussian distributions with different means and variances. Then, the objective functions are integrated over the entire domain. In order to obtain the global optimal and make the results independent of the initialization of the algorithm, we reconstructed the energy function to be convex and calculated it by using the Split Bregman theory. A salient advantage of our method is that its result is independent of initialization, which allows robust and fully automated application. Our method is able to estimate the bias of quite general profiles, even in 7T MR images. Moreover, our model can also distinguish regions with similar intensity distribution with different variances. The proposed method has been rigorously validated with images acquired on variety of imaging modalities with promising results.

  1. Automatic segmentation of kidneys from non-contrast CT images using efficient belief propagation

    Science.gov (United States)

    Liu, Jianfei; Linguraru, Marius George; Wang, Shijun; Summers, Ronald M.

    2013-03-01

    CT colonography (CTC) can increase the chance of detecting high-risk lesions not only within the colon but anywhere in the abdomen with a low cost. Extracolonic findings such as calculi and masses are frequently found in the kidneys on CTC. Accurate kidney segmentation is an important step to detect extracolonic findings in the kidneys. However, noncontrast CTC images make the task of kidney segmentation substantially challenging because the intensity values of kidney parenchyma are similar to those of adjacent structures. In this paper, we present a fully automatic kidney segmentation algorithm to support extracolonic diagnosis from CTC data. It is built upon three major contributions: 1) localize kidney search regions by exploiting the segmented liver and spleen as well as body symmetry; 2) construct a probabilistic shape prior handling the issue of kidney touching other organs; 3) employ efficient belief propagation on the shape prior to extract the kidneys. We evaluated the accuracy of our algorithm on five non-contrast CTC datasets with manual kidney segmentation as the ground-truth. The Dice volume overlaps were 88%/89%, the root-mean-squared errors were 3.4 mm/2.8 mm, and the average surface distances were 2.1 mm/1.9 mm for the left/right kidney respectively. We also validated the robustness on 27 additional CTC cases, and 23 datasets were successfully segmented. In four problematic cases, the segmentation of the left kidney failed due to problems with the spleen segmentation. The results demonstrated that the proposed algorithm could automatically and accurately segment kidneys from CTC images, given the prior correct segmentation of the liver and spleen.

  2. Gap-free segmentation of vascular networks with automatic image processing pipeline.

    Science.gov (United States)

    Hsu, Chih-Yang; Ghaffari, Mahsa; Alaraj, Ali; Flannery, Michael; Zhou, Xiaohong Joe; Linninger, Andreas

    2017-03-01

    Current image processing techniques capture large vessels reliably but often fail to preserve connectivity in bifurcations and small vessels. Imaging artifacts and noise can create gaps and discontinuity of intensity that hinders segmentation of vascular trees. However, topological analysis of vascular trees require proper connectivity without gaps, loops or dangling segments. Proper tree connectivity is also important for high quality rendering of surface meshes for scientific visualization or 3D printing. We present a fully automated vessel enhancement pipeline with automated parameter settings for vessel enhancement of tree-like structures from customary imaging sources, including 3D rotational angiography, magnetic resonance angiography, magnetic resonance venography, and computed tomography angiography. The output of the filter pipeline is a vessel-enhanced image which is ideal for generating anatomical consistent network representations of the cerebral angioarchitecture for further topological or statistical analysis. The filter pipeline combined with computational modeling can potentially improve computer-aided diagnosis of cerebrovascular diseases by delivering biometrics and anatomy of the vasculature. It may serve as the first step in fully automatic epidemiological analysis of large clinical datasets. The automatic analysis would enable rigorous statistical comparison of biometrics in subject-specific vascular trees. The robust and accurate image segmentation using a validated filter pipeline would also eliminate operator dependency that has been observed in manual segmentation. Moreover, manual segmentation is time prohibitive given that vascular trees have more than thousands of segments and bifurcations so that interactive segmentation consumes excessive human resources. Subject-specific trees are a first step toward patient-specific hemodynamic simulations for assessing treatment outcomes.

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

    Science.gov (United States)

    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.

  4. An entropy-based approach to automatic image segmentation of satellite images

    CERN Document Server

    Barbieri, A L; Rodrigues, F A; Bruno, O M; Costa, L da F

    2009-01-01

    An entropy-based image segmentation approach is introduced and applied to color images obtained from Google Earth. Segmentation refers to the process of partitioning a digital image in order to locate different objects and regions of interest. The application to satellite images paves the way to automated monitoring of ecological catastrophes, urban growth, agricultural activity, maritime pollution, climate changing and general surveillance. Regions representing aquatic, rural and urban areas are identified and the accuracy of the proposed segmentation methodology is evaluated. The comparison with gray level images revealed that the color information is fundamental to obtain an accurate segmentation.

  5. Automatic Registration Method for Optical Remote Sensing Images with Large Background Variations Using Line Segments

    Directory of Open Access Journals (Sweden)

    Xiaolong Shi

    2016-05-01

    Full Text Available Image registration is an essential step in the process of image fusion, environment surveillance and change detection. Finding correct feature matches during the registration process proves to be difficult, especially for remote sensing images with large background variations (e.g., images taken pre and post an earthquake or flood. Traditional registration methods based on local intensity probably cannot maintain steady performances, as differences are significant in the same area of the corresponding images, and ground control points are not always available in many disaster images. In this paper, an automatic image registration method based on the line segments on the main shape contours (e.g., coastal lines, long roads and mountain ridges is proposed for remote sensing images with large background variations because the main shape contours can hold relatively more invariant information. First, a line segment detector called EDLines (Edge Drawing Lines, which was proposed by Akinlar et al. in 2011, is used to extract line segments from two corresponding images, and a line validation step is performed to remove meaningless and fragmented line segments. Then, a novel line segment descriptor with a new histogram binning strategy, which is robust to global geometrical distortions, is generated for each line segment based on the geometrical relationships,including both the locations and orientations of theremaining line segments relative to it. As a result of the invariance of the main shape contours, correct line segment matches will have similar descriptors and can be obtained by cross-matching among the descriptors. Finally, a spatial consistency measure is used to remove incorrect matches, and transformation parameters between the reference and sensed images can be figured out. Experiments with images from different types of satellite datasets, such as Landsat7, QuickBird, WorldView, and so on, demonstrate that the proposed algorithm is

  6. Automatic segmentation of the lumen of the carotid artery in ultrasound B-mode images

    Science.gov (United States)

    Santos, André M. F.; Tavares, Jão. Manuel R. S.; Sousa, Luísa; Santos, Rosa; Castro, Pedro; Azevedo, Elsa

    2013-02-01

    A new algorithm is proposed for the segmentation of the lumen and bifurcation boundaries of the carotid artery in B-mode ultrasound images. It uses the hipoechogenic characteristics of the lumen for the identification of the carotid boundaries and the echogenic characteristics for the identification of the bifurcation boundaries. The image to be segmented is processed with the application of an anisotropic diffusion filter for speckle removal and morphologic operators are employed in the detection of the artery. The obtained information is then used in the definition of two initial contours, one corresponding to the lumen and the other to the bifurcation boundaries, for the posterior application of the Chan-vese level set segmentation model. A set of longitudinal B-mode images of the common carotid artery (CCA) was acquired with a GE Healthcare Vivid-e ultrasound system (GE Healthcare, United Kingdom). All the acquired images include a part of the CCA and of the bifurcation that separates the CCA into the internal and external carotid arteries. In order to achieve the uppermost robustness in the imaging acquisition process, i.e., images with high contrast and low speckle noise, the scanner was adjusted differently for each acquisition and according to the medical exam. The obtained results prove that we were able to successfully apply a carotid segmentation technique based on cervical ultrasonography. The main advantage of the new segmentation method relies on the automatic identification of the carotid lumen, overcoming the limitations of the traditional methods.

  7. Semi-automatic geographic atrophy segmentation for SD-OCT images.

    Science.gov (United States)

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

    2013-01-01

    Geographic atrophy (GA) is a condition that is associated with retinal thinning and loss of the retinal pigment epithelium (RPE) layer. It appears in advanced stages of non-exudative age-related macular degeneration (AMD) and can lead to vision loss. We present a semi-automated GA segmentation algorithm for spectral-domain optical coherence tomography (SD-OCT) images. The method first identifies and segments a surface between the RPE and the choroid to generate retinal projection images in which the projection region is restricted to a sub-volume of the retina where the presence of GA can be identified. Subsequently, a geometric active contour model is employed to automatically detect and segment the extent of GA in the projection images. Two image data sets, consisting on 55 SD-OCT scans from twelve eyes in eight patients with GA and 56 SD-OCT scans from 56 eyes in 56 patients with GA, respectively, were utilized to qualitatively and quantitatively evaluate the proposed GA segmentation method. Experimental results suggest that the proposed algorithm can achieve high segmentation accuracy. The mean GA overlap ratios between our proposed method and outlines drawn in the SD-OCT scans, our method and outlines drawn in the fundus auto-fluorescence (FAF) images, and the commercial software (Carl Zeiss Meditec proprietary software, Cirrus version 6.0) and outlines drawn in FAF images were 72.60%, 65.88% and 59.83%, respectively.

  8. A fully automatic three-step liver segmentation method on LDA-based probability maps for multiple contrast MR images.

    Science.gov (United States)

    Gloger, Oliver; Kühn, Jens; Stanski, Adam; Völzke, Henry; Puls, Ralf

    2010-07-01

    Automatic 3D liver segmentation in magnetic resonance (MR) data sets has proven to be a very challenging task in the domain of medical image analysis. There exist numerous approaches for automatic 3D liver segmentation on computer tomography data sets that have influenced the segmentation of MR images. In contrast to previous approaches to liver segmentation in MR data sets, we use all available MR channel information of different weightings and formulate liver tissue and position probabilities in a probabilistic framework. We apply multiclass linear discriminant analysis as a fast and efficient dimensionality reduction technique and generate probability maps then used for segmentation. We develop a fully automatic three-step 3D segmentation approach based upon a modified region growing approach and a further threshold technique. Finally, we incorporate characteristic prior knowledge to improve the segmentation results. This novel 3D segmentation approach is modularized and can be applied for normal and fat accumulated liver tissue properties.

  9. Automatic Detection and Segmentation of Kidneys in 3D CT Images Using Random Forests

    OpenAIRE

    Cuingnet, Rémi; Prevost, Raphaël; Lesage, David; Cohen, Laurent D.; Mory, Benoît; Ardon, Roberto

    2012-01-01

    International audience; Kidney segmentation in 3D CT images allows extracting useful information for nephrologists. For practical use in clinical routine, such an algorithm should be fast, automatic and robust to contrast-agent enhancement and elds of view. By combining and re ning state-of-the-art techniques (random forests and template deformation), we demonstrate the possibility of building an algorithm that meets these requirements. Kidneys are localized with random forests following a co...

  10. Deep learning for automatic localization, identification, and segmentation of vertebral bodies in volumetric MR images

    Science.gov (United States)

    Suzani, Amin; Rasoulian, Abtin; Seitel, Alexander; Fels, Sidney; Rohling, Robert N.; Abolmaesumi, Purang

    2015-03-01

    This paper proposes an automatic method for vertebra localization, labeling, and segmentation in multi-slice Magnetic Resonance (MR) images. Prior work in this area on MR images mostly requires user interaction while our method is fully automatic. Cubic intensity-based features are extracted from image voxels. A deep learning approach is used for simultaneous localization and identification of vertebrae. The localized points are refined by local thresholding in the region of the detected vertebral column. Thereafter, a statistical multi-vertebrae model is initialized on the localized vertebrae. An iterative Expectation Maximization technique is used to register the vertebral body of the model to the image edges and obtain a segmentation of the lumbar vertebral bodies. The method is evaluated by applying to nine volumetric MR images of the spine. The results demonstrate 100% vertebra identification and a mean surface error of below 2.8 mm for 3D segmentation. Computation time is less than three minutes per high-resolution volumetric image.

  11. Image Based Hair Segmentation Algorithm for the Application of Automatic Facial Caricature Synthesis

    Directory of Open Access Journals (Sweden)

    Yehu Shen

    2014-01-01

    Full Text Available Hair is a salient feature in human face region and are one of the important cues for face analysis. Accurate detection and presentation of hair region is one of the key components for automatic synthesis of human facial caricature. In this paper, an automatic hair detection algorithm for the application of automatic synthesis of facial caricature based on a single image is proposed. Firstly, hair regions in training images are labeled manually and then the hair position prior distributions and hair color likelihood distribution function are estimated from these labels efficiently. Secondly, the energy function of the test image is constructed according to the estimated prior distributions of hair location and hair color likelihood. This energy function is further optimized according to graph cuts technique and initial hair region is obtained. Finally, K-means algorithm and image postprocessing techniques are applied to the initial hair region so that the final hair region can be segmented precisely. Experimental results show that the average processing time for each image is about 280 ms and the average hair region detection accuracy is above 90%. The proposed algorithm is applied to a facial caricature synthesis system. Experiments proved that with our proposed hair segmentation algorithm the facial caricatures are vivid and satisfying.

  12. Fully Automatic Method for 3D T1-Weighted Brain Magnetic Resonance Images Segmentation

    Directory of Open Access Journals (Sweden)

    Bouchaib Cherradi

    2011-05-01

    Full Text Available Accurate segmentation of brain MR images is of interest for many brain disorders. However, dueto several factors such noise, imaging artefacts, intrinsic tissue variation and partial volumeeffects, brain extraction and tissue segmentation remains a challenging task. So, in this paper, afull automatic method for segmentation of anatomical 3D brain MR images is proposed. Themethod consists of many steps. First, noise reduction by median filtering is done; secondsegmentation of brain/non-brain tissue is performed by using a Threshold Morphologic BrainExtraction method (TMBE. Then initial centroids estimation by gray level histogram analysis isexecuted, this stage yield to a Modified version of Fuzzy C-means Algorithm (MFCM that is usedfor MRI tissue segmentation. Finally 3D visualisation of the three clusters (CSF, GM and WM isperformed. The efficiency of the proposed method is demonstrated by extensive segmentationexperiments using simulated and real MR images. A confrontation of the method with similarmethods of the literature has been undertaken trough different performance measures. TheMFCM for tissue segmentation introduce a gain in rapidity of convergence of about 70%.

  13. Automatic segmentation and measurements of gestational sac using static B-mode ultrasound images

    Science.gov (United States)

    Ibrahim, Dheyaa Ahmed; Al-Assam, Hisham; Du, Hongbo; Farren, Jessica; Al-karawi, Dhurgham; Bourne, Tom; Jassim, Sabah

    2016-05-01

    Ultrasound imagery has been widely used for medical diagnoses. Ultrasound scanning is safe and non-invasive, and hence used throughout pregnancy for monitoring growth. In the first trimester, an important measurement is that of the Gestation Sac (GS). The task of measuring the GS size from an ultrasound image is done manually by a Gynecologist. This paper presents a new approach to automatically segment a GS from a static B-mode image by exploiting its geometric features for early identification of miscarriage cases. To accurately locate the GS in the image, the proposed solution uses wavelet transform to suppress the speckle noise by eliminating the high-frequency sub-bands and prepare an enhanced image. This is followed by a segmentation step that isolates the GS through the several stages. First, the mean value is used as a threshold to binarise the image, followed by filtering unwanted objects based on their circularity, size and mean of greyscale. The mean value of each object is then used to further select candidate objects. A Region Growing technique is applied as a post-processing to finally identify the GS. We evaluated the effectiveness of the proposed solution by firstly comparing the automatic size measurements of the segmented GS against the manual measurements, and then integrating the proposed segmentation solution into a classification framework for identifying miscarriage cases and pregnancy of unknown viability (PUV). Both test results demonstrate that the proposed method is effective in segmentation the GS and classifying the outcomes with high level accuracy (sensitivity (miscarriage) of 100% and specificity (PUV) of 99.87%).

  14. An automatic fractional coefficient setting method of FODPSO for hyperspectral image segmentation

    Science.gov (United States)

    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.

  15. Automatic segmentation method of striatum regions in quantitative susceptibility mapping images

    Science.gov (United States)

    Murakawa, Saki; Uchiyama, Yoshikazu; Hirai, Toshinori

    2015-03-01

    Abnormal accumulation of brain iron has been detected in various neurodegenerative diseases. Quantitative susceptibility mapping (QSM) is a novel contrast mechanism in magnetic resonance (MR) imaging and enables the quantitative analysis of local tissue susceptibility property. Therefore, automatic segmentation tools of brain regions on QSM images would be helpful for radiologists' quantitative analysis in various neurodegenerative diseases. The purpose of this study was to develop an automatic segmentation and classification method of striatum regions on QSM images. Our image database consisted of 22 QSM images obtained from healthy volunteers. These images were acquired on a 3.0 T MR scanner. The voxel size was 0.9×0.9×2 mm. The matrix size of each slice image was 256×256 pixels. In our computerized method, a template mating technique was first used for the detection of a slice image containing striatum regions. An image registration technique was subsequently employed for the classification of striatum regions in consideration of the anatomical knowledge. After the image registration, the voxels in the target image which correspond with striatum regions in the reference image were classified into three striatum regions, i.e., head of the caudate nucleus, putamen, and globus pallidus. The experimental results indicated that 100% (21/21) of the slice images containing striatum regions were detected accurately. The subjective evaluation of the classification results indicated that 20 (95.2%) of 21 showed good or adequate quality. Our computerized method would be useful for the quantitative analysis of Parkinson diseases in QSM images.

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

    Science.gov (United States)

    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.

  17. A workflow for the automatic segmentation of organelles in electron microscopy image stacks.

    Science.gov (United States)

    Perez, Alex J; Seyedhosseini, Mojtaba; Deerinck, Thomas J; Bushong, Eric A; Panda, Satchidananda; Tasdizen, Tolga; Ellisman, Mark H

    2014-01-01

    Electron microscopy (EM) facilitates analysis of the form, distribution, and functional status of key organelle systems in various pathological processes, including those associated with neurodegenerative disease. Such EM data often provide important new insights into the underlying disease mechanisms. The development of more accurate and efficient methods to quantify changes in subcellular microanatomy has already proven key to understanding the pathogenesis of Parkinson's and Alzheimer's diseases, as well as glaucoma. While our ability to acquire large volumes of 3D EM data is progressing rapidly, more advanced analysis tools are needed to assist in measuring precise three-dimensional morphologies of organelles within data sets that can include hundreds to thousands of whole cells. Although new imaging instrument throughputs can exceed teravoxels of data per day, image segmentation and analysis remain significant bottlenecks to achieving quantitative descriptions of whole cell structural organellomes. Here, we present a novel method for the automatic segmentation of organelles in 3D EM image stacks. Segmentations are generated using only 2D image information, making the method suitable for anisotropic imaging techniques such as serial block-face scanning electron microscopy (SBEM). Additionally, no assumptions about 3D organelle morphology are made, ensuring the method can be easily expanded to any number of structurally and functionally diverse organelles. Following the presentation of our algorithm, we validate its performance by assessing the segmentation accuracy of different organelle targets in an example SBEM dataset and demonstrate that it can be efficiently parallelized on supercomputing resources, resulting in a dramatic reduction in runtime.

  18. Fully automatic algorithm for segmenting full human diaphragm in non-contrast CT Images

    Science.gov (United States)

    Karami, Elham; Gaede, Stewart; Lee, Ting-Yim; Samani, Abbas

    2015-03-01

    The diaphragm is a sheet of muscle which separates the thorax from the abdomen and it acts as the most important muscle of the respiratory system. As such, an accurate segmentation of the diaphragm, not only provides key information for functional analysis of the respiratory system, but also can be used for locating other abdominal organs such as the liver. However, diaphragm segmentation is extremely challenging in non-contrast CT images due to the diaphragm's similar appearance to other abdominal organs. In this paper, we present a fully automatic algorithm for diaphragm segmentation in non-contrast CT images. The method is mainly based on a priori knowledge about the human diaphragm anatomy. The diaphragm domes are in contact with the lungs and the heart while its circumference runs along the lumbar vertebrae of the spine as well as the inferior border of the ribs and sternum. As such, the diaphragm can be delineated by segmentation of these organs followed by connecting relevant parts of their outline properly. More specifically, the bottom surface of the lungs and heart, the spine borders and the ribs are delineated, leading to a set of scattered points which represent the diaphragm's geometry. Next, a B-spline filter is used to find the smoothest surface which pass through these points. This algorithm was tested on a noncontrast CT image of a lung cancer patient. The results indicate that there is an average Hausdorff distance of 2.96 mm between the automatic and manually segmented diaphragms which implies a favourable accuracy.

  19. Automatic lung segmentation in CT images with accurate handling of the hilar region.

    Science.gov (United States)

    De Nunzio, Giorgio; Tommasi, Eleonora; Agrusti, Antonella; Cataldo, Rosella; De Mitri, Ivan; Favetta, Marco; Maglio, Silvio; Massafra, Andrea; Quarta, Maurizio; Torsello, Massimo; Zecca, Ilaria; Bellotti, Roberto; Tangaro, Sabina; Calvini, Piero; Camarlinghi, Niccolò; Falaschi, Fabio; Cerello, Piergiorgio; Oliva, Piernicola

    2011-02-01

    A fully automated and three-dimensional (3D) segmentation method for the identification of the pulmonary parenchyma in thorax X-ray computed tomography (CT) datasets is proposed. It is meant to be used as pre-processing step in the computer-assisted detection (CAD) system for malignant lung nodule detection that is being developed by the Medical Applications in a Grid Infrastructure Connection (MAGIC-5) Project. In this new approach the segmentation of the external airways (trachea and bronchi), is obtained by 3D region growing with wavefront simulation and suitable stop conditions, thus allowing an accurate handling of the hilar region, notoriously difficult to be segmented. Particular attention was also devoted to checking and solving the problem of the apparent 'fusion' between the lungs, caused by partial-volume effects, while 3D morphology operations ensure the accurate inclusion of all the nodules (internal, pleural, and vascular) in the segmented volume. The new algorithm was initially developed and tested on a dataset of 130 CT scans from the Italung-CT trial, and was then applied to the ANODE09-competition images (55 scans) and to the LIDC database (84 scans), giving very satisfactory results. In particular, the lung contour was adequately located in 96% of the CT scans, with incorrect segmentation of the external airways in the remaining cases. Segmentation metrics were calculated that quantitatively express the consistency between automatic and manual segmentations: the mean overlap degree of the segmentation masks is 0.96 ± 0.02, and the mean and the maximum distance between the mask borders (averaged on the whole dataset) are 0.74 ± 0.05 and 4.5 ± 1.5, respectively, which confirms that the automatic segmentations quite correctly reproduce the borders traced by the radiologist. Moreover, no tissue containing internal and pleural nodules was removed in the segmentation process, so that this method proved to be fit for the use in the

  20. Automatic segmentation and volumetry of multiple sclerosis brain lesions from MR images

    Directory of Open Access Journals (Sweden)

    Saurabh Jain

    2015-01-01

    Full Text Available The location and extent of white matter lesions on magnetic resonance imaging (MRI are important criteria for diagnosis, follow-up and prognosis of multiple sclerosis (MS. Clinical trials have shown that quantitative values, such as lesion volumes, are meaningful in MS prognosis. Manual lesion delineation for the segmentation of lesions is, however, time-consuming and suffers from observer variability. In this paper, we propose MSmetrix, an accurate and reliable automatic method for lesion segmentation based on MRI, independent of scanner or acquisition protocol and without requiring any training data. In MSmetrix, 3D T1-weighted and FLAIR MR images are used in a probabilistic model to detect white matter (WM lesions as an outlier to normal brain while segmenting the brain tissue into grey matter, WM and cerebrospinal fluid. The actual lesion segmentation is performed based on prior knowledge about the location (within WM and the appearance (hyperintense on FLAIR of lesions. The accuracy of MSmetrix is evaluated by comparing its output with expert reference segmentations of 20 MRI datasets of MS patients. Spatial overlap (Dice between the MSmetrix and the expert lesion segmentation is 0.67 ± 0.11. The intraclass correlation coefficient (ICC equals 0.8 indicating a good volumetric agreement between the MSmetrix and expert labelling. The reproducibility of MSmetrix' lesion volumes is evaluated based on 10 MS patients, scanned twice with a short interval on three different scanners. The agreement between the first and the second scan on each scanner is evaluated through the spatial overlap and absolute lesion volume difference between them. The spatial overlap was 0.69 ± 0.14 and absolute total lesion volume difference between the two scans was 0.54 ± 0.58 ml. Finally, the accuracy and reproducibility of MSmetrix compare favourably with other publicly available MS lesion segmentation algorithms, applied on the same data using default

  1. Automatic segmentation of the caudate nucleus from human brain MR images.

    Science.gov (United States)

    Xia, Yan; Bettinger, Keith; Shen, Lin; Reiss, Allan L

    2007-04-01

    We describe a knowledge-driven algorithm to automatically delineate the caudate nucleus (CN) region of the human brain from a magnetic resonance (MR) image. Since the lateral ventricles (LVs) are good landmarks for positioning the CN, the algorithm first extracts the LVs, and automatically localizes the CN from this information guided by anatomic knowledge of the structure. The face validity of the algorithm was tested with 55 high-resolution T1-weighted magnetic resonance imaging (MRI) datasets, and segmentation results were overlaid onto the original image data for visual inspection. We further evaluated the algorithm by comparing automated segmentation results to a "gold standard" established by human experts for these 55 MR datasets. Quantitative comparison showed a high intraclass correlation between the algorithm and expert as well as high spatial overlap between the regions-of-interest (ROIs) generated from the two methods. The mean spatial overlap +/- standard deviation (defined by the intersection of the 2 ROIs divided by the union of the 2 ROIs) was equal to 0.873 +/- 0.0234. The algorithm has been incorporated into a public domain software program written in Java and, thus, has the potential to be of broad benefit to neuroimaging investigators interested in basal ganglia anatomy and function.

  2. Automatic image segmentation for treatment planning in radiotherapy; Segmentation automatique des images pour la planifi cation dosimetrique en radiotherapie

    Energy Technology Data Exchange (ETDEWEB)

    Pasquiera, D. [Centre Galilee, polyclinique de la Louviere, 59 - Lille (France); Peyrodie, L. [Ecole des hautes etudes d' ingenieur, 59 - Lille (France); Laboratoire d' automatique, genie informatique et signal (LAGIS), Cite scientifi que, 59 - Villeneuve d' Ascq (France); Denis, F. [Centre Jean-Bernard, 72 - Le Mans (France); Pointreau, Y.; Bera, G. [Clinique d' oncologie radiotherapie, Centre Henry-S.-Kaplan, CHU Bretonneau, 37 - Tours (France); Lartigau, E. [Departement universitaire de radiotherapie, Centre O. Lambret, Universite Lille 2, 59 - Lille (France)

    2010-07-01

    One drawback of the growth in conformal radiotherapy and image-guided radiotherapy is the increased time needed to define the volumes of interest. This also results in inter- and intra-observer variability. However, developments in computing and image processing have enabled these tasks to be partially or totally automated. This article will provide a detailed description of the main principles of image segmentation in radiotherapy, its applications and the most recent results in a clinical context. (authors)

  3. Development of image-processing software for automatic segmentation of brain tumors in MR images

    Directory of Open Access Journals (Sweden)

    C Vijayakumar

    2011-01-01

    Full Text Available 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.

  4. An adaptive spatial clustering method for automatic brain MR image segmentation

    Institute of Scientific and Technical Information of China (English)

    Jingdan Zhang; Daoqing Dai

    2009-01-01

    In this paper, an adaptive spatial clustering method is presented for automatic brain MR image segmentation, which is based on a competitive learning algorithm-self-organizing map (SOM). We use a pattern recognition approach in terms of feature generation and classifier design. Firstly, a multi-dimensional feature vector is constructed using local spatial information. Then, an adaptive spatial growing hierarchical SOM (ASGHSOM) is proposed as the classifier, which is an extension of SOM, fusing multi-scale segmentation with the competitive learning clustering algorithm to overcome the problem of overlapping grey-scale intensities on boundary regions. Furthermore, an adaptive spatial distance is integrated with ASGHSOM, in which local spatial information is considered in the cluster-ing process to reduce the noise effect and the classification ambiguity. Our proposed method is validated by extensive experiments using both simulated and real MR data with varying noise level, and is compared with the state-of-the-art algorithms.

  5. A workflow for the automatic segmentation of organelles in electron microscopy image stacks

    Directory of Open Access Journals (Sweden)

    Alex Joseph Perez

    2014-11-01

    Full Text Available Electron microscopy (EM facilitates analysis of the form, distribution, and functional status of key organelle systems in various pathological processes, including those associated with neurodegenerative disease. Such EM data often provide important new insights into the underlying disease mechanisms. The development of more accurate and efficient methods to quantify changes in subcellular microanatomy has already proven key to understanding the pathogenesis of Parkinson’s and Alzheimer’s diseases, as well as glaucoma. While our ability to acquire large volumes of 3D EM data is progressing rapidly, more advanced analysis tools are needed to assist in measuring precise three-dimensional morphologies of organelles within data sets that can include hundreds to thousands of whole cells. Although new imaging instrument throughputs can exceed teravoxels of data per day, image segmentation and analysis remain significant bottlenecks to achieving quantitative descriptions of whole cell structural organellomes. Here, we present a novel method for the automatic segmentation of organelles in 3D EM image stacks. Segmentations are generated using only 2D image information, making the method suitable for anisotropic imaging techniques such as serial block-face scanning electron microscopy (SBEM. Additionally, no assumptions about 3D organelle morphology are made, ensuring the method can be easily expanded to any number of structurally and functionally diverse organelles. Following the presentation of our algorithm, we validate its performance by assessing the segmentation accuracy of different organelle targets in an example SBEM dataset and demonstrate that it can be efficiently parallelized on supercomputing resources, resulting in a dramatic reduction in runtime.

  6. Automatic segmentation of pulmonary nodules on CT images by use of NCI lung image database consortium

    Science.gov (United States)

    Tachibana, Rie; Kido, Shoji

    2006-03-01

    Accurate segmentation of small pulmonary nodules (SPNs) on thoracic CT images is an important technique for volumetric doubling time estimation and feature characterization for the diagnosis of SPNs. Most of the nodule segmentation algorithms that have been previously presented were designed to handle solid pulmonary nodules. However, SPNs with ground-glass opacity (GGO) also affects a diagnosis. Therefore, we have developed an automated volumetric segmentation algorithm of SPNs with GGO on thoracic CT images. This paper presents our segmentation algorithm with multiple fixed-thresholds, template-matching method, a distance-transformation method, and a watershed method. For quantitative evaluation of the performance of our algorithm, we used the first dataset provided by NCI Lung Image Database Consortium (LIDC). In the evaluation, we employed the coincident rate which was calculated with both the computerized segmented region of a SPN and the matching probability map (pmap) images provided by LIDC. As the result of 23 cases, the mean of the total coincident rate was 0.507 +/- 0.219. From these results, we concluded that our algorithm is useful for extracting SPNs with GGO and solid pattern as well as wide variety of SPNs in size.

  7. Automatic segmentation of blood vessels from retinal fundus images through image processing and data mining techniques

    Indian Academy of Sciences (India)

    R Geetharamani; Lakshmi Balasubramanian

    2015-09-01

    Machine Learning techniques have been useful in almost every field of concern. Data Mining, a branch of Machine Learning is one of the most extensively used techniques. The ever-increasing demands in the field of medicine are being addressed by computational approaches in which Big Data analysis, image processing and data mining are on top priority. These techniques have been exploited in the domain of ophthalmology for better retinal fundus image analysis. Blood vessels, one of the most significant retinal anatomical structures are analysed for diagnosis of many diseases like retinopathy, occlusion and many other vision threatening diseases. Vessel segmentation can also be a pre-processing step for segmentation of other retinal structures like optic disc, fovea, microneurysms, etc. In this paper, blood vessel segmentation is attempted through image processing and data mining techniques. The retinal blood vessels were segmented through color space conversion and color channel extraction, image pre-processing, Gabor filtering, image postprocessing, feature construction through application of principal component analysis, k-means clustering and first level classification using Naïve–Bayes classification algorithm and second level classification using C4.5 enhanced with bagging techniques. Association of every pixel against the feature vector necessitates Big Data analysis. The proposed methodology was evaluated on a publicly available database, STARE. The results reported 95.05% accuracy on entire dataset; however the accuracy was 95.20% on normal images and 94.89% on pathological images. A comparison of these results with the existing methodologies is also reported. This methodology can help ophthalmologists in better and faster analysis and hence early treatment to the patients.

  8. Automatic iterative segmentation of multiple sclerosis lesions using Student's t mixture models and probabilistic anatomical atlases in FLAIR images.

    Science.gov (United States)

    Freire, Paulo G L; Ferrari, Ricardo J

    2016-06-01

    Multiple sclerosis (MS) is a demyelinating autoimmune disease that attacks the central nervous system (CNS) and affects more than 2 million people worldwide. The segmentation of MS lesions in magnetic resonance imaging (MRI) is a very important task to assess how a patient is responding to treatment and how the disease is progressing. Computational approaches have been proposed over the years to segment MS lesions and reduce the amount of time spent on manual delineation and inter- and intra-rater variability and bias. However, fully-automatic segmentation of MS lesions still remains an open problem. In this work, we propose an iterative approach using Student's t mixture models and probabilistic anatomical atlases to automatically segment MS lesions in Fluid Attenuated Inversion Recovery (FLAIR) images. Our technique resembles a refinement approach by iteratively segmenting brain tissues into smaller classes until MS lesions are grouped as the most hyperintense one. To validate our technique we used 21 clinical images from the 2015 Longitudinal Multiple Sclerosis Lesion Segmentation Challenge dataset. Evaluation using Dice Similarity Coefficient (DSC), True Positive Ratio (TPR), False Positive Ratio (FPR), Volume Difference (VD) and Pearson's r coefficient shows that our technique has a good spatial and volumetric agreement with raters' manual delineations. Also, a comparison between our proposal and the state-of-the-art shows that our technique is comparable and, in some cases, better than some approaches, thus being a viable alternative for automatic MS lesion segmentation in MRI.

  9. Automatic segmentation of the bone and extraction of the bone cartilage interface from magnetic resonance images of the knee

    Science.gov (United States)

    Fripp, Jurgen; Crozier, Stuart; Warfield, Simon K.; Ourselin, Sébastien

    2007-03-01

    The accurate segmentation of the articular cartilages from magnetic resonance (MR) images of the knee is important for clinical studies and drug trials into conditions like osteoarthritis. Currently, segmentations are obtained using time-consuming manual or semi-automatic algorithms which have high inter- and intra-observer variabilities. This paper presents an important step towards obtaining automatic and accurate segmentations of the cartilages, namely an approach to automatically segment the bones and extract the bone-cartilage interfaces (BCI) in the knee. The segmentation is performed using three-dimensional active shape models, which are initialized using an affine registration to an atlas. The BCI are then extracted using image information and prior knowledge about the likelihood of each point belonging to the interface. The accuracy and robustness of the approach was experimentally validated using an MR database of fat suppressed spoiled gradient recall images. The (femur, tibia, patella) bone segmentation had a median Dice similarity coefficient of (0.96, 0.96, 0.89) and an average point-to-surface error of 0.16 mm on the BCI. The extracted BCI had a median surface overlap of 0.94 with the real interface, demonstrating its usefulness for subsequent cartilage segmentation or quantitative analysis.

  10. Automatic Spatially-Adaptive Balancing of Energy Terms for Image Segmentation

    CERN Document Server

    Rao, Josna; Abugharbieh, Rafeef

    2009-01-01

    Image segmentation techniques are predominately based on parameter-laden optimization. The objective function typically involves weights for balancing competing image fidelity and segmentation regularization cost terms. Setting these weights suitably has been a painstaking, empirical process. Even if such ideal weights are found for a novel image, most current approaches fix the weight across the whole image domain, ignoring the spatially-varying properties of object shape and image appearance. We propose a novel technique that autonomously balances these terms in a spatially-adaptive manner through the incorporation of image reliability in a graph-based segmentation framework. We validate on synthetic data achieving a reduction in mean error of 47% (p-value << 0.05) when compared to the best fixed parameter segmentation. We also present results on medical images (including segmentations of the corpus callosum and brain tissue in MRI data) and on natural images.

  11. Automatic segmentation of psoriasis lesions

    Science.gov (United States)

    Ning, Yang; Shi, Chenbo; Wang, Li; Shu, Chang

    2014-10-01

    The automatic segmentation of psoriatic lesions is widely researched these years. It is an important step in Computer-aid methods of calculating PASI for estimation of lesions. Currently those algorithms can only handle single erythema or only deal with scaling segmentation. In practice, scaling and erythema are often mixed together. In order to get the segmentation of lesions area - this paper proposes an algorithm based on Random forests with color and texture features. The algorithm has three steps. The first step, the polarized light is applied based on the skin's Tyndall-effect in the imaging to eliminate the reflection and Lab color space are used for fitting the human perception. The second step, sliding window and its sub windows are used to get textural feature and color feature. In this step, a feature of image roughness has been defined, so that scaling can be easily separated from normal skin. In the end, Random forests will be used to ensure the generalization ability of the algorithm. This algorithm can give reliable segmentation results even the image has different lighting conditions, skin types. In the data set offered by Union Hospital, more than 90% images can be segmented accurately.

  12. Quantitative evaluation of an automatic segmentation method for 3D reconstruction of intervertebral scoliotic disks from MR images

    Directory of Open Access Journals (Sweden)

    Claudia Chevrefils

    2012-08-01

    Full Text Available Abstract Background For some scoliotic patients the spinal instrumentation is inevitable. Among these patients, those with stiff curvature will need thoracoscopic disk resection. The removal of the intervertebral disk with only thoracoscopic images is a tedious and challenging task for the surgeon. With computer aided surgery and 3D visualisation of the interverterbral disk during surgery, surgeons will have access to additional information such as the remaining disk tissue or the distance of surgical tools from critical anatomical structures like the aorta or spinal canal. We hypothesized that automatically extracting 3D information of the intervertebral disk from MR images would aid the surgeons to evaluate the remaining disk and would add a security factor to the patient during thoracoscopic disk resection. Methods This paper presents a quantitative evaluation of an automatic segmentation method for 3D reconstruction of intervertebral scoliotic disks from MR images. The automatic segmentation method is based on the watershed technique and morphological operators. The 3D Dice Similarity Coefficient (DSC is the main statistical metric used to validate the automatically detected preoperative disk volumes. The automatic detections of intervertebral disks of real clinical MR images are compared to manual segmentation done by clinicians. Results Results show that depending on the type of MR acquisition sequence, the 3D DSC can be as high as 0.79 (±0.04. These 3D results are also supported by a 2D quantitative evaluation as well as by robustness and variability evaluations. The mean discrepancy (in 2D between the manual and automatic segmentations for regions around the spinal canal is of 1.8 (±0.8 mm. The robustness study shows that among the five factors evaluated, only the type of MRI acquisition sequence can affect the segmentation results. Finally, the variability of the automatic segmentation method is lower than the variability associated

  13. Image processing based automatic diagnosis of glaucoma using wavelet features of segmented optic disc from fundus image.

    Science.gov (United States)

    Singh, Anushikha; Dutta, Malay Kishore; ParthaSarathi, M; Uher, Vaclav; Burget, Radim

    2016-02-01

    Glaucoma is a disease of the retina which is one of the most common causes of permanent blindness worldwide. This paper presents an automatic image processing based method for glaucoma diagnosis from the digital fundus image. In this paper wavelet feature extraction has been followed by optimized genetic feature selection combined with several learning algorithms and various parameter settings. Unlike the existing research works where the features are considered from the complete fundus or a sub image of the fundus, this work is based on feature extraction from the segmented and blood vessel removed optic disc to improve the accuracy of identification. The experimental results presented in this paper indicate that the wavelet features of the segmented optic disc image are clinically more significant in comparison to features of the whole or sub fundus image in the detection of glaucoma from fundus image. Accuracy of glaucoma identification achieved in this work is 94.7% and a comparison with existing methods of glaucoma detection from fundus image indicates that the proposed approach has improved accuracy of classification.

  14. Fully automatic prostate segmentation from transrectal ultrasound images based on radial bas-relief initialization and slice-based propagation.

    Science.gov (United States)

    Yu, Yanyan; Chen, Yimin; Chiu, Bernard

    2016-07-01

    Prostate segmentation from transrectal ultrasound (TRUS) images plays an important role in the diagnosis and treatment planning of prostate cancer. In this paper, a fully automatic slice-based segmentation method was developed to segment TRUS prostate images. The initial prostate contour was determined using a novel method based on the radial bas-relief (RBR) method, and a false edge removal algorithm proposed here in. 2D slice-based propagation was used in which the contour on each image slice was deformed using a level-set evolution model, which was driven by edge-based and region-based energy fields generated by dyadic wavelet transform. The optimized contour on an image slice propagated to the adjacent slice, and subsequently deformed using the level-set model. The propagation continued until all image slices were segmented. To determine the initial slice where the propagation began, the initial prostate contour was deformed individually on each transverse image. A method was developed to self-assess the accuracy of the deformed contour based on the average image intensity inside and outside of the contour. The transverse image on which highest accuracy was attained was chosen to be the initial slice for the propagation process. Evaluation was performed for 336 transverse images from 15 prostates that include images acquired at mid-gland, base and apex regions of the prostates. The average mean absolute difference (MAD) between algorithm and manual segmentations was 0.79±0.26mm, which is comparable to results produced by previously published semi-automatic segmentation methods. Statistical evaluation shows that accurate segmentation was not only obtained at the mid-gland, but also at the base and apex regions.

  15. Automatic Tracing and Segmentation of Rat Mammary Fat Pads in MRI Image Sequences Based on Cartoon-Texture Model

    Institute of Scientific and Technical Information of China (English)

    TU Shengxian; ZHANG Su; CHEN Yazhu; Freedman Matthew T; WANG Bin; XUAN Jason; WANG Yue

    2009-01-01

    The growth patterns of mammary fat pads and glandular tissues inside the fat pads may be related with the risk factors of breast cancer.Quantitative measurements of this relationship are available after segmentation of mammary pads and glandular tissues.Rat fat pads may lose continuity along image sequences or adjoin similar intensity areas like epidermis and subcutaneous regions.A new approach for automatic tracing and segmentation of fat pads in magnetic resonance imaging (MRI) image sequences is presented,which does not require that the number of pads be constant or the spatial location of pads be adjacent among image slices.First,each image is decomposed into cartoon image and texture image based on cartoon-texture model.They will be used as smooth image and feature image for segmentation and for targeting pad seeds,respectively.Then,two-phase direct energy segmentation based on Chan-Vese active contour model is applied to partitioning the cartoon image into a set of regions,from which the pad boundary is traced iteratively from the pad seed.A tracing algorithm based on scanning order is proposed to accurately trace the pad boundary,which effectively removes the epidermis attached to the pad without any post processing as well as solves the problem of over-segmentation of some small holes inside the pad.The experimental results demonstrate the utility of this approach in accurate delineation of various numbers of mammary pads from several sets of MRI images.

  16. A General System for Automatic Biomedical Image Segmentation Using Intensity Neighborhoods

    Directory of Open Access Journals (Sweden)

    Cheng Chen

    2011-01-01

    Full Text Available Image segmentation is important with applications to several problems in biology and medicine. While extensively researched, generally, current segmentation methods perform adequately in the applications for which they were designed, but often require extensive modifications or calibrations before being used in a different application. We describe an approach that, with few modifications, can be used in a variety of image segmentation problems. The approach is based on a supervised learning strategy that utilizes intensity neighborhoods to assign each pixel in a test image its correct class based on training data. We describe methods for modeling rotations and variations in scales as well as a subset selection for training the classifiers. We show that the performance of our approach in tissue segmentation tasks in magnetic resonance and histopathology microscopy images, as well as nuclei segmentation from fluorescence microscopy images, is similar to or better than several algorithms specifically designed for each of these applications.

  17. 一种自动的图像分割方法%A method of automatic image segmentation

    Institute of Scientific and Technical Information of China (English)

    王晓明; 熊九龙; 王志虎; 祝夏雨; 张玘

    2013-01-01

    针对传统图像分割算法需要参数设置等缺点,提出了一种自动的图像分割算法,采用基于改进视觉注意机制的粗分割和结合主动轮廓与区域生长的精确分割两个过程对图像进行自动分割。实验结果表明,该方法的分割性能优于自适应阈值算法和Kmeans聚类算法,且具有较强的鲁棒性。%In view of the deficiency that traditional image segmentation algorithm needs to set parameters , an automatic image segmentation is proposed in this paper. It applies two process of coarse segmentation based on improved visual attention mechanism and precise segmentation combined active contour with region growing to achieve automatic image segmentation. Experiments show that the proposed algorithm outperforms adaptive threshold algorithm and Kmeans clustering algorithm in image segmentation. The robustness of the proposed algorithm is strong.

  18. Automatic segmentation of breast tumor in ultrasound image with simplified PCNN and improved fuzzy mutual information

    Science.gov (United States)

    Shi, Jun; Xiao, Zhiheng; Zhou, Shichong

    2010-07-01

    Image segmentation is very important in the field of image processing. The pulse coupled neural network (PCNN) has been efficiently applied to image processing, especially for image segmentation. In this study, a simplified PCNN (S-PCNN) model is proposed, the fuzzy mutual information (FMI) is improved as optimization criterion for S-PCNN, and then the S-PCNN and improved FMI (IFMI) based segmentation algorithm is proposed and applied for the segmentation of breast tumor in ultrasound image. To validate the proposed algorithm, a comparative experiment is implemented to segment breast images not only by our proposed algorithm, but also by the improved C-V algorithm, the max-entropy-based PCNN algorithm, the MI-based PCNN algorithm, and the IFMI-based PCNN algorithm. The results show that the breast lesions are well segmented by the proposed algorithm without image preprocessing, with the mean Hausdorff of distance of 5.631+/-0.822, mean average minimum Euclidean distance of 0.554+/-0.049, mean Tanimoto coefficient of 0.961+/-0.019, and mean misclassified error of 0.038+/-0.004. These values of evaluation indices are better than those of other segmentation algorithms. The results indicate that the proposed algorithm has excellent segmentation accuracy and strong robustness against noise, and it has the potential for breast ultrasound computer-aided diagnosis (CAD).

  19. Automatic segmentation of white matter lesions on magnetic resonance images of the brain by using an outlier detection strategy.

    Science.gov (United States)

    Wang, Rui; Li, Chao; Wang, Jie; Wei, Xiaoer; Li, Yuehua; Hui, Chun; Zhu, Yuemin; Zhang, Su

    2014-12-01

    White matter lesions (WMLs) are commonly observed on the magnetic resonance (MR) images of normal elderly in association with vascular risk factors, such as hypertension or stroke. An accurate WML detection provides significant information for disease tracking, therapy evaluation, and normal aging research. In this article, we present an unsupervised WML segmentation method that uses Gaussian mixture model to describe the intensity distribution of the normal brain tissues and detects the WMLs as outliers to the normal brain tissue model based on extreme value theory. The detection of WMLs is performed by comparing the probability distribution function of a one-sided normal distribution and a Gumbel distribution, which is a specific extreme value distribution. The performance of the automatic segmentation is validated on synthetic and clinical MR images with regard to different imaging sequences and lesion loads. Results indicate that the segmentation method has a favorable accuracy competitive with other state-of-the-art WML segmentation methods.

  20. CT evaluation prior to transapical aortic valve replacement: semi-automatic versus manual image segmentation.

    Science.gov (United States)

    Foldyna, Borek; Jungert, Camelia; Luecke, Christian; von Aspern, Konstantin; Boehmer-Lasthaus, Sonja; Rueth, Eva Maria; Grothoff, Matthias; Nitzsche, Stefan; Gutberlet, Matthias; Mohr, Friedrich Wilhelm; Lehmkuhl, Lukas

    2015-08-01

    To compare the performance of semi-automatic versus manual segmentation for ECG-triggered cardiovascular computed tomography (CT) examinations prior to transcatheter aortic valve replacement (TAVR), with focus on the speed and precision of experienced versus inexperienced observers. The preoperative ECG-triggered CT data of 30 consecutive patients who were scheduled for TAVR were included. All datasets were separately evaluated by two radiologists with 1 and 5 years of experience (novice and expert, respectively) in cardiovascular CT using an evaluation software program with or without a semi-automatic TAVR workflow. The time expended for data loading and all segmentation steps required for the implantation planning were assessed. Inter-software as well as inter-observer reliability analysis was performed. The CT datasets were successfully evaluated, with mean duration between 520.4 ± 117.6 s and 693.2 ± 159.5 s. The three most time-consuming steps were the 3D volume rendering, the measurement of aorta diameter and the sizing of the aortic annulus. Using semi-automatic segmentation, a novice could evaluate CT data approximately 12.3% faster than with manual segmentation, and an expert could evaluate CT data approximately 10.3% faster [mean differences of 85.4 ± 83.8 s (p segmentation, with comparable exactness, showing a benefit for experienced and inexperienced observers.

  1. Semi-automatic segmentation of vertebral bodies in volumetric MR images using a statistical shape+pose model

    Science.gov (United States)

    Suzani, Amin; Rasoulian, Abtin; Fels, Sidney; Rohling, Robert N.; Abolmaesumi, Purang

    2014-03-01

    Segmentation of vertebral structures in magnetic resonance (MR) images is challenging because of poor con­trast between bone surfaces and surrounding soft tissue. This paper describes a semi-automatic method for segmenting vertebral bodies in multi-slice MR images. In order to achieve a fast and reliable segmentation, the method takes advantage of the correlation between shape and pose of different vertebrae in the same patient by using a statistical multi-vertebrae anatomical shape+pose model. Given a set of MR images of the spine, we initially reduce the intensity inhomogeneity in the images by using an intensity-correction algorithm. Then a 3D anisotropic diffusion filter smooths the images. Afterwards, we extract edges from a relatively small region of the pre-processed image with a simple user interaction. Subsequently, an iterative Expectation Maximization tech­nique is used to register the statistical multi-vertebrae anatomical model to the extracted edge points in order to achieve a fast and reliable segmentation for lumbar vertebral bodies. We evaluate our method in terms of speed and accuracy by applying it to volumetric MR images of the spine acquired from nine patients. Quantitative and visual results demonstrate that the method is promising for segmentation of vertebral bodies in volumetric MR images.

  2. Automatic segmentation of the lumen of the carotid artery in ultrasound B-mode images

    OpenAIRE

    Santos, AMF; tavares, jmrs; Sousa, L.; Santos, R.; CASTRO,P; E. Azevedo

    2013-01-01

    A new algorithm is proposed for the segmentation of the lumen and bifurcation boundaries of the carotid artery in B-mode ultrasound images. It uses the hipoechogenic characteristics of the lumen for the identification of the carotid boundaries and the echogenic characteristics for the identification of the bifurcation boundaries. The image to be segmented is processed with the application of an anisotropic diffusion filter for speckle removal and morphologic operators are employed in the dete...

  3. Automatic segmentation of closed-contour features in ophthalmic images using graph theory and dynamic programming.

    Science.gov (United States)

    Chiu, Stephanie J; Toth, Cynthia A; Bowes Rickman, Catherine; Izatt, Joseph A; Farsiu, Sina

    2012-05-01

    This paper presents a generalized framework for segmenting closed-contour anatomical and pathological features using graph theory and dynamic programming (GTDP). More specifically, the GTDP method previously developed for quantifying retinal and corneal layer thicknesses is extended to segment objects such as cells and cysts. The presented technique relies on a transform that maps closed-contour features in the Cartesian domain into lines in the quasi-polar domain. The features of interest are then segmented as layers via GTDP. Application of this method to segment closed-contour features in several ophthalmic image types is shown. Quantitative validation experiments for retinal pigmented epithelium cell segmentation in confocal fluorescence microscopy images attests to the accuracy of the presented technique.

  4. Automatic segmentation of the prostate in 3D MR images by atlas matching using localized mutual information.

    Science.gov (United States)

    Klein, Stefan; van der Heide, Uulke A; Lips, Irene M; van Vulpen, Marco; Staring, Marius; Pluim, Josien P W

    2008-04-01

    An automatic method for delineating the prostate (including the seminal vesicles) in three-dimensional magnetic resonance scans is presented. The method is based on nonrigid registration of a set of prelabeled atlas images. Each atlas image is nonrigidly registered with the target patient image. Subsequently, the deformed atlas label images are fused to yield a single segmentation of the patient image. The proposed method is evaluated on 50 clinical scans, which were manually segmented by three experts. The Dice similarity coefficient (DSC) is used to quantify the overlap between the automatic and manual segmentations. We investigate the impact of several factors on the performance of the segmentation method. For the registration, two similarity measures are compared: Mutual information and a localized version of mutual information. The latter turns out to be superior (median DeltaDSC approximately equal 0.02, p 0.05). To assess the influence of the atlas composition, two atlas sets are compared. The first set consists of 38 scans of healthy volunteers. The second set is constructed by a leave-one-out approach using the 50 clinical scans that are used for evaluation. The second atlas set gives substantially better performance (DeltaDSC=0.04, p definition. With the best settings, a median DSC of around 0.85 is achieved, which is close to the median interobserver DSC of 0.87. The segmentation quality is especially good at the prostate-rectum interface, where the segmentation error remains below 1 mm in 50% of the cases and below 1.5 mm in 75% of the cases.

  5. Automatic segmentation of ground-glass opacities in lung CT images by using Markov random field-based algorithms.

    Science.gov (United States)

    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. Automatic brain matter segmentation of computed tomography images using a statistical model: A tool to gain working time!

    Science.gov (United States)

    Bertè, Francesco; Lamponi, Giuseppe; Bramanti, Placido; Calabrò, Rocco S

    2015-10-01

    Brain computed tomography (CT) is useful diagnostic tool for the evaluation of several neurological disorders due to its accuracy, reliability, safety and wide availability. In this field, a potentially interesting research topic is the automatic segmentation and recognition of medical regions of interest (ROIs). Herein, we propose a novel automated method, based on the use of the active appearance model (AAM) for the segmentation of brain matter in CT images to assist radiologists in the evaluation of the images. The method described, that was applied to 54 CT images coming from a sample of outpatients affected by cognitive impairment, enabled us to obtain the generation of a model overlapping with the original image with quite good precision. Since CT neuroimaging is in widespread use for detecting neurological disease, including neurodegenerative conditions, the development of automated tools enabling technicians and physicians to reduce working time and reach a more accurate diagnosis is needed.

  7. An Automatic Cognitive Graph-Based Segmentation for Detection of Blood Vessels in Retinal Images

    Directory of Open Access Journals (Sweden)

    Rasha Al Shehhi

    2016-01-01

    Full Text Available This paper presents a hierarchical graph-based segmentation for blood vessel detection in digital retinal images. This segmentation employs some of perceptual Gestalt principles: similarity, closure, continuity, and proximity to merge segments into coherent connected vessel-like patterns. The integration of Gestalt principles is based on object-based features (e.g., color and black top-hat (BTH morphology and context and graph-analysis algorithms (e.g., Dijkstra path. The segmentation framework consists of two main steps: preprocessing and multiscale graph-based segmentation. Preprocessing is to enhance lighting condition, due to low illumination contrast, and to construct necessary features to enhance vessel structure due to sensitivity of vessel patterns to multiscale/multiorientation structure. Graph-based segmentation is to decrease computational processing required for region of interest into most semantic objects. The segmentation was evaluated on three publicly available datasets. Experimental results show that preprocessing stage achieves better results compared to state-of-the-art enhancement methods. The performance of the proposed graph-based segmentation is found to be consistent and comparable to other existing methods, with improved capability of detecting small/thin vessels.

  8. Automatic Melody Segmentation

    NARCIS (Netherlands)

    Rodríguez López, Marcelo

    2016-01-01

    The work presented in this dissertation investigates music segmentation. In the field of Musicology, segmentation refers to a score analysis technique, whereby notated pieces or passages of these pieces are divided into “units” referred to as sections, periods, phrases, and so on. Segmentation analy

  9. Morphology-driven automatic segmentation of MR images of the neonatal brain.

    Science.gov (United States)

    Gui, Laura; Lisowski, Radoslaw; Faundez, Tamara; Hüppi, Petra S; Lazeyras, François; Kocher, Michel

    2012-12-01

    The segmentation of MR images of the neonatal brain is an essential step in the study and evaluation of infant brain development. State-of-the-art methods for adult brain MRI segmentation are not applicable to the neonatal brain, due to large differences in structure and tissue properties between newborn and adult brains. Existing newborn brain MRI segmentation methods either rely on manual interaction or require the use of atlases or templates, which unavoidably introduces a bias of the results towards the population that was used to derive the atlases. We propose a different approach for the segmentation of neonatal brain MRI, based on the infusion of high-level brain morphology knowledge, regarding relative tissue location, connectivity and structure. Our method does not require manual interaction, or the use of an atlas, and the generality of its priors makes it applicable to different neonatal populations, while avoiding atlas-related bias. The proposed algorithm segments the brain both globally (intracranial cavity, cerebellum, brainstem and the two hemispheres) and at tissue level (cortical and subcortical gray matter, myelinated and unmyelinated white matter, and cerebrospinal fluid). We validate our algorithm through visual inspection by medical experts, as well as by quantitative comparisons that demonstrate good agreement with expert manual segmentations. The algorithm's robustness is verified by testing on variable quality images acquired on different machines, and on subjects with variable anatomy (enlarged ventricles, preterm- vs. term-born).

  10. Electroporation-based treatment planning for deep-seated tumors based on automatic liver segmentation of MRI images.

    Science.gov (United States)

    Pavliha, Denis; Mušič, Maja M; Serša, Gregor; Miklavčič, Damijan

    2013-01-01

    Electroporation is the phenomenon that occurs when a cell is exposed to a high electric field, which causes transient cell membrane permeabilization. A paramount electroporation-based application is electrochemotherapy, which is performed by delivering high-voltage electric pulses that enable the chemotherapeutic drug to more effectively destroy the tumor cells. Electrochemotherapy can be used for treating deep-seated metastases (e.g. in the liver, bone, brain, soft tissue) using variable-geometry long-needle electrodes. To treat deep-seated tumors, patient-specific treatment planning of the electroporation-based treatment is required. Treatment planning is based on generating a 3D model of the organ and target tissue subject to electroporation (i.e. tumor nodules). The generation of the 3D model is done by segmentation algorithms. We implemented and evaluated three automatic liver segmentation algorithms: region growing, adaptive threshold, and active contours (snakes). The algorithms were optimized using a seven-case dataset manually segmented by the radiologist as a training set, and finally validated using an additional four-case dataset that was previously not included in the optimization dataset. The presented results demonstrate that patient's medical images that were not included in the training set can be successfully segmented using our three algorithms. Besides electroporation-based treatments, these algorithms can be used in applications where automatic liver segmentation is required.

  11. Electroporation-based treatment planning for deep-seated tumors based on automatic liver segmentation of MRI images.

    Directory of Open Access Journals (Sweden)

    Denis Pavliha

    Full Text Available Electroporation is the phenomenon that occurs when a cell is exposed to a high electric field, which causes transient cell membrane permeabilization. A paramount electroporation-based application is electrochemotherapy, which is performed by delivering high-voltage electric pulses that enable the chemotherapeutic drug to more effectively destroy the tumor cells. Electrochemotherapy can be used for treating deep-seated metastases (e.g. in the liver, bone, brain, soft tissue using variable-geometry long-needle electrodes. To treat deep-seated tumors, patient-specific treatment planning of the electroporation-based treatment is required. Treatment planning is based on generating a 3D model of the organ and target tissue subject to electroporation (i.e. tumor nodules. The generation of the 3D model is done by segmentation algorithms. We implemented and evaluated three automatic liver segmentation algorithms: region growing, adaptive threshold, and active contours (snakes. The algorithms were optimized using a seven-case dataset manually segmented by the radiologist as a training set, and finally validated using an additional four-case dataset that was previously not included in the optimization dataset. The presented results demonstrate that patient's medical images that were not included in the training set can be successfully segmented using our three algorithms. Besides electroporation-based treatments, these algorithms can be used in applications where automatic liver segmentation is required.

  12. AUTOMATIC SEGMENTATION ALGORITHM FOR THE LUMEN OF THE CAROTID ARTERY IN ULTRASOUND B-MODE IMAGES

    OpenAIRE

    Santos, AMF; João Manuel R. S. Tavares; Sousa, L.; Santos, R.; CASTRO,P; E. Azevedo

    2012-01-01

    A new algorithm is proposed for the identification and segmentation of the lumen and bifurcation boundaries of the carotid artery in 2D longitudinal ultrasound B-mode images. It uses the hipoechogenic characteristics defining the lumen of the carotid for its identification and echogenic characteristics for the identification of the bifurcation. The input image is preprocessed with the application of an anisotropic diffusion filter for speckle removal, and morphologic operators for the detecti...

  13. Automatic Segmentation of Colon in 3D CT Images and Removal of Opacified Fluid Using Cascade Feed Forward Neural Network

    Directory of Open Access Journals (Sweden)

    K. Gayathri Devi

    2015-01-01

    Full Text Available Purpose. Colon segmentation is an essential step in the development of computer-aided diagnosis systems based on computed tomography (CT images. The requirement for the detection of the polyps which lie on the walls of the colon is much needed in the field of medical imaging for diagnosis of colorectal cancer. Methods. The proposed work is focused on designing an efficient automatic colon segmentation algorithm from abdominal slices consisting of colons, partial volume effect, bowels, and lungs. The challenge lies in determining the exact colon enhanced with partial volume effect of the slice. In this work, adaptive thresholding technique is proposed for the segmentation of air packets, machine learning based cascade feed forward neural network enhanced with boundary detection algorithms are used which differentiate the segments of the lung and the fluids which are sediment at the side wall of colon and by rejecting bowels based on the slice difference removal method. The proposed neural network method is trained with Bayesian regulation algorithm to determine the partial volume effect. Results. Experiment was conducted on CT database images which results in 98% accuracy and minimal error rate. Conclusions. The main contribution of this work is the exploitation of neural network algorithm for removal of opacified fluid to attain desired colon segmentation result.

  14. Automatic choroid cells segmentation and counting based on approximate convexity and concavity of chain code in fluorescence microscopic image

    Science.gov (United States)

    Lu, Weihua; Chen, Xinjian; Zhu, Weifang; Yang, Lei; Cao, Zhaoyuan; Chen, Haoyu

    2015-03-01

    In this paper, we proposed a method based on the Freeman chain code to segment and count rhesus choroid-retinal vascular endothelial cells (RF/6A) automatically for fluorescence microscopy images. The proposed method consists of four main steps. First, a threshold filter and morphological transform were applied to reduce the noise. Second, the boundary information was used to generate the Freeman chain codes. Third, the concave points were found based on the relationship between the difference of the chain code and the curvature. Finally, cells segmentation and counting were completed based on the characteristics of the number of the concave points, the area and shape of the cells. The proposed method was tested on 100 fluorescence microscopic cell images, and the average true positive rate (TPR) is 98.13% and the average false positive rate (FPR) is 4.47%, respectively. The preliminary results showed the feasibility and efficiency of the proposed method.

  15. An automatic method for fast and accurate liver segmentation in CT images using a shape detection level set method

    Science.gov (United States)

    Lee, Jeongjin; Kim, Namkug; Lee, Ho; Seo, Joon Beom; Won, Hyung Jin; Shin, Yong Moon; Shin, Yeong Gil

    2007-03-01

    Automatic liver segmentation is still a challenging task due to the ambiguity of liver boundary and the complex context of nearby organs. In this paper, we propose a faster and more accurate way of liver segmentation in CT images with an enhanced level set method. The speed image for level-set propagation is smoothly generated by increasing number of iterations in anisotropic diffusion filtering. This prevents the level-set propagation from stopping in front of local minima, which prevails in liver CT images due to irregular intensity distributions of the interior liver region. The curvature term of shape modeling level-set method captures well the shape variations of the liver along the slice. Finally, rolling ball algorithm is applied for including enhanced vessels near the liver boundary. Our approach are tested and compared to manual segmentation results of eight CT scans with 5mm slice distance using the average distance and volume error. The average distance error between corresponding liver boundaries is 1.58 mm and the average volume error is 2.2%. The average processing time for the segmentation of each slice is 5.2 seconds, which is much faster than the conventional ones. Accurate and fast result of our method will expedite the next stage of liver volume quantification for liver transplantations.

  16. Automatic Airway Deletion in Pulmonary Segmentation

    Institute of Scientific and Technical Information of China (English)

    WANG Ping; ZHUANG Tian-ge

    2005-01-01

    A method of removing the airway from pulmonary segmentation image was proposed. This method firstly segments the image into several separate regions based on the optimum threshold and morphological operator,and then each region is labeled and noted with its mean grayscale. Therefore, most of the non-lung regions can be removed according to the tissue's Hounsfield units (HU) and the imaging modality. Finally, the airway region is recognized and deleted automatically through using the priori information of its HU and size. This proposed method is tested using several clinical images, yielding satisfying results.

  17. Automatic thoracic anatomy segmentation on CT images using hierarchical fuzzy models and registration

    Science.gov (United States)

    Sun, Kaioqiong; Udupa, Jayaram K.; Odhner, Dewey; Tong, Yubing; Torigian, Drew A.

    2014-03-01

    This paper proposes a thoracic anatomy segmentation method based on hierarchical recognition and delineation guided by a built fuzzy model. Labeled binary samples for each organ are registered and aligned into a 3D fuzzy set representing the fuzzy shape model for the organ. The gray intensity distributions of the corresponding regions of the organ in the original image are recorded in the model. The hierarchical relation and mean location relation between different organs are also captured in the model. Following the hierarchical structure and location relation, the fuzzy shape model of different organs is registered to the given target image to achieve object recognition. A fuzzy connected delineation method is then used to obtain the final segmentation result of organs with seed points provided by recognition. The hierarchical structure and location relation integrated in the model provide the initial parameters for registration and make the recognition efficient and robust. The 3D fuzzy model combined with hierarchical affine registration ensures that accurate recognition can be obtained for both non-sparse and sparse organs. The results on real images are presented and shown to be better than a recently reported fuzzy model-based anatomy recognition strategy.

  18. Development of a semi-automatic segmentation method for retinal OCT images tested in patients with diabetic macular edema.

    Directory of Open Access Journals (Sweden)

    Yijun Huang

    Full Text Available PURPOSE: To develop EdgeSelect, a semi-automatic method for the segmentation of retinal layers in spectral domain optical coherence tomography images, and to compare the segmentation results with a manual method. METHODS: SD-OCT (Heidelberg Spectralis scans of 28 eyes (24 patients with diabetic macular edema and 4 normal subjects were imported into a customized MATLAB application, and were manually segmented by three graders at the layers corresponding to the inner limiting membrane (ILM, the inner segment/ellipsoid interface (ISe, the retinal/retinal pigment epithelium interface (RPE, and the Bruch's membrane (BM. The scans were then segmented independently by the same graders using EdgeSelect, a semi-automated method allowing the graders to guide/correct the layer segmentation interactively. The inter-grader reproducibility and agreement in locating the layer positions between the manual and EdgeSelect methods were assessed and compared using the Wilcoxon signed rank test. RESULTS: The inter-grader reproducibility using the EdgeSelect method for retinal layers varied from 0.15 to 1.21 µm, smaller than those using the manual method (3.36-6.43 µm. The Wilcoxon test indicated the EdgeSelect method had significantly better reproducibility than the manual method. The agreement between the manual and EdgeSelect methods in locating retinal layers ranged from 0.08 to 1.32 µm. There were small differences between the two methods in locating the ILM (p = 0.012 and BM layers (p<0.001, but these were statistically indistinguishable in locating the ISe (p = 0.896 and RPE layers (p = 0.771. CONCLUSIONS: The EdgeSelect method resulted in better reproducibility and good agreement with a manual method in a set of eyes of normal subjects and with retinal disease, suggesting that this approach is feasible for OCT image analysis in clinical trials.

  19. Scorpion image segmentation system

    Science.gov (United States)

    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.

  20. Automatic segmentation of amyloid plaques in MR images using unsupervised support vector machines.

    Science.gov (United States)

    Iordanescu, Gheorghe; Venkatasubramanian, Palamadai N; Wyrwicz, Alice M

    2012-06-01

    Deposition of the β-amyloid peptide (Aβ) is an important pathological hallmark of Alzheimer's disease (AD). However, reliable quantification of amyloid plaques in both human and animal brains remains a challenge. We present here a novel automatic plaque segmentation algorithm based on the intrinsic MR signal characteristics of plaques. This algorithm identifies plaque candidates in MR data by using watershed transform, which extracts regions with low intensities completely surrounded by higher intensity neighbors. These candidates are classified as plaque or nonplaque by an unsupervised learning method using features derived from the MR data intensity. The algorithm performance is validated by comparison with histology. We also demonstrate the algorithm's ability to detect age-related changes in plaque load ex vivo in amyloid precursor protein (APP) transgenic mice that coexpress five familial AD mutations (5xFAD mice). To our knowledge, this study represents the first quantitative method for characterizing amyloid plaques in MRI data. The proposed method can be used to describe the spatiotemporal progression of amyloid deposition, which is necessary for understanding the evolution of plaque pathology in mouse models of Alzheimer's disease and to evaluate the efficacy of emergent amyloid-targeting therapies in preclinical trials.

  1. Validation and Development of a New Automatic Algorithm for Time-Resolved Segmentation of the Left Ventricle in Magnetic Resonance Imaging

    Directory of Open Access Journals (Sweden)

    Jane Tufvesson

    2015-01-01

    Full Text Available Introduction. Manual delineation of the left ventricle is clinical standard for quantification of cardiovascular magnetic resonance images despite being time consuming and observer dependent. Previous automatic methods generally do not account for one major contributor to stroke volume, the long-axis motion. Therefore, the aim of this study was to develop and validate an automatic algorithm for time-resolved segmentation covering the whole left ventricle, including basal slices affected by long-axis motion. Methods. Ninety subjects imaged with a cine balanced steady state free precession sequence were included in the study (training set n=40, test set n=50. Manual delineation was reference standard and second observer analysis was performed in a subset (n=25. The automatic algorithm uses deformable model with expectation-maximization, followed by automatic removal of papillary muscles and detection of the outflow tract. Results. The mean differences between automatic segmentation and manual delineation were EDV −11 mL, ESV 1 mL, EF −3%, and LVM 4 g in the test set. Conclusions. The automatic LV segmentation algorithm reached accuracy comparable to interobserver for manual delineation, thereby bringing automatic segmentation one step closer to clinical routine. The algorithm and all images with manual delineations are available for benchmarking.

  2. Automatic segmentation of the ribs, the vertebral column, and the spinal canal in pediatric computed tomographic images.

    Science.gov (United States)

    Banik, Shantanu; Rangayyan, Rangaraj M; Boag, Graham S

    2010-06-01

    We propose methods to perform automatic identification of the rib structure, the vertebral column, and the spinal canal in computed tomographic (CT) images of pediatric patients. The segmentation processes for the rib structure and the vertebral column are initiated using multilevel thresholding and the results are refined using morphological image processing techniques with features based on radiological and anatomical prior knowledge. The Hough transform for the detection of circles is applied to a cropped edge map that includes the thoracic vertebral structure. The centers of the detected circles are used to derive the information required for the opening-by-reconstruction algorithm used to segment the spinal canal. The methods were tested on 39 CT exams of 13 patients; the results of segmentation of the vertebral column and the spinal canal were assessed quantitatively and qualitatively by comparing with segmentation performed independently by a radiologist. Using 13 CT exams of six patients, including a total of 458 slices with the vertebra from different sections of the vertebral column, the average Hausdorff distance was determined to be 3.2 mm with a standard deviation (SD) of 2.4 mm; the average mean distance to the closest point (MDCP) was 0.7 mm with SD = 0.6 mm. Quantitative analysis was also performed for the segmented spinal canal with three CT exams of three patients, including 21 slices with the spinal canal from different sections of the vertebral column; the average Hausdorff distance was 1.6 mm with SD = 0.5 mm, and the average MDCP was 0.6 mm with SD = 0.1 mm.

  3. Semi-automatic knee cartilage segmentation

    Science.gov (United States)

    Dam, Erik B.; Folkesson, Jenny; Pettersen, Paola C.; Christiansen, Claus

    2006-03-01

    Osteo-Arthritis (OA) is a very common age-related cause of pain and reduced range of motion. A central effect of OA is wear-down of the articular cartilage that otherwise ensures smooth joint motion. Quantification of the cartilage breakdown is central in monitoring disease progression and therefore cartilage segmentation is required. Recent advances allow automatic cartilage segmentation with high accuracy in most cases. However, the automatic methods still fail in some problematic cases. For clinical studies, even if a few failing cases will be averaged out in the overall results, this reduces the mean accuracy and precision and thereby necessitates larger/longer studies. Since the severe OA cases are often most problematic for the automatic methods, there is even a risk that the quantification will introduce a bias in the results. Therefore, interactive inspection and correction of these problematic cases is desirable. For diagnosis on individuals, this is even more crucial since the diagnosis will otherwise simply fail. We introduce and evaluate a semi-automatic cartilage segmentation method combining an automatic pre-segmentation with an interactive step that allows inspection and correction. The automatic step consists of voxel classification based on supervised learning. The interactive step combines a watershed transformation of the original scan with the posterior probability map from the classification step at sub-voxel precision. We evaluate the method for the task of segmenting the tibial cartilage sheet from low-field magnetic resonance imaging (MRI) of knees. The evaluation shows that the combined method allows accurate and highly reproducible correction of the segmentation of even the worst cases in approximately ten minutes of interaction.

  4. Determining the number of clusters for kernelized fuzzy C-means algorithms for automatic medical image segmentation

    Directory of Open Access Journals (Sweden)

    E.A. Zanaty

    2012-03-01

    Full Text Available In this paper, we determine the suitable validity criterion of kernelized fuzzy C-means and kernelized fuzzy C-means with spatial constraints for automatic segmentation of magnetic resonance imaging (MRI. For that; the original Euclidean distance in the FCM is replaced by a Gaussian radial basis function classifier (GRBF and the corresponding algorithms of FCM methods are derived. The derived algorithms are called as the kernelized fuzzy C-means (KFCM and kernelized fuzzy C-means with spatial constraints (SKFCM. These methods are implemented on eighteen indexes as validation to determine whether indexes are capable to acquire the optimal clusters number. The performance of segmentation is estimated by applying these methods independently on several datasets to prove which method can give good results and with which indexes. Our test spans various indexes covering the classical and the rather more recent indexes that have enjoyed noticeable success in that field. These indexes are evaluated and compared by applying them on various test images, including synthetic images corrupted with noise of varying levels, and simulated volumetric MRI datasets. Comparative analysis is also presented to show whether the validity index indicates the optimal clustering for our datasets.

  5. 数字人图像的自动分割方法%Automatic Segmentation of Digital Human Images

    Institute of Scientific and Technical Information of China (English)

    罗洪艳; 李敏; 张绍祥; 郑小林; 谭立文; 刘宁

    2011-01-01

    为克服现有方法对数字人切片图像分割中人工参与的依赖,提出了一种基于连通域标记和K-均值聚类的数字人脑彩色切片图像分割方法.该方法首先通过连通域标记分割出脑组织的初始区域,再通过腐蚀操作精确提取脑组织,然后在RGB(红绿蓝)空间内借助直方图确定聚类中心,以欧几里得距离为判断标准实现对白质的K-均值聚类分割.采用首例中国女性数字化可视人体数据集的序列脑切片图像进行实验,定性和定量分析结果表明,该方法分割准确度高,连续分割性能稳定,能够较好地实现颅脑分离与脑内深度结构的自动提取.%In order to reduce the manual intervention involved in the existing segmentation methods of digital human slice images, an algorithm based on the connected component labeling and the K-means clustering is proposed. In this algorithm, first, the initial region of brain tissue is segmented via the connected component labeling and is refined via erosion. Then, a K-means clustering is adopted to extract the white matter, in which the color histogram is used to determine the clustering centers and the Euclidian distance is considered as the judging criterion. The proposed algorithm is finally applied to the segmentation of the sequential brain slice images from the first Chinese female visible human dataset. The qualitative and quantitative analyses of experimental results indicate that the proposed algorithm is of high segmentation accuracy and strong stability, and that it can be used to the automatic separation of skull from the brain tissue and to the automatic extraction of structures in deep brain.

  6. Microscopic Halftone Image Segmentation

    Institute of Scientific and Technical Information of China (English)

    WANG Yong-gang; YANG Jie; DING Yong-sheng

    2004-01-01

    Microscopic halftone image recognition and analysis can provide quantitative evidence for printing quality control and fault diagnosis of printing devices, while halftone image segmentation is one of the significant steps during the procedure. Automatic segmentation on microscopic dots by the aid of the Fuzzy C-Means (FCM) method that takes account of the fuzziness of halftone image and utilizes its color information adequately is realized. Then some examples show the technique effective and simple with better performance of noise immunity than some usual methods. In addition, the segmentation results obtained by the FCM in different color spaces are compared, which indicates that the method using the FCM in the f1f2f3 color space is superior to the rest.

  7. ACM-based automatic liver segmentation from 3-D CT images by combining multiple atlases and improved mean-shift techniques.

    Science.gov (United States)

    Ji, Hongwei; He, Jiangping; Yang, Xin; Deklerck, Rudi; Cornelis, Jan

    2013-05-01

    In this paper, we present an autocontext model(ACM)-based automatic liver segmentation algorithm, which combines ACM, multiatlases, and mean-shift techniques to segment liver from 3-D CT images. Our algorithm is a learning-based method and can be divided into two stages. At the first stage, i.e., the training stage, ACM is performed to learn a sequence of classifiers in each atlas space (based on each atlas and other aligned atlases). With the use of multiple atlases, multiple sequences of ACM-based classifiers are obtained. At the second stage, i.e., the segmentation stage, the test image will be segmented in each atlas space by applying each sequence of ACM-based classifiers. The final segmentation result will be obtained by fusing segmentation results from all atlas spaces via a multiclassifier fusion technique. Specially, in order to speed up segmentation, given a test image, we first use an improved mean-shift algorithm to perform over-segmentation and then implement the region-based image labeling instead of the original inefficient pixel-based image labeling. The proposed method is evaluated on the datasets of MICCAI 2007 liver segmentation challenge. The experimental results show that the average volume overlap error and the average surface distance achieved by our method are 8.3% and 1.5 m, respectively, which are comparable to the results reported in the existing state-of-the-art work on liver segmentation.

  8. Automatic Lung Segmentation in CT Images with Accurate Handling of the Hilar Region

    OpenAIRE

    De Nunzio, Giorgio; Tommasi, Eleonora; Agrusti, Antonella; Cataldo, Rosella; De Mitri, Ivan; Favetta, Marco; Maglio, Silvio; Massafra, Andrea; Quarta, Maurizio; Torsello, Massimo; Zecca, Ilaria; Bellotti, Roberto; Tangaro, Sabina; Calvini, Piero; Camarlinghi, Niccolò

    2009-01-01

    A fully automated and three-dimensional (3D) segmentation method for the identification of the pulmonary parenchyma in thorax X-ray computed tomography (CT) datasets is proposed. It is meant to be used as pre-processing step in the computer-assisted detection (CAD) system for malignant lung nodule detection that is being developed by the Medical Applications in a Grid Infrastructure Connection (MAGIC-5) Project. In this new approach the segmentation of the external airways (trachea and bronch...

  9. An Automatic Indirect Immunofluorescence Cell Segmentation System

    Directory of Open Access Journals (Sweden)

    Yung-Kuan Chan

    2014-01-01

    Full Text Available Indirect immunofluorescence (IIF with HEp-2 cells has been used for the detection of antinuclear autoantibodies (ANA in systemic autoimmune diseases. The ANA testing allows us to scan a broad range of autoantibody entities and to describe them by distinct fluorescence patterns. Automatic inspection for fluorescence patterns in an IIF image can assist physicians, without relevant experience, in making correct diagnosis. How to segment the cells from an IIF image is essential in developing an automatic inspection system for ANA testing. This paper focuses on the cell detection and segmentation; an efficient method is proposed for automatically detecting the cells with fluorescence pattern in an IIF image. Cell culture is a process in which cells grow under control. Cell counting technology plays an important role in measuring the cell density in a culture tank. Moreover, assessing medium suitability, determining population doubling times, and monitoring cell growth in cultures all require a means of quantifying cell population. The proposed method also can be used to count the cells from an image taken under a fluorescence microscope.

  10. Automatic 2D segmentation of airways in thorax computed tomography images; Segmentacao automatica 2D de vias aereas em imagens de tomografia computadorizada do torax

    Energy Technology Data Exchange (ETDEWEB)

    Cavalcante, Tarique da Silveira; Cortez, Paulo Cesar; Almeida, Thomaz Maia de, E-mail: tarique@lesc.ufc.br [Universidade Federal do Ceara (UFC), Fortaleza, CE (Brazil). Dept. de Engenharia de Teleinformatica; Felix, John Hebert da Silva [Universidade da Integracao Internacional da Lusofonia Afro-Brasileira (UNILAB), Redencao, CE (Brazil). Departamento de Energias; Holanda, Marcelo Alcantara [Universidade Federal do Ceara (UFC), Fortaleza, CE (Brazil). Fac. de Medicina

    2013-07-01

    Introduction: much of the world population is affected by pulmonary diseases, such as the bronchial asthma, bronchitis and bronchiectasis. The bronchial diagnosis is based on the airways state. In this sense, the automatic segmentation of the airways in Computed Tomography (CT) scans is a critical step in the aid to diagnosis of these diseases. Methods: this paper evaluates algorithms for airway automatic segmentation, using Neural Network Multilayer Perceptron (MLP) and Lung Densities Analysis (LDA) for detecting airways, along with Region Growing (RG), Active Contour Method (ACM) Balloon and Topology Adaptive to segment them. Results: we obtained results in three stages: comparative analysis of the detection algorithms MLP and LDA, with a gold standard acquired by three physicians with expertise in CT imaging of the chest; comparative analysis of segmentation algorithms ACM Balloon, ACM Topology Adaptive, MLP and RG; and evaluation of possible combinations between segmentation and detection algorithms, resulting in the complete method for automatic segmentation of the airways in 2D. Conclusion: the low incidence of false negative and the significant reduction of false positive, results in similarity coefficient and sensitivity exceeding 91% and 87% respectively, for a combination of algorithms with satisfactory segmentation quality. (author)

  11. New Technique for Automatic Segmentation of Blood Vessels in CT Scan Images of Liver Based on Optimized Fuzzy C-Means Method

    Directory of Open Access Journals (Sweden)

    Katayoon Ahmadi

    2016-01-01

    Full Text Available Automatic segmentation of medical CT scan images is one of the most challenging fields in digital image processing. The goal of this paper is to discuss the automatic segmentation of CT scan images to detect and separate vessels in the liver. The segmentation of liver vessels is very important in the liver surgery planning and identifying the structure of vessels and their relationship to tumors. Fuzzy C-means (FCM method has already been proposed for segmentation of liver vessels. Due to classical optimization process, this method suffers lack of sensitivity to the initial values of ​​class centers and segmentation of local minima. In this article, a method based on FCM in conjunction with genetic algorithms (GA is applied for segmentation of liver’s blood vessels. This method was simulated and validated using 20 CT scan images of the liver. The results showed that the accuracy, sensitivity, specificity, and CPU time of new method in comparison with FCM algorithm reaching up to 91%, 83.62, 94.11%, and 27.17 were achieved, respectively. Moreover, selection of optimal and robust parameters in the initial step led to rapid convergence of the proposed method. The outcome of this research assists medical teams in estimating disease progress and selecting proper treatments.

  12. Spatial context learning approach to automatic segmentation of pleural effusion in chest computed tomography images

    Science.gov (United States)

    Mansoor, Awais; Casas, Rafael; Linguraru, Marius G.

    2016-03-01

    Pleural effusion is an abnormal collection of fluid within the pleural cavity. Excessive accumulation of pleural fluid is an important bio-marker for various illnesses, including congestive heart failure, pneumonia, metastatic cancer, and pulmonary embolism. Quantification of pleural effusion can be indicative of the progression of disease as well as the effectiveness of any treatment being administered. Quantification, however, is challenging due to unpredictable amounts and density of fluid, complex topology of the pleural cavity, and the similarity in texture and intensity of pleural fluid to the surrounding tissues in computed tomography (CT) scans. Herein, we present an automated method for the segmentation of pleural effusion in CT scans based on spatial context information. The method consists of two stages: first, a probabilistic pleural effusion map is created using multi-atlas segmentation. The probabilistic map assigns a priori probabilities to the presence of pleural uid at every location in the CT scan. Second, a statistical pattern classification approach is designed to annotate pleural regions using local descriptors based on a priori probabilities, geometrical, and spatial features. Thirty seven CT scans from a diverse patient population containing confirmed cases of minimal to severe amounts of pleural effusion were used to validate the proposed segmentation method. An average Dice coefficient of 0.82685 and Hausdorff distance of 16.2155 mm was obtained.

  13. First performance evaluation of software for automatic segmentation, labeling and reformation of anatomical aligned axial images of the thoracolumbar spine at CT

    Energy Technology Data Exchange (ETDEWEB)

    Scholtz, Jan-Erik, E-mail: janerikscholtz@gmail.com; Wichmann, Julian L.; Kaup, Moritz; Fischer, Sebastian; Kerl, J. Matthias; Lehnert, Thomas; Vogl, Thomas J.; Bauer, Ralf W.

    2015-03-15

    Highlights: •Automatic segmentation and labeling of the thoracolumbar spine. •Automatically generated double-angulated and aligned axial images of spine segments. •High grade of accurateness for the symmetric depiction of anatomical structures. •Time-saving and may improve workflow in daily practice. -- Abstract: Objectives: To evaluate software for automatic segmentation, labeling and reformation of anatomical aligned axial images of the thoracolumbar spine on CT in terms of accuracy, potential for time savings and workflow improvement. Material and methods: 77 patients (28 women, 49 men, mean age 65.3 ± 14.4 years) with known or suspected spinal disorders (degenerative spine disease n = 32; disc herniation n = 36; traumatic vertebral fractures n = 9) underwent 64-slice MDCT with thin-slab reconstruction. Time for automatic labeling of the thoracolumbar spine and reconstruction of double-angulated axial images of the pathological vertebrae was compared with manually performed reconstruction of anatomical aligned axial images. Reformatted images of both reconstruction methods were assessed by two observers regarding accuracy of symmetric depiction of anatomical structures. Results: In 33 cases double-angulated axial images were created in 1 vertebra, in 28 cases in 2 vertebrae and in 16 cases in 3 vertebrae. Correct automatic labeling was achieved in 72 of 77 patients (93.5%). Errors could be manually corrected in 4 cases. Automatic labeling required 1 min in average. In cases where anatomical aligned axial images of 1 vertebra were created, reconstructions made by hand were significantly faster (p < 0.05). Automatic reconstruction was time-saving in cases of 2 and more vertebrae (p < 0.05). Both reconstruction methods revealed good image quality with excellent inter-observer agreement. Conclusion: The evaluated software for automatic labeling and anatomically aligned, double-angulated axial image reconstruction of the thoracolumbar spine on CT is time

  14. Automatic Segmentation of the Eye in 3D Magnetic Resonance Imaging: A Novel Statistical Shape Model for Treatment Planning of Retinoblastoma

    Energy Technology Data Exchange (ETDEWEB)

    Ciller, Carlos, E-mail: carlos.cillerruiz@unil.ch [Department of Radiology, Lausanne University Hospital and University of Lausanne, Lausanne (Switzerland); Ophthalmic Technology Group, ARTORG Center of the University of Bern, Bern (Switzerland); Centre d’Imagerie BioMédicale, University of Lausanne, Lausanne (Switzerland); De Zanet, Sandro I.; Rüegsegger, Michael B. [Ophthalmic Technology Group, ARTORG Center of the University of Bern, Bern (Switzerland); Department of Ophthalmology, Inselspital, Bern University Hospital, Bern (Switzerland); Pica, Alessia [Department of Radiation Oncology, Inselspital, Bern University Hospital, Bern (Switzerland); Sznitman, Raphael [Ophthalmic Technology Group, ARTORG Center of the University of Bern, Bern (Switzerland); Department of Ophthalmology, Inselspital, Bern University Hospital, Bern (Switzerland); Thiran, Jean-Philippe [Department of Radiology, Lausanne University Hospital and University of Lausanne, Lausanne (Switzerland); Signal Processing Laboratory, École Polytechnique Fédérale de Lausanne, Lausanne (Switzerland); Maeder, Philippe [Department of Radiology, Lausanne University Hospital and University of Lausanne, Lausanne (Switzerland); Munier, Francis L. [Unit of Pediatric Ocular Oncology, Jules Gonin Eye Hospital, Lausanne (Switzerland); Kowal, Jens H. [Ophthalmic Technology Group, ARTORG Center of the University of Bern, Bern (Switzerland); Department of Ophthalmology, Inselspital, Bern University Hospital, Bern (Switzerland); and others

    2015-07-15

    Purpose: Proper delineation of ocular anatomy in 3-dimensional (3D) imaging is a big challenge, particularly when developing treatment plans for ocular diseases. Magnetic resonance imaging (MRI) is presently used in clinical practice for diagnosis confirmation and treatment planning for treatment of retinoblastoma in infants, where it serves as a source of information, complementary to the fundus or ultrasonographic imaging. Here we present a framework to fully automatically segment the eye anatomy for MRI based on 3D active shape models (ASM), and we validate the results and present a proof of concept to automatically segment pathological eyes. Methods and Materials: Manual and automatic segmentation were performed in 24 images of healthy children's eyes (3.29 ± 2.15 years of age). Imaging was performed using a 3-T MRI scanner. The ASM consists of the lens, the vitreous humor, the sclera, and the cornea. The model was fitted by first automatically detecting the position of the eye center, the lens, and the optic nerve, and then aligning the model and fitting it to the patient. We validated our segmentation method by using a leave-one-out cross-validation. The segmentation results were evaluated by measuring the overlap, using the Dice similarity coefficient (DSC) and the mean distance error. Results: We obtained a DSC of 94.90 ± 2.12% for the sclera and the cornea, 94.72 ± 1.89% for the vitreous humor, and 85.16 ± 4.91% for the lens. The mean distance error was 0.26 ± 0.09 mm. The entire process took 14 seconds on average per eye. Conclusion: We provide a reliable and accurate tool that enables clinicians to automatically segment the sclera, the cornea, the vitreous humor, and the lens, using MRI. We additionally present a proof of concept for fully automatically segmenting eye pathology. This tool reduces the time needed for eye shape delineation and thus can help clinicians when planning eye treatment and confirming the extent of the tumor.

  15. A learning-based automatic spinal MRI segmentation

    Science.gov (United States)

    Liu, Xiaoqing; Samarabandu, Jagath; Garvin, Greg; Chhem, Rethy; Li, Shuo

    2008-03-01

    Image segmentation plays an important role in medical image analysis and visualization since it greatly enhances the clinical diagnosis. Although many algorithms have been proposed, it is still challenging to achieve an automatic clinical segmentation which requires speed and robustness. Automatically segmenting the vertebral column in Magnetic Resonance Imaging (MRI) image is extremely challenging as variations in soft tissue contrast and radio-frequency (RF) in-homogeneities cause image intensity variations. Moveover, little work has been done in this area. We proposed a generic slice-independent, learning-based method to automatically segment the vertebrae in spinal MRI images. A main feature of our contributions is that the proposed method is able to segment multiple images of different slices simultaneously. Our proposed method also has the potential to be imaging modality independent as it is not specific to a particular imaging modality. The proposed method consists of two stages: candidate generation and verification. The candidate generation stage is aimed at obtaining the segmentation through the energy minimization. In this stage, images are first partitioned into a number of image regions. Then, Support Vector Machines (SVM) is applied on those pre-partitioned image regions to obtain the class conditional distributions, which are then fed into an energy function and optimized with the graph-cut algorithm. The verification stage applies domain knowledge to verify the segmented candidates and reject unsuitable ones. Experimental results show that the proposed method is very efficient and robust with respect to image slices.

  16. Automatic Speech Segmentation Based on HMM

    Directory of Open Access Journals (Sweden)

    M. Kroul

    2007-06-01

    Full Text Available This contribution deals with the problem of automatic phoneme segmentation using HMMs. Automatization of speech segmentation task is important for applications, where large amount of data is needed to process, so manual segmentation is out of the question. In this paper we focus on automatic segmentation of recordings, which will be used for triphone synthesis unit database creation. For speech synthesis, the speech unit quality is a crucial aspect, so the maximal accuracy in segmentation is needed here. In this work, different kinds of HMMs with various parameters have been trained and their usefulness for automatic segmentation is discussed. At the end of this work, some segmentation accuracy tests of all models are presented.

  17. SU-E-J-142: Performance Study of Automatic Image-Segmentation Algorithms in Motion Tracking Via MR-IGRT

    Energy Technology Data Exchange (ETDEWEB)

    Feng, Y; Olsen, J.; Parikh, P.; Noel, C; Wooten, H; Du, D; Mutic, S; Hu, Y [Washington University, St. Louis, MO (United States); Kawrakow, I; Dempsey, J [Washington University, St. Louis, MO (United States); ViewRay Co., Oakwood Village, OH (United States)

    2014-06-01

    Purpose: Evaluate commonly used segmentation algorithms on a commercially available real-time MR image guided radiotherapy (MR-IGRT) system (ViewRay), compare the strengths and weaknesses of each method, with the purpose of improving motion tracking for more accurate radiotherapy. Methods: MR motion images of bladder, kidney, duodenum, and liver tumor were acquired for three patients using a commercial on-board MR imaging system and an imaging protocol used during MR-IGRT. A series of 40 frames were selected for each case to cover at least 3 respiratory cycles. Thresholding, Canny edge detection, fuzzy k-means (FKM), k-harmonic means (KHM), and reaction-diffusion level set evolution (RD-LSE), along with the ViewRay treatment planning and delivery system (TPDS) were included in the comparisons. To evaluate the segmentation results, an expert manual contouring of the organs or tumor from a physician was used as a ground-truth. Metrics value of sensitivity, specificity, Jaccard similarity, and Dice coefficient were computed for comparison. Results: In the segmentation of single image frame, all methods successfully segmented the bladder and kidney, but only FKM, KHM and TPDS were able to segment the liver tumor and the duodenum. For segmenting motion image series, the TPDS method had the highest sensitivity, Jarccard, and Dice coefficients in segmenting bladder and kidney, while FKM and KHM had a slightly higher specificity. A similar pattern was observed when segmenting the liver tumor and the duodenum. The Canny method is not suitable for consistently segmenting motion frames in an automated process, while thresholding and RD-LSE cannot consistently segment a liver tumor and the duodenum. Conclusion: The study compared six different segmentation methods and showed the effectiveness of the ViewRay TPDS algorithm in segmenting motion images during MR-IGRT. Future studies include a selection of conformal segmentation methods based on image/organ-specific information

  18. Automatic segmentation of up to ten layer boundaries in SD-OCT images of the mouse retina with and without missing layers due to pathology.

    Science.gov (United States)

    Srinivasan, Pratul P; Heflin, Stephanie J; Izatt, Joseph A; Arshavsky, Vadim Y; Farsiu, Sina

    2014-02-01

    Accurate quantification of retinal layer thicknesses in mice as seen on optical coherence tomography (OCT) is crucial for the study of numerous ocular and neurological diseases. However, manual segmentation is time-consuming and subjective. Previous attempts to automate this process were limited to high-quality scans from mice with no missing layers or visible pathology. This paper presents an automatic approach for segmenting retinal layers in spectral domain OCT images using sparsity based denoising, support vector machines, graph theory, and dynamic programming (S-GTDP). Results show that this method accurately segments all present retinal layer boundaries, which can range from seven to ten, in wild-type and rhodopsin knockout mice as compared to manual segmentation and has a more accurate performance as compared to the commercial automated Diver segmentation software.

  19. A Multiscale Approach to Automatic Medical Image Segmentation Using Self—Organizing Map

    Institute of Scientific and Technical Information of China (English)

    马峰; 夏绍玮

    1998-01-01

    In this paper,a new medical image classification scheme is proposed using selforganizing map(SOM)combined with multiscale technique.It addresses the problem of the handling of edge pixels in the traditional multiscale SOM classifiers.First,to solve the difficulty in manual selection of edge pixels,a multiscale edge detection algorithm based on wavelet transform is proposed.Edge pixels detected are then selected into the training set as a new class and a multiscale SOM classifier is trained using this training set.In this new scheme,the SOM classifier can perform both the classification on the entire image and the edge detection simultaneously.On the other hand,the misclassification of the traditional multiscale SOM classifier in regions near edges is graeatly reduced and the correct classification is improved at the same time.

  20. Automatic Segmentation of Vessels in In-Vivo Ultrasound Scans

    DEFF Research Database (Denmark)

    Tamimi-Sarnikowski, Philip; Brink-Kjær, Andreas; Moshavegh, Ramin

    2017-01-01

    Ultrasound has become highly popular to monitor atherosclerosis, by scanning the carotid artery. The screening involves measuring the thickness of the vessel wall and diameter of the lumen. An automatic segmentation of the vessel lumen, can enable the determination of lumen diameter. This paper...... presents a fully automatic segmentation algorithm, for robustly segmenting the vessel lumen in longitudinal B-mode ultrasound images. The automatic segmentation is performed using a combination of B-mode and power Doppler images. The proposed algorithm includes a series of preprocessing steps, and performs...... a vessel segmentation by use of the marker-controlled watershed transform. The ultrasound images used in the study were acquired using the bk3000 ultrasound scanner (BK Ultrasound, Herlev, Denmark) with two transducers ”8L2 Linear” and ”10L2w Wide Linear” (BK Ultrasound, Herlev, Denmark). The algorithm...

  1. Medical image segmentation by MDP model

    Science.gov (United States)

    Lu, Yisu; Chen, Wufan

    2011-11-01

    MDP (Dirichlet Process Mixtures) model is applied to segment medical images in this paper. Segmentation can been automatically done without initializing segmentation class numbers. The MDP model segmentation algorithm is used to segment natural images and MR (Magnetic Resonance) images in the paper. To demonstrate the accuracy of the MDP model segmentation algorithm, many compared experiments, such as EM (Expectation Maximization) image segmentation algorithm, K-means image segmentation algorithm and MRF (Markov Field) image segmentation algorithm, have been done to segment medical MR images. All the methods are also analyzed quantitatively by using DSC (Dice Similarity Coefficients). The experiments results show that DSC of MDP model segmentation algorithm of all slices exceed 90%, which show that the proposed method is robust and accurate.

  2. Automatic lobar segmentation for diseased lungs using an anatomy-based priority knowledge in low-dose CT images

    Science.gov (United States)

    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.

  3. 压缩域中基于自动标记的图像分割%Image segmentation based on automatic markers in compressed domain

    Institute of Scientific and Technical Information of China (English)

    孙宁; 肖国强; 杨恒; 邱开金

    2012-01-01

    针对传统像素域中图像分割算法计算复杂的缺陷,提出了一种压缩域中快速图像分割算法.对图像分块,提取离散余弦变换(DCT)系数结合颜色矩作为块特征,利用支持向量机(SVM)实现对压缩域中图像决的自动标记,采用提出的阈值最小生成树(TMST)算法对已标记块进行区域生长,应用形态学相关算法对分割出的图像进行修补.通过Corel图像数据库对提出的方法进行验证,结果表明该方法能够更加快速有效地进行图像分割.%Due to the defect of image segmentation algorithm computational complexity in traditional pixel domain, this paper proposes a fast method for image segmentation in compressed domain. It segments images into blocks and marks image blocks automatically through Discrete Cosine Transform (DCT) coefficients and color moments in combination with Support Vector Machine (SVM) in compressed domain. It puts forward the Threshold Minimum Spanning Tree(TMST) algorithm to link marked blocks. It modifies and smooths edge of the segmented image according to morphology algorithm. The study validates the proposed method through Corel image database. The result indicates this algorithm is faster and more effective in image segmentation compared to previously proposed segmentation methods.

  4. Iris Pattern Segmentation using Automatic Segmentation and Window Technique

    OpenAIRE

    Swati Pandey; Prof. Rajeev Gupta

    2013-01-01

    A Biometric system is an automatic identification of an individual based on a unique feature or characteristic. Iris recognition has great advantage such as variability, stability and security. In thispaper, use the two methods for iris segmentation -An automatic segmentation method and Window method. Window method is a novel approach which comprises two steps first finds pupils' center andthen two radial coefficients because sometime pupil is not perfect circle. The second step extract the i...

  5. A COLOUR IMAGE AUTOMATIC SEGMENTATION ALGORITHM BASED ON VPCNN%一种基于矢量PCNN的彩色图像自动分割算法

    Institute of Scientific and Technical Information of China (English)

    刘勍; 马小姝; 张利军; 马义德; 董忠

    2011-01-01

    为了对彩色图像实施自动分割,在彩色图像RGB空间中,对传统PCNN模型进行了改进与推广,提出一种基于指数熵矢量脉冲耦合神经网络(VPCNN)彩色图像自动分割新算法.该方法在考虑VPCNN互联矢量神经元动态时空相似特性的同时,利用改进指数动态阈值矢量与神经元内部活动项矢量间的信息对比关系确定分割图像的目标和背景区域,结合最大指数熵判据来达到彩色图像的自动分割,并与最大香农熵准则VPCNN分割方法做了比较.实验结果表明:算法具有图像分割精度高、适应性强、能较好地保持彩色图像边缘和细节等信息的优点.%In order to execute colour image automatic segmentation, in the colour image RGB space, the traditional pulse couple neural networks (PCNN) is improved and popularised. A colour image automatic segmentation algorithm based on exponent entropy vector pulse coupling neural networks (VPCNN) is put forward. While taking into account VPCNN linking vector neurons' dynamic temporal-spatial similarities , the method takes advantage of improving the information comparison between exponent dynamic threshold vector and neuron interior activity item vectors to confirm how to segment image target and background area, combine maximum exponent entropy fact to realize colour image automatic segmentation and make comparison against maximum Shannon entropy principle VPCNN segmentation method. Experimental result shows that the algorithm described in the article is precise at image segmentation, strong at adaptivity, and complete at preserving colour image edges, details and so on.

  6. SU-E-J-238: Monitoring Lymph Node Volumes During Radiotherapy Using Semi-Automatic Segmentation of MRI Images

    Energy Technology Data Exchange (ETDEWEB)

    Veeraraghavan, H; Tyagi, N; Riaz, N; McBride, S; Lee, N; Deasy, J [Memorial Sloan-Kettering Cancer Center, NY, NY (United States)

    2014-06-01

    Purpose: Identification and image-based monitoring of lymph nodes growing due to disease, could be an attractive alternative to prophylactic head and neck irradiation. We evaluated the accuracy of the user-interactive Grow Cut algorithm for volumetric segmentation of radiotherapy relevant lymph nodes from MRI taken weekly during radiotherapy. Method: The algorithm employs user drawn strokes in the image to volumetrically segment multiple structures of interest. We used a 3D T2-wturbo spin echo images with an isotropic resolution of 1 mm3 and FOV of 492×492×300 mm3 of head and neck cancer patients who underwent weekly MR imaging during the course of radiotherapy. Various lymph node (LN) levels (N2, N3, N4'5) were individually contoured on the weekly MR images by an expert physician and used as ground truth in our study. The segmentation results were compared with the physician drawn lymph nodes based on DICE similarity score. Results: Three head and neck patients with 6 weekly MR images were evaluated. Two patients had level 2 LN drawn and one patient had level N2, N3 and N4'5 drawn on each MR image. The algorithm took an average of a minute to segment the entire volume (512×512×300 mm3). The algorithm achieved an overall DICE similarity score of 0.78. The time taken for initializing and obtaining the volumetric mask was about 5 mins for cases with only N2 LN and about 15 mins for the case with N2,N3 and N4'5 level nodes. The longer initialization time for the latter case was due to the need for accurate user inputs to separate overlapping portions of the different LN. The standard deviation in segmentation accuracy at different time points was utmost 0.05. Conclusions: Our initial evaluation of the grow cut segmentation shows reasonably accurate and consistent volumetric segmentations of LN with minimal user effort and time.

  7. Automatic segmentation of pulmonary segments from volumetric chest CT scans.

    NARCIS (Netherlands)

    Rikxoort, E.M. van; Hoop, B. de; Vorst, S. van de; Prokop, M.; Ginneken, B. van

    2009-01-01

    Automated extraction of pulmonary anatomy provides a foundation for computerized analysis of computed tomography (CT) scans of the chest. A completely automatic method is presented to segment the lungs, lobes and pulmonary segments from volumetric CT chest scans. The method starts with lung segmenta

  8. Semi-automatic segmentation and modeling of the cervical spinal cord for volume quantification in multiple sclerosis patients from magnetic resonance images

    Science.gov (United States)

    Sonkova, Pavlina; Evangelou, Iordanis E.; Gallo, Antonio; Cantor, Fredric K.; Ohayon, Joan; McFarland, Henry F.; Bagnato, Francesca

    2008-03-01

    Spinal cord (SC) tissue loss is known to occur in some patients with multiple sclerosis (MS), resulting in SC atrophy. Currently, no measurement tools exist to determine the magnitude of SC atrophy from Magnetic Resonance Images (MRI). We have developed and implemented a novel semi-automatic method for quantifying the cervical SC volume (CSCV) from Magnetic Resonance Images (MRI) based on level sets. The image dataset consisted of SC MRI exams obtained at 1.5 Tesla from 12 MS patients (10 relapsing-remitting and 2 secondary progressive) and 12 age- and gender-matched healthy volunteers (HVs). 3D high resolution image data were acquired using an IR-FSPGR sequence acquired in the sagittal plane. The mid-sagittal slice (MSS) was automatically located based on the entropy calculation for each of the consecutive sagittal slices. The image data were then pre-processed by 3D anisotropic diffusion filtering for noise reduction and edge enhancement before segmentation with a level set formulation which did not require re-initialization. The developed method was tested against manual segmentation (considered ground truth) and intra-observer and inter-observer variability were evaluated.

  9. Automatic segmentation of 4D cardiac MR images for extraction of ventricular chambers using a spatio-temporal approach

    Science.gov (United States)

    Atehortúa, Angélica; Zuluaga, Maria A.; Ourselin, Sébastien; Giraldo, Diana; Romero, Eduardo

    2016-03-01

    An accurate ventricular function quantification is important to support evaluation, diagnosis and prognosis of several cardiac pathologies. However, expert heart delineation, specifically for the right ventricle, is a time consuming task with high inter-and-intra observer variability. A fully automatic 3D+time heart segmentation framework is herein proposed for short-axis-cardiac MRI sequences. This approach estimates the heart using exclusively information from the sequence itself without tuning any parameters. The proposed framework uses a coarse-to-fine approach, which starts by localizing the heart via spatio-temporal analysis, followed by a segmentation of the basal heart that is then propagated to the apex by using a non-rigid-registration strategy. The obtained volume is then refined by estimating the ventricular muscle by locally searching a prior endocardium- pericardium intensity pattern. The proposed framework was applied to 48 patients datasets supplied by the organizers of the MICCAI 2012 Right Ventricle segmentation challenge. Results show the robustness, efficiency and competitiveness of the proposed method both in terms of accuracy and computational load.

  10. Neural network for image segmentation

    Science.gov (United States)

    Skourikhine, Alexei N.; Prasad, Lakshman; Schlei, Bernd R.

    2000-10-01

    Image analysis is an important requirement of many artificial intelligence systems. Though great effort has been devoted to inventing efficient algorithms for image analysis, there is still much work to be done. It is natural to turn to mammalian vision systems for guidance because they are the best known performers of visual tasks. The pulse- coupled neural network (PCNN) model of the cat visual cortex has proven to have interesting properties for image processing. This article describes the PCNN application to the processing of images of heterogeneous materials; specifically PCNN is applied to image denoising and image segmentation. Our results show that PCNNs do well at segmentation if we perform image smoothing prior to segmentation. We use PCNN for obth smoothing and segmentation. Combining smoothing and segmentation enable us to eliminate PCNN sensitivity to the setting of the various PCNN parameters whose optimal selection can be difficult and can vary even for the same problem. This approach makes image processing based on PCNN more automatic in our application and also results in better segmentation.

  11. 基于自动参数标准化的指纹分割方法%Segmentation of Fingerprint Image Based on Automatic-parameter Normalization

    Institute of Scientific and Technical Information of China (English)

    吴健飞

    2008-01-01

    A combined method to segment fingerprint images, based on automatic-parameter normalization, is presented in this paper. Taking directional field and gray variance information in the fingerprint image into account,the method holds an efficient and robust feature. Compared with fixed-parameter normalization in former segmentation methods, the automatic-pa-rameter normalization presented in this paper can normalize the fingerprint image to a maximum extent while not deteriora-ting any local image feature.%提出了一种合成的指纹分割方法:基于自动参数标准化的指纹分割方法.这个方法应用指纹图像中方向图和灰度变化信息,具有高效性和强壮性的特点.与以往指纹分割方法中固定参数标准化相比,基于自动参数标准化的指纹分割方法可以把指纹图像最大程度的标准化而不会恶化指纹图像细节.

  12. A fully automatic, threshold-based segmentation method for the estimation of the Metabolic Tumor Volume from PET images: validation on 3D printed anthropomorphic oncological lesions

    Science.gov (United States)

    Gallivanone, F.; Interlenghi, M.; Canervari, C.; Castiglioni, I.

    2016-01-01

    18F-Fluorodeoxyglucose (18F-FDG) Positron Emission Tomography (PET) is a standard functional diagnostic technique to in vivo image cancer. Different quantitative paramters can be extracted from PET images and used as in vivo cancer biomarkers. Between PET biomarkers Metabolic Tumor Volume (MTV) has gained an important role in particular considering the development of patient-personalized radiotherapy treatment for non-homogeneous dose delivery. Different imaging processing methods have been developed to define MTV. The different proposed PET segmentation strategies were validated in ideal condition (e.g. in spherical objects with uniform radioactivity concentration), while the majority of cancer lesions doesn't fulfill these requirements. In this context, this work has a twofold objective: 1) to implement and optimize a fully automatic, threshold-based segmentation method for the estimation of MTV, feasible in clinical practice 2) to develop a strategy to obtain anthropomorphic phantoms, including non-spherical and non-uniform objects, miming realistic oncological patient conditions. The developed PET segmentation algorithm combines an automatic threshold-based algorithm for the definition of MTV and a k-means clustering algorithm for the estimation of the background. The method is based on parameters always available in clinical studies and was calibrated using NEMA IQ Phantom. Validation of the method was performed both in ideal (e.g. in spherical objects with uniform radioactivity concentration) and non-ideal (e.g. in non-spherical objects with a non-uniform radioactivity concentration) conditions. The strategy to obtain a phantom with synthetic realistic lesions (e.g. with irregular shape and a non-homogeneous uptake) consisted into the combined use of standard anthropomorphic phantoms commercially and irregular molds generated using 3D printer technology and filled with a radioactive chromatic alginate. The proposed segmentation algorithm was feasible in a

  13. 基于CS的SAR图像自动目标分割算法%Automatic Target Segmentation in SAR Images Using CS

    Institute of Scientific and Technical Information of China (English)

    杨萌; 张弓

    2011-01-01

    Object segmentation is an important step in SAR super-resolution processing and automatic target recognition. Considering image inherent sparse structures, an automatic target segmentation algorithm is proposed in this paper. First, a transformation matrix of dictionary is constructed to project the SAR image into a high dimensional space, and a sparse representation set of image local features is achieved. Second, a random sampling matrix is used to obtain its compression sampling and a mean-shift algorithm is applied to parallel process multiple sets of sample data. Finally, by using the sign test method, the SAR images data are classified as target pixels and background pixels classification. Experimental results demonstrate that the proposed algorithm has a good target segmentation results for hard target in synthetic aperture radar (SAR) images.%图像目标分割是SAR图像目标超分辨处理和自动目标识别的重要步骤.针对图像固有的稀疏结构,提出了一种SAR图像自动目标分割算法.通过构造变换字典将SAR图像数据投影到高维空间,实现了图像局部特征的稀疏表示,然后利用随机矩阵获得稀疏域局部特征的压缩采样,并对多组采样数据运用Mean-shift算法并行处理,最后通过符号检验法,实现了对目标像素与背景像素的分类.试验表明,该算法对硬目标具有较好的目标分割性能.

  14. Atlas Based Automatic Liver 3D CT Image Segmentation%基于图谱的肝脏CT三维自动分割研究

    Institute of Scientific and Technical Information of China (English)

    刘伟; 贾富仓; 胡庆茂; 王俊

    2011-01-01

    目的 在肝脏外科手术或肝脏病理研究中,计算肝脏体积是重要步骤.由于肝脏外形复杂、临近组织灰度值与之接近等特点,肝脏的自动医学图像分割仍是医学图像处理中的难点之一.方法 本文采用图谱结合3D非刚性配准的方法,同时加入肝脏区域搜索算法,实现了鲁棒性较高的肝脏自动分割程序.首先,利用20套训练图像创建图谱,然后程序自动搜索肝脏区域,最后将图谱与待分割CT图像依次进行仿射配准和B样条配准.配准以后的图谱肝脏轮廓即可表示为目标肝脏分割轮廓,进而计算出肝脏体积.结果 评估结果显示,上述方法在肝脏体积误差方面表现出色,达到77分,但在局部(主要在肝脏尖端)出现较大的误差.结论 该方法分割临床肝脏CT图像具有可行性.%Objective Liver segmentation is an important step for the planning and navigation in liver surgery. Accurate, fast and robust automatic segmentation methods for clinical routine data are urgently needed. Because of the liver- s characteristics, such as the complexity of the external form, the similarity between the intensities of the liver and the tissues around it, automatic segmentation of the liver is one of the difficulties in medical image processing. Methods In this paper, 3D non-rigid registration from a refined atlas to liver CT images is used for segmentation. Firstly, twenty sets of training images are utilized to create an atlas. Then the liver initial region is searched and located automatically. After that threshold filtering is used to enhance the robustness of segmentation. Finally, this atlas is non-rigidly registered to the liver in CT images with affine and B-spline in succession. The registered segmentation of liver- s atlas represented the segmentation of the target liver, and then the liver volume was calculated. Results The evaluation show that the proposed method works well in liver volume error, with the 77 score

  15. Dictionary Based Image Segmentation

    DEFF Research Database (Denmark)

    Dahl, Anders Bjorholm; Dahl, Vedrana Andersen

    2015-01-01

    We propose a method for weakly supervised segmentation of natural images, which may contain both textured or non-textured regions. Our texture representation is based on a dictionary of image patches. To divide an image into separated regions with similar texture we use an implicit level sets...... in an efficient implementation of our segmentation method. We experimentally validated our approach on a number of natural as well as composed images....

  16. Automatic segmentation of vertebrae from radiographs

    DEFF Research Database (Denmark)

    Mysling, Peter; Petersen, Peter Kersten; Nielsen, Mads

    2011-01-01

    Segmentation of vertebral contours is an essential task in the design of automatic tools for vertebral fracture assessment. In this paper, we propose a novel segmentation technique which does not require operator interaction. The proposed technique solves the segmentation problem in a hierarchical...... manner. In a first phase, a coarse estimate of the overall spine alignment and the vertebra locations is computed using a shape model sampling scheme. These samples are used to initialize a second phase of active shape model search, under a nonlinear model of vertebra appearance. The search...

  17. Optimal Elasticity cut-off value for discriminating Healthy to Pathological Fibrotic patients employing Fuzzy C-Means automatic segmentation in Liver Shear Wave Elastography images

    Science.gov (United States)

    Gatos, Ilias; Tsantis, Stavros; Skouroliakou, Aikaterini; Theotokas, Ioannis; Zoumpoulis, Pavlos S.; Kagadis, George C.

    2015-09-01

    The aim of the present study is to determine an optimal elasticity cut-off value for discriminating Healthy from Pathological fibrotic patients by means of Fuzzy C-Means automatic segmentation and maximum participation cluster mean value employment in Shear Wave Elastography (SWE) images. The clinical dataset comprised 32 subjects (16 Healthy and 16 histological or Fibroscan verified Chronic Liver Disease). An experienced Radiologist performed SWE measurement placing a region of interest (ROI) on each subject's right liver lobe providing a SWE image for each patient. Subsequently Fuzzy C-Means clustering was performed on every SWE image utilizing 5 clusters. Mean Stiffness value and pixels number of each cluster were calculated. The mean stiffness value feature of the cluster with maximum pixels number was then fed as input for ROC analysis. The selected Mean Stiffness value feature an Area Under the Curve (AUC) of 0.8633 with Optimum Cut-off value of 7.5 kPa with sensitivity and specificity values of 0.8438 and 0.875 and balanced accuracy of 0.8594. Examiner's classification measurements exhibited sensitivity, specificity and balanced accuracy value of 0.8125 with 7.1 kPa cutoff value. A new promising automatic algorithm was implemented with more objective criteria of defining optimum elasticity cut-off values for discriminating fibrosis stages for SWE. More subjects are needed in order to define if this algorithm is an objective tool to outperform manual ROI selection.

  18. Skin Images Segmentation

    Directory of Open Access Journals (Sweden)

    Ali E. Zaart

    2010-01-01

    Full Text Available Problem statement: Image segmentation is a fundamental step in many applications of image processing. Skin cancer has been the most common of all new cancers detected each year. At early stage detection of skin cancer, simple and economic treatment can cure it mostly. An accurate segmentation of skin images can help the diagnosis to define well the region of the cancer. The principal approach of segmentation is based on thresholding (classification that is lied to the problem of the thresholds estimation. Approach: The objective of this study is to develop a method to segment the skin images based on a mixture of Beta distributions. We assume that the data in skin images can be modeled by a mixture of Beta distributions. We used an unsupervised learning technique with Beta distribution to estimate the statistical parameters of the data in skin image and then estimate the thresholds for segmentation. Results: The proposed method of skin images segmentation was implemented and tested on different skin images. We obtained very good results in comparing with the same techniques with Gamma distribution. Conclusion: The experiment showed that the proposed method obtained very good results but it requires more testing on different types of skin images.

  19. Development of automatic surveillance of animal behaviour and welfare using image analysis and machine learned segmentation technique.

    Science.gov (United States)

    Nilsson, M; Herlin, A H; Ardö, H; Guzhva, O; Åström, K; Bergsten, C

    2015-11-01

    In this paper the feasibility to extract the proportion of pigs located in different areas of a pig pen by advanced image analysis technique is explored and discussed for possible applications. For example, pigs generally locate themselves in the wet dunging area at high ambient temperatures in order to avoid heat stress, as wetting the body surface is the major path to dissipate the heat by evaporation. Thus, the portion of pigs in the dunging area and resting area, respectively, could be used as an indicator of failure of controlling the climate in the pig environment as pigs are not supposed to rest in the dunging area. The computer vision methodology utilizes a learning based segmentation approach using several features extracted from the image. The learning based approach applied is based on extended state-of-the-art features in combination with a structured prediction framework based on a logistic regression solver using elastic net regularization. In addition, the method is able to produce a probability per pixel rather than form a hard decision. This overcomes some of the limitations found in a setup using grey-scale information only. The pig pen is a difficult imaging environment because of challenging lighting conditions like shadows, poor lighting and poor contrast between pig and background. In order to test practical conditions, a pen containing nine young pigs was filmed from a top view perspective by an Axis M3006 camera with a resolution of 640 × 480 in three, 10-min sessions under different lighting conditions. The results indicate that a learning based method improves, in comparison with greyscale methods, the possibility to reliable identify proportions of pigs in different areas of the pen. Pigs with a changed behaviour (location) in the pen may indicate changed climate conditions. Changed individual behaviour may also indicate inferior health or acute illness.

  20. XRA image segmentation using regression

    Science.gov (United States)

    Jin, Jesse S.

    1996-04-01

    Segmentation is an important step in image analysis. Thresholding is one of the most important approaches. There are several difficulties in segmentation, such as automatic selecting threshold, dealing with intensity distortion and noise removal. We have developed an adaptive segmentation scheme by applying the Central Limit Theorem in regression. A Gaussian regression is used to separate the distribution of background from foreground in a single peak histogram. The separation will help to automatically determine the threshold. A small 3 by 3 widow is applied and the modal of the local histogram is used to overcome noise. Thresholding is based on local weighting, where regression is used again for parameter estimation. A connectivity test is applied to the final results to remove impulse noise. We have applied the algorithm to x-ray angiogram images to extract brain arteries. The algorithm works well for single peak distribution where there is no valley in the histogram. The regression provides a method to apply knowledge in clustering. Extending regression for multiple-level segmentation needs further investigation.

  1. Weighted MRF Algorithm for Automatic Unsupervised Image Segmentation%变权重MRF算法在图像自动无监督分割中的应用

    Institute of Scientific and Technical Information of China (English)

    刘雪娜; 侯宝明

    2012-01-01

    In order to achieve the automatic unsupervised image segmentation, an algorithm based on the adaptive classification and the weighted MRF is proposed. First, combined with the MDL criterion, the number of image classification under the framework of Markov random fields is computed adaptively. And then, the weighted MRF algorithm is used to expand the option range of the potential function, thus to eliminate the complex calculation of the potential function. Finally, by using ICM algorithm to optimize the model, the segmentation image under MAP criterion is obtained. In the Matlab, test results show that the proposed algorithm is effective, which can correctly calculate the number of classification and effectively reduce the segmentation error.%为了实现图像的自动无监督分割,本文提出类自适应变权重马尔可夫随机场分割算法.首先结合最小描述长度准则,自适应计算马尔可夫随机场框架下的图像分类数;然后引入变权重的马尔可夫随机场算法,扩大势函数的选择范围,消除势函数的复杂计算;最后用迭代条件模式进行优化,获得最大后验概率准则下的分割图像.在Matlab环境中的测试结果表明,该算法具有实效性,能正确计算分类数,同时有效减少了分割错误.

  2. Unsupervised Performance Evaluation of Image Segmentation

    Directory of Open Access Journals (Sweden)

    Chabrier Sebastien

    2006-01-01

    Full Text Available We present in this paper a study of unsupervised evaluation criteria that enable the quantification of the quality of an image segmentation result. These evaluation criteria compute some statistics for each region or class in a segmentation result. Such an evaluation criterion can be useful for different applications: the comparison of segmentation results, the automatic choice of the best fitted parameters of a segmentation method for a given image, or the definition of new segmentation methods by optimization. We first present the state of art of unsupervised evaluation, and then, we compare six unsupervised evaluation criteria. For this comparative study, we use a database composed of 8400 synthetic gray-level images segmented in four different ways. Vinet's measure (correct classification rate is used as an objective criterion to compare the behavior of the different criteria. Finally, we present the experimental results on the segmentation evaluation of a few gray-level natural images.

  3. Automatic Image Segmentation Based on PCNN%基于 PCNN的自动图像分割

    Institute of Scientific and Technical Information of China (English)

    邓翔宇; 马义德

    2014-01-01

    Pulse Coupled Neural Network ( PCNN) model has been widely used in digital image processing , but there is still a problem for the determination of network parameters which at present is mostly determined manual -ly.Some self-adaptive algorithms are available , but the research and analysis on the model theory are still less . This paper proposes a method of automatic setting of parameters based on the maximum gray value firing at the minimum iteration times by analyzing the neuron firing characteristics of PCNN , and a new comprehensive evalu-ation criterion of selecting the optimal result is constructed on the basis of this method .It is used in Lena image , and the results are consistent with subjective assessment , which has quicker speed and better robust .%脉冲耦合神经网络( PCNN)模型在数字图像分割中得到了广泛的应用,但对网络参数的确定以及最优结果的选则一直是一个难题,主要是以人工经验为主,虽然提出了一些参数自动设置的算法,但都缺乏对模型本身数学理论的研究和分析。通过对PCNN网络神经元点火特性的分析,提出了一种基于图像最大灰度值最小时刻点火的参数自适应设定算法,并针对该算法构造了一种新的用于最优结果选择的判定准则。将其用于lena等图像分割中,取得了与主观评价相一致的结果,而且表现出更快的速度和较好的鲁棒性。

  4. Automatic segmentation of leg bones by using active contours.

    Science.gov (United States)

    Kim, Sunhee; Kim, Youngjun; Park, Sehyung; Lee, Deukhee

    2014-01-01

    In this paper, we present a new active contours model to segment human leg bones in computed tomography images that is based on a variable-weighted combination of local and global intensity. This model can split an object surrounded by both weak and strong boundaries, and also distinguish very adjacent objects with those boundaries. The ability of this model is required for segmentation in medical images, e.g., human leg bones, which are usually composed of highly inhomogeneous objects and where the distances among organs are very close. We developed an evolution equation of a level set function whose zero level set represents a contour. An initial contour is automatically obtained by applying a histogram based multiphase segmentation method. We experimented with computed tomography images from three patients, and demonstrate the efficiency of the proposed method in experimental results.

  5. Validation of a method of automatic segmentation for delineation of volumes in PET imaging for radiotherapy; Validacion de un metodo de segmentacion automatica para delineacion de volumenes en imagenes PET para radioterapia

    Energy Technology Data Exchange (ETDEWEB)

    Latorre Musoll, A.; Eudaldo Puell, T.; Ruiz Martinez, A.; Fernandez Leon, A.; Carrasco de Fez, P.; Jornet Sala, N.; Ribas Morales, M.

    2011-07-01

    Prior to clinical use of PET imaging for the delineation of BTV, has made a preliminary study on model, to validate the automatic segmentation tools based on thresholds of activity concentration, which implement both PET-CT equipment as the Eclipse planning system.

  6. Automatic cone photoreceptor segmentation using graph theory and dynamic programming.

    Science.gov (United States)

    Chiu, Stephanie J; Lokhnygina, Yuliya; Dubis, Adam M; Dubra, Alfredo; Carroll, Joseph; Izatt, Joseph A; Farsiu, Sina

    2013-06-01

    Geometrical analysis of the photoreceptor mosaic can reveal subclinical ocular pathologies. In this paper, we describe a fully automatic algorithm to identify and segment photoreceptors in adaptive optics ophthalmoscope images of the photoreceptor mosaic. This method is an extension of our previously described closed contour segmentation framework based on graph theory and dynamic programming (GTDP). We validated the performance of the proposed algorithm by comparing it to the state-of-the-art technique on a large data set consisting of over 200,000 cones and posted the results online. We found that the GTDP method achieved a higher detection rate, decreasing the cone miss rate by over a factor of five.

  7. Robust, accurate and fast automatic segmentation of the spinal cord.

    Science.gov (United States)

    De Leener, Benjamin; Kadoury, Samuel; Cohen-Adad, Julien

    2014-09-01

    Spinal cord segmentation provides measures of atrophy and facilitates group analysis via inter-subject correspondence. Automatizing this procedure enables studies with large throughput and minimizes user bias. Although several automatic segmentation methods exist, they are often restricted in terms of image contrast and field-of-view. This paper presents a new automatic segmentation method (PropSeg) optimized for robustness, accuracy and speed. The algorithm is based on the propagation of a deformable model and is divided into three parts: firstly, an initialization step detects the spinal cord position and orientation using a circular Hough transform on multiple axial slices rostral and caudal to the starting plane and builds an initial elliptical tubular mesh. Secondly, a low-resolution deformable model is propagated along the spinal cord. To deal with highly variable contrast levels between the spinal cord and the cerebrospinal fluid, the deformation is coupled with a local contrast-to-noise adaptation at each iteration. Thirdly, a refinement process and a global deformation are applied on the propagated mesh to provide an accurate segmentation of the spinal cord. Validation was performed in 15 healthy subjects and two patients with spinal cord injury, using T1- and T2-weighted images of the entire spinal cord and on multiecho T2*-weighted images. Our method was compared against manual segmentation and against an active surface method. Results show high precision for all the MR sequences. Dice coefficients were 0.9 for the T1- and T2-weighted cohorts and 0.86 for the T2*-weighted images. The proposed method runs in less than 1min on a normal computer and can be used to quantify morphological features such as cross-sectional area along the whole spinal cord.

  8. Segmentation of elongated structures in medical images

    NARCIS (Netherlands)

    Staal, Jozef Johannes

    2004-01-01

    The research described in this thesis concerns the automatic detection, recognition and segmentation of elongated structures in medical images. For this purpose techniques have been developed to detect subdimensional pointsets (e.g. ridges, edges) in images of arbitrary dimension. These pointsets ar

  9. Image Series Segmentation and Improved MC Algorithm

    Institute of Scientific and Technical Information of China (English)

    WAN Wei-bing; SHI Peng-fei

    2008-01-01

    A semiautomatic segmentation method based on active contour is proposed for computed tomog-raphy (CT) image series. First, to get initial contour, one image slice was segmented exactly by C-V method based on Mumford-Shah model. Next, the computer will segment the nearby slice automatically using the snake model one by one. During segmenting of image slices, former slice boundary, as next slice initial con-tour, may cross over next slice real boundary and never return to right position. To avoid contour skipping over, the distance variance between two slices is evaluated by an threshold, which decides whether to initiate again. Moreover, a new improved marching cubes (MC) algorithm based on 2D images series segmentation boundary is given for 3D image reconstruction. Compared with the standard method, the proposed algorithm reduces detecting time and needs less storing memory. The effectiveness and capabilities of the algorithm were illustrated by experimental results.

  10. Image segmentation based on competitive learning

    Institute of Scientific and Technical Information of China (English)

    ZHANG Jing; LIU Qun; Baikunth Nath

    2004-01-01

    Image segment is a primary step in image analysis of unexploded ordnance (UXO) detection by ground p enetrating radar (GPR) sensor which is accompanied with a lot of noises and other elements that affect the recognition of real target size. In this paper we bring forward a new theory, that is, we look the weight sets as target vector sets which is the new cues in semi-automatic segmentation to form the final image segmentation. The experiment results show that the measure size of target with our method is much smaller than the size with other methods and close to the real size of target.

  11. A Geometric Approach For Fully Automatic Chromosome Segmentation

    CERN Document Server

    Minaee, Shervin; Khalaj, Babak Hossein

    2011-01-01

    Chromosome segmentation is a fundamental task in human chromosome analysis. Most of previous methods for separation between touching chromosomes require human intervention. In this paper, a geometry based method is used for automatic chromosome segmentation. This method can be divided into two phases. In the first phase, chromosome clusters are detected using three geometric criteria and in the second phase chromosome clusters are separated using a proper cut line. However, most earlier methods do not work well with chromosome clusters that contain more than two chromosomes. Our method, on the other hand, has a high efficiency in separation of chromosome clusters in such scenarios. Another advantage of the proposed method is that it can easily apply to any type of images such as binary images. This is due to the fact that the proposed scheme uses the geometric features of chromosomes which are independent of the type of images. The performance of the proposed scheme is demonstrated on a database containing to...

  12. Statistical Images Segmentation

    Directory of Open Access Journals (Sweden)

    Corina Curilă

    2008-05-01

    Full Text Available This paper deals with fuzzy statistical imagesegmentation. We introduce a new hierarchicalMarkovian fuzzy hidden field model, which extends to thefuzzy case the classical Pérez and Heitz hard model. Twofuzzy statistical segmentation methods related with themodel proposed are defined in this paper and we show viasimulations that they are competitive with, in some casesthan, the classical Maximum Posterior Mode (MPMbased methods. Furthermore, they are faster, which willshould facilitate extensions to more than two hard classesin future work. In addition, the model proposed isapplicable to the multiscale segmentation andmultiresolution images fusion problems.

  13. Automatic segmentation of head and neck CT images for radiotherapy treatment planning using multiple atlases, statistical appearance models, and geodesic active contours

    Energy Technology Data Exchange (ETDEWEB)

    Fritscher, Karl D., E-mail: Karl.Fritscher@umit.at; Sharp, Gregory [Department for Radiation Oncology, Massachusetts General Hospital, Boston, Massachusetts 02114 (United States); Peroni, Marta [Paul Scherrer Institut, Villigen 5232 (Switzerland); Zaffino, Paolo; Spadea, Maria Francesca [Department of Experimental and Clinical Medicine, Magna Graecia University, Catanzaro 88100 (Italy); Schubert, Rainer [Institute for Biomedical Image Analysis, Private University of Health Sciences, Medical Informatics and Technology, Hall in Tirol 6060 (Austria)

    2014-05-15

    Purpose: Accurate delineation of organs at risk (OARs) is a precondition for intensity modulated radiation therapy. However, manual delineation of OARs is time consuming and prone to high interobserver variability. Because of image artifacts and low image contrast between different structures, however, the number of available approaches for autosegmentation of structures in the head-neck area is still rather low. In this project, a new approach for automated segmentation of head-neck CT images that combine the robustness of multiatlas-based segmentation with the flexibility of geodesic active contours and the prior knowledge provided by statistical appearance models is presented. Methods: The presented approach is using an atlas-based segmentation approach in combination with label fusion in order to initialize a segmentation pipeline that is based on using statistical appearance models and geodesic active contours. An anatomically correct approximation of the segmentation result provided by atlas-based segmentation acts as a starting point for an iterative refinement of this approximation. The final segmentation result is based on using model to image registration and geodesic active contours, which are mutually influencing each other. Results: 18 CT images in combination with manually segmented labels of parotid glands and brainstem were used in a leave-one-out cross validation scheme in order to evaluate the presented approach. For this purpose, 50 different statistical appearance models have been created and used for segmentation. Dice coefficient (DC), mean absolute distance and max. Hausdorff distance between the autosegmentation results and expert segmentations were calculated. An average Dice coefficient of DC = 0.81 (right parotid gland), DC = 0.84 (left parotid gland), and DC = 0.86 (brainstem) could be achieved. Conclusions: The presented framework provides accurate segmentation results for three important structures in the head neck area. Compared to a

  14. FISICO: Fast Image SegmentatIon COrrection.

    Directory of Open Access Journals (Sweden)

    Waldo Valenzuela

    Full Text Available 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.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.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.

  15. Novel approach for automatic segmentation of LV endocardium via SPCNN

    Science.gov (United States)

    Ma, Yurun; Wang, Deyuan; Ma, Yide; Lei, Ruoming; Wang, Kemin

    2017-02-01

    Automatic segmentation of Left Ventricle (LV) is an essential task in the field of computer-aided analysis of cardiac function. In this paper, a simplified pulse coupled neural network (SPCNN) based approach is proposed to segment LV endocardium automatically. Different from the traditional image-driven methods, the SPCNN based approach is independent of the image gray distribution models, which makes it more stable. Firstly, the temporal and spatial characteristics of the cardiac magnetic resonance image are used to extract a region of interest and to locate LV cavity. Then, SPCNN model is iteratively applied with an increasing parameter to segment an optimal cavity. Finally, the endocardium is delineated via several post-processing operations. Quantitative evaluation is performed on the public database provided by MICCAI 2009. Over all studies, all slices, and two phases (end-diastole and end-systole), the average percentage of good contours is 91.02%, the average perpendicular distance is 2.24 mm and the overlapping dice metric is 0.86.These results indicate that the proposed approach possesses high precision and good competitiveness.

  16. Edge Segment-Based Automatic Video Surveillance

    Directory of Open Access Journals (Sweden)

    Oksam Chae

    2007-12-01

    Full Text Available This paper presents a moving-object segmentation algorithm using edge information as segment. The proposed method is developed to address challenges due to variations in ambient lighting and background contents. We investigated the suitability of the proposed algorithm in comparison with the traditional-intensity-based as well as edge-pixel-based detection methods. In our method, edges are extracted from video frames and are represented as segments using an efficiently designed edge class. This representation helps to obtain the geometric information of edge in the case of edge matching and moving-object segmentation; and facilitates incorporating knowledge into edge segment during background modeling and motion tracking. An efficient approach for background initialization and robust method of edge matching is presented, to effectively reduce the risk of false alarm due to illumination change and camera motion while maintaining the high sensitivity to the presence of moving object. Detected moving edges are utilized along with watershed algorithm for extracting video object plane (VOP with more accurate boundary. Experiment results with real image sequence reflect that the proposed method is suitable for automated video surveillance applications in various monitoring systems.

  17. Automatic Image Segmentation with PCNN Algorithm Based on Grayscale Correlation%基于灰度相关性的改进PCNN图像自动分割算法

    Institute of Scientific and Technical Information of China (English)

    马海荣; 程新文

    2014-01-01

    为了利用脉冲耦合神经网络﹙pulse coupled neural network ,PCNN)实现精确的图像自动分割,对PCNN模型进行改进,提出首先根据图像局部灰度相关性和欧氏距离建立连接权矩阵,然后利用最小方差比准则自动判定PCNN的循环次数,实现图像的自动分割,仿真实验结果表明,该方法可实现PCNN算法迭代次数的自动判定,算法适用性强,并可得到较好的分割效果。%In order to utilize pulse coupled neural networks (PCNN) for precise automatic image segmentation ,in this paper ,we improved PCNN model .Firstly ,we established a connection weight matrix based on the image local gray correlation and Euclid distance ,then ,used minimum variance ratio criterion determines cycle times of PCNN automatically ,achieved automatic image segmentation . The simulation results showed that this method could determined PCNN number of iterations automatically ,and has a strong feasibility and better segmentation results .

  18. Automatic image cropping for republishing

    Science.gov (United States)

    Cheatle, Phil

    2010-02-01

    Image cropping is an important aspect of creating aesthetically pleasing web pages and repurposing content for different web or printed output layouts. Cropping provides both the possibility of improving the composition of the image, and also the ability to change the aspect ratio of the image to suit the layout design needs of different document or web page formats. This paper presents a method for aesthetically cropping images on the basis of their content. Underlying the approach is a novel segmentation-based saliency method which identifies some regions as "distractions", as an alternative to the conventional "foreground" and "background" classifications. Distractions are a particular problem with typical consumer photos found on social networking websites such as FaceBook, Flickr etc. Automatic cropping is achieved by identifying the main subject area of the image and then using an optimization search to expand this to form an aesthetically pleasing crop. Evaluation of aesthetic functions like auto-crop is difficult as there is no single correct solution. A further contribution of this paper is an automated evaluation method which goes some way towards handling the complexity of aesthetic assessment. This allows crop algorithms to be easily evaluated against a large test set.

  19. Automatic leukocyte nucleus segmentation by intuitionistic fuzzy divergence based thresholding.

    Science.gov (United States)

    Jati, Arindam; Singh, Garima; Mukherjee, Rashmi; Ghosh, Madhumala; Konar, Amit; Chakraborty, Chandan; Nagar, Atulya K

    2014-03-01

    The paper proposes a robust approach to automatic segmentation of leukocyte's nucleus from microscopic blood smear images under normal as well as noisy environment by employing a new exponential intuitionistic fuzzy divergence based thresholding technique. The algorithm minimizes the divergence between the actual image and the ideally thresholded image to search for the final threshold. A new divergence formula based on exponential intuitionistic fuzzy entropy has been proposed. Further, to increase its noise handling capacity, a neighborhood-based membership function for the image pixels has been designed. The proposed scheme has been applied on 110 normal and 54 leukemia (chronic myelogenous leukemia) affected blood samples. The nucleus segmentation results have been validated by three expert hematologists. The algorithm achieves an average segmentation accuracy of 98.52% in noise-free environment. It beats the competitor algorithms in terms of several other metrics. The proposed scheme with neighborhood based membership function outperforms the competitor algorithms in terms of segmentation accuracy under noisy environment. It achieves 93.90% and 94.93% accuracies for Speckle and Gaussian noises, respectively. The average area under the ROC curves comes out to be 0.9514 in noisy conditions, which proves the robustness of the proposed algorithm.

  20. Automatic right ventricle segmentation in cardiac MRI via anisotropic diffusion and SPCNN

    Science.gov (United States)

    Wang, Kemin; Ma, Yurun; Lei, Ruoming; Yang, Zhen; Ma, Yide

    2017-02-01

    Cardiac Magnetic Resonance Image (CMRI) is a significant assistant for the cardiovascular disease clinical diagnosis. The segmentation of right ventricle (RV) is essential for cardiac function evaluation, especially for RV function measurement. Automatic RV segmentation is difficult due to the intensity inhomogeneity and the irregular shape. In this paper, we propose an automatic RV segmentation framework. Firstly, we use the anisotropic diffusion to filter the CMRI. And then, the endocardium is extracted by the simplified pulse coupled neural network (SPCNN) segmentation. At last, the morphologic processors are used to obtain the epicardium. The experiment results show that our method obtains a good performance for both the endocardium and the epicardium segmentation.

  1. Segmentation Toolbox for Tomographic Image Data

    DEFF Research Database (Denmark)

    Einarsdottir, Hildur

    , techniques to automatically analyze such data becomes ever more important. Most segmentation methods for large datasets, such as CT images, deal with simple thresholding techniques, where intensity values cut offs are predetermined and hard coded. For data where the intensity difference is not sufficient...... to automatically determine parameters of the different classes present in the data, and edge weighted smoothing of the final segmentation based on Markov Random Fields (MRF). The toolbox is developed for Matlab users and requires only minimal background knowledge of Matlab....

  2. Automatic segmentation of choroidal thickness in optical coherence tomography.

    Science.gov (United States)

    Alonso-Caneiro, David; Read, Scott A; Collins, Michael J

    2013-01-01

    The assessment of choroidal thickness from optical coherence tomography (OCT) images of the human choroid is an important clinical and research task, since it provides valuable information regarding the eye's normal anatomy and physiology, and changes associated with various eye diseases and the development of refractive error. Due to the time consuming and subjective nature of manual image analysis, there is a need for the development of reliable objective automated methods of image segmentation to derive choroidal thickness measures. However, the detection of the two boundaries which delineate the choroid is a complicated and challenging task, in particular the detection of the outer choroidal boundary, due to a number of issues including: (i) the vascular ocular tissue is non-uniform and rich in non-homogeneous features, and (ii) the boundary can have a low contrast. In this paper, an automatic segmentation technique based on graph-search theory is presented to segment the inner choroidal boundary (ICB) and the outer choroidal boundary (OCB) to obtain the choroid thickness profile from OCT images. Before the segmentation, the B-scan is pre-processed to enhance the two boundaries of interest and to minimize the artifacts produced by surrounding features. The algorithm to detect the ICB is based on a simple edge filter and a directional weighted map penalty, while the algorithm to detect the OCB is based on OCT image enhancement and a dual brightness probability gradient. The method was tested on a large data set of images from a pediatric (1083 B-scans) and an adult (90 B-scans) population, which were previously manually segmented by an experienced observer. The results demonstrate the proposed method provides robust detection of the boundaries of interest and is a useful tool to extract clinical data.

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

    Science.gov (United States)

    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.

  4. 3D semi-automatic segmentation of the cochlea and inner ear.

    Science.gov (United States)

    Xianfen, Diao; Siping, Chen; Changhong, Liang; Yuanmei, Wang

    2005-01-01

    Though interactive direct volume rendering produces meaningful images with high quality, it cannot display separate inner ear labyrinth or cochlea only by adjusting imaging parameters to suppress the surrounding structures. Novel semi-automatic segmentation methods were presented to extract the cochlea and inner ear from spiral CT images. The cochlea was separated from the medical image volume by applying the 3D narrow band level set segmentation algorithm with user interaction introduced to locate the initial contour and adjust the parameters. The inner ear was extracted with a similar semi-automatic segmentation method: manual segmentation was first applied to remove several closely interconnected regions in boundary by viewing image volume slice by slice, then the 3D narrow band level set segmentation algorithm was used to complete fine segmentation on image volume. Generating 3D models of cochlea and inner ear structures with such methods not only takes advantage of the combination of 2D images with 3D volume but also saves much time of post-processing. The segmented results were rendered with the Marching Cubes surface rendering method. The correlation of the point on the resultant surface to the three orthogonal sections that intersect at that point on the surface was built to evaluate the segmented object and display the spatial relations of the anatomical structures. The performance of the presented semi-automatic segmentation methods is tested using spiral CT images of the temporal bone.

  5. Visual Knowledge Representation and Intelligent Image Segmentation

    Institute of Scientific and Technical Information of China (English)

    1992-01-01

    Automatic medical image analysis shows that image segmentation is a crucial task for any practical AI system in this field.On the basis of evaluation of the existing segmentation methods,a new image segmentation method is presented.To seek the perfct solution to knowledge representation in low level machine vision,a new knowledge representation approach--“Notebbok”approach is proposed and the processing of visual knowledge is discussed at all levels.To integrate the computer vision theory with Gestalt psychology and knowledge engineering,a new integrated method for intelligent image segmentation of sonargraphs- “Generalized-pattern guided segmentation”is proposed.With the methods and techniques mentioned above,the medical diagnosis expert system for sonargraphs can be built The work on the preliminary experiments is also introduced.

  6. A Flexible Semi-Automatic Approach for Glioblastoma multiforme Segmentation

    CERN Document Server

    Egger, Jan; Kuhnt, Daniela; Kappus, Christoph; Carl, Barbara; Freisleben, Bernd; Nimsky, Christopher

    2011-01-01

    Gliomas are the most common primary brain tumors, evolving from the cerebral supportive cells. For clinical follow-up, the evaluation of the preoperative tumor volume is essential. Volumetric assessment of tumor volume with manual segmentation of its outlines is a time-consuming process that can be overcome with the help of segmentation methods. In this paper, a flexible semi-automatic approach for grade IV glioma segmentation is presented. The approach uses a novel segmentation scheme for spherical objects that creates a directed 3D graph. Thereafter, the minimal cost closed set on the graph is computed via a polynomial time s-t cut, creating an optimal segmentation of the tumor. The user can improve the results by specifying an arbitrary number of additional seed points to support the algorithm with grey value information and geometrical constraints. The presented method is tested on 12 magnetic resonance imaging datasets. The ground truth of the tumor boundaries are manually extracted by neurosurgeons. The...

  7. Automatic Segmentation of News Items Based on Video and Audio Features

    Institute of Scientific and Technical Information of China (English)

    王伟强; 高文

    2002-01-01

    The automatic segmentation of news items is a key for implementing the automatic cataloging system of news video. This paper presents an approach which manages audio and video feature information to automatically segment news items. The integration of audio and visual analyses can overcome the weakness of the approach using only image analysis techniques. It makes the approach more adaptable to various situations of news items. The proposed approach detects silence segments in accompanying audio, and integrates them with shot segmentation results, as well as anchor shot detection results, to determine the boundaries among news items. Experimental results show that the integration of audio and video features is an effective approach to solving the problem of automatic segmentation of news items.

  8. Automatic segmentation of equine larynx for diagnosis of laryngeal hemiplegia

    Science.gov (United States)

    Salehin, Md. Musfequs; Zheng, Lihong; Gao, Junbin

    2013-10-01

    This paper presents an automatic segmentation method for delineation of the clinically significant contours of the equine larynx from an endoscopic image. These contours are used to diagnose the most common disease of horse larynx laryngeal hemiplegia. In this study, hierarchal structured contour map is obtained by the state-of-the-art segmentation algorithm, gPb-OWT-UCM. The conic-shaped outer boundary of equine larynx is extracted based on Pascal's theorem. Lastly, Hough Transformation method is applied to detect lines related to the edges of vocal folds. The experimental results show that the proposed approach has better performance in extracting the targeted contours of equine larynx than the results of using only the gPb-OWT-UCM method.

  9. Unsupervised Multiresolution Image Segmentation Integrating Color and Texture

    Institute of Scientific and Technical Information of China (English)

    XINGQiang; YUANBaozong; TANGXiaofang

    2004-01-01

    Unsupervised segmentation of images is highly useful in various applications including contentbased image retrieval. A novel multiresolution image segmentation algorithm, designed to separate a focused object of interest from background automatically, is described in this paper. According to the principle of human vision system, our algorithm first searches the salient block representing object in global image domain. Then all image blocks are clustered using the feature of color moments and texture in salient block. At last the algorithm classifies the image blocks belonging to object class in high resolution. Experiment shows that our algorithm achieves better segmentation results at higher speed compared with the traditional image segmentation approach using global optimization.

  10. A method for semi-automatic segmentation and evaluation of intracranial aneurysms in bone-subtraction computed tomography angiography (BSCTA) images

    Science.gov (United States)

    Krämer, Susanne; Ditt, Hendrik; Biermann, Christina; Lell, Michael; Keller, Jörg

    2009-02-01

    The rupture of an intracranial aneurysm has dramatic consequences for the patient. Hence early detection of unruptured aneurysms is of paramount importance. Bone-subtraction computed tomography angiography (BSCTA) has proven to be a powerful tool for detection of aneurysms in particular those located close to the skull base. Most aneurysms though are chance findings in BSCTA scans performed for other reasons. Therefore it is highly desirable to have techniques operating on standard BSCTA scans available which assist radiologists and surgeons in evaluation of intracranial aneurysms. In this paper we present a semi-automatic method for segmentation and assessment of intracranial aneurysms. The only user-interaction required is placement of a marker into the vascular malformation. Termination ensues automatically as soon as the segmentation reaches the vessels which feed the aneurysm. The algorithm is derived from an adaptive region-growing which employs a growth gradient as criterion for termination. Based on this segmentation values of high clinical and prognostic significance, such as volume, minimum and maximum diameter as well as surface of the aneurysm, are calculated automatically. the segmentation itself as well as the calculated diameters are visualised. Further segmentation of the adjoining vessels provides the means for visualisation of the topographical situation of vascular structures associated to the aneurysm. A stereolithographic mesh (STL) can be derived from the surface of the segmented volume. STL together with parameters like the resiliency of vascular wall tissue provide for an accurate wall model of the aneurysm and its associated vascular structures. Consequently the haemodynamic situation in the aneurysm itself and close to it can be assessed by flow modelling. Significant values of haemodynamics such as pressure onto the vascular wall, wall shear stress or pathlines of the blood flow can be computed. Additionally a dynamic flow model can be

  11. Statistical multiscale image segmentation via Alpha-stable modeling

    OpenAIRE

    Wan, Tao; Canagarajah, CN; Achim, AM

    2007-01-01

    This paper presents a new statistical image segmentation algorithm, in which the texture features are modeled by symmetric alpha-stable (SalphaS) distributions. These features are efficiently combined with the dominant color feature to perform automatic segmentation. First, the image is roughly segmented into textured and nontextured regions using the dual-tree complex wavelet transform (DT-CWT) with the sub-band coefficients modeled as SalphaS random variables. A mul-tiscale segmentation is ...

  12. Simplified PCNN-based automatic segmentation method for structured light images%基于简化PCNN模型的结构光图像自动分割方法

    Institute of Scientific and Technical Information of China (English)

    贾小军; 张之江; 曾丹; 温伟

    2011-01-01

    An image segmentation algorithm based on simplified pulse coupled neural network (PCNN) is proposed, which aims to overcome the over or under segmentation in some traditional segmentation algorithms for structured light images with large size and uneven illumination, and captured by CCD. Block processing for structured light images was used to reduce the influence of illumination on segmentation quality. Each block-image was automatically segmented by the improved PCNN. The PCNN dynamically adjusted pulse threshold using the linear mode. The minimum cross-entropy is used to determine the number of iterations. The relationship between neighborhood pixels was used to automatically adjust the connection coefficient, which could reduce manual intervention. Subjective and objective evaluation indexes of the segmentation were compared. Experimental results show that the proposed algorithm can effectively segment the stripes or dot patterns of structured light images. The edge of segmentation target is smooth,consistent and clear, which verifies that the PCNN can be used to segment structured light images.%针对CCD获取的结构光图像因大尺寸、光照不均匀,一般分割方法容易产生过分割或欠分割,提出了一种简化的脉冲耦合神经网络(PCNN)分割方法.将结构光图像进行分块,降低光照对分割质量的影响.每块子图像采用改进的PCNN模型自动进行分割.PCNN采用线性方式动态调整脉冲门限,以最小交叉熵确定其迭代次数.并利用邻域像素问的关系自动调整连接系数,减少人工十预.通过主客观评价指标对分割结果进行了比较,结果表明.提出的算法可以有效地分割出结构光图像中的条纹及点阵模式,目标边缘光滑、连贯和清晰,可以用于结构光图像的分割处理.

  13. Automatic detection and segmentation of vascular structures in dermoscopy images using a novel vesselness measure based on pixel redness and tubularness

    Science.gov (United States)

    Kharazmi, Pegah; Lui, Harvey; Stoecker, William V.; Lee, Tim

    2015-03-01

    Vascular structures are one of the most important features in the diagnosis and assessment of skin disorders. The presence and clinical appearance of vascular structures in skin lesions is a discriminating factor among different skin diseases. In this paper, we address the problem of segmentation of vascular patterns in dermoscopy images. Our proposed method is composed of three parts. First, based on biological properties of human skin, we decompose the skin to melanin and hemoglobin component using independent component analysis of skin color images. The relative quantities and pure color densities of each component were then estimated. Subsequently, we obtain three reference vectors of the mean RGB values for normal skin, pigmented skin and blood vessels from the hemoglobin component by averaging over 100000 pixels of each group outlined by an expert. Based on the Euclidean distance thresholding, we generate a mask image that extracts the red regions of the skin. Finally, Frangi measure was applied to the extracted red areas to segment the tubular structures. Finally, Otsu's thresholding was applied to segment the vascular structures and get a binary vessel mask image. The algorithm was implemented on a set of 50 dermoscopy images. In order to evaluate the performance of our method, we have artificially extended some of the existing vessels in our dermoscopy data set and evaluated the performance of the algorithm to segment the newly added vessel pixels. A sensitivity of 95% and specificity of 87% were achieved.

  14. Automatic speech segmentation using throat-acoustic correlation coefficients

    Science.gov (United States)

    Mussabayev, Rustam Rafikovich; Kalimoldayev, Maksat N.; Amirgaliyev, Yedilkhan N.; Mussabayev, Timur R.

    2016-11-01

    This work considers one of the approaches to the solution of the task of discrete speech signal automatic segmentation. The aim of this work is to construct such an algorithm which should meet the following requirements: segmentation of a signal into acoustically homogeneous segments, high accuracy and segmentation speed, unambiguity and reproducibility of segmentation results, lack of necessity of preliminary training with the use of a special set consisting of manually segmented signals. Development of the algorithm which corresponds to the given requirements was conditioned by the necessity of formation of automatically segmented speech databases that have a large volume. One of the new approaches to the solution of this task is viewed in this article. For this purpose we use the new type of informative features named TAC-coefficients (Throat-Acoustic Correlation coefficients) which provide sufficient segmentation accuracy and effi- ciency.

  15. Evaluation for Uncertain Image Classification and Segmentation

    CERN Document Server

    Martin, Arnaud; Arnold-Bos, Andreas

    2008-01-01

    Each year, numerous segmentation and classification algorithms are invented or reused to solve problems where machine vision is needed. Generally, the efficiency of these algorithms is compared against the results given by one or many human experts. However, in many situations, the location of the real boundaries of the objects as well as their classes are not known with certainty by the human experts. Furthermore, only one aspect of the segmentation and classification problem is generally evaluated. In this paper we present a new evaluation method for classification and segmentation of image, where we take into account both the classification and segmentation results as well as the level of certainty given by the experts. As a concrete example of our method, we evaluate an automatic seabed characterization algorithm based on sonar images.

  16. Segmentation of Extrapulmonary Tuberculosis Infection Using Modified Automatic Seeded Region Growing

    Directory of Open Access Journals (Sweden)

    Nordin Abdul

    2009-01-01

    Full Text Available Abstract In the image segmentation process of positron emission tomography combined with computed tomography (PET/CT imaging, previous works used information in CT only for segmenting the image without utilizing the information that can be provided by PET. This paper proposes to utilize the hot spot values in PET to guide the segmentation in CT, in automatic image segmentation using seeded region growing (SRG technique. This automatic segmentation routine can be used as part of automatic diagnostic tools. In addition to the original initial seed selection using hot spot values in PET, this paper also introduces a new SRG growing criterion, the sliding windows. Fourteen images of patients having extrapulmonary tuberculosis have been examined using the above-mentioned method. To evaluate the performance of the modified SRG, three fidelity criteria are measured: percentage of under-segmentation area, percentage of over-segmentation area, and average time consumption. In terms of the under-segmentation percentage, SRG with average of the region growing criterion shows the least error percentage (51.85%. Meanwhile, SRG with local averaging and variance yielded the best results (2.67% for the over-segmentation percentage. In terms of the time complexity, the modified SRG with local averaging and variance growing criterion shows the best performance with 5.273 s average execution time. The results indicate that the proposed methods yield fairly good performance in terms of the over- and under-segmentation area. The results also demonstrated that the hot spot values in PET can be used to guide the automatic segmentation in CT image.

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

    Science.gov (United States)

    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.

  18. Automatic segmentation of abdominal vessels for improved pancreas localization

    Science.gov (United States)

    Farag, Amal; Liu, Jiamin; Summers, Ronald M.

    2014-03-01

    Accurate automatic detection and segmentation of abdominal organs from CT images is important for quantitative and qualitative organ tissue analysis as well as computer-aided diagnosis. The large variability of organ locations, the spatial interaction between organs that appear similar in medical scans and orientation and size variations are among the major challenges making the task very difficult. The pancreas poses these challenges in addition to its flexibility which allows for the shape of the tissue to vastly change. Due to the close proximity of the pancreas to numerous surrounding organs within the abdominal cavity the organ shifts according to the conditions of the organs within the abdomen, as such the pancreas is constantly changing. Combining these challenges with typically found patient-to-patient variations and scanning conditions the pancreas becomes harder to localize. In this paper we focus on three abdominal vessels that almost always abut the pancreas tissue and as such useful landmarks to identify the relative location of the pancreas. The splenic and portal veins extend from the hila of the spleen and liver, respectively, travel through the abdominal cavity and join at a position close to the head of the pancreas known as the portal confluence. A third vein, the superior mesenteric vein, anastomoses with the other two veins at the portal confluence. An automatic segmentation framework for obtaining the splenic vein, portal confluence and superior mesenteric vein is proposed using 17 contrast enhanced computed-tomography datasets. The proposed method uses outputs from the multi-organ multi-atlas label fusion and Frangi vesselness filter to obtain automatic seed points for vessel tracking and generation of statistical models of the desired vessels. The approach shows ability to identify the vessels and improve localization of the pancreas within the abdomen.

  19. A dorsolateral prefrontal cortex semi-automatic segmenter

    Science.gov (United States)

    Al-Hakim, Ramsey; Fallon, James; Nain, Delphine; Melonakos, John; Tannenbaum, Allen

    2006-03-01

    Structural, functional, and clinical studies in schizophrenia have, for several decades, consistently implicated dysfunction of the prefrontal cortex in the etiology of the disease. Functional and structural imaging studies, combined with clinical, psychometric, and genetic analyses in schizophrenia have confirmed the key roles played by the prefrontal cortex and closely linked "prefrontal system" structures such as the striatum, amygdala, mediodorsal thalamus, substantia nigra-ventral tegmental area, and anterior cingulate cortices. The nodal structure of the prefrontal system circuit is the dorsal lateral prefrontal cortex (DLPFC), or Brodmann area 46, which also appears to be the most commonly studied and cited brain area with respect to schizophrenia. 1, 2, 3, 4 In 1986, Weinberger et. al. tied cerebral blood flow in the DLPFC to schizophrenia.1 In 2001, Perlstein et. al. demonstrated that DLPFC activation is essential for working memory tasks commonly deficient in schizophrenia. 2 More recently, groups have linked morphological changes due to gene deletion and increased DLPFC glutamate concentration to schizophrenia. 3, 4 Despite the experimental and clinical focus on the DLPFC in structural and functional imaging, the variability of the location of this area, differences in opinion on exactly what constitutes DLPFC, and inherent difficulties in segmenting this highly convoluted cortical region have contributed to a lack of widely used standards for manual or semi-automated segmentation programs. Given these implications, we developed a semi-automatic tool to segment the DLPFC from brain MRI scans in a reproducible way to conduct further morphological and statistical studies. The segmenter is based on expert neuroanatomist rules (Fallon-Kindermann rules), inspired by cytoarchitectonic data and reconstructions presented by Rajkowska and Goldman-Rakic. 5 It is semi-automated to provide essential user interactivity. We present our results and provide details on

  20. Automatic phases recognition in pituitary surgeries by microscope images classification

    OpenAIRE

    Lalys, Florent; Riffaud, Laurent; Morandi, Xavier; Jannin, Pierre

    2010-01-01

    International audience; The segmentation of the surgical workflow might be helpful for providing context-sensitive user interfaces, or generating automatic report. Our approach focused on the automatic recognition of surgical phases by microscope image classification. Our workflow, including images features extraction, image database labelisation, Principal Component Analysis (PCA) transformation and 10-fold cross-validation studies was performed on a specific type of neurosurgical interventi...

  1. Automatic Blind Syllable Segmentation for Continuous Speech

    OpenAIRE

    Villing, Rudi; Timoney, Joseph; Ward, Tomas

    2004-01-01

    In this paper a simple practical method for blind segmentation of continuous speech into its constituent syllables is presented. This technique which uses amplitude onset velocity and coarse spectral makeup to identify syllable boundaries is tested on a corpus of continuous speech and compared with an established segmentation algorithm. The results show substantial performance benefit using the proposed algorithm.

  2. BW Trained HMM based Aerial Image Segmentation

    Directory of Open Access Journals (Sweden)

    R Rajasree

    2011-03-01

    Full Text Available Image segmentation is an essential preprocessing tread in a complicated and composite image dealing out algorithm. In segmenting arial image the expenditure of misclassification could depend on the factual group of pupils. In this paper, aggravated by modern advances in contraption erudition conjecture, I introduce a modus operandi to make light of the misclassification expenditure with class-dependent expenditure. The procedure assumes the hidden Markov model (HMM which has been popularly used for image segmentation in recent years. We represent all feasible HMM based segmenters (or classifiers as a set of points in the beneficiary operating characteristic (ROC space. optimizing HMM parameters is still an important and challenging work in automatic image segmentation research area. Usually the Baum-Welch (B-W Algorithm is used to calculate the HMM model parameters. However, the B-W algorithm uses an initial random guess of the parameters, therefore after convergence the output tends to be close to this initial value of the algorithm, which is not necessarily the global optimum of the model parameters. In this project, a Adaptive Baum-Welch (GA-BW is proposed.

  3. Automatic metastatic brain tumor segmentation for stereotactic radiosurgery applications

    Science.gov (United States)

    Liu, Yan; Stojadinovic, Strahinja; Hrycushko, Brian; Wardak, Zabi; Lu, Weiguo; Yan, Yulong; Jiang, Steve B.; Timmerman, Robert; Abdulrahman, Ramzi; Nedzi, Lucien; Gu, Xuejun

    2016-12-01

    The objective of this study is to develop an automatic segmentation strategy for efficient and accurate metastatic brain tumor delineation on contrast-enhanced T1-weighted (T1c) magnetic resonance images (MRI) for stereotactic radiosurgery (SRS) applications. The proposed four-step automatic brain metastases segmentation strategy is comprised of pre-processing, initial contouring, contour evolution, and contour triage. First, T1c brain images are preprocessed to remove the skull. Second, an initial tumor contour is created using a multi-scaled adaptive threshold-based bounding box and a super-voxel clustering technique. Third, the initial contours are evolved to the tumor boundary using a regional active contour technique. Fourth, all detected false-positive contours are removed with geometric characterization. The segmentation process was validated on a realistic virtual phantom containing Gaussian or Rician noise. For each type of noise distribution, five different noise levels were tested. Twenty-one cases from the multimodal brain tumor image segmentation (BRATS) challenge dataset and fifteen clinical metastases cases were also included in validation. Segmentation performance was quantified by the Dice coefficient (DC), normalized mutual information (NMI), structural similarity (SSIM), Hausdorff distance (HD), mean value of surface-to-surface distance (MSSD) and standard deviation of surface-to-surface distance (SDSSD). In the numerical phantom study, the evaluation yielded a DC of 0.98  ±  0.01, an NMI of 0.97  ±  0.01, an SSIM of 0.999  ±  0.001, an HD of 2.2  ±  0.8 mm, an MSSD of 0.1  ±  0.1 mm, and an SDSSD of 0.3  ±  0.1 mm. The validation on the BRATS data resulted in a DC of 0.89  ±  0.08, which outperform the BRATS challenge algorithms. Evaluation on clinical datasets gave a DC of 0.86  ±  0.09, an NMI of 0.80  ±  0.11, an SSIM of 0.999  ±  0.001, an HD of 8

  4. Fully automatic segmentation of arbitrarily shaped fiducial markers in cone-beam CT projections

    Science.gov (United States)

    Bertholet, J.; Wan, H.; Toftegaard, J.; Schmidt, M. L.; Chotard, F.; Parikh, P. J.; Poulsen, P. R.

    2017-02-01

    Radio-opaque fiducial markers of different shapes are often implanted in or near abdominal or thoracic tumors to act as surrogates for the tumor position during radiotherapy. They can be used for real-time treatment adaptation, but this requires a robust, automatic segmentation method able to handle arbitrarily shaped markers in a rotational imaging geometry such as cone-beam computed tomography (CBCT) projection images and intra-treatment images. In this study, we propose a fully automatic dynamic programming (DP) assisted template-based (TB) segmentation method. Based on an initial DP segmentation, the DPTB algorithm generates and uses a 3D marker model to create 2D templates at any projection angle. The 2D templates are used to segment the marker position as the position with highest normalized cross-correlation in a search area centered at the DP segmented position. The accuracy of the DP algorithm and the new DPTB algorithm was quantified as the 2D segmentation error (pixels) compared to a manual ground truth segmentation for 97 markers in the projection images of CBCT scans of 40 patients. Also the fraction of wrong segmentations, defined as 2D errors larger than 5 pixels, was calculated. The mean 2D segmentation error of DP was reduced from 4.1 pixels to 3.0 pixels by DPTB, while the fraction of wrong segmentations was reduced from 17.4% to 6.8%. DPTB allowed rejection of uncertain segmentations as deemed by a low normalized cross-correlation coefficient and contrast-to-noise ratio. For a rejection rate of 9.97%, the sensitivity in detecting wrong segmentations was 67% and the specificity was 94%. The accepted segmentations had a mean segmentation error of 1.8 pixels and 2.5% wrong segmentations.

  5. Lung Lesion Extraction Using a Toboggan Based Growing Automatic Segmentation Approach.

    Science.gov (United States)

    Song, Jiangdian; Yang, Caiyun; Fan, Li; Wang, Kun; Yang, Feng; Liu, Shiyuan; Tian, Jie

    2016-01-01

    The accurate segmentation of lung lesions from computed tomography (CT) scans is important for lung cancer research and can offer valuable information for clinical diagnosis and treatment. However, it is challenging to achieve a fully automatic lesion detection and segmentation with acceptable accuracy due to the heterogeneity of lung lesions. Here, we propose a novel toboggan based growing automatic segmentation approach (TBGA) with a three-step framework, which are automatic initial seed point selection, multi-constraints 3D lesion extraction and the final lesion refinement. The new approach does not require any human interaction or training dataset for lesion detection, yet it can provide a high lesion detection sensitivity (96.35%) and a comparable segmentation accuracy with manual segmentation (P > 0.05), which was proved by a series assessments using the LIDC-IDRI dataset (850 lesions) and in-house clinical dataset (121 lesions). We also compared TBGA with commonly used level set and skeleton graph cut methods, respectively. The results indicated a significant improvement of segmentation accuracy . Furthermore, the average time consumption for one lesion segmentation was under 8 s using our new method. In conclusion, we believe that the novel TBGA can achieve robust, efficient and accurate lung lesion segmentation in CT images automatically.

  6. Performance evaluation of an automatic anatomy segmentation algorithm on repeat or four-dimensional CT images using a deformable image registration method

    Science.gov (United States)

    Wang, He; Garden, Adam S.; Zhang, Lifei; Wei, Xiong; Ahamad, Anesa; Kuban, Deborah A.; Komaki, Ritsuko; O’Daniel, Jennifer; Zhang, Yongbin; Mohan, Radhe; Dong, Lei

    2008-01-01

    Purpose Auto-propagation of anatomical region-of-interests (ROIs) from the planning CT to daily CT is an essential step in image-guided adaptive radiotherapy. The goal of this study was to quantitatively evaluate the performance of the algorithm in typical clinical applications. Method and Materials We previously adopted an image intensity-based deformable registration algorithm to find the correspondence between two images. In this study, the ROIs delineated on the planning CT image were mapped onto daily CT or four-dimentional (4D) CT images using the same transformation. Post-processing methods, such as boundary smoothing and modification, were used to enhance the robustness of the algorithm. Auto-propagated contours for eight head-and-neck patients with a total of 100 repeat CTs, one prostate patient with 24 repeat CTs, and nine lung cancer patients with a total of 90 4D-CT images were evaluated against physician-drawn contours and physician-modified deformed contours using the volume-overlap-index (VOI) and mean absolute surface-to-surface distance (ASSD). Results The deformed contours were reasonably well matched with daily anatomy on repeat CT images. The VOI and mean ASSD were 83% and 1.3 mm when compared to the independently drawn contours. A better agreement (greater than 97% and less than 0.4 mm) was achieved if the physician was only asked to correct the deformed contours. The algorithm was robust in the presence of random noise in the image. Conclusion The deformable algorithm may be an effective method to propagate the planning ROIs to subsequent CT images of changed anatomy, although a final review by physicians is highly recommended. PMID:18722272

  7. Automatic Segmentation of Nature Object Using Salient Edge Points Based Active Contour

    Directory of Open Access Journals (Sweden)

    Shangbing Gao

    2015-01-01

    Full Text Available Natural image segmentation is often a crucial first step for high-level image understanding, significantly reducing the complexity of content analysis of images. LRAC may have some disadvantages. (1 Segmentation results heavily depend on the initial contour selection which is a very skillful task. (2 In some situations, manual interactions are infeasible. To overcome these shortcomings, we propose a novel model for unsupervised segmentation of viewer’s attention object from natural images based on localizing region-based active model (LRAC. With aid of the color boosting Harris detector and the core saliency map, we get the salient object edge points. Then, these points are employed as the seeds of initial convex hull. Finally, this convex hull is improved by the edge-preserving filter to generate the initial contour for our automatic object segmentation system. In contrast with localizing region-based active contours that require considerable user interaction, the proposed method does not require it; that is, the segmentation task is fulfilled in a fully automatic manner. Extensive experiments results on a large variety of natural images demonstrate that our algorithm consistently outperforms the popular existing salient object segmentation methods, yielding higher precision and better recall rates. Our framework can reliably and automatically extract the object contour from the complex background.

  8. Transfer learning improves supervised image segmentation across imaging protocols

    DEFF Research Database (Denmark)

    van Opbroek, Annegreet; Ikram, M. Arfan; Vernooij, Meike W.;

    2015-01-01

    well, often require a large amount of labeled training data that is exactly representative of the target data. We therefore propose to use transfer learning for image segmentation. Transfer-learning techniques can cope with differences in distributions between training and target data, and therefore......The variation between images obtained with different scanners or different imaging protocols presents a major challenge in automatic segmentation of biomedical images. This variation especially hampers the application of otherwise successful supervised-learning techniques which, in order to perform...... may improve performance over supervised learning for segmentation across scanners and scan protocols. We present four transfer classifiers that can train a classification scheme with only a small amount of representative training data, in addition to a larger amount of other training data...

  9. Robust automatic high resolution segmentation of SOFC anode porosity in 3D

    DEFF Research Database (Denmark)

    Jørgensen, Peter Stanley; Bowen, Jacob R.

    2008-01-01

    Routine use of 3D characterization of SOFCs by focused ion beam (FIB) serial sectioning is generally restricted by the time consuming task of manually delineating structures within each image slice. We apply advanced image analysis algorithms to automatically segment the porosity phase of an SOFC...... anode in 3D. The technique is based on numerical approximations to partial differential equations to evolve a 3D surface to the desired phase boundary. Vector fields derived from the experimentally acquired data are used as the driving force. The automatic segmentation compared to manual delineation...... reveals and good correspondence and the two approaches are quantitatively compared. It is concluded that the. automatic approach is more robust, more reproduceable and orders of magnitude quicker than manual segmentation of SOFC anode porosity for subsequent quantitative 3D analysis. Lastly...

  10. Clustering based segmentation of text in complex color images

    Institute of Scientific and Technical Information of China (English)

    毛文革; 王洪滨; 张田文

    2004-01-01

    We propose a novel scheme based on clustering analysis in color space to solve text segmentation in complex color images. Text segmentation includes automatic clustering of color space and foreground image generation. Two methods are also proposed for automatic clustering: The first one is to determine the optimal number of clusters and the second one is the fuzzy competitively clustering method based on competitively learning techniques. Essential foreground images obtained from any of the color clusters are combined into foreground images. Further performance analysis reveals the advantages of the proposed methods.

  11. A framework for automatic segmentation in three dimensions of microstructural tomography data

    DEFF Research Database (Denmark)

    Jørgensen, Peter Stanley; Hansen, Karin Vels; Larsen, Rasmus;

    2010-01-01

    Routine use of quantitative three dimensional analysis of material microstructure by in particular, focused ion beam (FIB) serial sectioning is generally restricted by the time consuming task of manually delineating structures within each image slice or the quality of manual and automatic...... segmentation schemes. We present here a framework for performing automatic segmentation of complex microstructures using a level set method. The technique is based on numerical approximations to partial differential equations to evolve a 3D surface to capture the phase boundaries. Vector fields derived from...... the experimentally acquired data are used as the driving forces. The framework performs the segmentation in 3D rather than on a slice by slice basis. It naturally supplies sub-voxel precision of segmented surfaces and allows constraints on the surface curvature to enforce a smooth surface in the segmentation. Two...

  12. Research on automatic human chromosome image analysis

    Science.gov (United States)

    Ming, Delie; Tian, Jinwen; Liu, Jian

    2007-11-01

    Human chromosome karyotyping is one of the essential tasks in cytogenetics, especially in genetic syndrome diagnoses. In this thesis, an automatic procedure is introduced for human chromosome image analysis. According to different status of touching and overlapping chromosomes, several segmentation methods are proposed to achieve the best results. Medial axis is extracted by the middle point algorithm. Chromosome band is enhanced by the algorithm based on multiscale B-spline wavelets, extracted by average gray profile, gradient profile and shape profile, and calculated by the WDD (Weighted Density Distribution) descriptors. The multilayer classifier is used in classification. Experiment results demonstrate that the algorithms perform well.

  13. Automatic segmentation of human facial tissue by MRI-CT fusion: a feasibility study.

    Science.gov (United States)

    Kale, Emre H; Mumcuoglu, Erkan U; Hamcan, Salih

    2012-12-01

    The aim of this study was to develop automatic image segmentation methods to segment human facial tissue which contains very thin anatomic structures. The segmentation output can be used to construct a more realistic human face model for a variety of purposes like surgery planning, patient specific prosthesis design and facial expression simulation. Segmentation methods developed were based on Bayesian and Level Set frameworks, which were applied on three image types: magnetic resonance imaging (MRI), computerized tomography (CT) and fusion, in which case information from both modalities were utilized maximally for every tissue type. The results on human data indicated that fusion, thickness adaptive and postprocessing options provided the best muscle/fat segmentation scores in both Level Set and Bayesian methods. When the best Level Set and Bayesian methods were compared, scores of the latter were better. Number of algorithm parameters (to be trained) and computer run time measured were also in favour of the Bayesian method.

  14. Automatic segmentation of the heart in radiotherapy for breast cancer

    DEFF Research Database (Denmark)

    Laugaard Lorenzen, Ebbe; Ewertz, Marianne; Brink, Carsten

    2014-01-01

    Background. The aim of this study was to evaluate two fully automatic segmentation methods in comparison with manual delineations for their use in delineating the heart on planning computed tomography (CT) used in radiotherapy for breast cancer. Material and methods. Automatic delineation of heart....... Automatic delineation is an equal alternative to manual delineation when compared to the inter-observer variation. The reduction in precision of measured dose was small compared to other uncertainties affecting the estimated heart dose and would for most applications be outweighed by the benefits of fully...

  15. An Active Contour for Range Image Segmentation

    OpenAIRE

    Khaldi Amine; Merouani Hayet Farida

    2012-01-01

    In this paper a new classification of range image segmentation method is proposed according to the criterion of homogeneity which obeys the segmentation, then, a deformable model-type active contour “Snake” is applied to segment range images.

  16. Automatic brain caudate nuclei segmentation and classification in diagnostic of Attention-Deficit/Hyperactivity Disorder.

    Science.gov (United States)

    Igual, Laura; Soliva, Joan Carles; Escalera, Sergio; Gimeno, Roger; Vilarroya, Oscar; Radeva, Petia

    2012-12-01

    We present a fully automatic diagnostic imaging test for Attention-Deficit/Hyperactivity Disorder diagnosis assistance based on previously found evidences of caudate nucleus volumetric abnormalities. The proposed method consists of different steps: a new automatic method for external and internal segmentation of caudate based on Machine Learning methodologies; the definition of a set of new volume relation features, 3D Dissociated Dipoles, used for caudate representation and classification. We separately validate the contributions using real data from a pediatric population and show precise internal caudate segmentation and discrimination power of the diagnostic test, showing significant performance improvements in comparison to other state-of-the-art methods.

  17. Multiple Segmentation of Image Stacks

    DEFF Research Database (Denmark)

    Smets, Jonathan; Jaeger, Manfred

    2014-01-01

    We propose a method for the simultaneous construction of multiple image segmentations by combining a recently proposed “convolution of mixtures of Gaussians” model with a multi-layer hidden Markov random field structure. The resulting method constructs for a single image several, alternative...

  18. Image Segmentation Based on Support Vector Machine

    Institute of Scientific and Technical Information of China (English)

    XU Hai-xiang; ZHU Guang-xi; TIAN Jin-wen; ZHANG Xiang; PENG Fu-yuan

    2005-01-01

    Image segmentation is a necessary step in image analysis. Support vector machine (SVM) approach is proposed to segment images and its segmentation performance is evaluated.Experimental results show that: the effects of kernel function and model parameters on the segmentation performance are significant; SVM approach is less sensitive to noise in image segmentation; The segmentation performance of SVM approach is better than that of back-propagation multi-layer perceptron (BP-MLP) approach and fuzzy c-means (FCM) approach.

  19. Quantitative evaluation of six graph based semi-automatic liver tumor segmentation techniques using multiple sets of reference segmentation

    Science.gov (United States)

    Su, Zihua; Deng, Xiang; Chefd'hotel, Christophe; Grady, Leo; Fei, Jun; Zheng, Dong; Chen, Ning; Xu, Xiaodong

    2011-03-01

    Graph based semi-automatic tumor segmentation techniques have demonstrated great potential in efficiently measuring tumor size from CT images. Comprehensive and quantitative validation is essential to ensure the efficacy of graph based tumor segmentation techniques in clinical applications. In this paper, we present a quantitative validation study of six graph based 3D semi-automatic tumor segmentation techniques using multiple sets of expert segmentation. The six segmentation techniques are Random Walk (RW), Watershed based Random Walk (WRW), LazySnapping (LS), GraphCut (GHC), GrabCut (GBC), and GrowCut (GWC) algorithms. The validation was conducted using clinical CT data of 29 liver tumors and four sets of expert segmentation. The performance of the six algorithms was evaluated using accuracy and reproducibility. The accuracy was quantified using Normalized Probabilistic Rand Index (NPRI), which takes into account of the variation of multiple expert segmentations. The reproducibility was evaluated by the change of the NPRI from 10 different sets of user initializations. Our results from the accuracy test demonstrated that RW (0.63) showed the highest NPRI value, compared to WRW (0.61), GWC (0.60), GHC (0.58), LS (0.57), GBC (0.27). The results from the reproducibility test indicated that GBC is more sensitive to user initialization than the other five algorithms. Compared to previous tumor segmentation validation studies using one set of reference segmentation, our evaluation methods use multiple sets of expert segmentation to address the inter or intra rater variability issue in ground truth annotation, and provide quantitative assessment for comparing different segmentation algorithms.

  20. Automatic Defect Detection in X-Ray Images Using Image Data Fusion

    Institute of Scientific and Technical Information of China (English)

    TIAN Yuan; DU Dong; CAI Guorui; WANG Li; ZHANG Hua

    2006-01-01

    Automatic defect detection in X-ray images is currently a focus of much research at home and abroad. The technology requires computerized image processing, image analysis, and pattern recognition. This paper describes an image processing method for automatic defect detection using image data fusion which synthesizes several methods including edge extraction, wave profile analyses, segmentation with dynamic threshold, and weld district extraction. Test results show that defects that induce an abrupt change over a predefined extent of the image intensity can be segmented regardless of the number, location, shape, or size. Thus, the method is more robust and practical than the current methods using only one method.

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

    Science.gov (United States)

    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.

  2. An Automatic Number Plate Recognition System under Image Processing

    OpenAIRE

    Sarbjit Kaur

    2016-01-01

    Automatic Number Plate Recognition system is an application of computer vision and image processing technology that takes photograph of vehicles as input image and by extracting their number plate from whole vehicle image , it display the number plate information into text. Mainly the ANPR system consists of 4 phases: - Acquisition of Vehicle Image and Pre-Processing, Extraction of Number Plate Area, Character Segmentation and Character Recognition. The overall accuracy and efficiency of whol...

  3. Sequentiality of daily life physiology: an automatized segmentation approach.

    Science.gov (United States)

    Fontecave-Jallon, J; Baconnier, P; Tanguy, S; Eymaron, M; Rongier, C; Guméry, P Y

    2013-09-01

    Based on the hypotheses that (1) a physiological organization exists inside each activity of daily life and (2) the pattern of evolution of physiological variables is characteristic of each activity, pattern changes should be detected on daily life physiological recordings. The present study aims at investigating whether a simple segmentation method can be set up to detect pattern changes on physiological recordings carried out during daily life. Heart and breathing rates and skin temperature have been non-invasively recorded in volunteers following scenarios made of "daily life" steps (13 records). An observer, undergoing the scenario, wrote down annotations during the recording time. Two segmentation procedures have been compared to the annotations, a visual inspection of the signals and an automatic program based on a trends detection algorithm applied to one physiological signal (skin temperature). The annotations resulted in a total number of 213 segments defined on the 13 records, the best visual inspection detected less segments (120) than the automatic program (194). If evaluated in terms of the number of correspondences between the times marks given by annotations and those resulting from both physiologically based segmentations, the automatic program was better than the visual inspection. The mean time lags between annotation and program time marks remain variables time series recorded in common life conditions exhibit different successive patterns that can be detected by a simple trends detection algorithm. Theses sequences are coherent with the corresponding annotated activity.

  4. Segmentation in dermatological hyperspectral images: dedicated methods

    OpenAIRE

    Koprowski, Robert; Olczyk, Paweł

    2016-01-01

    Background Segmentation of hyperspectral medical images is one of many image segmentation methods which require profiling. This profiling involves either the adjustment of existing, known image segmentation methods or a proposal of new dedicated methods of hyperspectral image segmentation. Taking into consideration the size of analysed data, the time of analysis is of major importance. Therefore, the authors proposed three new dedicated methods of hyperspectral image segmentation with special...

  5. Combining Constraint Types From Public Data in Aerial Image Segmentation

    DEFF Research Database (Denmark)

    Jacobsen, Thomas Stig; Jensen, Jacob Jon; Jensen, Daniel Rune

    2013-01-01

    We introduce a method for image segmentation that constraints the clustering with map and point data. The method is showcased by applying the spectral clustering algorithm on aerial images for building detection with constraints built from a height map and address point data. We automatically det...

  6. Robust Machine Learning-Based Correction on Automatic Segmentation of the Cerebellum and Brainstem.

    Science.gov (United States)

    Wang, Jun Yi; Ngo, Michael M; Hessl, David; Hagerman, Randi J; Rivera, Susan M

    2016-01-01

    Automated segmentation is a useful method for studying large brain structures such as the cerebellum and brainstem. However, automated segmentation may lead to inaccuracy and/or undesirable boundary. The goal of the present study was to investigate whether SegAdapter, a machine learning-based method, is useful for automatically correcting large segmentation errors and disagreement in anatomical definition. We further assessed the robustness of the method in handling size of training set, differences in head coil usage, and amount of brain atrophy. High resolution T1-weighted images were acquired from 30 healthy controls scanned with either an 8-channel or 32-channel head coil. Ten patients, who suffered from brain atrophy because of fragile X-associated tremor/ataxia syndrome, were scanned using the 32-channel head coil. The initial segmentations of the cerebellum and brainstem were generated automatically using Freesurfer. Subsequently, Freesurfer's segmentations were both manually corrected to serve as the gold standard and automatically corrected by SegAdapter. Using only 5 scans in the training set, spatial overlap with manual segmentation in Dice coefficient improved significantly from 0.956 (for Freesurfer segmentation) to 0.978 (for SegAdapter-corrected segmentation) for the cerebellum and from 0.821 to 0.954 for the brainstem. Reducing the training set size to 2 scans only decreased the Dice coefficient ≤0.002 for the cerebellum and ≤ 0.005 for the brainstem compared to the use of training set size of 5 scans in corrective learning. The method was also robust in handling differences between the training set and the test set in head coil usage and the amount of brain atrophy, which reduced spatial overlap only by segmentation and corrective learning provides a valuable method for accurate and efficient segmentation of the cerebellum and brainstem, particularly in large-scale neuroimaging studies, and potentially for segmenting other neural regions as

  7. Image Segmentation, Registration, Compression, and Matching

    Science.gov (United States)

    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

  8. Fingerprint Image Segmentation Using Haar Wavelet and Self Organizing Map

    Directory of Open Access Journals (Sweden)

    Sri Suwarno

    2013-10-01

    Full Text Available Fingerprint image segmentation is one of the important preprocessing steps in Automatic Fingerprint Identification Systems (AFIS. Segmentation separates image background from image foreground, removing unnecessary information from the image. This paper proposes a new fingerprint segmentation method using Haar wavelet and Kohonen’s Self Organizing Map (SOM. Fingerprint image was decomposed using 2D Haar wavelet in two levels. To generate features vectors, the decomposed image was divided into nonoverlapping blocks of 2x2 pixels and converted into four elements vectors. These vectors were then fed into SOM network that grouped them into foreground and background clusters. Finally, blocks in the background area were removed based on indexes of blocks in the background cluster. From the research that has been carried out, we conclude that the proposed method is effective to segment background from fingerprint images.

  9. A Novel Multiresolution Fuzzy Segmentation Method on MR Image

    Institute of Scientific and Technical Information of China (English)

    ZHANG HongMei(张红梅); BIAN ZhengZhong(卞正中); YUAN ZeJian(袁泽剑); YE Min(叶敏); JI Feng(冀峰)

    2003-01-01

    Multiresolution-based magnetic resonance (MR) image segmentation has attractedattention for its ability to capture rich information across scales compared with the conventionalsegmentation methods. In this paper, a new scale-space-based segmentation model is presented,where both the intra-scale and inter-scale properties are considered and formulated as two fuzzyenergy functions. Meanwhile, a control parameter is introduced to adjust the contribution of thesimilarity character across scales and the clustering character within the scale. By minimizing thecombined inter/intra energy function, the multiresolution fuzzy segmentation algorithm is derived.Then the coarse to fine leading segmentation is performed automatically and iteratively on a set ofmultiresolution images. The validity of the proposed algorithm is demonstrated by the test imageand pathological MR images. Experiments show that by this approach the segmentation results,especially in the tumor area delineation, are more precise than those of the conventional fuzzy segmentation methods.

  10. Automatic building extraction and segmentation directly from lidar point clouds

    Science.gov (United States)

    Jiang, Jingjue; Ming, Ying

    2006-10-01

    This paper presents an automatic approach for building extraction and segmentation directly from Lidar point clouds without previous rasterization or triangulation. The algorithm works in the following sequential steps. First, a filtering algorithm, which is capable of preserving steep terrain features, is performed on raw Lidar point clouds. Points that belong to the bare earth and those that belong to buildings are separated. Second, the building points which may include some vegetation and other objects due to the disturbance of noise and the distribution of points are segmented further by using a Riemannian Graph. Then building segments are recognized by considering size and roughness. Finally, each segment can be treated as a building roof plane. Experiment results show that the algorithm is very promising.

  11. Fast diffusion kurtosis imaging (DKI) with Inherent COrrelation-based Normalization (ICON) enhances automatic segmentation of heterogeneous diffusion MRI lesion in acute stroke.

    Science.gov (United States)

    Zhou, Iris Yuwen; Guo, Yingkun; Igarashi, Takahiro; Wang, Yu; Mandeville, Emiri; Chan, Suk-Tak; Wen, Lingyi; Vangel, Mark; Lo, Eng H; Ji, Xunming; Sun, Phillip Zhe

    2016-12-01

    Diffusion kurtosis imaging (DKI) has been shown to augment diffusion-weighted imaging (DWI) for the definition of irreversible ischemic injury. However, the complexity of cerebral structure/composition makes the kurtosis map heterogeneous, limiting the specificity of kurtosis hyperintensity to acute ischemia. We propose an Inherent COrrelation-based Normalization (ICON) analysis to suppress the intrinsic kurtosis heterogeneity for improved characterization of heterogeneous ischemic tissue injury. Fast DKI and relaxation measurements were performed on normal (n = 10) and stroke rats following middle cerebral artery occlusion (MCAO) (n = 20). We evaluated the correlations between mean kurtosis (MK), mean diffusivity (MD) and fractional anisotropy (FA) derived from the fast DKI sequence and relaxation rates R1 and R2 , and found a highly significant correlation between MK and R1 (p segmentation in an animal stroke model. We found significantly different kurtosis and diffusivity lesion volumes: 147 ± 59 and 180 ± 66 mm(3) , respectively (p = 0.003, paired t-test). The ratio of kurtosis to diffusivity lesion volume was 84% ± 19% (p < 0.001, one-sample t-test). We found that relaxation-normalized MK (RNMK), but not MD, values were significantly different between kurtosis and diffusivity lesions (p < 0.001, analysis of variance). Our study showed that fast DKI with ICON analysis provides a promising means of demarcation of heterogeneous DWI stroke lesions.

  12. Segmentation of Color Images Based on Different Segmentation Techniques

    Directory of Open Access Journals (Sweden)

    Purnashti Bhosale

    2013-03-01

    Full Text Available In this paper, we propose an Color image segmentation algorithm based on different segmentation techniques. We recognize the background objects such as the sky, ground, and trees etc based on the color and texture information using various methods of segmentation. The study of segmentation techniques by using different threshold methods such as global and local techniques and they are compared with one another so as to choose the best technique for threshold segmentation. Further segmentation is done by using clustering method and Graph cut method to improve the results of segmentation.

  13. A superpixel-based framework for automatic tumor segmentation on breast DCE-MRI

    Science.gov (United States)

    Yu, Ning; Wu, Jia; Weinstein, Susan P.; Gaonkar, Bilwaj; Keller, Brad M.; Ashraf, Ahmed B.; Jiang, YunQing; Davatzikos, Christos; Conant, Emily F.; Kontos, Despina

    2015-03-01

    Accurate and efficient automated tumor segmentation in breast dynamic contrast-enhanced magnetic resonance imaging (DCE-MRI) is highly desirable for computer-aided tumor diagnosis. We propose a novel automatic segmentation framework which incorporates mean-shift smoothing, superpixel-wise classification, pixel-wise graph-cuts partitioning, and morphological refinement. A set of 15 breast DCE-MR images, obtained from the American College of Radiology Imaging Network (ACRIN) 6657 I-SPY trial, were manually segmented to generate tumor masks (as ground truth) and breast masks (as regions of interest). Four state-of-the-art segmentation approaches based on diverse models were also utilized for comparison. Based on five standard evaluation metrics for segmentation, the proposed framework consistently outperformed all other approaches. The performance of the proposed framework was: 1) 0.83 for Dice similarity coefficient, 2) 0.96 for pixel-wise accuracy, 3) 0.72 for VOC score, 4) 0.79 mm for mean absolute difference, and 5) 11.71 mm for maximum Hausdorff distance, which surpassed the second best method (i.e., adaptive geodesic transformation), a semi-automatic algorithm depending on precise initialization. Our results suggest promising potential applications of our segmentation framework in assisting analysis of breast carcinomas.

  14. Semi-automatic segmentation for 3D motion analysis of the tongue with dynamic MRI.

    Science.gov (United States)

    Lee, Junghoon; Woo, Jonghye; Xing, Fangxu; Murano, Emi Z; Stone, Maureen; Prince, Jerry L

    2014-12-01

    Dynamic MRI has been widely used to track the motion of the tongue and measure its internal deformation during speech and swallowing. Accurate segmentation of the tongue is a prerequisite step to define the target boundary and constrain the tracking to tissue points within the tongue. Segmentation of 2D slices or 3D volumes is challenging because of the large number of slices and time frames involved in the segmentation, as well as the incorporation of numerous local deformations that occur throughout the tongue during motion. In this paper, we propose a semi-automatic approach to segment 3D dynamic MRI of the tongue. The algorithm steps include seeding a few slices at one time frame, propagating seeds to the same slices at different time frames using deformable registration, and random walker segmentation based on these seed positions. This method was validated on the tongue of five normal subjects carrying out the same speech task with multi-slice 2D dynamic cine-MR images obtained at three orthogonal orientations and 26 time frames. The resulting semi-automatic segmentations of a total of 130 volumes showed an average dice similarity coefficient (DSC) score of 0.92 with less segmented volume variability between time frames than in manual segmentations.

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

    Science.gov (United States)

    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.

  16. Fully automatic segmentation of femurs with medullary canal definition in high and in low resolution CT scans.

    Science.gov (United States)

    Almeida, Diogo F; Ruben, Rui B; Folgado, João; Fernandes, Paulo R; Audenaert, Emmanuel; Verhegghe, Benedict; De Beule, Matthieu

    2016-12-01

    Femur segmentation can be an important tool in orthopedic surgical planning. However, in order to overcome the need of an experienced user with extensive knowledge on the techniques, segmentation should be fully automatic. In this paper a new fully automatic femur segmentation method for CT images is presented. This method is also able to define automatically the medullary canal and performs well even in low resolution CT scans. Fully automatic femoral segmentation was performed adapting a template mesh of the femoral volume to medical images. In order to achieve this, an adaptation of the active shape model (ASM) technique based on the statistical shape model (SSM) and local appearance model (LAM) of the femur with a novel initialization method was used, to drive the template mesh deformation in order to fit the in-image femoral shape in a time effective approach. With the proposed method a 98% convergence rate was achieved. For high resolution CT images group the average error is less than 1mm. For the low resolution image group the results are also accurate and the average error is less than 1.5mm. The proposed segmentation pipeline is accurate, robust and completely user free. The method is robust to patient orientation, image artifacts and poorly defined edges. The results excelled even in CT images with a significant slice thickness, i.e., above 5mm. Medullary canal segmentation increases the geometric information that can be used in orthopedic surgical planning or in finite element analysis.

  17. Segmentation of knee injury swelling on infrared images

    Science.gov (United States)

    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.

  18. Image simulation for automatic license plate recognition

    Science.gov (United States)

    Bala, Raja; Zhao, Yonghui; Burry, Aaron; Kozitsky, Vladimir; Fillion, Claude; Saunders, Craig; Rodríguez-Serrano, José

    2012-01-01

    Automatic license plate recognition (ALPR) is an important capability for traffic surveillance applications, including toll monitoring and detection of different types of traffic violations. ALPR is a multi-stage process comprising plate localization, character segmentation, optical character recognition (OCR), and identification of originating jurisdiction (i.e. state or province). Training of an ALPR system for a new jurisdiction typically involves gathering vast amounts of license plate images and associated ground truth data, followed by iterative tuning and optimization of the ALPR algorithms. The substantial time and effort required to train and optimize the ALPR system can result in excessive operational cost and overhead. In this paper we propose a framework to create an artificial set of license plate images for accelerated training and optimization of ALPR algorithms. The framework comprises two steps: the synthesis of license plate images according to the design and layout for a jurisdiction of interest; and the modeling of imaging transformations and distortions typically encountered in the image capture process. Distortion parameters are estimated by measurements of real plate images. The simulation methodology is successfully demonstrated for training of OCR.

  19. Automatic seagrass pattern identification on sonar images

    Science.gov (United States)

    Rahnemoonfar, Maryam; Rahman, Abdullah

    2016-05-01

    Natural and human-induced disturbances are resulting in degradation and loss of seagrass. Freshwater flooding, severe meteorological events and invasive species are among the major natural disturbances. Human-induced disturbances are mainly due to boat propeller scars in the shallow seagrass meadows and anchor scars in the deeper areas. Therefore, there is a vital need to map seagrass ecosystems in order to determine worldwide abundance and distribution. Currently there is no established method for mapping the pothole or scars in seagrass. One of the most precise sensors to map the seagrass disturbance is side scan sonar. Here we propose an automatic method which detects seagrass potholes in sonar images. Side scan sonar images are notorious for having speckle noise and uneven illumination across the image. Moreover, disturbance presents complex patterns where most segmentation techniques will fail. In this paper, by applying mathematical morphology technique and calculating the local standard deviation of the image, the images were enhanced and the pothole patterns were identified. The proposed method was applied on sonar images taken from Laguna Madre in Texas. Experimental results show the effectiveness of the proposed method.

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

    NARCIS (Netherlands)

    Lee, K.; Buitendijk, G.H.; Bogunovic, H.; Springelkamp, H.; Hofman, A.; Wahle, A.; Sonka, M.; Vingerling, J.R.; Klaver, C.C.W.; Abramoff, M.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 x 6.0 x 2.3 mm3) we

  1. Interactive segmentation for geographic atrophy in retinal fundus images

    OpenAIRE

    Lee, Noah; SMITH, R. THEODORE; Laine, Andrew F.

    2008-01-01

    Fundus auto-fluorescence (FAF) imaging is a non-invasive technique for in vivo ophthalmoscopic inspection of age-related macular degeneration (AMD), the most common cause of blindness in developed countries. Geographic atrophy (GA) is an advanced form of AMD and accounts for 12–21% of severe visual loss in this disorder [3]. Automatic quantification of GA is important for determining disease progression and facilitating clinical diagnosis of AMD. The problem of automatic segmentation of patho...

  2. From MIP image to MRA segmentation using fuzzy set theory.

    Science.gov (United States)

    Vermandel, Maximilien; Betrouni, Nacim; Taschner, Christian; Vasseur, Christian; Rousseau, Jean

    2007-04-01

    The aim of this paper is to describe a semi-automatic method of segmentation in magnetic resonance angiography (MRA). This method, based on fuzzy set theory, uses the information (gray levels) contained in the maximum intensity projection (MIP) image to segment the 3D vascular structure from slices. Tests have been carried out on vascular phantom and on clinical MRA images. This 3D segmentation method has proved to be satisfactory for the detection of vascular structures even for very complex shapes. Finally, this MIP-based approach is semi-automatic and produces a robust segmentation thanks to the contrast-to-noise ratio and to the slice profile which are taken into account to determine the membership of a voxel to the vascular structure.

  3. Automated Brain Tumor Segmentation on MR Images Based on Neutrosophic Set Approach

    OpenAIRE

    Mohan J; Krishnaveni V; Yanhui Huo

    2015-01-01

    Brain tumor segmentation for MR images is a difficult and challenging task due to variation in type, size, location and shape of tumors. This paper presents an efficient and fully automatic brain tumor segmentation technique. This proposed technique includes non local preprocessing, fuzzy intensification to enhance the quality of the MR images, k - means clustering method for brain tumor segmentation.

  4. Semiautomatic segmentation of liver metastases on volumetric CT images

    Energy Technology Data Exchange (ETDEWEB)

    Yan, Jiayong [Department of Biomedical Engineering, Shanghai University of Medicine & Health Sciences, 101 Yingkou Road, Yang Pu District, Shanghai 200093 (China); Schwartz, Lawrence H.; Zhao, Binsheng, E-mail: bz2166@cumc.columbia.edu [Department of Radiology, Columbia University Medical Center, 630 West 168th Street, New York, New York 10032 (United States)

    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

  5. Super pixel density based clustering automatic image classification method

    Science.gov (United States)

    Xu, Mingxing; Zhang, Chuan; Zhang, Tianxu

    2015-12-01

    The image classification is an important means of image segmentation and data mining, how to achieve rapid automated image classification has been the focus of research. In this paper, based on the super pixel density of cluster centers algorithm for automatic image classification and identify outlier. The use of the image pixel location coordinates and gray value computing density and distance, to achieve automatic image classification and outlier extraction. Due to the increased pixel dramatically increase the computational complexity, consider the method of ultra-pixel image preprocessing, divided into a small number of super-pixel sub-blocks after the density and distance calculations, while the design of a normalized density and distance discrimination law, to achieve automatic classification and clustering center selection, whereby the image automatically classify and identify outlier. After a lot of experiments, our method does not require human intervention, can automatically categorize images computing speed than the density clustering algorithm, the image can be effectively automated classification and outlier extraction.

  6. Automatic segmentation of brain MRIs and mapping neuroanatomy across the human lifespan

    Science.gov (United States)

    Keihaninejad, Shiva; Heckemann, Rolf A.; Gousias, Ioannis S.; Rueckert, Daniel; Aljabar, Paul; Hajnal, Joseph V.; Hammers, Alexander

    2009-02-01

    A robust model for the automatic segmentation of human brain images into anatomically defined regions across the human lifespan would be highly desirable, but such structural segmentations of brain MRI are challenging due to age-related changes. We have developed a new method, based on established algorithms for automatic segmentation of young adults' brains. We used prior information from 30 anatomical atlases, which had been manually segmented into 83 anatomical structures. Target MRIs came from 80 subjects (~12 individuals/decade) from 20 to 90 years, with equal numbers of men, women; data from two different scanners (1.5T, 3T), using the IXI database. Each of the adult atlases was registered to each target MR image. By using additional information from segmentation into tissue classes (GM, WM and CSF) to initialise the warping based on label consistency similarity before feeding this into the previous normalised mutual information non-rigid registration, the registration became robust enough to accommodate atrophy and ventricular enlargement with age. The final segmentation was obtained by combination of the 30 propagated atlases using decision fusion. Kernel smoothing was used for modelling the structural volume changes with aging. Example linear correlation coefficients with age were, for lateral ventricular volume, rmale=0.76, rfemale=0.58 and, for hippocampal volume, rmale=-0.6, rfemale=-0.4 (allρ<0.01).

  7. Segmentation of Bacteria Image Based on Level Set Method

    Institute of Scientific and Technical Information of China (English)

    WANG Hua; CHEN Chun-xiao; HU Yong-hong; YANG Wen-ge

    2008-01-01

    In biology ferment engineering, accurate statistics of the quantity of bacte-ria is one of the most important subjects. In this paper, the quantity of bacteria which was observed traditionally manuauy can be detected automatically. Image acquisition and pro-cessing system is designed to accomplish image preprocessing, image segmentation and statistics of the quantity of bacteria. Segmentation of bacteria images is successfully real-ized by means of a region-based level set method and then the quantity of bacteria is com-puted precisely, which plays an important role in optimizing the growth conditions of bac-teria.

  8. Automatic Story Segmentation for TV News Video Using Multiple Modalities

    Directory of Open Access Journals (Sweden)

    Émilie Dumont

    2012-01-01

    Full Text Available While video content is often stored in rather large files or broadcasted in continuous streams, users are often interested in retrieving only a particular passage on a topic of interest to them. It is, therefore, necessary to split video documents or streams into shorter segments corresponding to appropriate retrieval units. We propose here a method for the automatic segmentation of TV news videos into stories. A-multiple-descriptor based segmentation approach is proposed. The selected multimodal features are complementary and give good insights about story boundaries. Once extracted, these features are expanded with a local temporal context and combined by an early fusion process. The story boundaries are then predicted using machine learning techniques. We investigate the system by experiments conducted using TRECVID 2003 data and protocol of the story boundary detection task, and we show that the proposed approach outperforms the state-of-the-art methods while requiring a very small amount of manual annotation.

  9. Quality assurance using outlier detection on an automatic segmentation method for the cerebellar peduncles

    Science.gov (United States)

    Li, Ke; Ye, Chuyang; Yang, Zhen; Carass, Aaron; Ying, Sarah H.; Prince, Jerry L.

    2016-03-01

    Cerebellar peduncles (CPs) are white matter tracts connecting the cerebellum to other brain regions. Automatic segmentation methods of the CPs have been proposed for studying their structure and function. Usually the performance of these methods is evaluated by comparing segmentation results with manual delineations (ground truth). However, when a segmentation method is run on new data (for which no ground truth exists) it is highly desirable to efficiently detect and assess algorithm failures so that these cases can be excluded from scientific analysis. In this work, two outlier detection methods aimed to assess the performance of an automatic CP segmentation algorithm are presented. The first one is a univariate non-parametric method using a box-whisker plot. We first categorize automatic segmentation results of a dataset of diffusion tensor imaging (DTI) scans from 48 subjects as either a success or a failure. We then design three groups of features from the image data of nine categorized failures for failure detection. Results show that most of these features can efficiently detect the true failures. The second method—supervised classification—was employed on a larger DTI dataset of 249 manually categorized subjects. Four classifiers—linear discriminant analysis (LDA), logistic regression (LR), support vector machine (SVM), and random forest classification (RFC)—were trained using the designed features and evaluated using a leave-one-out cross validation. Results show that the LR performs worst among the four classifiers and the other three perform comparably, which demonstrates the feasibility of automatically detecting segmentation failures using classification methods.

  10. An Unsupervised Dynamic Image Segmentation using Fuzzy Hopfield Neural Network based Genetic Algorithm

    CERN Document Server

    Halder, Amiya

    2012-01-01

    This paper proposes a Genetic Algorithm based segmentation method that can automatically segment gray-scale images. The proposed method mainly consists of spatial unsupervised grayscale image segmentation that divides an image into regions. The aim of this algorithm is to produce precise segmentation of images using intensity information along with neighborhood relationships. In this paper, Fuzzy Hopfield Neural Network (FHNN) clustering helps in generating the population of Genetic algorithm which there by automatically segments the image. This technique is a powerful method for image segmentation and works for both single and multiple-feature data with spatial information. Validity index has been utilized for introducing a robust technique for finding the optimum number of components in an image. Experimental results shown that the algorithm generates good quality segmented image.

  11. Dosimetric evaluation of an automatic segmentation tool of pelvic structures from MRI images for prostate cancer radiotherapy; Evaluation dosimetrique d'un outil de delineation automatique des organes pelviens a partir d'images IRM pour la radiotherapie du cancer prostatique

    Energy Technology Data Exchange (ETDEWEB)

    Pasquier, D.; Lacornerie, T.; Lartigau, E. [Centre Oscar-Lambret, Dept. Universitaire de Radiotherapie, 59 - Lille (France); Pasquier, D. [Centre Galilee, Polyclinique de la Louviere, 59 - Lille (France); Pasquier, D.; Betrouni, N.; Vermandel, M.; Rousseau, J. [Lille-2 Univ., U703 Thiais, Inserm, Lab. de Biophysique EA 1049, Institut de Technologie Medicale, CHU de Lille, 59 (France)

    2008-09-15

    Purpose: An automatic segmentation tool of pelvic structures from MRI images for prostate cancer radiotherapy was developed and dosimetric evaluation of differences of delineation (automatic versus human) is presented here. Materials and methods: C.T.V. (clinical target volume), rectum and bladder were defined automatically and by a physician in 20 patients. Treatment plans based on 'automatic' volumes were transferred on 'manual' volumes and reciprocally. Dosimetric characteristics of P.T.V. (V.95, minimal, maximal and mean doses), rectum (V.50, V.70, maximal and mean doses) and bladder (V.70, maximal and mean doses) were compared. Results: Automatic delineation of C.T.V. did not significantly influence dosimetric characteristics of 'manual' P.T.V. (projected target volume). Rectal V-50 and V.70 were not significantly different; mean rectal dose is slightly superior (43.2 versus 44.4 Gy, p = 0.02, Student test). Bladder V.70 was significantly superior too (19.3 versus 21.6, p = 0.004). Organ-at-risk (O.A.R.) automatic delineation had little influence on their dosimetric characteristics; rectal V.70 was slightly underestimated (20 versus 18.5 Gy, p = 0.001). Conclusion: C.T.V. and O.A.R. automatic delineation had little influence on dosimetric characteristics. Software developments are ongoing to enable routine use and interobserver evaluation is needed. (authors)

  12. CT image segmentation using FEM with optimized boundary condition.

    Directory of Open Access Journals (Sweden)

    Hiroyuki Hishida

    Full Text Available The authors propose a CT image segmentation method using structural analysis that is useful for objects with structural dynamic characteristics. Motivation of our research is from the area of genetic activity. In order to reveal the roles of genes, it is necessary to create mutant mice and measure differences among them by scanning their skeletons with an X-ray CT scanner. The CT image needs to be manually segmented into pieces of the bones. It is a very time consuming to manually segment many mutant mouse models in order to reveal the roles of genes. It is desirable to make this segmentation procedure automatic. Although numerous papers in the past have proposed segmentation techniques, no general segmentation method for skeletons of living creatures has been established. Against this background, the authors propose a segmentation method based on the concept of destruction analogy. To realize this concept, structural analysis is performed using the finite element method (FEM, as structurally weak areas can be expected to break under conditions of stress. The contribution of the method is its novelty, as no studies have so far used structural analysis for image segmentation. The method's implementation involves three steps. First, finite elements are created directly from the pixels of a CT image, and then candidates are also selected in areas where segmentation is thought to be appropriate. The second step involves destruction analogy to find a single candidate with high strain chosen as the segmentation target. The boundary conditions for FEM are also set automatically. Then, destruction analogy is implemented by replacing pixels with high strain as background ones, and this process is iterated until object is decomposed into two parts. Here, CT image segmentation is demonstrated using various types of CT imagery.

  13. Automatic speech signal segmentation based on the innovation adaptive filter

    Directory of Open Access Journals (Sweden)

    Makowski Ryszard

    2014-06-01

    Full Text Available Speech segmentation is an essential stage in designing automatic speech recognition systems and one can find several algorithms proposed in the literature. It is a difficult problem, as speech is immensely variable. The aim of the authors’ studies was to design an algorithm that could be employed at the stage of automatic speech recognition. This would make it possible to avoid some problems related to speech signal parametrization. Posing the problem in such a way requires the algorithm to be capable of working in real time. The only such algorithm was proposed by Tyagi et al., (2006, and it is a modified version of Brandt’s algorithm. The article presents a new algorithm for unsupervised automatic speech signal segmentation. It performs segmentation without access to information about the phonetic content of the utterances, relying exclusively on second-order statistics of a speech signal. The starting point for the proposed method is time-varying Schur coefficients of an innovation adaptive filter. The Schur algorithm is known to be fast, precise, stable and capable of rapidly tracking changes in second order signal statistics. A transfer from one phoneme to another in the speech signal always indicates a change in signal statistics caused by vocal track changes. In order to allow for the properties of human hearing, detection of inter-phoneme boundaries is performed based on statistics defined on the mel spectrum determined from the reflection coefficients. The paper presents the structure of the algorithm, defines its properties, lists parameter values, describes detection efficiency results, and compares them with those for another algorithm. The obtained segmentation results, are satisfactory.

  14. A fast and efficient segmentation scheme for cell microscopic image.

    Science.gov (United States)

    Lebrun, G; Charrier, C; Lezoray, O; Meurie, C; Cardot, H

    2007-04-27

    Microscopic cellular image segmentation schemes must be efficient for reliable analysis and fast to process huge quantity of images. Recent studies have focused on improving segmentation quality. Several segmentation schemes have good quality but processing time is too expensive to deal with a great number of images per day. For segmentation schemes based on pixel classification, the classifier design is crucial since it is the one which requires most of the processing time necessary to segment an image. The main contribution of this work is focused on how to reduce the complexity of decision functions produced by support vector machines (SVM) while preserving recognition rate. Vector quantization is used in order to reduce the inherent redundancy present in huge pixel databases (i.e. images with expert pixel segmentation). Hybrid color space design is also used in order to improve data set size reduction rate and recognition rate. A new decision function quality criterion is defined to select good trade-off between recognition rate and processing time of pixel decision function. The first results of this study show that fast and efficient pixel classification with SVM is possible. Moreover posterior class pixel probability estimation is easy to compute with Platt method. Then a new segmentation scheme using probabilistic pixel classification has been developed. This one has several free parameters and an automatic selection must dealt with, but criteria for evaluate segmentation quality are not well adapted for cell segmentation, especially when comparison with expert pixel segmentation must be achieved. Another important contribution in this paper is the definition of a new quality criterion for evaluation of cell segmentation. The results presented here show that the selection of free parameters of the segmentation scheme by optimisation of the new quality cell segmentation criterion produces efficient cell segmentation.

  15. UMLS-based automatic image indexing.

    Science.gov (United States)

    Sneiderman, C; Sneiderman, Charles Alan; Demner-Fushman, D; Demner-Fushman, Dina; Fung, K W; Fung, Kin Wah; Bray, B; Bray, Bruce

    2008-01-01

    To date, most accurate image retrieval techniques rely on textual descriptions of images. Our goal is to automatically generate indexing terms for an image extracted from a biomedical article by identifying Unified Medical Language System (UMLS) concepts in image caption and its discussion in the text. In a pilot evaluation of the suggested image indexing method by five physicians, a third of the automatically identified index terms were found suitable for indexing.

  16. Automated image segmentation of haematoxylin and eosin stained skeletal muscle cross-sections

    DEFF Research Database (Denmark)

    Liu, F; Mackey, AL; Srikuea, R;

    2013-01-01

    . This procedure is labour-intensive and time-consuming. In this paper, we have developed and validated an automatic image segmentation algorithm that is not only efficient but also accurate. Our proposed automatic segmentation algorithm for haematoxylin and eosin stained skeletal muscle cross-sections consists...

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

    Science.gov (United States)

    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.

  18. SEGMENTACIÓN SEMIAUTOMÁTICA DEL VOLUMEN DEL HÍGADO EN IMÁGENES DE TOMOGRAFÍA COMPUTARIZADA Semi-Automatic Liver Volume Segmentation in Computed Tomography Images

    Directory of Open Access Journals (Sweden)

    GERARDO TIBAMOSO

    Full Text Available El volumen del hígado es un parámetro determinante en cirugía para la extracción de tumores, trasplantes, y en tratamientos de regeneración. Generalmente, la estimación de este volumen se calcula a partir de segmentaciones manuales realizadas por especialistas, siendo éste un proceso tedioso y con poca reproducibilidad de sus resultados. En este trabajo se presenta un método semiautomático para la segmentación del volumen del hígado en imágenes de TAC. El método consiste en superponer manualmente una superficie de triángulos en las imágenes, y deformarla por medio de una ecuación de movimiento asociada a cada uno de sus vértices, para delimitar las fronteras del hígado. La dinámica de la superficie depende de información de intensidades y gradientes, y de relaciones de vecindad entre los vértices, hasta cumplir un número de iteraciones. Comparaciones entre las segmentaciones del método con las segmentaciones de referencia en 20 estudios de TAC, muestran la adaptabilidad de la superficie a la forma y fronteras difusas del hígado, dos de los principales problemas de la segmentación.Liver volume is a significant parameter in surgery for tumor extraction, transplants, and regeneration treatments. Generally, the volume estimation is obtained from manual segmentations performed by specialists, resulting in a tedious process with low reproducibility. In this work a semi-automatic method for the liver volume segmentation in CT images is presented. The method consist in manually superimpose a triangular surface on the images, and use a movement equation associated to each vertex to deform the surface and delimit the liver boundaries. Surface dynamics depend on intensity and gradient information, and neighboring relationships between vertices, until a fixed number of iterations is reached. Comparison between the obtained results and reference segmentations in 20 CT scans, show the surface adaptability to the shape and the diffuse

  19. Automatic Tooth Segmentation of Dental Mesh Based on Harmonic Fields

    Directory of Open Access Journals (Sweden)

    Sheng-hui Liao

    2015-01-01

    Full Text Available An important preprocess in computer-aided orthodontics is to segment teeth from the dental models accurately, which should involve manual interactions as few as possible. But fully automatic partition of all teeth is not a trivial task, since teeth occur in different shapes and their arrangements vary substantially from one individual to another. The difficulty is exacerbated when severe teeth malocclusion and crowding problems occur, which is a common occurrence in clinical cases. Most published methods in this area either are inaccurate or require lots of manual interactions. Motivated by the state-of-the-art general mesh segmentation methods that adopted the theory of harmonic field to detect partition boundaries, this paper proposes a novel, dental-targeted segmentation framework for dental meshes. With a specially designed weighting scheme and a strategy of a priori knowledge to guide the assignment of harmonic constraints, this method can identify teeth partition boundaries effectively. Extensive experiments and quantitative analysis demonstrate that the proposed method is able to partition high-quality teeth automatically with robustness and efficiency.

  20. Automatic Tooth Segmentation of Dental Mesh Based on Harmonic Fields.

    Science.gov (United States)

    Liao, Sheng-hui; Liu, Shi-jian; Zou, Bei-ji; Ding, Xi; Liang, Ye; Huang, Jun-hui

    2015-01-01

    An important preprocess in computer-aided orthodontics is to segment teeth from the dental models accurately, which should involve manual interactions as few as possible. But fully automatic partition of all teeth is not a trivial task, since teeth occur in different shapes and their arrangements vary substantially from one individual to another. The difficulty is exacerbated when severe teeth malocclusion and crowding problems occur, which is a common occurrence in clinical cases. Most published methods in this area either are inaccurate or require lots of manual interactions. Motivated by the state-of-the-art general mesh segmentation methods that adopted the theory of harmonic field to detect partition boundaries, this paper proposes a novel, dental-targeted segmentation framework for dental meshes. With a specially designed weighting scheme and a strategy of a priori knowledge to guide the assignment of harmonic constraints, this method can identify teeth partition boundaries effectively. Extensive experiments and quantitative analysis demonstrate that the proposed method is able to partition high-quality teeth automatically with robustness and efficiency.

  1. Automatic 3D liver segmentation based on deep learning and globally optimized surface evolution

    Science.gov (United States)

    Hu, Peijun; Wu, Fa; Peng, Jialin; Liang, Ping; Kong, Dexing

    2016-12-01

    The detection and delineation of the liver from abdominal 3D computed tomography (CT) images are fundamental tasks in computer-assisted liver surgery planning. However, automatic and accurate segmentation, especially liver detection, remains challenging due to complex backgrounds, ambiguous boundaries, heterogeneous appearances and highly varied shapes of the liver. To address these difficulties, we propose an automatic segmentation framework based on 3D convolutional neural network (CNN) and globally optimized surface evolution. First, a deep 3D CNN is trained to learn a subject-specific probability map of the liver, which gives the initial surface and acts as a shape prior in the following segmentation step. Then, both global and local appearance information from the prior segmentation are adaptively incorporated into a segmentation model, which is globally optimized in a surface evolution way. The proposed method has been validated on 42 CT images from the public Sliver07 database and local hospitals. On the Sliver07 online testing set, the proposed method can achieve an overall score of 80.3+/- 4.5 , yielding a mean Dice similarity coefficient of 97.25+/- 0.65 % , and an average symmetric surface distance of 0.84+/- 0.25 mm. The quantitative validations and comparisons show that the proposed method is accurate and effective for clinical application.

  2. Automatic cobb angle determination from radiographic images

    NARCIS (Netherlands)

    Sardjono, Tri Arief; Wilkinson, Michael H.F.; Veldhuizen, Albert G.; Ooijen, van Peter M.A.; Purnama, Ketut E.; Verkerke, Gijsbertus J.

    2013-01-01

    Study Design. Automatic measurement of Cobb angle in patients with scoliosis. Objective. To test the accuracy of an automatic Cobb angle determination method from frontal radiographical images. Summary of Background Data. Thirty-six frontal radiographical images of patients with scoliosis. Met

  3. Automatic Cobb Angle Determination From Radiographic Images

    NARCIS (Netherlands)

    Sardjono, Tri Arief; Wilkinson, Michael H. F.; Veldhuizen, Albert G.; van Ooijen, Peter M. A.; Purnama, Ketut E.; Verkerke, Gijsbertus J.

    2013-01-01

    Study Design. Automatic measurement of Cobb angle in patients with scoliosis. Objective. To test the accuracy of an automatic Cobb angle determination method from frontal radiographical images. Summary of Background Data. Thirty-six frontal radiographical images of patients with scoliosis. Methods.

  4. Automatic segmentation of colon glands using object-graphs.

    Science.gov (United States)

    Gunduz-Demir, Cigdem; Kandemir, Melih; Tosun, Akif Burak; Sokmensuer, Cenk

    2010-02-01

    Gland segmentation is an important step to automate the analysis of biopsies that contain glandular structures. However, this remains a challenging problem as the variation in staining, fixation, and sectioning procedures lead to a considerable amount of artifacts and variances in tissue sections, which may result in huge variances in gland appearances. In this work, we report a new approach for gland segmentation. This approach decomposes the tissue image into a set of primitive objects and segments glands making use of the organizational properties of these objects, which are quantified with the definition of object-graphs. As opposed to the previous literature, the proposed approach employs the object-based information for the gland segmentation problem, instead of using the pixel-based information alone. Working with the images of colon tissues, our experiments demonstrate that the proposed object-graph approach yields high segmentation accuracies for the training and test sets and significantly improves the segmentation performance of its pixel-based counterparts. The experiments also show that the object-based structure of the proposed approach provides more tolerance to artifacts and variances in tissues.

  5. BgCut: automatic ship detection from UAV images.

    Science.gov (United States)

    Xu, Chao; Zhang, Dongping; Zhang, Zhengning; Feng, Zhiyong

    2014-01-01

    Ship detection in static UAV aerial images is a fundamental challenge in sea target detection and precise positioning. In this paper, an improved universal background model based on Grabcut algorithm is proposed to segment foreground objects from sea automatically. First, a sea template library including images in different natural conditions is built to provide an initial template to the model. Then the background trimap is obtained by combing some templates matching with region growing algorithm. The output trimap initializes Grabcut background instead of manual intervention and the process of segmentation without iteration. The effectiveness of our proposed model is demonstrated by extensive experiments on a certain area of real UAV aerial images by an airborne Canon 5D Mark. The proposed algorithm is not only adaptive but also with good segmentation. Furthermore, the model in this paper can be well applied in the automated processing of industrial images for related researches.

  6. Automatic generalization of metro maps based on dynamic segmentation

    Institute of Scientific and Technical Information of China (English)

    2010-01-01

    A metro map is usually optimized for the readability of connections and transportation networks structure.In order to assure good readability and meet aesthetic considerations,a set of principles for good metro map layout are proposed.According to these principles,a new methodology based on dynamic segmentation is presented to produce the metro maps automatically.Firstly,routes are constructed according to the line attribute similarity and geometry continuity.Then a set of cartographic generalization methods about the shape,angle,length,and topology are presented for these routes.This method is validated by Beijing metro plan map.From the experiment results,it can be concluded that this new method is more effective than the static segmentation method to produce metro maps with better readability for route plans.

  7. An Active Contour for Range Image Segmentation

    Directory of Open Access Journals (Sweden)

    Khaldi Amine

    2012-06-01

    Full Text Available In this paper a new classification of range image segmentation method is proposed according to the criterion of homogeneity which obeys the segmentation, then, a deformable model-type active contour “Snake” is applied to segment range images.

  8. Automatic detection and segmentation of lymph nodes from CT data.

    Science.gov (United States)

    Barbu, Adrian; Suehling, Michael; Xu, Xun; Liu, David; Zhou, S Kevin; Comaniciu, Dorin

    2012-02-01

    Lymph nodes are assessed routinely in clinical practice and their size is followed throughout radiation or chemotherapy to monitor the effectiveness of cancer treatment. This paper presents a robust learning-based method for automatic detection and segmentation of solid lymph nodes from CT data, with the following contributions. First, it presents a learning based approach to solid lymph node detection that relies on marginal space learning to achieve great speedup with virtually no loss in accuracy. Second, it presents a computationally efficient segmentation method for solid lymph nodes (LN). Third, it introduces two new sets of features that are effective for LN detection, one that self-aligns to high gradients and another set obtained from the segmentation result. The method is evaluated for axillary LN detection on 131 volumes containing 371 LN, yielding a 83.0% detection rate with 1.0 false positive per volume. It is further evaluated for pelvic and abdominal LN detection on 54 volumes containing 569 LN, yielding a 80.0% detection rate with 3.2 false positives per volume. The running time is 5-20 s per volume for axillary areas and 15-40 s for pelvic. An added benefit of the method is the capability to detect and segment conglomerated lymph nodes.

  9. Unsupervised Neural Techniques Applied to MR Brain Image Segmentation

    Directory of Open Access Journals (Sweden)

    A. Ortiz

    2012-01-01

    Full Text Available The primary goal of brain image segmentation is to partition a given brain image into different regions representing anatomical structures. Magnetic resonance image (MRI segmentation is especially interesting, since accurate segmentation in white matter, grey matter and cerebrospinal fluid provides a way to identify many brain disorders such as dementia, schizophrenia or Alzheimer’s disease (AD. Then, image segmentation results in a very interesting tool for neuroanatomical analyses. In this paper we show three alternatives to MR brain image segmentation algorithms, with the Self-Organizing Map (SOM as the core of the algorithms. The procedures devised do not use any a priori knowledge about voxel class assignment, and results in fully-unsupervised methods for MRI segmentation, making it possible to automatically discover different tissue classes. Our algorithm has been tested using the images from the Internet Brain Image Repository (IBSR outperforming existing methods, providing values for the average overlap metric of 0.7 for the white and grey matter and 0.45 for the cerebrospinal fluid. Furthermore, it also provides good results for high-resolution MR images provided by the Nuclear Medicine Service of the “Virgen de las Nieves” Hospital (Granada, Spain.

  10. Vehicles Recognition Using Fuzzy Descriptors of Image Segments

    CERN Document Server

    Płaczek, Bartłomiej

    2011-01-01

    In this paper a vision-based vehicles recognition method is presented. Proposed method uses fuzzy description of image segments for automatic recognition of vehicles recorded in image data. The description takes into account selected geometrical properties and shape coefficients determined for segments of reference image (vehicle model). The proposed method was implemented using reasoning system with fuzzy rules. A vehicles recognition algorithm was developed based on the fuzzy rules describing shape and arrangement of the image segments that correspond to visible parts of a vehicle. An extension of the algorithm with set of fuzzy rules defined for different reference images (and various vehicle shapes) enables vehicles classification in traffic scenes. The devised method is suitable for application in video sensors for road traffic control and surveillance systems.

  11. Automatic Speech Segmentation Based On Audio and Optical Flow Visual Classification

    Directory of Open Access Journals (Sweden)

    Behnam Torabi

    2014-10-01

    Full Text Available Automatic speech segmentation as an important part of speech recognition system (ASR is highly noise dependent. Noise is made by changes in the communication channel, background, level of speaking etc. In recent years, many researchers have proposed noise cancelation techniques and have added visual features from speaker’s face to reduce the effect of noise on ASR systems. Removing noise from audio signals depends on the type of the noise; so it cannot be used as a general solution. Adding visual features improve this lack of efficiency, but advanced methods of this type need manual extraction of visual features. In this paper we propose a completely automatic system which uses optical flow vectors from speaker’s image sequence to obtain visual features. Then, Hidden Markov Models are trained to segment audio signals from image sequences and audio features based on extracted optical flow. The developed segmentation system based on such method acts totally automatic and become more robust to noise.

  12. Color Image Segmentation Method Based on Improved Spectral Clustering Algorithm

    OpenAIRE

    Dong Qin

    2014-01-01

    Contraposing to the features of image data with high sparsity of and the problems on determination of clustering numbers, we try to put forward an color image segmentation algorithm, combined with semi-supervised machine learning technology and spectral graph theory. By the research of related theories and methods of spectral clustering algorithms, we introduce information entropy conception to design a method which can automatically optimize the scale parameter value. So it avoids the unstab...

  13. Image segmentation evaluation for very-large datasets

    Science.gov (United States)

    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.

  14. Fingerprint Image Enhancement:Segmentation to Thinning

    Directory of Open Access Journals (Sweden)

    Iwasokun Gabriel Babatunde

    2012-01-01

    Full Text Available Fingerprint has remained a very vital index for human recognition. In the field of security, series of Automatic Fingerprint Identification Systems (AFIS have been developed. One of the indices for evaluating the contributions of these systems to the enforcement of security is the degree with which they appropriately verify or identify input fingerprints. This degree is generally determined by the quality of the fingerprint images and the efficiency of the algorithm. In this paper, some of the sub-models of an existing mathematical algorithm for the fingerprint image enhancement were modified to obtain new and improved versions. The new versions consist of different mathematical models for fingerprint image segmentation, normalization, ridge orientation estimation, ridge frequency estimation, Gabor filtering, binarization and thinning. The implementation was carried out in an environment characterized by Window Vista Home Basic operating system as platform and Matrix Laboratory (MatLab as frontend engine. Synthetic images as well as real fingerprints obtained from the FVC2004 fingerprint database DB3 set A were used to test the adequacy of the modified sub-models and the resulting algorithm. The results show that the modified sub-models perform well with significant improvement over the original versions. The results also show the necessity of each level of the enhancement.

  15. Robust Machine Learning-Based Correction on Automatic Segmentation of the Cerebellum and Brainstem.

    Directory of Open Access Journals (Sweden)

    Jun Yi Wang

    Full Text Available Automated segmentation is a useful method for studying large brain structures such as the cerebellum and brainstem. However, automated segmentation may lead to inaccuracy and/or undesirable boundary. The goal of the present study was to investigate whether SegAdapter, a machine learning-based method, is useful for automatically correcting large segmentation errors and disagreement in anatomical definition. We further assessed the robustness of the method in handling size of training set, differences in head coil usage, and amount of brain atrophy. High resolution T1-weighted images were acquired from 30 healthy controls scanned with either an 8-channel or 32-channel head coil. Ten patients, who suffered from brain atrophy because of fragile X-associated tremor/ataxia syndrome, were scanned using the 32-channel head coil. The initial segmentations of the cerebellum and brainstem were generated automatically using Freesurfer. Subsequently, Freesurfer's segmentations were both manually corrected to serve as the gold standard and automatically corrected by SegAdapter. Using only 5 scans in the training set, spatial overlap with manual segmentation in Dice coefficient improved significantly from 0.956 (for Freesurfer segmentation to 0.978 (for SegAdapter-corrected segmentation for the cerebellum and from 0.821 to 0.954 for the brainstem. Reducing the training set size to 2 scans only decreased the Dice coefficient ≤0.002 for the cerebellum and ≤ 0.005 for the brainstem compared to the use of training set size of 5 scans in corrective learning. The method was also robust in handling differences between the training set and the test set in head coil usage and the amount of brain atrophy, which reduced spatial overlap only by <0.01. These results suggest that the combination of automated segmentation and corrective learning provides a valuable method for accurate and efficient segmentation of the cerebellum and brainstem, particularly in large

  16. AUTOMATIC SEGMENTATION AND STRUCTURAL CHARACTERIZATION OF LOW DENSITY FIBREBOARDS

    Directory of Open Access Journals (Sweden)

    Jérôme Lux

    2013-03-01

    Full Text Available In this paper, a new skeleton-based algorithm for the segmentation of individual fibres in 3D tomographic images is described. The proposed method is designed to deal with low density materials featuring fibres with varied sizes, shapes and tortuosities, like composite fibreboards used for buildings insulation. To this end the paths of the skeleton are first classified according to their connectivity, the connectivity of their adjacent nodes, their orientation, their average radius and the variation of the distance transform along each path. This allows for the identification of spurious paths and paths linking two fibres. Reconstruction of the path of the fibres is done thanks to an optimal pairing algorithm which joins paths that show the most similar orientation and radius at each node/link. The segmented skeleton is finally dilated by means of a growing algorithm ordonned by the average radius of the fibres in order to reconstruct each identified fibres. As an application, the algorithm is used to segment a 3D tomographic image of hemp/polymer fibreboard for buildings insulation. Information such as the number of contacts, tortuosity, length, average radius, orientation of fibres are finally measured on both the segmented skeleton and reconstructed image, which allow for a thorough characterization of the fibre network.

  17. Non-parametric iterative model constraint graph min-cut for automatic kidney segmentation.

    Science.gov (United States)

    Freiman, M; Kronman, A; Esses, S J; Joskowicz, L; Sosna, J

    2010-01-01

    We present a new non-parametric model constraint graph min-cut algorithm for automatic kidney segmentation in CT images. The segmentation is formulated as a maximum a-posteriori estimation of a model-driven Markov random field. A non-parametric hybrid shape and intensity model is treated as a latent variable in the energy functional. The latent model and labeling map that minimize the energy functional are then simultaneously computed with an expectation maximization approach. The main advantages of our method are that it does not assume a fixed parametric prior model, which is subjective to inter-patient variability and registration errors, and that it combines both the model and the image information into a unified graph min-cut based segmentation framework. We evaluated our method on 20 kidneys from 10 CT datasets with and without contrast agent for which ground-truth segmentations were generated by averaging three manual segmentations. Our method yields an average volumetric overlap error of 10.95%, and average symmetric surface distance of 0.79 mm. These results indicate that our method is accurate and robust for kidney segmentation.

  18. Hierarchical image segmentation for learning object priors

    Energy Technology Data Exchange (ETDEWEB)

    Prasad, Lakshman [Los Alamos National Laboratory; Yang, Xingwei [TEMPLE UNIV.; Latecki, Longin J [TEMPLE UNIV.; Li, Nan [TEMPLE UNIV.

    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.

  19. 基于分块采样和遗传算法的自动多阈值图像分割%Automatic Multilevel Thresholding for Image Segmentation Based on Block Sampling and Genetic Algorithm

    Institute of Scientific and Technical Information of China (English)

    姜允志; 郝志峰; 林智勇; 袁淦钊

    2011-01-01

    图像多阈值分割在图像压缩、图像分析和模式识别等很多领域具有重要应用,但是阈值数的自动选择一直是至今未解决的难题.为此,基于分块采样和遗传算法提出一种自动多阈值图像分割算法.首先将一幅图像看成是由像素值组成的总体,运用分块采样得到若干子样本;其次在每一个子样本中运用遗传算法来使样本的均值与方差比极大化;再基于获得的样本信息对阈值数目和阈值进行自动预测;最后利用一种确定性的算法对阈值数和阈值做进一步的优化.该算法无需事先考虑图像的纹理和分割数等先验信息,具有较高的易用性,其计算复杂性对图像阈值个数敏感性较低,且无需进行灰度直方图分析.在Berkeley图像分割数据集上的大量仿真实验结果表明,文中算法能获得较准确、快速和稳定的图像分割.%Multilevel thresholding is an important technique for image compression, image analysis and pattern recognition. However, it is a hard problem to determine the number of thresholds automatically. In this paper, a new multilevel thresholding method called as automatic multilevel thresholding algorithm for image segmentation based on block sampling and genetic algorithm (AMT-BSGA) is proposed on the basis of block sampling and genetic algorithm. The proposed method can automatically determine the appropriate number of thresholds and the proper threshold values. In AMT-BSGA, an image is treated as a group of individual pixels with the gray values. First, an image is evenly divided into several blocks, and a sample is drawn from each block. Then, genetic algorithm based optimization is applied to each sample to maximize the ratio of mean and variance of the sample. Based on the optimized samples, the number of thresholds and threshold values are preliminarily determined. Finally, a deterministic method is implemented to further optimize the number of thresholds and

  20. Convolutional Neural Networks for SAR Image Segmentation

    DEFF Research Database (Denmark)

    Malmgren-Hansen, David; Nobel-Jørgensen, Morten

    2015-01-01

    Segmentation of Synthetic Aperture Radar (SAR) images has several uses, but it is a difficult task due to a number of properties related to SAR images. In this article we show how Convolutional Neural Networks (CNNs) can easily be trained for SAR image segmentation with good results. Besides...

  1. Automatic and Manual Segmentation of Hippocampus in Epileptic Patients MRI

    CERN Document Server

    Hosseini, Mohammad-Parsa; Pompili, Dario; Jafari-Khouzani, Kourosh; Elisevich, Kost; Soltanian-Zadeh, Hamid

    2016-01-01

    The hippocampus is a seminal structure in the most common surgically-treated form of epilepsy. Accurate segmentation of the hippocampus aids in establishing asymmetry regarding size and signal characteristics in order to disclose the likely site of epileptogenicity. With sufficient refinement, it may ultimately aid in the avoidance of invasive monitoring with its expense and risk for the patient. To this end, a reliable and consistent method for segmentation of the hippocampus from magnetic resonance imaging (MRI) is needed. In this work, we present a systematic and statistical analysis approach for evaluation of automated segmentation methods in order to establish one that reliably approximates the results achieved by manual tracing of the hippocampus.

  2. Distance measures for image segmentation evaluation

    OpenAIRE

    Monteiro, Fernando C.; Campilho, Aurélio C.

    2012-01-01

    In this paper we present a study of evaluation measures that enable the quantification of the quality of an image segmentation result. Despite significant advances in image segmentation techniques, evaluation of these techniques thus far has been largely subjective. Typically, the effectiveness of a new algorithm is demonstrated only by the presentation of a few segmented images and is otherwise left to subjective evaluation by the reader. Such an evaluation criterion can be useful for differ...

  3. Image Segmentation Using Hierarchical Merge Tree

    Science.gov (United States)

    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.

  4. Medical image segmentation using level set and watershed transform

    Science.gov (United States)

    Zhu, Fuping; Tian, Jie

    2003-07-01

    One of the most popular level set algorithms is the so-called fast marching method. In this paper, a medical image segmentation algorithm is proposed based on the combination of fast marching method and watershed transformation. First, the original image is smoothed using nonlinear diffusion filter, then the smoothed image is over-segmented by the watershed algorithm. Last, the image is segmented automatically using the modified fast marching method. Due to introducing over-segmentation, the arrival time the seeded point to the boundary of region should be calculated. For other pixels inside the region of the seeded point, the arrival time is not calculated because of the region homogeneity. So the algorithm"s speed improves greatly. Moreover, the speed function is redefined based on the statistical similarity degree of the nearby regions. We also extend our algorithm to 3D circumstance and segment medical image series. Experiments show that the algorithm can fast and accurately obtain segmentation results of medical images.

  5. Automatic segmentation of histological structures in mammary gland tissue sections

    Energy Technology Data Exchange (ETDEWEB)

    Fernandez-Gonzalez, Rodrigo; Deschamps, Thomas; Idica, Adam K.; Malladi, Ravikanth; Ortiz de Solorzano, Carlos

    2004-02-17

    Real-time three-dimensional (3D) reconstruction of epithelial structures in human mammary gland tissue blocks mapped with selected markers would be an extremely helpful tool for breast cancer diagnosis and treatment planning. Besides its clear clinical application, this tool could also shed a great deal of light on the molecular basis of breast cancer initiation and progression. In this paper we present a framework for real-time segmentation of epithelial structures in two-dimensional (2D) images of sections of normal and neoplastic mammary gland tissue blocks. Complete 3D rendering of the tissue can then be done by surface rendering of the structures detected in consecutive sections of the blocks. Paraffin embedded or frozen tissue blocks are first sliced, and sections are stained with Hematoxylin and Eosin. The sections are then imaged using conventional bright field microscopy and their background is corrected using a phantom image. We then use the Fast-Marching algorithm to roughly extract the contours of the different morphological structures in the images. The result is then refined with the Level-Set method which converges to an accurate (sub-pixel) solution for the segmentation problem. Finally, our system stacks together the 2D results obtained in order to reconstruct a 3D representation of the entire tissue block under study. Our method is illustrated with results from the segmentation of human and mouse mammary gland tissue samples.

  6. Different Image Segmentation Techniques for Dental Image Extraction

    Directory of Open Access Journals (Sweden)

    R. Bala Subramanyam

    2014-07-01

    Full Text Available Image segmentation is the process of partitioning a digital image into multiple segments and often used to locate objects and boundaries (lines, curves etc.. In this paper, we have proposed image segmentation techniques: Region based, Texture based, Edge based. These techniques have been implemented on dental radiographs and gained good results compare to conventional technique known as Thresholding based technique. The quantitative results show the superiority of the image segmentation technique over three proposed techniques and conventional technique.

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

    Science.gov (United States)

    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.

  8. Segmentation of neuroanatomy in magnetic resonance images

    Science.gov (United States)

    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.

  9. Generic method for automatic bladder segmentation on cone beam CT using a patient-specific bladder shape model

    Energy Technology Data Exchange (ETDEWEB)

    Schoot, A. J. A. J. van de, E-mail: a.j.schootvande@amc.uva.nl; Schooneveldt, G.; Wognum, S.; Stalpers, L. J. A.; Rasch, C. R. N.; Bel, A. [Department of Radiation Oncology, Academic Medical Center, University of Amsterdam, Meibergdreef 9, 1105 AZ Amsterdam (Netherlands); Hoogeman, M. S. [Department of Radiation Oncology, Daniel den Hoed Cancer Center, Erasmus Medical Center, Groene Hilledijk 301, 3075 EA Rotterdam (Netherlands); Chai, X. [Department of Radiation Oncology, Stanford University School of Medicine, 875 Blake Wilbur Drive, Palo Alto, California 94305 (United States)

    2014-03-15

    Purpose: The aim of this study is to develop and validate a generic method for automatic bladder segmentation on cone beam computed tomography (CBCT), independent of gender and treatment position (prone or supine), using only pretreatment imaging data. Methods: Data of 20 patients, treated for tumors in the pelvic region with the entire bladder visible on CT and CBCT, were divided into four equally sized groups based on gender and treatment position. The full and empty bladder contour, that can be acquired with pretreatment CT imaging, were used to generate a patient-specific bladder shape model. This model was used to guide the segmentation process on CBCT. To obtain the bladder segmentation, the reference bladder contour was deformed iteratively by maximizing the cross-correlation between directional grey value gradients over the reference and CBCT bladder edge. To overcome incorrect segmentations caused by CBCT image artifacts, automatic adaptations were implemented. Moreover, locally incorrect segmentations could be adapted manually. After each adapted segmentation, the bladder shape model was expanded and new shape patterns were calculated for following segmentations. All available CBCTs were used to validate the segmentation algorithm. The bladder segmentations were validated by comparison with the manual delineations and the segmentation performance was quantified using the Dice similarity coefficient (DSC), surface distance error (SDE) and SD of contour-to-contour distances. Also, bladder volumes obtained by manual delineations and segmentations were compared using a Bland-Altman error analysis. Results: The mean DSC, mean SDE, and mean SD of contour-to-contour distances between segmentations and manual delineations were 0.87, 0.27 cm and 0.22 cm (female, prone), 0.85, 0.28 cm and 0.22 cm (female, supine), 0.89, 0.21 cm and 0.17 cm (male, supine) and 0.88, 0.23 cm and 0.17 cm (male, prone), respectively. Manual local adaptations improved the segmentation

  10. Contrast-based fully automatic segmentation of white matter hyperintensities: method and validation.

    Directory of Open Access Journals (Sweden)

    Thomas Samaille

    Full Text Available White matter hyperintensities (WMH on T2 or FLAIR sequences have been commonly observed on MR images of elderly people. They have been associated with various disorders and have been shown to be a strong risk factor for stroke and dementia. WMH studies usually required visual evaluation of WMH load or time-consuming manual delineation. This paper introduced WHASA (White matter Hyperintensities Automated Segmentation Algorithm, a new method for automatically segmenting WMH from FLAIR and T1 images in multicentre studies. Contrary to previous approaches that were based on intensities, this method relied on contrast: non linear diffusion filtering alternated with watershed segmentation to obtain piecewise constant images with increased contrast between WMH and surroundings tissues. WMH were then selected based on subject dependant automatically computed threshold and anatomical information. WHASA was evaluated on 67 patients from two studies, acquired on six different MRI scanners and displaying a wide range of lesion load. Accuracy of the segmentation was assessed through volume and spatial agreement measures with respect to manual segmentation; an intraclass correlation coefficient (ICC of 0.96 and a mean similarity index (SI of 0.72 were obtained. WHASA was compared to four other approaches: Freesurfer and a thresholding approach as unsupervised methods; k-nearest neighbours (kNN and support vector machines (SVM as supervised ones. For these latter, influence of the training set was also investigated. WHASA clearly outperformed both unsupervised methods, while performing at least as good as supervised approaches (ICC range: 0.87-0.91 for kNN; 0.89-0.94 for SVM. Mean SI: 0.63-0.71 for kNN, 0.67-0.72 for SVM, and did not need any training set.

  11. Plugin procedure in segmentation and application to hyperspectral image segmentation

    CERN Document Server

    Girard, R

    2010-01-01

    In this article we give our contribution to the problem of segmentation with plug-in procedures. We give general sufficient conditions under which plug in procedure are efficient. We also give an algorithm that satisfy these conditions. We give an application of the used algorithm to hyperspectral images segmentation. Hyperspectral images are images that have both spatial and spectral coherence with thousands of spectral bands on each pixel. In the proposed procedure we combine a reduction dimension technique and a spatial regularisation technique. This regularisation is based on the mixlet modelisation of Kolaczyck and Al.

  12. Automatic Image-Based Pencil Sketch Rendering

    Institute of Scientific and Technical Information of China (English)

    王进; 鲍虎军; 周伟华; 彭群生; 徐迎庆

    2002-01-01

    This paper presents an automatic image-based approach for converting greyscale images to pencil sketches, in which strokes follow the image features. The algorithm first extracts a dense direction field automatically using Logical/Linear operators which embody the drawing mechanism. Next, a reconstruction approach based on a sampling-and-interpolation scheme is introduced to generate stroke paths from the direction field. Finally, pencil strokes are rendered along the specified paths with consideration of image tone and artificial illumination.As an important application, the technique is applied to render portraits from images with little user interaction. The experimental results demonstrate that the approach can automatically achieve compelling pencil sketches from reference images.

  13. Automatic magnetic resonance spinal cord segmentation with topology constraints for variable fields of view.

    Science.gov (United States)

    Chen, Min; Carass, Aaron; Oh, Jiwon; Nair, Govind; Pham, Dzung L; Reich, Daniel S; Prince, Jerry L

    2013-12-01

    Spinal cord segmentation is an important step in the analysis of neurological diseases such as multiple sclerosis. Several studies have shown correlations between disease progression and metrics relating to spinal cord atrophy and shape changes. Current practices primarily involve segmenting the spinal cord manually or semi-automatically, which can be inconsistent and time-consuming for large datasets. An automatic method that segments the spinal cord and cerebrospinal fluid from magnetic resonance images is presented. The method uses a deformable atlas and topology constraints to produce results that are robust to noise and artifacts. The method is designed to be easily extended to new data with different modalities, resolutions, and fields of view. Validation was performed on two distinct datasets. The first consists of magnetization transfer-prepared T2*-weighted gradient-echo MRI centered only on the cervical vertebrae (C1-C5). The second consists of T1-weighted MRI that covers both the cervical and portions of the thoracic vertebrae (C1-T4). Results were found to be highly accurate in comparison to manual segmentations. A pilot study was carried out to demonstrate the potential utility of this new method for research and clinical studies of multiple sclerosis.

  14. Liver segmentation in MRI: A fully automatic method based on stochastic partitions.

    Science.gov (United States)

    López-Mir, F; Naranjo, V; Angulo, J; Alcañiz, M; Luna, L

    2014-04-01

    There are few fully automated methods for liver segmentation in magnetic resonance images (MRI) despite the benefits of this type of acquisition in comparison to other radiology techniques such as computed tomography (CT). Motivated by medical requirements, liver segmentation in MRI has been carried out. For this purpose, we present a new method for liver segmentation based on the watershed transform and stochastic partitions. The classical watershed over-segmentation is reduced using a marker-controlled algorithm. To improve accuracy of selected contours, the gradient of the original image is successfully enhanced by applying a new variant of stochastic watershed. Moreover, a final classifier is performed in order to obtain the final liver mask. Optimal parameters of the method are tuned using a training dataset and then they are applied to the rest of studies (17 datasets). The obtained results (a Jaccard coefficient of 0.91 ± 0.02) in comparison to other methods demonstrate that the new variant of stochastic watershed is a robust tool for automatic segmentation of the liver in MRI.

  15. An Automatic Optic Disk Detection and Segmentation System using Multi-level Thresholding

    Directory of Open Access Journals (Sweden)

    KARASULU, B.

    2014-05-01

    Full Text Available Optic disk (OD boundary localization is a substantial problem in ophthalmic image processing research area. In order to segment the region of OD, we developed an automatic system which involves a multi-level thresholding. The OD segmentation results of the system in terms of average precision, recall and accuracy for DRIVE database are 98.88%, 99.91%, 98.83%, for STARE database are 98.62%, 97.38%, 96.11%, and for DIARETDB1 database are 99.29%, 99.90%, 99.20%, respectively. The experimental results show that our system works properly on retinal image databases with diseased retinas, diabetic signs, and a large degree of quality variability.

  16. Laplacian forests: semantic image segmentation by guided bagging.

    Science.gov (United States)

    Lombaert, Herve; Zikic, Darko; Criminisi, Antonio; Ayache, Nicholas

    2014-01-01

    This paper presents a new, efficient and accurate technique for the semantic segmentation of medical images. The paper builds upon the successful random decision forests model and improves on it by modifying the way in which randomness is injected into the tree training process. The contribution of this paper is two-fold. First, we replace the conventional bagging procedure (the uniform sampling of training images) with a guided bagging approach, which exploits the inherent structure and organization of the training image set. This allows the creation of decision trees that are specialized to a specific sub-type of images in the training set. Second, the segmentation of a previously unseen image happens via selection and application of only the trees that are relevant to the given test image. Tree selection is done automatically, via the learned image embedding, with more precisely a Laplacian eigenmap. We, therefore, call the proposed approach Laplacian Forests. We validate Laplacian Forests on a dataset of 256, manually segmented 3D CT scans of patients showing high variability in scanning protocols, resolution, body shape and anomalies. Compared with conventional decision forests, Laplacian Forests yield both higher training efficiency, due to the local analysis of the training image space, as well as higher segmentation accuracy, due to the specialization of the forest to image sub-types.

  17. Iris image Segmentation Based on Phase Congruency

    Institute of Scientific and Technical Information of China (English)

    GAO Chao; JIANG Da-qin; Guo Yong-cai

    2006-01-01

    @@ Iris image segmentation is very important for an iris recognition system.There are always iris noises as eyelash,eyelid,reflection and pupil in iris images.The paper proposes a virtual method of segmentation.By locating and normalizing iris images with Gabor filter,we can acquire information of image texture in a series of frequencies and orientations.Iris noise regions are determined based on phase congruency by a group of Gabor filters whose kernels are suitable for edge detection.These regions are filled according to the characteristics of iris noise.The experimental results show that the proposed method can segment iris images effectively.

  18. Iris image segmentation based on phase congruency

    Science.gov (United States)

    Gao, Chao; Jiang, Da-Qin; Guo, Yong-Cai

    2006-09-01

    Iris image segmentation is very important for an iris recognition system. There are always iris noises as eyelash, eyelid, reflection and pupil in iris images. The paper proposes a virtual method of segmentation. By locating and normalizing iris images with Gabor filter, we can acquire information of image texture in a series of frequencies and orientations. Iris noise regions are determined based on phase congruency by a group of Gabor filters whose kernels are suitable for edge detection. These regions are filled according to the characteristics of iris noise. The experimental results show that the proposed method can segment iris images effectively.

  19. Probabilistic segmentation of remotely sensed images.

    NARCIS (Netherlands)

    Gorte, B.

    1998-01-01

    For information extraction from image data to create or update geographic information systems, objects are identified and labeled using an integration of segmentation and classification. This yields geometric and thematic information, respectively.Bayesian image classifiers calculate class posterior

  20. Multispectral image segmentation of breast pathology

    Science.gov (United States)

    Hornak, Joseph P.; Blaakman, Andre; Rubens, Deborah; Totterman, Saara

    1991-06-01

    The signal intensity in a magnetic resonance image is not only a function of imaging parameters but also of several intrinsic tissue properties. Therefore, unlike other medical imaging modalities, magnetic resonance imaging (MRI) allows the imaging scientist to locate pathology using multispectral image segmentation. Multispectral image segmentation works best when orthogonal spectral regions are employed. In MRI, possible spectral regions are spin density (rho) , spin-lattice relaxation time T1, spin-spin relaxation time T2, and texture for each nucleus type and chemical shift. This study examines the ability of multispectral image segmentation to locate breast pathology using the total hydrogen T1, T2, and (rho) . The preliminary results indicate that our technique can locate cysts and fibroadenoma breast lesions with a minimum number of false-positives and false-negatives. Results, T1, T2, and (rho) algorithms, and segmentation techniques are presented.

  1. Cluster Ensemble-based Image Segmentation

    OpenAIRE

    Xiaoru Wang; Junping Du; Shuzhe Wu; Xu Li; Fu Li

    2013-01-01

    Image segmentation is the foundation of computer vision applications. In this paper, we propose a new cluster ensemble-based image segmentation algorithm, which overcomes several problems of traditional methods. We make two main contributions in this paper. First, we introduce the cluster ensemble concept to fuse the segmentation results from different types of visual features effectively, which can deliver a better final result and achieve a much more stable performance for broad categories ...

  2. Image segmentation with a finite element method

    DEFF Research Database (Denmark)

    Bourdin, Blaise

    1999-01-01

    The Mumford-Shah functional for image segmentation is an original approach of the image segmentation problem, based on a minimal energy criterion. Its minimization can be seen as a free discontinuity problem and is based on \\Gamma-convergence and bounded variation functions theories.Some new regu...

  3. Automatic Measurement of Central Cornea Thickness of Eye Anterior Segment Optical Coherence Tomography Image%眼前节光学相干层析图像中央角膜厚度自动测量

    Institute of Scientific and Technical Information of China (English)

    舒鹏; 孙延奎; 田小林

    2012-01-01

    为了自动获取所需医学参数,辅助医生诊断,提出了一种基于边缘检测和随机抽样一致性的中央角膜厚度自动测量方法.采用边缘检测算子获得眼前节组织光学相干层析图像中的初始边缘,然后利用随机抽样一致性算法对初始中央角膜上边缘进行圆弧拟合,进一步提取中央角膜下边缘并采用相同方法进行圆弧拟合,根据得到的中央角膜上下边缘计算中央角膜厚度.实验结果表明,该算法能排除图像中时常出现的中央亮线干扰,实时而准确地提取中央角膜上下边缘,得到的中央角膜厚度计算结果与人工分析基本一致,具有良好的应用价值和商业前景.%To obtain quantitative parameters automatically and help medical diagnosis, automatic measurement of central cornea thickness based on edge detection and random sample consensus (RANSAC) is employed. The initial edge in the eye anterior segment optical coherence tomography (OCT) image is obtained with an edge detector. Upper and lower edges of the central cornea are extraxted using the RANSAC circle fitting method. The central cornea thickness is then computed based on the edges. Experiments show that the proposed method can avoid the effect of light beam crossing, and good results comparable to manual analysis can be obtained in real time, indicating that the method has potential applications in the future.

  4. SEGMA: An Automatic SEGMentation Approach for Human Brain MRI Using Sliding Window and Random Forests

    Science.gov (United States)

    Serag, Ahmed; Wilkinson, Alastair G.; Telford, Emma J.; Pataky, Rozalia; Sparrow, Sarah A.; Anblagan, Devasuda; Macnaught, Gillian; Semple, Scott I.; Boardman, James P.

    2017-01-01

    Quantitative volumes from brain magnetic resonance imaging (MRI) acquired across the life course may be useful for investigating long term effects of risk and resilience factors for brain development and healthy aging, and for understanding early life determinants of adult brain structure. Therefore, there is an increasing need for automated segmentation tools that can be applied to images acquired at different life stages. We developed an automatic segmentation method for human brain MRI, where a sliding window approach and a multi-class random forest classifier were applied to high-dimensional feature vectors for accurate segmentation. The method performed well on brain MRI data acquired from 179 individuals, analyzed in three age groups: newborns (38–42 weeks gestational age), children and adolescents (4–17 years) and adults (35–71 years). As the method can learn from partially labeled datasets, it can be used to segment large-scale datasets efficiently. It could also be applied to different populations and imaging modalities across the life course. PMID:28163680

  5. A dendritic lattice neural network for color image segmentation

    Science.gov (United States)

    Urcid, Gonzalo; Lara-Rodríguez, Luis David; López-Meléndez, Elizabeth

    2015-09-01

    A two-layer dendritic lattice neural network is proposed to segment color images in the Red-Green-Blue (RGB) color space. The two layer neural network is a fully interconnected feed forward net consisting of an input layer that receives color pixel values, an intermediate layer that computes pixel interdistances, and an output layer used to classify colors by hetero-association. The two-layer net is first initialized with a finite small subset of the colors present in the input image. These colors are obtained by means of an automatic clustering procedure such as k-means or fuzzy c-means. In the second stage, the color image is scanned on a pixel by pixel basis where each picture element is treated as a vector and feeded into the network. For illustration purposes we use public domain color images to show the performance of our proposed image segmentation technique.

  6. Automatic calculation of tree diameter from stereoscopic image pairs using digital image processing.

    Science.gov (United States)

    Yi, Faliu; Moon, Inkyu

    2012-06-20

    Automatic operations play an important role in societies by saving time and improving efficiency. In this paper, we apply the digital image processing method to the field of lumbering to automatically calculate tree diameters in order to reduce culler work and enable a third party to verify tree diameters. To calculate the cross-sectional diameter of a tree, the image was first segmented by the marker-controlled watershed transform algorithm based on the hue saturation intensity (HSI) color model. Then, the tree diameter was obtained by measuring the area of every isolated region in the segmented image. Finally, the true diameter was calculated by multiplying the diameter computed in the image and the scale, which was derived from the baseline and disparity of correspondence points from stereoscopic image pairs captured by rectified configuration cameras.

  7. Gravel Image Segmentation in Noisy Background Based on Partial Entropy Method

    Institute of Scientific and Technical Information of China (English)

    2000-01-01

    Because of wide variation in gray levels and particle dimensions and the presence of many small gravel objects in the background, as well as corrupting the image by noise, it is difficult o segment gravel objects. In this paper, we develop a partial entropy method and succeed to realize gravel objects segmentation. We give entropy principles and fur calculation methods. Moreover, we use minimum entropy error automaticly to select a threshold to segment image. We introduce the filter method using mathematical morphology. The segment experiments are performed by using different window dimensions for a group of gravel image and demonstrates that this method has high segmentation rate and low noise sensitivity.

  8. SU-E-J-129: Atlas Development for Cardiac Automatic Contouring Using Multi-Atlas Segmentation

    Energy Technology Data Exchange (ETDEWEB)

    Zhou, R; Yang, J; Pan, T; Milgrom, S; Pinnix, C; Shi, A; Yang, J; Liu, Y; Nguyen, Q; Gomez, D; Dabaja, B; Balter, P; Court, L; Liao, Z [MD Anderson Cancer Center, Houston, TX (United States)

    2015-06-15

    Purpose: To develop a set of atlases for automatic contouring of cardiac structures to determine heart radiation dose and the associated toxicity. Methods: Six thoracic cancer patients with both contrast and non-contrast CT images were acquired for this study. Eight radiation oncologists manually and independently delineated cardiac contours on the non-contrast CT by referring to the fused contrast CT and following the RTOG 1106 atlas contouring guideline. Fifteen regions of interest (ROIs) were delineated, including heart, four chambers, four coronary arteries, pulmonary artery and vein, inferior and superior vena cava, and ascending and descending aorta. Individual expert contours were fused using the simultaneous truth and performance level estimation (STAPLE) algorithm for each ROI and each patient. The fused contours became atlases for an in-house multi-atlas segmentation. Using leave-one-out test, we generated auto-segmented contours for each ROI and each patient. The auto-segmented contours were compared with the fused contours using the Dice similarity coefficient (DSC) and the mean surface distance (MSD). Results: Inter-observer variability was not obvious for heart, chambers, and aorta but was large for other structures that were not clearly distinguishable on CT image. The average DSC between individual expert contours and the fused contours were less than 50% for coronary arteries and pulmonary vein, and the average MSD were greater than 4.0 mm. The largest MSD of expert contours deviating from the fused contours was 2.5 cm. The mean DSC and MSD of auto-segmented contours were within one standard deviation of expert contouring variability except the right coronary artery. The coronary arteries, vena cava, and pulmonary vein had DSC<70% and MSD>3.0 mm. Conclusion: A set of cardiac atlases was created for cardiac automatic contouring, the accuracy of which was comparable to the variability in expert contouring. However, substantial modification may need

  9. AN IMPROVED FUZZY CLUSTERING ALGORITHM FOR MICROARRAY IMAGE SPOTS SEGMENTATION

    Directory of Open Access Journals (Sweden)

    V.G. Biju

    2015-11-01

    Full Text Available An automatic cDNA microarray image processing using an improved fuzzy clustering algorithm is presented in this paper. The spot segmentation algorithm proposed uses the gridding technique developed by the authors earlier, for finding the co-ordinates of each spot in an image. Automatic cropping of spots from microarray image is done using these co-ordinates. The present paper proposes an improved fuzzy clustering algorithm Possibility fuzzy local information c means (PFLICM to segment the spot foreground (FG from background (BG. The PFLICM improves fuzzy local information c means (FLICM algorithm by incorporating typicality of a pixel along with gray level information and local spatial information. The performance of the algorithm is validated using a set of simulated cDNA microarray images added with different levels of AWGN noise. The strength of the algorithm is tested by computing the parameters such as the Segmentation matching factor (SMF, Probability of error (pe, Discrepancy distance (D and Normal mean square error (NMSE. SMF value obtained for PFLICM algorithm shows an improvement of 0.9 % and 0.7 % for high noise and low noise microarray images respectively compared to FLICM algorithm. The PFLICM algorithm is also applied on real microarray images and gene expression values are computed.

  10. Evaluation of hippocampal volume based on MRI applying manual and automatic segmentation techniques

    Energy Technology Data Exchange (ETDEWEB)

    Doring, Thomas M.; Gasparetto, Emerson L. [Universidade Federal do Rio de Janeiro (UFRJ), RJ (Brazil); Kubo, Tadeu T.A.; Domingues, Romeu C. [Clinica de Diagnostico por Imagem (CDPI), Rio de Janeiro, RJ (Brazil)

    2010-03-15

    Various segmentation techniques using MR sequences, including manual and automatic protocols, have been developed to optimize the determination of the hippocampal volume. For clinical application, automated methods with high reproducibility and accuracy potentially may be more efficient than manual volumetry. This study aims to compare the hippocampal volumes obtained from manual and automatic segmentation methods (FreeSurfer and FSL). The automatic segmentation method FreeSurfer showed high correlation. Comparing the absolute hippocampal volumes, there is an overestimation by the automated methods. Applying a correction factor to the automatic method, it may be an alternative for the estimation of the absolute hippocampal volume. (author)

  11. Automatic extraction of planetary image features

    Science.gov (United States)

    LeMoigne-Stewart, Jacqueline J. (Inventor); Troglio, Giulia (Inventor); Benediktsson, Jon A. (Inventor); Serpico, Sebastiano B. (Inventor); Moser, Gabriele (Inventor)

    2013-01-01

    A method for the extraction of Lunar data and/or planetary features is provided. The feature extraction method can include one or more image processing techniques, including, but not limited to, a watershed segmentation and/or the generalized Hough Transform. According to some embodiments, the feature extraction method can include extracting features, such as, small rocks. According to some embodiments, small rocks can be extracted by applying a watershed segmentation algorithm to the Canny gradient. According to some embodiments, applying a watershed segmentation algorithm to the Canny gradient can allow regions that appear as close contours in the gradient to be segmented.

  12. Unsupervised Color-texture Image Segmentation

    Institute of Scientific and Technical Information of China (English)

    YU Sheng-yang; ZHANG Fan; WANG Yong-gang; YANG Jie

    2008-01-01

    The measure J in J value segmentation (JSEG) falls to represent the discontinuity of color, which degrades the robustness and discrimination of JSEG. An improved approach for JSEG algorithm was proposed for unsupervised color-texture image segmentation. The texture and photometric invariant edge information were combined, which results in a discriminative measure for color-texture homogeneity. Based on the image whose pixel values are values of the new measure, region growing-merging algorithm used in JSEG was then employed to segment the image. Finally, experiments on a variety of real color images demonstrate performance improvement due to the proposed method.

  13. Adaptive textural segmentation of medical images

    Science.gov (United States)

    Kuklinski, Walter S.; Frost, Gordon S.; MacLaughlin, Thomas

    1992-06-01

    A number of important problems in medical imaging can be described as segmentation problems. Previous fractal-based image segmentation algorithms have used either the local fractal dimension alone or the local fractal dimension and the corresponding image intensity as features for subsequent pattern recognition algorithms. An image segmentation algorithm that utilized the local fractal dimension, image intensity, and the correlation coefficient of the local fractal dimension regression analysis computation, to produce a three-dimension feature space that was partitioned to identify specific pixels of dental radiographs as being either bone, teeth, or a boundary between bone and teeth also has been reported. In this work we formulated the segmentation process as a configurational optimization problem and discuss the application of simulated annealing optimization methods to the solution of this specific optimization problem. The configurational optimization method allows information about both, the degree of correspondence between a candidate segment and an assumed textural model, and morphological information about the candidate segment to be used in the segmentation process. To apply this configurational optimization technique with a fractal textural model however, requires the estimation of the fractal dimension of an irregularly shaped candidate segment. The potential utility of a discrete Gerchberg-Papoulis bandlimited extrapolation algorithm to the estimation of the fractal dimension of an irregularly shaped candidate segment is also discussed.

  14. Fully automatic GBM segmentation in the TCGA-GBM dataset: Prognosis and correlation with VASARI features.

    Science.gov (United States)

    Rios Velazquez, Emmanuel; Meier, Raphael; Dunn, William D; Alexander, Brian; Wiest, Roland; Bauer, Stefan; Gutman, David A; Reyes, Mauricio; Aerts, Hugo J W L

    2015-11-18

    Reproducible definition and quantification of imaging biomarkers is essential. We evaluated a fully automatic MR-based segmentation method by comparing it to manually defined sub-volumes by experienced radiologists in the TCGA-GBM dataset, in terms of sub-volume prognosis and association with VASARI features. MRI sets of 109 GBM patients were downloaded from the Cancer Imaging archive. GBM sub-compartments were defined manually and automatically using the Brain Tumor Image Analysis (BraTumIA). Spearman's correlation was used to evaluate the agreement with VASARI features. Prognostic significance was assessed using the C-index. Auto-segmented sub-volumes showed moderate to high agreement with manually delineated volumes (range (r): 0.4 - 0.86). Also, the auto and manual volumes showed similar correlation with VASARI features (auto r = 0.35, 0.43 and 0.36; manual r = 0.17, 0.67, 0.41, for contrast-enhancing, necrosis and edema, respectively). The auto-segmented contrast-enhancing volume and post-contrast abnormal volume showed the highest AUC (0.66, CI: 0.55-0.77 and 0.65, CI: 0.54-0.76), comparable to manually defined volumes (0.64, CI: 0.53-0.75 and 0.63, CI: 0.52-0.74, respectively). BraTumIA and manual tumor sub-compartments showed comparable performance in terms of prognosis and correlation with VASARI features. This method can enable more reproducible definition and quantification of imaging based biomarkers and has potential in high-throughput medical imaging research.

  15. BgCut: Automatic Ship Detection from UAV Images

    Directory of Open Access Journals (Sweden)

    Chao Xu

    2014-01-01

    foreground objects from sea automatically. First, a sea template library including images in different natural conditions is built to provide an initial template to the model. Then the background trimap is obtained by combing some templates matching with region growing algorithm. The output trimap initializes Grabcut background instead of manual intervention and the process of segmentation without iteration. The effectiveness of our proposed model is demonstrated by extensive experiments on a certain area of real UAV aerial images by an airborne Canon 5D Mark. The proposed algorithm is not only adaptive but also with good segmentation. Furthermore, the model in this paper can be well applied in the automated processing of industrial images for related researches.

  16. Automatic evaluation of nickel alloy secondary phases from SEM images.

    Science.gov (United States)

    de Albuquerque, Victor Hugo C; Silva, Cleiton Carvalho; Menezes, Thiago Ivo de S; Farias, Jesualdo Pereira; Tavares, João Manuel R S

    2011-01-01

    Quantitative metallography is a technique to determine and correlate the microstructures of materials with their properties and behavior. Generic commercial image processing and analysis software packages have been used to quantify material phases from metallographic images. However, these all-purpose solutions also have some drawbacks, particularly when applied to segmentation of material phases. To overcome such limitations, this work presents a new solution to automatically segment and quantify material phases from SEM metallographic images. The solution is based on a neuronal network and in this work was used to identify the secondary phase precipitated in the gamma matrix of a Nickel base alloy. The results obtained by the new solution were validated by visual inspection and compared with the ones obtained by a commonly used commercial software. The conclusion is that the new solution is precise, reliable and more accurate and faster than the commercial software.

  17. An efficient algorithm for color image segmentation

    Directory of Open Access Journals (Sweden)

    Shikha Yadav

    2016-09-01

    Full Text Available In field of image processing, image segmentation plays an important role that focus on splitting the whole image into segments. Representation of an image so that it can be more easily analysed and involves more information is an important segmentation goal. The process of partitioning an image can be usually realized by Region based, Boundary based or edge based method. In this work a hybrid approach is followed that combines improved bee colony optimization and Tabu search for color image segmentation. The results produced from this hybrid approach are compared with non-sorted particle swarm optimization, non-sorted genetic algorithm and improved bee colony optimization. Results show that the Hybrid algorithm has better or somewhat similar performance as compared to other algorithms that are based on population. The algorithm is successfully implemented on MATLAB.

  18. SAR Image Segmentation using Vector Quantization Technique on Entropy Images

    CERN Document Server

    Kekre, H B; Sarode, Tanuja K

    2010-01-01

    The development and application of various remote sensing platforms result in the production of huge amounts of satellite image data. Therefore, there is an increasing need for effective querying and browsing in these image databases. In order to take advantage and make good use of satellite images data, we must be able to extract meaningful information from the imagery. Hence we proposed a new algorithm for SAR image segmentation. In this paper we propose segmentation using vector quantization technique on entropy image. Initially, we obtain entropy image and in second step we use Kekre's Fast Codebook Generation (KFCG) algorithm for segmentation of the entropy image. Thereafter, a codebook of size 128 was generated for the Entropy image. These code vectors were further clustered in 8 clusters using same KFCG algorithm and converted into 8 images. These 8 images were displayed as a result. This approach does not lead to over segmentation or under segmentation. We compared these results with well known Gray L...

  19. Probabilistic multiscale image segmentation by the hyperstack

    NARCIS (Netherlands)

    Vincken, Koenraad Lucas

    2001-01-01

    In the medical community, images from different modalities have found their way to a variety of medical disciplines. Multidimensional images have become indispensable in clinical diagnosis, therapy planning and evaluation. Image segmentation -- dividing an image into meaningful objects -- is a s

  20. Improving image segmentation by learning region affinities

    Energy Technology Data Exchange (ETDEWEB)

    Prasad, Lakshman [Los Alamos National Laboratory; Yang, Xingwei [TEMPLE UNIV.; Latecki, Longin J [TEMPLE UNIV.

    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.

  1. A HYBRID METHOD FOR AUTOMATIC COUNTING OF MICROORGANISMS IN MICROSCOPIC IMAGES

    OpenAIRE

    2016-01-01

    Microscopic image analysis is an essential process to enable the automatic enumeration and quantitative analysis of microbial images. There are several system are available for numerating microbial growth. Some of the existing method may be inefficient to accurately count the overlapped microorganisms. Therefore, in this paper we proposed an efficient method for automatic segmentation and counting of microorganisms in microscopic images. This method uses a hybrid approach based on...

  2. Automatic Hierarchical Color Image Classification

    Directory of Open Access Journals (Sweden)

    Jing Huang

    2003-02-01

    Full Text Available Organizing images into semantic categories can be extremely useful for content-based image retrieval and image annotation. Grouping images into semantic classes is a difficult problem, however. Image classification attempts to solve this hard problem by using low-level image features. In this paper, we propose a method for hierarchical classification of images via supervised learning. This scheme relies on using a good low-level feature and subsequently performing feature-space reconfiguration using singular value decomposition to reduce noise and dimensionality. We use the training data to obtain a hierarchical classification tree that can be used to categorize new images. Our experimental results suggest that this scheme not only performs better than standard nearest-neighbor techniques, but also has both storage and computational advantages.

  3. CONSTRAINED SPECTRAL CLUSTERING FOR IMAGE SEGMENTATION

    OpenAIRE

    Sourati, Jamshid; Brooks, Dana H.; Dy, Jennifer G.; Erdogmus, Deniz

    2012-01-01

    Constrained spectral clustering with affinity propagation in its original form is not practical for large scale problems like image segmentation. In this paper we employ novelty selection sub-sampling strategy, besides using efficient numerical eigen-decomposition methods to make this algorithm work efficiently for images. In addition, entropy-based active learning is also employed to select the queries posed to the user more wisely in an interactive image segmentation framework. We evaluate ...

  4. BW Trained HMM based Aerial Image Segmentation

    OpenAIRE

    R Rajasree; J. Nalini; S C Ramesh

    2011-01-01

    Image segmentation is an essential preprocessing tread in a complicated and composite image dealing out algorithm. In segmenting arial image the expenditure of misclassification could depend on the factual group of pupils. In this paper, aggravated by modern advances in contraption erudition conjecture, I introduce a modus operandi to make light of the misclassification expenditure with class-dependent expenditure. The procedure assumes the hidden Markov model (HMM) which has been popularly u...

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

    Science.gov (United States)

    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.

  6. Interactive segmentation for geographic atrophy in retinal fundus images.

    Science.gov (United States)

    Lee, Noah; Smith, R Theodore; Laine, Andrew F

    2008-10-01

    Fundus auto-fluorescence (FAF) imaging is a non-invasive technique for in vivo ophthalmoscopic inspection of age-related macular degeneration (AMD), the most common cause of blindness in developed countries. Geographic atrophy (GA) is an advanced form of AMD and accounts for 12-21% of severe visual loss in this disorder [3]. Automatic quantification of GA is important for determining disease progression and facilitating clinical diagnosis of AMD. The problem of automatic segmentation of pathological images still remains an unsolved problem. In this paper we leverage the watershed transform and generalized non-linear gradient operators for interactive segmentation and present an intuitive and simple approach for geographic atrophy segmentation. We compare our approach with the state of the art random walker [5] algorithm for interactive segmentation using ROC statistics. Quantitative evaluation experiments on 100 FAF images show a mean sensitivity/specificity of 98.3/97.7% for our approach and a mean sensitivity/specificity of 88.2/96.6% for the random walker algorithm.

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

    Science.gov (United States)

    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.

  8. Regression Segmentation for M³ Spinal Images.

    Science.gov (United States)

    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.

  9. Automatic segmentation of odor maps in the mouse olfactory bulb using regularized non-negative matrix factorization.

    Science.gov (United States)

    Soelter, Jan; Schumacher, Jan; Spors, Hartwig; Schmuker, Michael

    2014-09-01

    Segmentation of functional parts in image series of functional activity is a common problem in neuroscience. Here we apply regularized non-negative matrix factorization (rNMF) to extract glomeruli in intrinsic optical signal (IOS) images of the olfactory bulb. Regularization allows us to incorporate prior knowledge about the spatio-temporal characteristics of glomerular signals. We demonstrate how to identify suitable regularization parameters on a surrogate dataset. With appropriate regularization segmentation by rNMF is more resilient to noise and requires fewer observations than conventional spatial independent component analysis (sICA). We validate our approach in experimental data using anatomical outlines of glomeruli obtained by 2-photon imaging of resting synapto-pHluorin fluorescence. Taken together, we show that rNMF provides a straightforward method for problem tailored source separation that enables reliable automatic segmentation of functional neural images, with particular benefit in situations with low signal-to-noise ratio as in IOS imaging.

  10. AUTOMATIC RETINA EXUDATES SEGMENTATION WITHOUT A MANUALLY LABELLED TRAINING SET

    Energy Technology Data Exchange (ETDEWEB)

    Giancardo, Luca [ORNL; Meriaudeau, Fabrice [ORNL; Karnowski, Thomas Paul [ORNL; Li, Yaquin [University of Tennessee, Knoxville (UTK); Tobin Jr, Kenneth William [ORNL; Chaum, Edward [University of Tennessee, Knoxville (UTK)

    2011-01-01

    Diabetic macular edema (DME) is a common vision threatening complication of diabetic retinopathy which can be assessed by detecting exudates (a type of bright lesion) in fundus images. In this work, two new methods for the detection of exudates are presented which do not use a supervised learning step and therefore do not require ground-truthed lesion training sets which are time consuming to create, difficult to obtain, and prone to human error. We introduce a new dataset of fundus images from various ethnic groups and levels of DME which we have made publicly available. We evaluate our algorithm with this dataset and compare our results with two recent exudate segmentation algorithms. In all of our tests, our algorithms perform better or comparable with an order of magnitude reduction in computational time.

  11. Automatic segmentation of meningioma from non-contrasted brain MRI integrating fuzzy clustering and region growing

    Directory of Open Access Journals (Sweden)

    Liao Chun-Chih

    2011-08-01

    Full Text Available Abstract Background In recent years, magnetic resonance imaging (MRI has become important in brain tumor diagnosis. Using this modality, physicians can locate specific pathologies by analyzing differences in tissue character presented in different types of MR images. This paper uses an algorithm integrating fuzzy-c-mean (FCM and region growing techniques for automated tumor image segmentation from patients with menigioma. Only non-contrasted T1 and T2 -weighted MR images are included in the analysis. The study's aims are to correctly locate tumors in the images, and to detect those situated in the midline position of the brain. Methods The study used non-contrasted T1- and T2-weighted MR images from 29 patients with menigioma. After FCM clustering, 32 groups of images from each patient group were put through the region-growing procedure for pixels aggregation. Later, using knowledge-based information, the system selected tumor-containing images from these groups and merged them into one tumor image. An alternative semi-supervised method was added at this stage for comparison with the automatic method. Finally, the tumor image was optimized by a morphology operator. Results from automatic segmentation were compared to the "ground truth" (GT on a pixel level. Overall data were then evaluated using a quantified system. Results The quantified parameters, including the "percent match" (PM and "correlation ratio" (CR, suggested a high match between GT and the present study's system, as well as a fair level of correspondence. The results were compatible with those from other related studies. The system successfully detected all of the tumors situated at the midline of brain. Six cases failed in the automatic group. One also failed in the semi-supervised alternative. The remaining five cases presented noticeable edema inside the brain. In the 23 successful cases, the PM and CR values in the two groups were highly related. Conclusions Results indicated

  12. Segmentation of left atrial intracardiac ultrasound images for image guided cardiac ablation therapy

    Science.gov (United States)

    Rettmann, M. E.; Stephens, T.; Holmes, D. R.; Linte, C.; Packer, D. L.; Robb, R. A.

    2013-03-01

    Intracardiac echocardiography (ICE), a technique in which structures of the heart are imaged using a catheter navigated inside the cardiac chambers, is an important imaging technique for guidance in cardiac ablation therapy. Automatic segmentation of these images is valuable for guidance and targeting of treatment sites. In this paper, we describe an approach to segment ICE images by generating an empirical model of blood pool and tissue intensities. Normal, Weibull, Gamma, and Generalized Extreme Value (GEV) distributions are fit to histograms of tissue and blood pool pixels from a series of ICE scans. A total of 40 images from 4 separate studies were evaluated. The model was trained and tested using two approaches. In the first approach, the model was trained on all images from 3 studies and subsequently tested on the 40 images from the 4th study. This procedure was repeated 4 times using a leave-one-out strategy. This is termed the between-subjects approach. In the second approach, the model was trained on 10 randomly selected images from a single study and tested on the remaining 30 images in that study. This is termed the within-subjects approach. For both approaches, the model was used to automatically segment ICE images into blood and tissue regions. Each pixel is classified using the Generalized Liklihood Ratio Test across neighborhood sizes ranging from 1 to 49. Automatic segmentation results were compared against manual segmentations for all images. In the between-subjects approach, the GEV distribution using a neighborhood size of 17 was found to be the most accurate with a misclassification rate of approximately 17%. In the within-subjects approach, the GEV distribution using a neighborhood size of 19 was found to be the most accurate with a misclassification rate of approximately 15%. As expected, the majority of misclassified pixels were located near the boundaries between tissue and blood pool regions for both methods.

  13. Segmentation-based CT image compression

    Science.gov (United States)

    Thammineni, Arunoday; Mukhopadhyay, Sudipta; Kamath, Vidya

    2004-04-01

    The existing image compression standards like JPEG and JPEG 2000, compress the whole image as a single frame. This makes the system simple but inefficient. The problem is acute for applications where lossless compression is mandatory viz. medical image compression. If the spatial characteristics of the image are considered, it can give rise to a more efficient coding scheme. For example, CT reconstructed images have uniform background outside the field of view (FOV). Even the portion within the FOV can be divided as anatomically relevant and irrelevant parts. They have distinctly different statistics. Hence coding them separately will result in more efficient compression. Segmentation is done based on thresholding and shape information is stored using 8-connected differential chain code. Simple 1-D DPCM is used as the prediction scheme. The experiments show that the 1st order entropies of images fall by more than 11% when each segment is coded separately. For simplicity and speed of decoding Huffman code is chosen for entropy coding. Segment based coding will have an overhead of one table per segment but the overhead is minimal. Lossless compression of image based on segmentation resulted in reduction of bit rate by 7%-9% compared to lossless compression of whole image as a single frame by the same prediction coder. Segmentation based scheme also has the advantage of natural ROI based progressive decoding. If it is allowed to delete the diagnostically irrelevant portions, the bit budget can go down as much as 40%. This concept can be extended to other modalities.

  14. User Interaction in Semi-Automatic Segmentation of Organs at Risk: a Case Study in Radiotherapy

    NARCIS (Netherlands)

    A. Ramkumar (Anjana); J. Dolz (Jose); H.A. Kirisli (Hortense); S. Adebahr (Sonja); T. Schimek-Jasch (Tanja); U. Nestle (Ursula); L. Massoptier (Laurent); E. Varga (Edit); P.J. Stappers (P.); W.J. Niessen (Wiro); Y. Song (Yu)

    2016-01-01

    textabstractAccurate segmentation of organs at risk is an important step in radiotherapy planning. Manual segmentation being a tedious procedure and prone to inter- and intra-observer variability, there is a growing interest in automated segmentation methods. However, automatic methods frequently fa

  15. User Interaction in Semi-Automatic Segmentation of Organs at Risk: a Case Study in Radiotherapy

    NARCIS (Netherlands)

    Ramkumar, A.; Dolz, J.; Kirisli, H.A.; Adebahr, S.; Schimek-Jasch, T.; Nestle, U.; Massoptier, L.; Varga, E.; Stappers, P.J.; Niessen, W.J.; Song, Y.

    2015-01-01

    Accurate segmentation of organs at risk is an important step in radiotherapy planning. Manual segmentation being a tedious procedure and prone to inter- and intra-observer variability, there is a growing interest in automated segmentation methods. However, automatic methods frequently fail to provid

  16. Computer Based Melanocytic and Nevus Image Enhancement and Segmentation

    Science.gov (United States)

    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.

  17. Scale selection for supervised image segmentation

    DEFF Research Database (Denmark)

    Li, Yan; Tax, David M J; Loog, Marco

    2012-01-01

    Finding the right scales for feature extraction is crucial for supervised image segmentation based on pixel classification. There are many scale selection methods in the literature; among them the one proposed by Lindeberg is widely used for image structures such as blobs, edges and ridges. Those...... schemes are usually unsupervised, as they do not take into account the actual segmentation problem at hand. In this paper, we consider the problem of selecting scales, which aims at an optimal discrimination between user-defined classes in the segmentation. We show the deficiency of the classical...... our approach back to Lindeberg's original proposal. In the experiments, the max rule is applied to artificial and real-world image segmentation tasks, which is shown to choose the right scales for different problems and lead to better segmentation results. © 2012 Elsevier B.V....

  18. Image segmentation by EM-based adaptive pulse coupled neural networks in brain magnetic resonance imaging.

    Science.gov (United States)

    Fu, J C; Chen, C C; Chai, J W; Wong, S T C; Li, I C

    2010-06-01

    We propose an automatic hybrid image segmentation model that integrates the statistical expectation maximization (EM) model and the spatial pulse coupled neural network (PCNN) for brain magnetic resonance imaging (MRI) segmentation. In addition, an adaptive mechanism is developed to fine tune the PCNN parameters. The EM model serves two functions: evaluation of the PCNN image segmentation and adaptive adjustment of the PCNN parameters for optimal segmentation. To evaluate the performance of the adaptive EM-PCNN, we use it to segment MR brain image into gray matter (GM), white matter (WM) and cerebrospinal fluid (CSF). The performance of the adaptive EM-PCNN is compared with that of the non-adaptive EM-PCNN, EM, and Bias Corrected Fuzzy C-Means (BCFCM) algorithms. The result is four sets of boundaries for the GM and the brain parenchyma (GM+WM), the two regions of most interest in medical research and clinical applications. Each set of boundaries is compared with the golden standard to evaluate the segmentation performance. The adaptive EM-PCNN significantly outperforms the non-adaptive EM-PCNN, EM, and BCFCM algorithms in gray mater segmentation. In brain parenchyma segmentation, the adaptive EM-PCNN significantly outperforms the BCFCM only. However, the adaptive EM-PCNN is better than the non-adaptive EM-PCNN and EM on average. We conclude that of the three approaches, the adaptive EM-PCNN yields the best results for gray matter and brain parenchyma segmentation.

  19. An image processing pipeline to detect and segment nuclei in muscle fiber microscopic images.

    Science.gov (United States)

    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. Automatic cell counting with ImageJ.

    Science.gov (United States)

    Grishagin, Ivan V

    2015-03-15

    Cell counting is an important routine procedure. However, to date there is no comprehensive, easy to use, and inexpensive solution for routine cell counting, and this procedure usually needs to be performed manually. Here, we report a complete solution for automatic cell counting in which a conventional light microscope is equipped with a web camera to obtain images of a suspension of mammalian cells in a hemocytometer assembly. Based on the ImageJ toolbox, we devised two algorithms to automatically count these cells. This approach is approximately 10 times faster and yields more reliable and consistent results compared with manual counting.

  1. Robust Automatic Pectoral Muscle Segmentation from Mammograms Using Texture Gradient and Euclidean Distance Regression.

    Science.gov (United States)

    Bora, Vibha Bafna; Kothari, Ashwin G; Keskar, Avinash G

    2016-02-01

    In computer-aided diagnosis (CAD) of mediolateral oblique (MLO) view of mammogram, the accuracy of tissue segmentation highly depends on the exclusion of pectoral muscle. Robust methods for such exclusions are essential as the normal presence of pectoral muscle can bias the decision of CAD. In this paper, a novel texture gradient-based approach for automatic segmentation of pectoral muscle is proposed. The pectoral edge is initially approximated to a straight line by applying Hough transform on Probable Texture Gradient (PTG) map of the mammogram followed by block averaging with the aid of approximated line. Furthermore, a smooth pectoral muscle curve is achieved with proposed Euclidean Distance Regression (EDR) technique and polynomial modeling. The algorithm is robust to texture and overlapping fibro glandular tissues. The method is validated with 340 MLO views from three databases-including 200 randomly selected scanned film images from miniMIAS, 100 computed radiography images and 40 full-field digital mammogram images. Qualitatively, 96.75 % of the pectoral muscles are segmented with an acceptable pectoral score index. The proposed method not only outperforms state-of-the-art approaches but also accurately quantifies the pectoral edge. Thus, its high accuracy and relatively quick processing time clearly justify its suitability for CAD.

  2. A marked point process of rectangles and segments for automatic analysis of digital elevation models.

    Science.gov (United States)

    Ortner, Mathias; Descombe, Xavier; Zerubia, Josiane

    2008-01-01

    This work presents a framework for automatic feature extraction from images using stochastic geometry. Features in images are modeled as realizations of a spatial point process of geometrical shapes. This framework allows the incorporation of a priori knowledge on the spatial repartition of features. More specifically, we present a model based on the superposition of a process of segments and a process of rectangles. The former is dedicated to the detection of linear networks of discontinuities, while the latter aims at segmenting homogeneous areas. An energy is defined, favoring connections of segments, alignments of rectangles, as well as a relevant interaction between both types of objects. The estimation is performed by minimizing the energy using a simulated annealing algorithm. The proposed model is applied to the analysis of Digital Elevation Models (DEMs). These images are raster data representing the altimetry of a dense urban area. We present results on real data provided by the IGN (French National Geographic Institute) consisting in low quality DEMs of various types.

  3. Automatic segmentation and 3D feature extraction of protein aggregates in Caenorhabditis elegans

    Science.gov (United States)

    Rodrigues, Pedro L.; Moreira, António H. J.; Teixeira-Castro, Andreia; Oliveira, João; Dias, Nuno; Rodrigues, Nuno F.; Vilaça, João L.

    2012-03-01

    In the last years, it has become increasingly clear that neurodegenerative diseases involve protein aggregation, a process often used as disease progression readout and to develop therapeutic strategies. This work presents an image processing tool to automatic segment, classify and quantify these aggregates and the whole 3D body of the nematode Caenorhabditis Elegans. A total of 150 data set images, containing different slices, were captured with a confocal microscope from animals of distinct genetic conditions. Because of the animals' transparency, most of the slices pixels appeared dark, hampering their body volume direct reconstruction. Therefore, for each data set, all slices were stacked in one single 2D image in order to determine a volume approximation. The gradient of this image was input to an anisotropic diffusion algorithm that uses the Tukey's biweight as edge-stopping function. The image histogram median of this outcome was used to dynamically determine a thresholding level, which allows the determination of a smoothed exterior contour of the worm and the medial axis of the worm body from thinning its skeleton. Based on this exterior contour diameter and the medial animal axis, random 3D points were then calculated to produce a volume mesh approximation. The protein aggregations were subsequently segmented based on an iso-value and blended with the resulting volume mesh. The results obtained were consistent with qualitative observations in literature, allowing non-biased, reliable and high throughput protein aggregates quantification. This may lead to a significant improvement on neurodegenerative diseases treatment planning and interventions prevention.

  4. Real-Time Automatic Segmentation of Optical Coherence Tomography Volume Data of the Macular Region.

    Directory of Open Access Journals (Sweden)

    Jing Tian

    Full Text Available Optical coherence tomography (OCT is a high speed, high resolution and non-invasive imaging modality that enables the capturing of the 3D structure of the retina. The fast and automatic analysis of 3D volume OCT data is crucial taking into account the increased amount of patient-specific 3D imaging data. In this work, we have developed an automatic algorithm, OCTRIMA 3D (OCT Retinal IMage Analysis 3D, that could segment OCT volume data in the macular region fast and accurately. The proposed method is implemented using the shortest-path based graph search, which detects the retinal boundaries by searching the shortest-path between two end nodes using Dijkstra's algorithm. Additional techniques, such as inter-frame flattening, inter-frame search region refinement, masking and biasing were introduced to exploit the spatial dependency between adjacent frames for the reduction of the processing time. Our segmentation algorithm was evaluated by comparing with the manual labelings and three state of the art graph-based segmentation methods. The processing time for the whole OCT volume of 496×644×51 voxels (captured by Spectralis SD-OCT was 26.15 seconds which is at least a 2-8-fold increase in speed compared to other, similar reference algorithms used in the comparisons. The average unsigned error was about 1 pixel (∼ 4 microns, which was also lower compared to the reference algorithms. We believe that OCTRIMA 3D is a leap forward towards achieving reliable, real-time analysis of 3D OCT retinal data.

  5. Minimizing manual image segmentation turn-around time for neuronal reconstruction by embracing uncertainty.

    Directory of Open Access Journals (Sweden)

    Stephen M Plaza

    Full Text Available The ability to automatically segment an image into distinct regions is a critical aspect in many visual processing applications. Because inaccuracies often exist in automatic segmentation, manual segmentation is necessary in some application domains to correct mistakes, such as required in the reconstruction of neuronal processes from microscopic images. The goal of the automated segmentation tool is traditionally to produce the highest-quality segmentation, where quality is measured by the similarity to actual ground truth, so as to minimize the volume of manual correction necessary. Manual correction is generally orders-of-magnitude more time consuming than automated segmentation, often making handling large images intractable. Therefore, we propose a more relevant goal: minimizing the turn-around time of automated/manual segmentation while attaining a level of similarity with ground truth. It is not always necessary to inspect every aspect of an image to generate a useful segmentation. As such, we propose a strategy to guide manual segmentation to the most uncertain parts of segmentation. Our contributions include 1 a probabilistic measure that evaluates segmentation without ground truth and 2 a methodology that leverages these probabilistic measures to significantly reduce manual correction while maintaining segmentation quality.

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

    Science.gov (United States)

    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.

  7. Minimum description length synthetic aperture radar image segmentation.

    Science.gov (United States)

    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.

  8. Cluster Ensemble-based Image Segmentation

    Directory of Open Access Journals (Sweden)

    Xiaoru Wang

    2013-07-01

    Full Text Available Image segmentation is the foundation of computer vision applications. In this paper, we propose a new\tcluster ensemble-based image\tsegmentation algorithm, which overcomes several problems of traditional methods. We make two main contributions in this paper. First, we introduce the cluster ensemble concept to fuse the segmentation results from different types of visual features effectively, which can deliver a better final result and achieve a much more stable performance for broad categories of images. Second, we exploit the PageRank idea from Internet applications and apply it to the image segmentation task. This can improve the final segmentation results by combining the spatial information of the image and the semantic similarity of regions. Our experiments on four public image databases validate the superiority of our algorithm over conventional single type of feature or multiple types of features-based algorithms, since our algorithm can fuse multiple types of features effectively for better segmentation results. Moreover, our method is also proved to be very competitive in comparison with other state-of-the-art segmentation algorithms.

  9. Review methods for image segmentation from computed tomography images

    Energy Technology Data Exchange (ETDEWEB)

    Mamat, Nurwahidah; Rahman, Wan Eny Zarina Wan Abdul; Soh, Shaharuddin Cik [Faculty of Science Computer and Mathematics, Universiti Teknologi Mara Malaysia, 40450 Shah Alam Selangor (Malaysia); Mahmud, Rozi [Faculty of Medicine and Health Sciences, Universiti Putra Malaysia 43400 Serdang Selangor (Malaysia)

    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.

  10. Automatic color based reassembly of fragmented images and paintings.

    Science.gov (United States)

    Tsamoura, Efthymia; Pitas, Ioannis

    2010-03-01

    The problem of reassembling image fragments arises in many scientific fields, such as forensics and archaeology. In the field of archaeology, the pictorial excavation findings are almost always in the form of painting fragments. The manual execution of this task is very difficult, as it requires great amount of time, skill and effort. Thus, the automation of such a work is very important and can lead to faster, more efficient, painting reassembly and to a significant reduction in the human effort involved. In this paper, an integrated method for automatic color based 2-D image fragment reassembly is presented. The proposed 2-D reassembly technique is divided into four steps. Initially, the image fragments which are probably spatially adjacent, are identified utilizing techniques employed in content based image retrieval systems. The second operation is to identify the matching contour segments for every retained couple of image fragments, via a dynamic programming technique. The next step is to identify the optimal transformation in order to align the matching contour segments. Many registration techniques have been evaluated to this end. Finally, the overall image is reassembled from its properly aligned fragments. This is achieved via a novel algorithm, which exploits the alignment angles found during the previous step. In each stage, the most robust algorithms having the best performance are investigated and their results are fed to the next step. We have experimented with the proposed method using digitally scanned images of actual torn pieces of paper image prints and we produced very satisfactory reassembly results.

  11. A new Level-set based Protocol for Accurate Bone Segmentation from CT Imaging

    CERN Document Server

    Pinheiro, Manuel

    2015-01-01

    In this work it is proposed a medical image segmentation pipeline for accurate bone segmentation from CT imaging. It is a two-step methodology, with a pre-segmentation step and a segmentation refinement step. First, the user performs a rough segmenting of the desired region of interest. Next, a fully automatic refinement step is applied to the pre-segmented data. The automatic segmentation refinement is composed by several sub-stpng, namely image deconvolution, image cropping and interpolation. The user-defined pre-segmentation is then refined over the deconvolved, cropped, and up-sampled version of the image. The algorithm is applied in the segmentation of CT images of a composite femur bone, reconstructed with different reconstruction protocols. Segmentation outcomes are validated against a gold standard model obtained with coordinate measuring machine Nikon Metris LK V20 with a digital line scanner LC60-D that guarantees an accuracy of 28 $\\mu m$. High sub-pixel accuracy models were obtained for all tested...

  12. Semantic Image Segmentation with Contextual Hierarchical Models.

    Science.gov (United States)

    Seyedhosseini, Mojtaba; Tasdizen, Tolga

    2016-05-01

    Semantic segmentation is the problem of assigning an object label to each pixel. It unifies the image segmentation and object recognition problems. The importance of using contextual information in semantic segmentation frameworks has been widely realized in the field. We propose a contextual framework, called contextual hierarchical model (CHM), which learns contextual information in a hierarchical framework for semantic segmentation. At each level of the hierarchy, a classifier is trained based on downsampled input images and outputs of previous levels. Our model then incorporates the resulting multi-resolution contextual information into a classifier to segment the input image at original resolution. This training strategy allows for optimization of a joint posterior probability at multiple resolutions through the hierarchy. Contextual hierarchical model is purely based on the input image patches and does not make use of any fragments or shape examples. Hence, it is applicable to a variety of problems such as object segmentation and edge detection. We demonstrate that CHM performs at par with state-of-the-art on Stanford background and Weizmann horse datasets. It also outperforms state-of-the-art edge detection methods on NYU depth dataset and achieves state-of-the-art on Berkeley segmentation dataset (BSDS 500).

  13. Nucleus segmentation in histology images with hierarchical multilevel thresholding

    Science.gov (United States)

    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.

  14. An Automatic Number Plate Recognition System under Image Processing

    Directory of Open Access Journals (Sweden)

    Sarbjit Kaur

    2016-03-01

    Full Text Available Automatic Number Plate Recognition system is an application of computer vision and image processing technology that takes photograph of vehicles as input image and by extracting their number plate from whole vehicle image , it display the number plate information into text. Mainly the ANPR system consists of 4 phases: - Acquisition of Vehicle Image and Pre-Processing, Extraction of Number Plate Area, Character Segmentation and Character Recognition. The overall accuracy and efficiency of whole ANPR system depends on number plate extraction phase as character segmentation and character recognition phases are also depend on the output of this phase. Further the accuracy of Number Plate Extraction phase depends on the quality of captured vehicle image. Higher be the quality of captured input vehicle image more will be the chances of proper extraction of vehicle number plate area. The existing methods of ANPR works well for dark and bright/light categories image but it does not work well for Low Contrast, Blurred and Noisy images and the detection of exact number plate area by using the existing ANPR approach is not successful even after applying existing filtering and enhancement technique for these types of images. Due to wrong extraction of number plate area, the character segmentation and character recognition are also not successful in this case by using the existing method. To overcome these drawbacks I proposed an efficient approach for ANPR in which the input vehicle image is pre-processed firstly by iterative bilateral filtering , adaptive histogram equalization and number plate is extracted from pre-processed vehicle image using morphological operations, image subtraction, image binarization/thresholding, sobel vertical edge detection and by boundary box analysis. Sometimes the extracted plate area also contains noise, bolts, frames etc. So the extracted plate area is enhanced by using morphological operations to improve the quality of

  15. Color Image Segmentation using Kohonen Self-Organizing Map (SOM

    Directory of Open Access Journals (Sweden)

    I Komang Ariana

    2014-05-01

    Full Text Available Color image segmentation using Kohonen Self-Organizing Map (SOM, is proposed in this study. RGB color space is used as input in the process of clustering by SOM. Measurement of the distance between weight vector and input vector in learning and recognition stages in SOM method, uses Normalized Euclidean Distance. Then, the validity of clustering result is tested by Davies-Bouldin Index (DBI and Validity Measure (VM to determine the most optimal number of cluster. The clustering result, according to the most optimal number of cluster, then is processed with spatial operations. Spatial operations are used to eliminate noise and small regions which are formed from the clustering result. This system allows segmentation process become automatic and unsupervised. The segmentation results are close to human perception.

  16. Pulmonary Vascular Tree Segmentation from Contrast-Enhanced CT Images

    CERN Document Server

    Helmberger, M; Pienn, M; Balint, Z; Olschewski, A; Bischof, H

    2013-01-01

    We present a pulmonary vessel segmentation algorithm, which is fast, fully automatic and robust. It uses a coarse segmentation of the airway tree and a left and right lung labeled volume to restrict a vessel enhancement filter, based on an offset medialness function, to the lungs. We show the application of our algorithm on contrast-enhanced CT images, where we derive a clinical parameter to detect pulmonary hypertension (PH) in patients. Results on a dataset of 24 patients show that quantitative indices derived from the segmentation are applicable to distinguish patients with and without PH. Further work-in-progress results are shown on the VESSEL12 challenge dataset, which is composed of non-contrast-enhanced scans, where we range in the midfield of participating contestants.

  17. Natural color image segmentation using integrated mechanism

    Institute of Scientific and Technical Information of China (English)

    Jie Xu (徐杰); Pengfei Shi (施鹏飞)

    2003-01-01

    A new method for natural color image segmentation using integrated mechanism is proposed in this paper.Edges are first detected in term of the high phase congruency in the gray-level image. K-mean cluster is used to label long edge lines based on the global color information to estimate roughly the distribution of objects in the image, while short ones are merged based on their positions and local color differences to eliminate the negative affection caused by texture or other trivial features in image. Region growing technique is employed to achieve final segmentation results. The proposed method unifies edges, whole and local color distributions, as well as spatial information to solve the natural image segmentation problem.The feasibility and effectiveness of this method have been demonstrated by various experiments.

  18. DISR: Dental Image Segmentation and Retrieval.

    Science.gov (United States)

    Pilevar, Abdol Hamid

    2012-01-01

    In this paper, we propose novel algorithms for retrieving dental images from databases by their contents. Based on special information of dental images, for better content-based dental image retrieval and representation, the image attributes are used. We propose Dental Image Segmentation and Retrieval (DISR), a content-based image retrieval method that is robust to translation and scaling of the objects in the images. A novel model is used to calculate the features of the image. We implemented the dentition plaster casts and proposed a special technique for segmenting teeth in our dental study models. For testing the efficiency of the presented algorithm, a software system is developed and 60 dental study models are used. The models are covering different kinds of malocclusions. Our experiments show that 95% of the extracted results are accurate and the presented algorithm is efficient.

  19. An attribute-based image segmentation method

    Directory of Open Access Journals (Sweden)

    M.C. de Andrade

    1999-07-01

    Full Text Available This work addresses a new image segmentation method founded on Digital Topology and Mathematical Morphology grounds. The ABA (attribute based absorptions transform can be viewed as a region-growing method by flooding simulation working at the scale of the main structures of the image. In this method, the gray level image is treated as a relief flooded from all its local minima, which are progressively detected and merged as the flooding takes place. Each local minimum is exclusively associated to one catchment basin (CB. The CBs merging process is guided by their geometric parameters as depth, area and/or volume. This solution enables the direct segmentation of the original image without the need of a preprocessing step or the explicit marker extraction step, often required by other flooding simulation methods. Some examples of image segmentation, employing the ABA transform, are illustrated for uranium oxide samples. It is shown that the ABA transform presents very good segmentation results even in presence of noisy images. Moreover, it's use is often easier and faster when compared to similar image segmentation methods.

  20. Automatic Multi-Level Thresholding Segmentation Based on Multi-Objective Optimization

    Directory of Open Access Journals (Sweden)

    L. DJEROU,

    2012-01-01

    Full Text Available In this paper, we present a new multi-level image thresholding technique, called Automatic Threshold based on Multi-objective Optimization "ATMO" that combines the flexibility of multi-objective fitness functions with the power of a Binary Particle Swarm Optimization algorithm "BPSO", for searching the "optimum" number of the thresholds and simultaneously the optimal thresholds of three criteria: the between-class variances criterion, the minimum error criterion and the entropy criterion. Some examples of test images are presented to compare our segmentation method, based on the multi-objective optimization approach with Otsu’s, Kapur’s and Kittler’s methods. Our experimental results show that the thresholding method based on multi-objective optimization is more efficient than the classical Otsu’s, Kapur’s and Kittler’s methods.

  1. 高空间分辨率遥感影像分割尺度参数自动选择研究%Study on the Automatic Selection of Segmentation Scale Parameters for High Spatial Resolution Remote Sensing Images

    Institute of Scientific and Technical Information of China (English)

    王志华; 孟樊; 杨晓梅; 杨丰硕; 方豫

    2016-01-01

    Geographic Object-Based Image Analysis (GEOBIA) is widely used in high spatial resolution remote sensing image interpretation. However, the fundamental component of image segmentation severely obstructs its development, especially on the selection of segmentation parameters. To overcome these issues, we choose the widely used Fractal Network Evolution Algorithm as an example, which is provided by eCognition, and focus on looking for an approach for the scale parameter selection. Inspired by the similarity between the merging segmentation and the degrading image resolution that the unit size within both would increase, we introduce the weights of border length and the weights of object area into the metric of Local Variance proposed by Woodcock and Strahler (1987), and propose a new segmentation evaluation metric: Weighted Local Variance (WLV). Through comparing WLV with a supervised metric on a series of segmentations with limited increasing scale parameters, we found that the best segmentation result chosen by the first local maximum point of the scale-WLV curve is similar to the manual segmentation result. Then we validate WLV on two more images and expand the limited scale space to the full range, so that the segments can change from one pixel to the whole image. Results show that the segmentations chosen by WLV local maximum points could reflect the different levels in the hierarchical landscape, and the segmentation of the first levels is capable of expressing the finest homogeneous patches.%面向对象解译技术在高分辨率遥感影像信息提取中得到广泛应用,但影像分割的基础问题仍严重制约其自动化水平,尤其是分割参数选择.因此,本文以广泛使用的分型网络演化分割算法为例,开展尺度参数选择研究.借鉴对遥感影像分辨率敏感的局部方差指标,引入边长和面积权重,构造加权局部方差(WLV)指标,对多个分割结果进行评价,进而实现最佳尺

  2. The Automatic Image Segmentation Method Based on Fast FCM and Random Walk Algorithm%基于快速FCM与随机游走算法的图像自动分割方法

    Institute of Scientific and Technical Information of China (English)

    许健才; 张良均; 余燕团

    2016-01-01

    在图像分割中,针对 FCM 算法存在聚类数目需要预先给定、收敛速度慢等缺点,本文把快速模糊 C 均值聚类算法和随机游走算法相结合,具体方法为先采用快速模糊 C 均值聚类算法对图像进行预分割,以便获得聚类中心的位置,然后将该中心作为随机游走的种子点,再进行图像分割,实验结果得到了较为满意的预期效果,证明该方法是可行的。本文的研究为快速 FCM 实现自适应性和开发图形图像预处理系统提供了技术支持与理论依据。%As far as image segmentation, the defeat of the number of clusters for FCM algorithm is reeded to be improued. In this paper, the fast fuzzy C-means clustering and random walk algorithm are combined to solve the problem of image segmentation. Firstly, the fast FCM for image pre-segmentation to obtain the number of clusters and cluster central location as the seed points of random walk firstly. Then, for image segmentation, experimental results show that this method is feasible, and get a more satisfactory desired purpose. Results of this study achieve self-adaptive and fast FCM develop graphical image preprocessing system provides technical support and theoretical basis.

  3. Self imaging in segmented waveguide arrays

    Science.gov (United States)

    Heinrich, Matthias; Szameit, Alexander; Dreisow, Felix; Pertsch, Thomas; Nolte, Stefan; Tünnermann, Andreas; Suran, Eric; Louradour, Frédéric; Bathélémy, Alain; Longhi, Stefano

    2009-02-01

    Self-imaging in integrated optical devices is interesting for many applications including image transmission, optical collimation and even reshaping of ultrashort laser pulses. However, in general this relies on boundary-free light propagation, since interaction with boundaries results in a considerable distortion of the self-imaging effect. This problem can be overcome in waveguide arrays by segmentation of particular lattice sites, yielding phase shifts which result in image reconstruction in one- as well as two-dimensional configurations. Here, we demonstrate the first experimental realization of this concept. For the fabrication of the segmented waveguide arrays we used the femtosecond laser direct-writing technique. The total length of the arrays is 50mm with a waveguide spacing of 16 μm and 20μm in the one- and two-dimensional case, respectively. The length of the segmented area was 2.6mm, while the segmentation period was chosen to be 16 μm. This results in a complete inversion of the global phase of the travelling field inside the array, so that the evolution dynamics are reversed and the input field is imaged onto the sample output facet. Accordingly, segmented integrated optical devices provide a new and attractive opportunity for image transmission in finite systems.

  4. MRI Brain Image Segmentation based on Thresholding

    Directory of Open Access Journals (Sweden)

    G. Evelin Sujji, Y.V.S. Lakshmi, G. Wiselin Jiji

    2013-03-01

    Full Text Available Medical Image processing is one of the mostchallenging topics in research field. The mainobjective of image segmentation is to extract variousfeatures of the image that are used foranalysing,interpretation and understanding of images.Medical Resonance Image plays a major role inMedical diagnostics. Image processing in MRI ofbrain is highlyessential due to accurate detection ofthe type of brain abnormality which can reduce thechance of fatal result. This paper outlines anefficient image segmentation technique that candistinguish the pathological tissues such asedemaandtumourfrom thenormal tissues such as WhiteMatter(WM,GreyMatter(GM, andCerebrospinal Fluid(CSF. Thresholding is simplerand most commonly used techniques in imagesegmentation. This technique can be used to detectthe contour of thetumourin brain.

  5. Image Segmentation in Liquid Argon Time Projection Chamber Detector

    CERN Document Server

    Płoński, Piotr; Sulej, Robert; Zaremba, Krzysztof

    2015-01-01

    The Liquid Argon Time Projection Chamber (LAr-TPC) detectors provide excellent imaging and particle identification ability for studying neutrinos. An efficient and automatic reconstruction procedures are required to exploit potential of this imaging technology. Herein, a novel method for segmentation of images from LAr-TPC detectors is presented. The proposed approach computes a feature descriptor for each pixel in the image, which characterizes amplitude distribution in pixel and its neighbourhood. The supervised classifier is employed to distinguish between pixels representing particle's track and noise. The classifier is trained and evaluated on the hand-labeled dataset. The proposed approach can be a preprocessing step for reconstructing algorithms working directly on detector images.

  6. Image segmentation using neural tree networks

    Science.gov (United States)

    Samaddar, Sumitro; Mammone, Richard J.

    1993-06-01

    We present a technique for Image Segmentation using Neural Tree Networks (NTN). We also modify the NTN architecture to let is solve multi-class classification problems with only binary fan-out. We have used a realistic case study of segmenting the pole, coil and painted coil regions of light bulb filaments (LBF). The input to the network is a set of maximum, minimum and average of intensities in radial slices of a circular window around a pixel, taken from a front-lit and a back-lit image of an LBF. Training is done with a composite image drawn from images of many LBFs. Each node of the NTN is a multi-layer perceptron and has one output for each segment class. These outputs are treated as probabilities to compute a confidence value for the segmentation of that pixel. Segmentation results with high confidence values are deemed to be correct and not processed further, while those with moderate and low confidence values are deemed to be outliers by this node and passed down the tree to children nodes. These tend to be pixels in boundary of different regions. The results are favorably compared with a traditional segmentation technique applied to the LBF test case.

  7. Neural tree network method for image segmentation

    Science.gov (United States)

    Samaddar, Sumitro; Mammone, Richard J.

    1994-02-01

    We present an extension of the neural tree network (NTN) architecture to let it solve multi- class classification problems with only binary fan-out. We then demonstrate it's effectiveness by applying it in a method for image segmentation. Each node of the NTN is a multi-layer perceptron and has one output for each segment class. These outputs are treated as probabilities to compute a confidence value for the segmentation of that pixel. Segmentation results with high confidence values are deemed to be correct and not processed further, while those with moderate and low confidence values are deemed to be outliers by this node and passed down the tree to children nodes. These tend to be pixels in boundary of different regions. We have used a realistic case study of segmenting the pole, coil and painted coil regions of light bulb filaments (LBF). The input to the network is a set of maximum, minimum and average of intensities in radial slices of a circular window around a pixel, taken from a front-lit and a back-lit image of an LBF. Training is done with a composite image drawn from images of many LBFs. The results are favorably compared with a traditional segmentation technique applied to the LBF test case.

  8. Intuitionistic fuzzy segmentation of medical images.

    Science.gov (United States)

    Chaira, Tamalika

    2010-06-01

    This paper proposes a novel and probably the first method, using Attanassov intuitionistic fuzzy set theory to segment blood vessels and also the blood cells in pathological images. This type of segmentation is very important in detecting different types of human diseases, e.g., an increase in the number of vessels may lead to cancer in prostates, mammary, etc. The medical images are not properly illuminated, and segmentation in that case becomes very difficult. A novel image segmentation approach using intuitionistic fuzzy set theory and a new membership function is proposed using restricted equivalence function from automorphisms, for finding the membership values of the pixels of the image. An intuitionistic fuzzy image is constructed using Sugeno type intuitionistic fuzzy generator. Local thresholding is applied to threshold medical images. The results showed a much better performance on poor contrast medical images, where almost all the blood vessels and blood cells are visible properly. There are several fuzzy and intuitionistic fuzzy thresholding methods, but these methods are not related to the medical images. To make a comparison with the proposed method with other thresholding methods, the method is compared with six nonfuzzy, fuzzy, and intuitionistic fuzzy methods.

  9. Unsupervised image segmentation with neural networks

    NARCIS (Netherlands)

    Gieling, Th.H.; Janssen, H.J.J.; Vries, de H.C.; Loef, P.

    2001-01-01

    The segmentation of colour images (RGB), distinguishing clusters of image points, representing for example background, leaves and flowers, is performed in a multi-dimensional environment. Considering a two dimensional environment, clusters can be divided by lines. In a three dimensional environment

  10. CONSTRAINED SPECTRAL CLUSTERING FOR IMAGE SEGMENTATION

    Science.gov (United States)

    Sourati, Jamshid; Brooks, Dana H.; Dy, Jennifer G.; Erdogmus, Deniz

    2013-01-01

    Constrained spectral clustering with affinity propagation in its original form is not practical for large scale problems like image segmentation. In this paper we employ novelty selection sub-sampling strategy, besides using efficient numerical eigen-decomposition methods to make this algorithm work efficiently for images. In addition, entropy-based active learning is also employed to select the queries posed to the user more wisely in an interactive image segmentation framework. We evaluate the algorithm on general and medical images to show that the segmentation results will improve using constrained clustering even if one works with a subset of pixels. Furthermore, this happens more efficiently when pixels to be labeled are selected actively. PMID:24466500

  11. Automatic segmentation of lesions for the computer-assisted detection in fluorescence urology

    Science.gov (United States)

    Kage, Andreas; Legal, Wolfgang; Kelm, Peter; Simon, Jörg; Bergen, Tobias; Münzenmayer, Christian; Benz, Michaela

    2012-03-01

    Bladder cancer is one of the most common cancers in the western world. The diagnosis in Germany is based on the visual inspection of the bladder. This inspection performed with a cystoscope is a challenging task as some kinds of abnormal tissues do not differ much in their appearance from their surrounding healthy tissue. Fluorescence Cystoscopy has the potential to increase the detection rate. A liquid marker introduced into the bladder in advance of the inspection is concentrated in areas with high metabolism. Thus these areas appear as bright "glowing". Unfortunately, the fluorescence image contains besides the glowing of the suspicious lesions no more further visual information like for example the appearance of the blood vessels. A visual judgment of the lesion as well as a precise treatment has to be done using white light illumination. Thereby, the spatial information of the lesion provided by the fluorescence image has to be guessed by the clinical expert. This leads to a time consuming procedure due to many switches between the modalities and increases the risk of mistreatment. We introduce an automatic approach, which detects and segments any suspicious lesion in the fluorescence image automatically once the image was classified as a fluorescence image. The area of the contour of the detected lesion is transferred to the corresponding white light image and provide the clinical expert the spatial information of the lesion. The advantage of this approach is, that the clinical expert gets the spatial and the visual information of the lesion together in one image. This can save time and decrease the risk of an incomplete removal of a malign lesion.

  12. Image Segmentation Using Weak Shape Priors

    CERN Document Server

    Xu, Robert Sheng; Salama, Magdy

    2010-01-01

    The problem of image segmentation is known to become particularly challenging in the case of partial occlusion of the object(s) of interest, background clutter, and the presence of strong noise. To overcome this problem, the present paper introduces a novel approach segmentation through the use of "weak" shape priors. Specifically, in the proposed method, an segmenting active contour is constrained to converge to a configuration at which its geometric parameters attain their empirical probability densities closely matching the corresponding model densities that are learned based on training samples. It is shown through numerical experiments that the proposed shape modeling can be regarded as "weak" in the sense that it minimally influences the segmentation, which is allowed to be dominated by data-related forces. On the other hand, the priors provide sufficient constraints to regularize the convergence of segmentation, while requiring substantially smaller training sets to yield less biased results as compare...

  13. Intravascular Ultrasound Image Segmentation Using Morphological Snakes

    Directory of Open Access Journals (Sweden)

    Hamdi Mohamed Ali

    2012-06-01

    Full Text Available From the first use of the technics of intravascular ultrasound (IVUS as an imaging technique for the coronary artery system at the 70th century until now , the segmentation of the arterial wall boundaries still an important problem . Much research has been done to give better segmentation result for better diagnostics , evaluation and therapy planning. In this paper we present a new segmentation technics based on Morphological Snakes which developed by Luis Álvarez used for the first time for IVUS segmentation. It is a simple , fast and stable approach of snakes evolution algorithm. Results are presented and discussed in order to demonstrate the effectiveness of this approach in IVUS segmentation.

  14. Automating the segmentation of medical images for the production of voxel tomographic computational models.

    Science.gov (United States)

    Caon, M; Mohyla, J

    2001-12-01

    Radiation dosimetry for the diagnostic medical imaging procedures performed on humans requires anatomically accurate, computational models. These may be constructed from medical images as voxel-based tomographic models. However, they are time consuming to produce and as a consequence, there are few available. This paper discusses the emergence of semi-automatic segmentation techniques and describes an application (iRAD) written in Microsoft Visual Basic that allows the bitmap of a medical image to be segmented interactively and semi-automatically while displayed in Microsoft Excel. iRAD will decrease the time required to construct voxel models.

  15. Dermoscopic Image Segmentation using Machine Learning Algorithm

    Directory of Open Access Journals (Sweden)

    L. P. Suresh

    2011-01-01

    Full Text Available Problem statement: Malignant melanoma is the most frequent type of skin cancer. Its incidence has been rapidly increasing over the last few decades. Medical image segmentation is the most essential and crucial process in order to facilitate the characterization and visualization of the structure of interest in medical images. Approach: This study explains the task of segmenting skin lesions in Dermoscopy images based on intelligent systems such as Fuzzy and Neural Networks clustering techniques for the early diagnosis of Malignant Melanoma. The various intelligent system based clustering techniques used are Fuzzy C Means Algorithm (FCM, Possibilistic C Means Algorithm (PCM, Hierarchical C Means Algorithm (HCM; C-mean based Fuzzy Hopfield Neural Network, Adaline Neural Network and Regression Neural Network. Results: The segmented images are compared with the ground truth image using various parameters such as False Positive Error (FPE, False Negative Error (FNE Coefficient of similarity, spatial overlap and their performance is evaluated. Conclusion: The experimental results show that the Hierarchical C Means algorithm( Fuzzy provides better segmentation than other (Fuzzy C Means, Possibilistic C Means, Adaline Neural Network, FHNN and GRNN clustering algorithms. Thus Hierarchical C Means approach can handle uncertainties that exist in the data efficiently and useful for the lesion segmentation in a computer aided diagnosis system to assist the clinical diagnosis of dermatologists.

  16. Segmentation and Classification of Burn Color Images

    Science.gov (United States)

    2007-11-02

    2Grupo de Ingeniería Biomédica. Escuela Superior de Ingenieros. Universidad de Sevilla. Spain. e-mail: bacha@viento.us.es, cserrano@viento.us.es...Abstract-The aim of the algorithm described in this paper is to separate burned skin from normal skin in burn color images and to classify them...Segmentation Results To perform the segmentation, a previous characterization of the hue and saturation component histograms for both normal and burnt skin

  17. Superpixel Cut for Figure-Ground Image Segmentation

    Science.gov (United States)

    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.

  18. Automatic Microaneurysm Detection and Characterization Through Digital Color Fundus Images

    Energy Technology Data Exchange (ETDEWEB)

    Martins, Charles; Veras, Rodrigo; Ramalho, Geraldo; Medeiros, Fatima; Ushizima, Daniela

    2008-08-29

    Ocular fundus images can provide information about retinal, ophthalmic, and even systemic diseases such as diabetes. Microaneurysms (MAs) are the earliest sign of Diabetic Retinopathy, a frequently observed complication in both type 1 and type 2 diabetes. Robust detection of MAs in digital color fundus images is critical in the development of automated screening systems for this kind of disease. Automatic grading of these images is being considered by health boards so that the human grading task is reduced. In this paper we describe segmentation and the feature extraction methods for candidate MAs detection.We show that the candidate MAs detected with the methodology have been successfully classified by a MLP neural network (correct classification of 84percent).

  19. Automatic nonrigid registration of whole body CT mice images.

    Science.gov (United States)

    Li, Xia; Yankeelov, Thomas E; Peterson, Todd E; Gore, John C; Dawant, Benoit M

    2008-04-01

    Three-dimensional intra- and intersubject registration of image volumes is important for tasks that include quantification of temporal/longitudinal changes, atlas-based segmentation, computing population averages, or voxel and tensor-based morphometry. While a number of methods have been proposed to address this problem, few have focused on the problem of registering whole body image volumes acquired either from humans or small animals. These image volumes typically contain a large number of articulated structures, which makes registration more difficult than the registration of head images, to which the majority of registration algorithms have been applied. This article presents a new method for the automatic registration of whole body computed tomography (CT) volumes, which consists of two main steps. Skeletons are first brought into approximate correspondence with a robust point-based method. Transformations so obtained are refined with an intensity-based nonrigid registration algorithm that includes spatial adaptation of the transformation's stiffness. The approach has been applied to whole body CT images of mice, to CT images of the human upper torso, and to human head and neck CT images. To validate the authors method on soft tissue structures, which are difficult to see in CT images, the authors use coregistered magnetic resonance images. They demonstrate that the approach they propose can successfully register image volumes even when these volumes are very different in size and shape or if they have been acquired with the subjects in different positions.

  20. Weighting training images by maximizing distribution similarity for supervised segmentation across scanners

    DEFF Research Database (Denmark)

    van Opbroek, Annegreet; Vernooij, Meike W; Ikram, M.Arfan;

    2015-01-01

    and the PDF of the voxels of the target image. The voxels and weights of the training images are then used to train a weighted classifier. We tested our method on three segmentation tasks: brain-tissue segmentation, skull stripping, and white-matter-lesion segmentation. For all three applications......Many automatic segmentation methods are based on supervised machine learning. Such methods have proven to perform well, on the condition that they are trained on a sufficiently large manually labeled training set that is representative of the images to segment. However, due to differences between...... scanners, scanning parameters, and patients such a training set may be difficult to obtain. We present a transfer-learning approach to segmentation by multi-feature voxelwise classification. The presented method can be trained using a heterogeneous set of training images that may be obtained with different...

  1. Fully automatic lung segmentation and rib suppression methods to improve nodule detection in chest radiographs.

    Science.gov (United States)

    Soleymanpour, Elaheh; Pourreza, Hamid Reza; Ansaripour, Emad; Yazdi, Mehri Sadooghi

    2011-07-01

    Computer-aided Diagnosis (CAD) systems can assist radiologists in several diagnostic tasks. Lung segmentation is one of the mandatory steps for initial detection of lung cancer in Posterior-Anterior chest radiographs. On the other hand, many CAD schemes in projection chest radiography may benefit from the suppression of the bony structures that overlay the lung fields, e.g. ribs. The original images are enhanced by an adaptive contrast equalization and non-linear filtering. Then an initial estimation of lung area is obtained based on morphological operations and then it is improved by growing this region to find the accurate final contour, then for rib suppression, we use oriented spatial Gabor filter. The proposed method was tested on a publicly available database of 247 chest radiographs. Results show that this method outperformed greatly with accuracy of 96.25% for lung segmentation, also we will show improving the conspicuity of lung nodules by rib suppression with local nodule contrast measures. Because there is no additional radiation exposure or specialized equipment required, it could also be applied to bedside portable chest x-rays. In addition to simplicity of these fully automatic methods, lung segmentation and rib suppression algorithms are performed accurately with low computation time and robustness to noise because of the suitable enhancement procedure.

  2. Video-based noncooperative iris image segmentation.

    Science.gov (United States)

    Du, Yingzi; Arslanturk, Emrah; Zhou, Zhi; Belcher, Craig

    2011-02-01

    In this paper, we propose a video-based noncooperative iris image segmentation scheme that incorporates a quality filter to quickly eliminate images without an eye, employs a coarse-to-fine segmentation scheme to improve the overall efficiency, uses a direct least squares fitting of ellipses method to model the deformed pupil and limbic boundaries, and develops a window gradient-based method to remove noise in the iris region. A remote iris acquisition system is set up to collect noncooperative iris video images. An objective method is used to quantitatively evaluate the accuracy of the segmentation results. The experimental results demonstrate the effectiveness of this method. The proposed method would make noncooperative iris recognition or iris surveillance possible.

  3. Remote Sensing Image Segmentation with Probabilistic Neural Networks

    Institute of Scientific and Technical Information of China (English)

    LIU Gang

    2005-01-01

    This paper focuses on the image segmentation with probabilistic neural networks (PNNs). Back propagation neural networks (BpNNs) and multi perceptron neural networks (MLPs) are also considered in this study. Especially, this paper investigates the implementation of PNNs in image segmentation and optimal processing of image segmentation with a PNN. The comparison between image segmentations with PNNs and with other neural networks is given. The experimental results show that PNNs can be successfully applied to image segmentation for good results.

  4. MEDICAL IMAGE SEGMENTATION FOR ANATOMICAL KNOWLEDGE EXTRACTION

    Directory of Open Access Journals (Sweden)

    Ms Maya Eapen

    2014-01-01

    Full Text Available Computed Tomography-Angiography (CTA images of the abdomen, followed by precise segmentation and subsequent computation of shape based features of liver play an important role in hepatic surgery, patient/donor diagnosis during liver transplantation and at various treatment stages. Nevertheless, the issues like intensity similarity and Partial Volume Effect (PVE between the neighboring organs; left the task of liver segmentation critical. The accurate segmentation of liver helps the surgeons to perfectly classify the patients based on their liver anatomy which in turn helps them in the treatment decision phase. In this study, we propose an effective Advanced Region Growing (ARG algorithm for segmentation of liver from CTA images. The performance of the proposed technique was tested with several CTA images acquired across a wide range of patients. The proposed ARG algorithm identifies the liver regions on the images based on the statistical features (intensity distribution and orientation value. The proposed technique addressed the aforementioned issues and been evaluated both quantitatively and qualitatively. For quantitative analysis proposed method was compared with manual segmentation (gold standard. The method was also compared with standard region growing.

  5. Automatic Contour Extraction from 2D Image

    Directory of Open Access Journals (Sweden)

    Panagiotis GIOANNIS

    2011-03-01

    Full Text Available Aim: To develop a method for automatic contour extraction from a 2D image. Material and Method: The method is divided in two basic parts where the user initially chooses the starting point and the threshold. Finally the method is applied to computed tomography of bone images. Results: An interesting method is developed which can lead to a successful boundary extraction of 2D images. Specifically data extracted from a computed tomography images can be used for 2D bone reconstruction. Conclusions: We believe that such an algorithm or part of it can be applied on several other applications for shape feature extraction in medical image analysis and generally at computer graphics.

  6. Performance evaluation of image segmentation algorithms on microscopic image data.

    Science.gov (United States)

    Beneš, Miroslav; Zitová, Barbara

    2015-01-01

    In our paper, we present a performance evaluation of image segmentation algorithms on microscopic image data. In spite of the existence of many algorithms for image data partitioning, there is no universal and 'the best' method yet. Moreover, images of microscopic samples can be of various character and quality which can negatively influence the performance of image segmentation algorithms. Thus, the issue of selecting suitable method for a given set of image data is of big interest. We carried out a large number of experiments with a variety of segmentation methods to evaluate the behaviour of individual approaches on the testing set of microscopic images (cross-section images taken in three different modalities from the field of art restoration). The segmentation results were assessed by several indices used for measuring the output quality of image segmentation algorithms. In the end, the benefit of segmentation combination approach is studied and applicability of achieved results on another representatives of microscopic data category - biological samples - is shown.

  7. Neural network segmentation of magnetic resonance images

    Science.gov (United States)

    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

  8. Segmenting Images for a Better Diagnosis

    Science.gov (United States)

    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.

  9. EFFICIENT IMAGE SEGMENTATION FOR SEMANTIC OBJECT GENERATION

    Institute of Scientific and Technical Information of China (English)

    Chen Xiaotang; Yu Yinglin

    2002-01-01

    This letter presents an efficient and simple image segmentation method for semantic object spatial segmentation. First, the image is filtered using contour-preserving filters. Then it is quasi-flat labeled. The small regions near the contour are classified as uncertain regions and are eliminated by region growing and merging. Further region merging is used to reduce the region number. The simulation results show its efficiency and simplicity. It can preserve the semantic object shape while emphasize on the perceptual complex part of the object. So it conforms to the human visual perception very well.

  10. EFFICIENT IMAGE SEGMENTATION FOR SEMANTIC OBJECT GENERATION

    Institute of Scientific and Technical Information of China (English)

    ChenXiaotang; YuYinglin

    2002-01-01

    This letter presents an efficient and simple image segmentation method for semantic object spatial segmentation.First,the image is filtered using contour-preserving filters.Then it is quasi-flat labeled.The small regions near the contour are classified as uncertain regions and are eliminated by region growing and merging.Further region merging is used to reduce the region number.The simulation results show its efficiency and simplicity,It can preserve the semantic object shape while emphasize on the perceptual complex part of the object.So it conforms to the humann visual perception very well.

  11. Automated 3D renal segmentation based on image partitioning

    Science.gov (United States)

    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.

  12. Knowledge-based segmentation for automatic Map interpretation

    NARCIS (Netherlands)

    Hartog, J. den; Kate, T. ten; Gerbrands, J.

    1996-01-01

    In this paper, a knowledge-based framework for the top-down interpretation and segmentation of maps is presented. The interpretation is based on a priori knowledge about map objects, their mutual spatial relationships and potential segmentation problems. To reduce computational costs, a global segme

  13. Integration of Morphology and Graph-based Techniques for Fully Automatic Liver Segmentation

    Directory of Open Access Journals (Sweden)

    Hans Burkhardt

    2010-09-01

    Full Text Available Here a fully 3D algorithm for automatic liver segmentation from CT volumetric datasets is presented. The algorithm starts by smoothing the original volume using anisotropic diffusion. The coarse liver region is obtained from the threshold process that is based on a priori knowledge. Then, several morphological operations is performed such as operating the liver to detach the unwanted region connected to the liver and finding the largest component using the connected component labeling (CCL algorithm. At this stage, both 3D and 2D CCL is done subsequently. However, in 2D CCL, the adjacent slices are also affected from current slice changes. Finally, the boundary of the liver is refined using graph-cuts solver. Our algorithm does not require any user interaction or training datasets to be used. The algorithm has been evaluated on 10 CT scans of the liver and the results are encouraging to poor quality of images.

  14. GAUSSIAN MIXTURE MODEL BASED LEVEL SET TECHNIQUE FOR AUTOMATED SEGMENTATION OF CARDIAC MR IMAGES

    Directory of Open Access Journals (Sweden)

    G. Dharanibai,

    2011-04-01

    Full Text Available In this paper we propose a Gaussian Mixture Model (GMM integrated level set method for automated segmentation of left ventricle (LV, right ventricle (RV and myocardium from short axis views of cardiacmagnetic resonance image. By fitting GMM to the image histogram, global pixel intensity characteristics of the blood pool, myocardium and background are estimated. GMM provides initial segmentation andthe segmentation solution is regularized using level set. Parameters for controlling the level set evolution are automatically estimated from the Bayesian inference classification of pixels. We propose a new speed function that combines edge and region information that stops the evolving level set at the myocardial boundary. Segmentation efficacy is analyzed qualitatively via visual inspection. Results show the improved performance of our of proposed speed function over the conventional Bayesian driven adaptive speed function in automatic segmentation of myocardium

  15. Unsupervised segmentation of medical image based on difference of mutual information

    Institute of Scientific and Technical Information of China (English)

    L(U) Qingwen; CHEN Wufan

    2006-01-01

    In the scope of medical image processing, segmentation is important and difficult. There are still two problems which trouble us in this field. One is how to determine the number of clusters in an image and the other is how to segment medical images containing lesions. A new segmentation method called DDC, based on difference of mutual information (dMI) and pixon, is proposed in this paper. Experiments demonstrate that dMI shows one kind of intrinsic relationship between the segmented image and the original one and so it can be used to well determine the number of clusters. Furthermore, multi-modality medical images with lesions can be automatically and successfully segmented by DDC method.

  16. Robust protein microarray image segmentation using improved seeded region growing algorithm

    Institute of Scientific and Technical Information of China (English)

    Liqiang Wang(王立强); Xuxiang Ni(倪旭翔); Zukang Lu(陆祖康)

    2003-01-01

    Protein microarray technology has recently emerged as a powerful tool for biomedical research. Before automatic analysis the protein microarray images, protein spots in the images must be determined appropriately by spot segmentation algorithm. In this paper, an improved seeded region growing (ISRG)algorithm for protein microarray segmentation is presented, the seeds are obtained by finding the positions of the printed spots, and the protein spot regions are grown through these seeds. The experiment results show that the presented algorithm is accurate for adaptive shape segmentation and robust for protein microarray images contaminated by noise.

  17. Text line Segmentation of Curved Document Images

    Directory of Open Access Journals (Sweden)

    Anusree.M

    2014-05-01

    Full Text Available Document image analysis has been widely used in historical and heritage studies, education and digital library. Document image analytical techniques are mainly used for improving the human readability and the OCR quality of the document. During the digitization, camera captured images contain warped document due perspective and geometric distortions. The main difficulty is text line detection in the document. Many algorithms had been proposed to address the problem of printed document text line detection, but they failed to extract text lines in curved document. This paper describes a segmentation technique that detects the curled text line in camera captured document images.

  18. Image segmentation of small defects in precision weldments with complex structure

    Institute of Scientific and Technical Information of China (English)

    Shi Duanhu; Gang Tie; Yuan Yuan; Yang Shuangyang

    2007-01-01

    In this paper, the X-ray nondestructive test method of small defects in precision weldments with complex structure was presented. To resolve the difficulty of defect segmentation in variable grey image, the image processing based on Visual Basic programming method was adopted. The methods of automatic contrast and partial grey stretch were used to enhance the X-ray detection image which has relatively low contrast, then automatic threshold method was carried out to segment the two high intensity zones, and weld zones which contain the small defects was extracted. Smoothing and sharpen processing were proceeded on the extracted weld zones, and small defects in X-ray detection image of weldments with complex structure were segmented by using the method of background subtraction in the end. The effects of raster were eliminated, and because of that the image processing was only proceeded on the extracted weld zones, the calculated speed using the above provided algorithm was improved.

  19. A Combined Random Forests and Active Contour Model Approach for Fully Automatic Segmentation of the Left Atrium in Volumetric MRI

    Science.gov (United States)

    Luo, Gongning

    2017-01-01

    Segmentation of the left atrium (LA) from cardiac magnetic resonance imaging (MRI) datasets is of great importance for image guided atrial fibrillation ablation, LA fibrosis quantification, and cardiac biophysical modelling. However, automated LA segmentation from cardiac MRI is challenging due to limited image resolution, considerable variability in anatomical structures across subjects, and dynamic motion of the heart. In this work, we propose a combined random forests (RFs) and active contour model (ACM) approach for fully automatic segmentation of the LA from cardiac volumetric MRI. Specifically, we employ the RFs within an autocontext scheme to effectively integrate contextual and appearance information from multisource images together for LA shape inferring. The inferred shape is then incorporated into a volume-scalable ACM for further improving the segmentation accuracy. We validated the proposed method on the cardiac volumetric MRI datasets from the STACOM 2013 and HVSMR 2016 databases and showed that it outperforms other latest automated LA segmentation methods. Validation metrics, average Dice coefficient (DC) and average surface-to-surface distance (S2S), were computed as 0.9227 ± 0.0598 and 1.14 ± 1.205 mm, versus those of 0.6222–0.878 and 1.34–8.72 mm, obtained by other methods, respectively. PMID:28316992

  20. A Combined Random Forests and Active Contour Model Approach for Fully Automatic Segmentation of the Left Atrium in Volumetric MRI

    Directory of Open Access Journals (Sweden)

    Chao Ma

    2017-01-01

    Full Text Available Segmentation of the left atrium (LA from cardiac magnetic resonance imaging (MRI datasets is of great importance for image guided atrial fibrillation ablation, LA fibrosis quantification, and cardiac biophysical modelling. However, automated LA segmentation from cardiac MRI is challenging due to limited image resolution, considerable variability in anatomical structures across subjects, and dynamic motion of the heart. In this work, we propose a combined random forests (RFs and active contour model (ACM approach for fully automatic segmentation of the LA from cardiac volumetric MRI. Specifically, we employ the RFs within an autocontext scheme to effectively integrate contextual and appearance information from multisource images together for LA shape inferring. The inferred shape is then incorporated into a volume-scalable ACM for further improving the segmentation accuracy. We validated the proposed method on the cardiac volumetric MRI datasets from the STACOM 2013 and HVSMR 2016 databases and showed that it outperforms other latest automated LA segmentation methods. Validation metrics, average Dice coefficient (DC and average surface-to-surface distance (S2S, were computed as 0.9227±0.0598 and 1.14±1.205 mm, versus those of 0.6222–0.878 and 1.34–8.72 mm, obtained by other methods, respectively.

  1. An algorithm of image segmentation for overlapping grain image

    Institute of Scientific and Technical Information of China (English)

    WANG Zhi; JIN Guang; SUN Xiao-wei

    2005-01-01

    Aiming at measurement of granularity size of nonmetal grain, an algorithm of image segmentation and parameter calculation for microscopic overlapping grain image was studied. This algorithm presents some new attributes of graph sequence from discrete attribute of graph,and consequently achieves the geometrical characteristics from input graph, and the new graph sequence in favor of image segmentation is recombined. The conception that image edge denoted with "twin-point" is put forward, base on geometrical characters of point, image edge is transformed into serial edge, and on recombined serial image edge, based on direction vector definition of line and some additional restricted conditions, the segmentation twin-points are searched with, thus image segmentation is accomplished. Serial image edge is transformed into twin-point pattern, to realize calculation of area and granularity size of nonmetal grain. The inkling and uncertainty on selection of structure element which base on mathematical morphology are avoided in this algorithm, and image segmentation and parameter calculation are realized without changing grain's self statistical characters.

  2. Image Semantic Automatic Annotation by Relevance Feedback

    Institute of Scientific and Technical Information of China (English)

    ZHANG Tong-zhen; SHEN Rui-min

    2007-01-01

    A large semantic gap exists between content based index retrieval (CBIR) and high-level semantic, additional semantic information should be attached to the images, it refers in three respects including semantic representation model, semantic information building and semantic retrieval techniques. In this paper, we introduce an associated semantic network and an automatic semantic annotation system. In the system, a semantic network model is employed as the semantic representation model, it uses semantic keywords, linguistic ontology and low-level features in semantic similarity calculating. Through several times of users' relevance feedback, semantic network is enriched automatically. To speed up the growth of semantic network and get a balance annotation, semantic seeds and semantic loners are employed especially.

  3. Automatic Road Pavement Assessment with Image Processing: Review and Comparison

    Directory of Open Access Journals (Sweden)

    Sylvie Chambon

    2011-01-01

    Full Text Available In the field of noninvasive sensing techniques for civil infrastructures monitoring, this paper addresses the problem of crack detection, in the surface of the French national roads, by automatic analysis of optical images. The first contribution is a state of the art of the image-processing tools applied to civil engineering. The second contribution is about fine-defect detection in pavement surface. The approach is based on a multi-scale extraction and a Markovian segmentation. Third, an evaluation and comparison protocol which has been designed for evaluating this difficult task—the road pavement crack detection—is introduced. Finally, the proposed method is validated, analysed, and compared to a detection approach based on morphological tools.

  4. Medical image segmentation using improved FCM

    Institute of Scientific and Technical Information of China (English)

    ZHANG XiaoFeng; ZHANG CaiMing; TANG WenJing; WEI ZhenWen

    2012-01-01

    Image segmentation is one of the most important problems in medical image processing,and the existence of partial volume effect and other phenomena makes the problem much more complex. Fuzzy Cmeans,as an effective tool to deal with PVE,however,is faced with great challenges in efficiency.Aiming at this,this paper proposes one improved FCM algorithm based on the histogram of the given image,which will be denoted as HisFCM and divided into two phases.The first phase will retrieve several intervals on which to compute cluster centroids,and the second one will perform image segmentation based on improved FCM algorithm.Compared with FCM and other improved algorithms,HisFCM is of much higher efficiency with satisfying results.Experiments on medical images show that HisFCM can achieve good segmentation results in less than 0.1 second,and can satisfy real-time requirements of medical image processing.

  5. A Novel Approach for Unsupervised Segmentation of Homogeneous Regions in Gray-scale Images

    Institute of Scientific and Technical Information of China (English)

    王郁中; 杨杰; 周大可; 郑元杰

    2004-01-01

    An improved approach for JSEG is presented for unsupervised segmentation of homogeneous regions in gray-scale images. Instead of intensity quantization, an automatic classification method based on scale space-based clustering is used for nonparametric clustering of image data set. Then EM algorithm with classification achieved by space-based classification scheme as initial data used to achieve Gaussian mixture modelling of image data set that is utilized for the calculation of soft J value. Original region growing algorithm is then used to segment the image based on the multiscale soft J-images. Experiments show that the new method can overcome the limitations of JSEG successfully.

  6. Automatic Segmentation of Abdominal Adipose Tissue in MRI

    DEFF Research Database (Denmark)

    Mosbech, Thomas Hammershaimb; Pilgaard, Kasper; Vaag, Allan;

    2011-01-01

    of intensity in-homogeneities. This effect is estimated by a thin plate spline extended to fit two classes of automatically sampled intensity points in 3D. Adipose tissue pixels are labelled with fuzzy c-means clustering and locally determined thresholds. The visceral and subcutaneous adipose tissue...

  7. Automatic Segmentation and Deep Learning of Bird Sounds

    NARCIS (Netherlands)

    Koops, Hendrik Vincent; Van Balen, J.M.H.; Wiering, F.

    2015-01-01

    We present a study on automatic birdsong recognition with deep neural networks using the BIRDCLEF2014 dataset. Through deep learning, feature hierarchies are learned that represent the data on several levels of abstraction. Deep learning has been applied with success to problems in fields such as mu

  8. Knowledge Automatic Indexing Based on Concept Lexicon and Segmentation Algorithm

    Institute of Scientific and Technical Information of China (English)

    WANG Lan-cheng; JIANG Dan; LE Jia-jin

    2005-01-01

    This paper is based on two existing theories about automatic indexing of thematic knowledge concept. The prohibit-word table with position information has been designed. The improved Maximum Matching-Minimum Backtracking method has been researched. Moreover it has been studied on improved indexing algorithm and application technology based on rules and thematic concept word table.

  9. AN AUTOMATIC SEGMENTATION METHOD FOR MOVING OBJECTS BASED ON THE SPATIAL-TEMPORAL INFORMATION OF VIDEO

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

    The new MPEG-4 video coding standard enables content-based functions. In order to support the new standard, frames should be decomposed into Video Object Planes (VOP),each VOP representing a moving object. This paper proposes an image segmentation method to separate moving objects from image sequences. The proposed method utilizes the spatial-temporal information. Spatial segmentation is applied to divide each image into connected areas and to find precise object boundaries of moving objects. To locate moving objects in image sequences,two consecutive image frames in the temporal direction are examined and a hypothesis testing is performed with Neyman-Pearson criterion. Spatial segmentation produces a spatial segmentation mask, and temporal segmentation yields a change detection mask that indicates moving objects and the background. Then spatial-temporal merging can be used to get the final results. This method has been tested on several images. Experimental results show that this segmentation method is efficient.

  10. Automatic Segmentation for Reach/frequency Estimation of Newspaper Sections and Internet Papers

    DEFF Research Database (Denmark)

    Mortensen, Peter Stendahl; Arnaa, Kristian

    1999-01-01

    segments are created, individualising the reading probabilities more than when using frequency groups. Two examples are presented: First, an experiment in which heavy users of the Internet are sampled on the Internet itself. The readers of each "Internet paper" are segmented by variables on their use......This paper will present a new way of estimating reach and frequency without asking the frequency question or conducting double interviewing. Instead, the sample is segmented automatically by a CHAID-analysis, maximising the differences in reading probabilities among the segments. Typically, many...

  11. Polynomial-time solutions to image segmentation

    Energy Technology Data Exchange (ETDEWEB)

    Asano, Tetsuo [Osaka Electro-Communication Univ., Neyagawa (Japan); Chen, D.Z. [Notre Dame, South Bend, IN (United States); Katoh, Naoki [Kobe Univ. of Commerce (Japan)

    1996-12-31

    Separating an object in an image from its background is a central problem (called segmentation) in pattern recognition and computer vision. In this paper, we study the complexity of the segmentation problem, assuming that the object forms a connected region in an intensity image. We show that the optimization problem of separating a connected region in an n-pixel grid is NP-hard under the interclass variance, a criterion that is used in discriminant analysis. More importantly, we consider the basic case in which the object is separated by two x-monotone curves (i.e., the object itself is x-monotone), and present polynomial-time algorithms for computing exact and approximate optimal segmentation. Our main algorithm for exact optimal segmentation by two x-monotone curves runs in O(n{sup 2}) time; this algorithm is based on several techniques such as a parametric optimization formulation, a hand-probing algorithm for the convex hull of an unknown point set, and dynamic programming using fast matrix searching. Our efficient approximation scheme obtains an {epsilon}-approximate solution in O({epsilon}{sup -1} n log L) time, where {epsilon} is any fixed constant with 1 > {epsilon} > 0, and L is the total sum of the absolute values of brightness levels of the image.

  12. Mammographic images segmentation using texture descriptors.

    Science.gov (United States)

    Mascaro, Angelica A; Mello, Carlos A B; Santos, Wellington P; Cavalcanti, George D C

    2009-01-01

    Tissue classification in mammography can help the diagnosis of breast cancer by separating healthy tissue from lesions. We present herein the use of three texture descriptors for breast tissue segmentation purposes: the Sum Histogram, the Gray Level Co-Occurrence Matrix (GLCM) and the Local Binary Pattern (LBP). A modification of the LBP is also proposed for a better distinction of the tissues. In order to segment the image into its tissues, these descriptors are compared using a fidelity index and two clustering algorithms: k-Means and SOM (Self-Organizing Maps).

  13. Fully automatic segmentation of arbitrarily shaped fiducial markers in cone-beam CT projections

    DEFF Research Database (Denmark)

    Bertholet, Jenny; Wan, Hanlin; Toftegaard, Jakob;

    2017-01-01

    algorithm and the new DPTB algorithm was quantified as the 2D segmentation error (pixels) compared to a manual ground truth segmentation for 97 markers in the projection images of CBCT scans of 40 patients. Also the fraction of wrong segmentations, defined as 2D errors larger than 5 pixels, was calculated....... The mean 2D segmentation error of DP was reduced from 4.1 pixels to 3.0 pixels by DPTB, while the fraction of wrong segmentations was reduced from 17.4% to 6.8%. DPTB allowed rejection of uncertain segmentations as deemed by a low normalized cross-correlation coefficient and contrast-to-noise ratio....... For a rejection rate of 9.97%, the sensitivity in detecting wrong segmentations was 67% and the specificity was 94%. The accepted segmentations had a mean segmentation error of 1.8 pixels and 2.5% wrong segmentations....

  14. Image quality, compression and segmentation in medicine.

    Science.gov (United States)

    Morgan, Pam; Frankish, Clive

    2002-12-01

    This review considers image quality in the context of the evolving technology of image compression, and the effects image compression has on perceived quality. The concepts of lossless, perceptually lossless, and diagnostically lossless but lossy compression are described, as well as the possibility of segmented images, combining lossy compression with perceptually lossless regions of interest. The different requirements for diagnostic and training images are also discussed. The lack of established methods for image quality evaluation is highlighted and available methods discussed in the light of the information that may be inferred from them. Confounding variables are also identified. Areas requiring further research are illustrated, including differences in perceptual quality requirements for different image modalities, image regions, diagnostic subtleties, and tasks. It is argued that existing tools for measuring image quality need to be refined and new methods developed. The ultimate aim should be the development of standards for image quality evaluation which take into consideration both the task requirements of the images and the acceptability of the images to the users.

  15. Segmentation and registration duality from echographic images by use of physiological and morphological knowledge; Segmentation et recalage d`images echographiques par utilisation de connaissances physiologiques et morphologiques

    Energy Technology Data Exchange (ETDEWEB)

    Ionescu, G

    1998-12-04

    Echographic imaging could potentially play a major role in the field of Computer Assisted Surgery (CAS). For doctors and surgeons to make full use of tool in planning and executing surgical operations, they also need user-friendly automatic software based on fast, precise and reliable algorithms. The main goal of this thesis is to take advantage of the segmentation/registration duality to extract the relevant information from echo graphical images. This information will allow the precise and automatic registration both of anatomical structures contained in the pre-operative model and of per-operative data contained in echographic images. The result of registration will be further to guide a computer-assisted tool. In the first part we propose different methods for filtering, segmentation and calibration of echographic images. The development of fast, precise and reliable algorithms is emphasized. The second part concerns the segmentation-registration duality and the corrections of elastic deformations of soft tissues. High-level segmentation algorithms for echographic images were developed. They are based on results of low -level segmentation, a priori anatomical knowledge as well as on information provided by the pre-operative model. The third part deals with detailed descriptions of applications and interpretation of results. The cases studied include: screwing inside the vertebral pedicles, ilio-sacral screwing, prostatic radiotherapy and puncture of pericardial effusion. Future developments for this approach are discussed. (author)

  16. A HYBRID METHOD FOR AUTOMATIC COUNTING OF MICROORGANISMS IN MICROSCOPIC IMAGES

    Directory of Open Access Journals (Sweden)

    P.Kalavathi

    2016-03-01

    Full Text Available Microscopic image analysis is an essential process to enable the automatic enumeration and quantitative analysis of microbial images. There are several system are available for numerating microbial growth. Some of the existing method may be inefficient to accurately count the overlapped microorganisms. Therefore, in this paper we proposed an efficient method for automatic segmentation and counting of microorganisms in microscopic images. This method uses a hybrid approach based on morphological operation, active contour model and counting by region labelling process. The colony count value obtained by this proposed method is compared with the manual count and the count value obtained from the existing method

  17. Automatic identification of IASLC-defined mediastinal lymph node stations on CT scans using multi-atlas organ segmentation

    Science.gov (United States)

    Hoffman, Joanne; Liu, Jiamin; Turkbey, Evrim; Kim, Lauren; Summers, Ronald M.

    2015-03-01

    Station-labeling of mediastinal lymph nodes is typically performed to identify the location of enlarged nodes for cancer staging. Stations are usually assigned in clinical radiology practice manually by qualitative visual assessment on CT scans, which is time consuming and highly variable. In this paper, we developed a method that automatically recognizes the lymph node stations in thoracic CT scans based on the anatomical organs in the mediastinum. First, the trachea, lungs, and spines are automatically segmented to locate the mediastinum region. Then, eight more anatomical organs are simultaneously identified by multi-atlas segmentation. Finally, with the segmentation of those anatomical organs, we convert the text definitions of the International Association for the Study of Lung Cancer (IASLC) lymph node map into patient-specific color-coded CT image maps. Thus, a lymph node station is automatically assigned to each lymph node. We applied this system to CT scans of 86 patients with 336 mediastinal lymph nodes measuring equal or greater than 10 mm. 84.8% of mediastinal lymph nodes were correctly mapped to their stations.

  18. Semi-automatic liver tumor segmentation with hidden Markov measure field model and non-parametric distribution estimation.

    Science.gov (United States)

    Häme, Yrjö; Pollari, Mika

    2012-01-01

    A novel liver tumor segmentation method for CT images is presented. The aim of this work was to reduce the manual labor and time required in the treatment planning of radiofrequency ablation (RFA), by providing accurate and automated tumor segmentations reliably. The developed method is semi-automatic, requiring only minimal user interaction. The segmentation is based on non-parametric intensity distribution estimation and a hidden Markov measure field model, with application of a spherical shape prior. A post-processing operation is also presented to remove the overflow to adjacent tissue. In addition to the conventional approach of using a single image as input data, an approach using images from multiple contrast phases was developed. The accuracy of the method was validated with two sets of patient data, and artificially generated samples. The patient data included preoperative RFA images and a public data set from "3D Liver Tumor Segmentation Challenge 2008". The method achieved very high accuracy with the RFA data, and outperformed other methods evaluated with the public data set, receiving an average overlap error of 30.3% which represents an improvement of 2.3% points to the previously best performing semi-automatic method. The average volume difference was 23.5%, and the average, the RMS, and the maximum surface distance errors were 1.87, 2.43, and 8.09 mm, respectively. The method produced good results even for tumors with very low contrast and ambiguous borders, and the performance remained high with noisy image data.

  19. Image segmentation with a unified graphical model.

    Science.gov (United States)

    Zhang, Lei; Ji, Qiang

    2010-08-01

    We propose a unified graphical model that can represent both the causal and noncausal relationships among random variables and apply it to the image segmentation problem. Specifically, we first propose to employ Conditional Random Field (CRF) to model the spatial relationships among image superpixel regions and their measurements. We then introduce a multilayer Bayesian Network (BN) to model the causal dependencies that naturally exist among different image entities, including image regions, edges, and vertices. The CRF model and the BN model are then systematically and seamlessly combined through the theories of Factor Graph to form a unified probabilistic graphical model that captures the complex relationships among different image entities. Using the unified graphical model, image segmentation can be performed through a principled probabilistic inference. Experimental results on the Weizmann horse data set, on the VOC2006 cow data set, and on the MSRC2 multiclass data set demonstrate that our approach achieves favorable results compared to state-of-the-art approaches as well as those that use either the BN model or CRF model alone.

  20. The segmentation of FMI image based on 2-D dyadic wavelet transform

    Science.gov (United States)

    Liu, Rui-Lin; Wu, Yue-Qi; Liu, Jian-Hua; Ma, Yong

    2005-06-01

    A key aspect in extracting quantitative information from FMI logs is to segment the FMI image to get images of pores, vugs and fractures. A segmentation method based on the dyadic wavelet transform in 2-D is introduced in this paper. The first step is to find all the edge pixels of the FMI image using the 2-D wavelet transform. The second step is to calculate a segmentation threshold based on the average value of the edge pixels. Field data processing examples show that sub-images of vugs and fractures can be correctly separated from original FMI data continuously and automatically along the depth axis. The image segmentation lays the foundation for in-situ parameter calculation.

  1. Sensitivity Based Segmentation and Identification in Automatic Speech Recognition.

    Science.gov (United States)

    1984-03-30

    by a network constructed from phonemic, phonetic , and phonological rules. Regardless of the speech processing system used, Klatt 1 2 has described...analysis, and its use in the segmentation and identification of the phonetic units of speech, that was initiated during the 1982 Summer Faculty Research...practicable framework for incorporation of acoustic- phonetic variance as well as time and talker normalization. XOI iF- ? ’:: .:- .- . . l ] 2 D

  2. Mixture Segmentation of Multispectral MR Brain Images for Multiple Sclerosis

    Directory of Open Access Journals (Sweden)

    Lihong Li

    2005-04-01

    Full Text Available We present a fully automatic mixture model-based tissue classification of multispectral (T1- and T2-weighted magnetic resonance (MR brain images. Unlike the conventional hard classification with a unique label for each voxel, our method models a mixture to estimate the partial volumes (PV of multiple tissue types within a voxel. A new Markov random field (MRF model is proposed to reflect the spatial information of tissue mixtures. A mixture classification algorithm is performed by the maximum a posterior (MAP criterion, where the expectation maximization (EM algorithm is utilized to estimate model parameters. The algorithm interleaves segmentation with parameter estimation and improves classification in an iterative manner. The presented method is evaluated by clinical MR image datasets for quantification of brain volumes and multiple sclerosis (MS.

  3. Automated bone segmentation from dental CBCT images using patch-based sparse representation and convex optimization

    Energy Technology Data Exchange (ETDEWEB)

    Wang, Li; Gao, Yaozong; Shi, Feng; Liao, Shu; Li, Gang [Department of Radiology and BRIC, University of North Carolina at Chapel Hill, North Carolina 27599 (United States); Chen, Ken Chung [Department of Oral and Maxillofacial Surgery, Houston Methodist Hospital Research Institute, Houston, Texas 77030 and Department of Stomatology, National Cheng Kung University Medical College and Hospital, Tainan, Taiwan 70403 (China); Shen, Steve G. F.; Yan, Jin [Department of Oral and Craniomaxillofacial Surgery and Science, Shanghai Ninth People' s Hospital, Shanghai Jiao Tong University College of Medicine, Shanghai, China 200011 (China); Lee, Philip K. M.; Chow, Ben [Hong Kong Dental Implant and Maxillofacial Centre, Hong Kong, China 999077 (China); Liu, Nancy X. [Department of Oral and Maxillofacial Surgery, Houston Methodist Hospital Research Institute, Houston, Texas 77030 and Department of Oral and Maxillofacial Surgery, Peking University School and Hospital of Stomatology, Beijing, China 100050 (China); Xia, James J. [Department of Oral and Maxillofacial Surgery, Houston Methodist Hospital Research Institute, Houston, Texas 77030 (United States); Department of Surgery (Oral and Maxillofacial Surgery), Weill Medical College, Cornell University, New York, New York 10065 (United States); Department of Oral and Craniomaxillofacial Surgery and Science, Shanghai Ninth People' s Hospital, Shanghai Jiao Tong University College of Medicine, Shanghai, China 200011 (China); Shen, Dinggang, E-mail: dgshen@med.unc.edu [Department of Radiology and BRIC, University of North Carolina at Chapel Hill, North Carolina 27599 and Department of Brain and Cognitive Engineering, Korea University, Seoul, 136701 (Korea, Republic of)

    2014-04-15

    Purpose: Cone-beam computed tomography (CBCT) is an increasingly utilized imaging modality for the diagnosis and treatment planning of the patients with craniomaxillofacial (CMF) deformities. Accurate segmentation of CBCT image is an essential step to generate three-dimensional (3D) models for the diagnosis and treatment planning of the patients with CMF deformities. However, due to the poor image quality, including very low signal-to-noise ratio and the widespread image artifacts such as noise, beam hardening, and inhomogeneity, it is challenging to segment the CBCT images. In this paper, the authors present a new automatic segmentation method to address these problems. Methods: To segment CBCT images, the authors propose a new method for fully automated CBCT segmentation by using patch-based sparse representation to (1) segment bony structures from the soft tissues and (2) further separate the mandible from the maxilla. Specifically, a region-specific registration strategy is first proposed to warp all the atlases to the current testing subject and then a sparse-based label propagation strategy is employed to estimate a patient-specific atlas from all aligned atlases. Finally, the patient-specific atlas is integrated into amaximum a posteriori probability-based convex segmentation framework for accurate segmentation. Results: The proposed method has been evaluated on a dataset with 15 CBCT images. The effectiveness of the proposed region-specific registration strategy and patient-specific atlas has been validated by comparing with the traditional registration strategy and population-based atlas. The experimental results show that the proposed method achieves the best segmentation accuracy by comparison with other state-of-the-art segmentation methods. Conclusions: The authors have proposed a new CBCT segmentation method by using patch-based sparse representation and convex optimization, which can achieve considerably accurate segmentation results in CBCT

  4. Heat Equation to 3D Image Segmentation

    Directory of Open Access Journals (Sweden)

    Nikolay Sirakov

    2006-04-01

    Full Text Available This paper presents a new approach, capable of 3D image segmentation and objects' surface reconstruction. The main advantages of the method are: large capture range; quick segmentation of a 3D scene/image to regions; multiple 3D objects reconstruction. The method uses centripetal force and penalty function to segment the entire 3D scene/image to regions containing a single 3D object. Each region is inscribed in a convex, smooth closed surface, which defines a centripetal force. Then the surface is evolved by the geometric heat differential equation toward the force's direction. The penalty function is defined to stop evolvement of those surface patches, whose normal vectors encountered object's surface. On the base of the theoretical model Forward Difference Algorithm was developed and coded by Mathematica. Stability convergence condition, truncation error and calculation complexity of the algorithm are determined. The obtained results, advantages and disadvantages of the method are discussed at the end of this paper.

  5. Texture Image Segmentation Based on Nonlinear Diffusion%基于非线性扩散的纹理分割

    Institute of Scientific and Technical Information of China (English)

    张煜

    2008-01-01

    A texture image segmentation based on nonlinear diffusion is presented. The scale of texture can be measured during the process of nonlinear diffusion. A smooth 5-channel vector image with edge preserved, which is composed of inten- sity, scale and orientation of texture image, can be achieved by coupled nonlinear diffusion. A multi-channel statistical region active contour is employed to segment this vector image. The method can be seen as a kind of unsupervised segmentation because parameters are not sensitive to different texture images. Experimental results show its high efficiency in the semi- automatic extraction of texture image.

  6. Automatic diagnosis of retinal diseases from color retinal images

    CERN Document Server

    Jayanthi, D; SwarnaParvathi, S

    2010-01-01

    Teleophthalmology holds a great potential to improve the quality, access, and affordability in health care. For patients, it can reduce the need for travel and provide the access to a superspecialist. Ophthalmology lends itself easily to telemedicine as it is a largely image based diagnosis. The main goal of the proposed system is to diagnose the type of disease in the retina and to automatically detect and segment retinal diseases without human supervision or interaction. The proposed system will diagnose the disease present in the retina using a neural network based classifier.The extent of the disease spread in the retina can be identified by extracting the textural features of the retina. This system will diagnose the following type of diseases: Diabetic Retinopathy and Drusen.

  7. A comparative study on medical image segmentation methods

    Directory of Open Access Journals (Sweden)

    Praylin Selva Blessy SELVARAJ ASSLEY

    2014-03-01

    Full Text Available Image segmentation plays an important role in medical images. It has been a relevant research area in computer vision and image analysis. Many segmentation algorithms have been proposed for medical images. This paper makes a review on segmentation methods for medical images. In this survey, segmentation methods are divided into five categories: region based, boundary based, model based, hybrid based and atlas based. The five different categories with their principle ideas, advantages and disadvantages in segmenting different medical images are discussed.

  8. An Improved Image Segmentation Based on Mean Shift Algorithm

    Institute of Scientific and Technical Information of China (English)

    CHENHanfeng; QIFeihu

    2003-01-01

    Gray image segmentation is to segment an image into some homogeneous regions and only one gray level is defined for each region as the result. These grayl evels are called major gray levels. Mean shift algorithm(MSA) has shown its efficiency in image segmentation. An improved gray image segmentation method based on MSAis proposed in this paper since usual image segmentation methods based on MSA often fail in segmenting imageswith weak edges. Corrupted block and its J-value are defined firstly in the proposed method. Then, J-matrix gotten from corrupted blocks are proposed to measure whether weak edges appear in the image. According to the J-matrix, major gray levels gotten with usual segmen-tation methods based on MSA are augmented and corre-sponding allocation windows are modified to detect weak edges. Experimental results demonstrate the effectiveness of the proposed method in gray image segmentation.

  9. Is STAPLE algorithm confident to assess segmentation methods in PET imaging?

    Science.gov (United States)

    Dewalle-Vignion, Anne-Sophie; Betrouni, Nacim; Baillet, Clio; Vermandel, Maximilien

    2015-12-01

    Accurate tumor segmentation in [18F]-fluorodeoxyglucose positron emission tomography is crucial for tumor response assessment and target volume definition in radiation therapy. Evaluation of segmentation methods from clinical data without ground truth is usually based on physicians’ manual delineations. In this context, the simultaneous truth and performance level estimation (STAPLE) algorithm could be useful to manage the multi-observers variability. In this paper, we evaluated how this algorithm could accurately estimate the ground truth in PET imaging. Complete evaluation study using different criteria was performed on simulated data. The STAPLE algorithm was applied to manual and automatic segmentation results. A specific configuration of the implementation provided by the Computational Radiology Laboratory was used. Consensus obtained by the STAPLE algorithm from manual delineations appeared to be more accurate than manual delineations themselves (80% of overlap). An improvement of the accuracy was also observed when applying the STAPLE algorithm to automatic segmentations results. The STAPLE algorithm, with the configuration used in this paper, is more appropriate than manual delineations alone or automatic segmentations results alone to estimate the ground truth in PET imaging. Therefore, it might be preferred to assess the accuracy of tumor segmentation methods in PET imaging.

  10. Memory based active contour algorithm using pixel-level classified images for colon crypt segmentation.

    Science.gov (United States)

    Cohen, Assaf; Rivlin, Ehud; Shimshoni, Ilan; Sabo, Edmond

    2015-07-01

    In this paper, we introduce a novel method for detection and segmentation of crypts in colon biopsies. Most of the approaches proposed in the literature try to segment the crypts using only the biopsy image without understanding the meaning of each pixel. The proposed method differs in that we segment the crypts using an automatically generated pixel-level classification image of the original biopsy image and handle the artifacts due to the sectioning process and variance in color, shape and size of the crypts. The biopsy image pixels are classified to nuclei, immune system, lumen, cytoplasm, stroma and goblet cells. The crypts are then segmented using a novel active contour approach, where the external force is determined by the semantics of each pixel and the model of the crypt. The active contour is applied for every lumen candidate detected using the pixel-level classification. Finally, a false positive crypt elimination process is performed to remove segmentation errors. This is done by measuring their adherence to the crypt model using the pixel level classification results. The method was tested on 54 biopsy images containing 4944 healthy and 2236 cancerous crypts, resulting in 87% detection of the crypts with 9% of false positive segments (segments that do not represent a crypt). The segmentation accuracy of the true positive segments is 96%.

  11. Automatic Waterline Extraction from Smartphone Images

    Science.gov (United States)

    Kröhnert, M.

    2016-06-01

    Considering worldwide increasing and devastating flood events, the issue of flood defence and prediction becomes more and more important. Conventional methods for the observation of water levels, for instance gauging stations, provide reliable information. However, they are rather cost-expensive in purchase, installation and maintenance and hence mostly limited for monitoring large streams only. Thus, small rivers with noticeable increasing flood hazard risks are often neglected. State-of-the-art smartphones with powerful camera systems may act as affordable, mobile measuring instruments. Reliable and effective image processing methods may allow the use of smartphone-taken images for mobile shoreline detection and thus for water level monitoring. The paper focuses on automatic methods for the determination of waterlines by spatio-temporal texture measures. Besides the considerable challenge of dealing with a wide range of smartphone cameras providing different hardware components, resolution, image quality and programming interfaces, there are several limits in mobile device processing power. For test purposes, an urban river in Dresden, Saxony was observed. The results show the potential of deriving the waterline with subpixel accuracy by a column-by-column four-parameter logistic regression and polynomial spline modelling. After a transformation into object space via suitable landmarks (which is not addressed in this paper), this corresponds to an accuracy in the order of a few centimetres when processing mobile device images taken from small rivers at typical distances.

  12. A novel region-growing based semi-automatic segmentation protocol for three-dimensional condylar reconstruction using cone beam computed tomography (CBCT.

    Directory of Open Access Journals (Sweden)

    Tong Xi

    Full Text Available OBJECTIVE: To present and validate a semi-automatic segmentation protocol to enable an accurate 3D reconstruction of the mandibular condyles using cone beam computed tomography (CBCT. MATERIALS AND METHODS: Approval from the regional medical ethics review board was obtained for this study. Bilateral mandibular condyles in ten CBCT datasets of patients were segmented using the currently proposed semi-automatic segmentation protocol. This segmentation protocol combined 3D region-growing and local thresholding algorithms. The segmentation of a total of twenty condyles was performed by two observers. The Dice-coefficient and distance map calculations were used to evaluate the accuracy and reproducibility of the segmented and 3D rendered condyles. RESULTS: The mean inter-observer Dice-coefficient was 0.98 (range [0.95-0.99]. An average 90th percentile distance of 0.32 mm was found, indicating an excellent inter-observer similarity of the segmented and 3D rendered condyles. No systematic errors were observed in the currently proposed segmentation protocol. CONCLUSION: The novel semi-automated segmentation protocol is an accurate and reproducible tool to segment and render condyles in 3D. The implementation of this protocol in the clinical practice allows the CBCT to be used as an imaging modality for the quantitative analysis of condylar morphology.

  13. Image segmentation using association rule features.

    Science.gov (United States)

    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.

  14. Image segmentation of em bryonic plant cell using pulse-coupled neural networks

    Institute of Scientific and Technical Information of China (English)

    2002-01-01

    Traditional image segmentation algorithms exhibit weak performance for plant cells which have complex structure. On the other hand, pulse-coupled neural network (PCNN) based on Eckhorn's model of the cat visual cortex should be suitable to the segmentation of plant cell image.But the present theories cannot explain the relationship between the parameters of PCNN mathematical model and the effect of segmentation. Satisfactory results usually require time-consuming selection of experimental parameters. Meanwhile, in a proper, selected parametric model, the number of iteration determines the segmented effect evaluated by visual judgment, which decreases the efficiency of image segmentation. To avoid these flaws, this note proposes a new PCNN algorithm for automatically segmenting plant embryonic cell image based on the maximum entropy principle. The algorithm produces a desirable result. In addition, a model with proper parameters can automatically determine the number of iteration, avoid visual judgment, enhance the speed of segmentation and will be utilized subsequently by accurate quantitative analysis of micro-molecules of plant cell. So this algorithm is valuable for theoretical investigation and application of PCNN.``

  15. Quantitative right and left ventricular functional analysis during gated whole-chest MDCT: A feasibility study comparing automatic segmentation to semi-manual contouring

    Energy Technology Data Exchange (ETDEWEB)

    Coche, Emmanuel, E-mail: Emmanuel.coche@uclouvain.b [Department of Medical Imaging, Universite Catholique de Louvain, Cliniques Universitaires St-Luc (UCL), Avenue Hippocrate, 10, 1200 Brussels (Belgium); Walker, Matthew J. [Philips Healthcare, CT Clinical Science, Cleveland, OH (United States); Zech, Francis [Department of Internal Medicine, Universite Catholique de Louvain, Cliniques Universitaires St-Luc, Brussels (Belgium); Crombrugghe, Rodolphe de [Department of Medical Imaging, Universite Catholique de Louvain, Cliniques Universitaires St-Luc (UCL), Avenue Hippocrate, 10, 1200 Brussels (Belgium); Vlassenbroek, Alain [Philips Healthcare, Brussels (Belgium)

    2010-06-15

    Purpose: To evaluate the feasibility of an automatic, whole-heart segmentation algorithm for measuring global heart function from gated, whole-chest MDCT images. Material and methods: 15 patients with suspicion of PE underwent whole-chest contrast-enhanced MDCT with retrospective ECG synchronization. Two observers computed right and left ventricular functional indices using a semi-manual and an automatic whole-heart segmentation algorithm. The two techniques were compared using Bland-Altman analysis and paired Student's t-test. Measurement reproducibility was calculated using intraclass correlation coefficient. Results: Ventricular analysis with automatic segmentation was successful in 13/15 (86%) and in 15/15 (100%) patients for the right ventricle and left ventricle, respectively. Reproducibility of measurements for both ventricles was perfect (ICC: 1.00) and very good for automatic and semi-manual measurements, respectively. Ventricular volumes and functional indices except right ventricular ejection fraction obtained from the automatic method were significantly higher for the RV compared to the semi-manual methods. Conclusions: The automatic, whole-heart segmentation algorithm enabled highly reproducible global heart function to be rapidly obtained in patients undergoing gated whole-chest MDCT for assessment of acute chest pain with suspicion of pulmonary embolism.

  16. Advanced numerical methods for image denoising and segmentation

    OpenAIRE

    Liu, Xiaoyang

    2013-01-01

    Image denoising is one of the most major steps in current image processing. It is a pre-processing step which aims to remove certain unknown, random noise from an image and obtain an image free of noise for further image processing, such as image segmentation. Image segmentation, as another branch of image processing, plays a significant role in connecting low-level image processing and high-level image processing. Its goal is to segment an image into different parts and extract meaningful in...

  17. Automatic aorta segmentation and valve landmark detection in C-arm CT: application to aortic valve implantation.

    Science.gov (United States)

    Zheng, Yefeng; John, Matthias; Liao, Rui; Boese, Jan; Kirschstein, Uwe; Georgescu, Bogdan; Zhou, S Kevin; Kempfert, Jörg; Walther, Thomas; Brockmann, Gernot; Comaniciu, Dorin

    2010-01-01

    C-arm CT is an emerging imaging technique in transcatheter aortic valve implantation (TAVI) surgery. Automatic aorta segmentation and valve landmark detection in a C-arm CT volume has important applications in TAVI by providing valuable 3D measurements for surgery planning. Overlaying 3D segmentation onto 2D real time fluoroscopic images also provides critical visual guidance during the surgery. In this paper, we present a part-based aorta segmentation approach, which can handle aorta structure variation in case that the aortic arch and descending aorta are missing in the volume. The whole aorta model is split into four parts: aortic root, ascending aorta, aortic arch, and descending aorta. Discriminative learning is applied to train a detector for each part separately to exploit the rich domain knowledge embedded in an expert-annotated dataset. Eight important aortic valve landmarks (three aortic hinge points, three commissure points, and two coronary ostia) are also detected automatically in our system. Under the guidance of the detected landmarks, the physicians can deploy the prosthetic valve properly. Our approach is robust under variations of contrast agent. Taking about 1.4 seconds to process one volume, it is also computationally efficient.

  18. User Interaction in Semi-Automatic Segmentation of Organs at Risk: a Case Study in Radiotherapy.

    Science.gov (United States)

    Ramkumar, Anjana; Dolz, Jose; Kirisli, Hortense A; Adebahr, Sonja; Schimek-Jasch, Tanja; Nestle, Ursula; Massoptier, Laurent; Varga, Edit; Stappers, Pieter Jan; Niessen, Wiro J; Song, Yu

    2016-04-01

    Accurate segmentation of organs at risk is an important step in radiotherapy planning. Manual segmentation being a tedious procedure and prone to inter- and intra-observer variability, there is a growing interest in automated segmentation methods. However, automatic methods frequently fail to provide satisfactory result, and post-processing corrections are often needed. Semi-automatic segmentation methods are designed to overcome these problems by combining physicians' expertise and computers' potential. This study evaluates two semi-automatic segmentation methods with different types of user interactions, named the "strokes" and the "contour", to provide insights into the role and impact of human-computer interaction. Two physicians participated in the experiment. In total, 42 case studies were carried out on five different types of organs at risk. For each case study, both the human-computer interaction process and quality of the segmentation results were measured subjectively and objectively. Furthermore, different measures of the process and the results were correlated. A total of 36 quantifiable and ten non-quantifiable correlations were identified for each type of interaction. Among those pairs of measures, 20 of the contour method and 22 of the strokes method were strongly or moderately correlated, either directly or inversely. Based on those correlated measures, it is concluded that: (1) in the design of semi-automatic segmentation methods, user interactions need to be less cognitively challenging; (2) based on the observed workflows and preferences of physicians, there is a need for flexibility in the interface design; (3) the correlated measures provide insights that can be used in improving user interaction design.

  19. Automatic annotation of image and video using semantics

    Science.gov (United States)

    Yasaswy, A. R.; Manikanta, K.; Sri Vamshi, P.; Tapaswi, Shashikala

    2010-02-01

    The accumulation of large collections of digital images has created the need for efficient and intelligent schemes for content-based image retrieval. Our goal is to organize the contents semantically, according to meaningful categories. Automatic annotation is the process of automatically assigning descriptions to an image or video that describes the contents of the image or video. In this paper, we examine the problem of automatic captioning of multimedia containing round and square objects. On a given set of images and videos we were able to recognize round and square objects in the images with accuracy up to 80% and videos with accuracy up to 70%.

  20. Segmentation of dynamic PET images with kinetic spectral clustering

    Science.gov (United States)

    Mouysset, S.; Zbib, H.; Stute, S.; Girault, J. M.; Charara, J.; Noailles, J.; Chalon, S.; Buvat, I.; Tauber, C.

    2013-10-01

    Segmentation is often required for the analysis of dynamic positron emission tomography (PET) images. However, noise and low spatial resolution make it a difficult task and several supervised and unsupervised methods have been proposed in the literature to perform the segmentation based on semi-automatic clustering of the time activity curves of voxels. In this paper we propose a new method based on spectral clustering that does not require any prior information on the shape of clusters in the space in which they are identified. In our approach, the p-dimensional data, where p is the number of time frames, is first mapped into a high dimensional space and then clustering is performed in a low-dimensional space of the Laplacian matrix. An estimation of the bounds for the scale parameter involved in the spectral clustering is derived. The method is assessed using dynamic brain PET images simulated with GATE and results on real images are presented. We demonstrate the usefulness of the method and its superior performance over three other clustering methods from the literature. The proposed approach appears as a promising pre-processing tool before parametric map calculation or ROI-based quantification tasks.

  1. Ceramography and segmentation of polycristalline ceramics: application to grain size analysis by automatic methods

    Energy Technology Data Exchange (ETDEWEB)

    Arnould, X.; Coster, M.; Chermant, J.L.; Chermant, L. [LERMAT, ISMRA, Caen (France); Chartier, T. [SPCTS, ENSCI, Limoges (France)

    2002-07-01

    The knowledge of the mean grain size of ceramics is a very important problem to solve in the ceramic industry. Some specific methods of segmentation are presented to analyse, by an automatic way, the granulometry and morphological parameters of ceramic materials. Example presented concerns cerine materials. Such investigations lead to important information on the sintering process. (orig.)

  2. Optimal retinal cyst segmentation from OCT images

    Science.gov (United States)

    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).

  3. Embedded Implementation of VHR Satellite Image Segmentation.

    Science.gov (United States)

    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.

  4. Automatic cloud classification of whole sky images

    Directory of Open Access Journals (Sweden)

    A. Heinle

    2010-05-01

    Full Text Available The recently increasing development of whole sky imagers enables temporal and spatial high-resolution sky observations. One application already performed in most cases is the estimation of fractional sky cover. A distinction between different cloud types, however, is still in progress. Here, an automatic cloud classification algorithm is presented, based on a set of mainly statistical features describing the color as well as the texture of an image. The k-nearest-neighbour classifier is used due to its high performance in solving complex issues, simplicity of implementation and low computational complexity. Seven different sky conditions are distinguished: high thin clouds (cirrus and cirrostratus, high patched cumuliform clouds (cirrocumulus and altocumulus, stratocumulus clouds, low cumuliform clouds, thick clouds (cumulonimbus and nimbostratus, stratiform clouds and clear sky. Based on the Leave-One-Out Cross-Validation the algorithm achieves an accuracy of about 97%. In addition, a test run of random images is presented, still outperforming previous algorithms by yielding a success rate of about 75%, or up to 88% if only "serious" errors with respect to radiation impact are considered. Reasons for the decrement in accuracy are discussed, and ideas to further improve the classification results, especially in problematic cases, are investigated.

  5. Automated Segmentation of in Vivo and Ex Vivo Mouse Brain Magnetic Resonance Images

    Directory of Open Access Journals (Sweden)

    Alize E.H. Scheenstra

    2009-01-01

    Full Text Available Segmentation of magnetic resonance imaging (MRI data is required for many applications, such as the comparison of different structures or time points, and for annotation purposes. Currently, the gold standard for automated image segmentation is nonlinear atlas-based segmentation. However, these methods are either not sufficient or highly time consuming for mouse brains, owing to the low signal to noise ratio and low contrast between structures compared with other applications. We present a novel generic approach to reduce processing time for segmentation of various structures of mouse brains, in vivo and ex vivo. The segmentation consists of a rough affine registration to a template followed by a clustering approach to refine the rough segmentation near the edges. Compared with manual segmentations, the presented segmentation method has an average kappa index of 0.7 for 7 of 12 structures in in vivo MRI and 11 of 12 structures in ex vivo MRI. Furthermore, we found that these results were equal to the performance of a nonlinear segmentation method, but with the advantage of being 8 times faster. The presented automatic segmentation method is quick and intuitive and can be used for image registration, volume quantification of structures, and annotation.

  6. Histological image segmentation using fast mean shift clustering method

    OpenAIRE

    Wu, Geming; Zhao, Xinyan; Luo, Shuqian; Shi, Hongli

    2015-01-01

    Background Colour image segmentation is fundamental and critical for quantitative histological image analysis. The complexity of the microstructure and the approach to make histological images results in variable staining and illumination variations. And ultra-high resolution of histological images makes it is hard for image segmentation methods to achieve high-quality segmentation results and low computation cost at the same time. Methods Mean Shift clustering approach is employed for histol...

  7. Accuracy Validation of an Automated Method for Prostate Segmentation in Magnetic Resonance Imaging.

    Science.gov (United States)

    Shahedi, Maysam; Cool, Derek W; Bauman, Glenn S; Bastian-Jordan, Matthew; Fenster, Aaron; Ward, Aaron D

    2017-03-24

    Three dimensional (3D) manual segmentation of the prostate on magnetic resonance imaging (MRI) is a laborious and time-consuming task that is subject to inter-observer variability. In this study, we developed a fully automatic segmentation algorithm for T2-weighted endorectal prostate MRI and evaluated its accuracy within different regions of interest using a set of complementary error metrics. Our dataset contained 42 T2-weighted endorectal MRI from prostate cancer patients. The prostate was manually segmented by one observer on all of the images and by two other observers on a subset of 10 images. The algorithm first coarsely localizes the prostate in the image using a template matching technique. Then, it defines the prostate surface using learned shape and appearance information from a set of training images. To evaluate the algorithm, we assessed the error metric values in the context of measured inter-observer variability and compared performance to that of our previously published semi-automatic approach. The automatic algorithm needed an average execution time of ∼60 s to segment the prostate in 3D. When compared to a single-observer reference standard, the automatic algorithm has an average mean absolute distance of 2.8 mm, Dice similarity coefficient of 82%, recall of 82%, precision of 84%, and volume difference of 0.5 cm(3) in the mid-gland. Concordant with other studies, accuracy was highest in the mid-gland and lower in the apex and base. Loss of accuracy with respect to the semi-automatic algorithm was less than the measured inter-observer variability in manual segmentation for the same task.

  8. Segmentation of Tongue Muscles from Super-Resolution Magnetic Resonance Images

    Science.gov (United States)

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

    2014-01-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

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

    Science.gov (United States)

    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

  10. Underwater color image segmentation method via RGB channel fusion

    Science.gov (United States)

    Xuan, Li; Mingjun, Zhang

    2017-02-01

    Aiming at the problem of low segmentation accuracy and high computation time by applying existing segmentation methods for underwater color images, this paper has proposed an underwater color image segmentation method via RGB color channel fusion. Based on thresholding segmentation methods to conduct fast segmentation, the proposed method relies on dynamic estimation of the optimal weights for RGB channel fusion to obtain the grayscale image with high foreground-background contrast and reaches high segmentation accuracy. To verify the segmentation accuracy of the proposed method, the authors have conducted various underwater comparative experiments. The experimental results demonstrate that the proposed method is robust to illumination, and it is superior to existing methods in terms of both segmentation accuracy and computation time. Moreover, a segmentation technique is proposed for image sequences for real-time autonomous underwater vehicle operations.

  11. 水平集分层分割遥感图像中的建筑物%Automatic building segmentation from remote sensing images using multi-layer level set framework

    Institute of Scientific and Technical Information of China (English)

    郭靖; 江洁; 曹世翔

    2014-01-01

    Towards high resolution remote sensing images, combining with features of buildings, a novel method to extract buildings based on multi-layer level set framework was proposed. Firstly, as far as the impact of shadow and vegetation was concerned, it should be removed on the basis of the separation of gray value thresh and the joint distribution of hue and saturation. Then, an improved C-V level set segmentation algorithm combining with building features of roof′s gray and obvious boundaries was applied to extract building regions of similar gray-scales on each gray layer, and thus all building regions of different gray-scales could be extracted layer by layer, followed by layers of segmented regions integration. Finally, the non-building regions were excluded by using normal areas of buildings and related position between buildings and shadows. The experiment results demonstrate that, compared with the traditional level set methods, this one can detect each single building of gray heterogeneity and buildings of multiple shapes and different gray-scales. Meanwhile, compared to the traditional C-V method, it largely reduces the leakage segmentation ratio by 25% and over-segmentation by 22%.%针对高分辨率遥感图像,结合建筑物特征,提出水平集分层模型分割图像中的建筑物。首先,学习植被样本得到其在HSV空间中色调与饱和度的联合分布函数,利用阴影灰度方差通常小于非阴影区域的特点,将植被和阴影剔除以简化背景利于后续分割。然后,根据灰度级高低将一幅图像看作多层图像层,把建筑物的屋顶灰度特征和边缘特征融合到传统Chan-Vese(C-V)水平集算法中,分割出每层中灰度级相似的建筑物候选区域,从而将不同灰度级建筑物候选区域分层分割出来再整合。最后利用建筑物面积、建筑物与阴影位置关系等先验知识排除误分割,得到最终结果。实验表明:该方法能更好地分割

  12. 基于区间参数寻优的PCNN红外图像自动分割方法%Automatic Image Segmentation Algorithm by PCNN Based on Mean Threshold and Ostu

    Institute of Scientific and Technical Information of China (English)

    王力; 王敏

    2015-01-01

    脉冲耦合神经网络(Pulse Coupled Neural Network)是基于动物视觉图像形成机制,用一组数学式表达这种机制的仿生学方法.PCNN的数学表达式中有7个关键的参数,而其中的阈值放大系数VE决定了PCNN网络中每个像素的分割阈值大小.通过平均阈值算法和Ostu算法分别计算出图像的分割阈值,并基于高斯分布模型用数学方法证明了在最小交叉熵时的最佳分割阈值在这2个阈值构成的区间内,通过在这2个阈值构成的区间内搜索新的阈值作为PCNN的参数VE的值,并将此寻优的参数VE代入改进的PCNN算法进行图像分割.在计算机上进行仿真实验,与基于经验值的指数衰减算法比较,该文算法分割出的兴趣区域清晰、准确,边缘连接性好,信息全面,算法的效率更高,具有很好的实用性.%The Pulse Coupled Neural Network is based on the research of animals' visual image formation system, which bionics method is presented by a group of mathematics formulas. The formula group of PCNN has 7 key parameters, among which the factor of threshold amplificationVEdecides the threshold of segmentation of the image and the output of bilinear image. This article calculates the threshold by the mean threshold and Ostu method, then proves that at the minimum cross-entropy, the best threshold is in the interval of the two thresholds by Gauss distribution model, finally searches a new threshold as the value of PCNN parameter VE between these two thresholds. We divided the image by using the changed PCNN, simulate the algorithm on the computer and compare the result with experiential decay method. The result shows that our algorithm divides a clear and accurate interesting area, the connectivity is better, the efficiency is better, so this algorithm has a good practicability.

  13. A Hybrid Method for Automatic Anatomical Variant Detection and Segmentation

    NARCIS (Netherlands)

    Lorenz, C.; Hanna, R.; Barschdorf, H.; Klinder, T.; Weber, IF.; Krueger, M.; Doessel, O.

    2012-01-01

    The delineation of anatomical structures in medical images can be achieved in an efficient and robust manner using statistical anatomical organ models, which has been demonstrated for an already considerable set of organs, including the heart. While it is possible to provide models with sufficient s

  14. A New Method for Segmentation of Multiple Sclerosis (MS Lesions on Brain MR Images

    Directory of Open Access Journals (Sweden)

    Simin Jafari

    2015-07-01

    Full Text Available Automatic segmentation of multiple sclerosis (MS lesions in brain MRI has been widely investigated in recent years with the goal of helping MS diagnosis and patient follow-up. In this study we applied gaussian mixture model (GMM to segment MS lesions in MR images. Usually, GMM is optimized using expectation-maximization (EM algorithm. One of the drawbacks of this optimization method is that, it does not convergence to optimal maximum or minimum. Starting from different initial points and saving best result, is a strategy which is used to reach the near optimal. This approach is time consuming and we used another way to initiate the EM algorithm. Also, FAST- Trimmed Likelihood Estimator (FAST-TLE algorithm was applied to determine which voxels should be rejected. The automatically segmentation outputs were scored by two specialists and the results show that our method has capability to segment the MS lesions with Dice similarity coefficient (DSC score of 0.82.

  15. 3D automatic anatomy segmentation based on iterative graph-cut-ASM

    Energy Technology Data Exchange (ETDEWEB)

    Chen, Xinjian; Bagci, Ulas [Radiology and Imaging Sciences, Clinical Center, National Institutes of Health, Building 10 Room 1C515, Bethesda, Maryland 20892-1182 and Life Sciences Research Center, School of Life Sciences and Technology, Xidian University, Xi' an 710071 (China); Radiology and Imaging Sciences, Clinical Center, National Institutes of Health, Building 10 Room 1C515, Bethesda, Maryland 20892-1182 (United States)

    2011-08-15

    Purpose: This paper studies the feasibility of developing an automatic anatomy segmentation (AAS) system in clinical radiology and demonstrates its operation on clinical 3D images. Methods: The AAS system, the authors are developing consists of two main parts: object recognition and object delineation. As for recognition, a hierarchical 3D scale-based multiobject method is used for the multiobject recognition task, which incorporates intensity weighted ball-scale (b-scale) information into the active shape model (ASM). For object delineation, an iterative graph-cut-ASM (IGCASM) algorithm is proposed, which effectively combines the rich statistical shape information embodied in ASM with the globally optimal delineation capability of the GC method. The presented IGCASM algorithm is a 3D generalization of the 2D GC-ASM method that they proposed previously in Chen et al.[Proc. SPIE, 7259, 72590C1-72590C-8 (2009)]. The proposed methods are tested on two datasets comprised of images obtained from 20 patients (10 male and 10 female) of clinical abdominal CT scans, and 11 foot magnetic resonance imaging (MRI) scans. The test is for four organs (liver, left and right kidneys, and spleen) segmentation, five foot bones (calcaneus, tibia, cuboid, talus, and navicular). The recognition and delineation accuracies were evaluated separately. The recognition accuracy was evaluated in terms of translation, rotation, and scale (size) error. The delineation accuracy was evaluated in terms of true and false positive volume fractions (TPVF, FPVF). The efficiency of the delineation method was also evaluated on an Intel Pentium IV PC with a 3.4 GHZ CPU machine. Results: The recognition accuracies in terms of translation, rotation, and scale error over all organs are about 8 mm, 10 deg. and 0.03, and over all foot bones are about 3.5709 mm, 0.35 deg. and 0.025, respectively. The accuracy of delineation over all organs for all subjects as expressed in TPVF and FPVF is 93.01% and 0.22%, and

  16. Tomographic brain imaging with nucleolar detail and automatic cell counting

    Science.gov (United States)

    Hieber, Simone E.; Bikis, Christos; Khimchenko, Anna; Schweighauser, Gabriel; Hench, Jürgen; Chicherova, Natalia; Schulz, Georg; Müller, Bert

    2016-09-01

    Brain tissue evaluation is essential for gaining in-depth insight into its diseases and disorders. Imaging the human brain in three dimensions has always been a challenge on the cell level. In vivo methods lack spatial resolution, and optical microscopy has a limited penetration depth. Herein, we show that hard X-ray phase tomography can visualise a volume of up to 43 mm3 of human post mortem or biopsy brain samples, by demonstrating the method on the cerebellum. We automatically identified 5,000 Purkinje cells with an error of less than 5% at their layer and determined the local surface density to 165 cells per mm2 on average. Moreover, we highlight that three-dimensional data allows for the segmentation of sub-cellular structures, including dendritic tree and Purkinje cell nucleoli, without dedicated staining. The method suggests that automatic cell feature quantification of human tissues is feasible in phase tomograms obtained with isotropic resolution in a label-free manner.

  17. Reliability and effectiveness of clickthrough data for automatic image annotation

    NARCIS (Netherlands)

    Tsikrika, T.; Diou, C.; De Vries, A.P.; Delopoulos, A.

    2010-01-01

    Automatic image annotation using supervised learning is performed by concept classifiers trained on labelled example images. This work proposes the use of clickthrough data collected from search logs as a source for the automatic generation of concept training data, thus avoiding the expensive manua

  18. NSCT BASED LOCAL ENHANCEMENT FOR ACTIVE CONTOUR BASED IMAGE SEGMENTATION APPLICATION

    Directory of Open Access Journals (Sweden)

    Hiren Mewada

    2010-08-01

    Full Text Available Because of cross-disciplinary nature, Active Contour modeling techniques have been utilized extensively for the image segmentation. In traditional active contour based segmentation techniques based on level set methods, the energy functions are defined based on the intensity gradient. This makes them highly sensitive to the situation where the underlying image content is characterized by image nonhomogeneities due to illumination and contrast condition. This is the most difficult problem to make them as fully automatic image segmentation techniques. This paper introduces one of the approaches based on image enhancement to this problem. The enhanced image is obtained using NonSubsampled Contourlet Transform, which improves the edges strengths in the direction where the illumination is not proper and then active contour model based on level set technique is utilized to segment the object. Experiment results demonstrate that proposed method can be utilized along with existing active contour model based segmentation method under situation characterized by intensity non-homogeneity to make them fully automatic.

  19. A Semantic Connected Coherence Scheme for Efficient Image Segmentation

    Directory of Open Access Journals (Sweden)

    S.Pannirselvam

    2012-06-01

    Full Text Available Image processing is a comprehensively research topic with an elongated history. Segmenting an image is the most challenging and difficult task in image processing and analysis. The principal intricacy met in image segmentation is the ability of techniques to discover semantic objects efficiently from an image without any prior knowledge. One recent work presented connected coherence tree algorithm (CCTA for image segmentation (with no prior knowledge which discovered regions of semantic coherence based on neighbor coherence segmentation criteria. It deployed an adaptive spatial scale and a suitable intensity-difference scale to extract several sets of coherent neighboring pixels and maximize the probability of single image content and minimize complex backgrounds. However CCTA segmented images either consists of small, lengthy and slender objects or rigorously ruined by noise, irregular lighting, occlusion, poor illumination, and shadow.In this paper, we present a Cluster based Semantic Coherent Tree (CBSCT scheme for image segmentation. CBSCT’s initial work is on the semantic connected coherence criteria for the image segregation. Semantic coherent regions are clustered based on Bayesian nearest neighbor search of neighborhood pixels. The segmentation regions are extracted from the images based on the cluster object purity obtained through semantic coherent regions. The clustered image regions are post processed with non linear noise filters. Performance metrics used in the evaluation of CBSCT are semantic coherent pixel size, number of cluster objects, and purity levels of the cluster, segmented coherent region intensity threshold, and quality of segmented images in terms of image clarity with PSNR.

  20. Automatic Approach to Vhr Satellite Image Classification

    Science.gov (United States)

    Kupidura, P.; Osińska-Skotak, K.; Pluto-Kossakowska, J.

    2016-06-01

    In this paper, we present a proposition of a fully automatic classification of VHR satellite images. Unlike the most widespread approaches: supervised classification, which requires prior defining of class signatures, or unsupervised classification, which must be followed by an interpretation of its results, the proposed method requires no human intervention except for the setting of the initial parameters. The presented approach bases on both spectral and textural analysis of the image and consists of 3 steps. The first step, the analysis of spectral data, relies on NDVI values. Its purpose is to distinguish between basic classes, such as water, vegetation and non-vegetation, which all differ significantly spectrally, thus they can be easily extracted basing on spectral analysis. The second step relies on granulometric maps. These are the product of local granulometric analysis of an image and present information on the texture of each pixel neighbourhood, depending on the texture grain. The purpose of texture analysis is to distinguish between different classes, spectrally similar, but yet of different texture, e.g. bare soil from a built-up area, or low vegetation from a wooded area. Due to the use of granulometric analysis, based on mathematical morphology opening and closing, the results are resistant to the border effect (qualifying borders of objects in an image as spaces of high texture), which affect other methods of texture analysis like GLCM statistics or fractal analysis. Therefore, the effectiveness of the analysis is relatively high. Several indices based on values of different granulometric maps have been developed to simplify the extraction of classes of different texture. The third and final step of the process relies on a vegetation index, based on near infrared and blue bands. Its purpose is to correct partially misclassified pixels. All the indices used in the classification model developed relate to reflectance values, so the preliminary step

  1. AUTOMATIC APPROACH TO VHR SATELLITE IMAGE CLASSIFICATION

    Directory of Open Access Journals (Sweden)

    P. Kupidura

    2016-06-01

    Full Text Available In this paper, we present a proposition of a fully automatic classification of VHR satellite images. Unlike the most widespread approaches: supervised classification, which requires prior defining of class signatures, or unsupervised classification, which must be followed by an interpretation of its results, the proposed method requires no human intervention except for the setting of the initial parameters. The presented approach bases on both spectral and textural analysis of the image and consists of 3 steps. The first step, the analysis of spectral data, relies on NDVI values. Its purpose is to distinguish between basic classes, such as water, vegetation and non-vegetation, which all differ significantly spectrally, thus they can be easily extracted basing on spectral analysis. The second step relies on granulometric maps. These are the product of local granulometric analysis of an image and present information on the texture of each pixel neighbourhood, depending on the texture grain. The purpose of texture analysis is to distinguish between different classes, spectrally similar, but yet of different texture, e.g. bare soil from a built-up area, or low vegetation from a wooded area. Due to the use of granulometric analysis, based on mathematical morphology opening and closing, the results are resistant to the border effect (qualifying borders of objects in an image as spaces of high texture, which affect other methods of texture analysis like GLCM statistics or fractal analysis. Therefore, the effectiveness of the analysis is relatively high. Several indices based on values of different granulometric maps have been developed to simplify the extraction of classes of different texture. The third and final step of the process relies on a vegetation index, based on near infrared and blue bands. Its purpose is to correct partially misclassified pixels. All the indices used in the classification model developed relate to reflectance values, so the

  2. RBCs and Parasites Segmentation from Thin Smear Blood Cell Images

    Directory of Open Access Journals (Sweden)

    Vishal V. Panchbhai

    2012-09-01

    Full Text Available Manually examine the blood smear for the detection of malaria parasite consumes lot of time for trend pathologists. As the computational power increases, the role of automatic visual inspection becomes more important. An automated system is therefore needed to complete as much work as possible for the identification of malaria parasites. The given scheme based on used of RGB color space, G layer processing, and segmentation of Red Blood Cells (RBC as well as cell parasites by auto-thresholding with offset value and use of morphological processing. The work compare with the manual results obtained from the pathology lab, based on total RBC count and cells parasite count. The designed system successfully detects malaria parasites and RBC cells in thin smear image.

  3. Automatic Image Registration Technique of Remote Sensing Images

    Directory of Open Access Journals (Sweden)

    M. Wahed

    2013-03-01

    Full Text Available Image registration is a crucial step in most image processing tasks for which the final result is achieved from a combination of various resources. Automatic registration of remote-sensing images is a difficult task as it must deal with the intensity changes and variation of scale, rotation and illumination of the images. This paper proposes image registration technique of multi-view, multi- temporal and multi-spectral remote sensing images. Firstly, a preprocessing step is performed by applying median filtering to enhance the images. Secondly, the Steerable Pyramid Transform is adopted to produce multi-resolution levels of reference and sensed images; then, the Scale Invariant Feature Transform (SIFT is utilized for extracting feature points that can deal with the large variations of scale, rotation and illumination between images .Thirdly, matching the features points by using the Euclidian distance ratio; then removing the false matching pairs using the RANdom SAmple Consensus (RANSAC algorithm. Finally, the mapping function is obtained by the affine transformation. Quantitative comparisons of our technique with the related techniques show a significant improvement in the presence of large scale, rotation changes, and the intensity changes. The effectiveness of the proposed technique is demonstrated by the experimental results.

  4. Estimation of coal particle size distribution by image segmentation

    Institute of Scientific and Technical Information of China (English)

    Zhang Zelin; Yang Jianguo; Ding Lihua; Zhao Yuemin

    2012-01-01

    Several industrial coal processes are largely determined by the distribution of particle sizes in their feed.Currently these parameters are measured by manual sampling,which is time consuming and cannot provide real time feedback for automatic control purposes.In this paper,an approach using image segmentation on images of overlapped coal particles is described.The estimation of the particle size distribution by number is also described.The particle overlap problem was solved using image enhancement algorithms that converted those image parts representing material in lower layers to black.Exponential high-pass filter (EHPF) algorithms were used to remove the texture from particles on the surface.Finally,the edges of the surface particles were identified by morphological edge detection.These algorithms are described in detail as is the method of extracting the coal particle size.Tests indicate that using more coal images gives a higher accuracy estimate.The positive absolute error of 50 random tests was consistently less than 2.5% and the errors were reduced as the size of the fraction increased.

  5. Hierarchical Non-linear Image Registration Integrating Deformable Segmentation

    Institute of Scientific and Technical Information of China (English)

    RAN Xin; QI Fei-hu

    2005-01-01

    A hierarchical non-linear method for image registration was presented, which integrates image segmentation and registration under a variational framework. An improved deformable model is used to simultaneously segment and register feature from multiple images. The objects in the image pair are segmented by evolving a single contour and meanwhile the parameters of affine registration transformation are found out. After that, a contour-constrained elastic registration is applied to register the images correctly. The experimental results indicate that the proposed approach is effective to segment and register medical images.

  6. Segmentation of radiographic images under topological constraints: application to the femur

    Energy Technology Data Exchange (ETDEWEB)

    Gamage, Pavan; Xie, Sheng Quan [University of Auckland, Department of Mechanical Engineering (Mechatronics), Auckland (New Zealand); Delmas, Patrice [University of Auckland, Department of Computer Science, Auckland (New Zealand); Xu, Wei Liang [Massey University, School of Engineering and Advanced Technology, Auckland (New Zealand)

    2010-09-15

    A framework for radiographic image segmentation under topological control based on two-dimensional (2D) image analysis was developed. The system is intended for use in common radiological tasks including fracture treatment analysis, osteoarthritis diagnostics and osteotomy management planning. The segmentation framework utilizes a generic three-dimensional (3D) model of the bone of interest to define the anatomical topology. Non-rigid registration is performed between the projected contours of the generic 3D model and extracted edges of the X-ray image to achieve the segmentation. For fractured bones, the segmentation requires an additional step where a region-based active contours curve evolution is performed with a level set Mumford-Shah method to obtain the fracture surface edge. The application of the segmentation framework to analysis of human femur radiographs was evaluated. The proposed system has two major innovations. First, definition of the topological constraints does not require a statistical learning process, so the method is generally applicable to a variety of bony anatomy segmentation problems. Second, the methodology is able to handle both intact and fractured bone segmentation. Testing on clinical X-ray images yielded an average root mean squared distance (between the automatically segmented femur contour and the manual segmented ground truth) of 1.10 mm with a standard deviation of 0.13 mm. The proposed point correspondence estimation algorithm was benchmarked against three state-of-the-art point matching algorithms, demonstrating successful non-rigid registration for the cases of interest. A topologically constrained automatic bone contour segmentation framework was developed and tested, providing robustness to noise, outliers, deformations and occlusions. (orig.)

  7. Hybrid Segmentation of Vessels and Automated Flow Measures in In-Vivo Ultrasound Imaging

    DEFF Research Database (Denmark)

    Moshavegh, Ramin; Martins, Bo; Hansen, Kristoffer Lindskov

    2016-01-01

    Vector Flow Imaging (VFI) has received an increasing attention in the scientific field of ultrasound, as it enables angle independent visualization of blood flow. VFI can be used in volume flow estimation, but a vessel segmentation is needed to make it fully automatic. A novel vessel segmentation...... procedure is crucial for wall-to-wall visualization, automation of adjustments, and quantification of flow in state-of-the-art ultrasound scanners. We propose and discuss a method for accurate vessel segmentation that fuses VFI data and B-mode for robustly detecting and delineating vessels. The proposed...

  8. Region-based multi-step optic disk and cup segmentation from color fundus image

    Science.gov (United States)

    Xiao, Di; Lock, Jane; Manresa, Javier Moreno; Vignarajan, Janardhan; Tay-Kearney, Mei-Ling; Kanagasingam, Yogesan

    2013-02-01

    Retinal optic cup-disk-ratio (CDR) is a one of important indicators of glaucomatous neuropathy. In this paper, we propose a novel multi-step 4-quadrant thresholding method for optic disk segmentation and a multi-step temporal-nasal segmenting method for optic cup segmentation based on blood vessel inpainted HSL lightness images and green images. The performance of the proposed methods was evaluated on a group of color fundus images and compared with the manual outlining results from two experts. Dice scores of detected disk and cup regions between the auto and manual results were computed and compared. Vertical CDRs were also compared among the three results. The preliminary experiment has demonstrated the robustness of the method for automatic optic disk and cup segmentation and its potential value for clinical application.

  9. Variation-based approach to image segmentation Variation-based approach to image segmentation

    Institute of Scientific and Technical Information of China (English)

    张永平; 郑南宁; 赵荣椿

    2001-01-01

    A new approach to image segmentation is presented using a variation framework. Regarding the edge points as interpolating points and minimizing an energy functional to interpolate a smooth threshold surface it carries out the image segmentation. In order to preserve the edge information of the original image in the threshold surface, without unduly sharping the edge of the image, a non-convex energy functional is adopted. A relaxation algorithm with the property of global convergence, for solving the optimization problem, is proposed by introducing a binary energy. As a result the non-convex optimization problem is transformed into a series of convex optimization problems, and the problem of slow convergence or nonconvergence is solved. The presented method is also tested experimentally. Finally the method of determining the parameters in optimizing is also explored.   

  10. Low-rank and sparse decomposition based shape model and probabilistic atlas for automatic pathological organ segmentation.

    Science.gov (United States)

    Shi, Changfa; Cheng, Yuanzhi; Wang, Jinke; Wang, Yadong; Mori, Kensaku; Tamura, Shinichi

    2017-02-22

    One major limiting factor that prevents the accurate delineation of human organs has been the presence of severe pathology and pathology affecting organ borders. Overcoming these limitations is exactly what we are concerned in this study. We propose an automatic method for accurate and robust pathological organ segmentation from CT images. The method is grounded in the active shape model (ASM) framework. It leverages techniques from low-rank and sparse decomposition (LRSD) theory to robustly recover a subspace from grossly corrupted data. We first present a population-specific LRSD-based shape prior model, called LRSD-SM, to handle non-Gaussian gross errors caused by weak and misleading appearance cues of large lesions, complex shape variations, and poor adaptation to the finer local details in a unified framework. For the shape model initialization, we introduce a method based on patient-specific LRSD-based probabilistic atlas (PA), called LRSD-PA, to deal with large errors in atlas-to-target registration and low likelihood of the target organ. Furthermore, to make our segmentation framework more efficient and robust against local minima, we develop a hierarchical ASM search strategy. Our method is tested on the SLIVER07 database for liver segmentation competition, and ranks 3rd in all the published state-of-the-art automatic methods. Our method is also evaluated on some pathological organs (pathological liver and right lung) from 95 clinical CT scans and its results are compared with the three closely related methods. The applicability of the proposed method to segmentation of the various pathological organs (including some highly severe cases) is demonstrated with good results on both quantitative and qualitative experimentation; our segmentation algorithm can delineate organ boundaries that reach a level of accuracy comparable with those of human raters.

  11. Automated ventricular systems segmentation in brain CT images by combining low-level segmentation and high-level template matching

    Directory of Open Access Journals (Sweden)

    Ward Kevin R

    2009-11-01

    Full Text Available Abstract Background Accurate analysis of CT brain scans is vital for diagnosis and treatment of Traumatic Brain Injuries (TBI. Automatic processing of these CT brain scans could speed up the decision making process, lower the cost of healthcare, and reduce the chance of human error. In this paper, we focus on automatic processing of CT brain images to segment and identify the ventricular systems. The segmentation of ventricles provides quantitative measures on the changes of ventricles in the brain that form vital diagnosis information. Methods First all CT slices are aligned by detecting the ideal midlines in all images. The initial estimation of the ideal midline of the brain is found based on skull symmetry and then the initial estimate is further refined using detected anatomical features. Then a two-step method is used for ventricle segmentation. First a low-level segmentation on each pixel is applied on the CT images. For this step, both Iterated Conditional Mode (ICM and Maximum A Posteriori Spatial Probability (MASP are evaluated and compared. The second step applies template matching algorithm to identify objects in the initial low-level segmentation as ventricles. Experiments for ventricle segmentation are conducted using a relatively large CT dataset containing mild and severe TBI cases. Results Experiments show that the acceptable rate of the ideal midline detection is over 95%. Two measurements are defined to evaluate ventricle recognition results. The first measure is a sensitivity-like measure and the second is a false positive-like measure. For the first measurement, the rate is 100% indicating that all ventricles are identified in all slices. The false positives-like measurement is 8.59%. We also point out the similarities and differences between ICM and MASP algorithms through both mathematically relationships and segmentation results on CT images. Conclusion The experiments show the reliability of the proposed algorithms. The

  12. An Improved FCM Medical Image Segmentation Algorithm Based on MMTD

    Directory of Open Access Journals (Sweden)

    Ningning Zhou

    2014-01-01

    Full Text Available Image segmentation plays an important role in medical image processing. Fuzzy c-means (FCM is one of the popular clustering algorithms for medical image segmentation. But FCM is highly vulnerable to noise due to not considering the spatial information in image segmentation. This paper introduces medium mathematics system which is employed to process fuzzy information for image segmentation. It establishes the medium similarity measure based on the measure of medium truth degree (MMTD and uses the correlation of the pixel and its neighbors to define the medium membership function. An improved FCM medical image segmentation algorithm based on MMTD which takes some spatial features into account is proposed in this paper. The experimental results show that the proposed algorithm is more antinoise than the standard FCM, with more certainty and less fuzziness. This will lead to its practicable and effective applications in medical image segmentation.

  13. A Self-Calibrating Multi-Band Region Growing Approach to Segmentation of Single and Multi-Band Images

    Energy Technology Data Exchange (ETDEWEB)

    Paglieroni, D W

    2002-12-20

    Image segmentation transforms pixel-level information from raw images to a higher level of abstraction in which related pixels are grouped into disjoint spatial regions. Such regions typically correspond to natural or man-made objects or structures, natural variations in land cover, etc. For many image interpretation tasks (such as land use assessment, automatic target cueing, defining relationships between objects, etc.), segmentation can be an important early step. Remotely sensed images (e.g., multi-spectral and hyperspectral images) often contain many spectral bands (i.e., multiple layers of 2D images). Multi-band images are important because they contain more information than single-band images. Objects or natural variations that are readily apparent in certain spectral bands may be invisible in 2D broadband images. In this paper, the classical region growing approach to image segmentation is generalized from single to multi-band images. While it is widely recognized that the quality of image segmentation is affected by which segmentation algorithm is used, this paper shows that algorithm parameter values can have an even more profound effect. A novel self-calibration framework is developed for automatically selecting parameter values that produce segmentations that most closely resemble a calibration edge map (derived separately using a simple edge detector). Although the framework is generic in the sense that it can imbed any core segmentation algorithm, this paper only demonstrates self-calibration with multi-band region growing. The framework is applied to a variety of AVIRIS image blocks at different spectral resolutions, in an effort to assess the impact of spectral resolution on segmentation quality. The image segmentations are assessed quantitatively, and it is shown that segmentation quality does not generally appear to be highly correlated with spectral resolution.

  14. An Efficient Approach for Tree Digital Image Segmentation

    Institute of Scientific and Technical Information of China (English)

    Cheng Lei; Song Tieying

    2004-01-01

    This paper proposes an improved method to segment tree image based on color and texture feature and amends the segmented result by mathematical morphology. The crown and trunk of one tree have been successfully segmented and the experimental result is deemed effective. The authors conclude that building a standard data base for a range of species, featuring color and texture is a necessary condition and constitutes the essential groundwork for tree image segmentation in order to insure its quality.

  15. Using LSA and text segmentation to improve automatic Chinese dialogue text summarization

    Institute of Scientific and Technical Information of China (English)

    LIU Chuan-han; WANG Yong-cheng; ZHENG Fei; LIU De-rong

    2007-01-01

    Automatic Chinese text summarization for dialogue style is a relatively new research area. In this paper, Latent Semantic Analysis (LSA) is first used to extract semantic knowledge from a given document, all question paragraphs are identified,an automatic text segmentation approach analogous to TextTiling is exploited to improve the precision of correlating question paragraphs and answer paragraphs, and finally some "important" sentences are extracted from the generic content and the question-answer pairs to generate a complete summary. Experimental results showed that our approach is highly efficient and improves significantly the coherence of the summary while not compromising informativeness.

  16. Segmentation of Bone Structure in X-ray Images using Convolutional Neural Network

    Directory of Open Access Journals (Sweden)

    CERNAZANU-GLAVAN, C.

    2013-02-01

    Full Text Available The segmentation process represents a first step necessary for any automatic method of extracting information from an image. In the case of X-ray images, through segmentation we can differentiate the bone tissue from the rest of the image. There are nowadays several segmentation techniques, but in general, they all require the human intervention in the segmentation process. Consequently, this article proposes a new segmentation method for the X-ray images using a Convolutional Neural Network (CNN. In present, the convolutional networks are the best techniques for image segmentation. This fact is demonstrated by their wide usage in all the fields, including the medical one. As the X-ray images have large dimensions, for reducing the training time, the method proposed by the present article selects only certain areas (maximum interest areas from the entire image. The neural network is used as pixel classifier thus causing the label of each pixel (bone or none-bone from a raw pixel values in a square area. We will also present the method through which the network final configuration was chosen and we will make a comparative analysis with other 3 CNN configurations. The network chosen by us obtained the best results for all the evaluation metrics used, i.e. warping error, rand error and pixel error.

  17. Simultaneous hierarchical segmentation and vectorization of satellite images through combined data sampling and anisotropic triangulation

    Energy Technology Data Exchange (ETDEWEB)

    Grazzini, Jacopo [Los Alamos National Laboratory; Prasad, Lakshman [Los Alamos National Laboratory; Dillard, Scott [PNNL

    2010-10-21

    The automatic detection, recognition , and segmentation of object classes in remote sensed images is of crucial importance for scene interpretation and understanding. However, it is a difficult task because of the high variability of satellite data. Indeed, the observed scenes usually exhibit a high degree of complexity, where complexity refers to the large variety of pictorial representations of objects with the same semantic meaning and also to the extensive amount of available det.ails. Therefore, there is still a strong demand for robust techniques for automatic information extraction and interpretation of satellite images. In parallel, there is a growing interest in techniques that can extract vector features directly from such imagery. In this paper, we investigate the problem of automatic hierarchical segmentation and vectorization of multispectral satellite images. We propose a new algorithm composed of the following steps: (i) a non-uniform sampling scheme extracting most salient pixels in the image, (ii) an anisotropic triangulation constrained by the sampled pixels taking into account both strength and directionality of local structures present in the image, (iii) a polygonal grouping scheme merging, through techniques based on perceptual information , the obtained segments to a smaller quantity of superior vectorial objects. Besides its computational efficiency, this approach provides a meaningful polygonal representation for subsequent image analysis and/or interpretation.

  18. Automatic detection of blurred images in UAV image sets

    Science.gov (United States)

    Sieberth, Till; Wackrow, Rene; Chandler, Jim H.

    2016-12-01

    Unmanned aerial vehicles (UAV) have become an interesting and active research topic for photogrammetry. Current research is based on images acquired by an UAV, which have a high ground resolution and good spectral and radiometrical resolution, due to the low flight altitudes combined with a high resolution camera. UAV image flights are also cost effective and have become attractive for many applications including, change detection in small scale areas. One of the main problems preventing full automation of data processing of UAV imagery is the degradation effect of blur caused by camera movement during image acquisition. This can be caused by the normal flight movement of the UAV as well as strong winds, turbulence or sudden operator inputs. This blur disturbs the visual analysis and interpretation of the data, causes errors and can degrade the accuracy in automatic photogrammetric processing algorithms. The detection and removal of these images is currently achieved manually, which is both time consuming and prone to error, particularly for large image-sets. To increase the quality of data processing an automated process is necessary, which must be both reliable and quick. This paper describes the development of an automatic filtering process, which is based upon the quantification of blur in an image. Images with known blur are processed digitally to determine a quantifiable measure of image blur. The algorithm is required to process UAV images fast and reliably to relieve the operator from detecting blurred images manually. The newly developed method makes it possible to detect blur caused by linear camera displacement and is based on human detection of blur. Humans detect blurred images best by comparing it to other images in order to establish whether an image is blurred or not. The developed algorithm simulates this procedure by creating an image for comparison using image processing. Creating internally a comparable image makes the method independent of

  19. Segmentation algorithm of intervertebral disc magnetic resonance images based on two-dimensional automatic active shape model%基于二维自动主动形状模型的椎间盘核磁共振图像分割算法

    Institute of Scientific and Technical Information of China (English)

    符晓娟; 黄东军

    2013-01-01

    针对椎间盘手动建模主观耗时以及现有分割方法不够准确的问题,提出了一种二维自动主动形状模型(2D-AASM)方法,由基于最小描述长度的椎间盘自动统计形状建模、二维局部梯度建模和分割三部分组成.将25组脊柱核磁共振图像(MRI)的椎间盘专家分割结果作为训练集,采用基于最小描述长度的方法确定点对应关系,建立椎间盘T4-5的统计形状模型和二维局部梯度模型,生成形状模型的方差和目标函数值均小于手工和弧长参数方法.模型建立后,通过3组脊柱MRI数据测试提出的分割方法,与传统主动形状模型(ASM)和加入一维局部梯度模型的ASM方法相比,其分割结果具有更高的戴斯系数值,更低的过分割率和欠分割率.实验结果表明,所提方法建立的模型更准确,分割结果更精确.%In response to the issue that the intervertebral disk manual modeling was time-consuming and subjective,and the existing segmentation method was not accurate enough,a new method named two-diememsional Automatic Active Shape Model (2D-AASM) was proposed.It included three parts:automatic statistical shape modeling of intervertebral disk based on minimum description length,2D local gradient modeling and segmentation.Adopting the manual segmentation results of 25 sets of spinal MR images as the training set,the study used minimum description length method to determine the point correspondence,built statistical shape model and 2D local gradient model for intervertebral disk T4-5.The generated shape model had lower variance and the objective function value than the manual and arc length parameter method.After the model was built,three sets of Magnetic Resonance Image (MRI) images were used to test the proposed method.Compared with the traditional ASM and 1 D-ASM,the segmentation result of the proposed method had a higher Dice coefficient and lower oversegmentation and under-segmentation rate.The experiment results

  20. Automatic segmentation of coronary artery tree based on multiscale Gabor filtering and transition region extraction

    Science.gov (United States)

    Wang, Fang; Wang, Guozhu; Kang, Lie; Wang, Juan

    2011-11-01

    This paper presents a novel segmentation method for extracting coronary artery tree from angiogram, which is based on multiscale Gabor filtering and transition region extraction. Firstly the enhanced image is obtained after multiscale Gabor filtering, then the transition region of the enhanced image is extracted using the local complexity algorithm, and the final segmentation threshold is calculated, finally the image segmentation is achieved. To evaluate the performance of the proposed approach, we carried out experiments on various sets of angiographic images, and compared its effects with those of the improved top-hat segmentation method. The experiments indicate that the proposed method outperforms the latter method about better extraction of small vessels, more background elimination, better visualized coronary artery tree and continuity of the vessels.

  1. Image Segmentation for Connectomics Using Machine Learning

    Energy Technology Data Exchange (ETDEWEB)

    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.

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

    Science.gov (United States)

    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. SAR image segmentation with entropy ranking based adaptive semi-supervised spectral clustering

    Science.gov (United States)

    Zhang, Xiangrong; Yang, Jie; Hou, Biao; Jiao, Licheng

    2010-10-01

    Spectral clustering has become one of the most popular modern clustering algorithms in recent years. In this paper, a new algorithm named entropy ranking based adaptive semi-supervised spectral clustering for SAR image segmentation is proposed. We focus not only on finding a suitable scaling parameter but also determining automatically the cluster number with the entropy ranking theory. Also, two kinds of constrains must-link and cannot-link based semi-supervised spectral clustering is applied to gain better segmentation results. Experimental results on SAR images show that the proposed method outperforms other spectral clustering algorithms.

  4. An Interactive Image Segmentation Method in Hand Gesture Recognition.

    Science.gov (United States)

    Chen, Disi; Li, Gongfa; Sun, Ying; Kong, Jianyi; Jiang, Guozhang; Tang, Heng; Ju, Zhaojie; Yu, Hui; Liu, Honghai

    2017-01-27

    In order to improve the recognition rate of hand gestures a new interactive image segmentation method for hand gesture recognition is presented, and popular methods, e.g., Graph cut, Random walker, Interactive image segmentation using geodesic star convexity, are studied in this article. The Gaussian Mixture Model was employed for image modelling and the iteration of Expectation Maximum algorithm learns the parameters of Gaussian Mixture Model. We apply a Gibbs random field to the image segmentation and minimize the Gibbs Energy using Min-cut theorem to find the optimal segmentation. The segmentation result of our method is tested on an image dataset and compared with other methods by estimating the region accuracy and boundary accuracy. Finally five kinds of hand gestures in different backgrounds are tested on our experimental platform, and the sparse representation algorithm is used, proving that the segmentation of hand gesture images helps to improve the recognition accuracy.

  5. Automatic detection and segmentation of stems of potted tomato plant using Kinect

    Science.gov (United States)

    Fu, Daichang; Xu, Lihong; Li, Dawei; Xin, Longjiao

    2014-04-01

    The automatic segmentation and recognition of greenhouse crop is an important aspect in digitized facility agriculture. Crop stems are closely related with the growth of the crop. Meanwhile, they are also an important physiological trait to identify the species of plants. For these reasons, this paper focuses on the digitization process to collect and analysis stems of greenhouse plants (tomatoes). An algorithm for automatic stem detection and extraction is proposed, based on a cheap and effective stereo vision system—Kinect. In order to demonstrate the usefulness and the potential applicability of our algorithm, a virtual tomato plant, whose stems are rendered by segmented stem texture samples, is reconstructed on OpenGL graphic platform.

  6. The Research of ECG Signal Automatic Segmentation Algorithm Based on Fractal Dimension Trajectory

    Institute of Scientific and Technical Information of China (English)

    2010-01-01

    <正>In this paper a kind of ECG signal automatic segmentation algorithm based on ECG fractal dimension trajectory is put forward.First,the ECG signal will be analyzed,then constructing the fractal dimension trajectory of ECG signal according to the fractal dimension trajectory constructing algorithm,finally,obtaining ECG signal feature points and ECG automatic segmentation will be realized by the feature of ECG signal fractal dimension trajectory and the feature of ECG frequency domain characteristics.Through Matlab simulation of the algorithm,the results showed that by constructing the ECG fractal dimension trajectory enables ECG location of each component displayed clearly and obtains high success rate of sub-ECG,providing a basis to identify the various components of ECG signal accurately.

  7. SVM for density estimation and application to medical image segmentation

    Institute of Scientific and Technical Information of China (English)

    ZHANG Zhao; ZHANG Su; ZHANG Chen-xi; CHEN Ya-zhu

    2006-01-01

    A method of medical image segmentation based on support vector machine (SVM) for density estimation is presented. We used this estimator to construct a prior model of the image intensity and curvature profile of the structure from training images. When segmenting a novel image similar to the training images, the technique of narrow level set method is used. The higher dimensional surface evolution metric is defined by the prior model instead of by energy minimization function. This method offers several advantages. First, SVM for density estimation is consistent and its solution is sparse. Second, compared to the traditional level set methods, this method incorporates shape information on the object to be segmented into the segmentation process.Segmentation results are demonstrated on synthetic images, MR images and ultrasonic images.

  8. A Survey Paper on Fuzzy Image Segmentation Techniques

    Directory of Open Access Journals (Sweden)

    Ms. R. Saranya Pon Selvi

    2014-03-01

    Full Text Available The image segmentation plays an important role in the day-to-day life. The new technologies are emerging in the field of Image processing, especially in the domain of segmentation.Segmentation is considered as one of the main steps in image processing. It divides a digital image into multiple regions in order to analyze them. It is also used to distinguish different objects in the image. Several image segmentation techniques have been developed by the researchers in order to make images smooth and easy to evaluate. This paper presents a brief outline on some of the most commonly used segmentation techniques like thresholding, Region based, Model based, Edge detection..etc. mentioning its advantages as well as the drawbacks. Some of the techniques are suitable for noisy images.

  9. A CT Image Segmentation Algorithm Based on Level Set Method

    Institute of Scientific and Technical Information of China (English)

    QU Jing-yi; SHI Hao-shan

    2006-01-01

    Level Set methods are robust and efficient numerical tools for resolving curve evolution in image segmentation. This paper proposes a new image segmentation algorithm based on Mumford-Shah module. The method is used to CT images and the experiment results demonstrate its efficiency and veracity.

  10. SAR image target segmentation based on entropy maximization and morphology

    Institute of Scientific and Technical Information of China (English)

    柏正尧; 刘洲峰; 何佩琨

    2004-01-01

    Entropy maximization thresholding is a simple, effective image segmentation method. The relation between the histogram entropy and the gray level of an image is analyzed. An approach, which speeds the computation of optimal threshold based on entropy maximization, is proposed. The suggested method has been applied to the synthetic aperture radar (SAR) image targets segmentation. Mathematical morphology works well in reducing the residual noise.

  11. Application of reinforcement learning for segmentation of transrectal ultrasound images

    Directory of Open Access Journals (Sweden)

    Tizhoosh Hamid R

    2008-04-01

    Full Text Available Abstract Background Among different medical image modalities, ultrasound imaging has a very widespread clinical use. But, due to some factors, such as poor image contrast, noise and missing or diffuse boundaries, the ultrasound images are inherently difficult to segment. An important application is estimation of the location and volume of the prostate in transrectal ultrasound (TRUS images. For this purpose, manual segmentation is a tedious and time consuming procedure. Methods We introduce a new method for the segmentation of the prostate in transrectal ultrasound images, using a reinforcement learning scheme. This algorithm is used to find the appropriate local values for sub-images and to extract the prostate. It contains an offline stage, where the reinforcement learning agent uses some images and manually segmented versions of these images to learn from. The reinforcement agent is provided with reward/punishment, determined objectively to explore/exploit the solution space. After this stage, the agent has acquired knowledge stored in the Q-matrix. The agent can then use this knowledge for new input images to extract a coarse version of the prostate. Results We have carried out experiments to segment TRUS images. The results demonstrate the potential of this approach in the field of medical image segmentation. Conclusion By using the proposed method, we can find the appropriate local values and segment the prostate. This approach can be used for segmentation tasks containing one object of interest. To improve this prototype, more investigations are needed.

  12. Determining the number of clusters for nuclei segmentation in breast cancer image

    Science.gov (United States)

    Fatichah, Chastine; Navastara, Dini Adni; Suciati, Nanik; Nuraini, Lubna

    2017-02-01

    Clustering is commonly technique for image segmentation, however determining an appropriate number of clusters is still challenging. Due to nuclei variation of size and shape in breast cancer image, an automatic determining number of clusters for segmenting the nuclei breast cancer is proposed. The phase of nuclei segmentation in breast cancer image are nuclei detection, touched nuclei detection, and touched nuclei separation. We use the Gram-Schmidt for nuclei cell detection, the geometry feature for touched nuclei detection, and combining of watershed and spatial k-Means clustering for separating the touched nuclei in breast cancer image. The spatial k-Means clustering is employed for separating the touched nuclei, however automatically determine the number of clusters is difficult due to the variation of size and shape of single cell breast cancer. To overcome this problem, first we apply watershed algorithm to separate the touched nuclei and then we calculate the distance among centroids in order to solve the over-segmentation. We merge two centroids that have the distance below threshold. And the new of number centroid as input to segment the nuclei cell using spatial k- Means algorithm. Experiment show that, the proposed scheme can improve the accuracy of nuclei cell counting.

  13. Graph Laplacian for spectral clustering and seeded image segmentation

    OpenAIRE

    Wallace Correa de Oliveira Casaca

    2014-01-01

    Image segmentation is an essential tool to enhance the ability of computer systems to efficiently perform elementary cognitive tasks such as detection, recognition and tracking. In this thesis we concentrate on the investigation of two fundamental topics in the context of image segmentation: spectral clustering and seeded image segmentation. We introduce two new algorithms for those topics that, in summary, rely on Laplacian-based operators, spectral graph theory, and minimization of energy f...

  14. Advanced techniques in medical image segmentation of the liver

    OpenAIRE

    López Mir, Fernando

    2016-01-01

    [EN] Image segmentation is, along with multimodal and monomodal registration, the operation with the greatest applicability in medical image processing. There are many operations and filters, as much as applications and cases, where the segmentation of an organic tissue is the first step. The case of liver segmentation in radiological images is, after the brain, that on which the highest number of scientific publications can be found. This is due, on the one hand, to the need to continue inno...

  15. Semi-supervised segmentation of ultrasound images based on patch representation and continuous min cut.

    Directory of Open Access Journals (Sweden)

    Anca Ciurte

    Full Text Available Ultrasound segmentation is a challenging problem due to the inherent speckle and some artifacts like shadows, attenuation and signal dropout. Existing methods need to include strong priors like shape priors or analytical intensity models to succeed in the segmentation. However, such priors tend to limit these methods to a specific target or imaging settings, and they are not always applicable to pathological cases. This work introduces a semi-supervised segmentation framework for ultrasound imaging that alleviates the limitation of fully automatic segmentation, that is, it is applicable to any kind of target and imaging settings. Our methodology uses a graph of image patches to represent the ultrasound image and user-assisted initialization with labels, which acts as soft priors. The segmentation problem is formul