Science.gov

Sample records for anatomy segmentation algorithm

  1. An artifact-robust, shape library-based algorithm for automatic segmentation of inner ear anatomy in post-cochlear-implantation CT

    NASA Astrophysics Data System (ADS)

    Reda, Fitsum A.; Noble, Jack H.; Labadie, Robert F.; Dawant, Benoit M.

    2014-03-01

    A cochlear implant (CI) is a device that restores hearing using an electrode array that is surgically placed in the cochlea. After implantation, the CI is programmed to attempt to optimize hearing outcome. Currently, we are testing an imageguided CI programming (IGCIP) technique we recently developed that relies on knowledge of relative position of intracochlear anatomy to implanted electrodes. IGCIP is enabled by a number of algorithms we developed that permit determining the positions of electrodes relative to intra-cochlear anatomy using a pre- and a post-implantation CT. One issue with this technique is that it cannot be used for many subjects for whom a pre-implantation CT was not acquired. Pre-implantation CT has been necessary because it is difficult to localize the intra-cochlear structures in post-implantation CTs alone due to the image artifacts that obscure the cochlea. In this work, we present an algorithm for automatically segmenting intra-cochlear anatomy in post-implantation CTs. Our approach is to first identify the labyrinth and then use its position as a landmark to localize the intra-cochlea anatomy. Specifically, we identify the labyrinth by first approximately estimating its position by mapping a labyrinth surface of another subject that is selected from a library of such surfaces and then refining this estimate by a standard shape model-based segmentation method. We tested our approach on 10 ears and achieved overall mean and maximum errors of 0.209 and 0.98 mm, respectively. This result suggests that our approach is accurate enough for developing IGCIP strategies based solely on post-implantation CTs.

  2. Anatomy-aware measurement of segmentation accuracy

    NASA Astrophysics Data System (ADS)

    Tizhoosh, H. R.; Othman, A. A.

    2016-03-01

    Quantifying the accuracy of segmentation and manual delineation of organs, tissue types and tumors in medical images is a necessary measurement that suffers from multiple problems. One major shortcoming of all accuracy measures is that they neglect the anatomical significance or relevance of different zones within a given segment. Hence, existing accuracy metrics measure the overlap of a given segment with a ground-truth without any anatomical discrimination inside the segment. For instance, if we understand the rectal wall or urethral sphincter as anatomical zones, then current accuracy measures ignore their significance when they are applied to assess the quality of the prostate gland segments. In this paper, we propose an anatomy-aware measurement scheme for segmentation accuracy of medical images. The idea is to create a "master gold" based on a consensus shape containing not just the outline of the segment but also the outlines of the internal zones if existent or relevant. To apply this new approach to accuracy measurement, we introduce the anatomy-aware extensions of both Dice coefficient and Jaccard index and investigate their effect using 500 synthetic prostate ultrasound images with 20 different segments for each image. We show that through anatomy-sensitive calculation of segmentation accuracy, namely by considering relevant anatomical zones, not only the measurement of individual users can change but also the ranking of users' segmentation skills may require reordering.

  3. Automatic segmentation of intra-cochlear anatomy in post-implantation CT

    NASA Astrophysics Data System (ADS)

    Reda, Fitsum A.; Dawant, Benoit M.; McRackan, Theodore R.; Labadie, Robert F.; Noble, Jack H.

    2013-03-01

    A cochlear implant (CI) is a neural prosthetic device that restores hearing by directly stimulating the auditory nerve with an electrode array. In CI surgery, the surgeon threads the electrode array into the cochlea, blind to internal structures. We have recently developed algorithms for determining the position of CI electrodes relative to intra-cochlear anatomy using pre- and post-implantation CT. We are currently using this approach to develop a CI programming assistance system that uses knowledge of electrode position to determine a patient-customized CI sound processing strategy. However, this approach cannot be used for the majority of CI users because the cochlea is obscured by image artifacts produced by CI electrodes and acquisition of pre-implantation CT is not universal. In this study we propose an approach that extends our techniques so that intra-cochlear anatomy can be segmented for CI users for which pre-implantation CT was not acquired. The approach achieves automatic segmentation of intra-cochlear anatomy in post-implantation CT by exploiting intra-subject symmetry in cochlear anatomy across ears. We validated our approach on a dataset of 10 ears in which both pre- and post-implantation CTs were available. Our approach results in mean and maximum segmentation errors of 0.27 and 0.62 mm, respectively. This result suggests that our automatic segmentation approach is accurate enough for developing customized CI sound processing strategies for unilateral CI patients based solely on postimplantation CT scans.

  4. Masseter segmentation using an improved watershed algorithm with unsupervised classification.

    PubMed

    Ng, H P; Ong, S H; Foong, K W C; Goh, P S; Nowinski, W L

    2008-02-01

    The watershed algorithm always produces a complete division of the image. However, it is susceptible to over-segmentation and sensitivity to false edges. In medical images this leads to unfavorable representations of the anatomy. We address these drawbacks by introducing automated thresholding and post-segmentation merging. The automated thresholding step is based on the histogram of the gradient magnitude map while post-segmentation merging is based on a criterion which measures the similarity in intensity values between two neighboring partitions. Our improved watershed algorithm is able to merge more than 90% of the initial partitions, which indicates that a large amount of over-segmentation has been reduced. To further improve the segmentation results, we make use of K-means clustering to provide an initial coarse segmentation of the highly textured image before the improved watershed algorithm is applied to it. When applied to the segmentation of the masseter from 60 magnetic resonance images of 10 subjects, the proposed algorithm achieved an overlap index (kappa) of 90.6%, and was able to merge 98% of the initial partitions on average. The segmentation results are comparable to those obtained using the gradient vector flow snake. PMID:17950265

  5. An algorithm for segmenting range imagery

    SciTech Connect

    Roberts, R.S.

    1997-03-01

    This report describes the technical accomplishments of the FY96 Cross Cutting and Advanced Technology (CC&AT) project at Los Alamos National Laboratory. The project focused on developing algorithms for segmenting range images. The image segmentation algorithm developed during the project is described here. In addition to segmenting range images, the algorithm can fuse multiple range images thereby providing true 3D scene models. The algorithm has been incorporated into the Rapid World Modelling System at Sandia National Laboratory.

  6. Measuring the success of video segmentation algorithms

    NASA Astrophysics Data System (ADS)

    Power, Gregory J.

    2001-12-01

    Appropriate segmentation of video is a key step for applications such as video surveillance, video composing, video compression, storage and retrieval, and automated target recognition. Video segmentation algorithms involve dissecting the video into scenes based on shot boundaries as well as local objects and events based on spatial shape and regional motions. Many algorithmic approaches to video segmentation have been recently reported, but many lack measures to quantify the success of the segmentation especially in comparison to other algorithms. This paper suggests multiple bench-top measures for evaluating video segmentation. The paper suggests that the measures are most useful when 'truth' data about the video is available such as precise frame-by- frame object shape. When precise 'truth' data is unavailable, this paper suggests using hand-segmented 'truth' data to measure the success of the video segmentation. Thereby, the ability of the video segmentation algorithm to achieve the same quality of segmentation as the human is obtained in the form of a variance in multiple measures. The paper introduces a suite of measures, each scaled from zero to one. A score of one on a particular measure is a perfect score for a singular segmentation measure. Measures are introduced to evaluate the ability of a segmentation algorithm to correctly detect shot boundaries, to correctly determine spatial shape and to correctly determine temporal shape. The usefulness of the measures are demonstrated on a simple segmenter designed to detect and segment a ping pong ball from a table tennis image sequence.

  7. An algorithm for segmenting polarimetric SAR imagery

    NASA Astrophysics Data System (ADS)

    Geaga, Jorge V.

    2015-05-01

    We have developed an algorithm for segmenting fully polarimetric single look TerraSAR-X, multilook SIR-C and 7 band Landsat 5 imagery using neural nets. The algorithm uses a feedforward neural net with one hidden layer to segment different surface classes. The weights are refined through an iterative filtering process characteristic of a relaxation process. Features selected from studies of fully polarimetric complex single look TerraSAR-X data and multilook SIR-C data are used as input to the net. The seven bands from Landsat 5 data are used as input for the Landsat neural net. The Cloude-Pottier incoherent decomposition is used to investigate the physical basis of the polarimetric SAR data segmentation. The segmentation of a SIR-C ocean surface scene into four classes is presented. This segmentation algorithm could be a very useful tool for investigating complex polarimetric SAR phenomena.

  8. A segmentation algorithm for noisy images

    SciTech Connect

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

    1996-12-31

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

  9. Medical anatomy segmentation kit: combining 2D and 3D segmentation methods to enhance functionality

    NASA Astrophysics Data System (ADS)

    Tracton, Gregg S.; Chaney, Edward L.; Rosenman, Julian G.; Pizer, Stephen M.

    1994-07-01

    Image segmentation, in particular, defining normal anatomic structures and diseased or malformed tissue from tomographic images, is common in medical applications. Defining tumors or arterio-venous malformation from computed tomography or magnetic resonance images are typical examples. This paper describes a program, Medical Anatomy Segmentation Kit (MASK), whose design acknowledges that no single segmentation technique has proven to be successful or optimal for all object definition tasks associated with medical images. A practical solution is offered through a suite of complementary user-guided segmentation techniques and extensive manual editing functions to reach the final object definition goal. Manual editing can also be used to define objects which are abstract or otherwise not well represented in the image data and so require direct human definition - e.g., a radiotherapy target volume which requires human knowledge and judgement regarding image interpretation and tumor spread characteristics. Results are either in the form of 2D boundaries or regions of labeled pixels or voxels. MASK currently uses thresholding and edge detection to form contours, and 2D or 3D scale-sensitive fill and region algebra to form regions. In addition to these proven techniques, MASK's architecture anticipates clinically practical automatic 2D and 3D segmentation methods of the future.

  10. Heart region segmentation from low-dose CT scans: an anatomy based approach

    NASA Astrophysics Data System (ADS)

    Reeves, Anthony P.; Biancardi, Alberto M.; Yankelevitz, David F.; Cham, Matthew D.; Henschke, Claudia I.

    2012-02-01

    Cardiovascular disease is a leading cause of death in developed countries. The concurrent detection of heart diseases during low-dose whole-lung CT scans (LDCT), typically performed as part of a screening protocol, hinges on the accurate quantification of coronary calcification. The creation of fully automated methods is ideal as complete manual evaluation is imprecise, operator dependent, time consuming and thus costly. The technical challenges posed by LDCT scans in this context are mainly twofold. First, there is a high level image noise arising from the low radiation dose technique. Additionally, there is a variable amount of cardiac motion blurring due to the lack of electrocardiographic gating and the fact that heart rates differ between human subjects. As a consequence, the reliable segmentation of the heart, the first stage toward the implementation of morphologic heart abnormality detection, is also quite challenging. An automated computer method based on a sequential labeling of major organs and determination of anatomical landmarks has been evaluated on a public database of LDCT images. The novel algorithm builds from a robust segmentation of the bones and airways and embodies a stepwise refinement starting at the top of the lungs where image noise is at its lowest and where the carina provides a good calibration landmark. The segmentation is completed at the inferior wall of the heart where extensive image noise is accommodated. This method is based on the geometry of human anatomy and does not involve training through manual markings. Using visual inspection by an expert reader as a gold standard, the algorithm achieved successful heart and major vessel segmentation in 42 of 45 low-dose CT images. In the 3 remaining cases, the cardiac base was over segmented due to incorrect hemidiaphragm localization.

  11. Image segmentation using an improved differential algorithm

    NASA Astrophysics Data System (ADS)

    Gao, Hao; Shi, Yujiao; Wu, Dongmei

    2014-10-01

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

  12. Segmentation precision of abdominal anatomy for MRI-based radiotherapy

    SciTech Connect

    Noel, Camille E.; Zhu, Fan; Lee, Andrew Y.; Yanle, Hu; Parikh, Parag J.

    2014-10-01

    The limited soft tissue visualization provided by computed tomography, the standard imaging modality for radiotherapy treatment planning and daily localization, has motivated studies on the use of magnetic resonance imaging (MRI) for better characterization of treatment sites, such as the prostate and head and neck. However, no studies have been conducted on MRI-based segmentation for the abdomen, a site that could greatly benefit from enhanced soft tissue targeting. We investigated the interobserver and intraobserver precision in segmentation of abdominal organs on MR images for treatment planning and localization. Manual segmentation of 8 abdominal organs was performed by 3 independent observers on MR images acquired from 14 healthy subjects. Observers repeated segmentation 4 separate times for each image set. Interobserver and intraobserver contouring precision was assessed by computing 3-dimensional overlap (Dice coefficient [DC]) and distance to agreement (Hausdorff distance [HD]) of segmented organs. The mean and standard deviation of intraobserver and interobserver DC and HD values were DC{sub intraobserver} = 0.89 ± 0.12, HD{sub intraobserver} = 3.6 mm ± 1.5, DC{sub interobserver} = 0.89 ± 0.15, and HD{sub interobserver} = 3.2 mm ± 1.4. Overall, metrics indicated good interobserver/intraobserver precision (mean DC > 0.7, mean HD < 4 mm). Results suggest that MRI offers good segmentation precision for abdominal sites. These findings support the utility of MRI for abdominal planning and localization, as emerging MRI technologies, techniques, and onboard imaging devices are beginning to enable MRI-based radiotherapy.

  13. Segmentation precision of abdominal anatomy for MRI-based radiotherapy.

    PubMed

    Noel, Camille E; Zhu, Fan; Lee, Andrew Y; Yanle, Hu; Parikh, Parag J

    2014-01-01

    The limited soft tissue visualization provided by computed tomography, the standard imaging modality for radiotherapy treatment planning and daily localization, has motivated studies on the use of magnetic resonance imaging (MRI) for better characterization of treatment sites, such as the prostate and head and neck. However, no studies have been conducted on MRI-based segmentation for the abdomen, a site that could greatly benefit from enhanced soft tissue targeting. We investigated the interobserver and intraobserver precision in segmentation of abdominal organs on MR images for treatment planning and localization. Manual segmentation of 8 abdominal organs was performed by 3 independent observers on MR images acquired from 14 healthy subjects. Observers repeated segmentation 4 separate times for each image set. Interobserver and intraobserver contouring precision was assessed by computing 3-dimensional overlap (Dice coefficient [DC]) and distance to agreement (Hausdorff distance [HD]) of segmented organs. The mean and standard deviation of intraobserver and interobserver DC and HD values were DC(intraobserver) = 0.89 ± 0.12, HD(intraobserver) = 3.6mm ± 1.5, DC(interobserver) = 0.89 ± 0.15, and HD(interobserver) = 3.2mm ± 1.4. Overall, metrics indicated good interobserver/intraobserver precision (mean DC > 0.7, mean HD < 4mm). Results suggest that MRI offers good segmentation precision for abdominal sites. These findings support the utility of MRI for abdominal planning and localization, as emerging MRI technologies, techniques, and onboard imaging devices are beginning to enable MRI-based radiotherapy.

  14. Improving Brain Magnetic Resonance Image (MRI) Segmentation via a Novel Algorithm based on Genetic and Regional Growth

    PubMed Central

    A., Javadpour; A., Mohammadi

    2016-01-01

    Background Regarding the importance of right diagnosis in medical applications, various methods have been exploited for processing medical images solar. The method of segmentation is used to analyze anal to miscall structures in medical imaging. Objective This study describes a new method for brain Magnetic Resonance Image (MRI) segmentation via a novel algorithm based on genetic and regional growth. Methods Among medical imaging methods, brains MRI segmentation is important due to high contrast of non-intrusive soft tissue and high spatial resolution. Size variations of brain tissues are often accompanied by various diseases such as Alzheimer’s disease. As our knowledge about the relation between various brain diseases and deviation of brain anatomy increases, MRI segmentation is exploited as the first step in early diagnosis. In this paper, regional growth method and auto-mate selection of initial points by genetic algorithm is used to introduce a new method for MRI segmentation. Primary pixels and similarity criterion are automatically by genetic algorithms to maximize the accuracy and validity in image segmentation. Results By using genetic algorithms and defining the fixed function of image segmentation, the initial points for the algorithm were found. The proposed algorithms are applied to the images and results are manually selected by regional growth in which the initial points were compared. The results showed that the proposed algorithm could reduce segmentation error effectively. Conclusion The study concluded that the proposed algorithm could reduce segmentation error effectively and help us to diagnose brain diseases. PMID:27672629

  15. Improving Brain Magnetic Resonance Image (MRI) Segmentation via a Novel Algorithm based on Genetic and Regional Growth

    PubMed Central

    A., Javadpour; A., Mohammadi

    2016-01-01

    Background Regarding the importance of right diagnosis in medical applications, various methods have been exploited for processing medical images solar. The method of segmentation is used to analyze anal to miscall structures in medical imaging. Objective This study describes a new method for brain Magnetic Resonance Image (MRI) segmentation via a novel algorithm based on genetic and regional growth. Methods Among medical imaging methods, brains MRI segmentation is important due to high contrast of non-intrusive soft tissue and high spatial resolution. Size variations of brain tissues are often accompanied by various diseases such as Alzheimer’s disease. As our knowledge about the relation between various brain diseases and deviation of brain anatomy increases, MRI segmentation is exploited as the first step in early diagnosis. In this paper, regional growth method and auto-mate selection of initial points by genetic algorithm is used to introduce a new method for MRI segmentation. Primary pixels and similarity criterion are automatically by genetic algorithms to maximize the accuracy and validity in image segmentation. Results By using genetic algorithms and defining the fixed function of image segmentation, the initial points for the algorithm were found. The proposed algorithms are applied to the images and results are manually selected by regional growth in which the initial points were compared. The results showed that the proposed algorithm could reduce segmentation error effectively. Conclusion The study concluded that the proposed algorithm could reduce segmentation error effectively and help us to diagnose brain diseases.

  16. 3D automatic anatomy segmentation based on iterative graph-cut-ASM

    SciTech Connect

    Chen, Xinjian; Bagci, Ulas

    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

  17. CT segmentation of dental shapes by anatomy-driven reformation imaging and B-spline modelling.

    PubMed

    Barone, S; Paoli, A; Razionale, A V

    2016-06-01

    Dedicated imaging methods are among the most important tools of modern computer-aided medical applications. In the last few years, cone beam computed tomography (CBCT) has gained popularity in digital dentistry for 3D imaging of jawbones and teeth. However, the anatomy of a maxillofacial region complicates the assessment of tooth geometry and anatomical location when using standard orthogonal views of the CT data set. In particular, a tooth is defined by a sub-region, which cannot be easily separated from surrounding tissues by only considering pixel grey-intensity values. For this reason, an image enhancement is usually necessary in order to properly segment tooth geometries. In this paper, an anatomy-driven methodology to reconstruct individual 3D tooth anatomies by processing CBCT data is presented. The main concept is to generate a small set of multi-planar reformation images along significant views for each target tooth, driven by the individual anatomical geometry of a specific patient. The reformation images greatly enhance the clearness of the target tooth contours. A set of meaningful 2D tooth contours is extracted and used to automatically model the overall 3D tooth shape through a B-spline representation. The effectiveness of the methodology has been verified by comparing some anatomy-driven reconstructions of anterior and premolar teeth with those obtained by using standard tooth segmentation tools. Copyright © 2015 John Wiley & Sons, Ltd. PMID:26418417

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

    NASA Astrophysics Data System (ADS)

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

    2013-03-01

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

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

    NASA Astrophysics Data System (ADS)

    Park, Sang Joon; Kim, Jung Im; Goo, Jin Mo; Lee, Doohee

    2014-03-01

    Lung lobar segmentation in CT images is a challenging tasks because of the limitations in image quality inherent to CT image acquisition, especially low-dose CT for clinical routine environment. Besides, complex anatomy and abnormal lesions in the lung parenchyma makes segmentation difficult because contrast in CT images are determined by the differential absorption of X-rays by neighboring structures, such as tissue, vessel or several pathological conditions. Thus, we attempted to develop a robust segmentation technique for normal and diseased lung parenchyma. The images were obtained with low-dose chest CT using soft reconstruction kernel (Sensation 16, Siemens, Germany). Our PC-based in-house software segmented bronchial trees and lungs with intensity adaptive region-growing technique. Then the horizontal and oblique fissures were detected by using eigenvalues-ratio of the Hessian matrix in the lung regions which were excluded from airways and vessels. To enhance and recover the faithful 3-D fissure plane, our proposed fissure enhancing scheme were applied to the images. After finishing above steps, for careful smoothening of fissure planes, 3-D rolling-ball algorithm in xyz planes were performed. Results show that success rate of our proposed scheme was achieved up to 89.5% in the diseased lung parenchyma.

  20. Improved document image segmentation algorithm using multiresolution morphology

    NASA Astrophysics Data System (ADS)

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

    2011-01-01

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

  1. Research of the multimodal brain-tumor segmentation algorithm

    NASA Astrophysics Data System (ADS)

    Lu, Yisu; Chen, Wufan

    2015-12-01

    It is well-known that the number of clusters is one of the most important parameters for automatic segmentation. However, it is difficult to define owing to the high diversity in appearance of tumor tissue among different patients and the ambiguous boundaries of lesions. In this study, a nonparametric mixture of Dirichlet process (MDP) model is applied to segment the tumor images, and the MDP segmentation can be performed without the initialization of the number of clusters. A new nonparametric segmentation algorithm combined with anisotropic diffusion and a Markov random field (MRF) smooth constraint is proposed in this study. Besides the segmentation of single modal brain tumor images, we developed the algorithm to segment multimodal brain tumor images by the magnetic resonance (MR) multimodal features and obtain the active tumor and edema in the same time. The proposed algorithm is evaluated and compared with other approaches. The accuracy and computation time of our algorithm demonstrates very impressive performance.

  2. Segmentation of kidney using C-V model and anatomy priors

    NASA Astrophysics Data System (ADS)

    Lu, Jinghua; Chen, Jie; Zhang, Juan; Yang, Wenjia

    2007-12-01

    This paper presents an approach for kidney segmentation on abdominal CT images as the first step of a virtual reality surgery system. Segmentation for medical images is often challenging because of the objects' complicated anatomical structures, various gray levels, and unclear edges. A coarse to fine approach has been applied in the kidney segmentation using Chan-Vese model (C-V model) and anatomy prior knowledge. In pre-processing stage, the candidate kidney regions are located. Then C-V model formulated by level set method is applied in these smaller ROI, which can reduce the calculation complexity to a certain extent. At last, after some mathematical morphology procedures, the specified kidney structures have been extracted interactively with prior knowledge. The satisfying results on abdominal CT series show that the proposed approach keeps all the advantages of C-V model and overcome its disadvantages.

  3. Efficient Algorithms for Segmentation of Item-Set Time Series

    NASA Astrophysics Data System (ADS)

    Chundi, Parvathi; Rosenkrantz, Daniel J.

    We propose a special type of time series, which we call an item-set time series, to facilitate the temporal analysis of software version histories, email logs, stock market data, etc. In an item-set time series, each observed data value is a set of discrete items. We formalize the concept of an item-set time series and present efficient algorithms for segmenting a given item-set time series. Segmentation of a time series partitions the time series into a sequence of segments where each segment is constructed by combining consecutive time points of the time series. Each segment is associated with an item set that is computed from the item sets of the time points in that segment, using a function which we call a measure function. We then define a concept called the segment difference, which measures the difference between the item set of a segment and the item sets of the time points in that segment. The segment difference values are required to construct an optimal segmentation of the time series. We describe novel and efficient algorithms to compute segment difference values for each of the measure functions described in the paper. We outline a dynamic programming based scheme to construct an optimal segmentation of the given item-set time series. We use the item-set time series segmentation techniques to analyze the temporal content of three different data sets—Enron email, stock market data, and a synthetic data set. The experimental results show that an optimal segmentation of item-set time series data captures much more temporal content than a segmentation constructed based on the number of time points in each segment, without examining the item set data at the time points, and can be used to analyze different types of temporal data.

  4. Robust and accurate star segmentation algorithm based on morphology

    NASA Astrophysics Data System (ADS)

    Jiang, Jie; Lei, Liu; Guangjun, Zhang

    2016-06-01

    Star tracker is an important instrument of measuring a spacecraft's attitude; it measures a spacecraft's attitude by matching the stars captured by a camera and those stored in a star database, the directions of which are known. Attitude accuracy of star tracker is mainly determined by star centroiding accuracy, which is guaranteed by complete star segmentation. Current algorithms of star segmentation cannot suppress different interferences in star images and cannot segment stars completely because of these interferences. To solve this problem, a new star target segmentation algorithm is proposed on the basis of mathematical morphology. The proposed algorithm utilizes the margin structuring element to detect small targets and the opening operation to suppress noises, and a modified top-hat transform is defined to extract stars. A combination of three different structuring elements is utilized to define a new star segmentation algorithm, and the influence of three different structural elements on the star segmentation results is analyzed. Experimental results show that the proposed algorithm can suppress different interferences and segment stars completely, thus providing high star centroiding accuracy.

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

    NASA Astrophysics Data System (ADS)

    Ghosh, Payel; Mitchell, Melanie; Gold, Judith

    2010-01-01

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

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

    NASA Astrophysics Data System (ADS)

    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.

  7. An enhanced fast scanning algorithm for image segmentation

    NASA Astrophysics Data System (ADS)

    Ismael, Ahmed Naser; Yusof, Yuhanis binti

    2015-12-01

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

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

    PubMed

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

    2014-01-01

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

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

    NASA Astrophysics Data System (ADS)

    Sikka, Karan; Deserno, Thomas M.

    2010-02-01

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

  10. Pathological leucocyte segmentation algorithm based on hyperspectral imaging technique

    NASA Astrophysics Data System (ADS)

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

    2012-05-01

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

  11. GPU-accelerated MRF segmentation algorithm for SAR images

    NASA Astrophysics Data System (ADS)

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

    2012-06-01

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

  12. A segmentation algorithm of intracranial hemorrhage CT image

    NASA Astrophysics Data System (ADS)

    Wang, Haibo; Chen, Zhiguo; Wang, Jianzhi

    2011-10-01

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

  13. Mammographic images segmentation based on chaotic map clustering algorithm

    PubMed Central

    2014-01-01

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

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

    NASA Astrophysics Data System (ADS)

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

    1991-10-01

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

  15. Split Bregman's algorithm for three-dimensional mesh segmentation

    NASA Astrophysics Data System (ADS)

    Habiba, Nabi; Ali, Douik

    2016-05-01

    Variational methods have attracted a lot of attention in the literature, especially for image and mesh segmentation. The methods aim at minimizing the energy to optimize both edge and region detections. We propose a spectral mesh decomposition algorithm to obtain disjoint but meaningful regions of an input mesh. The related optimization problem is nonconvex, and it is very difficult to find a good approximation or global optimum, which represents a challenge in computer vision. We propose an alternating split Bregman algorithm for mesh segmentation, where we extended the image-dedicated model to a three-dimensional (3-D) mesh one. By applying our scheme to 3-D mesh segmentation, we obtain fast solvers that can outperform various conventional ones, such as graph-cut and primal dual methods. A consistent evaluation of the proposed method on various public domain 3-D databases for different metrics is elaborated, and a comparison with the state-of-the-art is performed.

  16. Evaluation of a segmentation algorithm designed for an FPGA implementation

    NASA Astrophysics Data System (ADS)

    Schwenk, Kurt; Schönermark, Maria; Huber, Felix

    2013-10-01

    The present work has to be seen in the context of real-time on-board image evaluation of optical satellite data. With on board image evaluation more useful data can be acquired, the time to get requested information can be decreased and new real-time applications are possible. Because of the relative high processing power in comparison to the low power consumption, Field Programmable Gate Array (FPGA) technology has been chosen as an adequate hardware platform for image processing tasks. One fundamental part for image evaluation is image segmentation. It is a basic tool to extract spatial image information which is very important for many applications such as object detection. Therefore a special segmentation algorithm using the advantages of FPGA technology has been developed. The aim of this work is the evaluation of this algorithm. Segmentation evaluation is a difficult task. The most common way for evaluating the performance of a segmentation method is still subjective evaluation, in which human experts determine the quality of a segmentation. This way is not in compliance with our needs. The evaluation process has to provide a reasonable quality assessment, should be objective, easy to interpret and simple to execute. To reach these requirements a so called Segmentation Accuracy Equality norm (SA EQ) was created, which compares the difference of two segmentation results. It can be shown that this norm is capable as a first quality measurement. Due to its objectivity and simplicity the algorithm has been tested on a specially chosen synthetic test model. In this work the most important results of the quality assessment will be presented.

  17. A shape constrained MAP-EM algorithm for colorectal segmentation

    NASA Astrophysics Data System (ADS)

    Wang, Huafeng; Li, Lihong; Song, Bowen; Han, Fangfang; Liang, Zhengrong

    2013-02-01

    The task of effectively segmenting colon areas in CT images is an important area of interest in medical imaging field. The ability to distinguish the colon wall in an image from the background is a critical step in several approaches for achieving larger goals in automated computer-aided diagnosis (CAD). The related task of polyp detection, the ability to determine which objects or classes of polyps are present in a scene, also relies on colon wall segmentation. When modeling each tissue type as a conditionally independent Gaussian distribution, the tissue mixture fractions in each voxel via the modeled unobservable random processes of the underlying tissue types can be estimated by maximum a posteriori expectation-maximization (MAP-EM) algorithm in an iterative manner. This paper presents, based on the assumption that the partial volume effect (PVE) could be fully described by a tissue mixture model, a theoretical solution to the MAP-EM segmentation algorithm. However, the MAP-EM algorithm may miss some small regions which also belong to the colon wall. Combining with the shape constrained model, we present an improved algorithm which is able to merge similar regions and reserve fine structures. Experiment results show that the new approach can refine the jagged-like boundaries and achieve better results than merely exploited our previously presented MAP-EM algorithm.

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

    NASA Astrophysics Data System (ADS)

    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. Joint graph cut and relative fuzzy connectedness image segmentation algorithm.

    PubMed

    Ciesielski, Krzysztof Chris; Miranda, Paulo A V; Falcão, Alexandre X; Udupa, Jayaram K

    2013-12-01

    We introduce an image segmentation algorithm, called GC(sum)(max), which combines, in novel manner, the strengths of two popular algorithms: Relative Fuzzy Connectedness (RFC) and (standard) Graph Cut (GC). We show, both theoretically and experimentally, that GC(sum)(max) preserves robustness of RFC with respect to the seed choice (thus, avoiding "shrinking problem" of GC), while keeping GC's stronger control over the problem of "leaking though poorly defined boundary segments." The analysis of GC(sum)(max) is greatly facilitated by our recent theoretical results that RFC can be described within the framework of Generalized GC (GGC) segmentation algorithms. In our implementation of GC(sum)(max) we use, as a subroutine, a version of RFC algorithm (based on Image Forest Transform) that runs (provably) in linear time with respect to the image size. This results in GC(sum)(max) running in a time close to linear. Experimental comparison of GC(sum)(max) to GC, an iterative version of RFC (IRFC), and power watershed (PW), based on a variety medical and non-medical images, indicates superior accuracy performance of GC(sum)(max) over these other methods, resulting in a rank ordering of GC(sum)(max)>PW∼IRFC>GC.

  20. Automatic segmentation of male pelvic anatomy on computed tomography images: a comparison with multiple observers in the context of a multicentre clinical trial

    PubMed Central

    2013-01-01

    -observer segmentation studies. For automatic segmentation algorithms based on image-registration as in iPlan, it is apparent that agreement between observer and automatic segmentation will be a function of patient-specific image characteristics, particularly for anatomy with poor contrast definition. For this reason, it is suggested that automatic registration based on transformation of a single reference dataset adds a significant systematic bias to the resulting volumes and their use in the context of a multicentre trial should be carefully considered. PMID:23631832

  1. Crowdsourcing the creation of image segmentation algorithms for connectomics.

    PubMed

    Arganda-Carreras, Ignacio; Turaga, Srinivas C; Berger, Daniel R; Cireşan, Dan; Giusti, Alessandro; Gambardella, Luca M; Schmidhuber, Jürgen; Laptev, Dmitry; Dwivedi, Sarvesh; Buhmann, Joachim M; Liu, Ting; Seyedhosseini, Mojtaba; Tasdizen, Tolga; Kamentsky, Lee; Burget, Radim; Uher, Vaclav; Tan, Xiao; Sun, Changming; Pham, Tuan D; Bas, Erhan; Uzunbas, Mustafa G; Cardona, Albert; Schindelin, Johannes; Seung, H Sebastian

    2015-01-01

    To stimulate progress in automating the reconstruction of neural circuits, we organized the first international challenge on 2D segmentation of electron microscopic (EM) images of the brain. Participants submitted boundary maps predicted for a test set of images, and were scored based on their agreement with a consensus of human expert annotations. The winning team had no prior experience with EM images, and employed a convolutional network. This "deep learning" approach has since become accepted as a standard for segmentation of EM images. The challenge has continued to accept submissions, and the best so far has resulted from cooperation between two teams. The challenge has probably saturated, as algorithms cannot progress beyond limits set by ambiguities inherent in 2D scoring and the size of the test dataset. Retrospective evaluation of the challenge scoring system reveals that it was not sufficiently robust to variations in the widths of neurite borders. We propose a solution to this problem, which should be useful for a future 3D segmentation challenge. PMID:26594156

  2. Self-adaptive algorithm for segmenting skin regions

    NASA Astrophysics Data System (ADS)

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

    2014-12-01

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

  3. Crowdsourcing the creation of image segmentation algorithms for connectomics

    PubMed Central

    Arganda-Carreras, Ignacio; Turaga, Srinivas C.; Berger, Daniel R.; Cireşan, Dan; Giusti, Alessandro; Gambardella, Luca M.; Schmidhuber, Jürgen; Laptev, Dmitry; Dwivedi, Sarvesh; Buhmann, Joachim M.; Liu, Ting; Seyedhosseini, Mojtaba; Tasdizen, Tolga; Kamentsky, Lee; Burget, Radim; Uher, Vaclav; Tan, Xiao; Sun, Changming; Pham, Tuan D.; Bas, Erhan; Uzunbas, Mustafa G.; Cardona, Albert; Schindelin, Johannes; Seung, H. Sebastian

    2015-01-01

    To stimulate progress in automating the reconstruction of neural circuits, we organized the first international challenge on 2D segmentation of electron microscopic (EM) images of the brain. Participants submitted boundary maps predicted for a test set of images, and were scored based on their agreement with a consensus of human expert annotations. The winning team had no prior experience with EM images, and employed a convolutional network. This “deep learning” approach has since become accepted as a standard for segmentation of EM images. The challenge has continued to accept submissions, and the best so far has resulted from cooperation between two teams. The challenge has probably saturated, as algorithms cannot progress beyond limits set by ambiguities inherent in 2D scoring and the size of the test dataset. Retrospective evaluation of the challenge scoring system reveals that it was not sufficiently robust to variations in the widths of neurite borders. We propose a solution to this problem, which should be useful for a future 3D segmentation challenge. PMID:26594156

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

    NASA Astrophysics Data System (ADS)

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

    2014-03-01

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

  5. Sinus Anatomy

    MedlinePlus

    ... ARS HOME ANATOMY Nasal Anatomy Sinus Anatomy Nasal Physiology Nasal Endoscopy Skull Base Anatomy Virtual Anatomy Disclosure ... ANATOMY > Sinus Anatomy Nasal Anatomy Sinus Anatomy Nasal Physiology Nasal Endoscopy Skull Base Anatomy Virtual Anatomy Disclosure ...

  6. Level set algorithms comparison for multi-slice CT left ventricle segmentation

    NASA Astrophysics Data System (ADS)

    Medina, Ruben; La Cruz, Alexandra; Ordoñes, Andrés.; Pesántez, Daniel; Morocho, Villie; Vanegas, Pablo

    2015-12-01

    The comparison of several Level Set algorithms is performed with respect to 2D left ventricle segmentation in Multi-Slice CT images. Five algorithms are compared by calculating the Dice coefficient between the resulting segmentation contour and a reference contour traced by a cardiologist. The algorithms are also tested on images contaminated with Gaussian noise for several values of PSNR. Additionally an algorithm for providing the initialization shape is proposed. This algorithm is based on a combination of mathematical morphology tools with watershed and region growing algorithms. Results on the set of test images are promising and suggest the extension to 3{D MSCT database segmentation.

  7. Kidney segmentation in CT sequences using SKFCM and improved GrowCut algorithm

    PubMed Central

    2015-01-01

    Background Organ segmentation is an important step in computer-aided diagnosis and pathology detection. Accurate kidney segmentation in abdominal computed tomography (CT) sequences is an essential and crucial task for surgical planning and navigation in kidney tumor ablation. However, kidney segmentation in CT is a substantially challenging work because the intensity values of kidney parenchyma are similar to those of adjacent structures. Results In this paper, a coarse-to-fine method was applied to segment kidney from CT images, which consists two stages including rough segmentation and refined segmentation. The rough segmentation is based on a kernel fuzzy C-means algorithm with spatial information (SKFCM) algorithm and the refined segmentation is implemented with improved GrowCut (IGC) algorithm. The SKFCM algorithm introduces a kernel function and spatial constraint into fuzzy c-means clustering (FCM) algorithm. The IGC algorithm makes good use of the continuity of CT sequences in space which can automatically generate the seed labels and improve the efficiency of segmentation. The experimental results performed on the whole dataset of abdominal CT images have shown that the proposed method is accurate and efficient. The method provides a sensitivity of 95.46% with specificity of 99.82% and performs better than other related methods. Conclusions Our method achieves high accuracy in kidney segmentation and considerably reduces the time and labor required for contour delineation. In addition, the method can be expanded to 3D segmentation directly without modification. PMID:26356850

  8. Algorithm for Automatic Segmentation of Nuclear Boundaries in Cancer Cells in Three-Channel Luminescent Images

    NASA Astrophysics Data System (ADS)

    Lisitsa, Y. V.; Yatskou, M. M.; Apanasovich, V. V.; Apanasovich, T. V.

    2015-09-01

    We have developed an algorithm for segmentation of cancer cell nuclei in three-channel luminescent images of microbiological specimens. The algorithm is based on using a correlation between fluorescence signals in the detection channels for object segmentation, which permits complete automation of the data analysis procedure. We have carried out a comparative analysis of the proposed method and conventional algorithms implemented in the CellProfiler and ImageJ software packages. Our algorithm has an object localization uncertainty which is 2-3 times smaller than for the conventional algorithms, with comparable segmentation accuracy.

  9. Segmentation of MRI Brain Images with an Improved Harmony Searching Algorithm

    PubMed Central

    Yang, Zhang; Li, Guo; Weifeng, Ding

    2016-01-01

    The harmony searching (HS) algorithm is a kind of optimization search algorithm currently applied in many practical problems. The HS algorithm constantly revises variables in the harmony database and the probability of different values that can be used to complete iteration convergence to achieve the optimal effect. Accordingly, this study proposed a modified algorithm to improve the efficiency of the algorithm. First, a rough set algorithm was employed to improve the convergence and accuracy of the HS algorithm. Then, the optimal value was obtained using the improved HS algorithm. The optimal value of convergence was employed as the initial value of the fuzzy clustering algorithm for segmenting magnetic resonance imaging (MRI) brain images. Experimental results showed that the improved HS algorithm attained better convergence and more accurate results than those of the original HS algorithm. In our study, the MRI image segmentation effect of the improved algorithm was superior to that of the original fuzzy clustering method. PMID:27403428

  10. Segmentation of MRI Brain Images with an Improved Harmony Searching Algorithm.

    PubMed

    Yang, Zhang; Shufan, Ye; Li, Guo; Weifeng, Ding

    2016-01-01

    The harmony searching (HS) algorithm is a kind of optimization search algorithm currently applied in many practical problems. The HS algorithm constantly revises variables in the harmony database and the probability of different values that can be used to complete iteration convergence to achieve the optimal effect. Accordingly, this study proposed a modified algorithm to improve the efficiency of the algorithm. First, a rough set algorithm was employed to improve the convergence and accuracy of the HS algorithm. Then, the optimal value was obtained using the improved HS algorithm. The optimal value of convergence was employed as the initial value of the fuzzy clustering algorithm for segmenting magnetic resonance imaging (MRI) brain images. Experimental results showed that the improved HS algorithm attained better convergence and more accurate results than those of the original HS algorithm. In our study, the MRI image segmentation effect of the improved algorithm was superior to that of the original fuzzy clustering method. PMID:27403428

  11. Wound size measurement of lower extremity ulcers using segmentation algorithms

    NASA Astrophysics Data System (ADS)

    Dadkhah, Arash; Pang, Xing; Solis, Elizabeth; Fang, Ruogu; Godavarty, Anuradha

    2016-03-01

    Lower extremity ulcers are one of the most common complications that not only affect many people around the world but also have huge impact on economy since a large amount of resources are spent for treatment and prevention of the diseases. Clinical studies have shown that reduction in the wound size of 40% within 4 weeks is an acceptable progress in the healing process. Quantification of the wound size plays a crucial role in assessing the extent of healing and determining the treatment process. To date, wound healing is visually inspected and the wound size is measured from surface images. The extent of wound healing internally may vary from the surface. A near-infrared (NIR) optical imaging approach has been developed for non-contact imaging of wounds internally and differentiating healing from non-healing wounds. Herein, quantitative wound size measurements from NIR and white light images are estimated using a graph cuts and region growing image segmentation algorithms. The extent of the wound healing from NIR imaging of lower extremity ulcers in diabetic subjects are quantified and compared across NIR and white light images. NIR imaging and wound size measurements can play a significant role in potentially predicting the extent of internal healing, thus allowing better treatment plans when implemented for periodic imaging in future.

  12. Anatomy of the ostia venae hepaticae and the retrohepatic segment of the inferior vena cava.

    PubMed Central

    Camargo, A M; Teixeira, G G; Ortale, J R

    1996-01-01

    In 30 normal adult livers the retrohepatic segment of inferior vena cava had a length of 6.7 cm and was totally encircled by liver substance in 30% of cases. Altogether 442 ostia venae hepaticae were found, averaging 14.7 per liver and classified as large, medium, small and minimum. The localisation of the openings was studied according to the division of the wall of the retrohepatic segment of the inferior vena cava into 16 areas. PMID:8655416

  13. Automated segmentation of tumors on bone scans using anatomy-specific thresholding

    NASA Astrophysics Data System (ADS)

    Chu, Gregory H.; Lo, Pechin; Kim, Hyun J.; Lu, Peiyun; Ramakrishna, Bharath; Gjertson, David; Poon, Cheryce; Auerbach, Martin; Goldin, Jonathan; Brown, Matthew S.

    2012-03-01

    Quantification of overall tumor area on bone scans may be a potential biomarker for treatment response assessment and has, to date, not been investigated. Segmentation of bone metastases on bone scans is a fundamental step for this response marker. In this paper, we propose a fully automated computerized method for the segmentation of bone metastases on bone scans, taking into account characteristics of different anatomic regions. A scan is first segmented into anatomic regions via an atlas-based segmentation procedure, which involves non-rigidly registering a labeled atlas scan to the patient scan. Next, an intensity normalization method is applied to account for varying levels of radiotracer dosing levels and scan timing. Lastly, lesions are segmented via anatomic regionspecific intensity thresholding. Thresholds are chosen by receiver operating characteristic (ROC) curve analysis against manual contouring by board certified nuclear medicine physicians. A leave-one-out cross validation of our method on a set of 39 bone scans with metastases marked by 2 board-certified nuclear medicine physicians yielded a median sensitivity of 95.5%, and specificity of 93.9%. Our method was compared with a global intensity thresholding method. The results show a comparable sensitivity and significantly improved overall specificity, with a p-value of 0.0069.

  14. Skin cells segmentation algorithm based on spectral angle and distance score

    NASA Astrophysics Data System (ADS)

    Li, Qingli; Chang, Li; Liu, Hongying; Zhou, Mei; Wang, Yiting; Guo, Fangmin

    2015-11-01

    In the diagnosis of skin diseases by analyzing histopathological images of skin sections, the automated segmentation of cells in the epidermis area is an important step. Light microscopy based traditional methods usually cannot generate satisfying segmentation results due to complicated skin structures and limited information of this kind of image. In this study, we use a molecular hyperspectral imaging system to observe skin sections and propose a spectral based algorithm to segment epithelial cells. Unlike pixel-wise segmentation methods, the proposed algorithm considers both the spectral angle and the distance score between the test and the reference spectrum for segmentation. The experimental results indicate that the proposed algorithm performs better than the K-Means, fuzzy C-means, and spectral angle mapper algorithms because it can identify pixels with similar spectral angle but a different spectral distance.

  15. Refinement-Cut: User-Guided Segmentation Algorithm for Translational Science

    PubMed Central

    Egger, Jan

    2014-01-01

    In this contribution, a semi-automatic segmentation algorithm for (medical) image analysis is presented. More precise, the approach belongs to the category of interactive contouring algorithms, which provide real-time feedback of the segmentation result. However, even with interactive real-time contouring approaches there are always cases where the user cannot find a satisfying segmentation, e.g. due to homogeneous appearances between the object and the background, or noise inside the object. For these difficult cases the algorithm still needs additional user support. However, this additional user support should be intuitive and rapid integrated into the segmentation process, without breaking the interactive real-time segmentation feedback. I propose a solution where the user can support the algorithm by an easy and fast placement of one or more seed points to guide the algorithm to a satisfying segmentation result also in difficult cases. These additional seed(s) restrict(s) the calculation of the segmentation for the algorithm, but at the same time, still enable to continue with the interactive real-time feedback segmentation. For a practical and genuine application in translational science, the approach has been tested on medical data from the clinical routine in 2D and 3D. PMID:24893650

  16. An efficient algorithm for retinal blood vessel segmentation using h-maxima transform and multilevel thresholding.

    PubMed

    Saleh, Marwan D; Eswaran, C

    2012-01-01

    Retinal blood vessel detection and analysis play vital roles in early diagnosis and prevention of several diseases, such as hypertension, diabetes, arteriosclerosis, cardiovascular disease and stroke. This paper presents an automated algorithm for retinal blood vessel segmentation. The proposed algorithm takes advantage of powerful image processing techniques such as contrast enhancement, filtration and thresholding for more efficient segmentation. To evaluate the performance of the proposed algorithm, experiments were conducted on 40 images collected from DRIVE database. The results show that the proposed algorithm yields an accuracy rate of 96.5%, which is higher than the results achieved by other known algorithms.

  17. A Clustering Algorithm for Liver Lesion Segmentation of Diffusion-Weighted MR Images

    PubMed Central

    Jha, Abhinav K.; Rodríguez, Jeffrey J.; Stephen, Renu M.; Stopeck, Alison T.

    2010-01-01

    In diffusion-weighted magnetic resonance imaging, accurate segmentation of liver lesions in the diffusion-weighted images is required for computation of the apparent diffusion coefficient (ADC) of the lesion, the parameter that serves as an indicator of lesion response to therapy. However, the segmentation problem is challenging due to low SNR, fuzzy boundaries and speckle and motion artifacts. We propose a clustering algorithm that incorporates spatial information and a geometric constraint to solve this issue. We show that our algorithm provides improved accuracy compared to existing segmentation algorithms. PMID:21151837

  18. Lack of protein-tyrosine sulfation disrupts photoreceptor outer segment morphogenesis, retinal function and retinal anatomy.

    PubMed

    Sherry, David M; Murray, Anne R; Kanan, Yogita; Arbogast, Kelsey L; Hamilton, Robert A; Fliesler, Steven J; Burns, Marie E; Moore, Kevin L; Al-Ubaidi, Muayyad R

    2010-11-01

    To investigate the role(s) of protein-tyrosine sulfation in the retina, we examined retinal function and structure in mice lacking tyrosylprotein sulfotransferases (TPST) 1 and 2. Tpst double knockout (DKO; Tpst1(-/-) /Tpst2 (-/-) ) retinas had drastically reduced electroretinographic responses, although their photoreceptors exhibited normal responses in single cell recordings. These retinas appeared normal histologically; however, the rod photoreceptors had ultrastructurally abnormal outer segments, with membrane evulsions into the extracellular space, irregular disc membrane spacing and expanded intradiscal space. Photoreceptor synaptic terminals were disorganized in Tpst DKO retinas, but established ultrastructurally normal synapses, as did bipolar and amacrine cells; however, the morphology and organization of neuronal processes in the inner retina were abnormal. These results indicate that protein-tyrosine sulfation is essential for proper outer segment morphogenesis and synaptic function, but is not critical for overall retinal structure or synapse formation, and may serve broader functions in neuronal development and maintenance.

  19. Fast and fully automatic phalanx segmentation using a grayscale-histogram morphology algorithm

    NASA Astrophysics Data System (ADS)

    Hsieh, Chi-Wen; Liu, Tzu-Chiang; Jong, Tai-Lang; Chen, Chih-Yen; Tiu, Chui-Mei; Chan, Din-Yuen

    2011-08-01

    Bone age assessment is a common radiological examination used in pediatrics to diagnose the discrepancy between the skeletal and chronological age of a child; therefore, it is beneficial to develop a computer-based bone age assessment to help junior pediatricians estimate bone age easily. Unfortunately, the phalanx on radiograms is not easily separated from the background and soft tissue. Therefore, we proposed a new method, called the grayscale-histogram morphology algorithm, to segment the phalanges fast and precisely. The algorithm includes three parts: a tri-stage sieve algorithm used to eliminate the background of hand radiograms, a centroid-edge dual scanning algorithm to frame the phalanx region, and finally a segmentation algorithm based on disk traverse-subtraction filter to segment the phalanx. Moreover, two more segmentation methods: adaptive two-mean and adaptive two-mean clustering were performed, and their results were compared with the segmentation algorithm based on disk traverse-subtraction filter using five indices comprising misclassification error, relative foreground area error, modified Hausdorff distances, edge mismatch, and region nonuniformity. In addition, the CPU time of the three segmentation methods was discussed. The result showed that our method had a better performance than the other two methods. Furthermore, satisfactory segmentation results were obtained with a low standard error.

  20. Nasal Anatomy

    MedlinePlus

    ... Nasal Anatomy Sinus Anatomy Nasal Physiology Nasal Endoscopy Skull Base Anatomy Virtual Anatomy Disclosure Statement CONDITIONS Adult ... Nasal Anatomy Sinus Anatomy Nasal Physiology Nasal Endoscopy Skull Base Anatomy Virtual Anatomy Disclosure Statement Printer Friendly ...

  1. Feedback algorithm for simulation of multi-segmented cracks

    SciTech Connect

    Chady, T.; Napierala, L.

    2011-06-23

    In this paper, a method for obtaining a three dimensional crack model from a radiographic image is discussed. A genetic algorithm aiming at close simulation of crack's shape is presented. Results obtained with genetic algorithm are compared to those achieved in authors' previous work. The described algorithm has been tested on both simulated and real-life cracks.

  2. The remote sensing image segmentation mean shift algorithm parallel processing based on MapReduce

    NASA Astrophysics Data System (ADS)

    Chen, Xi; Zhou, Liqing

    2015-12-01

    With the development of satellite remote sensing technology and the remote sensing image data, traditional remote sensing image segmentation technology cannot meet the massive remote sensing image processing and storage requirements. This article put cloud computing and parallel computing technology in remote sensing image segmentation process, and build a cheap and efficient computer cluster system that uses parallel processing to achieve MeanShift algorithm of remote sensing image segmentation based on the MapReduce model, not only to ensure the quality of remote sensing image segmentation, improved split speed, and better meet the real-time requirements. The remote sensing image segmentation MeanShift algorithm parallel processing algorithm based on MapReduce shows certain significance and a realization of value.

  3. Accuracy of patient specific organ-dose estimates obtained using an automated image segmentation algorithm

    NASA Astrophysics Data System (ADS)

    Gilat-Schmidt, Taly; Wang, Adam; Coradi, Thomas; Haas, Benjamin; Star-Lack, Josh

    2016-03-01

    The overall goal of this work is to develop a rapid, accurate and fully automated software tool to estimate patient-specific organ doses from computed tomography (CT) scans using a deterministic Boltzmann Transport Equation solver and automated CT segmentation algorithms. This work quantified the accuracy of organ dose estimates obtained by an automated segmentation algorithm. The investigated algorithm uses a combination of feature-based and atlas-based methods. A multiatlas approach was also investigated. We hypothesize that the auto-segmentation algorithm is sufficiently accurate to provide organ dose estimates since random errors at the organ boundaries will average out when computing the total organ dose. To test this hypothesis, twenty head-neck CT scans were expertly segmented into nine regions. A leave-one-out validation study was performed, where every case was automatically segmented with each of the remaining cases used as the expert atlas, resulting in nineteen automated segmentations for each of the twenty datasets. The segmented regions were applied to gold-standard Monte Carlo dose maps to estimate mean and peak organ doses. The results demonstrated that the fully automated segmentation algorithm estimated the mean organ dose to within 10% of the expert segmentation for regions other than the spinal canal, with median error for each organ region below 2%. In the spinal canal region, the median error was 7% across all data sets and atlases, with a maximum error of 20%. The error in peak organ dose was below 10% for all regions, with a median error below 4% for all organ regions. The multiple-case atlas reduced the variation in the dose estimates and additional improvements may be possible with more robust multi-atlas approaches. Overall, the results support potential feasibility of an automated segmentation algorithm to provide accurate organ dose estimates.

  4. Detection and Segmentation of Erythrocytes in Blood Smear Images Using a Line Operator and Watershed Algorithm

    PubMed Central

    Khajehpour, Hassan; Dehnavi, Alireza Mehri; Taghizad, Hossein; Khajehpour, Esmat; Naeemabadi, Mohammadreza

    2013-01-01

    Most of the erythrocyte related diseases are detectable by hematology images analysis. At the first step of this analysis, segmentation and detection of blood cells are inevitable. In this study, a novel method using a line operator and watershed algorithm is rendered for erythrocyte detection and segmentation in blood smear images, as well as reducing over-segmentation in watershed algorithm that is useful for segmentation of different types of blood cells having partial overlap. This method uses gray scale structure of blood cell, which is obtained by exertion of Euclidian distance transform on binary images. Applying this transform, the gray intensity of cell images gradually reduces from the center of cells to their margins. For detecting this intensity variation structure, a line operator measuring gray level variations along several directional line segments is applied. Line segments have maximum and minimum gray level variations has a special pattern that is applicable for detections of the central regions of cells. Intersection of these regions with the signs which are obtained by calculating of local maxima in the watershed algorithm was applied for cells’ centers detection, as well as a reduction in over-segmentation of watershed algorithm. This method creates 1300 sign in segmentation of 1274 erythrocytes available in 25 blood smear images. Accuracy and sensitivity of the proposed method are equal to 95.9% and 97.99%, respectively. The results show the proposed method's capability in detection of erythrocytes in blood smear images. PMID:24672764

  5. PRESEE: an MDL/MML algorithm to time-series stream segmenting.

    PubMed

    Xu, Kaikuo; Jiang, Yexi; Tang, Mingjie; Yuan, Changan; Tang, Changjie

    2013-01-01

    Time-series stream is one of the most common data types in data mining field. It is prevalent in fields such as stock market, ecology, and medical care. Segmentation is a key step to accelerate the processing speed of time-series stream mining. Previous algorithms for segmenting mainly focused on the issue of ameliorating precision instead of paying much attention to the efficiency. Moreover, the performance of these algorithms depends heavily on parameters, which are hard for the users to set. In this paper, we propose PRESEE (parameter-free, real-time, and scalable time-series stream segmenting algorithm), which greatly improves the efficiency of time-series stream segmenting. PRESEE is based on both MDL (minimum description length) and MML (minimum message length) methods, which could segment the data automatically. To evaluate the performance of PRESEE, we conduct several experiments on time-series streams of different types and compare it with the state-of-art algorithm. The empirical results show that PRESEE is very efficient for real-time stream datasets by improving segmenting speed nearly ten times. The novelty of this algorithm is further demonstrated by the application of PRESEE in segmenting real-time stream datasets from ChinaFLUX sensor networks data stream.

  6. Automated segmentation and reconstruction of patient-specific cardiac anatomy and pathology from in vivo MRI*

    NASA Astrophysics Data System (ADS)

    Ringenberg, Jordan; Deo, Makarand; Devabhaktuni, Vijay; Filgueiras-Rama, David; Pizarro, Gonzalo; Ibañez, Borja; Berenfeld, Omer; Boyers, Pamela; Gold, Jeffrey

    2012-12-01

    This paper presents an automated method to segment left ventricle (LV) tissues from functional and delayed-enhancement (DE) cardiac magnetic resonance imaging (MRI) scans using a sequential multi-step approach. First, a region of interest (ROI) is computed to create a subvolume around the LV using morphological operations and image arithmetic. From the subvolume, the myocardial contours are automatically delineated using difference of Gaussians (DoG) filters and GSV snakes. These contours are used as a mask to identify pathological tissues, such as fibrosis or scar, within the DE-MRI. The presented automated technique is able to accurately delineate the myocardium and identify the pathological tissue in patient sets. The results were validated by two expert cardiologists, and in one set the automated results are quantitatively and qualitatively compared with expert manual delineation. Furthermore, the method is patient-specific, performed on an entire patient MRI series. Thus, in addition to providing a quick analysis of individual MRI scans, the fully automated segmentation method is used for effectively tagging regions in order to reconstruct computerized patient-specific 3D cardiac models. These models can then be used in electrophysiological studies and surgical strategy planning.

  7. Is STAPLE algorithm confident to assess segmentation methods in PET imaging?

    NASA Astrophysics Data System (ADS)

    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.

  8. Segmentation of pomegranate MR images using spatial fuzzy c-means (SFCM) algorithm

    NASA Astrophysics Data System (ADS)

    Moradi, Ghobad; Shamsi, Mousa; Sedaaghi, M. H.; Alsharif, M. R.

    2011-10-01

    Segmentation is one of the fundamental issues of image processing and machine vision. It plays a prominent role in a variety of image processing applications. In this paper, one of the most important applications of image processing in MRI segmentation of pomegranate is explored. Pomegranate is a fruit with pharmacological properties such as being anti-viral and anti-cancer. Having a high quality product in hand would be critical factor in its marketing. The internal quality of the product is comprehensively important in the sorting process. The determination of qualitative features cannot be manually made. Therefore, the segmentation of the internal structures of the fruit needs to be performed as accurately as possible in presence of noise. Fuzzy c-means (FCM) algorithm is noise-sensitive and pixels with noise are classified inversely. As a solution, in this paper, the spatial FCM algorithm in pomegranate MR images' segmentation is proposed. The algorithm is performed with setting the spatial neighborhood information in FCM and modification of fuzzy membership function for each class. The segmentation algorithm results on the original and the corrupted Pomegranate MR images by Gaussian, Salt Pepper and Speckle noises show that the SFCM algorithm operates much more significantly than FCM algorithm. Also, after diverse steps of qualitative and quantitative analysis, we have concluded that the SFCM algorithm with 5×5 window size is better than the other windows.

  9. Tissue segmentation of computed tomography images using a Random Forest algorithm: a feasibility study

    NASA Astrophysics Data System (ADS)

    Polan, Daniel F.; Brady, Samuel L.; Kaufman, Robert A.

    2016-09-01

    There is a need for robust, fully automated whole body organ segmentation for diagnostic CT. This study investigates and optimizes a Random Forest algorithm for automated organ segmentation; explores the limitations of a Random Forest algorithm applied to the CT environment; and demonstrates segmentation accuracy in a feasibility study of pediatric and adult patients. To the best of our knowledge, this is the first study to investigate a trainable Weka segmentation (TWS) implementation using Random Forest machine-learning as a means to develop a fully automated tissue segmentation tool developed specifically for pediatric and adult examinations in a diagnostic CT environment. Current innovation in computed tomography (CT) is focused on radiomics, patient-specific radiation dose calculation, and image quality improvement using iterative reconstruction, all of which require specific knowledge of tissue and organ systems within a CT image. The purpose of this study was to develop a fully automated Random Forest classifier algorithm for segmentation of neck–chest–abdomen–pelvis CT examinations based on pediatric and adult CT protocols. Seven materials were classified: background, lung/internal air or gas, fat, muscle, solid organ parenchyma, blood/contrast enhanced fluid, and bone tissue using Matlab and the TWS plugin of FIJI. The following classifier feature filters of TWS were investigated: minimum, maximum, mean, and variance evaluated over a voxel radius of 2 n , (n from 0 to 4), along with noise reduction and edge preserving filters: Gaussian, bilateral, Kuwahara, and anisotropic diffusion. The Random Forest algorithm used 200 trees with 2 features randomly selected per node. The optimized auto-segmentation algorithm resulted in 16 image features including features derived from maximum, mean, variance Gaussian and Kuwahara filters. Dice similarity coefficient (DSC) calculations between manually segmented and Random Forest algorithm segmented images from 21

  10. Tissue segmentation of computed tomography images using a Random Forest algorithm: a feasibility study

    NASA Astrophysics Data System (ADS)

    Polan, Daniel F.; Brady, Samuel L.; Kaufman, Robert A.

    2016-09-01

    There is a need for robust, fully automated whole body organ segmentation for diagnostic CT. This study investigates and optimizes a Random Forest algorithm for automated organ segmentation; explores the limitations of a Random Forest algorithm applied to the CT environment; and demonstrates segmentation accuracy in a feasibility study of pediatric and adult patients. To the best of our knowledge, this is the first study to investigate a trainable Weka segmentation (TWS) implementation using Random Forest machine-learning as a means to develop a fully automated tissue segmentation tool developed specifically for pediatric and adult examinations in a diagnostic CT environment. Current innovation in computed tomography (CT) is focused on radiomics, patient-specific radiation dose calculation, and image quality improvement using iterative reconstruction, all of which require specific knowledge of tissue and organ systems within a CT image. The purpose of this study was to develop a fully automated Random Forest classifier algorithm for segmentation of neck-chest-abdomen-pelvis CT examinations based on pediatric and adult CT protocols. Seven materials were classified: background, lung/internal air or gas, fat, muscle, solid organ parenchyma, blood/contrast enhanced fluid, and bone tissue using Matlab and the TWS plugin of FIJI. The following classifier feature filters of TWS were investigated: minimum, maximum, mean, and variance evaluated over a voxel radius of 2 n , (n from 0 to 4), along with noise reduction and edge preserving filters: Gaussian, bilateral, Kuwahara, and anisotropic diffusion. The Random Forest algorithm used 200 trees with 2 features randomly selected per node. The optimized auto-segmentation algorithm resulted in 16 image features including features derived from maximum, mean, variance Gaussian and Kuwahara filters. Dice similarity coefficient (DSC) calculations between manually segmented and Random Forest algorithm segmented images from 21

  11. Tissue segmentation of computed tomography images using a Random Forest algorithm: a feasibility study.

    PubMed

    Polan, Daniel F; Brady, Samuel L; Kaufman, Robert A

    2016-09-01

    There is a need for robust, fully automated whole body organ segmentation for diagnostic CT. This study investigates and optimizes a Random Forest algorithm for automated organ segmentation; explores the limitations of a Random Forest algorithm applied to the CT environment; and demonstrates segmentation accuracy in a feasibility study of pediatric and adult patients. To the best of our knowledge, this is the first study to investigate a trainable Weka segmentation (TWS) implementation using Random Forest machine-learning as a means to develop a fully automated tissue segmentation tool developed specifically for pediatric and adult examinations in a diagnostic CT environment. Current innovation in computed tomography (CT) is focused on radiomics, patient-specific radiation dose calculation, and image quality improvement using iterative reconstruction, all of which require specific knowledge of tissue and organ systems within a CT image. The purpose of this study was to develop a fully automated Random Forest classifier algorithm for segmentation of neck-chest-abdomen-pelvis CT examinations based on pediatric and adult CT protocols. Seven materials were classified: background, lung/internal air or gas, fat, muscle, solid organ parenchyma, blood/contrast enhanced fluid, and bone tissue using Matlab and the TWS plugin of FIJI. The following classifier feature filters of TWS were investigated: minimum, maximum, mean, and variance evaluated over a voxel radius of 2 (n) , (n from 0 to 4), along with noise reduction and edge preserving filters: Gaussian, bilateral, Kuwahara, and anisotropic diffusion. The Random Forest algorithm used 200 trees with 2 features randomly selected per node. The optimized auto-segmentation algorithm resulted in 16 image features including features derived from maximum, mean, variance Gaussian and Kuwahara filters. Dice similarity coefficient (DSC) calculations between manually segmented and Random Forest algorithm segmented images from 21

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

    NASA Astrophysics Data System (ADS)

    Wang, W. X.

    2012-01-01

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

  13. Ear feature region detection based on a combined image segmentation algorithm-KRM

    NASA Astrophysics Data System (ADS)

    Jiang, Jingying; Zhang, Hao; Zhang, Qi; Lu, Junsheng; Ma, Zhenhe; Xu, Kexin

    2014-02-01

    Scale Invariant Feature Transform SIFT algorithm is widely used for ear feature matching and recognition. However, the application of the algorithm is usually interfered by the non-target areas within the whole image, and the interference would then affect the matching and recognition of ear features. To solve this problem, a combined image segmentation algorithm i.e. KRM was introduced in this paper, As the human ear recognition pretreatment method. Firstly, the target areas of ears were extracted by the KRM algorithm and then SIFT algorithm could be applied to the detection and matching of features. The present KRM algorithm follows three steps: (1)the image was preliminarily segmented into foreground target area and background area by using K-means clustering algorithm; (2)Region growing method was used to merge the over-segmented areas; (3)Morphology erosion filtering method was applied to obtain the final segmented regions. The experiment results showed that the KRM method could effectively improve the accuracy and robustness of ear feature matching and recognition based on SIFT algorithm.

  14. Parallel Implementation of the Recursive Approximation of an Unsupervised Hierarchical Segmentation Algorithm. Chapter 5

    NASA Technical Reports Server (NTRS)

    Tilton, James C.; Plaza, Antonio J. (Editor); Chang, Chein-I. (Editor)

    2008-01-01

    The hierarchical image segmentation algorithm (referred to as HSEG) is a hybrid of hierarchical step-wise optimization (HSWO) and constrained spectral clustering that produces a hierarchical set of image segmentations. HSWO is an iterative approach to region grooving segmentation in which the optimal image segmentation is found at N(sub R) regions, given a segmentation at N(sub R+1) regions. HSEG's addition of constrained spectral clustering makes it a computationally intensive algorithm, for all but, the smallest of images. To counteract this, a computationally efficient recursive approximation of HSEG (called RHSEG) has been devised. Further improvements in processing speed are obtained through a parallel implementation of RHSEG. This chapter describes this parallel implementation and demonstrates its computational efficiency on a Landsat Thematic Mapper test scene.

  15. Optree: a learning-based adaptive watershed algorithm for neuron segmentation.

    PubMed

    Uzunbaş, Mustafa Gökhan; Chen, Chao; Metaxas, Dimitris

    2014-01-01

    We present a new algorithm for automatic and interactive segmentation of neuron structures from electron microscopy (EM) images. Our method selects a collection of nodes from the watershed mergng tree as the proposed segmentation. This is achieved by building a onditional random field (CRF) whose underlying graph is the merging tree. The maximum a posteriori (MAP) prediction of the CRF is the output segmentation. Our algorithm outperforms state-of-the-art methods. Both the inference and the training are very efficient as the graph is tree-structured. Furthermore, we develop an interactive segmentation framework which selects uncertain regions for a user to proofread. The uncertainty is measured by the marginals of the graphical model. Based on user corrections, our framework modifies the merging tree and thus improves the segmentation globally. PMID:25333106

  16. Coupling Regular Tessellation with Rjmcmc Algorithm to Segment SAR Image with Unknown Number of Classes

    NASA Astrophysics Data System (ADS)

    Wang, Y.; Li, Y.; Zhao, Q. H.

    2016-06-01

    This paper presents a Synthetic Aperture Radar (SAR) image segmentation approach with unknown number of classes, which is based on regular tessellation and Reversible Jump Markov Chain Monte Carlo (RJMCMC') algorithm. First of all, an image domain is portioned into a set of blocks by regular tessellation. The image is modeled on the assumption that intensities of its pixels in each homogeneous region satisfy an identical and independent Gamma distribution. By Bayesian paradigm, the posterior distribution is obtained to build the region-based image segmentation model. Then, a RJMCMC algorithm is designed to simulate from the segmentation model to determine the number of homogeneous regions and segment the image. In order to further improve the segmentation accuracy, a refined operation is performed. To illustrate the feasibility and effectiveness of the proposed approach, two real SAR image is tested.

  17. Color segmentation in the HSI color space using the K-means algorithm

    NASA Astrophysics Data System (ADS)

    Weeks, Arthur R.; Hague, G. Eric

    1997-04-01

    Segmentation of images is an important aspect of image recognition. While grayscale image segmentation has become quite a mature field, much less work has been done with regard to color image segmentation. Until recently, this was predominantly due to the lack of available computing power and color display hardware that is required to manipulate true color images (24-bit). TOday, it is not uncommon to find a standard desktop computer system with a true-color 24-bit display, at least 8 million bytes of memory, and 2 gigabytes of hard disk storage. Segmentation of color images is not as simple as segmenting each of the three RGB color components separately. The difficulty of using the RGB color space is that it doesn't closely model the psychological understanding of color. A better color model, which closely follows that of human visual perception is the hue, saturation, intensity model. This color model separates the color components in terms of chromatic and achromatic information. Strickland et al. was able to show the importance of color in the extraction of edge features form an image. His method enhances the edges that are detectable in the luminance image with information from the saturation image. Segmentation of both the saturation and intensity components is easily accomplished with any gray scale segmentation algorithm, since these spaces are linear. The modulus 2(pi) nature of the hue color component makes its segmentation difficult. For example, a hue of 0 and 2(pi) yields the same color tint. Instead of applying separate image segmentation to each of the hue, saturation, and intensity components, a better method is to segment the chromatic component separately from the intensity component because of the importance that the chromatic information plays in the segmentation of color images. This paper presents a method of using the gray scale K-means algorithm to segment 24-bit color images. Additionally, this paper will show the importance the hue

  18. Color tongue image segmentation using fuzzy Kohonen networks and genetic algorithm

    NASA Astrophysics Data System (ADS)

    Wang, Aimin; Shen, Lansun; Zhao, Zhongxu

    2000-04-01

    A Tongue Imaging and Analysis System is being developed to acquire digital color tongue images, and to automatically classify and quantify the tongue characteristics for traditional Chinese medical examinations. An important processing step is to segment the tongue pixels into two categories, the tongue body (no coating) and the coating. In this paper, we present a two-stage clustering algorithm that combines Fuzzy Kohonen Clustering Networks and Genetic Algorithm for the segmentation, of which the major concern is to increase the interclass distance and at the same time decrease the intraclass distance. Experimental results confirm the effectiveness of this algorithm.

  19. Improvement of phase unwrapping algorithm based on image segmentation and merging

    NASA Astrophysics Data System (ADS)

    Wang, Huaying; Liu, Feifei; Zhu, Qiaofen

    2013-11-01

    A modified algorithm based on image segmentation and merging is proposed and demonstrated to improve the accuracy of the phase unwrapping algorithm. There are three improved aspects. Firstly, the method of unequal region segmentation is taken, which can make the regional information to be completely and accurately reproduced. Secondly, for the condition of noise and undersampling in different regions, different phase unwrapping algorithms are used, respectively. Lastly, for the sake of improving the accuracy of the phase unwrapping results, a method of weighted stack is applied to the overlapping region originated from blocks merging. The proposed algorithm has been verified by simulations and experiments. The results not only validate the accuracy and rapidity of the improved algorithm to recover the phase information of the measured object, but also illustrate the importance of the improved algorithm in Traditional Chinese Medicine Decoction Pieces cell identification.

  20. An automated blood vessel segmentation algorithm using histogram equalization and automatic threshold selection.

    PubMed

    Saleh, Marwan D; Eswaran, C; Mueen, Ahmed

    2011-08-01

    This paper focuses on the detection of retinal blood vessels which play a vital role in reducing the proliferative diabetic retinopathy and for preventing the loss of visual capability. The proposed algorithm which takes advantage of the powerful preprocessing techniques such as the contrast enhancement and thresholding offers an automated segmentation procedure for retinal blood vessels. To evaluate the performance of the new algorithm, experiments are conducted on 40 images collected from DRIVE database. The results show that the proposed algorithm performs better than the other known algorithms in terms of accuracy. Furthermore, the proposed algorithm being simple and easy to implement, is best suited for fast processing applications.

  1. Localized Ambient Solidity Separation Algorithm Based Computer User Segmentation

    PubMed Central

    Sun, Xiao; Zhang, Tongda; Chai, Yueting; Liu, Yi

    2015-01-01

    Most of popular clustering methods typically have some strong assumptions of the dataset. For example, the k-means implicitly assumes that all clusters come from spherical Gaussian distributions which have different means but the same covariance. However, when dealing with datasets that have diverse distribution shapes or high dimensionality, these assumptions might not be valid anymore. In order to overcome this weakness, we proposed a new clustering algorithm named localized ambient solidity separation (LASS) algorithm, using a new isolation criterion called centroid distance. Compared with other density based isolation criteria, our proposed centroid distance isolation criterion addresses the problem caused by high dimensionality and varying density. The experiment on a designed two-dimensional benchmark dataset shows that our proposed LASS algorithm not only inherits the advantage of the original dissimilarity increments clustering method to separate naturally isolated clusters but also can identify the clusters which are adjacent, overlapping, and under background noise. Finally, we compared our LASS algorithm with the dissimilarity increments clustering method on a massive computer user dataset with over two million records that contains demographic and behaviors information. The results show that LASS algorithm works extremely well on this computer user dataset and can gain more knowledge from it. PMID:26221133

  2. Localized Ambient Solidity Separation Algorithm Based Computer User Segmentation.

    PubMed

    Sun, Xiao; Zhang, Tongda; Chai, Yueting; Liu, Yi

    2015-01-01

    Most of popular clustering methods typically have some strong assumptions of the dataset. For example, the k-means implicitly assumes that all clusters come from spherical Gaussian distributions which have different means but the same covariance. However, when dealing with datasets that have diverse distribution shapes or high dimensionality, these assumptions might not be valid anymore. In order to overcome this weakness, we proposed a new clustering algorithm named localized ambient solidity separation (LASS) algorithm, using a new isolation criterion called centroid distance. Compared with other density based isolation criteria, our proposed centroid distance isolation criterion addresses the problem caused by high dimensionality and varying density. The experiment on a designed two-dimensional benchmark dataset shows that our proposed LASS algorithm not only inherits the advantage of the original dissimilarity increments clustering method to separate naturally isolated clusters but also can identify the clusters which are adjacent, overlapping, and under background noise. Finally, we compared our LASS algorithm with the dissimilarity increments clustering method on a massive computer user dataset with over two million records that contains demographic and behaviors information. The results show that LASS algorithm works extremely well on this computer user dataset and can gain more knowledge from it. PMID:26221133

  3. Advanced Dispersed Fringe Sensing Algorithm for Coarse Phasing Segmented Mirror Telescopes

    NASA Technical Reports Server (NTRS)

    Spechler, Joshua A.; Hoppe, Daniel J.; Sigrist, Norbert; Shi, Fang; Seo, Byoung-Joon; Bikkannavar, Siddarayappa A.

    2013-01-01

    Segment mirror phasing, a critical step of segment mirror alignment, requires the ability to sense and correct the relative pistons between segments from up to a few hundred microns to a fraction of wavelength in order to bring the mirror system to its full diffraction capability. When sampling the aperture of a telescope, using auto-collimating flats (ACFs) is more economical. The performance of a telescope with a segmented primary mirror strongly depends on how well those primary mirror segments can be phased. One such process to phase primary mirror segments in the axial piston direction is dispersed fringe sensing (DFS). DFS technology can be used to co-phase the ACFs. DFS is essentially a signal fitting and processing operation. It is an elegant method of coarse phasing segmented mirrors. DFS performance accuracy is dependent upon careful calibration of the system as well as other factors such as internal optical alignment, system wavefront errors, and detector quality. Novel improvements to the algorithm have led to substantial enhancements in DFS performance. The Advanced Dispersed Fringe Sensing (ADFS) Algorithm is designed to reduce the sensitivity to calibration errors by determining the optimal fringe extraction line. Applying an angular extraction line dithering procedure and combining this dithering process with an error function while minimizing the phase term of the fitted signal, defines in essence the ADFS algorithm.

  4. 3D superalloy grain segmentation using a multichannel edge-weighted centroidal Voronoi tessellation algorithm.

    PubMed

    Cao, Yu; Ju, Lili; Zhou, Youjie; Wang, Song

    2013-10-01

    Accurate grain segmentation on 3D superalloy images is very important in materials science and engineering. From grain segmentation, we can derive the underlying superalloy grains' micro-structures, based on how many important physical, mechanical, and chemical properties of the superalloy samples can be evaluated. Grain segmentation is, however, usually a very challenging problem because: 1) even a small 3D superalloy sample may contain hundreds of grains; 2) carbides and noises may degrade the imaging quality; and 3) the intensity within a grain may not be homogeneous. In addition, the same grain may present different appearances, e.g., different intensities, under different microscope settings. In practice, a 3D superalloy image may contain multichannel information where each channel corresponds to a specific microscope setting. In this paper, we develop a multichannel edge-weighted centroidal Voronoi tessellation (MCEWCVT) algorithm to effectively and robustly segment the superalloy grains from 3D multichannel superalloy images. MCEWCVT performs segmentation by minimizing an energy function, which encodes both the multichannel voxel-intensity similarity within each cluster in the intensity domain and the smoothness of segmentation boundaries in the 3D image domain. In the experiment, we first quantitatively evaluate the proposed MCEWCVT algorithm on a four-channel Ni-based 3D superalloy data set (IN100) against the manually annotated ground-truth segmentation. We further evaluate the MCEWCVT algorithm on two synthesized four-channel superalloy data sets. The qualitative and quantitative comparisons of 18 existing image segmentation algorithms demonstrate the effectiveness and robustness of the proposed MCEWCVT algorithm. PMID:23797261

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

    PubMed

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

    2016-01-01

    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

  6. Side scan sonar image segmentation based on neutrosophic set and quantum-behaved particle swarm optimization algorithm

    NASA Astrophysics Data System (ADS)

    Zhao, Jianhu; Wang, Xiao; Zhang, Hongmei; Hu, Jun; Jian, Xiaomin

    2016-06-01

    To fulfill side scan sonar (SSS) image segmentation accurately and efficiently, a novel segmentation algorithm based on neutrosophic set (NS) and quantum-behaved particle swarm optimization (QPSO) is proposed in this paper. Firstly, the neutrosophic subset images are obtained by transforming the input image into the NS domain. Then, a co-occurrence matrix is accurately constructed based on these subset images, and the entropy of the gray level image is described to serve as the fitness function of the QPSO algorithm. Moreover, the optimal two-dimensional segmentation threshold vector is quickly obtained by QPSO. Finally, the contours of the interested target are segmented with the threshold vector and extracted by the mathematic morphology operation. To further improve the segmentation efficiency, the single threshold segmentation, an alternative algorithm, is recommended for the shadow segmentation by considering the gray level characteristics of the shadow. The accuracy and efficiency of the proposed algorithm are assessed with experiments of SSS image segmentation.

  7. Side scan sonar image segmentation based on neutrosophic set and quantum-behaved particle swarm optimization algorithm

    NASA Astrophysics Data System (ADS)

    Zhao, Jianhu; Wang, Xiao; Zhang, Hongmei; Hu, Jun; Jian, Xiaomin

    2016-09-01

    To fulfill side scan sonar (SSS) image segmentation accurately and efficiently, a novel segmentation algorithm based on neutrosophic set (NS) and quantum-behaved particle swarm optimization (QPSO) is proposed in this paper. Firstly, the neutrosophic subset images are obtained by transforming the input image into the NS domain. Then, a co-occurrence matrix is accurately constructed based on these subset images, and the entropy of the gray level image is described to serve as the fitness function of the QPSO algorithm. Moreover, the optimal two-dimensional segmentation threshold vector is quickly obtained by QPSO. Finally, the contours of the interested target are segmented with the threshold vector and extracted by the mathematic morphology operation. To further improve the segmentation efficiency, the single threshold segmentation, an alternative algorithm, is recommended for the shadow segmentation by considering the gray level characteristics of the shadow. The accuracy and efficiency of the proposed algorithm are assessed with experiments of SSS image segmentation.

  8. Meaningful region extraction based on three-stage unsupervised segmentation algorithm

    NASA Astrophysics Data System (ADS)

    Ben, Zhiwei; Zhao, Xunjie; Li, Chengjin

    2009-11-01

    From a theoretical standpoint, meaningful region segmentation based only on gray level or color usually presents over segmentation or non-continuous regions. In view of this, we adopt a number of classical powerful algorithms (mean shift clustering, edge detection and region growing) to extract the meaningful regions adds spatial information. These algorithms are subjectively connected together and impact the results each other. The experiments indicate that the proposed method can avoid over-segmentation phenomenon and the results can be easily accepted by human eyes. Experimental results are superior to that of kmeans clustering method in both real-time performance and image segmentation performance. Finally, we achieved a new procedure to extract meaningful regions by clicking some place of a color image. It possesses a good application prospect and owns an effective real-time performance.

  9. Liver Segmentation Based on Snakes Model and Improved GrowCut Algorithm in Abdominal CT Image

    PubMed Central

    He, Baochun; Ma, Zhiyuan; Zong, Mao; Zhou, Xiangrong; Fujita, Hiroshi

    2013-01-01

    A novel method based on Snakes Model and GrowCut algorithm is proposed to segment liver region in abdominal CT images. First, according to the traditional GrowCut method, a pretreatment process using K-means algorithm is conducted to reduce the running time. Then, the segmentation result of our improved GrowCut approach is used as an initial contour for the future precise segmentation based on Snakes model. At last, several experiments are carried out to demonstrate the performance of our proposed approach and some comparisons are conducted between the traditional GrowCut algorithm. Experimental results show that the improved approach not only has a better robustness and precision but also is more efficient than the traditional GrowCut method. PMID:24066017

  10. Task-based evaluation of segmentation algorithms for diffusion-weighted MRI without using a gold standard.

    PubMed

    Jha, Abhinav K; Kupinski, Matthew A; Rodríguez, Jeffrey J; Stephen, Renu M; Stopeck, Alison T

    2012-07-01

    In many studies, the estimation of the apparent diffusion coefficient (ADC) of lesions in visceral organs in diffusion-weighted (DW) magnetic resonance images requires an accurate lesion-segmentation algorithm. To evaluate these lesion-segmentation algorithms, region-overlap measures are used currently. However, the end task from the DW images is accurate ADC estimation, and the region-overlap measures do not evaluate the segmentation algorithms on this task. Moreover, these measures rely on the existence of gold-standard segmentation of the lesion, which is typically unavailable. In this paper, we study the problem of task-based evaluation of segmentation algorithms in DW imaging in the absence of a gold standard. We first show that using manual segmentations instead of gold-standard segmentations for this task-based evaluation is unreliable. We then propose a method to compare the segmentation algorithms that does not require gold-standard or manual segmentation results. The no-gold-standard method estimates the bias and the variance of the error between the true ADC values and the ADC values estimated using the automated segmentation algorithm. The method can be used to rank the segmentation algorithms on the basis of both the ensemble mean square error and precision. We also propose consistency checks for this evaluation technique.

  11. Nonlinear physical segmentation algorithm for determining the layer boundary from lidar signal.

    PubMed

    Mao, Feiyue; Li, Jun; Li, Chen; Gong, Wei; Min, Qilong; Wang, Wei

    2015-11-30

    Layer boundary (base and top) detection is a basic problem in lidar data processing, the results of which are used as inputs of optical properties retrieval. However, traditional algorithms not only require manual intervention but also rely heavily on the signal-to-noise ratio. Therefore, we propose a robust and automatic algorithm for layer detection based on a novel algorithm for lidar signal segmentation and representation. Our algorithm is based on the lidar equation and avoids most of the limitations of the traditional algorithms. Testing of the simulated and real signals shows that the algorithm is able to position the base and top accurately even with a low signal to noise ratio. Furthermore, the results of the classification are accurate and satisfactory. The experimental results confirm that our algorithm can be used for automatic detection, retrieval, and analysis of lidar data sets.

  12. A pulse coupled neural network segmentation algorithm for reflectance confocal images of epithelial tissue.

    PubMed

    Harris, Meagan A; Van, Andrew N; Malik, Bilal H; Jabbour, Joey M; Maitland, Kristen C

    2015-01-01

    Automatic segmentation of nuclei in reflectance confocal microscopy images is critical for visualization and rapid quantification of nuclear-to-cytoplasmic ratio, a useful indicator of epithelial precancer. Reflectance confocal microscopy can provide three-dimensional imaging of epithelial tissue in vivo with sub-cellular resolution. Changes in nuclear density or nuclear-to-cytoplasmic ratio as a function of depth obtained from confocal images can be used to determine the presence or stage of epithelial cancers. However, low nuclear to background contrast, low resolution at greater imaging depths, and significant variation in reflectance signal of nuclei complicate segmentation required for quantification of nuclear-to-cytoplasmic ratio. Here, we present an automated segmentation method to segment nuclei in reflectance confocal images using a pulse coupled neural network algorithm, specifically a spiking cortical model, and an artificial neural network classifier. The segmentation algorithm was applied to an image model of nuclei with varying nuclear to background contrast. Greater than 90% of simulated nuclei were detected for contrast of 2.0 or greater. Confocal images of porcine and human oral mucosa were used to evaluate application to epithelial tissue. Segmentation accuracy was assessed using manual segmentation of nuclei as the gold standard.

  13. A Pulse Coupled Neural Network Segmentation Algorithm for Reflectance Confocal Images of Epithelial Tissue

    PubMed Central

    Malik, Bilal H.; Jabbour, Joey M.; Maitland, Kristen C.

    2015-01-01

    Automatic segmentation of nuclei in reflectance confocal microscopy images is critical for visualization and rapid quantification of nuclear-to-cytoplasmic ratio, a useful indicator of epithelial precancer. Reflectance confocal microscopy can provide three-dimensional imaging of epithelial tissue in vivo with sub-cellular resolution. Changes in nuclear density or nuclear-to-cytoplasmic ratio as a function of depth obtained from confocal images can be used to determine the presence or stage of epithelial cancers. However, low nuclear to background contrast, low resolution at greater imaging depths, and significant variation in reflectance signal of nuclei complicate segmentation required for quantification of nuclear-to-cytoplasmic ratio. Here, we present an automated segmentation method to segment nuclei in reflectance confocal images using a pulse coupled neural network algorithm, specifically a spiking cortical model, and an artificial neural network classifier. The segmentation algorithm was applied to an image model of nuclei with varying nuclear to background contrast. Greater than 90% of simulated nuclei were detected for contrast of 2.0 or greater. Confocal images of porcine and human oral mucosa were used to evaluate application to epithelial tissue. Segmentation accuracy was assessed using manual segmentation of nuclei as the gold standard. PMID:25816131

  14. A new method for mesoscale eddy detection based on watershed segmentation algorithm

    NASA Astrophysics Data System (ADS)

    Qin, Lijuan; Dong, Qing; Xue, Cunjin; Hou, Xueyan; Song, Wanjiao

    2014-11-01

    Mesoscale eddies are widely found in the ocean. They play important roles in heat transport, momentum transport, ocean circulation and so on. The automatic detection of mesoscale eddies based on satellite remote sensing images is an important research topic. Some image processing methods have been applied to identify mesoscale eddies such as Canny operator, Hough transform and so forth, but the accuracy of detection was not very ideal. This paper described a new algorithm based on watershed segmentation algorithm for automatic detection of mesoscale eddies from sea level anomaly(SLA) image. Watershed segmentation algorithm has the disadvantage of over-segmentation. It is important to select appropriate markers. In this study, markers were selected from the reconstructed SLA image, which were used to modify the gradient image. Then two parameters, radius and amplitude of eddy, were used to filter the segmentation results. The method was tested on the Northwest Pacific using TOPEX/Poseidon altimeter data. The results are encouraging, showing that this algorithm is applicable for mesoscale eddies and has a good accuracy. This algorithm has a good response to weak edges and extracted eddies have complete and continuous boundaries. The eddy boundaries generally coincide with closed contours of SSH.

  15. Novel algorithm by low complexity filter on retinal vessel segmentation

    NASA Astrophysics Data System (ADS)

    Rostampour, Samad

    2011-10-01

    This article shows a new method to detect blood vessels in the retina by digital images. Retinal vessel segmentation is important for detection of side effect of diabetic disease, because diabetes can form new capillaries which are very brittle. The research has been done in two phases: preprocessing and processing. Preprocessing phase consists to apply a new filter that produces a suitable output. It shows vessels in dark color on white background and make a good difference between vessels and background. The complexity is very low and extra images are eliminated. The second phase is processing and used the method is called Bayesian. It is a built-in in supervision classification method. This method uses of mean and variance of intensity of pixels for calculate of probability. Finally Pixels of image are divided into two classes: vessels and background. Used images are related to the DRIVE database. After performing this operation, the calculation gives 95 percent of efficiency average. The method also was performed from an external sample DRIVE database which has retinopathy, and perfect result was obtained

  16. Evaluation of prostate segmentation algorithms for MRI: the PROMISE12 challenge.

    PubMed

    Litjens, Geert; Toth, Robert; van de Ven, Wendy; Hoeks, Caroline; Kerkstra, Sjoerd; van Ginneken, Bram; Vincent, Graham; Guillard, Gwenael; Birbeck, Neil; Zhang, Jindang; Strand, Robin; Malmberg, Filip; Ou, Yangming; Davatzikos, Christos; Kirschner, Matthias; Jung, Florian; Yuan, Jing; Qiu, Wu; Gao, Qinquan; Edwards, Philip Eddie; Maan, Bianca; van der Heijden, Ferdinand; Ghose, Soumya; Mitra, Jhimli; Dowling, Jason; Barratt, Dean; Huisman, Henkjan; Madabhushi, Anant

    2014-02-01

    Prostate MRI image segmentation has been an area of intense research due to the increased use of MRI as a modality for the clinical workup of prostate cancer. Segmentation is useful for various tasks, e.g. to accurately localize prostate boundaries for radiotherapy or to initialize multi-modal registration algorithms. In the past, it has been difficult for research groups to evaluate prostate segmentation algorithms on multi-center, multi-vendor and multi-protocol data. Especially because we are dealing with MR images, image appearance, resolution and the presence of artifacts are affected by differences in scanners and/or protocols, which in turn can have a large influence on algorithm accuracy. The Prostate MR Image Segmentation (PROMISE12) challenge was setup to allow a fair and meaningful comparison of segmentation methods on the basis of performance and robustness. In this work we will discuss the initial results of the online PROMISE12 challenge, and the results obtained in the live challenge workshop hosted by the MICCAI2012 conference. In the challenge, 100 prostate MR cases from 4 different centers were included, with differences in scanner manufacturer, field strength and protocol. A total of 11 teams from academic research groups and industry participated. Algorithms showed a wide variety in methods and implementation, including active appearance models, atlas registration and level sets. Evaluation was performed using boundary and volume based metrics which were combined into a single score relating the metrics to human expert performance. The winners of the challenge where the algorithms by teams Imorphics and ScrAutoProstate, with scores of 85.72 and 84.29 overall. Both algorithms where significantly better than all other algorithms in the challenge (p<0.05) and had an efficient implementation with a run time of 8min and 3s per case respectively. Overall, active appearance model based approaches seemed to outperform other approaches like multi

  17. Evaluation of prostate segmentation algorithms for MRI: the PROMISE12 challenge.

    PubMed

    Litjens, Geert; Toth, Robert; van de Ven, Wendy; Hoeks, Caroline; Kerkstra, Sjoerd; van Ginneken, Bram; Vincent, Graham; Guillard, Gwenael; Birbeck, Neil; Zhang, Jindang; Strand, Robin; Malmberg, Filip; Ou, Yangming; Davatzikos, Christos; Kirschner, Matthias; Jung, Florian; Yuan, Jing; Qiu, Wu; Gao, Qinquan; Edwards, Philip Eddie; Maan, Bianca; van der Heijden, Ferdinand; Ghose, Soumya; Mitra, Jhimli; Dowling, Jason; Barratt, Dean; Huisman, Henkjan; Madabhushi, Anant

    2014-02-01

    Prostate MRI image segmentation has been an area of intense research due to the increased use of MRI as a modality for the clinical workup of prostate cancer. Segmentation is useful for various tasks, e.g. to accurately localize prostate boundaries for radiotherapy or to initialize multi-modal registration algorithms. In the past, it has been difficult for research groups to evaluate prostate segmentation algorithms on multi-center, multi-vendor and multi-protocol data. Especially because we are dealing with MR images, image appearance, resolution and the presence of artifacts are affected by differences in scanners and/or protocols, which in turn can have a large influence on algorithm accuracy. The Prostate MR Image Segmentation (PROMISE12) challenge was setup to allow a fair and meaningful comparison of segmentation methods on the basis of performance and robustness. In this work we will discuss the initial results of the online PROMISE12 challenge, and the results obtained in the live challenge workshop hosted by the MICCAI2012 conference. In the challenge, 100 prostate MR cases from 4 different centers were included, with differences in scanner manufacturer, field strength and protocol. A total of 11 teams from academic research groups and industry participated. Algorithms showed a wide variety in methods and implementation, including active appearance models, atlas registration and level sets. Evaluation was performed using boundary and volume based metrics which were combined into a single score relating the metrics to human expert performance. The winners of the challenge where the algorithms by teams Imorphics and ScrAutoProstate, with scores of 85.72 and 84.29 overall. Both algorithms where significantly better than all other algorithms in the challenge (p<0.05) and had an efficient implementation with a run time of 8min and 3s per case respectively. Overall, active appearance model based approaches seemed to outperform other approaches like multi

  18. Comparison of two algorithms in the automatic segmentation of blood vessels in fundus images

    NASA Astrophysics Data System (ADS)

    LeAnder, Robert; Chowdary, Myneni Sushma; Mokkapati, Swapnasri; Umbaugh, Scott E.

    2008-03-01

    Effective timing and treatment are critical to saving the sight of patients with diabetes. Lack of screening, as well as a shortage of ophthalmologists, help contribute to approximately 8,000 cases per year of people who lose their sight to diabetic retinopathy, the leading cause of new cases of blindness [1] [2]. Timely treatment for diabetic retinopathy prevents severe vision loss in over 50% of eyes tested [1]. Fundus images can provide information for detecting and monitoring eye-related diseases, like diabetic retinopathy, which if detected early, may help prevent vision loss. Damaged blood vessels can indicate the presence of diabetic retinopathy [9]. So, early detection of damaged vessels in retinal images can provide valuable information about the presence of disease, thereby helping to prevent vision loss. Purpose: The purpose of this study was to compare the effectiveness of two blood vessel segmentation algorithms. Methods: Fifteen fundus images from the STARE database were used to develop two algorithms using the CVIPtools software environment. Another set of fifteen images were derived from the first fifteen and contained ophthalmologists' hand-drawn tracings over the retinal vessels. The ophthalmologists' tracings were used as the "gold standard" for perfect segmentation and compared with the segmented images that were output by the two algorithms. Comparisons between the segmented and the hand-drawn images were made using Pratt's Figure of Merit (FOM), Signal-to-Noise Ratio (SNR) and Root Mean Square (RMS) Error. Results: Algorithm 2 has an FOM that is 10% higher than Algorithm 1. Algorithm 2 has a 6%-higher SNR than Algorithm 1. Algorithm 2 has only 1.3% more RMS error than Algorithm 1. Conclusions: Algorithm 1 extracted most of the blood vessels with some missing intersections and bifurcations. Algorithm 2 extracted all the major blood vessels, but eradicated some vessels as well. Algorithm 2 outperformed Algorithm 1 in terms of visual clarity, FOM

  19. A fast algorithm for the phonemic segmentation of continuous speech

    NASA Astrophysics Data System (ADS)

    Smidt, D.

    1986-04-01

    The method of differential learning (DL method) was applied to the fast phonemic classification of acoustic speech spectra. The method was also tested with a simple algorithm for continuous speech recognition. In every learning step of the DL method only that single pattern component which deviates most from the reference value is used for a new rule. Several rules of this type were connected in a conjunctive or disjunctive way. Tests with a single speaker demonstrate good classification capability and a very high speed. The inclusion of automatically additional features selected according to their relevance is discussed. It is shown that there exists a correspondence between processes related to the DL method and pattern recognition in living beings with their ability for generalization and differentiation.

  20. An evolutionary algorithm for the segmentation of muscles and bones of the lower limb.

    NASA Astrophysics Data System (ADS)

    Lpez, Marco A.; Braidot, A.; Sattler, Anbal; Schira, Claudia; Uriburu, E.

    2016-04-01

    In the field of medical image segmentation, muscles segmentation is a problem that has not been fully resolved yet. This is due to the fact that the basic assumption of image segmentation, which asserts that a visual distinction should ex- ist between the different structures to be identified, is infringed. As the tissue composition of two different muscles is the same, it becomes extremely difficult to distinguish one another if they are near. We have developed an evolutionary algorithm which selects the set and the sequence of morphological operators that better segments muscles and bones from an MRI image. The achieved results shows that the developed algorithm presents average sensitivity values close to 75% in the segmentation of the different processed muscles and bones. It also presents average specificity values close to 93% for the same structures. Furthermore, the algorithm can identify muscles that are closely located through the path from their origin point to their insertions, with very low error values (below 7%) .

  1. Shack-Hartmann mask/pupil registration algorithm for wavefront sensing in segmented mirror telescopes.

    PubMed

    Piatrou, Piotr; Chanan, Gary

    2013-11-10

    Shack-Hartmann wavefront sensing in general requires careful registration of the reimaged telescope primary mirror to the Shack-Hartmann mask or lenslet array. The registration requirements are particularly demanding for applications in which segmented mirrors are phased using a physical optics generalization of the Shack-Hartmann test. In such cases the registration tolerances are less than 0.1% of the diameter of the primary mirror. We present a pupil registration algorithm suitable for such high accuracy applications that is based on the one used successfully for phasing the segments of the Keck telescopes. The pupil is aligned in four degrees of freedom (translations, rotation, and magnification) by balancing the intensities of subimages formed by small subapertures that straddle the periphery of the mirror. We describe the algorithm in general terms and then in the specific context of two very different geometries: the 492 segment Thirty Meter Telescope, and the seven "segment" Giant Magellan Telescope. Through detailed simulations we explore the accuracy of the algorithm and its sensitivity to such effects as cross talk, noise/counting statistics, atmospheric scintillation, and segment reflectivity variations.

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

    PubMed

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

    2011-12-01

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

  3. An algorithm for automating the registration of USDA segment ground data to LANDSAT MSS data

    NASA Technical Reports Server (NTRS)

    Graham, M. H. (Principal Investigator)

    1981-01-01

    The algorithm is referred to as the Automatic Segment Matching Algorithm (ASMA). The ASMA uses control points or the annotation record of a P-format LANDSAT compter compatible tape as the initial registration to relate latitude and longitude to LANDSAT rows and columns. It searches a given area of LANDSAT data with a 2x2 sliding window and computes gradient values for bands 5 and 7 to match the segment boundaries. The gradient values are held in memory during the shifting (or matching) process. The reconstructed segment array, containing ones (1's) for boundaries and zeros elsewhere are computer compared to the LANDSAT array and the best match computed. Initial testing of the ASMA indicates that it has good potential for replacing the manual technique.

  4. On the importance of FIB-SEM specific segmentation algorithms for porous media

    SciTech Connect

    Salzer, Martin; Thiele, Simon; Zengerle, Roland; Schmidt, Volker

    2014-09-15

    A new algorithmic approach to segmentation of highly porous three dimensional image data gained by focused ion beam tomography is described which extends the key-principle of local threshold backpropagation described in Salzer et al. (2012). The technique of focused ion beam tomography has shown to be capable of imaging the microstructure of functional materials. In order to perform a quantitative analysis on the corresponding microstructure a segmentation task needs to be performed. However, algorithmic segmentation of images obtained with focused ion beam tomography is a challenging problem for highly porous materials if filling the pore phase, e.g. with epoxy resin, is difficult. The gray intensities of individual voxels are not sufficient to determine the phase represented by them and usual thresholding methods are not applicable. We thus propose a new approach to segmentation that pays respect to the specifics of the imaging process of focused ion beam tomography. As an application of our approach, the segmentation of three dimensional images for a cathode material used in polymer electrolyte membrane fuel cells is discussed. We show that our approach preserves significantly more of the original nanostructure than a thresholding approach. - Highlights: • We describe a new approach to the segmentation of FIB-SEM images of porous media. • The first and last occurrences of structures are detected by analysing the z-profiles. • The algorithm is validated by comparing it to a manual segmentation. • The new approach shows significantly less artifacts than a thresholding approach. • A structural analysis also shows improved results for the obtained microstructure.

  5. Analysis of the Command and Control Segment (CCS) attitude estimation algorithm

    NASA Technical Reports Server (NTRS)

    Stockwell, Catherine

    1993-01-01

    This paper categorizes the qualitative behavior of the Command and Control Segment (CCS) differential correction algorithm as applied to attitude estimation using simultaneous spin axis sun angle and Earth cord length measurements. The categories of interest are the domains of convergence, divergence, and their boundaries. Three series of plots are discussed that show the dependence of the estimation algorithm on the vehicle radius, the sun/Earth angle, and the spacecraft attitude. Common qualitative dynamics to all three series are tabulated and discussed. Out-of-limits conditions for the estimation algorithm are identified and discussed.

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

    NASA Astrophysics Data System (ADS)

    Zhang, Zhenhai; Li, Kejie

    2009-07-01

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

  7. Automated segmentation algorithm for detection of changes in vaginal epithelial morphology using optical coherence tomography

    NASA Astrophysics Data System (ADS)

    Chitchian, Shahab; Vincent, Kathleen L.; Vargas, Gracie; Motamedi, Massoud

    2012-11-01

    We have explored the use of optical coherence tomography (OCT) as a noninvasive tool for assessing the toxicity of topical microbicides, products used to prevent HIV, by monitoring the integrity of the vaginal epithelium. A novel feature-based segmentation algorithm using a nearest-neighbor classifier was developed to monitor changes in the morphology of vaginal epithelium. The two-step automated algorithm yielded OCT images with a clearly defined epithelial layer, enabling differentiation of normal and damaged tissue. The algorithm was robust in that it was able to discriminate the epithelial layer from underlying stroma as well as residual microbicide product on the surface. This segmentation technique for OCT images has the potential to be readily adaptable to the clinical setting for noninvasively defining the boundaries of the epithelium, enabling quantifiable assessment of microbicide-induced damage in vaginal tissue.

  8. Algorithm for the identification of malfunctioning sensors in the control systems of segmented mirror telescopes.

    PubMed

    Chanan, Gary; Nelson, Jerry

    2009-11-10

    The active control systems of segmented mirror telescopes are vulnerable to a malfunction of a few (or even one) of their segment edge sensors, the effects of which can propagate through the entire system and seriously compromise the overall telescope image quality. Since there are thousands of such sensors in the extremely large telescopes now under development, it is essential to develop fast and efficient algorithms that can identify bad sensors so that they can be removed from the control loop. Such algorithms are nontrivial; for example, a simple residual-to-the-fit test will often fail to identify a bad sensor. We propose an algorithm that can reliably identify a single bad sensor and we extend it to the more difficult case of multiple bad sensors. Somewhat surprisingly, the identification of a fixed number of bad sensors does not necessarily become more difficult as the telescope becomes larger and the number of sensors in the control system increases.

  9. Analyzing the medical image by using clustering algorithms through segmentation process

    NASA Astrophysics Data System (ADS)

    Kumar, Papendra; Kumar, Suresh

    2012-01-01

    Basic aim of our study is to analyze the medical image. In computer vision, segmentationRefers to the process of partitioning a digital image into multiple regions. The goal ofSegmentation is to simplify and/or change the representation of an image into something thatIs more meaningful and easier to analyze. Image segmentation is typically used to locateObjects and boundaries (lines, curves, etc.) in images.There is a lot of scope of the analysis that we have done in our project; our analysis couldBe used for the purpose of monitoring the medical image. Medical imaging refers to theTechniques and processes used to create images of the human body (or parts thereof) forClinical purposes (medical procedures seeking to reveal, diagnose or examine disease) orMedical science (including the study of normal anatomy and function).As a discipline and in its widest sense, it is part of biological imaging and incorporatesRadiology (in the wider sense), radiological sciences, endoscopy, (medical) thermography, Medical photography and microscopy (e.g. for human pathological investigations).Measurement and recording techniques which are not primarily designed to produce images.

  10. Analyzing the medical image by using clustering algorithms through segmentation process

    NASA Astrophysics Data System (ADS)

    Kumar, Papendra; Kumar, Suresh

    2011-12-01

    Basic aim of our study is to analyze the medical image. In computer vision, segmentationRefers to the process of partitioning a digital image into multiple regions. The goal ofSegmentation is to simplify and/or change the representation of an image into something thatIs more meaningful and easier to analyze. Image segmentation is typically used to locateObjects and boundaries (lines, curves, etc.) in images.There is a lot of scope of the analysis that we have done in our project; our analysis couldBe used for the purpose of monitoring the medical image. Medical imaging refers to theTechniques and processes used to create images of the human body (or parts thereof) forClinical purposes (medical procedures seeking to reveal, diagnose or examine disease) orMedical science (including the study of normal anatomy and function).As a discipline and in its widest sense, it is part of biological imaging and incorporatesRadiology (in the wider sense), radiological sciences, endoscopy, (medical) thermography, Medical photography and microscopy (e.g. for human pathological investigations).Measurement and recording techniques which are not primarily designed to produce images.

  11. Feature measures for the segmentation of neuronal membrane using a machine learning algorithm

    NASA Astrophysics Data System (ADS)

    Iftikhar, Saadia; Godil, Afzal

    2013-12-01

    In this paper, we present a Support Vector Machine (SVM) based pixel classifier for a semi-automated segmentation algorithm to detect neuronal membrane structures in stacks of electron microscopy images of brain tissue samples. This algorithm uses high-dimensional feature spaces extracted from center-surrounded patches, and some distinct edge sensitive features for each pixel in the image, and a training dataset for the segmentation of neuronal membrane structures and background. Some threshold conditions are later applied to remove small regions, which are below a certain threshold criteria, and morphological operations, such as the filling of the detected objects, are done to get compactness in the objects. The performance of the segmentation method is calculated on the unseen data by using three distinct error measures: pixel error, wrapping error, and rand error, and also a pixel by pixel accuracy measure with their respective ground-truth. The trained SVM classifier achieves the best precision level in these three distinct errors at 0.23, 0.016 and 0.15, respectively; while the best accuracy using pixel by pixel measure reaches 77% on the given dataset. The results presented here are one step further towards exploring possible ways to solve these hard problems, such as segmentation in medical image analysis. In the future, we plan to extend it as a 3D segmentation approach for 3D datasets to not only retain the topological structures in the dataset but also for the ease of further analysis.

  12. Brain tumor segmentation in MR slices using improved GrowCut algorithm

    NASA Astrophysics Data System (ADS)

    Ji, Chunhong; Yu, Jinhua; Wang, Yuanyuan; Chen, Liang; Shi, Zhifeng; Mao, Ying

    2015-12-01

    The detection of brain tumor from MR images is very significant for medical diagnosis and treatment. However, the existing methods are mostly based on manual or semiautomatic segmentation which are awkward when dealing with a large amount of MR slices. In this paper, a new fully automatic method for the segmentation of brain tumors in MR slices is presented. Based on the hypothesis of the symmetric brain structure, the method improves the interactive GrowCut algorithm by further using the bounding box algorithm in the pre-processing step. More importantly, local reflectional symmetry is used to make up the deficiency of the bounding box method. After segmentation, 3D tumor image is reconstructed. We evaluate the accuracy of the proposed method on MR slices with synthetic tumors and actual clinical MR images. Result of the proposed method is compared with the actual position of simulated 3D tumor qualitatively and quantitatively. In addition, our automatic method produces equivalent performance as manual segmentation and the interactive GrowCut with manual interference while providing fully automatic segmentation.

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

    NASA Astrophysics Data System (ADS)

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

    2015-04-01

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

  14. Novel real-time volumetric tool segmentation algorithm for intraoperative microscope integrated OCT (Conference Presentation)

    NASA Astrophysics Data System (ADS)

    Viehland, Christian; Keller, Brenton; Carrasco-Zevallos, Oscar; Cunefare, David; Shen, Liangbo; Toth, Cynthia; Farsiu, Sina; Izatt, Joseph A.

    2016-03-01

    Optical coherence tomography (OCT) allows for micron scale imaging of the human retina and cornea. Current generation research and commercial intrasurgical OCT prototypes are limited to live B-scan imaging. Our group has developed an intraoperative microscope integrated OCT system capable of live 4D imaging. With a heads up display (HUD) 4D imaging allows for dynamic intrasurgical visualization of tool tissue interaction and surgical maneuvers. Currently our system relies on operator based manual tracking to correct for patient motion and motion caused by the surgeon, to track the surgical tool, and to display the correct B-scan to display on the HUD. Even when tracking only bulk motion, the operator sometimes lags behind and the surgical region of interest can drift out of the OCT field of view. To facilitate imaging we report on the development of a fast volume based tool segmentation algorithm. The algorithm is based on a previously reported volume rendering algorithm and can identify both the tool and retinal surface. The algorithm requires 45 ms per volume for segmentation and can be used to actively place the B-scan across the tool tissue interface. Alternatively, real-time tool segmentation can be used to allow the surgeon to use the surgical tool as an interactive B-scan pointer.

  15. Hepatic Arterial Configuration in Relation to the Segmental Anatomy of the Liver; Observations on MDCT and DSA Relevant to Radioembolization Treatment

    SciTech Connect

    Hoven, Andor F. van den Leeuwen, Maarten S. van Lam, Marnix G. E. H. Bosch, Maurice A. A. J. van den

    2015-02-15

    PurposeCurrent anatomical classifications do not include all variants relevant for radioembolization (RE). The purpose of this study was to assess the individual hepatic arterial configuration and segmental vascularization pattern and to develop an individualized RE treatment strategy based on an extended classification.MethodsThe hepatic vascular anatomy was assessed on MDCT and DSA in patients who received a workup for RE between February 2009 and November 2012. Reconstructed MDCT studies were assessed to determine the hepatic arterial configuration (origin of every hepatic arterial branch, branching pattern and anatomical course) and the hepatic segmental vascularization territory of all branches. Aberrant hepatic arteries were defined as hepatic arterial branches that did not originate from the celiac axis/CHA/PHA. Early branching patterns were defined as hepatic arterial branches originating from the celiac axis/CHA.ResultsThe hepatic arterial configuration and segmental vascularization pattern could be assessed in 110 of 133 patients. In 59 patients (54 %), no aberrant hepatic arteries or early branching was observed. Fourteen patients without aberrant hepatic arteries (13 %) had an early branching pattern. In the 37 patients (34 %) with aberrant hepatic arteries, five also had an early branching pattern. Sixteen different hepatic arterial segmental vascularization patterns were identified and described, differing by the presence of aberrant hepatic arteries, their respective vascular territory, and origin of the artery vascularizing segment four.ConclusionsThe hepatic arterial configuration and segmental vascularization pattern show marked individual variability beyond well-known classifications of anatomical variants. We developed an individualized RE treatment strategy based on an extended anatomical classification.

  16. The cascaded moving k-means and fuzzy c-means clustering algorithms for unsupervised segmentation of malaria images

    NASA Astrophysics Data System (ADS)

    Abdul-Nasir, Aimi Salihah; Mashor, Mohd Yusoff; Halim, Nurul Hazwani Abd; Mohamed, Zeehaida

    2015-05-01

    Malaria is a life-threatening parasitic infectious disease that corresponds for nearly one million deaths each year. Due to the requirement of prompt and accurate diagnosis of malaria, the current study has proposed an unsupervised pixel segmentation based on clustering algorithm in order to obtain the fully segmented red blood cells (RBCs) infected with malaria parasites based on the thin blood smear images of P. vivax species. In order to obtain the segmented infected cell, the malaria images are first enhanced by using modified global contrast stretching technique. Then, an unsupervised segmentation technique based on clustering algorithm has been applied on the intensity component of malaria image in order to segment the infected cell from its blood cells background. In this study, cascaded moving k-means (MKM) and fuzzy c-means (FCM) clustering algorithms has been proposed for malaria slide image segmentation. After that, median filter algorithm has been applied to smooth the image as well as to remove any unwanted regions such as small background pixels from the image. Finally, seeded region growing area extraction algorithm has been applied in order to remove large unwanted regions that are still appeared on the image due to their size in which cannot be cleaned by using median filter. The effectiveness of the proposed cascaded MKM and FCM clustering algorithms has been analyzed qualitatively and quantitatively by comparing the proposed cascaded clustering algorithm with MKM and FCM clustering algorithms. Overall, the results indicate that segmentation using the proposed cascaded clustering algorithm has produced the best segmentation performances by achieving acceptable sensitivity as well as high specificity and accuracy values compared to the segmentation results provided by MKM and FCM algorithms.

  17. An efficient technique for nuclei segmentation based on ellipse descriptor analysis and improved seed detection algorithm.

    PubMed

    Xu, Hongming; Lu, Cheng; Mandal, Mrinal

    2014-09-01

    In this paper, we propose an efficient method for segmenting cell nuclei in the skin histopathological images. The proposed technique consists of four modules. First, it separates the nuclei regions from the background with an adaptive threshold technique. Next, an elliptical descriptor is used to detect the isolated nuclei with elliptical shapes. This descriptor classifies the nuclei regions based on two ellipticity parameters. Nuclei clumps and nuclei with irregular shapes are then localized by an improved seed detection technique based on voting in the eroded nuclei regions. Finally, undivided nuclei regions are segmented by a marked watershed algorithm. Experimental results on 114 different image patches indicate that the proposed technique provides a superior performance in nuclei detection and segmentation.

  18. Automatic brain tumor segmentation with a fast Mumford-Shah algorithm

    NASA Astrophysics Data System (ADS)

    Müller, Sabine; Weickert, Joachim; Graf, Norbert

    2016-03-01

    We propose a fully-automatic method for brain tumor segmentation that does not require any training phase. Our approach is based on a sequence of segmentations using the Mumford-Shah cartoon model with varying parameters. In order to come up with a very fast implementation, we extend the recent primal-dual algorithm of Strekalovskiy et al. (2014) from the 2D to the medically relevant 3D setting. Moreover, we suggest a new confidence refinement and show that it can increase the precision of our segmentations substantially. Our method is evaluated on 188 data sets with high-grade gliomas and 25 with low-grade gliomas from the BraTS14 database. Within a computation time of only three minutes, we achieve Dice scores that are comparable to state-of-the-art methods.

  19. Application of Micro-segmentation Algorithms to the Healthcare Market:A Case Study

    SciTech Connect

    Sukumar, Sreenivas R; Aline, Frank

    2013-01-01

    We draw inspiration from the recent success of loyalty programs and targeted personalized market campaigns of retail companies such as Kroger, Netflix, etc. to understand beneficiary behaviors in the healthcare system. Our posit is that we can emulate the financial success the companies have achieved by better understanding and predicting customer behaviors and translating such success to healthcare operations. Towards that goal, we survey current practices in market micro-segmentation research and analyze health insurance claims data using those algorithms. We present results and insights from micro-segmentation of the beneficiaries using different techniques and discuss how the interpretation can assist with matching the cost-effective insurance payment models to the beneficiary micro-segments.

  20. US-Cut: interactive algorithm for rapid detection and segmentation of liver tumors in ultrasound acquisitions

    NASA Astrophysics Data System (ADS)

    Egger, Jan; Voglreiter, Philip; Dokter, Mark; Hofmann, Michael; Chen, Xiaojun; Zoller, Wolfram G.; Schmalstieg, Dieter; Hann, Alexander

    2016-04-01

    Ultrasound (US) is the most commonly used liver imaging modality worldwide. It plays an important role in follow-up of cancer patients with liver metastases. We present an interactive segmentation approach for liver tumors in US acquisitions. Due to the low image quality and the low contrast between the tumors and the surrounding tissue in US images, the segmentation is very challenging. Thus, the clinical practice still relies on manual measurement and outlining of the tumors in the US images. We target this problem by applying an interactive segmentation algorithm to the US data, allowing the user to get real-time feedback of the segmentation results. The algorithm has been developed and tested hand-in-hand by physicians and computer scientists to make sure a future practical usage in a clinical setting is feasible. To cover typical acquisitions from the clinical routine, the approach has been evaluated with dozens of datasets where the tumors are hyperechoic (brighter), hypoechoic (darker) or isoechoic (similar) in comparison to the surrounding liver tissue. Due to the interactive real-time behavior of the approach, it was possible even in difficult cases to find satisfying segmentations of the tumors within seconds and without parameter settings, and the average tumor deviation was only 1.4mm compared with manual measurements. However, the long term goal is to ease the volumetric acquisition of liver tumors in order to evaluate for treatment response. Additional aim is the registration of intraoperative US images via the interactive segmentations to the patient's pre-interventional CT acquisitions.

  1. Alignment, segmentation and 3-D reconstruction of serial sections based on automated algorithm

    NASA Astrophysics Data System (ADS)

    Bian, Weiguo; Tang, Shaojie; Xu, Qiong; Lian, Qin; Wang, Jin; Li, Dichen

    2012-12-01

    A well-defined three-dimensional (3-D) reconstruction of bone-cartilage transitional structures is crucial for the osteochondral restoration. This paper presents an accurate, computationally efficient and fully-automated algorithm for the alignment and segmentation of two-dimensional (2-D) serial to construct the 3-D model of bone-cartilage transitional structures. Entire system includes the following five components: (1) image harvest, (2) image registration, (3) image segmentation, (4) 3-D reconstruction and visualization, and (5) evaluation. A computer program was developed in the environment of Matlab for the automatic alignment and segmentation of serial sections. Automatic alignment algorithm based on the position's cross-correlation of the anatomical characteristic feature points of two sequential sections. A method combining an automatic segmentation and an image threshold processing was applied to capture the regions and structures of interest. SEM micrograph and 3-D model reconstructed directly in digital microscope were used to evaluate the reliability and accuracy of this strategy. The morphology of 3-D model constructed by serial sections is consistent with the results of SEM micrograph and 3-D model of digital microscope.

  2. Segmentation algorithm of colon based on multi-slice CT colonography

    NASA Astrophysics Data System (ADS)

    Hu, Yizhong; Ahamed, Mohammed Shabbir; Takahashi, Eiji; Suzuki, Hidenobu; Kawata, Yoshiki; Niki, Noboru; Suzuki, Masahiro; Iinuma, Gen; Moriyama, Noriyuki

    2012-02-01

    CT colonography is a radiology test that looks at people's large intestines(colon). CT colonography can screen many options of colon cancer. This test is used to detect polyps or cancers of the colon. CT colonography is safe and reliable. It can be used if people are too sick to undergo other forms of colon cancer screening. In our research, we proposed a method for automatic segmentation of the colon from abdominal computed Tomography (CT) images. Our multistage detection method extracted colon and spited colon into different parts according to the colon anatomy information. We found that among the five segmented parts of the colon, sigmoid (20%) and rectum (50%) are more sensitive toward polyps and masses than the other three parts. Our research focused on detecting the colon by the individual diagnosis of sigmoid and rectum. We think it would make the rapid and easy diagnosis of colon in its earlier stage and help doctors for analysis of correct position of each part and detect the colon rectal cancer much easier.

  3. A de-noising algorithm to improve SNR of segmented gamma scanner for spectrum analysis

    NASA Astrophysics Data System (ADS)

    Li, Huailiang; Tuo, Xianguo; Shi, Rui; Zhang, Jinzhao; Henderson, Mark Julian; Courtois, Jérémie; Yan, Minhao

    2016-05-01

    An improved threshold shift-invariant wavelet transform de-noising algorithm for high-resolution gamma-ray spectroscopy is proposed to optimize the threshold function of wavelet transforms and reduce signal resulting from pseudo-Gibbs artificial fluctuations. This algorithm was applied to a segmented gamma scanning system with large samples in which high continuum levels caused by Compton scattering are routinely encountered. De-noising data from the gamma ray spectrum measured by segmented gamma scanning system with improved, shift-invariant and traditional wavelet transform algorithms were all evaluated. The improved wavelet transform method generated significantly enhanced performance of the figure of merit, the root mean square error, the peak area, and the sample attenuation correction in the segmented gamma scanning system assays. We also found that the gamma energy spectrum can be viewed as a low frequency signal as well as high frequency noise superposition by the spectrum analysis. Moreover, a smoothed spectrum can be appropriate for straightforward automated quantitative analysis.

  4. Application of centerline detection and deformable contours algorithms to segmenting the carotid lumen

    NASA Astrophysics Data System (ADS)

    Hachaj, Tomasz; Ogiela, Marek R.

    2014-03-01

    The main contribution of this article is to evaluate the utility of different state-of-the-art deformable contour models for segmenting carotid lumen walls from computed tomography angiography images. We have also proposed and tested a new tracking-based lumen segmentation method based on our evaluation results. The deformable contour algorithm (snake) is used to detect the outer wall of the vessel. We have examined four different snakes: with a balloon, distance, and a gradient vector flow force and the method of active contours without edges. The algorithms were evaluated on a set of 32 artery lumens-16 from the common carotid artery (CCA)-the internal carotid artery section and 16 from the CCA-the external carotid artery section-in order to find the optimum deformable contour model for this task. Later, we evaluated different values of energy terms in the method of active contours without edges, which turned out to be the best for our dataset, in order to find the optimal values for this particular segmentation task. The choice of particular weights in the energy term was evaluated statistically. The final Dice's coefficient at the level of 0.939±0.049 puts our algorithm among the best state-of-the-art methods for these solutions.

  5. An Image Segmentation Based on a Genetic Algorithm for Determining Soil Coverage by Crop Residues

    PubMed Central

    Ribeiro, Angela; Ranz, Juan; Burgos-Artizzu, Xavier P.; Pajares, Gonzalo; Sanchez del Arco, Maria J.; Navarrete, Luis

    2011-01-01

    Determination of the soil coverage by crop residues after ploughing is a fundamental element of Conservation Agriculture. This paper presents the application of genetic algorithms employed during the fine tuning of the segmentation process of a digital image with the aim of automatically quantifying the residue coverage. In other words, the objective is to achieve a segmentation that would permit the discrimination of the texture of the residue so that the output of the segmentation process is a binary image in which residue zones are isolated from the rest. The RGB images used come from a sample of images in which sections of terrain were photographed with a conventional camera positioned in zenith orientation atop a tripod. The images were taken outdoors under uncontrolled lighting conditions. Up to 92% similarity was achieved between the images obtained by the segmentation process proposed in this paper and the templates made by an elaborate manual tracing process. In addition to the proposed segmentation procedure and the fine tuning procedure that was developed, a global quantification of the soil coverage by residues for the sampled area was achieved that differed by only 0.85% from the quantification obtained using template images. Moreover, the proposed method does not depend on the type of residue present in the image. The study was conducted at the experimental farm “El Encín” in Alcalá de Henares (Madrid, Spain). PMID:22163966

  6. A new segmentation algorithm for lunar surface terrain based on CCD images

    NASA Astrophysics Data System (ADS)

    Jiang, Hong-Kun; Tian, Xiao-Lin; Xu, Ao-Ao

    2015-09-01

    Terrain classification is one of the critical steps used in lunar geomorphologic analysis and landing site selection. Most of the published works have focused on a Digital Elevation Model (DEM) to distinguish different regions of lunar terrain. This paper presents an algorithm that can be applied to lunar CCD images by blocking and clustering according to image features, which can accurately distinguish between lunar highland and lunar mare. The new algorithm, compared with the traditional algorithm, can improve classification accuracy. The new algorithm incorporates two new features and one Tamura texture feature. The new features are generating an enhanced image histogram and modeling the properties of light reflection, which can represent the geological characteristics based on CCD gray level images. These features are applied to identify texture in order to perform image clustering and segmentation by a weighted Euclidean distance to distinguish between lunar mare and lunar highlands. The new algorithm has been tested on Chang'e-1 CCD data and the testing result has been compared with geological data published by the U.S. Geological Survey. The result has shown that the algorithm can effectively distinguish the lunar mare from highlands in CCD images. The overall accuracy of the proposed algorithm is satisfactory, and the Kappa coefficient is 0.802, which is higher than the result of combining the DEM with CCD images.

  7. Automatic segmentation of the liver using multi-planar anatomy and deformable surface model in abdominal contrast-enhanced CT images

    NASA Astrophysics Data System (ADS)

    Jang, Yujin; Hong, Helen; Chung, Jin Wook; Yoon, Young Ho

    2012-02-01

    We propose an effective technique for the extraction of liver boundary based on multi-planar anatomy and deformable surface model in abdominal contrast-enhanced CT images. Our method is composed of four main steps. First, for extracting an optimal volume circumscribing a liver, lower and side boundaries are defined by positional information of pelvis and rib. An upper boundary is defined by separating the lungs and heart from CT images. Second, for extracting an initial liver volume, optimal liver volume is smoothed by anisotropic diffusion filtering and is segmented using adaptively selected threshold value. Third, for removing neighbor organs from initial liver volume, morphological opening and connected component labeling are applied to multiple planes. Finally, for refining the liver boundaries, deformable surface model is applied to a posterior liver surface and missing left robe in previous step. Then, probability summation map is generated by calculating regional information of the segmented liver in coronal plane, which is used for restoring the inaccurate liver boundaries. Experimental results show that our segmentation method can accurately extract liver boundaries without leakage to neighbor organs in spite of various liver shape and ambiguous boundary.

  8. Image based hair segmentation algorithm for the application of automatic facial caricature synthesis.

    PubMed

    Shen, Yehu; Peng, Zhenyun; Zhang, Yaohui

    2014-01-01

    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.

  9. Fully Automated Complementary DNA Microarray Segmentation using a Novel Fuzzy-based Algorithm.

    PubMed

    Saberkari, Hamidreza; Bahrami, Sheyda; Shamsi, Mousa; Amoshahy, Mohammad Javad; Ghavifekr, Habib Badri; Sedaaghi, Mohammad Hossein

    2015-01-01

    DNA microarray is a powerful approach to study simultaneously, the expression of 1000 of genes in a single experiment. The average value of the fluorescent intensity could be calculated in a microarray experiment. The calculated intensity values are very close in amount to the levels of expression of a particular gene. However, determining the appropriate position of every spot in microarray images is a main challenge, which leads to the accurate classification of normal and abnormal (cancer) cells. In this paper, first a preprocessing approach is performed to eliminate the noise and artifacts available in microarray cells using the nonlinear anisotropic diffusion filtering method. Then, the coordinate center of each spot is positioned utilizing the mathematical morphology operations. Finally, the position of each spot is exactly determined through applying a novel hybrid model based on the principle component analysis and the spatial fuzzy c-means clustering (SFCM) algorithm. Using a Gaussian kernel in SFCM algorithm will lead to improving the quality in complementary DNA microarray segmentation. The performance of the proposed algorithm has been evaluated on the real microarray images, which is available in Stanford Microarray Databases. Results illustrate that the accuracy of microarray cells segmentation in the proposed algorithm reaches to 100% and 98% for noiseless/noisy cells, respectively.

  10. Range image segmentation into planar and quadric surfaces using an improved robust estimator and genetic algorithm.

    PubMed

    Gotardo, Paulo Fabiano Urnau; Bellon, Olga Regina Pereira; Boyer, Kim L; Silva, Luciano

    2004-12-01

    This paper presents a novel range image segmentation method employing an improved robust estimator to iteratively detect and extract distinct planar and quadric surfaces. Our robust estimator extends M-estimator Sample Consensus/Random Sample Consensus (MSAC/RANSAC) to use local surface orientation information, enhancing the accuracy of inlier/outlier classification when processing noisy range data describing multiple structures. An efficient approximation to the true geometric distance between a point and a quadric surface also contributes to effectively reject weak surface hypotheses and avoid the extraction of false surface components. Additionally, a genetic algorithm was specifically designed to accelerate the optimization process of surface extraction, while avoiding premature convergence. We present thorough experimental results with quantitative evaluation against ground truth. The segmentation algorithm was applied to three real range image databases and competes favorably against eleven other segmenters using the most popular evaluation framework in the literature. Our approach lends itself naturally to parallel implementation and application in real-time tasks. The method fits well, into several of today's applications in man-made environments, such as target detection and autonomous navigation, for which obstacle detection, but not description or reconstruction, is required. It can also be extended to process point clouds resulting from range image registration.

  11. A contiguity-enhanced k-means clustering algorithm for unsupervised multispectral image segmentation

    SciTech Connect

    Theiler, J.; Gisler, G.

    1997-07-01

    The recent and continuing construction of multi and hyper spectral imagers will provide detailed data cubes with information in both the spatial and spectral domain. This data shows great promise for remote sensing applications ranging from environmental and agricultural to national security interests. The reduction of this voluminous data to useful intermediate forms is necessary both for downlinking all those bits and for interpreting them. Smart onboard hardware is required, as well as sophisticated earth bound processing. A segmented image (in which the multispectral data in each pixel is classified into one of a small number of categories) is one kind of intermediate form which provides some measure of data compression. Traditional image segmentation algorithms treat pixels independently and cluster the pixels according only to their spectral information. This neglects the implicit spatial information that is available in the image. We will suggest a simple approach; a variant of the standard k-means algorithm which uses both spatial and spectral properties of the image. The segmented image has the property that pixels which are spatially contiguous are more likely to be in the same class than are random pairs of pixels. This property naturally comes at some cost in terms of the compactness of the clusters in the spectral domain, but we have found that the spatial contiguity and spectral compactness properties are nearly orthogonal, which means that we can make considerable improvements in the one with minimal loss in the other.

  12. Square-Cut: A Segmentation Algorithm on the Basis of a Rectangle Shape

    PubMed Central

    Egger, Jan; Kapur, Tina; Dukatz, Thomas; Kolodziej, Malgorzata; Zukić, Dženan; Freisleben, Bernd; Nimsky, Christopher

    2012-01-01

    We present a rectangle-based segmentation algorithm that sets up a graph and performs a graph cut to separate an object from the background. However, graph-based algorithms distribute the graph's nodes uniformly and equidistantly on the image. Then, a smoothness term is added to force the cut to prefer a particular shape. This strategy does not allow the cut to prefer a certain structure, especially when areas of the object are indistinguishable from the background. We solve this problem by referring to a rectangle shape of the object when sampling the graph nodes, i.e., the nodes are distributed non-uniformly and non-equidistantly on the image. This strategy can be useful, when areas of the object are indistinguishable from the background. For evaluation, we focus on vertebrae images from Magnetic Resonance Imaging (MRI) datasets to support the time consuming manual slice-by-slice segmentation performed by physicians. The ground truth of the vertebrae boundaries were manually extracted by two clinical experts (neurological surgeons) with several years of experience in spine surgery and afterwards compared with the automatic segmentation results of the proposed scheme yielding an average Dice Similarity Coefficient (DSC) of 90.97±2.2%. PMID:22363547

  13. Thoracic cavity segmentation algorithm using multiorgan extraction and surface fitting in volumetric CT

    SciTech Connect

    Bae, JangPyo; Kim, Namkug Lee, Sang Min; Seo, Joon Beom; Kim, Hee Chan

    2014-04-15

    Purpose: To develop and validate a semiautomatic segmentation method for thoracic cavity volumetry and mediastinum fat quantification of patients with chronic obstructive pulmonary disease. Methods: The thoracic cavity region was separated by segmenting multiorgans, namely, the rib, lung, heart, and diaphragm. To encompass various lung disease-induced variations, the inner thoracic wall and diaphragm were modeled by using a three-dimensional surface-fitting method. To improve the accuracy of the diaphragm surface model, the heart and its surrounding tissue were segmented by a two-stage level set method using a shape prior. To assess the accuracy of the proposed algorithm, the algorithm results of 50 patients were compared to the manual segmentation results of two experts with more than 5 years of experience (these manual results were confirmed by an expert thoracic radiologist). The proposed method was also compared to three state-of-the-art segmentation methods. The metrics used to evaluate segmentation accuracy were volumetric overlap ratio (VOR), false positive ratio on VOR (FPRV), false negative ratio on VOR (FNRV), average symmetric absolute surface distance (ASASD), average symmetric squared surface distance (ASSSD), and maximum symmetric surface distance (MSSD). Results: In terms of thoracic cavity volumetry, the mean ± SD VOR, FPRV, and FNRV of the proposed method were (98.17 ± 0.84)%, (0.49 ± 0.23)%, and (1.34 ± 0.83)%, respectively. The ASASD, ASSSD, and MSSD for the thoracic wall were 0.28 ± 0.12, 1.28 ± 0.53, and 23.91 ± 7.64 mm, respectively. The ASASD, ASSSD, and MSSD for the diaphragm surface were 1.73 ± 0.91, 3.92 ± 1.68, and 27.80 ± 10.63 mm, respectively. The proposed method performed significantly better than the other three methods in terms of VOR, ASASD, and ASSSD. Conclusions: The proposed semiautomatic thoracic cavity segmentation method, which extracts multiple organs (namely, the rib, thoracic wall, diaphragm, and heart

  14. Reconstruction-by-Dilation and Top-Hat Algorithms for Contrast Enhancement and Segmentation of Microcalcifications in Digital Mammograms

    NASA Astrophysics Data System (ADS)

    Diaz, Claudia C.

    2007-11-01

    I present some results of contrast enhancement and segmentation of microcalcifications in digital mammograms. These mammograms were obtained from MIAS-minidatabase and using a CR to digitize images. White-top-hat and black-top-hat transformations were used to improve the contrast of images, while reconstruction-by-dilation algorithm was used to emphasize the microcalcifications over the tissues. Segmentation was done using different gradient matrices. These algorithms intended to show some details which were not evident in original images.

  15. Numerical arc segmentation algorithm for a radio conference: A software tool for communication satellite systems planning

    NASA Technical Reports Server (NTRS)

    Whyte, W. A.; Heyward, A. O.; Ponchak, D. S.; Spence, R. L.; Zuzek, J. E.

    1988-01-01

    The Numerical Arc Segmentation Algorithm for a Radio Conference (NASARC) provides a method of generating predetermined arc segments for use in the development of an allotment planning procedure to be carried out at the 1988 World Administrative Radio Conference (WARC) on the Use of the Geostationary Satellite Orbit and the Planning of Space Services Utilizing It. Through careful selection of the predetermined arc (PDA) for each administration, flexibility can be increased in terms of choice of system technical characteristics and specific orbit location while reducing the need for coordination among administrations. The NASARC software determines pairwise compatibility between all possible service areas at discrete arc locations. NASARC then exhaustively enumerates groups of administrations whose satellites can be closely located in orbit, and finds the arc segment over which each such compatible group exists. From the set of all possible compatible groupings, groups and their associated arc segments are selected using a heuristic procedure such that a PDA is identified for each administration. Various aspects of the NASARC concept and how the software accomplishes specific features of allotment planning are discussed.

  16. A color and shape based algorithm for segmentation of white blood cells in peripheral blood and bone marrow images.

    PubMed

    Arslan, Salim; Ozyurek, Emel; Gunduz-Demir, Cigdem

    2014-06-01

    Computer-based imaging systems are becoming important tools for quantitative assessment of peripheral blood and bone marrow samples to help experts diagnose blood disorders such as acute leukemia. These systems generally initiate a segmentation stage where white blood cells are separated from the background and other nonsalient objects. As the success of such imaging systems mainly depends on the accuracy of this stage, studies attach great importance for developing accurate segmentation algorithms. Although previous studies give promising results for segmentation of sparsely distributed normal white blood cells, only a few of them focus on segmenting touching and overlapping cell clusters, which is usually the case when leukemic cells are present. In this article, we present a new algorithm for segmentation of both normal and leukemic cells in peripheral blood and bone marrow images. In this algorithm, we propose to model color and shape characteristics of white blood cells by defining two transformations and introduce an efficient use of these transformations in a marker-controlled watershed algorithm. Particularly, these domain specific characteristics are used to identify markers and define the marking function of the watershed algorithm as well as to eliminate false white blood cells in a postprocessing step. Working on 650 white blood cells in peripheral blood and bone marrow images, our experiments reveal that the proposed algorithm improves the segmentation performance compared with its counterparts, leading to high accuracies for both sparsely distributed normal white blood cells and dense leukemic cell clusters.

  17. Digital Terrain from a Two-Step Segmentation and Outlier-Based Algorithm

    NASA Astrophysics Data System (ADS)

    Hingee, Kassel; Caccetta, Peter; Caccetta, Louis; Wu, Xiaoliang; Devereaux, Drew

    2016-06-01

    We present a novel ground filter for remotely sensed height data. Our filter has two phases: the first phase segments the DSM with a slope threshold and uses gradient direction to identify candidate ground segments; the second phase fits surfaces to the candidate ground points and removes outliers. Digital terrain is obtained by a surface fit to the final set of ground points. We tested the new algorithm on digital surface models (DSMs) for a 9600km2 region around Perth, Australia. This region contains a large mix of land uses (urban, grassland, native forest and plantation forest) and includes both a sandy coastal plain and a hillier region (elevations up to 0.5km). The DSMs are captured annually at 0.2m resolution using aerial stereo photography, resulting in 1.2TB of input data per annum. Overall accuracy of the filter was estimated to be 89.6% and on a small semi-rural subset our algorithm was found to have 40% fewer errors compared to Inpho's Match-T algorithm.

  18. A segmentation algorithm for automated tracking of fast swimming unlabelled cells in three dimensions.

    PubMed

    Pimentel, J A; Carneiro, J; Darszon, A; Corkidi, G

    2012-01-01

    Recent advances in microscopy and cytolabelling methods enable the real time imaging of cells as they move and interact in their real physiological environment. Scenarios in which multiple cells move autonomously in all directions are not uncommon in biology. A remarkable example is the swimming of marine spermatozoa in search of the conspecific oocyte. Imaging cells in these scenarios, particularly when they move fast and are poorly labelled or even unlabelled requires very fast three-dimensional time-lapse (3D+t) imaging. This 3D+t imaging poses challenges not only to the acquisition systems but also to the image analysis algorithms. It is in this context that this work describes an original automated multiparticle segmentation method to analyse motile translucent cells in 3D microscopical volumes. The proposed segmentation technique takes advantage of the way the cell appearance changes with the distance to the focal plane position. The cells translucent properties and their interaction with light produce a specific pattern: when the cell is within or close to the focal plane, its two-dimensional (2D) appearance matches a bright spot surrounded by a dark ring, whereas when it is farther from the focal plane the cell contrast is inverted looking like a dark spot surrounded by a bright ring. The proposed method analyses the acquired video sequence frame-by-frame taking advantage of 2D image segmentation algorithms to identify and select candidate cellular sections. The crux of the method is in the sequential filtering of the candidate sections, first by template matching of the in-focus and out-of-focus templates and second by considering adjacent candidates sections in 3D. These sequential filters effectively narrow down the number of segmented candidate sections making the automatic tracking of cells in three dimensions a straightforward operation. PMID:21999166

  19. A segmentation algorithm for automated tracking of fast swimming unlabelled cells in three dimensions.

    PubMed

    Pimentel, J A; Carneiro, J; Darszon, A; Corkidi, G

    2012-01-01

    Recent advances in microscopy and cytolabelling methods enable the real time imaging of cells as they move and interact in their real physiological environment. Scenarios in which multiple cells move autonomously in all directions are not uncommon in biology. A remarkable example is the swimming of marine spermatozoa in search of the conspecific oocyte. Imaging cells in these scenarios, particularly when they move fast and are poorly labelled or even unlabelled requires very fast three-dimensional time-lapse (3D+t) imaging. This 3D+t imaging poses challenges not only to the acquisition systems but also to the image analysis algorithms. It is in this context that this work describes an original automated multiparticle segmentation method to analyse motile translucent cells in 3D microscopical volumes. The proposed segmentation technique takes advantage of the way the cell appearance changes with the distance to the focal plane position. The cells translucent properties and their interaction with light produce a specific pattern: when the cell is within or close to the focal plane, its two-dimensional (2D) appearance matches a bright spot surrounded by a dark ring, whereas when it is farther from the focal plane the cell contrast is inverted looking like a dark spot surrounded by a bright ring. The proposed method analyses the acquired video sequence frame-by-frame taking advantage of 2D image segmentation algorithms to identify and select candidate cellular sections. The crux of the method is in the sequential filtering of the candidate sections, first by template matching of the in-focus and out-of-focus templates and second by considering adjacent candidates sections in 3D. These sequential filters effectively narrow down the number of segmented candidate sections making the automatic tracking of cells in three dimensions a straightforward operation.

  20. iCut: an Integrative Cut Algorithm Enables Accurate Segmentation of Touching Cells

    PubMed Central

    He, Yong; Gong, Hui; Xiong, Benyi; Xu, Xiaofeng; Li, Anan; Jiang, Tao; Sun, Qingtao; Wang, Simin; Luo, Qingming; Chen, Shangbin

    2015-01-01

    Individual cells play essential roles in the biological processes of the brain. The number of neurons changes during both normal development and disease progression. High-resolution imaging has made it possible to directly count cells. However, the automatic and precise segmentation of touching cells continues to be a major challenge for massive and highly complex datasets. Thus, an integrative cut (iCut) algorithm, which combines information regarding spatial location and intervening and concave contours with the established normalized cut, has been developed. iCut involves two key steps: (1) a weighting matrix is first constructed with the abovementioned information regarding the touching cells and (2) a normalized cut algorithm that uses the weighting matrix is implemented to separate the touching cells into isolated cells. This novel algorithm was evaluated using two types of data: the open SIMCEP benchmark dataset and our micro-optical imaging dataset from a Nissl-stained mouse brain. It has achieved a promising recall/precision of 91.2 ± 2.1%/94.1 ± 1.8% and 86.8 ± 4.1%/87.5 ± 5.7%, respectively, for the two datasets. As quantified using the harmonic mean of recall and precision, the accuracy of iCut is higher than that of some state-of-the-art algorithms. The better performance of this fully automated algorithm can benefit studies of brain cytoarchitecture. PMID:26168908

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

    NASA Astrophysics Data System (ADS)

    Irondi, Iheanyi; Wang, Qi; Grecos, Christos

    2016-04-01

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

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

    NASA Astrophysics Data System (ADS)

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

    2016-05-01

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

  3. Segmentation algorithm via Cellular Neural/Nonlinear Network: implementation on Bio-inspired hardware platform

    NASA Astrophysics Data System (ADS)

    Karabiber, Fethullah; Vecchio, Pietro; Grassi, Giuseppe

    2011-12-01

    The Bio-inspired (Bi-i) Cellular Vision System is a computing platform consisting of sensing, array sensing-processing, and digital signal processing. The platform is based on the Cellular Neural/Nonlinear Network (CNN) paradigm. This article presents the implementation of a novel CNN-based segmentation algorithm onto the Bi-i system. Each part of the algorithm, along with the corresponding implementation on the hardware platform, is carefully described through the article. The experimental results, carried out for Foreman and Car-phone video sequences, highlight the feasibility of the approach, which provides a frame rate of about 26 frames/s. Comparisons with existing CNN-based methods show that the conceived approach is more accurate, thus representing a good trade-off between real-time requirements and accuracy.

  4. Quantitative comparison of segmentation algorithms for FIB-SEM images of porous media.

    PubMed

    Salzer, M; Prill, T; Spettl, A; Jeulin, D; Schladitz, K; Schmidt, V

    2015-01-01

    Focused ion beam tomography has proven to be capable of imaging porous structures on a nano-scale. However, due to shine-through artefacts, common segmentation algorithms often lead to severe dislocation of individual structures in z-direction. Recently, a number of approaches have been developed, which take into account the specific nature of focused ion beam-scanning electron microscope images for porous media. In the present study, we analyse three of these approaches by comparing their performance based on simulated focused ion beam-scanning electron microscope images. Performance is measured by determining the amount of misclassified voxels as well as the fidelity of structural characteristics. Based on this analysis we conclude that each algorithm has certain strengths and weaknesses and we determine the scenarios for which each approach might be the best choice.

  5. Comparing algorithms for automated vessel segmentation in computed tomography scans of the lung: the VESSEL12 study.

    PubMed

    Rudyanto, Rina D; Kerkstra, Sjoerd; van Rikxoort, Eva M; Fetita, Catalin; Brillet, Pierre-Yves; Lefevre, Christophe; Xue, Wenzhe; Zhu, Xiangjun; Liang, Jianming; Öksüz, Ilkay; Ünay, Devrim; Kadipaşaoğlu, Kamuran; Estépar, Raúl San José; Ross, James C; Washko, George R; Prieto, Juan-Carlos; Hoyos, Marcela Hernández; Orkisz, Maciej; Meine, Hans; Hüllebrand, Markus; Stöcker, Christina; Mir, Fernando Lopez; Naranjo, Valery; Villanueva, Eliseo; Staring, Marius; Xiao, Changyan; Stoel, Berend C; Fabijanska, Anna; Smistad, Erik; Elster, Anne C; Lindseth, Frank; Foruzan, Amir Hossein; Kiros, Ryan; Popuri, Karteek; Cobzas, Dana; Jimenez-Carretero, Daniel; Santos, Andres; Ledesma-Carbayo, Maria J; Helmberger, Michael; Urschler, Martin; Pienn, Michael; Bosboom, Dennis G H; Campo, Arantza; Prokop, Mathias; de Jong, Pim A; Ortiz-de-Solorzano, Carlos; Muñoz-Barrutia, Arrate; van Ginneken, Bram

    2014-10-01

    The VESSEL12 (VESsel SEgmentation in the Lung) challenge objectively compares the performance of different algorithms to identify vessels in thoracic computed tomography (CT) scans. Vessel segmentation is fundamental in computer aided processing of data generated by 3D imaging modalities. As manual vessel segmentation is prohibitively time consuming, any real world application requires some form of automation. Several approaches exist for automated vessel segmentation, but judging their relative merits is difficult due to a lack of standardized evaluation. We present an annotated reference dataset containing 20 CT scans and propose nine categories to perform a comprehensive evaluation of vessel segmentation algorithms from both academia and industry. Twenty algorithms participated in the VESSEL12 challenge, held at International Symposium on Biomedical Imaging (ISBI) 2012. All results have been published at the VESSEL12 website http://vessel12.grand-challenge.org. The challenge remains ongoing and open to new participants. Our three contributions are: (1) an annotated reference dataset available online for evaluation of new algorithms; (2) a quantitative scoring system for objective comparison of algorithms; and (3) performance analysis of the strengths and weaknesses of the various vessel segmentation methods in the presence of various lung diseases.

  6. A quantum mechanics-based algorithm for vessel segmentation in retinal images

    NASA Astrophysics Data System (ADS)

    Youssry, Akram; El-Rafei, Ahmed; Elramly, Salwa

    2016-06-01

    Blood vessel segmentation is an important step in retinal image analysis. It is one of the steps required for computer-aided detection of ophthalmic diseases. In this paper, a novel quantum mechanics-based algorithm for retinal vessel segmentation is presented. The algorithm consists of three major steps. The first step is the preprocessing of the images to prepare the images for further processing. The second step is feature extraction where a set of four features is generated at each image pixel. These features are then combined using a nonlinear transformation for dimensionality reduction. The final step is applying a recently proposed quantum mechanics-based framework for image processing. In this step, pixels are mapped to quantum systems that are allowed to evolve from an initial state to a final state governed by Schrödinger's equation. The evolution is controlled by the Hamiltonian operator which is a function of the extracted features at each pixel. A measurement step is consequently performed to determine whether the pixel belongs to vessel or non-vessel classes. Many functional forms of the Hamiltonian are proposed, and the best performing form was selected. The algorithm is tested on the publicly available DRIVE database. The average results for sensitivity, specificity, and accuracy are 80.29, 97.34, and 95.83 %, respectively. These results are compared to some recently published techniques showing the superior performance of the proposed method. Finally, the implementation of the algorithm on a quantum computer and the challenges facing this implementation are introduced.

  7. An Algorithm for Obtaining the Distribution of 1-Meter Lightning Channel Segment Altitudes for Application in Lightning NOx Production Estimation

    NASA Technical Reports Server (NTRS)

    Peterson, Harold; Koshak, William J.

    2009-01-01

    An algorithm has been developed to estimate the altitude distribution of one-meter lightning channel segments. The algorithm is required as part of a broader objective that involves improving the lightning NOx emission inventories of both regional air quality and global chemistry/climate models. The algorithm was tested and applied to VHF signals detected by the North Alabama Lightning Mapping Array (NALMA). The accuracy of the algorithm was characterized by comparing algorithm output to the plots of individual discharges whose lengths were computed by hand; VHF source amplitude thresholding and smoothing were applied to optimize results. Several thousands of lightning flashes within 120 km of the NALMA network centroid were gathered from all four seasons, and were analyzed by the algorithm. The mean, standard deviation, and median statistics were obtained for all the flashes, the ground flashes, and the cloud flashes. One-meter channel segment altitude distributions were also obtained for the different seasons.

  8. SAR Image Segmentation with Unknown Number of Classes Combined Voronoi Tessellation and Rjmcmc Algorithm

    NASA Astrophysics Data System (ADS)

    Zhao, Q. H.; Li, Y.; Wang, Y.

    2016-06-01

    This paper presents a novel segmentation method for automatically determining the number of classes in Synthetic Aperture Radar (SAR) images by combining Voronoi tessellation and Reversible Jump Markov Chain Monte Carlo (RJMCMC) strategy. Instead of giving the number of classes a priori, it is considered as a random variable and subject to a Poisson distribution. Based on Voronoi tessellation, the image is divided into homogeneous polygons. By Bayesian paradigm, a posterior distribution which characterizes the segmentation and model parameters conditional on a given SAR image can be obtained up to a normalizing constant; Then, a Revisable Jump Markov Chain Monte Carlo(RJMCMC) algorithm involving six move types is designed to simulate the posterior distribution, the move types including: splitting or merging real classes, updating parameter vector, updating label field, moving positions of generating points, birth or death of generating points and birth or death of an empty class. Experimental results with real and simulated SAR images demonstrate that the proposed method can determine the number of classes automatically and segment homogeneous regions well.

  9. Local pixel value collection algorithm for spot segmentation in two-dimensional gel electrophoresis research.

    PubMed

    Peer, Peter; Corzo, Luis Galo

    2007-01-01

    Two-dimensional gel-electrophoresis (2-DE) images show the expression levels of several hundreds of proteins where each protein is represented as a blob-shaped spot of grey level values. The spot detection, that is, the segmentation process has to be efficient as it is the first step in the gel processing. Such extraction of information is a very complex task. In this paper, we propose a novel spot detector that is basically a morphology-based method with the use of a seeded region growing as a central paradigm and which relies on the spot correlation information. The method is tested on our synthetic as well as on real gels with human samples from SWISS-2DPAGE (two-dimensional polyacrylamide gel electrophoresis) database. A comparison of results is done with a method called pixel value collection (PVC). Since our algorithm efficiently uses local spot information, segments the spot by collecting pixel values and its affinity with PVC, we named it local pixel value collection (LPVC). The results show that LPVC achieves similar segmentation results as PVC, but is much faster than PVC.

  10. Local Pixel Value Collection Algorithm for Spot Segmentation in Two-Dimensional Gel Electrophoresis Research

    PubMed Central

    Peer, Peter; Corzo, Luis Galo

    2007-01-01

    Two-dimensional gel-electrophoresis (2-DE) images show the expression levels of several hundreds of proteins where each protein is represented as a blob-shaped spot of grey level values. The spot detection, that is, the segmentation process has to be efficient as it is the first step in the gel processing. Such extraction of information is a very complex task. In this paper, we propose a novel spot detector that is basically a morphology-based method with the use of a seeded region growing as a central paradigm and which relies on the spot correlation information. The method is tested on our synthetic as well as on real gels with human samples from SWISS-2DPAGE (two-dimensional polyacrylamide gel electrophoresis) database. A comparison of results is done with a method called pixel value collection (PVC). Since our algorithm efficiently uses local spot information, segments the spot by collecting pixel values and its affinity with PVC, we named it local pixel value collection (LPVC). The results show that LPVC achieves similar segmentation results as PVC, but is much faster than PVC. PMID:18274608

  11. Local pixel value collection algorithm for spot segmentation in two-dimensional gel electrophoresis research.

    PubMed

    Peer, Peter; Corzo, Luis Galo

    2007-01-01

    Two-dimensional gel-electrophoresis (2-DE) images show the expression levels of several hundreds of proteins where each protein is represented as a blob-shaped spot of grey level values. The spot detection, that is, the segmentation process has to be efficient as it is the first step in the gel processing. Such extraction of information is a very complex task. In this paper, we propose a novel spot detector that is basically a morphology-based method with the use of a seeded region growing as a central paradigm and which relies on the spot correlation information. The method is tested on our synthetic as well as on real gels with human samples from SWISS-2DPAGE (two-dimensional polyacrylamide gel electrophoresis) database. A comparison of results is done with a method called pixel value collection (PVC). Since our algorithm efficiently uses local spot information, segments the spot by collecting pixel values and its affinity with PVC, we named it local pixel value collection (LPVC). The results show that LPVC achieves similar segmentation results as PVC, but is much faster than PVC. PMID:18274608

  12. Graph-based unsupervised segmentation algorithm for cultured neuronal networks' structure characterization and modeling.

    PubMed

    de Santos-Sierra, Daniel; Sendiña-Nadal, Irene; Leyva, Inmaculada; Almendral, Juan A; Ayali, Amir; Anava, Sarit; Sánchez-Ávila, Carmen; Boccaletti, Stefano

    2015-06-01

    Large scale phase-contrast images taken at high resolution through the life of a cultured neuronal network are analyzed by a graph-based unsupervised segmentation algorithm with a very low computational cost, scaling linearly with the image size. The processing automatically retrieves the whole network structure, an object whose mathematical representation is a matrix in which nodes are identified neurons or neurons' clusters, and links are the reconstructed connections between them. The algorithm is also able to extract any other relevant morphological information characterizing neurons and neurites. More importantly, and at variance with other segmentation methods that require fluorescence imaging from immunocytochemistry techniques, our non invasive measures entitle us to perform a longitudinal analysis during the maturation of a single culture. Such an analysis furnishes the way of individuating the main physical processes underlying the self-organization of the neurons' ensemble into a complex network, and drives the formulation of a phenomenological model yet able to describe qualitatively the overall scenario observed during the culture growth. PMID:25393432

  13. CT liver volumetry using geodesic active contour segmentation with a level-set algorithm

    NASA Astrophysics Data System (ADS)

    Suzuki, Kenji; Epstein, Mark L.; Kohlbrenner, Ryan; Obajuluwa, Ademola; Xu, Jianwu; Hori, Masatoshi; Baron, Richard

    2010-03-01

    Automatic liver segmentation on CT images is challenging because the liver often abuts other organs of a similar density. Our purpose was to develop an accurate automated liver segmentation scheme for measuring liver volumes. We developed an automated volumetry scheme for the liver in CT based on a 5 step schema. First, an anisotropic smoothing filter was applied to portal-venous phase CT images to remove noise while preserving the liver structure, followed by an edge enhancer to enhance the liver boundary. By using the boundary-enhanced image as a speed function, a fastmarching algorithm generated an initial surface that roughly estimated the liver shape. A geodesic-active-contour segmentation algorithm coupled with level-set contour-evolution refined the initial surface so as to more precisely fit the liver boundary. The liver volume was calculated based on the refined liver surface. Hepatic CT scans of eighteen prospective liver donors were obtained under a liver transplant protocol with a multi-detector CT system. Automated liver volumes obtained were compared with those manually traced by a radiologist, used as "gold standard." The mean liver volume obtained with our scheme was 1,520 cc, whereas the mean manual volume was 1,486 cc, with the mean absolute difference of 104 cc (7.0%). CT liver volumetrics based on an automated scheme agreed excellently with "goldstandard" manual volumetrics (intra-class correlation coefficient was 0.95) with no statistically significant difference (p(F<=f)=0.32), and required substantially less completion time. Our automated scheme provides an efficient and accurate way of measuring liver volumes.

  14. Shadow Detection from Very High Resoluton Satellite Image Using Grabcut Segmentation and Ratio-Band Algorithms

    NASA Astrophysics Data System (ADS)

    Kadhim, N. M. S. M.; Mourshed, M.; Bray, M. T.

    2015-03-01

    Very-High-Resolution (VHR) satellite imagery is a powerful source of data for detecting and extracting information about urban constructions. Shadow in the VHR satellite imageries provides vital information on urban construction forms, illumination direction, and the spatial distribution of the objects that can help to further understanding of the built environment. However, to extract shadows, the automated detection of shadows from images must be accurate. This paper reviews current automatic approaches that have been used for shadow detection from VHR satellite images and comprises two main parts. In the first part, shadow concepts are presented in terms of shadow appearance in the VHR satellite imageries, current shadow detection methods, and the usefulness of shadow detection in urban environments. In the second part, we adopted two approaches which are considered current state-of-the-art shadow detection, and segmentation algorithms using WorldView-3 and Quickbird images. In the first approach, the ratios between the NIR and visible bands were computed on a pixel-by-pixel basis, which allows for disambiguation between shadows and dark objects. To obtain an accurate shadow candidate map, we further refine the shadow map after applying the ratio algorithm on the Quickbird image. The second selected approach is the GrabCut segmentation approach for examining its performance in detecting the shadow regions of urban objects using the true colour image from WorldView-3. Further refinement was applied to attain a segmented shadow map. Although the detection of shadow regions is a very difficult task when they are derived from a VHR satellite image that comprises a visible spectrum range (RGB true colour), the results demonstrate that the detection of shadow regions in the WorldView-3 image is a reasonable separation from other objects by applying the GrabCut algorithm. In addition, the derived shadow map from the Quickbird image indicates significant performance of

  15. Development and validation of a segmentation-free polyenergetic algorithm for dynamic perfusion computed tomography.

    PubMed

    Lin, Yuan; Samei, Ehsan

    2016-07-01

    Dynamic perfusion imaging can provide the morphologic details of the scanned organs as well as the dynamic information of blood perfusion. However, due to the polyenergetic property of the x-ray spectra, beam hardening effect results in undesirable artifacts and inaccurate CT values. To address this problem, this study proposes a segmentation-free polyenergetic dynamic perfusion imaging algorithm (pDP) to provide superior perfusion imaging. Dynamic perfusion usually is composed of two phases, i.e., a precontrast phase and a postcontrast phase. In the precontrast phase, the attenuation properties of diverse base materials (e.g., in a thorax perfusion exam, base materials can include lung, fat, breast, soft tissue, bone, and metal implants) can be incorporated to reconstruct artifact-free precontrast images. If patient motions are negligible or can be corrected by registration, the precontrast images can then be employed as a priori information to derive linearized iodine projections from the postcontrast images. With the linearized iodine projections, iodine perfusion maps can be reconstructed directly without the influence of various influential factors, such as iodine location, patient size, x-ray spectrum, and background tissue type. A series of simulations were conducted on a dynamic iodine calibration phantom and a dynamic anthropomorphic thorax phantom to validate the proposed algorithm. The simulations with the dynamic iodine calibration phantom showed that the proposed algorithm could effectively eliminate the beam hardening effect and enable quantitative iodine map reconstruction across various influential factors. The error range of the iodine concentration factors ([Formula: see text]) was reduced from [Formula: see text] for filtered back-projection (FBP) to [Formula: see text] for pDP. The quantitative results of the simulations with the dynamic anthropomorphic thorax phantom indicated that the maximum error of iodine concentrations can be reduced from

  16. A two-dimensional Segmented Boundary Algorithm for complex moving solid boundaries in Smoothed Particle Hydrodynamics

    NASA Astrophysics Data System (ADS)

    Khorasanizade, Sh.; Sousa, J. M. M.

    2016-03-01

    A Segmented Boundary Algorithm (SBA) is proposed to deal with complex boundaries and moving bodies in Smoothed Particle Hydrodynamics (SPH). Boundaries are formed in this algorithm with chains of lines obtained from the decomposition of two-dimensional objects, based on simple line geometry. Various two-dimensional, viscous fluid flow cases have been studied here using a truly incompressible SPH method with the aim of assessing the capabilities of the SBA. Firstly, the flow over a stationary circular cylinder in a plane channel was analyzed at steady and unsteady regimes, for a single value of blockage ratio. Subsequently, the flow produced by a moving circular cylinder with a prescribed acceleration inside a plane channel was investigated as well. Next, the simulation of the flow generated by the impulsive start of a flat plate, again inside a plane channel, has been carried out. This was followed by the study of confined sedimentation of an elliptic body subjected to gravity, for various density ratios. The set of test cases was completed with the simulation of periodic flow around a sunflower-shaped object. Extensive comparisons of the results obtained here with published data have demonstrated the accuracy and effectiveness of the proposed algorithms, namely in cases involving complex geometries and moving bodies.

  17. Larynx Anatomy

    MedlinePlus

    ... e.g. -historical Searches are case-insensitive Larynx Anatomy Add to My Pictures View /Download : Small: 648x576 ... View Download Large: 2700x2400 View Download Title: Larynx Anatomy Description: Anatomy of the larynx; drawing shows the ...

  18. Pharynx Anatomy

    MedlinePlus

    ... e.g. -historical Searches are case-insensitive Pharynx Anatomy Add to My Pictures View /Download : Small: 720x576 ... View Download Large: 3000x2400 View Download Title: Pharynx Anatomy Description: Anatomy of the pharynx; drawing shows the ...

  19. Vulva Anatomy

    MedlinePlus

    ... e.g. -historical Searches are case-insensitive Vulva Anatomy Add to My Pictures View /Download : Small: 720x634 ... View Download Large: 3000x2640 View Download Title: Vulva Anatomy Description: Anatomy of the vulva; drawing shows the ...

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

    PubMed

    Zhu, Yanjie; Tan, Yongqing; Hua, Yanqing; Zhang, Guozhen; Zhang, Jianguo

    2012-06-01

    Chest radiologists rely on the segmentation and quantificational analysis of ground-glass opacities (GGO) to perform imaging diagnoses that evaluate the disease severity or recovery stages of diffuse parenchymal lung diseases. However, it is computationally difficult to segment and analyze patterns of GGO while compared with other lung diseases, since GGO usually do not have clear boundaries. In this paper, we present a new approach which automatically segments GGO in lung computed tomography (CT) images using algorithms derived from Markov random field theory. Further, we systematically evaluate the performance of the algorithms in segmenting GGO in lung CT images under different situations. CT image studies from 41 patients with diffuse lung diseases were enrolled in this research. The local distributions were modeled with both simple and adaptive (AMAP) models of maximum a posteriori (MAP). For best segmentation, we used the simulated annealing algorithm with a Gibbs sampler to solve the combinatorial optimization problem of MAP estimators, and we applied a knowledge-guided strategy to reduce false positive regions. We achieved AMAP-based GGO segmentation results of 86.94%, 94.33%, and 94.06% in average sensitivity, specificity, and accuracy, respectively, and we evaluated the performance using radiologists' subjective evaluation and quantificational analysis and diagnosis. We also compared the results of AMAP-based GGO segmentation with those of support vector machine-based methods, and we discuss the reliability and other issues of AMAP-based GGO segmentation. Our research results demonstrate the acceptability and usefulness of AMAP-based GGO segmentation for assisting radiologists in detecting GGO in high-resolution CT diagnostic procedures.

  1. Modal characterization of the ASCIE segmented optics testbed: New algorithms and experimental results

    NASA Technical Reports Server (NTRS)

    Carrier, Alain C.; Aubrun, Jean-Noel

    1993-01-01

    New frequency response measurement procedures, on-line modal tuning techniques, and off-line modal identification algorithms are developed and applied to the modal identification of the Advanced Structures/Controls Integrated Experiment (ASCIE), a generic segmented optics telescope test-bed representative of future complex space structures. The frequency response measurement procedure uses all the actuators simultaneously to excite the structure and all the sensors to measure the structural response so that all the transfer functions are measured simultaneously. Structural responses to sinusoidal excitations are measured and analyzed to calculate spectral responses. The spectral responses in turn are analyzed as the spectral data become available and, which is new, the results are used to maintain high quality measurements. Data acquisition, processing, and checking procedures are fully automated. As the acquisition of the frequency response progresses, an on-line algorithm keeps track of the actuator force distribution that maximizes the structural response to automatically tune to a structural mode when approaching a resonant frequency. This tuning is insensitive to delays, ill-conditioning, and nonproportional damping. Experimental results show that is useful for modal surveys even in high modal density regions. For thorough modeling, a constructive procedure is proposed to identify the dynamics of a complex system from its frequency response with the minimization of a least-squares cost function as a desirable objective. This procedure relies on off-line modal separation algorithms to extract modal information and on least-squares parameter subset optimization to combine the modal results and globally fit the modal parameters to the measured data. The modal separation algorithms resolved modal density of 5 modes/Hz in the ASCIE experiment. They promise to be useful in many challenging applications.

  2. A Fast Semiautomatic Algorithm for Centerline-Based Vocal Tract Segmentation

    PubMed Central

    Poznyakovskiy, Anton A.; Mainka, Alexander; Platzek, Ivan; Mürbe, Dirk

    2015-01-01

    Vocal tract morphology is an important factor in voice production. Its analysis has potential implications for educational matters as well as medical issues like voice therapy. The knowledge of the complex adjustments in the spatial geometry of the vocal tract during phonation is still limited. For a major part, this is due to difficulties in acquiring geometry data of the vocal tract in the process of voice production. In this study, a centerline-based segmentation method using active contours was introduced to extract the geometry data of the vocal tract obtained with MRI during sustained vowel phonation. The applied semiautomatic algorithm was found to be time- and interaction-efficient and allowed performing various three-dimensional measurements on the resulting model. The method is suitable for an improved detailed analysis of the vocal tract morphology during speech or singing which might give some insights into the underlying mechanical processes. PMID:26557710

  3. A Fast Semiautomatic Algorithm for Centerline-Based Vocal Tract Segmentation.

    PubMed

    Poznyakovskiy, Anton A; Mainka, Alexander; Platzek, Ivan; Mürbe, Dirk

    2015-01-01

    Vocal tract morphology is an important factor in voice production. Its analysis has potential implications for educational matters as well as medical issues like voice therapy. The knowledge of the complex adjustments in the spatial geometry of the vocal tract during phonation is still limited. For a major part, this is due to difficulties in acquiring geometry data of the vocal tract in the process of voice production. In this study, a centerline-based segmentation method using active contours was introduced to extract the geometry data of the vocal tract obtained with MRI during sustained vowel phonation. The applied semiautomatic algorithm was found to be time- and interaction-efficient and allowed performing various three-dimensional measurements on the resulting model. The method is suitable for an improved detailed analysis of the vocal tract morphology during speech or singing which might give some insights into the underlying mechanical processes.

  4. Enhancing a diffusion algorithm for 4D image segmentation using local information

    NASA Astrophysics Data System (ADS)

    Lösel, Philipp; Heuveline, Vincent

    2016-03-01

    Inspired by the diffusion of a particle, we present a novel approach for performing a semiautomatic segmentation of tomographic images in 3D, 4D or higher dimensions to meet the requirements of high-throughput measurements in a synchrotron X-ray microtomograph. Given a small number of 2D-slices with at least two manually labeled segments, one can either analytically determine the probability that an intelligently weighted random walk starting at one labeled pixel will be at a certain time at a specific position in the dataset or determine the probability approximately by performing several random walks. While the weights of a random walk take into account local information at the starting point, the random walk itself can be in any dimension. Starting a great number of random walks in each labeled pixel, a voxel in the dataset will be hit by several random walks over time. Hence, the image can be segmented by assigning each voxel to the label where the random walks most likely started from. Due to the high scalability of random walks, this approach is suitable for high throughput measurements. Additionally, we describe an interactively adjusted active contours slice by slice method considering local information, where we start with one manually labeled slice and move forward in any direction. This approach is superior with respect to accuracy towards the diffusion algorithm but inferior in the amount of tedious manual processing steps. The methods were applied on 3D and 4D datasets and evaluated by means of manually labeled images obtained in a realistic scenario with biologists.

  5. An iris segmentation algorithm based on edge orientation for off-angle iris recognition

    NASA Astrophysics Data System (ADS)

    Karakaya, Mahmut; Barstow, Del; Santos-Villalobos, Hector; Boehnen, Christopher

    2013-03-01

    Iris recognition is known as one of the most accurate and reliable biometrics. However, the accuracy of iris recognition systems depends on the quality of data capture and is negatively affected by several factors such as angle, occlusion, and dilation. In this paper, we present a segmentation algorithm for off-angle iris images that uses edge detection, edge elimination, edge classification, and ellipse fitting techniques. In our approach, we first detect all candidate edges in the iris image by using the canny edge detector; this collection contains edges from the iris and pupil boundaries as well as eyelash, eyelids, iris texture etc. Edge orientation is used to eliminate the edges that cannot be part of the iris or pupil. Then, we classify the remaining edge points into two sets as pupil edges and iris edges. Finally, we randomly generate subsets of iris and pupil edge points, fit ellipses for each subset, select ellipses with similar parameters, and average to form the resultant ellipses. Based on the results from real experiments, the proposed method shows effectiveness in segmentation for off-angle iris images.

  6. A multiple-feature and multiple-kernel scene segmentation algorithm for humanoid robot.

    PubMed

    Liu, Zhi; Xu, Shuqiong; Zhang, Yun; Chen, Chun Lung Philip

    2014-11-01

    This technical correspondence presents a multiple-feature and multiple-kernel support vector machine (MFMK-SVM) methodology to achieve a more reliable and robust segmentation performance for humanoid robot. The pixel wise intensity, gradient, and C1 SMF features are extracted via the local homogeneity model and Gabor filter, which would be used as inputs of MFMK-SVM model. It may provide multiple features of the samples for easier implementation and efficient computation of MFMK-SVM model. A new clustering method, which is called feature validity-interval type-2 fuzzy C-means (FV-IT2FCM) clustering algorithm, is proposed by integrating a type-2 fuzzy criterion in the clustering optimization process to improve the robustness and reliability of clustering results by the iterative optimization. Furthermore, the clustering validity is employed to select the training samples for the learning of the MFMK-SVM model. The MFMK-SVM scene segmentation method is able to fully take advantage of the multiple features of scene image and the ability of multiple kernels. Experiments on the BSDS dataset and real natural scene images demonstrate the superior performance of our proposed method.

  7. An Iris Segmentation Algorithm based on Edge Orientation for Off-angle Iris Recognition

    SciTech Connect

    Karakaya, Mahmut; Barstow, Del R; Santos-Villalobos, Hector J; Boehnen, Chris Bensing

    2013-01-01

    Iris recognition is known as one of the most accurate and reliable biometrics. However, the accuracy of iris recognition systems depends on the quality of data capture and is negatively affected by several factors such as angle, occlusion, and dilation. In this paper, we present a segmentation algorithm for off-angle iris images that uses edge detection, edge elimination, edge classification, and ellipse fitting techniques. In our approach, we first detect all candidate edges in the iris image by using the canny edge detector; this collection contains edges from the iris and pupil boundaries as well as eyelash, eyelids, iris texture etc. Edge orientation is used to eliminate the edges that cannot be part of the iris or pupil. Then, we classify the remaining edge points into two sets as pupil edges and iris edges. Finally, we randomly generate subsets of iris and pupil edge points, fit ellipses for each subset, select ellipses with similar parameters, and average to form the resultant ellipses. Based on the results from real experiments, the proposed method shows effectiveness in segmentation for off-angle iris images.

  8. A novel Iterative algorithm to text segmentation for web born-digital images

    NASA Astrophysics Data System (ADS)

    Xu, Zhigang; Zhu, Yuesheng; Sun, Ziqiang; Liu, Zhen

    2015-07-01

    Since web born-digital images have low resolution and dense text atoms, text region over-merging and miss detection are still two open issues to be addressed. In this paper a novel iterative algorithm is proposed to locate and segment text regions. In each iteration, the candidate text regions are generated by detecting Maximally Stable Extremal Region (MSER) with diminishing thresholds, and categorized into different groups based on a new similarity graph, and the texted region groups are identified by applying several features and rules. With our proposed overlap checking method the final well-segmented text regions are selected from these groups in all iterations. Experiments have been carried out on the web born-digital image datasets used for robust reading competition in ICDAR 2011 and 2013, and the results demonstrate that our proposed scheme can significantly reduce both the number of over-merge regions and the lost rate of target atoms, and the overall performance outperforms the best compared with the methods shown in the two competitions in term of recall rate and f-score at the cost of slightly higher computational complexity.

  9. Numerical Arc Segmentation Algorithm for a Radio Conference-NASARC (version 4.0) technical manual

    NASA Technical Reports Server (NTRS)

    Whyte, Wayne A., Jr.; Heyward, Ann O.; Ponchak, Denise S.; Spence, Rodney L.; Zuzek, John E.

    1988-01-01

    The information contained in the NASARC (Version 4.0) Technical Manual and NASARC (Version 4.0) User's Manual relates to the Numerical Arc Segmentation Algorithm for a Radio Conference (NASARC) software development through November 1, 1988. The Technical Manual describes the NASARC concept and the algorithms used to implement the concept. The User's Manual provides information on computer system considerations, installation instructions, description of input files, and program operation instructions. Significant revisions were incorporated in the Version 4.0 software over prior versions. These revisions have further enhanced the modeling capabilities of the NASARC procedure and provide improved arrangements of predetermined arcs within the geostationary orbits. Array dimensions within the software were structured to fit within the currently available 12 megabyte memory capacity of the International Frequency Registration Board (IFRB) computer facility. A piecewise approach to predetermined arc generation in NASARC (Version 4.0) allows worldwide planning problem scenarios to be accommodated within computer run time and memory constraints with enhanced likelihood and ease of solution.

  10. Numerical Arc Segmentation Algorithm for a Radio Conference (NASARC), version 4.0: User's manual

    NASA Technical Reports Server (NTRS)

    Whyte, Wayne A., Jr.; Heyward, Ann O.; Ponchak, Denise S.; Spence, Rodney L.; Zuzek, John E.

    1988-01-01

    The information in the NASARC (Version 4.0) Technical Manual (NASA-TM-101453) and NASARC (Version 4.0) User's Manual (NASA-TM-101454) relates to the state of Numerical Arc Segmentation Algorithm for a Radio Conference (NASARC) software development through November 1, 1988. The Technical Manual describes the NASARC concept and the algorithms used to implement the concept. The User's Manual provides information on computer system considerations, installation instructions, description of input files, and program operation instructions. Significant revisions were incorporated in the Version 4.0 software over prior versions. These revisions have further enhanced the modeling capabilities of the NASARC procedure and provide improved arrangements of predetermined arcs within the geostationary orbit. Array dimensions within the software were structured to fit within the currently available 12-megabyte memory capacity of the International Frequency Registration Board (IFRB) computer facility. A piecewise approach to predetermined arc generation in NASARC (Version 4.) allows worldwide planning problem scenarios to be accommodated within computer run time and memory constraints with enhanced likelihood and ease of solution.

  11. Numerical Arc Segmentation Algorithm for a Radio Conference-NASARC, Version 2.0: User's Manual

    NASA Technical Reports Server (NTRS)

    Whyte, Wayne A., Jr.; Heyward, Ann O.; Ponchak, Denise S.; Spence, Rodney L.; Zuzek, John E.

    1987-01-01

    The information contained in the NASARC (Version 2.0) Technical Manual (NASA TM-100160) and the NASARC (Version 2.0) User's Manual (NASA TM-100161) relates to the state of the Numerical Arc Segmentation Algorithm for a Radio Conference (NASARC) software development through October 16, 1987. The technical manual describes the NASARC concept and the algorithms which are used to implement it. The User's Manual provides information on computer system considerations, installation instructions, description of input files, and program operation instructions. Significant revisions have been incorporated in the Version 2.0 software over prior versions. These revisions have enhanced the modeling capabilities of the NASARC procedure while greatly reducing the computer run time and memory requirements. Array dimensions within the software have been structured to fit into the currently available 6-megabyte memory capacity of the International Frequency Registration Board (IFRB) computer facility. A piecewise approach to predetermined arc generation in NASARC (Version 2.0) allows worldwide scenarios to be accommodated within these memory constraints while at the same time reducing computer run time.

  12. Numerical arc segmentation algorithm for a radio conference-NASARC (version 2.0) technical manual

    NASA Technical Reports Server (NTRS)

    Whyte, Wayne A., Jr.; Heyward, Ann O.; Ponchak, Denise S.; Spence, Rodney L.; Zuzek, John E.

    1987-01-01

    The information contained in the NASARC (Version 2.0) Technical Manual (NASA TM-100160) and NASARC (Version 2.0) User's Manual (NASA TM-100161) relates to the state of NASARC software development through October 16, 1987. The Technical Manual describes the Numerical Arc Segmentation Algorithm for a Radio Conference (NASARC) concept and the algorithms used to implement the concept. The User's Manual provides information on computer system considerations, installation instructions, description of input files, and program operating instructions. Significant revisions have been incorporated in the Version 2.0 software. These revisions have enhanced the modeling capabilities of the NASARC procedure while greatly reducing the computer run time and memory requirements. Array dimensions within the software have been structured to fit within the currently available 6-megabyte memory capacity of the International Frequency Registration Board (IFRB) computer facility. A piecewise approach to predetermined arc generation in NASARC (Version 2.0) allows worldwide scenarios to be accommodated within these memory constraints while at the same time effecting an overall reduction in computer run time.

  13. A comparison of supervised machine learning algorithms and feature vectors for MS lesion segmentation using multimodal structural MRI.

    PubMed

    Sweeney, Elizabeth M; Vogelstein, Joshua T; Cuzzocreo, Jennifer L; Calabresi, Peter A; Reich, Daniel S; Crainiceanu, Ciprian M; Shinohara, Russell T

    2014-01-01

    Machine learning is a popular method for mining and analyzing large collections of medical data. We focus on a particular problem from medical research, supervised multiple sclerosis (MS) lesion segmentation in structural magnetic resonance imaging (MRI). We examine the extent to which the choice of machine learning or classification algorithm and feature extraction function impacts the performance of lesion segmentation methods. As quantitative measures derived from structural MRI are important clinical tools for research into the pathophysiology and natural history of MS, the development of automated lesion segmentation methods is an active research field. Yet, little is known about what drives performance of these methods. We evaluate the performance of automated MS lesion segmentation methods, which consist of a supervised classification algorithm composed with a feature extraction function. These feature extraction functions act on the observed T1-weighted (T1-w), T2-weighted (T2-w) and fluid-attenuated inversion recovery (FLAIR) MRI voxel intensities. Each MRI study has a manual lesion segmentation that we use to train and validate the supervised classification algorithms. Our main finding is that the differences in predictive performance are due more to differences in the feature vectors, rather than the machine learning or classification algorithms. Features that incorporate information from neighboring voxels in the brain were found to increase performance substantially. For lesion segmentation, we conclude that it is better to use simple, interpretable, and fast algorithms, such as logistic regression, linear discriminant analysis, and quadratic discriminant analysis, and to develop the features to improve performance. PMID:24781953

  14. ATLAAS: an automatic decision tree-based learning algorithm for advanced image segmentation in positron emission tomography

    NASA Astrophysics Data System (ADS)

    Berthon, Beatrice; Marshall, Christopher; Evans, Mererid; Spezi, Emiliano

    2016-07-01

    Accurate and reliable tumour delineation on positron emission tomography (PET) is crucial for radiotherapy treatment planning. PET automatic segmentation (PET-AS) eliminates intra- and interobserver variability, but there is currently no consensus on the optimal method to use, as different algorithms appear to perform better for different types of tumours. This work aimed to develop a predictive segmentation model, trained to automatically select and apply the best PET-AS method, according to the tumour characteristics. ATLAAS, the automatic decision tree-based learning algorithm for advanced segmentation is based on supervised machine learning using decision trees. The model includes nine PET-AS methods and was trained on a 100 PET scans with known true contour. A decision tree was built for each PET-AS algorithm to predict its accuracy, quantified using the Dice similarity coefficient (DSC), according to the tumour volume, tumour peak to background SUV ratio and a regional texture metric. The performance of ATLAAS was evaluated for 85 PET scans obtained from fillable and printed subresolution sandwich phantoms. ATLAAS showed excellent accuracy across a wide range of phantom data and predicted the best or near-best segmentation algorithm in 93% of cases. ATLAAS outperformed all single PET-AS methods on fillable phantom data with a DSC of 0.881, while the DSC for H&N phantom data was 0.819. DSCs higher than 0.650 were achieved in all cases. ATLAAS is an advanced automatic image segmentation algorithm based on decision tree predictive modelling, which can be trained on images with known true contour, to predict the best PET-AS method when the true contour is unknown. ATLAAS provides robust and accurate image segmentation with potential applications to radiation oncology.

  15. ATLAAS: an automatic decision tree-based learning algorithm for advanced image segmentation in positron emission tomography.

    PubMed

    Berthon, Beatrice; Marshall, Christopher; Evans, Mererid; Spezi, Emiliano

    2016-07-01

    Accurate and reliable tumour delineation on positron emission tomography (PET) is crucial for radiotherapy treatment planning. PET automatic segmentation (PET-AS) eliminates intra- and interobserver variability, but there is currently no consensus on the optimal method to use, as different algorithms appear to perform better for different types of tumours. This work aimed to develop a predictive segmentation model, trained to automatically select and apply the best PET-AS method, according to the tumour characteristics. ATLAAS, the automatic decision tree-based learning algorithm for advanced segmentation is based on supervised machine learning using decision trees. The model includes nine PET-AS methods and was trained on a 100 PET scans with known true contour. A decision tree was built for each PET-AS algorithm to predict its accuracy, quantified using the Dice similarity coefficient (DSC), according to the tumour volume, tumour peak to background SUV ratio and a regional texture metric. The performance of ATLAAS was evaluated for 85 PET scans obtained from fillable and printed subresolution sandwich phantoms. ATLAAS showed excellent accuracy across a wide range of phantom data and predicted the best or near-best segmentation algorithm in 93% of cases. ATLAAS outperformed all single PET-AS methods on fillable phantom data with a DSC of 0.881, while the DSC for H&N phantom data was 0.819. DSCs higher than 0.650 were achieved in all cases. ATLAAS is an advanced automatic image segmentation algorithm based on decision tree predictive modelling, which can be trained on images with known true contour, to predict the best PET-AS method when the true contour is unknown. ATLAAS provides robust and accurate image segmentation with potential applications to radiation oncology. PMID:27273293

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

    SciTech Connect

    Feng, Y; Olsen, J.; Parikh, P.; Noel, C; Wooten, H; Du, D; Mutic, S; Hu, Y; Kawrakow, I; Dempsey, J

    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

  17. Metal Artifact Reduction and Segmentation of Dental Computerized Tomography Images Using Least Square Support Vector Machine and Mean Shift Algorithm

    PubMed Central

    Mortaheb, Parinaz; Rezaeian, Mehdi

    2016-01-01

    Segmentation and three-dimensional (3D) visualization of teeth in dental computerized tomography (CT) images are of dentists’ requirements for both abnormalities diagnosis and the treatments such as dental implant and orthodontic planning. On the other hand, dental CT image segmentation is a difficult process because of the specific characteristics of the tooth's structure. This paper presents a method for automatic segmentation of dental CT images. We present a multi-step method, which starts with a preprocessing phase to reduce the metal artifact using the least square support vector machine. Integral intensity profile is then applied to detect each tooth's region candidates. Finally, the mean shift algorithm is used to partition the region of each tooth, and all these segmented slices are then applied for 3D visualization of teeth. Examining the performance of our proposed approach, a set of reliable assessment metrics is utilized. We applied the segmentation method on 14 cone-beam CT datasets. Functionality analysis of the proposed method demonstrated precise segmentation results on different sample slices. Accuracy analysis of the proposed method indicates that we can increase the sensitivity, specificity, precision, and accuracy of the segmentation results by 83.24%, 98.35%, 72.77%, and 97.62% and decrease the error rate by 2.34%. The experimental results show that the proposed approach performs well on different types of CT images and has better performance than all existing approaches. Moreover, segmentation results can be more accurate by using the proposed algorithm of metal artifact reduction in the preprocessing phase. PMID:27014607

  18. Segmentation of Coronary Angiograms Using Gabor Filters and Boltzmann Univariate Marginal Distribution Algorithm

    PubMed Central

    Cervantes-Sanchez, Fernando; Hernandez-Aguirre, Arturo; Solorio-Meza, Sergio; Ornelas-Rodriguez, Manuel; Torres-Cisneros, Miguel

    2016-01-01

    This paper presents a novel method for improving the training step of the single-scale Gabor filters by using the Boltzmann univariate marginal distribution algorithm (BUMDA) in X-ray angiograms. Since the single-scale Gabor filters (SSG) are governed by three parameters, the optimal selection of the SSG parameters is highly desirable in order to maximize the detection performance of coronary arteries while reducing the computational time. To obtain the best set of parameters for the SSG, the area (Az) under the receiver operating characteristic curve is used as fitness function. Moreover, to classify vessel and nonvessel pixels from the Gabor filter response, the interclass variance thresholding method has been adopted. The experimental results using the proposed method obtained the highest detection rate with Az = 0.9502 over a training set of 40 images and Az = 0.9583 with a test set of 40 images. In addition, the experimental results of vessel segmentation provided an accuracy of 0.944 with the test set of angiograms. PMID:27738422

  19. A region segmentation based algorithm for building a crystal position lookup table in a scintillation detector

    NASA Astrophysics Data System (ADS)

    Wang, Hai-Peng; Yun, Ming-Kai; Liu, Shuang-Quan; Fan, Xin; Cao, Xue-Xiang; Chai, Pei; Shan, Bao-Ci

    2015-03-01

    In a scintillation detector, scintillation crystals are typically made into a 2-dimensional modular array. The location of incident gamma-ray needs be calibrated due to spatial response nonlinearity. Generally, position histograms-the characteristic flood response of scintillation detectors-are used for position calibration. In this paper, a position calibration method based on a crystal position lookup table which maps the inaccurate location calculated by Anger logic to the exact hitting crystal position has been proposed. Firstly, the position histogram is preprocessed, such as noise reduction and image enhancement. Then the processed position histogram is segmented into disconnected regions, and crystal marking points are labeled by finding the centroids of regions. Finally, crystal boundaries are determined and the crystal position lookup table is generated. The scheme is evaluated by the whole-body positron emission tomography (PET) scanner and breast dedicated single photon emission computed tomography scanner developed by the Institute of High Energy Physics, Chinese Academy of Sciences. The results demonstrate that the algorithm is accurate, efficient, robust and applicable to any configurations of scintillation detector. Supported by National Natural Science Foundation of China (81101175) and XIE Jia-Lin Foundation of Institute of High Energy Physics (Y3546360U2)

  20. An improved MLC segmentation algorithm and software for step-and-shoot IMRT delivery without tongue-and-groove error

    SciTech Connect

    Luan Shuang; Wang Chao; Chen, Danny Z.; Hu, Xiaobo S.; Naqvi, Shahid A.; Wu Xingen; Yu, Cedric X.

    2006-05-15

    We present an improved multileaf collimator (MLC) segmentation algorithm, denoted by SLS{sub NOTG} (static leaf sequencing with no tongue-and-groove error), for step-and-shoot intensity-modulated radiation therapy (IMRT) delivery. SLS{sub NOTG} is an improvement over the MLC segmentation algorithm called SLS that was developed by Luan et al. [Med. Phys. 31(4), 695-707 (2004)], which did not consider tongue-and-groove error corrections. The aims of SLS{sub NOTG} are (1) shortening the treatment times of IMRT plans by minimizing their numbers of segments and (2) minimizing the tongue-and-groove errors of the computed IMRT plans. The input to SLS{sub NOTG} is intensity maps (IMs) produced by current planning systems, and its output is (modified) optimized leaf sequences without tongue-and-groove error. Like the previous SLS algorithm [Luan et al., Med. Phys. 31(4), 695-707 (2004)], SLS{sub NOTG} is also based on graph algorithmic techniques in computer science. It models the MLC segmentation problem as a weighted minimum-cost path problem, where the weight of the path is the number of segments and the cost of the path is the amount of tongue-and-groove error. Our comparisons of SLS{sub NOTG} with CORVUS indicated that for the same intensity maps, the numbers of segments computed by SLS{sub NOTG} are up to 50% less than those by CORVUS 5.0 on the Elekta LINAC system. Our clinical verifications have shown that the dose distributions of the SLS{sub NOTG} plans do not have tongue-and-groove error and match those of the corresponding CORVUS plans, thus confirming the correctness of SLS{sub NOTG}. Comparing with existing segmentation methods, SLS{sub NOTG} also has two additional advantages: (1) SLS{sub NOTG} can compute leaf sequences whose tongue-and-groove error is minimized subject to a constraint on the maximum allowed number of segments, which may be desirable in clinical situations where a treatment with the complete correction of tongue-and-groove error takes too

  1. Segmentation of heterogeneous or small FDG PET positive tissue based on a 3D-locally adaptive random walk algorithm.

    PubMed

    Onoma, D P; Ruan, S; Thureau, S; Nkhali, L; Modzelewski, R; Monnehan, G A; Vera, P; Gardin, I

    2014-12-01

    A segmentation algorithm based on the random walk (RW) method, called 3D-LARW, has been developed to delineate small tumors or tumors with a heterogeneous distribution of FDG on PET images. Based on the original algorithm of RW [1], we propose an improved approach using new parameters depending on the Euclidean distance between two adjacent voxels instead of a fixed one and integrating probability densities of labels into the system of linear equations used in the RW. These improvements were evaluated and compared with the original RW method, a thresholding with a fixed value (40% of the maximum in the lesion), an adaptive thresholding algorithm on uniform spheres filled with FDG and FLAB method, on simulated heterogeneous spheres and on clinical data (14 patients). On these three different data, 3D-LARW has shown better segmentation results than the original RW algorithm and the three other methods. As expected, these improvements are more pronounced for the segmentation of small or tumors having heterogeneous FDG uptake.

  2. Eye Anatomy

    MedlinePlus

    ... News About Us Donate In This Section Eye Anatomy en Español email Send this article to a ... You at Risk For Glaucoma? Childhood Glaucoma Eye Anatomy Five Common Glaucoma Tests Glaucoma Facts and Stats ...

  3. Paraganglioma Anatomy

    MedlinePlus

    ... e.g. -historical Searches are case-insensitive Paraganglioma Anatomy Add to My Pictures View /Download : Small: 648x576 ... View Download Large: 2700x2400 View Download Title: Paraganglioma Anatomy Description: Paraganglioma of the head and neck; drawing ...

  4. Heart Anatomy

    MedlinePlus

    ... Incredible Machine Bonus poster (PDF) The Human Heart Anatomy Blood The Conduction System The Coronary Arteries The ... of the Leg Vasculature of the Torso Heart anatomy illustrations and animations for grades K-6. Heart ...

  5. Improving performance of computer-aided detection of pulmonary embolisms by incorporating a new pulmonary vascular-tree segmentation algorithm

    NASA Astrophysics Data System (ADS)

    Wang, Xingwei; Song, XiaoFei; Chapman, Brian E.; Zheng, Bin

    2012-03-01

    We developed a new pulmonary vascular tree segmentation/extraction algorithm. The purpose of this study was to assess whether adding this new algorithm to our previously developed computer-aided detection (CAD) scheme of pulmonary embolism (PE) could improve the CAD performance (in particular reducing false positive detection rates). A dataset containing 12 CT examinations with 384 verified pulmonary embolism regions associated with 24 threedimensional (3-D) PE lesions was selected in this study. Our new CAD scheme includes the following image processing and feature classification steps. (1) A 3-D based region growing process followed by a rolling-ball algorithm was utilized to segment lung areas. (2) The complete pulmonary vascular trees were extracted by combining two approaches of using an intensity-based region growing to extract the larger vessels and a vessel enhancement filtering to extract the smaller vessel structures. (3) A toboggan algorithm was implemented to identify suspicious PE candidates in segmented lung or vessel area. (4) A three layer artificial neural network (ANN) with the topology 27-10-1 was developed to reduce false positive detections. (5) A k-nearest neighbor (KNN) classifier optimized by a genetic algorithm was used to compute detection scores for the PE candidates. (6) A grouping scoring method was designed to detect the final PE lesions in three dimensions. The study showed that integrating the pulmonary vascular tree extraction algorithm into the CAD scheme reduced false positive rates by 16.2%. For the case based 3D PE lesion detecting results, the integrated CAD scheme achieved 62.5% detection sensitivity with 17.1 false-positive lesions per examination.

  6. Evaluation of state-of-the-art segmentation algorithms for left ventricle infarct from late Gadolinium enhancement MR images.

    PubMed

    Karim, Rashed; Bhagirath, Pranav; Claus, Piet; Housden, R James; Chen, Zhong; Karimaghaloo, Zahra; Sohn, Hyon-Mok; Lara Rodríguez, Laura; Vera, Sergio; Albà, Xènia; Hennemuth, Anja; Peitgen, Heinz-Otto; Arbel, Tal; Gonzàlez Ballester, Miguel A; Frangi, Alejandro F; Götte, Marco; Razavi, Reza; Schaeffter, Tobias; Rhode, Kawal

    2016-05-01

    Studies have demonstrated the feasibility of late Gadolinium enhancement (LGE) cardiovascular magnetic resonance (CMR) imaging for guiding the management of patients with sequelae to myocardial infarction, such as ventricular tachycardia and heart failure. Clinical implementation of these developments necessitates a reproducible and reliable segmentation of the infarcted regions. It is challenging to compare new algorithms for infarct segmentation in the left ventricle (LV) with existing algorithms. Benchmarking datasets with evaluation strategies are much needed to facilitate comparison. This manuscript presents a benchmarking evaluation framework for future algorithms that segment infarct from LGE CMR of the LV. The image database consists of 30 LGE CMR images of both humans and pigs that were acquired from two separate imaging centres. A consensus ground truth was obtained for all data using maximum likelihood estimation. Six widely-used fixed-thresholding methods and five recently developed algorithms are tested on the benchmarking framework. Results demonstrate that the algorithms have better overlap with the consensus ground truth than most of the n-SD fixed-thresholding methods, with the exception of the Full-Width-at-Half-Maximum (FWHM) fixed-thresholding method. Some of the pitfalls of fixed thresholding methods are demonstrated in this work. The benchmarking evaluation framework, which is a contribution of this work, can be used to test and benchmark future algorithms that detect and quantify infarct in LGE CMR images of the LV. The datasets, ground truth and evaluation code have been made publicly available through the website: https://www.cardiacatlas.org/web/guest/challenges.

  7. A Hybrid Method for Image Segmentation Based on Artificial Fish Swarm Algorithm and Fuzzy c-Means Clustering.

    PubMed

    Ma, Li; Li, Yang; Fan, Suohai; Fan, Runzhu

    2015-01-01

    Image segmentation plays an important role in medical image processing. Fuzzy c-means (FCM) clustering is one of the popular clustering algorithms for medical image segmentation. However, FCM has the problems of depending on initial clustering centers, falling into local optimal solution easily, and sensitivity to noise disturbance. To solve these problems, this paper proposes a hybrid artificial fish swarm algorithm (HAFSA). The proposed algorithm combines artificial fish swarm algorithm (AFSA) with FCM whose advantages of global optimization searching and parallel computing ability of AFSA are utilized to find a superior result. Meanwhile, Metropolis criterion and noise reduction mechanism are introduced to AFSA for enhancing the convergence rate and antinoise ability. The artificial grid graph and Magnetic Resonance Imaging (MRI) are used in the experiments, and the experimental results show that the proposed algorithm has stronger antinoise ability and higher precision. A number of evaluation indicators also demonstrate that the effect of HAFSA is more excellent than FCM and suppressed FCM (SFCM). PMID:26649068

  8. Validation of Point Clouds Segmentation Algorithms Through Their Application to Several Case Studies for Indoor Building Modelling

    NASA Astrophysics Data System (ADS)

    Macher, H.; Landes, T.; Grussenmeyer, P.

    2016-06-01

    Laser scanners are widely used for the modelling of existing buildings and particularly in the creation process of as-built BIM (Building Information Modelling). However, the generation of as-built BIM from point clouds involves mainly manual steps and it is consequently time consuming and error-prone. Along the path to automation, a three steps segmentation approach has been developed. This approach is composed of two phases: a segmentation into sub-spaces namely floors and rooms and a plane segmentation combined with the identification of building elements. In order to assess and validate the developed approach, different case studies are considered. Indeed, it is essential to apply algorithms to several datasets and not to develop algorithms with a unique dataset which could influence the development with its particularities. Indoor point clouds of different types of buildings will be used as input for the developed algorithms, going from an individual house of almost one hundred square meters to larger buildings of several thousand square meters. Datasets provide various space configurations and present numerous different occluding objects as for example desks, computer equipments, home furnishings and even wine barrels. For each dataset, the results will be illustrated. The analysis of the results will provide an insight into the transferability of the developed approach for the indoor modelling of several types of buildings.

  9. [Segmentation of Winter Wheat Canopy Image Based on Visual Spectral and Random Forest Algorithm].

    PubMed

    Liu, Ya-dong; Cui, Ri-xian

    2015-12-01

    Digital image analysis has been widely used in non-destructive monitoring of crop growth and nitrogen nutrition status due to its simplicity and efficiency. It is necessary to segment winter wheat plant from soil background for accessing canopy cover, intensity level of visible spectrum (R, G, and B) and other color indices derived from RGB. In present study, according to the variation in R, G, and B components of sRGB color space and L*, a*, and b* components of CIEL* a* b* color space between wheat plant and soil background, the segmentation of wheat plant from soil background were conducted by the Otsu's method based on a* component of CIEL* a* b* color space, and RGB based random forest method, and CIEL* a* b* based random forest method, respectively. Also the ability to segment wheat plant from soil background was evaluated with the value of segmentation accuracy. The results showed that all three methods had revealed good ability to segment wheat plant from soil background. The Otsu's method had lowest segmentation accuracy in comparison with the other two methods. There were only little difference in segmentation error between the two random forest methods. In conclusion, the random forest method had revealed its capacity to segment wheat plant from soil background with only the visual spectral information of canopy image without any color components combinations or any color space transformation.

  10. [Segmentation of Winter Wheat Canopy Image Based on Visual Spectral and Random Forest Algorithm].

    PubMed

    Liu, Ya-dong; Cui, Ri-xian

    2015-12-01

    Digital image analysis has been widely used in non-destructive monitoring of crop growth and nitrogen nutrition status due to its simplicity and efficiency. It is necessary to segment winter wheat plant from soil background for accessing canopy cover, intensity level of visible spectrum (R, G, and B) and other color indices derived from RGB. In present study, according to the variation in R, G, and B components of sRGB color space and L*, a*, and b* components of CIEL* a* b* color space between wheat plant and soil background, the segmentation of wheat plant from soil background were conducted by the Otsu's method based on a* component of CIEL* a* b* color space, and RGB based random forest method, and CIEL* a* b* based random forest method, respectively. Also the ability to segment wheat plant from soil background was evaluated with the value of segmentation accuracy. The results showed that all three methods had revealed good ability to segment wheat plant from soil background. The Otsu's method had lowest segmentation accuracy in comparison with the other two methods. There were only little difference in segmentation error between the two random forest methods. In conclusion, the random forest method had revealed its capacity to segment wheat plant from soil background with only the visual spectral information of canopy image without any color components combinations or any color space transformation. PMID:26964234

  11. Obtaining Thickness Maps of Corneal Layers Using the Optimal Algorithm for Intracorneal Layer Segmentation

    PubMed Central

    Rabbani, Hossein; Kazemian Jahromi, Mahdi; Jorjandi, Sahar; Mehri Dehnavi, Alireza; Hajizadeh, Fedra; Peyman, Alireza

    2016-01-01

    Optical Coherence Tomography (OCT) is one of the most informative methodologies in ophthalmology and provides cross sectional images from anterior and posterior segments of the eye. Corneal diseases can be diagnosed by these images and corneal thickness maps can also assist in the treatment and diagnosis. The need for automatic segmentation of cross sectional images is inevitable since manual segmentation is time consuming and imprecise. In this paper, segmentation methods such as Gaussian Mixture Model (GMM), Graph Cut, and Level Set are used for automatic segmentation of three clinically important corneal layer boundaries on OCT images. Using the segmentation of the boundaries in three-dimensional corneal data, we obtained thickness maps of the layers which are created by these borders. Mean and standard deviation of the thickness values for normal subjects in epithelial, stromal, and whole cornea are calculated in central, superior, inferior, nasal, and temporal zones (centered on the center of pupil). To evaluate our approach, the automatic boundary results are compared with the boundaries segmented manually by two corneal specialists. The quantitative results show that GMM method segments the desired boundaries with the best accuracy. PMID:27247559

  12. An Efficient Correction Algorithm for Eliminating Image Misalignment Effects on Co-Phasing Measurement Accuracy for Segmented Active Optics Systems.

    PubMed

    Yue, Dan; Xu, Shuyan; Nie, Haitao; Wang, Zongyang

    2016-01-01

    The misalignment between recorded in-focus and out-of-focus images using the Phase Diversity (PD) algorithm leads to a dramatic decline in wavefront detection accuracy and image recovery quality for segmented active optics systems. This paper demonstrates the theoretical relationship between the image misalignment and tip-tilt terms in Zernike polynomials of the wavefront phase for the first time, and an efficient two-step alignment correction algorithm is proposed to eliminate these misalignment effects. This algorithm processes a spatial 2-D cross-correlation of the misaligned images, revising the offset to 1 or 2 pixels and narrowing the search range for alignment. Then, it eliminates the need for subpixel fine alignment to achieve adaptive correction by adding additional tip-tilt terms to the Optical Transfer Function (OTF) of the out-of-focus channel. The experimental results demonstrate the feasibility and validity of the proposed correction algorithm to improve the measurement accuracy during the co-phasing of segmented mirrors. With this alignment correction, the reconstructed wavefront is more accurate, and the recovered image is of higher quality.

  13. An Efficient Correction Algorithm for Eliminating Image Misalignment Effects on Co-Phasing Measurement Accuracy for Segmented Active Optics Systems

    PubMed Central

    Yue, Dan; Xu, Shuyan; Nie, Haitao; Wang, Zongyang

    2016-01-01

    The misalignment between recorded in-focus and out-of-focus images using the Phase Diversity (PD) algorithm leads to a dramatic decline in wavefront detection accuracy and image recovery quality for segmented active optics systems. This paper demonstrates the theoretical relationship between the image misalignment and tip-tilt terms in Zernike polynomials of the wavefront phase for the first time, and an efficient two-step alignment correction algorithm is proposed to eliminate these misalignment effects. This algorithm processes a spatial 2-D cross-correlation of the misaligned images, revising the offset to 1 or 2 pixels and narrowing the search range for alignment. Then, it eliminates the need for subpixel fine alignment to achieve adaptive correction by adding additional tip-tilt terms to the Optical Transfer Function (OTF) of the out-of-focus channel. The experimental results demonstrate the feasibility and validity of the proposed correction algorithm to improve the measurement accuracy during the co-phasing of segmented mirrors. With this alignment correction, the reconstructed wavefront is more accurate, and the recovered image is of higher quality. PMID:26934045

  14. Segmentation of cervical cell nuclei in high-resolution microscopic images: A new algorithm and a web-based software framework.

    PubMed

    Bergmeir, Christoph; García Silvente, Miguel; Benítez, José Manuel

    2012-09-01

    In order to automate cervical cancer screening tests, one of the most important and longstanding challenges is the segmentation of cell nuclei in the stained specimens. Though nuclei of isolated cells in high-quality acquisitions often are easy to segment, the problem lies in the segmentation of large numbers of nuclei with various characteristics under differing acquisition conditions in high-resolution scans of the complete microscope slides. We implemented a system that enables processing of full resolution images, and proposes a new algorithm for segmenting the nuclei under adequate control of the expert user. The system can work automatically or interactively guided, to allow for segmentation within the whole range of slide and image characteristics. It facilitates data storage and interaction of technical and medical experts, especially with its web-based architecture. The proposed algorithm localizes cell nuclei using a voting scheme and prior knowledge, before it determines the exact shape of the nuclei by means of an elastic segmentation algorithm. After noise removal with a mean-shift and a median filtering takes place, edges are extracted with a Canny edge detection algorithm. Motivated by the observation that cell nuclei are surrounded by cytoplasm and their shape is roughly elliptical, edges adjacent to the background are removed. A randomized Hough transform for ellipses finds candidate nuclei, which are then processed by a level set algorithm. The algorithm is tested and compared to other algorithms on a database containing 207 images acquired from two different microscope slides, with promising results.

  15. Sparse appearance model-based algorithm for automatic segmentation and identification of articulated hand bones

    NASA Astrophysics Data System (ADS)

    Reda, Fitsum A.; Peng, Zhigang; Liao, Shu; Shinagawa, Yoshihisa; Zhan, Yiqiang; Hermosillo, Gerardo; Zhou, Xiang Sean

    2014-03-01

    Automatic and precise segmentation of hand bones is important for many medical imaging applications. Although several previous studies address bone segmentation, automatically segmenting articulated hand bones remains a challenging task. The highly articulated nature of hand bones limits the effectiveness of atlas-based segmentation methods. The use of low-level information derived from the image-of-interest alone is insufficient for detecting bones and distinguishing boundaries of different bones that are in close proximity to each other. In this study, we propose a method that combines an articulated statistical shape model and a local exemplar-based appearance model for automatically segmenting hand bones in CT. Our approach is to perform a hierarchical articulated shape deformation that is driven by a set of local exemplar-based appearance models. Specifically, for each point in the shape model, the local appearance model is described by a set of profiles of low-level image features along the normal of the shape. During segmentation, each point in the shape model is deformed to a new point whose image features are closest to the appearance model. The shape model is also constrained by an articulation model described by a set of pre-determined landmarks on the finger joints. In this way, the deformation is robust to sporadic false bony edges and is able to fit fingers with large articulations. We validated our method on 23 CT scans and we have a segmentation success rate of ~89.70 %. This result indicates that our method is viable for automatic segmentation of articulated hand bones in conventional CT.

  16. A novel multi-channel segmentation algorithm for X-ray microtomography data

    NASA Astrophysics Data System (ADS)

    Schlüter, Steffen

    2015-04-01

    X-ray microtomography has evolved into a standard technique for non-invasive imaging of inherent heterogeneity in rock and soil samples. As a prerequisite for quantitative image analysis the gray scale data has to be segmented into objects and background or multiple classes if more than two materials or phases are present in the image. In almost all cases a single gray value image serves as a basis for image segmentation. However, complimentary information could be provided from an additional image in order to help identify different classes with low contrast in the first image. This multi-channel segmentation is a standard method for RGB color images with three channels, and is also frequently used in other disciplines like remote sensing. This study explores the applicability of multi-channel segmentation for X-ray microtomography data. Instead of a single histogram, every phase evokes a cluster in the two- or multidimensional feature space. Fuzzy C-means clustering is used to assign combinations of gray values to certain phases. This can be combined with Markov random field segmentation to add neighborhood information to the class assignment. We demonstrate the novel segmentation method by two standard applications of X-ray µ-CT. First, we use dual-energy scans to improve the identification of two fluids in homogeneous sand. Second, we use morphology information as a second image channel to distinguish root channels from inter-aggregate pores in a silty loam sample.

  17. NOTE: Implementation of biologically conformal radiation therapy (BCRT) in an algorithmic segmentation-based inverse planning approach

    NASA Astrophysics Data System (ADS)

    Vanderstraeten, Barbara; DeGersem, Werner; Duthoy, Wim; DeNeve, Wilfried; Thierens, Hubert

    2006-08-01

    The development of new biological imaging technologies offers the opportunity to further individualize radiotherapy. Biologically conformal radiation therapy (BCRT) implies the use of the spatial distribution of one or more radiobiological parameters to guide the IMRT dose prescription. Our aim was to implement BCRT in an algorithmic segmentation-based planning approach. A biology-based segmentation tool was developed to generate initial beam segments that reflect the biological signal intensity pattern. The weights and shapes of the initial segments are optimized by means of an objective function that minimizes the root mean square deviation between the actual and intended dose values within the PTV. As proof of principle, [18F]FDG-PET-guided BCRT plans for two different levels of dose escalation were created for an oropharyngeal cancer patient. Both plans proved to be dosimetrically feasible without violating the planning constraints for the expanded spinal cord and the contralateral parotid gland as organs at risk. The obtained biological conformity was better for the first (2.5 Gy per fraction) than for the second (3 Gy per fraction) dose escalation level.

  18. MUSE: MUlti-atlas region Segmentation utilizing Ensembles of registration algorithms and parameters, and locally optimal atlas selection.

    PubMed

    Doshi, Jimit; Erus, Guray; Ou, Yangming; Resnick, Susan M; Gur, Ruben C; Gur, Raquel E; Satterthwaite, Theodore D; Furth, Susan; Davatzikos, Christos

    2016-02-15

    Atlas-based automated anatomical labeling is a fundamental tool in medical image segmentation, as it defines regions of interest for subsequent analysis of structural and functional image data. The extensive investigation of multi-atlas warping and fusion techniques over the past 5 or more years has clearly demonstrated the advantages of consensus-based segmentation. However, the common approach is to use multiple atlases with a single registration method and parameter set, which is not necessarily optimal for every individual scan, anatomical region, and problem/data-type. Different registration criteria and parameter sets yield different solutions, each providing complementary information. Herein, we present a consensus labeling framework that generates a broad ensemble of labeled atlases in target image space via the use of several warping algorithms, regularization parameters, and atlases. The label fusion integrates two complementary sources of information: a local similarity ranking to select locally optimal atlases and a boundary modulation term to refine the segmentation consistently with the target image's intensity profile. The ensemble approach consistently outperforms segmentations using individual warping methods alone, achieving high accuracy on several benchmark datasets. The MUSE methodology has been used for processing thousands of scans from various datasets, producing robust and consistent results. MUSE is publicly available both as a downloadable software package, and as an application that can be run on the CBICA Image Processing Portal (https://ipp.cbica.upenn.edu), a web based platform for remote processing of medical images.

  19. MUSE: MUlti-atlas region Segmentation utilizing Ensembles of registration algorithms and parameters, and locally optimal atlas selection.

    PubMed

    Doshi, Jimit; Erus, Guray; Ou, Yangming; Resnick, Susan M; Gur, Ruben C; Gur, Raquel E; Satterthwaite, Theodore D; Furth, Susan; Davatzikos, Christos

    2016-02-15

    Atlas-based automated anatomical labeling is a fundamental tool in medical image segmentation, as it defines regions of interest for subsequent analysis of structural and functional image data. The extensive investigation of multi-atlas warping and fusion techniques over the past 5 or more years has clearly demonstrated the advantages of consensus-based segmentation. However, the common approach is to use multiple atlases with a single registration method and parameter set, which is not necessarily optimal for every individual scan, anatomical region, and problem/data-type. Different registration criteria and parameter sets yield different solutions, each providing complementary information. Herein, we present a consensus labeling framework that generates a broad ensemble of labeled atlases in target image space via the use of several warping algorithms, regularization parameters, and atlases. The label fusion integrates two complementary sources of information: a local similarity ranking to select locally optimal atlases and a boundary modulation term to refine the segmentation consistently with the target image's intensity profile. The ensemble approach consistently outperforms segmentations using individual warping methods alone, achieving high accuracy on several benchmark datasets. The MUSE methodology has been used for processing thousands of scans from various datasets, producing robust and consistent results. MUSE is publicly available both as a downloadable software package, and as an application that can be run on the CBICA Image Processing Portal (https://ipp.cbica.upenn.edu), a web based platform for remote processing of medical images. PMID:26679328

  20. Integer anatomy

    SciTech Connect

    Doolittle, R.

    1994-11-15

    The title integer anatomy is intended to convey the idea of a systematic method for displaying the prime decomposition of the integers. Just as the biological study of anatomy does not teach us all things about behavior of species neither would we expect to learn everything about the number theory from a study of its anatomy. But, some number-theoretic theorems are illustrated by inspection of integer anatomy, which tend to validate the underlying structure and the form as developed and displayed in this treatise. The first statement to be made in this development is: the way structure of the natural numbers is displayed depends upon the allowed operations.

  1. A 2D driven 3D vessel segmentation algorithm for 3D digital subtraction angiography data

    NASA Astrophysics Data System (ADS)

    Spiegel, M.; Redel, T.; Struffert, T.; Hornegger, J.; Doerfler, A.

    2011-10-01

    Cerebrovascular disease is among the leading causes of death in western industrial nations. 3D rotational angiography delivers indispensable information on vessel morphology and pathology. Physicians make use of this to analyze vessel geometry in detail, i.e. vessel diameters, location and size of aneurysms, to come up with a clinical decision. 3D segmentation is a crucial step in this pipeline. Although a lot of different methods are available nowadays, all of them lack a method to validate the results for the individual patient. Therefore, we propose a novel 2D digital subtraction angiography (DSA)-driven 3D vessel segmentation and validation framework. 2D DSA projections are clinically considered as gold standard when it comes to measurements of vessel diameter or the neck size of aneurysms. An ellipsoid vessel model is applied to deliver the initial 3D segmentation. To assess the accuracy of the 3D vessel segmentation, its forward projections are iteratively overlaid with the corresponding 2D DSA projections. Local vessel discrepancies are modeled by a global 2D/3D optimization function to adjust the 3D vessel segmentation toward the 2D vessel contours. Our framework has been evaluated on phantom data as well as on ten patient datasets. Three 2D DSA projections from varying viewing angles have been used for each dataset. The novel 2D driven 3D vessel segmentation approach shows superior results against state-of-the-art segmentations like region growing, i.e. an improvement of 7.2% points in precision and 5.8% points for the Dice coefficient. This method opens up future clinical applications requiring the greatest vessel accuracy, e.g. computational fluid dynamic modeling.

  2. RANSAC-based EM algorithm for robust detection and segmentation of cylindrical fragments from calibrated C-arm images

    NASA Astrophysics Data System (ADS)

    Zheng, Guoyan; Dong, Xiao; Zhang, Xuan

    2006-03-01

    Automated identification, pose and size estimation of cylindrical fragments from registered C-arm images is highly desirable in various computer-assisted, fluoroscopy-based applications including long bone fracture reduction and intramedullary nailing, where the pose and size of bone fragment need to be accurately estimated for a better treatment. In this paper, a RANSAC-based EM algorithm for robust detection and segmentation of cylindrical fragments from calibrated C-arm images is presented. By detection, we mean that the axes and the radii of the principal fragments will be automatically determined. And by segmentation, we mean that the contour of the fragment projection onto each image plane will be automatically extracted. Benefited from the cylindrical shape of the fragments, we formulate the detection problem as an optimal process for fitting parameterized three-dimensional (3D) cylinder model to images. A RANSAC-based EM algorithm is proposed to find the optimal solution by converting the fragment detection procedure to an iterative closest point (ICP) matching procedure. The outer projection boundary of the estimated cylinder model is then fed to a region-based active contour model to robustly extract the contour of the fragment projection. The proposed algorithm has been successfully applied to real patient data with/without external objects, yielding promising results.

  3. Multi-color space threshold segmentation and self-learning k-NN algorithm for surge test EUT status identification

    NASA Astrophysics Data System (ADS)

    Huang, Jian; Liu, Gui-xiong

    2016-09-01

    The identification of targets varies in different surge tests. A multi-color space threshold segmentation and self-learning k-nearest neighbor algorithm ( k-NN) for equipment under test status identification was proposed after using feature matching to identify equipment status had to train new patterns every time before testing. First, color space (L*a*b*, hue saturation lightness (HSL), hue saturation value (HSV)) to segment was selected according to the high luminance points ratio and white luminance points ratio of the image. Second, the unknown class sample S r was classified by the k-NN algorithm with training set T z according to the feature vector, which was formed from number of pixels, eccentricity ratio, compactness ratio, and Euler's numbers. Last, while the classification confidence coefficient equaled k, made S r as one sample of pre-training set T z '. The training set T z increased to T z+1 by T z ' if T z ' was saturated. In nine series of illuminant, indicator light, screen, and disturbances samples (a total of 21600 frames), the algorithm had a 98.65%identification accuracy, also selected five groups of samples to enlarge the training set from T 0 to T 5 by itself.

  4. Comparative evaluation of a novel 3D segmentation algorithm on in-treatment radiotherapy cone beam CT images

    NASA Astrophysics Data System (ADS)

    Price, Gareth; Moore, Chris

    2007-03-01

    Image segmentation and delineation is at the heart of modern radiotherapy, where the aim is to deliver as high a radiation dose as possible to a cancerous target whilst sparing the surrounding healthy tissues. This, of course, requires that a radiation oncologist dictates both where the tumour and any nearby critical organs are located. As well as in treatment planning, delineation is of vital importance in image guided radiotherapy (IGRT): organ motion studies demand that features across image databases are accurately segmented, whilst if on-line adaptive IGRT is to become a reality, speedy and correct target identification is a necessity. Recently, much work has been put into the development of automatic and semi-automatic segmentation tools, often using prior knowledge to constrain some grey level, or derivative thereof, interrogation algorithm. It is hoped that such techniques can be applied to organ at risk and tumour segmentation in radiotherapy. In this work, however, we make the assumption that grey levels do not necessarily determine a tumour's extent, especially in CT where the attenuation coefficient can often vary little between cancerous and normal tissue. In this context we present an algorithm that generates a discontinuity free delineation surface driven by user placed, evidence based support points. In regions of sparse user supplied information, prior knowledge, in the form of a statistical shape model, provides guidance. A small case study is used to illustrate the method. Multiple observers (between 3 and 7) used both the presented tool and a commercial manual contouring package to delineate the bladder on a serially imaged (10 cone beam CT volumes ) prostate patient. A previously presented shape analysis technique is used to quantitatively compare the observer variability.

  5. BIANCA (Brain Intensity AbNormality Classification Algorithm): A new tool for automated segmentation of white matter hyperintensities.

    PubMed

    Griffanti, Ludovica; Zamboni, Giovanna; Khan, Aamira; Li, Linxin; Bonifacio, Guendalina; Sundaresan, Vaanathi; Schulz, Ursula G; Kuker, Wilhelm; Battaglini, Marco; Rothwell, Peter M; Jenkinson, Mark

    2016-11-01

    Reliable quantification of white matter hyperintensities of presumed vascular origin (WMHs) is increasingly needed, given the presence of these MRI findings in patients with several neurological and vascular disorders, as well as in elderly healthy subjects. We present BIANCA (Brain Intensity AbNormality Classification Algorithm), a fully automated, supervised method for WMH detection, based on the k-nearest neighbour (k-NN) algorithm. Relative to previous k-NN based segmentation methods, BIANCA offers different options for weighting the spatial information, local spatial intensity averaging, and different options for the choice of the number and location of the training points. BIANCA is multimodal and highly flexible so that the user can adapt the tool to their protocol and specific needs. We optimised and validated BIANCA on two datasets with different MRI protocols and patient populations (a "predominantly neurodegenerative" and a "predominantly vascular" cohort). BIANCA was first optimised on a subset of images for each dataset in terms of overlap and volumetric agreement with a manually segmented WMH mask. The correlation between the volumes extracted with BIANCA (using the optimised set of options), the volumes extracted from the manual masks and visual ratings showed that BIANCA is a valid alternative to manual segmentation. The optimised set of options was then applied to the whole cohorts and the resulting WMH volume estimates showed good correlations with visual ratings and with age. Finally, we performed a reproducibility test, to evaluate the robustness of BIANCA, and compared BIANCA performance against existing methods. Our findings suggest that BIANCA, which will be freely available as part of the FSL package, is a reliable method for automated WMH segmentation in large cross-sectional cohort studies. PMID:27402600

  6. Hepatic surgical anatomy.

    PubMed

    Skandalakis, John E; Skandalakis, Lee J; Skandalakis, Panajiotis N; Mirilas, Petros

    2004-04-01

    The liver, the largest organ in the body, has been misunderstood at nearly all levels of organization, and there is a tendency to ignore details that do not fit the preconception. A complete presentation of the surgical anatomy of the liver includes the study of hepatic surfaces, margins, and fissures; the various classifications of lobes and segments; and the vasculature and lymphatics. A brief overview of the intrahepatic biliary tract is also presented.

  7. Spatial Patterns of Trees from Airborne LiDAR Using a Simple Tree Segmentation Algorithm

    NASA Astrophysics Data System (ADS)

    Jeronimo, S.; Kane, V. R.; McGaughey, R. J.; Franklin, J. F.

    2015-12-01

    Objectives for management of forest ecosystems on public land incorporate a focus on maintenance and restoration of ecological functions through silvicultural manipulation of forest structure. The spatial pattern of residual trees - the horizontal element of structure - is a key component of ecological restoration prescriptions. We tested the ability of a simple LiDAR individual tree segmentation method - the watershed transform - to generate spatial pattern metrics similar to those obtained by the traditional method - ground-based stem mapping - on forested plots representing the structural diversity of a large wilderness area (Yosemite NP) and a large managed area (Sierra NF) in the Sierra Nevada, Calif. Most understory and intermediate-canopy trees were not detected by the LiDAR segmentation; however, LiDAR- and field-based assessments of spatial pattern in terms of tree clump size distributions largely agreed. This suggests that (1) even when individual tree segmentation is not effective for tree density estimates, it can provide a good measurement of tree spatial pattern, and (2) a simple segmentation method is adequate to measure spatial pattern of large areas with a diversity of structural characteristics. These results lay the groundwork for a LiDAR tool to assess clumping patterns across forest landscapes in support of restoration silviculture. This tool could describe spatial patterns of functionally intact reference ecosystems, measure departure from reference targets in treatment areas, and, with successive acquisitions, monitor treatment efficacy.

  8. A Benchmark Data Set to Evaluate the Illumination Robustness of Image Processing Algorithms for Object Segmentation and Classification.

    PubMed

    Khan, Arif Ul Maula; Mikut, Ralf; Reischl, Markus

    2015-01-01

    Developers of image processing routines rely on benchmark data sets to give qualitative comparisons of new image analysis algorithms and pipelines. Such data sets need to include artifacts in order to occlude and distort the required information to be extracted from an image. Robustness, the quality of an algorithm related to the amount of distortion is often important. However, using available benchmark data sets an evaluation of illumination robustness is difficult or even not possible due to missing ground truth data about object margins and classes and missing information about the distortion. We present a new framework for robustness evaluation. The key aspect is an image benchmark containing 9 object classes and the required ground truth for segmentation and classification. Varying levels of shading and background noise are integrated to distort the data set. To quantify the illumination robustness, we provide measures for image quality, segmentation and classification success and robustness. We set a high value on giving users easy access to the new benchmark, therefore, all routines are provided within a software package, but can as well easily be replaced to emphasize other aspects.

  9. Localization and segmentation of optic disc in retinal images using circular Hough transform and grow-cut algorithm

    PubMed Central

    Abdullah, Muhammad; Barman, Sarah A.

    2016-01-01

    Automated retinal image analysis has been emerging as an important diagnostic tool for early detection of eye-related diseases such as glaucoma and diabetic retinopathy. In this paper, we have presented a robust methodology for optic disc detection and boundary segmentation, which can be seen as the preliminary step in the development of a computer-assisted diagnostic system for glaucoma in retinal images. The proposed method is based on morphological operations, the circular Hough transform and the grow-cut algorithm. The morphological operators are used to enhance the optic disc and remove the retinal vasculature and other pathologies. The optic disc center is approximated using the circular Hough transform, and the grow-cut algorithm is employed to precisely segment the optic disc boundary. The method is quantitatively evaluated on five publicly available retinal image databases DRIVE, DIARETDB1, CHASE_DB1, DRIONS-DB, Messidor and one local Shifa Hospital Database. The method achieves an optic disc detection success rate of 100% for these databases with the exception of 99.09% and 99.25% for the DRIONS-DB, Messidor, and ONHSD databases, respectively. The optic disc boundary detection achieved an average spatial overlap of 78.6%, 85.12%, 83.23%, 85.1%, 87.93%, 80.1%, and 86.1%, respectively, for these databases. This unique method has shown significant improvement over existing methods in terms of detection and boundary extraction of the optic disc. PMID:27190713

  10. High-resolution CISS MR imaging with and without contrast for evaluation of the upper cranial nerves: segmental anatomy and selected pathologic conditions of the cisternal through extraforaminal segments.

    PubMed

    Blitz, Ari M; Macedo, Leonardo L; Chonka, Zachary D; Ilica, Ahmet T; Choudhri, Asim F; Gallia, Gary L; Aygun, Nafi

    2014-02-01

    The authors review the course and appearance of the major segments of the upper cranial nerves from their apparent origin at the brainstem through the proximal extraforaminal region, focusing on the imaging and anatomic features of particular relevance to high-resolution magnetic resonance imaging evaluation. Selected pathologic entities are included in the discussion of the corresponding cranial nerve segments for illustrative purposes.

  11. Facial anatomy.

    PubMed

    Marur, Tania; Tuna, Yakup; Demirci, Selman

    2014-01-01

    Dermatologic problems of the face affect both function and aesthetics, which are based on complex anatomical features. Treating dermatologic problems while preserving the aesthetics and functions of the face requires knowledge of normal anatomy. When performing successfully invasive procedures of the face, it is essential to understand its underlying topographic anatomy. This chapter presents the anatomy of the facial musculature and neurovascular structures in a systematic way with some clinically important aspects. We describe the attachments of the mimetic and masticatory muscles and emphasize their functions and nerve supply. We highlight clinically relevant facial topographic anatomy by explaining the course and location of the sensory and motor nerves of the face and facial vasculature with their relations. Additionally, this chapter reviews the recent nomenclature of the branching pattern of the facial artery.

  12. A new algorithm for segmentation of cardiac quiescent phases and cardiac time intervals using seismocardiography

    NASA Astrophysics Data System (ADS)

    Jafari Tadi, Mojtaba; Koivisto, Tero; Pänkäälä, Mikko; Paasio, Ari; Knuutila, Timo; Teräs, Mika; Hänninen, Pekka

    2015-03-01

    Systolic time intervals (STI) have significant diagnostic values for a clinical assessment of the left ventricle in adults. This study was conducted to explore the feasibility of using seismocardiography (SCG) to measure the systolic timings of the cardiac cycle accurately. An algorithm was developed for the automatic localization of the cardiac events (e.g. the opening and closing moments of the aortic and mitral valves). Synchronously acquired SCG and electrocardiography (ECG) enabled an accurate beat to beat estimation of the electromechanical systole (QS2), pre-ejection period (PEP) index and left ventricular ejection time (LVET) index. The performance of the algorithm was evaluated on a healthy test group with no evidence of cardiovascular disease (CVD). STI values were corrected based on Weissler's regression method in order to assess the correlation between the heart rate and STIs. One can see from the results that STIs correlate poorly with the heart rate (HR) on this test group. An algorithm was developed to visualize the quiescent phases of the cardiac cycle. A color map displaying the magnitude of SCG accelerations for multiple heartbeats visualizes the average cardiac motions and thereby helps to identify quiescent phases. High correlation between the heart rate and the duration of the cardiac quiescent phases was observed.

  13. Aerosol Plume Detection Algorithm Based on Image Segmentation of Scanning Atmospheric Lidar Data

    DOE PAGES

    Weekley, R. Andrew; Goodrich, R. Kent; Cornman, Larry B.

    2016-04-06

    An image-processing algorithm has been developed to identify aerosol plumes in scanning lidar backscatter data. The images in this case consist of lidar data in a polar coordinate system. Each full lidar scan is taken as a fixed image in time, and sequences of such scans are considered functions of time. The data are analyzed in both the original backscatter polar coordinate system and a lagged coordinate system. The lagged coordinate system is a scatterplot of two datasets, such as subregions taken from the same lidar scan (spatial delay), or two sequential scans in time (time delay). The lagged coordinatemore » system processing allows for finding and classifying clusters of data. The classification step is important in determining which clusters are valid aerosol plumes and which are from artifacts such as noise, hard targets, or background fields. These cluster classification techniques have skill since both local and global properties are used. Furthermore, more information is available since both the original data and the lag data are used. Performance statistics are presented for a limited set of data processed by the algorithm, where results from the algorithm were compared to subjective truth data identified by a human.« less

  14. Improving reliability of pQCT-derived muscle area and density measures using a watershed algorithm for muscle and fat segmentation.

    PubMed

    Wong, Andy Kin On; Hummel, Kayla; Moore, Cameron; Beattie, Karen A; Shaker, Sami; Craven, B Catharine; Adachi, Jonathan D; Papaioannou, Alexandra; Giangregorio, Lora

    2015-01-01

    In peripheral quantitative computed tomography scans of the calf muscles, segmentation of muscles from subcutaneous fat is challenged by muscle fat infiltration. Threshold-based edge detection segmentation by manufacturer software fails when muscle boundaries are not smooth. This study compared the test-retest precision error for muscle-fat segmentation using the threshold-based edge detection method vs manual segmentation guided by the watershed algorithm. Three clinical populations were investigated: younger adults, older adults, and adults with spinal cord injury (SCI). The watershed segmentation method yielded lower precision error (1.18%-2.01%) and higher (p<0.001) muscle density values (70.2±9.2 mg/cm3) compared with threshold-based edge detection segmentation (1.77%-4.06% error, 67.4±10.3 mg/cm3). This was particularly true for adults with SCI (precision error improved by 1.56% and 2.64% for muscle area and density, respectively). However, both methods still provided acceptable precision with error well under 5%. Bland-Altman analyses showed that the major discrepancies between the segmentation methods were found mostly among participants with SCI where more muscle fat infiltration was present. When examining a population where fatty infiltration into muscle is expected, the watershed algorithm is recommended for muscle density and area measurement to enable the detection of smaller change effect sizes. PMID:24996252

  15. Improving Reliability of pQCT-Derived Muscle Area and Density Measures Using a Watershed Algorithm for Muscle and Fat Segmentation

    PubMed Central

    Wong, Andy Kin On; Hummel, Kayla; Moore, Cameron; Beattie, Karen A.; Shaker, Sami; Craven, B. Catharine; Adachi, Jonathan D.; Papaioannou, Alexandra; Giangregorio, Lora

    2016-01-01

    In peripheral quantitative computed tomography scans of the calf muscles, segmentation of muscles from subcutaneous fat is challenged by muscle fat infiltration. Threshold-based edge detection segmentation by manufacturer software fails when muscle boundaries are not smooth. This study compared the test-retest precision error for muscle-fat segmentation using the threshold-based edge detection method vs manual segmentation guided by the watershed algorithm. Three clinical populations were investigated: younger adults, older adults, and adults with spinal cord injury (SCI). The watershed segmentation method yielded lower precision error (1.18%–2.01%) and higher (p < 0.001) muscle density values (70.2 ± 9.2 mg/cm3) compared with threshold-based edge detection segmentation (1.77%–4.06% error, 67.4 ± 10.3 mg/cm3). This was particularly true for adults with SCI (precision error improved by 1.56% and 2.64% for muscle area and density, respectively). However, both methods still provided acceptable precision with error well under 5%. Bland-Altman analyses showed that the major discrepancies between the segmentation methods were found mostly among participants with SCI where more muscle fat infiltration was present. When examining a population where fatty infiltration into muscle is expected, the watershed algorithm is recommended for muscle density and area measurement to enable the detection of smaller change effect sizes. PMID:24996252

  16. Robust Non-Local Multi-Atlas Segmentation of the Optic Nerve.

    PubMed

    Asman, Andrew J; Delisi, Michael P; Mawn; Galloway, Robert L; Landman, Bennett A

    2013-03-13

    Labeling or segmentation of structures of interest on medical images plays an essential role in both clinical and scientific understanding of the biological etiology, progression, and recurrence of pathological disorders. Here, we focus on the optic nerve, a structure that plays a critical role in many devastating pathological conditions - including glaucoma, ischemic neuropathy, optic neuritis and multiple-sclerosis. Ideally, existing fully automated procedures would result in accurate and robust segmentation of the optic nerve anatomy. However, current segmentation procedures often require manual intervention due to anatomical and imaging variability. Herein, we propose a framework for robust and fully-automated segmentation of the optic nerve anatomy. First, we provide a robust registration procedure that results in consistent registrations, despite highly varying data in terms of voxel resolution and image field-of-view. Additionally, we demonstrate the efficacy of a recently proposed non-local label fusion algorithm that accounts for small scale errors in registration correspondence. On a dataset consisting of 31 highly varying computed tomography (CT) images of the human brain, we demonstrate that the proposed framework consistently results in accurate segmentations. In particular, we show (1) that the proposed registration procedure results in robust registrations of the optic nerve anatomy, and (2) that the non-local statistical fusion algorithm significantly outperforms several of the state-of-the-art label fusion algorithms. PMID:24478826

  17. A novel method for retinal exudate segmentation using signal separation algorithm.

    PubMed

    Imani, Elaheh; Pourreza, Hamid-Reza

    2016-09-01

    Diabetic retinopathy is one of the major causes of blindness in the world. Early diagnosis of this disease is vital to the prevention of visual loss. The analysis of retinal lesions such as exudates, microaneurysms and hemorrhages is a prerequisite to detect diabetic disorders such as diabetic retinopathy and macular edema in fundus images. This paper presents an automatic method for the detection of retinal exudates. The novelty of this method lies in the use of Morphological Component Analysis (MCA) algorithm to separate lesions from normal retinal structures to facilitate the detection process. In the first stage, vessels are separated from lesions using the MCA algorithm with appropriate dictionaries. Then, the lesion part of retinal image is prepared for the detection of exudate regions. The final exudate map is created using dynamic thresholding and mathematical morphologies. Performance of the proposed method is measured on the three publicly available DiaretDB, HEI-MED and e-ophtha datasets. Accordingly, the AUC of 0.961 and 0.948 and 0.937 is achieved respectively, which are greater than most of the state-of-the-art methods.

  18. Liver Tumor Segmentation from MR Images Using 3D Fast Marching Algorithm and Single Hidden Layer Feedforward Neural Network.

    PubMed

    Le, Trong-Ngoc; Bao, Pham The; Huynh, Hieu Trung

    2016-01-01

    Objective. Our objective is to develop a computerized scheme for liver tumor segmentation in MR images. Materials and Methods. Our proposed scheme consists of four main stages. Firstly, the region of interest (ROI) image which contains the liver tumor region in the T1-weighted MR image series was extracted by using seed points. The noise in this ROI image was reduced and the boundaries were enhanced. A 3D fast marching algorithm was applied to generate the initial labeled regions which are considered as teacher regions. A single hidden layer feedforward neural network (SLFN), which was trained by a noniterative algorithm, was employed to classify the unlabeled voxels. Finally, the postprocessing stage was applied to extract and refine the liver tumor boundaries. The liver tumors determined by our scheme were compared with those manually traced by a radiologist, used as the "ground truth." Results. The study was evaluated on two datasets of 25 tumors from 16 patients. The proposed scheme obtained the mean volumetric overlap error of 27.43% and the mean percentage volume error of 15.73%. The mean of the average surface distance, the root mean square surface distance, and the maximal surface distance were 0.58 mm, 1.20 mm, and 6.29 mm, respectively. PMID:27597960

  19. Liver Tumor Segmentation from MR Images Using 3D Fast Marching Algorithm and Single Hidden Layer Feedforward Neural Network

    PubMed Central

    2016-01-01

    Objective. Our objective is to develop a computerized scheme for liver tumor segmentation in MR images. Materials and Methods. Our proposed scheme consists of four main stages. Firstly, the region of interest (ROI) image which contains the liver tumor region in the T1-weighted MR image series was extracted by using seed points. The noise in this ROI image was reduced and the boundaries were enhanced. A 3D fast marching algorithm was applied to generate the initial labeled regions which are considered as teacher regions. A single hidden layer feedforward neural network (SLFN), which was trained by a noniterative algorithm, was employed to classify the unlabeled voxels. Finally, the postprocessing stage was applied to extract and refine the liver tumor boundaries. The liver tumors determined by our scheme were compared with those manually traced by a radiologist, used as the “ground truth.” Results. The study was evaluated on two datasets of 25 tumors from 16 patients. The proposed scheme obtained the mean volumetric overlap error of 27.43% and the mean percentage volume error of 15.73%. The mean of the average surface distance, the root mean square surface distance, and the maximal surface distance were 0.58 mm, 1.20 mm, and 6.29 mm, respectively. PMID:27597960

  20. Segmentation and image navigation in digitized spine x rays

    NASA Astrophysics Data System (ADS)

    Long, L. Rodney; Thoma, George R.

    2000-06-01

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

  1. Development and Evaluation of an Algorithm for the Computer-Assisted Segmentation of the Human Hypothalamus on 7-Tesla Magnetic Resonance Images

    PubMed Central

    Schmidt, Laura; Anwander, Alfred; Strauß, Maria; Trampel, Robert; Bazin, Pierre-Louis; Möller, Harald E.; Hegerl, Ulrich; Turner, Robert; Geyer, Stefan

    2013-01-01

    Post mortem studies have shown volume changes of the hypothalamus in psychiatric patients. With 7T magnetic resonance imaging this effect can now be investigated in vivo in detail. To benefit from the sub-millimeter resolution requires an improved segmentation procedure. The traditional anatomical landmarks of the hypothalamus were refined using 7T T1-weighted magnetic resonance images. A detailed segmentation algorithm (unilateral hypothalamus) was developed for colour-coded, histogram-matched images, and evaluated in a sample of 10 subjects. Test-retest and inter-rater reliabilities were estimated in terms of intraclass-correlation coefficients (ICC) and Dice's coefficient (DC). The computer-assisted segmentation algorithm ensured test-retest reliabilities of ICC≥.97 (DC≥96.8) and inter-rater reliabilities of ICC≥.94 (DC = 95.2). There were no significant volume differences between the segmentation runs, raters, and hemispheres. The estimated volumes of the hypothalamus lie within the range of previous histological and neuroimaging results. We present a computer-assisted algorithm for the manual segmentation of the human hypothalamus using T1-weighted 7T magnetic resonance imaging. Providing very high test-retest and inter-rater reliabilities, it outperforms former procedures established at 1.5T and 3T magnetic resonance images and thus can serve as a gold standard for future automated procedures. PMID:23935821

  2. Segmentation algorithm for non-stationary compound Poisson processes. With an application to inventory time series of market members in a financial market

    NASA Astrophysics Data System (ADS)

    Tóth, B.; Lillo, F.; Farmer, J. D.

    2010-11-01

    We introduce an algorithm for the segmentation of a class of regime switching processes. The segmentation algorithm is a non parametric statistical method able to identify the regimes (patches) of a time series. The process is composed of consecutive patches of variable length. In each patch the process is described by a stationary compound Poisson process, i.e. a Poisson process where each count is associated with a fluctuating signal. The parameters of the process are different in each patch and therefore the time series is non-stationary. Our method is a generalization of the algorithm introduced by Bernaola-Galván, et al. [Phys. Rev. Lett. 87, 168105 (2001)]. We show that the new algorithm outperforms the original one for regime switching models of compound Poisson processes. As an application we use the algorithm to segment the time series of the inventory of market members of the London Stock Exchange and we observe that our method finds almost three times more patches than the original one.

  3. The Anatomy of Learning Anatomy

    ERIC Educational Resources Information Center

    Wilhelmsson, Niklas; Dahlgren, Lars Owe; Hult, Hakan; Scheja, Max; Lonka, Kirsti; Josephson, Anna

    2010-01-01

    The experience of clinical teachers as well as research results about senior medical students' understanding of basic science concepts has much been debated. To gain a better understanding about how this knowledge-transformation is managed by medical students, this work aims at investigating their ways of setting about learning anatomy.…

  4. Applying an Open-Source Segmentation Algorithm to Different OCT Devices in Multiple Sclerosis Patients and Healthy Controls: Implications for Clinical Trials.

    PubMed

    Bhargava, Pavan; Lang, Andrew; Al-Louzi, Omar; Carass, Aaron; Prince, Jerry; Calabresi, Peter A; Saidha, Shiv

    2015-01-01

    Background. The lack of segmentation algorithms operative across optical coherence tomography (OCT) platforms hinders utility of retinal layer measures in MS trials. Objective. To determine cross-sectional and longitudinal agreement of retinal layer thicknesses derived from an open-source, fully-automated, segmentation algorithm, applied to two spectral-domain OCT devices. Methods. Cirrus HD-OCT and Spectralis OCT macular scans from 68 MS patients and 22 healthy controls were segmented. A longitudinal cohort comprising 51 subjects (mean follow-up: 1.4 ± 0.9 years) was also examined. Bland-Altman analyses and interscanner agreement indices were utilized to assess agreement between scanners. Results. Low mean differences (-2.16 to 0.26 μm) and narrow limits of agreement (LOA) were noted for ganglion cell and inner and outer nuclear layer thicknesses cross-sectionally. Longitudinally we found low mean differences (-0.195 to 0.21 μm) for changes in all layers, with wider LOA. Comparisons of rate of change in layer thicknesses over time revealed consistent results between the platforms. Conclusions. Retinal thickness measures for the majority of the retinal layers agree well cross-sectionally and longitudinally between the two scanners at the cohort level, with greater variability at the individual level. This open-source segmentation algorithm enables combining data from different OCT platforms, broadening utilization of OCT as an outcome measure in MS trials. PMID:26090228

  5. White matter lesion segmentation using machine learning and weakly labeled MR images

    NASA Astrophysics Data System (ADS)

    Xie, Yuchen; Tao, Xiaodong

    2011-03-01

    We propose a fast, learning-based algorithm for segmenting white matter (WM) lesions for magnetic resonance (MR) brain images. The inputs to the algorithm are T1, T2, and FLAIR images. Unlike most of the previously reported learning-based algorithms, which treat expert labeled lesion map as ground truth in the training step, the proposed algorithm only requires the user to provide a few regions of interest (ROI's) containing lesions. An unsupervised clustering algorithm is applied to segment these ROI's into areas. Based on the assumption that lesion voxels have higher intensity on FLAIR image, areas corresponding to lesions are identified and their probability distributions in T1, T2, and FLAIR images are computed. The lesion segmentation in 3D is done by using the probability distributions to generate a confidence map of lesion and applying a graph based segmentation algorithm to label lesion voxels. The initial lesion label is used to further refine the probability distribution estimation for the final lesion segmentation. The advantages of the proposed algorithm are: 1. By using the weak labels, we reduced the dependency of the segmentation performance on the expert discrimination of lesion voxels in the training samples; 2. The training can be done using labels generated by users with only general knowledge of brain anatomy and image characteristics of WM lesion, instead of these carefully labeled by experienced radiologists; 3. The algorithm is fast enough to make interactive segmentation possible. We test the algorithm on nine ACCORD-MIND MRI datasets. Experimental results show that our algorithm agrees well with expert labels and outperforms a support vector machine based WM lesion segmentation algorithm.

  6. Feasibility of a semi-automated contrast-oriented algorithm for tumor segmentation in retrospectively gated PET images: phantom and clinical validation

    NASA Astrophysics Data System (ADS)

    Carles, Montserrat; Fechter, Tobias; Nemer, Ursula; Nanko, Norbert; Mix, Michael; Nestle, Ursula; Schaefer, Andrea

    2015-12-01

    PET/CT plays an important role in radiotherapy planning for lung tumors. Several segmentation algorithms have been proposed for PET tumor segmentation. However, most of them do not take into account respiratory motion and are not well validated. The aim of this work was to evaluate a semi-automated contrast-oriented algorithm (COA) for PET tumor segmentation adapted to retrospectively gated (4D) images. The evaluation involved a wide set of 4D-PET/CT acquisitions of dynamic experimental phantoms and lung cancer patients. In addition, segmentation accuracy of 4D-COA was compared with four other state-of-the-art algorithms. In phantom evaluation, the physical properties of the objects defined the gold standard. In clinical evaluation, the ground truth was estimated by the STAPLE (Simultaneous Truth and Performance Level Estimation) consensus of three manual PET contours by experts. Algorithm evaluation with phantoms resulted in: (i) no statistically significant diameter differences for different targets and movements (Δ φ =0.3+/- 1.6 mm); (ii) reproducibility for heterogeneous and irregular targets independent of user initial interaction and (iii) good segmentation agreement for irregular targets compared to manual CT delineation in terms of Dice Similarity Coefficient (DSC  =  0.66+/- 0.04 ), Positive Predictive Value (PPV  =  0.81+/- 0.06 ) and Sensitivity (Sen.  =  0.49+/- 0.05 ). In clinical evaluation, the segmented volume was in reasonable agreement with the consensus volume (difference in volume (%Vol)  =  40+/- 30 , DSC  =  0.71+/- 0.07 and PPV  =  0.90+/- 0.13 ). High accuracy in target tracking position (Δ ME) was obtained for experimental and clinical data (Δ ME{{}\\text{exp}}=0+/- 3 mm; Δ ME{{}\\text{clin}}=0.3+/- 1.4 mm). In the comparison with other lung segmentation methods, 4D-COA has shown the highest volume accuracy in both experimental and clinical data. In conclusion, the accuracy in volume

  7. Thymus Gland Anatomy

    MedlinePlus

    ... historical Searches are case-insensitive Thymus Gland, Adult, Anatomy Add to My Pictures View /Download : Small: 720x576 ... Large: 3000x2400 View Download Title: Thymus Gland, Adult, Anatomy Description: Anatomy of the thymus gland; drawing shows ...

  8. Normal Female Reproductive Anatomy

    MedlinePlus

    ... hyphen, e.g. -historical Searches are case-insensitive Reproductive System, Female, Anatomy Add to My Pictures View /Download : Small: ... Reproductive System, Female, Anatomy Description: Anatomy of the female reproductive system; drawing shows the uterus, myometrium (muscular outer layer ...

  9. Normal Pancreas Anatomy

    MedlinePlus

    ... hyphen, e.g. -historical Searches are case-insensitive Pancreas Anatomy Add to My Pictures View /Download : Small: ... 1586x1534 View Download Large: 3172x3068 View Download Title: Pancreas Anatomy Description: Anatomy of the pancreas; drawing shows ...

  10. Discuss on the two algorithms of line-segments and dot-array for region judgement of the sub-satellite purview

    NASA Astrophysics Data System (ADS)

    Nie, Hao; Yang, Mingming; Zhu, Yajie; Zhang, Peng

    2015-04-01

    When satellite is flying on the orbit for special task like solar flare observation, it requires knowing if the sub-satellite purview was in the ocean area. The relative position between sub-satellite point and the coastline is varying, so the observation condition need be judged in real time according to the current orbital elements. The problem is to solve the status of the relative position between the rectangle purview and the multi connected regions formed by the base data of coastline. Usually the Cohen-Sutherland algorithm is adopted to get the status. It divides the earth map to 9 sections by the four lines extended the rectangle sides. Then the coordinate of boundary points of the connected regions in which section should be confirmed. That method traverses all the boundary points for each judgement. In this paper, two algorithms are presented. The one is based on line-segments, another is based on dot-array. And the data preprocessing and judging procedure of the two methods are focused. The peculiarity of two methods is also analyzed. The method of line-segments treats the connected regions as a set of series line segments. In order to solve the problem, the terminals' coordinates of the rectangle purview and the line segments at the same latitude are compared. The method of dot-array translates the whole map to a binary image, which can be equal to a dot array. The value set of the sequence pixels in the dot array is gained. The value of the pixels in the rectangle purview is judged to solve the problem. Those two algorithms consume lower soft resource, and reduce much more comparing times because both of them do not need traverse all the boundary points. The analysis indicates that the real-time performance and consumed resource of the two algorithms are similar for the simple coastline, but the method of dot-array is the choice when coastline is quite complicated.

  11. Improving cerebellar segmentation with statistical fusion

    NASA Astrophysics Data System (ADS)

    Plassard, Andrew J.; Yang, Zhen; Prince, Jerry L.; Claassen, Daniel O.; Landman, Bennett A.

    2016-03-01

    The cerebellum is a somatotopically organized central component of the central nervous system well known to be involved with motor coordination and increasingly recognized roles in cognition and planning. Recent work in multiatlas labeling has created methods that offer the potential for fully automated 3-D parcellation of the cerebellar lobules and vermis (which are organizationally equivalent to cortical gray matter areas). This work explores the trade offs of using different statistical fusion techniques and post hoc optimizations in two datasets with distinct imaging protocols. We offer a novel fusion technique by extending the ideas of the Selective and Iterative Method for Performance Level Estimation (SIMPLE) to a patch-based performance model. We demonstrate the effectiveness of our algorithm, Non- Local SIMPLE, for segmentation of a mixed population of healthy subjects and patients with severe cerebellar anatomy. Under the first imaging protocol, we show that Non-Local SIMPLE outperforms previous gold-standard segmentation techniques. In the second imaging protocol, we show that Non-Local SIMPLE outperforms previous gold standard techniques but is outperformed by a non-locally weighted vote with the deeper population of atlases available. This work advances the state of the art in open source cerebellar segmentation algorithms and offers the opportunity for routinely including cerebellar segmentation in magnetic resonance imaging studies that acquire whole brain T1-weighted volumes with approximately 1 mm isotropic resolution.

  12. A novel algorithm based on visual saliency attention for localization and segmentation in rapidly-stained leukocyte images.

    PubMed

    Zheng, Xin; Wang, Yong; Wang, Guoyou; Chen, Zhong

    2014-01-01

    In this paper, we propose a fast hierarchical framework of leukocyte localization and segmentation in rapidly-stained leukocyte images (RSLI) with complex backgrounds and varying illumination. The proposed framework contains two main steps. First, a nucleus saliency model based on average absolute difference is built, which locates each leukocyte precisely while effectively removes dyeing impurities and erythrocyte fragments. Secondly, two different schemes are presented for segmenting the nuclei and cytoplasm respectively. As for nuclei segmentation, to solve the overlap problem between leukocytes, we extract the nucleus lobes first and further group them. The lobes extraction is realized by the histogram-based contrast map and watershed segmentation, taking into account the saliency and similarity of nucleus color. Meanwhile, as for cytoplasm segmentation, to extract the blurry contour of the cytoplasm under instable illumination, we propose a cytoplasm enhancement based on tri-modal histogram specification, which specifically improves the contrast of cytoplasm while maintaining others. Then, the contour of cytoplasm is quickly obtained by extraction based on parameter-controlled adaptive attention window. Furthermore, the contour is corrected by concave points matching in order to solve the overlap between leukocytes and impurities. The experiments show the effectiveness of the proposed nucleus saliency model, which achieves average localization accuracy with F1-measure greater than 95%. In addition, the comparison of single leukocyte segmentation accuracy and running time has demonstrated that the proposed segmentation scheme outperforms the former approaches in RSLI.

  13. Regulatory Anatomy

    PubMed Central

    2015-01-01

    This article proposes the term “safety logics” to understand attempts within the European Union (EU) to harmonize member state legislation to ensure a safe and stable supply of human biological material for transplants and transfusions. With safety logics, I refer to assemblages of discourses, legal documents, technological devices, organizational structures, and work practices aimed at minimizing risk. I use this term to reorient the analytical attention with respect to safety regulation. Instead of evaluating whether safety is achieved, the point is to explore the types of “safety” produced through these logics as well as to consider the sometimes unintended consequences of such safety work. In fact, the EU rules have been giving rise to complaints from practitioners finding the directives problematic and inadequate. In this article, I explore the problems practitioners face and why they arise. In short, I expose the regulatory anatomy of the policy landscape. PMID:26139952

  14. Quick Dissection of the Segmental Bronchi

    ERIC Educational Resources Information Center

    Nakajima, Yuji

    2010-01-01

    Knowledge of the three-dimensional anatomy of the bronchopulmonary segments is essential for respiratory medicine. This report describes a quick guide for dissecting the segmental bronchi in formaldehyde-fixed human material. All segmental bronchi are easy to dissect, and thus, this exercise will help medical students to better understand the…

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

    PubMed

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

    2012-10-01

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

  16. Algorithm for localized adaptive diffuse optical tomography and its application in bioluminescence tomography

    NASA Astrophysics Data System (ADS)

    Naser, Mohamed A.; Patterson, Michael S.; Wong, John W.

    2014-04-01

    A reconstruction algorithm for diffuse optical tomography based on diffusion theory and finite element method is described. The algorithm reconstructs the optical properties in a permissible domain or region-of-interest to reduce the number of unknowns. The algorithm can be used to reconstruct optical properties for a segmented object (where a CT-scan or MRI is available) or a non-segmented object. For the latter, an adaptive segmentation algorithm merges contiguous regions with similar optical properties thereby reducing the number of unknowns. In calculating the Jacobian matrix the algorithm uses an efficient direct method so the required time is comparable to that needed for a single forward calculation. The reconstructed optical properties using segmented, non-segmented, and adaptively segmented 3D mouse anatomy (MOBY) are used to perform bioluminescence tomography (BLT) for two simulated internal sources. The BLT results suggest that the accuracy of reconstruction of total source power obtained without the segmentation provided by an auxiliary imaging method such as x-ray CT is comparable to that obtained when using perfect segmentation.

  17. Anatomy of the Eye

    MedlinePlus

    ... Conditions Frequently Asked Questions Español Condiciones Chinese Conditions Anatomy of the Eye En Español Read in Chinese External (Extraocular) Anatomy Extraocular Muscles: There are six muscles that are ...

  18. GPU-based relative fuzzy connectedness image segmentation

    SciTech Connect

    Zhuge Ying; Ciesielski, Krzysztof C.; Udupa, Jayaram K.; Miller, Robert W.

    2013-01-15

    Purpose:Recently, clinical radiological research and practice are becoming increasingly quantitative. Further, images continue to increase in size and volume. For quantitative radiology to become practical, it is crucial that image segmentation algorithms and their implementations are rapid and yield practical run time on very large data sets. The purpose of this paper is to present a parallel version of an algorithm that belongs to the family of fuzzy connectedness (FC) algorithms, to achieve an interactive speed for segmenting large medical image data sets. Methods: The most common FC segmentations, optimizing an Script-Small-L {sub {infinity}}-based energy, are known as relative fuzzy connectedness (RFC) and iterative relative fuzzy connectedness (IRFC). Both RFC and IRFC objects (of which IRFC contains RFC) can be found via linear time algorithms, linear with respect to the image size. The new algorithm, P-ORFC (for parallel optimal RFC), which is implemented by using NVIDIA's Compute Unified Device Architecture (CUDA) platform, considerably improves the computational speed of the above mentioned CPU based IRFC algorithm. Results: Experiments based on four data sets of small, medium, large, and super data size, achieved speedup factors of 32.8 Multiplication-Sign , 22.9 Multiplication-Sign , 20.9 Multiplication-Sign , and 17.5 Multiplication-Sign , correspondingly, on the NVIDIA Tesla C1060 platform. Although the output of P-ORFC need not precisely match that of IRFC output, it is very close to it and, as the authors prove, always lies between the RFC and IRFC objects. Conclusions: A parallel version of a top-of-the-line algorithm in the family of FC has been developed on the NVIDIA GPUs. An interactive speed of segmentation has been achieved, even for the largest medical image data set. Such GPU implementations may play a crucial role in automatic anatomy recognition in clinical radiology.

  19. Interior segment regrowth configurational-bias algorithm for the efficient sampling and fast relaxation of coarse-grained polyethylene and polyoxyethylene melts on a high coordination lattice

    NASA Astrophysics Data System (ADS)

    Rane, Sagar S.; Mattice, Wayne L.

    2005-06-01

    We demonstrate the application of a modified form of the configurational-bias algorithm for the simulation of chain molecules on the second-nearest-neighbor-diamond lattice. Using polyethylene and poly(ethylene-oxide) as model systems we show that the present configurational-bias algorithm can increase the speed of the equilibration by at least a factor of 2-3 or more as compared to the previous method of using a combination of single-bead and pivot moves along with the Metropolis sampling scheme [N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, J. Chem. Phys. 21, 1087 (1953)]. The increase in the speed of the equilibration is found to be dependent on the interactions (i.e., the polymer being simulated) and the molecular weight of the chains. In addition, other factors not considered, such as the density, would also have a significant effect. The algorithm is an extension of the conventional configurational-bias method adapted to the regrowth of interior segments of chain molecules. Appropriate biasing probabilities for the trial moves as outlined by Jain and de Pablo for the configurational-bias scheme of chain ends, suitably modified for the interior segments, are utilized [T. S. Jain and J. J. de Pablo, in Simulation Methods for Polymers, edited by M. Kotelyanskii and D. N. Theodorou (Marcel Dekker, New York, 2004), pp. 223-255]. The biasing scheme satisfies the condition of detailed balance and produces efficient sampling with the correct equilibrium probability distribution of states. The method of interior regrowth overcomes the limitations of the original configurational-bias scheme and allows for the simulation of polymers of higher molecular weight linear chains and ring polymers which lack chain ends.

  20. [The development of anatomy].

    PubMed

    Colović, R; Colović, N

    2001-01-01

    Doctors, particularly surgeons, realise the enormous importance of good knowledge of human anatomy today. It was not so in the past when doctors showed little or no interest for human anatomy for centuries. Dissections of the human body, necessary to study human anatomy, were either forbidden or limited to the corpses of criminals on whom capital punishment was carried out. The authors give a chronology of the development of human anatomy until 19. century when dissections of the human body became almost universally regulated with positive legislation. After the "golden age of surgery" began in 1870. surgeons gave an enormous contribution to anatomy.

  1. A Comparison of Amplitude-Based and Phase-Based Positron Emission Tomography Gating Algorithms for Segmentation of Internal Target Volumes of Tumors Subject to Respiratory Motion

    SciTech Connect

    Jani, Shyam S.; Robinson, Clifford G.; Dahlbom, Magnus; White, Benjamin M.; Thomas, David H.; Gaudio, Sergio; Low, Daniel A.; Lamb, James M.

    2013-11-01

    Purpose: To quantitatively compare the accuracy of tumor volume segmentation in amplitude-based and phase-based respiratory gating algorithms in respiratory-correlated positron emission tomography (PET). Methods and Materials: List-mode fluorodeoxyglucose-PET data was acquired for 10 patients with a total of 12 fluorodeoxyglucose-avid tumors and 9 lymph nodes. Additionally, a phantom experiment was performed in which 4 plastic butyrate spheres with inner diameters ranging from 1 to 4 cm were imaged as they underwent 1-dimensional motion based on 2 measured patient breathing trajectories. PET list-mode data were gated into 8 bins using 2 amplitude-based (equal amplitude bins [A1] and equal counts per bin [A2]) and 2 temporal phase-based gating algorithms. Gated images were segmented using a commercially available gradient-based technique and a fixed 40% threshold of maximum uptake. Internal target volumes (ITVs) were generated by taking the union of all 8 contours per gated image. Segmented phantom ITVs were compared with their respective ground-truth ITVs, defined as the volume subtended by the tumor model positions covering 99% of breathing amplitude. Superior-inferior distances between sphere centroids in the end-inhale and end-exhale phases were also calculated. Results: Tumor ITVs from amplitude-based methods were significantly larger than those from temporal-based techniques (P=.002). For lymph nodes, A2 resulted in ITVs that were significantly larger than either of the temporal-based techniques (P<.0323). A1 produced the largest and most accurate ITVs for spheres with diameters of ≥2 cm (P=.002). No significant difference was shown between algorithms in the 1-cm sphere data set. For phantom spheres, amplitude-based methods recovered an average of 9.5% more motion displacement than temporal-based methods under regular breathing conditions and an average of 45.7% more in the presence of baseline drift (P<.001). Conclusions: Target volumes in images generated

  2. Quantification of Right and Left Ventricular Function in Cardiac MR Imaging: Comparison of Semiautomatic and Manual Segmentation Algorithms.

    PubMed

    Souto, Miguel; Masip, Lambert Raul; Couto, Miguel; Suárez-Cuenca, Jorge Juan; Martínez, Amparo; Tahoces, Pablo G; Carreira, Jose Martin; Croisille, Pierre

    2013-01-01

    The purpose of this study was to evaluate the performance of a semiautomatic segmentation method for the anatomical and functional assessment of both ventricles from cardiac cine magnetic resonance (MR) examinations, reducing user interaction to a "mouse-click". Fifty-two patients with cardiovascular diseases were examined using a 1.5-T MR imaging unit. Several parameters of both ventricles, such as end-diastolic volume (EDV), end-systolic volume (ESV) and ejection fraction (EF), were quantified by an experienced operator using the conventional method based on manually-defined contours, as the standard of reference; and a novel semiautomatic segmentation method based on edge detection, iterative thresholding and region growing techniques, for evaluation purposes. No statistically significant differences were found between the two measurement values obtained for each parameter (p > 0.05). Correlation to estimate right ventricular function was good (r > 0.8) and turned out to be excellent (r > 0.9) for the left ventricle (LV). Bland-Altman plots revealed acceptable limits of agreement between the two methods (95%). Our study findings indicate that the proposed technique allows a fast and accurate assessment of both ventricles. However, further improvements are needed to equal results achieved for the right ventricle (RV) using the conventional methodology. PMID:26835680

  3. Intensity-based skeletonization of CryoEM gray-scale images using a true segmentation-free algorithm.

    PubMed

    Al Nasr, Kamal; Liu, Chunmei; Rwebangira, Mugizi; Burge, Legand; He, Jing

    2013-01-01

    Cryo-electron microscopy is an experimental technique that is able to produce 3D gray-scale images of protein molecules. In contrast to other experimental techniques, cryo-electron microscopy is capable of visualizing large molecular complexes such as viruses and ribosomes. At medium resolution, the positions of the atoms are not visible and the process cannot proceed. The medium-resolution images produced by cryo-electron microscopy are used to derive the atomic structure of the proteins in de novo modeling. The skeletons of the 3D gray-scale images are used to interpret important information that is helpful in de novo modeling. Unfortunately, not all features of the image can be captured using a single segmentation. In this paper, we present a segmentation-free approach to extract the gray-scale curve-like skeletons. The approach relies on a novel representation of the 3D image, where the image is modeled as a graph and a set of volume trees. A test containing 36 synthesized maps and one authentic map shows that our approach can improve the performance of the two tested tools used in de novo modeling. The improvements were 62 and 13 percent for Gorgon and DP-TOSS, respectively.

  4. Quantification of Right and Left Ventricular Function in Cardiac MR Imaging: Comparison of Semiautomatic and Manual Segmentation Algorithms

    PubMed Central

    Souto, Miguel; Masip, Lambert Raul; Couto, Miguel; Suárez-Cuenca, Jorge Juan; Martínez, Amparo; Tahoces, Pablo G.; Carreira, Jose Martin; Croisille, Pierre

    2013-01-01

    The purpose of this study was to evaluate the performance of a semiautomatic segmentation method for the anatomical and functional assessment of both ventricles from cardiac cine magnetic resonance (MR) examinations, reducing user interaction to a “mouse-click”. Fifty-two patients with cardiovascular diseases were examined using a 1.5-T MR imaging unit. Several parameters of both ventricles, such as end-diastolic volume (EDV), end-systolic volume (ESV) and ejection fraction (EF), were quantified by an experienced operator using the conventional method based on manually-defined contours, as the standard of reference; and a novel semiautomatic segmentation method based on edge detection, iterative thresholding and region growing techniques, for evaluation purposes. No statistically significant differences were found between the two measurement values obtained for each parameter (p > 0.05). Correlation to estimate right ventricular function was good (r > 0.8) and turned out to be excellent (r > 0.9) for the left ventricle (LV). Bland-Altman plots revealed acceptable limits of agreement between the two methods (95%). Our study findings indicate that the proposed technique allows a fast and accurate assessment of both ventricles. However, further improvements are needed to equal results achieved for the right ventricle (RV) using the conventional methodology. PMID:26835680

  5. Segmentation of the whole breast from low-dose chest CT images

    NASA Astrophysics Data System (ADS)

    Liu, Shuang; Salvatore, Mary; Yankelevitz, David F.; Henschke, Claudia I.; Reeves, Anthony P.

    2015-03-01

    The segmentation of whole breast serves as the first step towards automated breast lesion detection. It is also necessary for automatically assessing the breast density, which is considered to be an important risk factor for breast cancer. In this paper we present a fully automated algorithm to segment the whole breast in low-dose chest CT images (LDCT), which has been recommended as an annual lung cancer screening test. The automated whole breast segmentation and potential breast density readings as well as lesion detection in LDCT will provide useful information for women who have received LDCT screening, especially the ones who have not undergone mammographic screening, by providing them additional risk indicators for breast cancer with no additional radiation exposure. The two main challenges to be addressed are significant range of variations in terms of the shape and location of the breast in LDCT and the separation of pectoral muscles from the glandular tissues. The presented algorithm achieves robust whole breast segmentation using an anatomy directed rule-based method. The evaluation is performed on 20 LDCT scans by comparing the segmentation with ground truth manually annotated by a radiologist on one axial slice and two sagittal slices for each scan. The resulting average Dice coefficient is 0.880 with a standard deviation of 0.058, demonstrating that the automated segmentation algorithm achieves results consistent with manual annotations of a radiologist.

  6. Computerized segmentation algorithm with personalized atlases of murine MRIs in a SV40 large T-antigen mouse mammary cancer model

    NASA Astrophysics Data System (ADS)

    Sibley, Adam R.; Markiewicz, Erica; Mustafi, Devkumar; Fan, Xiaobing; Conzen, Suzanne; Karczmar, Greg; Giger, Maryellen L.

    2016-03-01

    Quantities of MRI data, much larger than can be objectively and efficiently analyzed manually, are routinely generated in preclinical research. We aim to develop an automated image segmentation and registration pipeline to aid in analysis of image data from our high-throughput 9.4 Tesla small animal MRI imaging center. T2-weighted, fat-suppressed MRIs were acquired over 4 life-cycle time-points [up to 12 to 18 weeks] of twelve C3(1) SV40 Large T-antigen mice for a total of 46 T2-weighted MRI volumes; each with a matrix size of 192 x 256, 62 slices, in plane resolution 0.1 mm, and slice thickness 0.5 mm. These image sets were acquired with the goal of tracking and quantifying progression of mammary intraepithelial neoplasia (MIN) to invasive cancer in mice, believed to be similar to ductal carcinoma in situ (DCIS) in humans. Our segmentation algorithm takes 2D seed-points drawn by the user at the center of the 4 co-registered volumes associated with each mouse. The level set then evolves in 3D from these 2D seeds. The contour evolution incorporates texture information, edge information, and a statistical shape model in a two-step process. Volumetric DICE coefficients comparing the automatic with manual segmentations were computed and ranged between 0.75 and 0.58 for averages over the 4 life-cycle time points of the mice. Incorporation of these personalized atlases with intra and inter mouse registration is expected to enable locally and globally tracking of the morphological and textural changes in the mammary tissue and associated lesions of these mice.

  7. Multi-atlas segmentation for abdominal organs with Gaussian mixture models

    NASA Astrophysics Data System (ADS)

    Burke, Ryan P.; Xu, Zhoubing; Lee, Christopher P.; Baucom, Rebeccah B.; Poulose, Benjamin K.; Abramson, Richard G.; Landman, Bennett A.

    2015-03-01

    Abdominal organ segmentation with clinically acquired computed tomography (CT) is drawing increasing interest in the medical imaging community. Gaussian mixture models (GMM) have been extensively used through medical segmentation, most notably in the brain for cerebrospinal fluid / gray matter / white matter differentiation. Because abdominal CT exhibit strong localized intensity characteristics, GMM have recently been incorporated in multi-stage abdominal segmentation algorithms. In the context of variable abdominal anatomy and rich algorithms, it is difficult to assess the marginal contribution of GMM. Herein, we characterize the efficacy of an a posteriori framework that integrates GMM of organ-wise intensity likelihood with spatial priors from multiple target-specific registered labels. In our study, we first manually labeled 100 CT images. Then, we assigned 40 images to use as training data for constructing target-specific spatial priors and intensity likelihoods. The remaining 60 images were evaluated as test targets for segmenting 12 abdominal organs. The overlap between the true and the automatic segmentations was measured by Dice similarity coefficient (DSC). A median improvement of 145% was achieved by integrating the GMM intensity likelihood against the specific spatial prior. The proposed framework opens the opportunities for abdominal organ segmentation by efficiently using both the spatial and appearance information from the atlases, and creates a benchmark for large-scale automatic abdominal segmentation.

  8. Optimization of automated segmentation of monkeypox virus-induced lung lesions from normal lung CT images using hard C-means algorithm

    NASA Astrophysics Data System (ADS)

    Castro, Marcelo A.; Thomasson, David; Avila, Nilo A.; Hufton, Jennifer; Senseney, Justin; Johnson, Reed F.; Dyall, Julie

    2013-03-01

    Monkeypox virus is an emerging zoonotic pathogen that results in up to 10% mortality in humans. Knowledge of clinical manifestations and temporal progression of monkeypox disease is limited to data collected from rare outbreaks in remote regions of Central and West Africa. Clinical observations show that monkeypox infection resembles variola infection. Given the limited capability to study monkeypox disease in humans, characterization of the disease in animal models is required. A previous work focused on the identification of inflammatory patterns using PET/CT image modality in two non-human primates previously inoculated with the virus. In this work we extended techniques used in computer-aided detection of lung tumors to identify inflammatory lesions from monkeypox virus infection and their progression using CT images. Accurate estimation of partial volumes of lung lesions via segmentation is difficult because of poor discrimination between blood vessels, diseased regions, and outer structures. We used hard C-means algorithm in conjunction with landmark based registration to estimate the extent of monkeypox virus induced disease before inoculation and after disease progression. Automated estimation is in close agreement with manual segmentation.

  9. Improving the robustness of interventional 4D ultrasound segmentation through the use of personalized prior shape models

    NASA Astrophysics Data System (ADS)

    Barbosa, Daniel; Queirós, Sandro; Morais, Pedro; Baptista, Maria J.; Monaghan, Mark; Rodrigues, Nuno F.; D'hooge, Jan; Vilaça, João. L.

    2015-03-01

    While fluoroscopy is still the most widely used imaging modality to guide cardiac interventions, the fusion of pre-operative Magnetic Resonance Imaging (MRI) with real-time intra-operative ultrasound (US) is rapidly gaining clinical acceptance as a viable, radiation-free alternative. In order to improve the detection of the left ventricular (LV) surface in 4D ultrasound, we propose to take advantage of the pre-operative MRI scans to extract a realistic geometrical model representing the patients cardiac anatomy. This could serve as prior information in the interventional setting, allowing to increase the accuracy of the anatomy extraction step in US data. We have made use of a real-time 3D segmentation framework used in the recent past to solve the LV segmentation problem in MR and US data independently and we take advantage of this common link to introduce the prior information as a soft penalty term in the ultrasound segmentation algorithm. We tested the proposed algorithm in a clinical dataset of 38 patients undergoing both MR and US scans. The introduction of the personalized shape prior improves the accuracy and robustness of the LV segmentation, as supported by the error reduction when compared to core lab manual segmentation of the same US sequences.

  10. Computer-aided measurement of liver volumes in CT by means of geodesic active contour segmentation coupled with level-set algorithms

    SciTech Connect

    Suzuki, Kenji; Kohlbrenner, Ryan; Epstein, Mark L.; Obajuluwa, Ademola M.; Xu Jianwu; Hori, Masatoshi

    2010-05-15

    Purpose: Computerized liver extraction from hepatic CT images is challenging because the liver often abuts other organs of a similar density. The purpose of this study was to develop a computer-aided measurement of liver volumes in hepatic CT. Methods: The authors developed a computerized liver extraction scheme based on geodesic active contour segmentation coupled with level-set contour evolution. First, an anisotropic diffusion filter was applied to portal-venous-phase CT images for noise reduction while preserving the liver structure, followed by a scale-specific gradient magnitude filter to enhance the liver boundaries. Then, a nonlinear grayscale converter enhanced the contrast of the liver parenchyma. By using the liver-parenchyma-enhanced image as a speed function, a fast-marching level-set algorithm generated an initial contour that roughly estimated the liver shape. A geodesic active contour segmentation algorithm coupled with level-set contour evolution refined the initial contour to define the liver boundaries more precisely. The liver volume was then calculated using these refined boundaries. Hepatic CT scans of 15 prospective liver donors were obtained under a liver transplant protocol with a multidetector CT system. The liver volumes extracted by the computerized scheme were compared to those traced manually by a radiologist, used as ''gold standard.''Results: The mean liver volume obtained with our scheme was 1504 cc, whereas the mean gold standard manual volume was 1457 cc, resulting in a mean absolute difference of 105 cc (7.2%). The computer-estimated liver volumetrics agreed excellently with the gold-standard manual volumetrics (intraclass correlation coefficient was 0.95) with no statistically significant difference (F=0.77; p(F{<=}f)=0.32). The average accuracy, sensitivity, specificity, and percent volume error were 98.4%, 91.1%, 99.1%, and 7.2%, respectively. Computerized CT liver volumetry would require substantially less completion time

  11. Robust optic nerve segmentation on clinically acquired CT

    NASA Astrophysics Data System (ADS)

    Panda, Swetasudha; Asman, Andrew J.; DeLisi, Michael P.; Mawn, Louise A.; Galloway, Robert L.; Landman, Bennett A.

    2014-03-01

    The optic nerve is a sensitive central nervous system structure, which plays a critical role in many devastating pathological conditions. Several methods have been proposed in recent years to segment the optic nerve automatically, but progress toward full automation has been limited. Multi-atlas methods have been successful for brain segmentation, but their application to smaller anatomies remains relatively unexplored. Herein we evaluate a framework for robust and fully automated segmentation of the optic nerves, eye globes and muscles. We employ a robust registration procedure for accurate registrations, variable voxel resolution and image fieldof- view. We demonstrate the efficacy of an optimal combination of SyN registration and a recently proposed label fusion algorithm (Non-local Spatial STAPLE) that accounts for small-scale errors in registration correspondence. On a dataset containing 30 highly varying computed tomography (CT) images of the human brain, the optimal registration and label fusion pipeline resulted in a median Dice similarity coefficient of 0.77, symmetric mean surface distance error of 0.55 mm, symmetric Hausdorff distance error of 3.33 mm for the optic nerves. Simultaneously, we demonstrate the robustness of the optimal algorithm by segmenting the optic nerve structure in 316 CT scans obtained from 182 subjects from a thyroid eye disease (TED) patient population.

  12. Anatomy of the lymphatics.

    PubMed

    Skandalakis, John E; Skandalakis, Lee J; Skandalakis, Panagiotis N

    2007-01-01

    The lymphatic system is perhaps the most complicated system of Homo sapiens. An introduction to the anatomy, embryology, and anomalies of the lymphatics is presented. The overall anatomy and drainage of the lymphatic vessels in outlined. The topographic anatomy, relations, and variations of the principle vessels of the lymphatic system (the right lymphatic duct, the thoracic duct, and the cisterna chyli) are presented in detail.

  13. Image Information Mining Utilizing Hierarchical Segmentation

    NASA Technical Reports Server (NTRS)

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

    2002-01-01

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

  14. The road surveying system of the federal highway research institute - a performance evaluation of road segmentation algorithms

    NASA Astrophysics Data System (ADS)

    Streiter, R.; Wanielik, G.

    2013-07-01

    The construction of highways and federal roadways is subject to many restrictions and designing rules. The focus is on safety, comfort and smooth driving. Unfortunately, the planning information for roadways and their real constitution, course and their number of lanes and lane widths is often unsure or not available. Due to digital map databases of roads raised much interest during the last years and became one major cornerstone of innovative Advanced Driving Assistance Systems (ADASs), the demand for accurate and detailed road information increases considerably. Within this project a measurement system for collecting high accurate road data was developed. This paper gives an overview about the sensor configuration within the measurement vehicle, introduces the implemented algorithms and shows some applications implemented in the post processing platform. The aim is to recover the origin parametric description of the roadway and the performance of the measurement system is being evaluated against several original road construction information.

  15. Head segmentation in vertebrates

    PubMed Central

    Kuratani, Shigeru; Schilling, Thomas

    2008-01-01

    Classic theories of vertebrate head segmentation clearly exemplify the idealistic nature of comparative embryology prior to the 20th century. Comparative embryology aimed at recognizing the basic, primary structure that is shared by all vertebrates, either as an archetype or an ancestral developmental pattern. Modern evolutionary developmental (Evo-Devo) studies are also based on comparison, and therefore have a tendency to reduce complex embryonic anatomy into overly simplified patterns. Here again, a basic segmental plan for the head has been sought among chordates. We convened a symposium that brought together leading researchers dealing with this problem, in a number of different evolutionary and developmental contexts. Here we give an overview of the outcome and the status of the field in this modern era of Evo-Devo. We emphasize the fact that the head segmentation problem is not fully resolved, and we discuss new directions in the search for hints for a way out of this maze. PMID:20607135

  16. Anatomy Comic Strips

    ERIC Educational Resources Information Center

    Park, Jin Seo; Kim, Dae Hyun; Chung, Min Suk

    2011-01-01

    Comics are powerful visual messages that convey immediate visceral meaning in ways that conventional texts often cannot. This article's authors created comic strips to teach anatomy more interestingly and effectively. Four-frame comic strips were conceptualized from a set of anatomy-related humorous stories gathered from the authors' collective…

  17. Spatially adapted augmentation of age-specific atlas-based segmentation using patch-based priors

    NASA Astrophysics Data System (ADS)

    Liu, Mengyuan; Seshamani, Sharmishtaa; Harrylock, Lisa; Kitsch, Averi; Miller, Steven; Chau, Van; Poskitt, Kenneth; Rousseau, Francois; Studholme, Colin

    2014-03-01

    One of the most common approaches to MRI brain tissue segmentation is to employ an atlas prior to initialize an Expectation- Maximization (EM) image labeling scheme using a statistical model of MRI intensities. This prior is commonly derived from a set of manually segmented training data from the population of interest. However, in cases where subject anatomy varies significantly from the prior anatomical average model (for example in the case where extreme developmental abnormalities or brain injuries occur), the prior tissue map does not provide adequate information about the observed MRI intensities to ensure the EM algorithm converges to an anatomically accurate labeling of the MRI. In this paper, we present a novel approach for automatic segmentation of such cases. This approach augments the atlas-based EM segmentation by exploring methods to build a hybrid tissue segmentation scheme that seeks to learn where an atlas prior fails (due to inadequate representation of anatomical variation in the statistical atlas) and utilize an alternative prior derived from a patch driven search of the atlas data. We describe a framework for incorporating this patch-based augmentation of EM (PBAEM) into a 4D age-specific atlas-based segmentation of developing brain anatomy. The proposed approach was evaluated on a set of MRI brain scans of premature neonates with ages ranging from 27.29 to 46.43 gestational weeks (GWs). Results indicated superior performance compared to the conventional atlas-based segmentation method, providing improved segmentation accuracy for gray matter, white matter, ventricles and sulcal CSF regions.

  18. Anatomy comic strips.

    PubMed

    Park, Jin Seo; Kim, Dae Hyun; Chung, Min Suk

    2011-01-01

    Comics are powerful visual messages that convey immediate visceral meaning in ways that conventional texts often cannot. This article's authors created comic strips to teach anatomy more interestingly and effectively. Four-frame comic strips were conceptualized from a set of anatomy-related humorous stories gathered from the authors' collective imagination. The comics were drawn on paper and then recreated with digital graphics software. More than 500 comic strips have been drawn and labeled in Korean language, and some of them have been translated into English. All comic strips can be viewed on the Department of Anatomy homepage at the Ajou University School of Medicine, Suwon, Republic of Korea. The comic strips were written and drawn by experienced anatomists, and responses from viewers have generally been favorable. These anatomy comic strips, designed to help students learn the complexities of anatomy in a straightforward and humorous way, are expected to be improved further by the authors and other interested anatomists.

  19. Auxiliary anatomical labels for joint segmentation and atlas registration

    NASA Astrophysics Data System (ADS)

    Gass, Tobias; Szekely, Gabor; Goksel, Orcun

    2014-03-01

    This paper studies improving joint segmentation and registration by introducing auxiliary labels for anatomy that has similar appearance to the target anatomy while not being part of that target. Such auxiliary labels help avoid false positive labelling of non-target anatomy by resolving ambiguity. A known registration of a segmented atlas can help identify where a target segmentation should lie. Conversely, segmentations of anatomy in two images can help them be better registered. Joint segmentation and registration is then a method that can leverage information from both registration and segmentation to help one another. It has received increasing attention recently in the literature. Often, merely a single organ of interest is labelled in the atlas. In the presense of other anatomical structures with similar appearance, this leads to ambiguity in intensity based segmentation; for example, when segmenting individual bones in CT images where other bones share the same intensity profile. To alleviate this problem, we introduce automatic generation of additional labels in atlas segmentations, by marking similar-appearance non-target anatomy with an auxiliary label. Information from the auxiliary-labeled atlas segmentation is then incorporated by using a novel coherence potential, which penalizes differences between the deformed atlas segmentation and the target segmentation estimate. We validated this on a joint segmentation-registration approach that iteratively alternates between registering an atlas and segmenting the target image to find a final anatomical segmentation. The results show that automatic auxiliary labelling outperforms the same approach using a single label atlasses, for both mandibular bone segmentation in 3D-CT and corpus callosum segmentation in 2D-MRI.

  20. Image segmentation using random features

    NASA Astrophysics Data System (ADS)

    Bull, Geoff; Gao, Junbin; Antolovich, Michael

    2014-01-01

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

  1. Image segmentation and registration algorithm to collect thoracic skeleton semilandmarks for characterization of age and sex-based thoracic morphology variation.

    PubMed

    Weaver, Ashley A; Nguyen, Callistus M; Schoell, Samantha L; Maldjian, Joseph A; Stitzel, Joel D

    2015-12-01

    Thoracic anthropometry variations with age and sex have been reported and likely relate to thoracic injury risk and outcome. The objective of this study was to collect a large volume of homologous semilandmark data from the thoracic skeleton for the purpose of quantifying thoracic morphology variations for males and females of ages 0-100 years. A semi-automated image segmentation and registration algorithm was applied to collect homologous thoracic skeleton semilandmarks from 343 normal computed tomography (CT) scans. Rigid, affine, and symmetric diffeomorphic transformations were used to register semilandmarks from an atlas to homologous locations in the subject-specific coordinate system. Homologous semilandmarks were successfully collected from 92% (7077) of the ribs and 100% (187) of the sternums included in the study. Between 2700 and 11,000 semilandmarks were collected from each rib and sternum and over 55 million total semilandmarks were collected from all subjects. The extensive landmark data collected more fully characterizes thoracic skeleton morphology across ages and sexes. Characterization of thoracic morphology with age and sex may help explain variations in thoracic injury risk and has important implications for vulnerable populations such as pediatrics and the elderly.

  2. Skull Base Anatomy.

    PubMed

    Patel, Chirag R; Fernandez-Miranda, Juan C; Wang, Wei-Hsin; Wang, Eric W

    2016-02-01

    The anatomy of the skull base is complex with multiple neurovascular structures in a small space. Understanding all of the intricate relationships begins with understanding the anatomy of the sphenoid bone. The cavernous sinus contains the carotid artery and some of its branches; cranial nerves III, IV, VI, and V1; and transmits venous blood from multiple sources. The anterior skull base extends to the frontal sinus and is important to understand for sinus surgery and sinonasal malignancies. The clivus protects the brainstem and posterior cranial fossa. A thorough appreciation of the anatomy of these various areas allows for endoscopic endonasal approaches to the skull base.

  3. Segmentation and Image Analysis of Abnormal Lungs at CT: Current Approaches, Challenges, and Future Trends.

    PubMed

    Mansoor, Awais; Bagci, Ulas; Foster, Brent; Xu, Ziyue; Papadakis, Georgios Z; Folio, Les R; Udupa, Jayaram K; Mollura, Daniel J

    2015-01-01

    The computer-based process of identifying the boundaries of lung from surrounding thoracic tissue on computed tomographic (CT) images, which is called segmentation, is a vital first step in radiologic pulmonary image analysis. Many algorithms and software platforms provide image segmentation routines for quantification of lung abnormalities; however, nearly all of the current image segmentation approaches apply well only if the lungs exhibit minimal or no pathologic conditions. When moderate to high amounts of disease or abnormalities with a challenging shape or appearance exist in the lungs, computer-aided detection systems may be highly likely to fail to depict those abnormal regions because of inaccurate segmentation methods. In particular, abnormalities such as pleural effusions, consolidations, and masses often cause inaccurate lung segmentation, which greatly limits the use of image processing methods in clinical and research contexts. In this review, a critical summary of the current methods for lung segmentation on CT images is provided, with special emphasis on the accuracy and performance of the methods in cases with abnormalities and cases with exemplary pathologic findings. The currently available segmentation methods can be divided into five major classes: (a) thresholding-based, (b) region-based, (c) shape-based, (d) neighboring anatomy-guided, and (e) machine learning-based methods. The feasibility of each class and its shortcomings are explained and illustrated with the most common lung abnormalities observed on CT images. In an overview, practical applications and evolving technologies combining the presented approaches for the practicing radiologist are detailed.

  4. Pancreas and cyst segmentation

    NASA Astrophysics Data System (ADS)

    Dmitriev, Konstantin; Gutenko, Ievgeniia; Nadeem, Saad; Kaufman, Arie

    2016-03-01

    Accurate segmentation of abdominal organs from medical images is an essential part of surgical planning and computer-aided disease diagnosis. Many existing algorithms are specialized for the segmentation of healthy organs. Cystic pancreas segmentation is especially challenging due to its low contrast boundaries, variability in shape, location and the stage of the pancreatic cancer. We present a semi-automatic segmentation algorithm for pancreata with cysts. In contrast to existing automatic segmentation approaches for healthy pancreas segmentation which are amenable to atlas/statistical shape approaches, a pancreas with cysts can have even higher variability with respect to the shape of the pancreas due to the size and shape of the cyst(s). Hence, fine results are better attained with semi-automatic steerable approaches. We use a novel combination of random walker and region growing approaches to delineate the boundaries of the pancreas and cysts with respective best Dice coefficients of 85.1% and 86.7%, and respective best volumetric overlap errors of 26.0% and 23.5%. Results show that the proposed algorithm for pancreas and pancreatic cyst segmentation is accurate and stable.

  5. Comparison of a Gross Anatomy Laboratory to Online Anatomy Software for Teaching Anatomy

    ERIC Educational Resources Information Center

    Mathiowetz, Virgil; Yu, Chih-Huang; Quake-Rapp, Cindee

    2016-01-01

    This study was designed to assess the grades, self-perceived learning, and satisfaction between occupational therapy students who used a gross anatomy laboratory versus online anatomy software (AnatomyTV) as tools to learn anatomy at a large public university and a satellite campus in the mid-western United States. The goal was to determine if…

  6. Anatomy and art.

    PubMed

    Laios, Konstantinos; Tsoukalas, Gregory; Karamanou, Marianna; Androutsos, George

    2013-01-01

    Leonardo da Vinci, Jean Falcon, Andreas Vesalius, Henry Gray, Henry Vandyke Carter and Frank Netter created some of the best atlases of anatomy. Their works constitute not only scientific medical projects but also masterpieces of art. PMID:24640589

  7. Anatomy of the Brain

    MedlinePlus

    ... our existence. It controls our personality, thoughts, memory, intelligence, speech and understanding, emotions, senses, and basic body functions, as well as how we function in our environment. The diagrams below show brain anatomy, or the various parts of the brain, ...

  8. Automated generation of directed graphs from vascular segmentations.

    PubMed

    Chapman, Brian E; Berty, Holly P; Schulthies, Stuart L

    2015-08-01

    Automated feature extraction from medical images is an important task in imaging informatics. We describe a graph-based technique for automatically identifying vascular substructures within a vascular tree segmentation. We illustrate our technique using vascular segmentations from computed tomography pulmonary angiography images. The segmentations were acquired in a semi-automated fashion using existing segmentation tools. A 3D parallel thinning algorithm was used to generate the vascular skeleton and then graph-based techniques were used to transform the skeleton to a directed graph with bifurcations and endpoints as nodes in the graph. Machine-learning classifiers were used to automatically prune false vascular structures from the directed graph. Semantic labeling of portions of the graph with pulmonary anatomy (pulmonary trunk and left and right pulmonary arteries) was achieved with high accuracy (percent correct⩾0.97). Least-squares cubic splines of the centerline paths between nodes were computed and were used to extract morphological features of the vascular tree. The graphs were used to automatically obtain diameter measurements that had high correlation (r⩾0.77) with manual measurements made from the same arteries. PMID:26165778

  9. Evidence-Based Anatomy

    PubMed Central

    Yammine, Kaissar

    2014-01-01

    Anatomy is a descriptive basic medical science that is no longer considered a research-led discipline. Many publications in clinical anatomy are prevalence studies treating clinically relevant anatomical variations and reporting their frequencies and/or associations with variables such as age, sex, side, laterality, and ancestry. This article discusses the need to make sense of the available literature. A new concept, evidence-based anatomy (EBA), is proposed to find, appraise, and synthetize the results reported in such publications. It consists in applying evidence-based principles to the field of epidemiological anatomy research through evidence synthesis using systematic reviews and meta-analyses to generate weighted pooled results. Pooled frequencies and associations based on large pooled sample size are likely to be more accurate and to reflect true population statistics and associations more closely. A checklist of a typical systematic review in anatomy is suggested and the implications of EBA for practice and future research, along with its scope, are discussed. The EBA approach would have positive implications for the future preservation of anatomy as a keystone basic science, for sound knowledge of anatomical variants, and for the safety of medical practice. Clin. Anat. 27:847–852, 2014. PMID:24797314

  10. Manually segmented template library for 8-year-old pediatric brain MRI data with 16 subcortical structures

    PubMed Central

    Garg, Amanmeet; Wong, Darren; Popuri, Karteek; Poskitt, Kenneth J.; Fitzpatrick, Kevin; Bjornson, Bruce; Grunau, Ruth E.; Beg, Mirza Faisal

    2014-01-01

    Abstract. Manual segmentation of anatomy in brain MRI data taken to be the closest to the “gold standard” in quality is often used in automated registration-based segmentation paradigms for transfer of template labels onto the unlabeled MRI images. This study presents a library of template data with 16 subcortical structures in the central brain area which were manually labeled for MRI data from 22 children (8 male, mean age=8±0.6  years). The lateral ventricle, thalamus, caudate, putamen, hippocampus, cerebellum, third vevntricle, fourth ventricle, brainstem, and corpuscallosum were segmented by two expert raters. Cross-validation experiments with randomized template subset selection were conducted to test for their ability to accurately segment MRI data under an automated segmentation pipeline. A high value of the dice similarity coefficient (0.86±0.06, min=0.74, max=0.96) and small Hausdorff distance (3.33±4.24, min=0.63, max=25.24) of the automated segmentation against the manual labels was obtained on this template library data. Additionally, comparison with segmentation obtained from adult templates showed significant improvement in accuracy with the use of an age-matched library in this cohort. A manually delineated pediatric template library such as the one described here could provide a useful benchmark for testing segmentation algorithms. PMID:26158067

  11. Manually segmented template library for 8-year-old pediatric brain MRI data with 16 subcortical structures.

    PubMed

    Garg, Amanmeet; Wong, Darren; Popuri, Karteek; Poskitt, Kenneth J; Fitzpatrick, Kevin; Bjornson, Bruce; Grunau, Ruth E; Beg, Mirza Faisal

    2014-10-01

    Manual segmentation of anatomy in brain MRI data taken to be the closest to the "gold standard" in quality is often used in automated registration-based segmentation paradigms for transfer of template labels onto the unlabeled MRI images. This study presents a library of template data with 16 subcortical structures in the central brain area which were manually labeled for MRI data from 22 children (8 male, [Formula: see text]). The lateral ventricle, thalamus, caudate, putamen, hippocampus, cerebellum, third vevntricle, fourth ventricle, brainstem, and corpuscallosum were segmented by two expert raters. Cross-validation experiments with randomized template subset selection were conducted to test for their ability to accurately segment MRI data under an automated segmentation pipeline. A high value of the dice similarity coefficient ([Formula: see text], [Formula: see text], [Formula: see text]) and small Hausdorff distance ([Formula: see text], [Formula: see text], [Formula: see text]) of the automated segmentation against the manual labels was obtained on this template library data. Additionally, comparison with segmentation obtained from adult templates showed significant improvement in accuracy with the use of an age-matched library in this cohort. A manually delineated pediatric template library such as the one described here could provide a useful benchmark for testing segmentation algorithms.

  12. Phasing a segmented telescope

    NASA Astrophysics Data System (ADS)

    Paykin, Irina; Yacobi, Lee; Adler, Joan; Ribak, Erez N.

    2015-02-01

    A crucial part of segmented or multiple-aperture systems is control of the optical path difference between the segments or subapertures. In order to achieve optimal performance we have to phase subapertures to within a fraction of the wavelength, and this requires high accuracy of positioning for each subaperture. We present simulations and hardware realization of a simulated annealing algorithm in an active optical system with sparse segments. In order to align the optical system we applied the optimization algorithm to the image itself. The main advantage of this method over traditional correction methods is that wave-front-sensing hardware and software are no longer required, making the optical and mechanical system much simpler. The results of simulations and laboratory experiments demonstrate the ability of this optimization algorithm to correct both piston and tip-tilt errors.

  13. Geometry Guided Segmentation

    NASA Astrophysics Data System (ADS)

    Dunn, Stanley M.; Liang, Tajen

    1989-03-01

    Our overall goal is to develop an image understanding system for automatically interpreting dental radiographs. This paper describes the module that integrates the intrinsic image data to form the region adjacency graph that represents the image. The specific problem is to develop a robust method for segmenting the image into small regions that do not overlap anatomical boundaries. Classical algorithms for finding homogeneous regions (i.e., 2 class segmentation or connected components) will not always yield correct results since blurred edges can cause adjacent anatomical regions to be labeled as one region. This defect is a problem in this and other applications where an object count is necessary. Our solution to the problem is to guide the segmentation by intrinsic properties of the constituent objects. The module takes a set of intrinsic images as arguments. A connected components-like algorithm is performed, but the connectivity relation is not 4- or 8-neighbor connectivity in binary images; the connectivity is defined in terms of the intrinsic image data. We shall describe both the classical method and the modified segmentation procedures, and present experiments using both algorithms. Our experiments show that for the dental radiographs a segmentation using gray level data in conjunction with edges of the surfaces of teeth give a robust and reliable segmentation.

  14. Keypoint Transfer Segmentation

    PubMed Central

    Toews, M.; Langs, G.; Wells, W.; Golland, P.

    2015-01-01

    We present an image segmentation method that transfers label maps of entire organs from the training images to the novel image to be segmented. The transfer is based on sparse correspondences between keypoints that represent automatically identified distinctive image locations. Our segmentation algorithm consists of three steps: (i) keypoint matching, (ii) voting-based keypoint labeling, and (iii) keypoint-based probabilistic transfer of organ label maps. We introduce generative models for the inference of keypoint labels and for image segmentation, where keypoint matches are treated as a latent random variable and are marginalized out as part of the algorithm. We report segmentation results for abdominal organs in whole-body CT and in contrast-enhanced CT images. The accuracy of our method compares favorably to common multi-atlas segmentation while offering a speed-up of about three orders of magnitude. Furthermore, keypoint transfer requires no training phase or registration to an atlas. The algorithm’s robustness enables the segmentation of scans with highly variable field-of-view. PMID:26221677

  15. [Laurentius on anatomy].

    PubMed

    Sawai, Tadashi; Sakai, Tatsuo

    2005-03-01

    Andreas Laurentius wrote Opera anatomica (1593) and Historia anatomica (1600). These books were composed of two types of chapters; 'historia' and 'quaestio'. His description is not original, but take from other anatomists. 'Historia' describes the structure, action and usefulness of the body parts clarified after dissection. 'Quaestio' treats those questions which could not be solved only by dissection. Laurentius cited many previous contradicting interpretations to these questions and choose a best interpretation for the individual questions. In most cases, Laurentius preferred Galen's view. Historia anatomica retained almost all the 'historia' and 'quaestio' from Opera anatomica, and added some new 'historia' and 'quaestio', especially in regard to the components of the body, such as ligaments, membranes, vessels, nerves and glands. Other new 'historia' and 'quaestio' in Historia anatomica concerned several topics on anatomy in general to comprehensively analyze the history of anatomy, methods of anatomy, and usefulness of anatomy. Historia anatomica reviewed what was anatomy by describing in 'historia' what was known and in 'quaestio' what was unresolved. Till now Laurentius's anatomical works have attracted little attention because his description contained few original findings and depended on previous books. However, the important fact that Historia anatomica was very popular in the 17th century tells us that people needed non-original and handbook style of this textbook. Historia anatomica is important for further research on the propagation of anatomical knowledge from professional anatomists to non-professionals in the 17th century.

  16. The Drosophila anatomy ontology

    PubMed Central

    2013-01-01

    Background Anatomy ontologies are query-able classifications of anatomical structures. They provide a widely-used means for standardising the annotation of phenotypes and expression in both human-readable and programmatically accessible forms. They are also frequently used to group annotations in biologically meaningful ways. Accurate annotation requires clear textual definitions for terms, ideally accompanied by images. Accurate grouping and fruitful programmatic usage requires high-quality formal definitions that can be used to automate classification and check for errors. The Drosophila anatomy ontology (DAO) consists of over 8000 classes with broad coverage of Drosophila anatomy. It has been used extensively for annotation by a range of resources, but until recently it was poorly formalised and had few textual definitions. Results We have transformed the DAO into an ontology rich in formal and textual definitions in which the majority of classifications are automated and extensive error checking ensures quality. Here we present an overview of the content of the DAO, the patterns used in its formalisation, and the various uses it has been put to. Conclusions As a result of the work described here, the DAO provides a high-quality, queryable reference for the wild-type anatomy of Drosophila melanogaster and a set of terms to annotate data related to that anatomy. Extensive, well referenced textual definitions make it both a reliable and useful reference and ensure accurate use in annotation. Wide use of formal axioms allows a large proportion of classification to be automated and the use of consistency checking to eliminate errors. This increased formalisation has resulted in significant improvements to the completeness and accuracy of classification. The broad use of both formal and informal definitions make further development of the ontology sustainable and scalable. The patterns of formalisation used in the DAO are likely to be useful to developers of other

  17. Exercises in anatomy: cardiac isomerism.

    PubMed

    Anderson, Robert H; Sarwark, Anne E; Spicer, Diane E; Backer, Carl L

    2014-01-01

    It is well recognized that the patients with the most complex cardiac malformations are those with so-called visceral heterotaxy. At present, it remains a fact that most investigators segregate these patients on the basis of their splenic anatomy, describing syndromes of so-called asplenia and polysplenia. It has also been known for quite some time, nonetheless, that the morphology of the tracheobronchial tree is usually isomeric in the setting of heterotaxy. And it has been shown that the isomerism found in terms of bronchial arrangement correlates in a better fashion with the cardiac anatomy than does the presence of multiple spleens, or the absence of any splenic tissue. In this exercise in anatomy, we use hearts from the Idriss archive of Lurie Children's Hospital in Chicago to demonstrate the isomeric features found in the hearts obtained from patients known to have had heterotaxy. We first demonstrate the normal arrangements, showing how it is the extent of the pectinate muscles in the atrial appendages relative to the atrioventricular junctions that distinguishes between morphologically right and left atrial chambers. We also show the asymmetry of the normal bronchial tree, and the relationships of the first bronchial branches to the pulmonary arteries supplying the lower lobes of the lungs. We then demonstrate that diagnosis of multiple spleens requires the finding of splenic tissue on either side of the dorsal mesogastrium. Turning to hearts obtained from patients with heterotaxy, we illustrate isomeric right and left atrial appendages. We emphasize that it is only the appendages that are universally isomeric, but point out that other features support the notion of cardiac isomerism. We then show that description also requires a full account of veno-atrial connections, since these can seemingly be mirror-imaged when the arrangement within the heart is one of isomerism of the atrial appendages. We show how failure to recognize the presence of such isomeric

  18. Comparison of a gross anatomy laboratory to online anatomy software for teaching anatomy.

    PubMed

    Mathiowetz, Virgil; Yu, Chih-Huang; Quake-Rapp, Cindee

    2016-01-01

    This study was designed to assess the grades, self-perceived learning, and satisfaction between occupational therapy students who used a gross anatomy laboratory versus online anatomy software (AnatomyTV) as tools to learn anatomy at a large public university and a satellite campus in the mid-western United States. The goal was to determine if equivalent learning outcomes could be achieved regardless of learning tool used. In addition, it was important to determine why students chose the gross anatomy laboratory over online AnatomyTV. A two group, post-test only design was used with data gathered at the end of the course. Primary outcomes were students' grades, self-perceived learning, and satisfaction. In addition, a survey was used to collect descriptive data. One cadaver prosection was available for every four students in the gross anatomy laboratory. AnatomyTV was available online through the university library. At the conclusion of the course, the gross anatomy laboratory group had significantly higher grade percentage, self-perceived learning, and satisfaction than the AnatomyTV group. However, the practical significance of the difference is debatable. The significantly greater time spent in gross anatomy laboratory during the laboratory portion of the course may have affected the study outcomes. In addition, some students may find the difference in (B+) versus (A-) grade as not practically significant. Further research needs to be conducted to identify what specific anatomy teaching resources are most effective beyond prosection for students without access to a gross anatomy laboratory.

  19. Human Perception in Segmentation of Sketches

    NASA Astrophysics Data System (ADS)

    Company, Pedro; Varley, Peter A. C.; Piquer, Ana; Vergara, Margarita; Sánchez-Rubio, Jaime

    In this paper, we study the segmentation of sketched engineering drawings into a set of straight and curved segments. Our immediate objective is to produce a benchmarking method for segmentation algorithms. The criterion is to minimise the differences between what the algorithm detects and what human beings perceive. We have created a set of sketched drawings and have asked people to segment them. By analysis of the produced segmentations, we have obtained the number and locations of the segmentation points which people perceive. Evidence collected during our experiments supports useful hypotheses, for example that not all kinds of segmentation points are equally difficult to perceive. The resulting methodology can be repeated with other drawings to obtain a set of sketches and segmentation data which could be used as a benchmark for segmentation algorithms, to evaluate their capability to emulate human perception of sketches.

  20. Gebiss: an ImageJ plugin for the specification of ground truth and the performance evaluation of 3D segmentation algorithms

    PubMed Central

    2011-01-01

    Background Image segmentation is a crucial step in quantitative microscopy that helps to define regions of tissues, cells or subcellular compartments. Depending on the degree of user interactions, segmentation methods can be divided into manual, automated or semi-automated approaches. 3D image stacks usually require automated methods due to their large number of optical sections. However, certain applications benefit from manual or semi-automated approaches. Scenarios include the quantification of 3D images with poor signal-to-noise ratios or the generation of so-called ground truth segmentations that are used to evaluate the accuracy of automated segmentation methods. Results We have developed Gebiss; an ImageJ plugin for the interactive segmentation, visualisation and quantification of 3D microscopic image stacks. We integrated a variety of existing plugins for threshold-based segmentation and volume visualisation. Conclusions We demonstrate the application of Gebiss to the segmentation of nuclei in live Drosophila embryos and the quantification of neurodegeneration in Drosophila larval brains. Gebiss was developed as a cross-platform ImageJ plugin and is freely available on the web at http://imaging.bii.a-star.edu.sg/projects/gebiss/. PMID:21668958

  1. Learning Anatomy Enhances Spatial Ability

    ERIC Educational Resources Information Center

    Vorstenbosch, Marc A. T. M.; Klaassen, Tim P. F. M.; Donders, A. R. T.; Kooloos, Jan G. M.; Bolhuis, Sanneke M.; Laan, Roland F. J. M.

    2013-01-01

    Spatial ability is an important factor in learning anatomy. Students with high scores on a mental rotation test (MRT) systematically score higher on anatomy examinations. This study aims to investigate if learning anatomy also oppositely improves the MRT-score. Five hundred first year students of medicine ("n" = 242, intervention) and…

  2. An Automated Three-Dimensional Detection and Segmentation Method for Touching Cells by Integrating Concave Points Clustering and Random Walker Algorithm

    PubMed Central

    Gong, Hui; Chen, Shangbin; Zhang, Bin; Ding, Wenxiang; Luo, Qingming; Li, Anan

    2014-01-01

    Characterizing cytoarchitecture is crucial for understanding brain functions and neural diseases. In neuroanatomy, it is an important task to accurately extract cell populations' centroids and contours. Recent advances have permitted imaging at single cell resolution for an entire mouse brain using the Nissl staining method. However, it is difficult to precisely segment numerous cells, especially those cells touching each other. As presented herein, we have developed an automated three-dimensional detection and segmentation method applied to the Nissl staining data, with the following two key steps: 1) concave points clustering to determine the seed points of touching cells; and 2) random walker segmentation to obtain cell contours. Also, we have evaluated the performance of our proposed method with several mouse brain datasets, which were captured with the micro-optical sectioning tomography imaging system, and the datasets include closely touching cells. Comparing with traditional detection and segmentation methods, our approach shows promising detection accuracy and high robustness. PMID:25111442

  3. Anatomy of the Honeybee

    ERIC Educational Resources Information Center

    Postiglione, Ralph

    1977-01-01

    In this insect morphology exercise, students study the external anatomy of the worker honeybee. The structures listed and illustrated are discussed in relation to their functions. A goal of the exercise is to establish the bee as a well-adapted, social insect. (MA)

  4. The Anatomy Puzzle Book.

    ERIC Educational Resources Information Center

    Jacob, Willis H.; Carter, Robert, III

    This document features review questions, crossword puzzles, and word search puzzles on human anatomy. Topics include: (1) Anatomical Terminology; (2) The Skeletal System and Joints; (3) The Muscular System; (4) The Nervous System; (5) The Eye and Ear; (6) The Circulatory System and Blood; (7) The Respiratory System; (8) The Urinary System; (9) The…

  5. Anatomy for Biomedical Engineers

    ERIC Educational Resources Information Center

    Carmichael, Stephen W.; Robb, Richard A.

    2008-01-01

    There is a perceived need for anatomy instruction for graduate students enrolled in a biomedical engineering program. This appeared especially important for students interested in and using medical images. These students typically did not have a strong background in biology. The authors arranged for students to dissect regions of the body that…

  6. Illustrated Speech Anatomy.

    ERIC Educational Resources Information Center

    Shearer, William M.

    Written for students in the fields of speech correction and audiology, the text deals with the following: structures involved in respiration; the skeleton and the processes of inhalation and exhalation; phonation and pitch, the larynx, and esophageal speech; muscles involved in articulation; muscles involved in resonance; and the anatomy of the…

  7. Functional female pelvic anatomy.

    PubMed

    Klutke, C G; Siegel, C L

    1995-08-01

    This article reviews important aspects of female pelvic anatomy with particular emphasis on the structures important for pelvic organ support and urinary control. The pelvis and supporting structures, the pelvic floor, and the relationships of the pelvic organs are described and illustrated by MR imaging.

  8. Segmentation of elastic organs using region growing

    NASA Astrophysics Data System (ADS)

    Widita, R.; Kurniadi, R.; Darma, Y.; Perkasa, Y. S.; Trianti, N.

    2012-06-01

    We have been successfully developed a new software for image segmentation This software is addressed to do segmentation of elastic organs. The segmentation components used in this software is region growing algorithms which have proven to be an effective approach for image segmentation. The implementations of region growing developed here are connected threshold and neighborhood connected. The results show that the neighborhood algorithm affects the smoothness of the segmented object borders, the size of the segmented region, and reduces computing time. Our method is designed to perform with clinically acceptable speed, using accelerated techniques.

  9. Segmentation of anatomical branching structures based on texture features and conditional random field

    NASA Astrophysics Data System (ADS)

    Nuzhnaya, Tatyana; Bakic, Predrag; Kontos, Despina; Megalooikonomou, Vasileios; Ling, Haibin

    2012-02-01

    This work is a part of our ongoing study aimed at understanding a relation between the topology of anatomical branching structures with the underlying image texture. Morphological variability of the breast ductal network is associated with subsequent development of abnormalities in patients with nipple discharge such as papilloma, breast cancer and atypia. In this work, we investigate complex dependence among ductal components to perform segmentation, the first step for analyzing topology of ductal lobes. Our automated framework is based on incorporating a conditional random field with texture descriptors of skewness, coarseness, contrast, energy and fractal dimension. These features are selected to capture the architectural variability of the enhanced ducts by encoding spatial variations between pixel patches in galactographic image. The segmentation algorithm was applied to a dataset of 20 x-ray galactograms obtained at the Hospital of the University of Pennsylvania. We compared the performance of the proposed approach with fully and semi automated segmentation algorithms based on neural network classification, fuzzy-connectedness, vesselness filter and graph cuts. Global consistency error and confusion matrix analysis were used as accuracy measurements. For the proposed approach, the true positive rate was higher and the false negative rate was significantly lower compared to other fully automated methods. This indicates that segmentation based on CRF incorporated with texture descriptors has potential to efficiently support the analysis of complex topology of the ducts and aid in development of realistic breast anatomy phantoms.

  10. Parallel Fuzzy Segmentation of Multiple Objects.

    PubMed

    Garduño, Edgar; Herman, Gabor T

    2008-01-01

    The usefulness of fuzzy segmentation algorithms based on fuzzy connectedness principles has been established in numerous publications. New technologies are capable of producing larger-and-larger datasets and this causes the sequential implementations of fuzzy segmentation algorithms to be time-consuming. We have adapted a sequential fuzzy segmentation algorithm to multi-processor machines. We demonstrate the efficacy of such a distributed fuzzy segmentation algorithm by testing it with large datasets (of the order of 50 million points/voxels/items): a speed-up factor of approximately five over the sequential implementation seems to be the norm. PMID:19444333

  11. Parallel Fuzzy Segmentation of Multiple Objects*

    PubMed Central

    Garduño, Edgar; Herman, Gabor T.

    2009-01-01

    The usefulness of fuzzy segmentation algorithms based on fuzzy connectedness principles has been established in numerous publications. New technologies are capable of producing larger-and-larger datasets and this causes the sequential implementations of fuzzy segmentation algorithms to be time-consuming. We have adapted a sequential fuzzy segmentation algorithm to multi-processor machines. We demonstrate the efficacy of such a distributed fuzzy segmentation algorithm by testing it with large datasets (of the order of 50 million points/voxels/items): a speed-up factor of approximately five over the sequential implementation seems to be the norm. PMID:19444333

  12. Segmentation of stereo terrain images

    NASA Astrophysics Data System (ADS)

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

    2000-06-01

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

  13. Automated segmentation of cardiac visceral fat in low-dose non-contrast chest CT images

    NASA Astrophysics Data System (ADS)

    Xie, Yiting; Liang, Mingzhu; Yankelevitz, David F.; Henschke, Claudia I.; Reeves, Anthony P.

    2015-03-01

    Cardiac visceral fat was segmented from low-dose non-contrast chest CT images using a fully automated method. Cardiac visceral fat is defined as the fatty tissues surrounding the heart region, enclosed by the lungs and posterior to the sternum. It is measured by constraining the heart region with an Anatomy Label Map that contains robust segmentations of the lungs and other major organs and estimating the fatty tissue within this region. The algorithm was evaluated on 124 low-dose and 223 standard-dose non-contrast chest CT scans from two public datasets. Based on visual inspection, 343 cases had good cardiac visceral fat segmentation. For quantitative evaluation, manual markings of cardiac visceral fat regions were made in 3 image slices for 45 low-dose scans and the Dice similarity coefficient (DSC) was computed. The automated algorithm achieved an average DSC of 0.93. Cardiac visceral fat volume (CVFV), heart region volume (HRV) and their ratio were computed for each case. The correlation between cardiac visceral fat measurement and coronary artery and aortic calcification was also evaluated. Results indicated the automated algorithm for measuring cardiac visceral fat volume may be an alternative method to the traditional manual assessment of thoracic region fat content in the assessment of cardiovascular disease risk.

  14. Automatic segmentation of cartilage in high-field magnetic resonance images of the knee joint with an improved voxel-classification-driven region-growing algorithm using vicinity-correlated subsampling.

    PubMed

    Öztürk, Ceyda Nur; Albayrak, Songül

    2016-05-01

    Anatomical structures that can deteriorate over time, such as cartilage, can be successfully delineated with voxel-classification approaches in magnetic resonance (MR) images. However, segmentation via voxel-classification is a computationally demanding process for high-field MR images with high spatial resolutions. In this study, the whole femoral, tibial, and patellar cartilage compartments in the knee joint were automatically segmented in high-field MR images obtained from Osteoarthritis Initiative using a voxel-classification-driven region-growing algorithm with sample-expand method. Computational complexity of the classification was alleviated via subsampling of the background voxels in the training MR images and selecting a small subset of significant features by taking into consideration systems with limited memory and processing power. Although subsampling of the voxels may lead to a loss of generality of the training models and a decrease in segmentation accuracies, effective subsampling strategies can overcome these problems. Therefore, different subsampling techniques, which involve uniform, Gaussian, vicinity-correlated (VC) sparse, and VC dense subsampling, were used to generate four training models. The segmentation system was experimented using 10 training and 23 testing MR images, and the effects of different training models on segmentation accuracies were investigated. Experimental results showed that the highest mean Dice similarity coefficient (DSC) values for all compartments were obtained when the training models of VC sparse subsampling technique were used. Mean DSC values optimized with this technique were 82.6%, 83.1%, and 72.6% for femoral, tibial, and patellar cartilage compartments, respectively, when mean sensitivities were 79.9%, 84.0%, and 71.5%, and mean specificities were 99.8%, 99.9%, and 99.9%.

  15. Automatic segmentation of cartilage in high-field magnetic resonance images of the knee joint with an improved voxel-classification-driven region-growing algorithm using vicinity-correlated subsampling.

    PubMed

    Öztürk, Ceyda Nur; Albayrak, Songül

    2016-05-01

    Anatomical structures that can deteriorate over time, such as cartilage, can be successfully delineated with voxel-classification approaches in magnetic resonance (MR) images. However, segmentation via voxel-classification is a computationally demanding process for high-field MR images with high spatial resolutions. In this study, the whole femoral, tibial, and patellar cartilage compartments in the knee joint were automatically segmented in high-field MR images obtained from Osteoarthritis Initiative using a voxel-classification-driven region-growing algorithm with sample-expand method. Computational complexity of the classification was alleviated via subsampling of the background voxels in the training MR images and selecting a small subset of significant features by taking into consideration systems with limited memory and processing power. Although subsampling of the voxels may lead to a loss of generality of the training models and a decrease in segmentation accuracies, effective subsampling strategies can overcome these problems. Therefore, different subsampling techniques, which involve uniform, Gaussian, vicinity-correlated (VC) sparse, and VC dense subsampling, were used to generate four training models. The segmentation system was experimented using 10 training and 23 testing MR images, and the effects of different training models on segmentation accuracies were investigated. Experimental results showed that the highest mean Dice similarity coefficient (DSC) values for all compartments were obtained when the training models of VC sparse subsampling technique were used. Mean DSC values optimized with this technique were 82.6%, 83.1%, and 72.6% for femoral, tibial, and patellar cartilage compartments, respectively, when mean sensitivities were 79.9%, 84.0%, and 71.5%, and mean specificities were 99.8%, 99.9%, and 99.9%. PMID:27017069

  16. Human ocular anatomy.

    PubMed

    Kels, Barry D; Grzybowski, Andrzej; Grant-Kels, Jane M

    2015-01-01

    We review the normal anatomy of the human globe, eyelids, and lacrimal system. This contribution explores both the form and function of numerous anatomic features of the human ocular system, which are vital to a comprehensive understanding of the pathophysiology of many oculocutaneous diseases. The review concludes with a reference glossary of selective ophthalmologic terms that are relevant to a thorough understanding of many oculocutaneous disease processes.

  17. [Anatomy of the skull].

    PubMed

    Pásztor, Emil

    2010-01-01

    The anatomy of the human body based on a special teleological system is one of the greatest miracles of the world. The skull's primary function is the defence of the brain, so every alteration or disease of the brain results in some alteration of the skull. This analogy is to be identified even in the human embryo. Proportions of the 22 bones constituting the skull and of sizes of sutures are not only the result of the phylogeny, but those of the ontogeny as well. E.g. the age of the skeletons in archaeological findings could be identified according to these facts. Present paper outlines the ontogeny and development of the tissues of the skull, of the structure of the bone-tissue, of the changes of the size of the skull and of its parts during the different periods of human life, reflecting to the aesthetics of the skull as well. "Only the human scull can give me an impression of beauty. In spite of all genetical colseness, a skull of a chimpanzee cannot impress me aesthetically"--author confesses. In the second part of the treatise those authors are listed, who contributed to the perfection of our knowledge regarding the skull. First of all the great founder of modern anatomy, Andreas Vesalius, then Pierre Paul Broca, Jacob Benignus Winslow are mentioned here. The most important Hungarian contributors were as follow: Sámuel Rácz, Pál Bugát or--the former assistant of Broca--Aurél Török. A widely used tool for measurement of the size of the skull, the craniometer was invented by the latter. The members of the family Lenhossék have had also important results in this field of research, while descriptive anatomy of the skull was completed by microsopical anatomy thanks the activity of Géza Mihálkovits. PMID:21661257

  18. [Anatomy of the skull].

    PubMed

    Pásztor, Emil

    2010-01-01

    The anatomy of the human body based on a special teleological system is one of the greatest miracles of the world. The skull's primary function is the defence of the brain, so every alteration or disease of the brain results in some alteration of the skull. This analogy is to be identified even in the human embryo. Proportions of the 22 bones constituting the skull and of sizes of sutures are not only the result of the phylogeny, but those of the ontogeny as well. E.g. the age of the skeletons in archaeological findings could be identified according to these facts. Present paper outlines the ontogeny and development of the tissues of the skull, of the structure of the bone-tissue, of the changes of the size of the skull and of its parts during the different periods of human life, reflecting to the aesthetics of the skull as well. "Only the human scull can give me an impression of beauty. In spite of all genetical colseness, a skull of a chimpanzee cannot impress me aesthetically"--author confesses. In the second part of the treatise those authors are listed, who contributed to the perfection of our knowledge regarding the skull. First of all the great founder of modern anatomy, Andreas Vesalius, then Pierre Paul Broca, Jacob Benignus Winslow are mentioned here. The most important Hungarian contributors were as follow: Sámuel Rácz, Pál Bugát or--the former assistant of Broca--Aurél Török. A widely used tool for measurement of the size of the skull, the craniometer was invented by the latter. The members of the family Lenhossék have had also important results in this field of research, while descriptive anatomy of the skull was completed by microsopical anatomy thanks the activity of Géza Mihálkovits.

  19. Executions and scientific anatomy.

    PubMed

    Dolezal, Antonín; Jelen, Karel; Stajnrtova, Olga

    2015-12-01

    The very word "anatomy" tells us about this branch's connection with dissection. Studies of anatomy have taken place for approximately 2.300 years already. Anatomy's birthplace lies in Greece and Egypt. Knowledge in this specific field of science was necessary during surgical procedures in ophthalmology and obstetrics. Embalming took place without public disapproval just like autopsies and manipulation with relics. Thus, anatomical dissection became part of later forensic sciences. Anatomical studies on humans themselves, which needed to be compared with the knowledge gained through studying procedures performed on animals, elicited public disapprobation and prohibition. When faced with a shortage of cadavers, anatomists resorted to obtaining bodies of the executed and suicide victims - since torture, public display of the mutilated body, (including anatomical autopsy), were perceived as an intensification of the death penalty. Decapitation and hanging were the main execution methods meted out for death sentences. Anatomists preferred intact bodies for dissection; hence, convicts could thus avoid torture. This paper lists examples of how this process was resolved. It concerns the manners of killing, vivisection on people in the antiquity and middle-ages, experiments before the execution and after, vivifying from seeming death, experiments with galvanizing electricity on fresh cadavers, evaluating of sensibility after guillotine execution, and making perfect anatomical preparations and publications during Nazism from fresh bodies of the executed.

  20. Executions and scientific anatomy.

    PubMed

    Dolezal, Antonín; Jelen, Karel; Stajnrtova, Olga

    2015-12-01

    The very word "anatomy" tells us about this branch's connection with dissection. Studies of anatomy have taken place for approximately 2.300 years already. Anatomy's birthplace lies in Greece and Egypt. Knowledge in this specific field of science was necessary during surgical procedures in ophthalmology and obstetrics. Embalming took place without public disapproval just like autopsies and manipulation with relics. Thus, anatomical dissection became part of later forensic sciences. Anatomical studies on humans themselves, which needed to be compared with the knowledge gained through studying procedures performed on animals, elicited public disapprobation and prohibition. When faced with a shortage of cadavers, anatomists resorted to obtaining bodies of the executed and suicide victims - since torture, public display of the mutilated body, (including anatomical autopsy), were perceived as an intensification of the death penalty. Decapitation and hanging were the main execution methods meted out for death sentences. Anatomists preferred intact bodies for dissection; hence, convicts could thus avoid torture. This paper lists examples of how this process was resolved. It concerns the manners of killing, vivisection on people in the antiquity and middle-ages, experiments before the execution and after, vivifying from seeming death, experiments with galvanizing electricity on fresh cadavers, evaluating of sensibility after guillotine execution, and making perfect anatomical preparations and publications during Nazism from fresh bodies of the executed. PMID:26859596

  1. Optimal segmentation and packaging process

    DOEpatents

    Kostelnik, Kevin M.; Meservey, Richard H.; Landon, Mark D.

    1999-01-01

    A process for improving packaging efficiency uses three dimensional, computer simulated models with various optimization algorithms to determine the optimal segmentation process and packaging configurations based on constraints including container limitations. The present invention is applied to a process for decontaminating, decommissioning (D&D), and remediating a nuclear facility involving the segmentation and packaging of contaminated items in waste containers in order to minimize the number of cuts, maximize packaging density, and reduce worker radiation exposure. A three-dimensional, computer simulated, facility model of the contaminated items are created. The contaminated items are differentiated. The optimal location, orientation and sequence of the segmentation and packaging of the contaminated items is determined using the simulated model, the algorithms, and various constraints including container limitations. The cut locations and orientations are transposed to the simulated model. The contaminated items are actually segmented and packaged. The segmentation and packaging may be simulated beforehand. In addition, the contaminated items may be cataloged and recorded.

  2. Neuro-Fuzzy Phasing of Segmented Mirrors

    NASA Technical Reports Server (NTRS)

    Olivier, Philip D.

    1999-01-01

    A new phasing algorithm for segmented mirrors based on neuro-fuzzy techniques is described. A unique feature of this algorithm is the introduction of an observer bank. Its effectiveness is tested in a very simple model with remarkable success. The new algorithm requires much less computational effort than existing algorithms and therefore promises to be quite useful when implemented on more complex models.

  3. Anatomy relevant to conservative mastectomy

    PubMed Central

    O’Connell, Rachel L.

    2015-01-01

    Knowledge of the anatomy of the nipple and breast skin is fundamental to any surgeon practicing conservative mastectomies. In this paper, the relevant clinical anatomy will be described, mainly focusing on the anatomy of the “oncoplastic plane”, the ducts and the vasculature. We will also cover more briefly the nerve supply and the arrangement of smooth muscle of the nipple. Finally the lymphatic drainage of the nipple and areola will be described. An appreciation of the relevant anatomy, together with meticulous surgical technique may minimise local recurrence and ischaemic complications. PMID:26645002

  4. Anatomy relevant to conservative mastectomy.

    PubMed

    O'Connell, Rachel L; Rusby, Jennifer E

    2015-12-01

    Knowledge of the anatomy of the nipple and breast skin is fundamental to any surgeon practicing conservative mastectomies. In this paper, the relevant clinical anatomy will be described, mainly focusing on the anatomy of the "oncoplastic plane", the ducts and the vasculature. We will also cover more briefly the nerve supply and the arrangement of smooth muscle of the nipple. Finally the lymphatic drainage of the nipple and areola will be described. An appreciation of the relevant anatomy, together with meticulous surgical technique may minimise local recurrence and ischaemic complications. PMID:26645002

  5. Who Is Repeating Anatomy? Trends in an Undergraduate Anatomy Course

    ERIC Educational Resources Information Center

    Schutte, Audra F.

    2016-01-01

    Anatomy courses frequently serve as prerequisites or requirements for health sciences programs. Due to the challenging nature of anatomy, each semester there are students remediating the course (enrolled in the course for a second time), attempting to earn a grade competitive for admissions into a program of study. In this retrospective study,…

  6. Who is repeating anatomy? Trends in an undergraduate anatomy course.

    PubMed

    Schutte, Audra F

    2016-01-01

    Anatomy courses frequently serve as prerequisites or requirements for health sciences programs. Due to the challenging nature of anatomy, each semester there are students remediating the course (enrolled in the course for a second time), attempting to earn a grade competitive for admissions into a program of study. In this retrospective study, remediation rates and trends in an undergraduate anatomy course with over 400 students enrolled each semester at a large Midwestern university were identified. Demographic data was collected from spring 2004 to spring 2010, including students' age, ethnicity, major of study, class standing, college admission tests (ACT and SAT®) scores, anatomy laboratory and lecture examination scores, and final anatomy grades for each semester. Eleven percent of the students repeated the course at least once. Gender, ethnicity, major of study and SAT scores were all shown to be associated with whether or not a student would need to repeat the course. On average, students who repeated anatomy demonstrated significant improvements in lecture and laboratory scores when comparing first and second enrollments in anatomy, and therefore also saw improved final course grades in their second enrollment. These findings will aid future instructors to identify and assist at-risk students to succeed in anatomy. Instructors from other institutions may also find the results to be useful for identifying students at risk for struggling.

  7. The anatomy of anatomy: a review for its modernization.

    PubMed

    Sugand, Kapil; Abrahams, Peter; Khurana, Ashish

    2010-01-01

    Anatomy has historically been a cornerstone in medical education regardless of nation or specialty. Until recently, dissection and didactic lectures were its sole pedagogy. Teaching methodology has been revolutionized with more reliance on models, imaging, simulation, and the Internet to further consolidate and enhance the learning experience. Moreover, modern medical curricula are giving less importance to anatomy education and to the acknowledged value of dissection. Universities have even abandoned dissection completely in favor of user-friendly multimedia, alternative teaching approaches, and newly defined priorities in clinical practice. Anatomy curriculum is undergoing international reformation but the current framework lacks uniformity among institutions. Optimal learning content can be categorized into the following modalities: (1) dissection/prosection, (2) interactive multimedia, (3) procedural anatomy, (4) surface and clinical anatomy, and (5) imaging. The importance of multimodal teaching, with examples suggested in this article, has been widely recognized and assessed. Nevertheless, there are still ongoing limitations in anatomy teaching. Substantial problems consist of diminished allotted dissection time and the number of qualified anatomy instructors, which will eventually deteriorate the quality of education. Alternative resources and strategies are discussed in an attempt to tackle these genuine concerns. The challenges are to reinstate more effective teaching and learning tools while maintaining the beneficial values of orthodox dissection. The UK has a reputable medical education but its quality could be improved by observing international frameworks. The heavy penalty of not concentrating on sufficient anatomy education will inevitably lead to incompetent anatomists and healthcare professionals, leaving patients to face dire repercussions.

  8. Terrain segmentation using laser radar range data.

    PubMed

    Letalick, D; Millnert, M; Renhorn, I

    1992-05-20

    A novel approach to segmentation of laser radar range images is presented. The approach is based on modeling horizontal and vertical scans of the terrain as piecewise-constant or piecewise-linear functions. The approach uses adaptive estimation based on Kalman filtering techniques. The performance of the segmentation algorithm is evaluated by application to laser range measurements. We also discuss how the output from the segmentation algorithm can be used for, e.g., object detection.

  9. [Anatomy and anthropology].

    PubMed

    Nikitiuk, B A

    1980-09-01

    Methodological aspects of anatomy and anthropology are discussed as systems of sciences in their formation. The base of these systems is the laws of materialist dialectics on the unity of the structure and function and on relation of the social to the biological as hierarchically highest form of the matter movement towards the lowest form. In this classification of the systems of anthropological and anatomical sciences a heliocentric principle is used. Tasks of the bordering sciences--anatomical anthropology are considered. Its task is to study forms and factors on anatomical changeability of the organism.

  10. Combining prior day contours to improve automated prostate segmentation

    SciTech Connect

    Godley, Andrew; Sheplan Olsen, Lawrence J.; Stephans, Kevin; Zhao Anzi

    2013-02-15

    Purpose: To improve the accuracy of automatically segmented prostate, rectum, and bladder contours required for online adaptive therapy. The contouring accuracy on the current image guidance [image guided radiation therapy (IGRT)] scan is improved by combining contours from earlier IGRT scans via the simultaneous truth and performance level estimation (STAPLE) algorithm. Methods: Six IGRT prostate patients treated with daily kilo-voltage (kV) cone-beam CT (CBCT) had their original plan CT and nine CBCTs contoured by the same physician. Three types of automated contours were produced for analysis. (1) Plan: By deformably registering the plan CT to each CBCT and then using the resulting deformation field to morph the plan contours to match the CBCT anatomy. (2) Previous: The contour set drawn by the physician on the previous day CBCT is similarly deformed to match the current CBCT anatomy. (3) STAPLE: The contours drawn by the physician, on each prior CBCT and the plan CT, are deformed to match the CBCT anatomy to produce multiple contour sets. These sets are combined using the STAPLE algorithm into one optimal set. Results: Compared to plan and previous, STAPLE improved the average Dice's coefficient (DC) with the original physician drawn CBCT contours to a DC as follows: Bladder: 0.81 {+-} 0.13, 0.91 {+-} 0.06, and 0.92 {+-} 0.06; Prostate: 0.75 {+-} 0.08, 0.82 {+-} 0.05, and 0.84 {+-} 0.05; and Rectum: 0.79 {+-} 0.06, 0.81 {+-} 0.06, and 0.85 {+-} 0.04, respectively. The STAPLE results are within intraobserver consistency, determined by the physician blindly recontouring a subset of CBCTs. Comparing plans recalculated using the physician and STAPLE contours showed an average disagreement less than 1% for prostate D98 and mean dose, and 5% and 3% for bladder and rectum mean dose, respectively. One scan takes an average of 19 s to contour. Using five scans plus STAPLE takes less than 110 s on a 288 core graphics processor unit. Conclusions: Combining the plan and

  11. Deformable templates guided discriminative models for robust 3D brain MRI segmentation.

    PubMed

    Liu, Cheng-Yi; Iglesias, Juan Eugenio; Tu, Zhuowen

    2013-10-01

    Automatically segmenting anatomical structures from 3D brain MRI images is an important task in neuroimaging. One major challenge is to design and learn effective image models accounting for the large variability in anatomy and data acquisition protocols. A deformable template is a type of generative model that attempts to explicitly match an input image with a template (atlas), and thus, they are robust against global intensity changes. On the other hand, discriminative models combine local image features to capture complex image patterns. In this paper, we propose a robust brain image segmentation algorithm that fuses together deformable templates and informative features. It takes advantage of the adaptation capability of the generative model and the classification power of the discriminative models. The proposed algorithm achieves both robustness and efficiency, and can be used to segment brain MRI images with large anatomical variations. We perform an extensive experimental study on four datasets of T1-weighted brain MRI data from different sources (1,082 MRI scans in total) and observe consistent improvement over the state-of-the-art systems.

  12. Fully Automated Whole-Head Segmentation with Improved Smoothness and Continuity, with Theory Reviewed

    PubMed Central

    Huang, Yu; Parra, Lucas C.

    2015-01-01

    Individualized current-flow models are needed for precise targeting of brain structures using transcranial electrical or magnetic stimulation (TES/TMS). The same is true for current-source reconstruction in electroencephalography and magnetoencephalography (EEG/MEG). The first step in generating such models is to obtain an accurate segmentation of individual head anatomy, including not only brain but also cerebrospinal fluid (CSF), skull and soft tissues, with a field of view (FOV) that covers the whole head. Currently available automated segmentation tools only provide results for brain tissues, have a limited FOV, and do not guarantee continuity and smoothness of tissues, which is crucially important for accurate current-flow estimates. Here we present a tool that addresses these needs. It is based on a rigorous Bayesian inference framework that combines image intensity model, anatomical prior (atlas) and morphological constraints using Markov random fields (MRF). The method is evaluated on 20 simulated and 8 real head volumes acquired with magnetic resonance imaging (MRI) at 1 mm3 resolution. We find improved surface smoothness and continuity as compared to the segmentation algorithms currently implemented in Statistical Parametric Mapping (SPM). With this tool, accurate and morphologically correct modeling of the whole-head anatomy for individual subjects may now be feasible on a routine basis. Code and data are fully integrated into SPM software tool and are made publicly available. In addition, a review on the MRI segmentation using atlas and the MRF over the last 20 years is also provided, with the general mathematical framework clearly derived. PMID:25992793

  13. Health Instruction Packages: Cardiac Anatomy.

    ERIC Educational Resources Information Center

    Phillips, Gwen; And Others

    Text, illustrations, and exercises are utilized in these five learning modules to instruct nurses, students, and other health care professionals in cardiac anatomy and functions and in fundamental electrocardiographic techniques. The first module, "Cardiac Anatomy and Physiology: A Review" by Gwen Phillips, teaches the learner to draw and label…

  14. How Much Anatomy Is Enough?

    ERIC Educational Resources Information Center

    Bergman, Esther M.; Prince, Katinka J. A. H.; Drukker, Jan; van der Vleuten, Cees P. M.; Scherpbier, Albert J. J. A.

    2008-01-01

    Innovations in undergraduate medical education, such as integration of disciplines and problem based learning, have given rise to concerns about students' knowledge of anatomy. This article originated from several studies investigating the knowledge of anatomy of students at the eight Dutch medical schools. The studies showed that undergraduate…

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

    PubMed Central

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

    2005-01-01

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

  16. Radiological sinonasal anatomy

    PubMed Central

    Alrumaih, Redha A.; Ashoor, Mona M.; Obidan, Ahmed A.; Al-Khater, Khulood M.; Al-Jubran, Saeed A.

    2016-01-01

    Objectives: To assess the prevalence of common radiological variants of sinonasal anatomy among Saudi population and compare it with the reported prevalence of these variants in other ethnic and population groups. Methods: This is a retrospective cross-sectional study of 121 computerized tomography scans of the nose and paranasal sinuses of patients presented with sinonasal symptoms to the Department of Otorhinolarngology, King Fahad Hospital of the University, Khobar, Saudi Arabia, between January 2014 and May 2014. Results: Scans of 121 patients fulfilled inclusion criteria were reviewed. Concha bullosa was found in 55.4%, Haller cell in 39.7%, and Onodi cell in 28.9%. Dehiscence of the internal carotid artery was found in 1.65%. Type-1 and type-2 optic nerve were the prevalent types. Type-II Keros classification of the depth of olfactory fossa was the most common among the sample (52.9%). Frontal cells were found in 79.3%; type I was the most common. Conclusions: There is a difference in the prevalence of some radiological variants of the sinonasal anatomy between Saudi population and other study groups. Surgeon must pay special attention in the preoperative assessment of patients with sinonasal pathology to avoid undesirable complications. PMID:27146614

  17. Automatic segmentation of psoriasis lesions

    NASA Astrophysics Data System (ADS)

    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.

  18. Hyperspectral image segmentation of the common bile duct

    NASA Astrophysics Data System (ADS)

    Samarov, Daniel; Wehner, Eleanor; Schwarz, Roderich; Zuzak, Karel; Livingston, Edward

    2013-03-01

    Over the course of the last several years hyperspectral imaging (HSI) has seen increased usage in biomedicine. Within the medical field in particular HSI has been recognized as having the potential to make an immediate impact by reducing the risks and complications associated with laparotomies (surgical procedures involving large incisions into the abdominal wall) and related procedures. There are several ongoing studies focused on such applications. Hyperspectral images were acquired during pancreatoduodenectomies (commonly referred to as Whipple procedures), a surgical procedure done to remove cancerous tumors involving the pancreas and gallbladder. As a result of the complexity of the local anatomy, identifying where the common bile duct (CBD) is can be difficult, resulting in comparatively high incidents of injury to the CBD and associated complications. It is here that HSI has the potential to help reduce the risk of such events from happening. Because the bile contained within the CBD exhibits a unique spectral signature, we are able to utilize HSI segmentation algorithms to help in identifying where the CBD is. In the work presented here we discuss approaches to this segmentation problem and present the results.

  19. Scorpion image segmentation system

    NASA Astrophysics Data System (ADS)

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

    2013-12-01

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

  20. Automatic segmentation of rotational x-ray images for anatomic intra-procedural surface generation in atrial fibrillation ablation procedures.

    PubMed

    Manzke, Robert; Meyer, Carsten; Ecabert, Olivier; Peters, Jochen; Noordhoek, Niels J; Thiagalingam, Aravinda; Reddy, Vivek Y; Chan, Raymond C; Weese, Jürgen

    2010-02-01

    Since the introduction of 3-D rotational X-ray imaging, protocols for 3-D rotational coronary artery imaging have become widely available in routine clinical practice. Intra-procedural cardiac imaging in a computed tomography (CT)-like fashion has been particularly compelling due to the reduction of clinical overhead and ability to characterize anatomy at the time of intervention. We previously introduced a clinically feasible approach for imaging the left atrium and pulmonary veins (LAPVs) with short contrast bolus injections and scan times of approximately 4 -10 s. The resulting data have sufficient image quality for intra-procedural use during electro-anatomic mapping (EAM) and interventional guidance in atrial fibrillation (AF) ablation procedures. In this paper, we present a novel technique to intra-procedural surface generation which integrates fully-automated segmentation of the LAPVs for guidance in AF ablation interventions. Contrast-enhanced rotational X-ray angiography (3-D RA) acquisitions in combination with filtered-back-projection-based reconstruction allows for volumetric interrogation of LAPV anatomy in near-real-time. An automatic model-based segmentation algorithm allows for fast and accurate LAPV mesh generation despite the challenges posed by image quality; relative to pre-procedural cardiac CT/MR, 3-D RA images suffer from more artifacts and reduced signal-to-noise. We validate our integrated method by comparing 1) automatic and manual segmentations of intra-procedural 3-D RA data, 2) automatic segmentations of intra-procedural 3-D RA and pre-procedural CT/MR data, and 3) intra-procedural EAM point cloud data with automatic segmentations of 3-D RA and CT/MR data. Our validation results for automatically segmented intra-procedural 3-D RA data show average segmentation errors of 1) approximately 1.3 mm compared with manual 3-D RA segmentations 2) approximately 2.3 mm compared with automatic segmentation of pre-procedural CT/MR data and 3

  1. Segmenting anatomy in chest x-rays for tuberculosis screening.

    PubMed

    Karargyris, Alexandros; Antani, Sameer; Thoma, George

    2011-01-01

    In this paper we describe the development of a screening system for pulmonary pathologies (i.e. pneumonia, tuberculosis) application in global healthcare settings. As a first step toward this goal, the paper presents a novel approach for detecting lungs and ribs in chest radiographs. The approach is a unified method combining two detection schemes resulting in reduced cost. The novelty of our approach lies on the fact that instead of using pixel-wise techniques exclusively we used region-based features computed as wavelet features that take into consideration the orientation of anatomic structures. Initial results are described. Next steps include classification of non-rib lung regions for radiographic patterns suggesting tuberculosis infection. PMID:22256142

  2. Texture segmentation by genetic programming.

    PubMed

    Song, Andy; Ciesielski, Vic

    2008-01-01

    This paper describes a texture segmentation method using genetic programming (GP), which is one of the most powerful evolutionary computation algorithms. By choosing an appropriate representation texture, classifiers can be evolved without computing texture features. Due to the absence of time-consuming feature extraction, the evolved classifiers enable the development of the proposed texture segmentation algorithm. This GP based method can achieve a segmentation speed that is significantly higher than that of conventional methods. This method does not require a human expert to manually construct models for texture feature extraction. In an analysis of the evolved classifiers, it can be seen that these GP classifiers are not arbitrary. Certain textural regularities are captured by these classifiers to discriminate different textures. GP has been shown in this study as a feasible and a powerful approach for texture classification and segmentation, which are generally considered as complex vision tasks.

  3. Automated detection, 3D segmentation and analysis of high resolution spine MR images using statistical shape models

    NASA Astrophysics Data System (ADS)

    Neubert, A.; Fripp, J.; Engstrom, C.; Schwarz, R.; Lauer, L.; Salvado, O.; Crozier, S.

    2012-12-01

    Recent advances in high resolution magnetic resonance (MR) imaging of the spine provide a basis for the automated assessment of intervertebral disc (IVD) and vertebral body (VB) anatomy. High resolution three-dimensional (3D) morphological information contained in these images may be useful for early detection and monitoring of common spine disorders, such as disc degeneration. This work proposes an automated approach to extract the 3D segmentations of lumbar and thoracic IVDs and VBs from MR images using statistical shape analysis and registration of grey level intensity profiles. The algorithm was validated on a dataset of volumetric scans of the thoracolumbar spine of asymptomatic volunteers obtained on a 3T scanner using the relatively new 3D T2-weighted SPACE pulse sequence. Manual segmentations and expert radiological findings of early signs of disc degeneration were used in the validation. There was good agreement between manual and automated segmentation of the IVD and VB volumes with the mean Dice scores of 0.89 ± 0.04 and 0.91 ± 0.02 and mean absolute surface distances of 0.55 ± 0.18 mm and 0.67 ± 0.17 mm respectively. The method compares favourably to existing 3D MR segmentation techniques for VBs. This is the first time IVDs have been automatically segmented from 3D volumetric scans and shape parameters obtained were used in preliminary analyses to accurately classify (100% sensitivity, 98.3% specificity) disc abnormalities associated with early degenerative changes.

  4. Hierarchical image segmentation for learning object priors

    SciTech Connect

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

    2010-11-10

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

  5. Bayesian segmentation of hyperspectral images

    NASA Astrophysics Data System (ADS)

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

    2004-11-01

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

  6. Video segmentation techniques for news

    NASA Astrophysics Data System (ADS)

    Phillips, Michael; Wolf, Wayne H.

    1996-11-01

    This paper describes our experiences in video analysis for a video library on the World Wide Web. News and documentary programs, though seemingly simple, have some characteristics which can cause problems in simple shot segmentation algorithms. We have developed a methodology, based on our experience with the analysis of several hours of news/documentary footage, which improve the results of shot segmentation on this type of material and which in turn allows for higher-quality storyboards for our video library.

  7. The Anatomy of Galaxies

    NASA Astrophysics Data System (ADS)

    D'Onofrio, Mauro; Rampazzo, Roberto; Zaggia, Simone; Longair, Malcolm S.; Ferrarese, Laura; Marziani, Paola; Sulentic, Jack W.; van der Kruit, Pieter C.; Laurikainen, Eija; Elmegreen, Debra M.; Combes, Françoise; Bertin, Giuseppe; Fabbiano, Giuseppina; Giovanelli, Riccardo; Calzetti, Daniela; Moss, David L.; Matteucci, Francesca; Djorgovski, Stanislav George; Fraix-Burnet, Didier; Graham, Alister W. McK.; Tully, Brent R.

    Just after WWII Astronomy started to live its "Golden Age", not differently to many other sciences and human activities, especially in the west side countries. The improved resolution of telescopes and the appearance of new efficient light detectors (e.g. CCDs in the middle eighty) greatly impacted the extragalactic researches. The first morphological analysis of galaxies were rapidly substituted by "anatomic" studies of their structural components, star and gas content, and in general by detailed investigations of their properties. As for the human anatomy, where the final goal was that of understanding the functionality of the organs that are essential for the life of the body, galaxies were dissected to discover their basic structural components and ultimately the mystery of their existence.

  8. Integrated segmentation of cellular structures

    NASA Astrophysics Data System (ADS)

    Ajemba, Peter; Al-Kofahi, Yousef; Scott, Richard; Donovan, Michael; Fernandez, Gerardo

    2011-03-01

    Automatic segmentation of cellular structures is an essential step in image cytology and histology. Despite substantial progress, better automation and improvements in accuracy and adaptability to novel applications are needed. In applications utilizing multi-channel immuno-fluorescence images, challenges include misclassification of epithelial and stromal nuclei, irregular nuclei and cytoplasm boundaries, and over and under-segmentation of clustered nuclei. Variations in image acquisition conditions and artifacts from nuclei and cytoplasm images often confound existing algorithms in practice. In this paper, we present a robust and accurate algorithm for jointly segmenting cell nuclei and cytoplasm using a combination of ideas to reduce the aforementioned problems. First, an adaptive process that includes top-hat filtering, Eigenvalues-of-Hessian blob detection and distance transforms is used to estimate the inverse illumination field and correct for intensity non-uniformity in the nuclei channel. Next, a minimum-error-thresholding based binarization process and seed-detection combining Laplacian-of-Gaussian filtering constrained by a distance-map-based scale selection is used to identify candidate seeds for nuclei segmentation. The initial segmentation using a local maximum clustering algorithm is refined using a minimum-error-thresholding technique. Final refinements include an artifact removal process specifically targeted at lumens and other problematic structures and a systemic decision process to reclassify nuclei objects near the cytoplasm boundary as epithelial or stromal. Segmentation results were evaluated using 48 realistic phantom images with known ground-truth. The overall segmentation accuracy exceeds 94%. The algorithm was further tested on 981 images of actual prostate cancer tissue. The artifact removal process worked in 90% of cases. The algorithm has now been deployed in a high-volume histology analysis application.

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

    PubMed

    Rousson, Mikaël; Xu, Chenyang

    2006-01-01

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

  10. [Surgery without anatomy?].

    PubMed

    Stelzner, F

    2016-08-01

    Anatomy is the basis of all operative medicine. While this branch of scientific medicine is frequently not explicitly mentioned in surgical publications, it is nonetheless quintessential to medical education. In the era of video sequences and digitized images, surgical methods are frequently communicated in the form of cinematic documentation of surgical procedures; however, this occurs without the help of explanatory drawings or subtexts that would illustrate the underlying anatomical nomenclature, comment on fine functionally important details or even without making any mention of the surgeon. In scientific manuscripts color illustrations frequently appear in such overwhelming quantities that they resemble long arrays of trophies but fail to give detailed explanations that would aid the therapeutic translation of the novel datasets. In a similar fashion, many anatomy textbooks prefer to place emphasis on illustrations and photographs while supplying only a paucity of explanations that would foster the understanding of functional contexts and thus confuse students and practitioners alike. There is great temptation to repeat existing data and facts over and over again, while it is proportionally rare to make reference to truly original scientific discoveries. A number of examples are given in this article to illustrate how discoveries that were made even a long time ago can still contribute to scientific progress in current times. This includes the NO signaling molecules, which were first described in 1775 but were only discovered to have a pivotal role as neurotransmitters in the function of human paradoxical sphincter muscles in 2012 and 2015. Readers of scientific manuscripts often long for explanations by the numerous silent coauthors of a publication who could contribute to the main topic by adding in-depth illustrations (e. g. malignograms, evolution and involution of lymph node structures). PMID:27251482

  11. [The French lessons of anatomy].

    PubMed

    Bouchet, Alain

    2003-01-01

    The "Lessons of Anatomy" can be considered as a step of Medicine to Art. For several centuries the exhibition of a corpse's dissection was printed on the title-page of published works. Since the seventeenth century, the "Lessons of Anatomy" became a picture on the title-page in order to highlight the well-known names of the european anatomists. The study is limited to the French Lessons of Anatomy found in books or pictures after the invention of printing. PMID:14626253

  12. The anatomy of teaching and the teaching of anatomy.

    PubMed

    Peck, David; Skandalakis, John E

    2004-04-01

    Professional education is one of the greatest problems currently confronting the healing professions. The incorporation of basic science departments into colleges of medicine has affected curriculum design, research, admissions criteria, and licensure. Those who are not practicing members of a particular health care profession wield undue influence in medical schools. Ideally, gross anatomy teachers should be health care professionals who use anatomy in their practices. Reorganization of medical education will heal the rift between research and clinical medicine.

  13. Template characterization and correlation algorithm created from segmentation for the iris biometric authentication based on analysis of textures implemented on a FPGA

    NASA Astrophysics Data System (ADS)

    Giacometto, F. J.; Vilardy, J. M.; Torres, C. O.; Mattos, L.

    2011-01-01

    Among the most used biometric signals to set personal security permissions, taker increasingly importance biometric iris recognition based on their textures and images of blood vessels due to the rich in these two unique characteristics that are unique to each individual. This paper presents an implementation of an algorithm characterization and correlation of templates created for biometric authentication based on iris texture analysis programmed on a FPGA (Field Programmable Gate Array), authentication is based on processes like characterization methods based on frequency analysis of the sample, and frequency correlation to obtain the expected results of authentication.

  14. Document segmentation via oblique cuts

    NASA Astrophysics Data System (ADS)

    Svendsen, Jeremy; Branzan-Albu, Alexandra

    2013-01-01

    This paper presents a novel solution for the layout segmentation of graphical elements in Business Intelligence documents. We propose a generalization of the recursive X-Y cut algorithm, which allows for cutting along arbitrary oblique directions. An intermediate processing step consisting of line and solid region removal is also necessary due to presence of decorative elements. The output of the proposed segmentation is a hierarchical structure which allows for the identification of primitives in pie and bar charts. The algorithm was tested on a database composed of charts from business documents. Results are very promising.

  15. Effect of anatomy on spectroscopic detection of cervical dysplasia

    NASA Astrophysics Data System (ADS)

    Mirkovic, Jelena; Lau, Condon; McGee, Sasha; Yu, Chung-Chieh; Nazemi, Jonathan; Galindo, Luis; Feng, Victoria; Darragh, Teresa; de Las Morenas, Antonio; Crum, Christopher; Stier, Elizabeth; Feld, Michael; Badizadegan, Kamran

    2009-07-01

    It has long been speculated that underlying variations in tissue anatomy affect in vivo spectroscopic measurements. We investigate the effects of cervical anatomy on reflectance and fluorescence spectroscopy to guide the development of a diagnostic algorithm for identifying high-grade squamous intraepithelial lesions (HSILs) free of the confounding effects of anatomy. We use spectroscopy in both contact probe and imaging modes to study patients undergoing either colposcopy or treatment for HSIL. Physical models of light propagation in tissue are used to extract parameters related to tissue morphology and biochemistry. Our results show that the transformation zone, the area in which the vast majority of HSILs are found, is spectroscopically distinct from the adjacent squamous mucosa, and that these anatomical differences can directly influence spectroscopic diagnostic parameters. Specifically, we demonstrate that performance of diagnostic algorithms for identifying HSILs is artificially enhanced when clinically normal squamous sites are included in the statistical analysis of the spectroscopic data. We conclude that underlying differences in tissue anatomy can have a confounding effect on diagnostic spectroscopic parameters and that the common practice of including clinically normal squamous sites in cervical spectroscopy results in artificially improved performance in distinguishing HSILs from clinically suspicious non-HSILs.

  16. Multiatlas Segmentation as Nonparametric Regression

    PubMed Central

    Awate, Suyash P.; Whitaker, Ross T.

    2015-01-01

    This paper proposes a novel theoretical framework to model and analyze the statistical characteristics of a wide range of segmentation methods that incorporate a database of label maps or atlases; such methods are termed as label fusion or multiatlas segmentation. We model these multiatlas segmentation problems as nonparametric regression problems in the high-dimensional space of image patches. We analyze the nonparametric estimator’s convergence behavior that characterizes expected segmentation error as a function of the size of the multiatlas database. We show that this error has an analytic form involving several parameters that are fundamental to the specific segmentation problem (determined by the chosen anatomical structure, imaging modality, registration algorithm, and label-fusion algorithm). We describe how to estimate these parameters and show that several human anatomical structures exhibit the trends modeled analytically. We use these parameter estimates to optimize the regression estimator. We show that the expected error for large database sizes is well predicted by models learned on small databases. Thus, a few expert segmentations can help predict the database sizes required to keep the expected error below a specified tolerance level. Such cost-benefit analysis is crucial for deploying clinical multiatlas segmentation systems. PMID:24802528

  17. Hyperspectral imagery and segmentation

    NASA Astrophysics Data System (ADS)

    Wellman, Mark C.; Nasrabadi, Nasser M.

    2002-07-01

    Hyperspectral imagery (HSI), a passive infrared imaging technique which creates images of fine resolution across the spectrum is currently being considered for Army tactical applications. An important tactical application of infra-red (IR) hyperspectral imagery is the detection of low contrast targets, including those targets that may employ camouflage, concealment and deception (CCD) techniques [1,2]. Spectral reflectivity characteristics were used for efficient segmentation between different materials such as painted metal, vegetation and soil for visible to near IR bands in the range of 0.46-1.0 microns as shown previously by Kwon et al [3]. We are currently investigating the HSI where the wavelength spans from 7.5-13.7 microns. The energy in this range of wavelengths is almost entirely emitted rather than reflected, therefore, the gray level of a pixel is a function of the temperature and emissivity of the object. This is beneficial since light level and reflection will not need to be considered in the segmentation. We will present results of a step-wise segmentation analysis on the long-wave infrared (LWIR) hyperspectrum utilizing various classifier architectures applied to both the full-band, broad-band and narrow-band features derived from the Spatially Enhanced Broadband Array Spectrograph System (SEBASS) data base. Stepwise segmentation demonstrates some of the difficulties in the multi-class case. These results give an indication of the added capability the hyperspectral imagery and associated algorithms will bring to bear on the target acquisition problem.

  18. Segmentation of complex objects with non-spherical topologies from volumetric medical images using 3D livewire

    NASA Astrophysics Data System (ADS)

    Poon, Kelvin; Hamarneh, Ghassan; Abugharbieh, Rafeef

    2007-03-01

    Segmentation of 3D data is one of the most challenging tasks in medical image analysis. While reliable automatic methods are typically preferred, their success is often hindered by poor image quality and significant variations in anatomy. Recent years have thus seen an increasing interest in the development of semi-automated segmentation methods that combine computational tools with intuitive, minimal user interaction. In an earlier work, we introduced a highly-automated technique for medical image segmentation, where a 3D extension of the traditional 2D Livewire was proposed. In this paper, we present an enhanced and more powerful 3D Livewire-based segmentation approach with new features designed to primarily enable the handling of complex object topologies that are common in biological structures. The point ordering algorithm we proposed earlier, which automatically pairs up seedpoints in 3D, is improved in this work such that multiple sets of points are allowed to simultaneously exist. Point sets can now be automatically merged and split to accommodate for the presence of concavities, protrusions, and non-spherical topologies. The robustness of the method is further improved by extending the 'turtle algorithm', presented earlier, by using a turtle-path pruning step. Tests on both synthetic and real medical images demonstrate the efficiency, reproducibility, accuracy, and robustness of the proposed approach. Among the examples illustrated is the segmentation of the left and right ventricles from a T1-weighted MRI scan, where an average task time reduction of 84.7% was achieved when compared to a user performing 2D Livewire segmentation on every slice.

  19. Automated area segmentation for ocean bottom surveys

    NASA Astrophysics Data System (ADS)

    Hyland, John C.; Smith, Cheryl M.

    2015-05-01

    In practice, environmental information about an ocean bottom area to be searched using SONAR is often known a priori to some coarse level of resolution. The SONAR search sensor then typically has a different performance characterization function for each environmental classification. Large ocean bottom surveys using search SONAR can pose some difficulties when the environmental conditions vary significantly over the search area because search planning tools cannot adequately segment the area into sub-regions of homogeneous search sensor performance. Such segmentation is critically important to unmanned search vehicles; homogenous bottom segmentation will result in more accurate predictions of search performance and area coverage rate. The Naval Surface Warfare Center, Panama City Division (NSWC PCD) has developed an automated area segmentation algorithm that subdivides the mission area under the constraint that the variation of the search sensor's performance within each sub-mission area cannot exceed a specified threshold, thereby creating sub-regions of homogeneous sensor performance. The algorithm also calculates a new, composite sensor performance function for each sub-mission area. The technique accounts for practical constraints such as enforcing a minimum sub-mission area size and requiring sub-mission areas to be rectangular. Segmentation occurs both across the rows and down the columns of the mission area. Ideally, mission planning should consider both segmentation directions and choose the one with the more favorable result. The Automated Area Segmentation Algorithm was tested using two a priori bottom segmentations: rectangular and triangular; and two search sensor configurations: a set of three bi-modal curves and a set of three uni-modal curves. For each of these four scenarios, the Automated Area Segmentation Algorithm automatically partitioned the mission area across rows and down columns to create regions with homogeneous sensor performance. The

  20. Spinal Cord Segmentation by One Dimensional Normalized Template Matching: A Novel, Quantitative Technique to Analyze Advanced Magnetic Resonance Imaging Data

    PubMed Central

    Cadotte, Adam; Cadotte, David W.; Livne, Micha; Cohen-Adad, Julien; Fleet, David; Mikulis, David; Fehlings, Michael G.

    2015-01-01

    Spinal cord segmentation is a developing area of research intended to aid the processing and interpretation of advanced magnetic resonance imaging (MRI). For example, high resolution three-dimensional volumes can be segmented to provide a measurement of spinal cord atrophy. Spinal cord segmentation is difficult due to the variety of MRI contrasts and the variation in human anatomy. In this study we propose a new method of spinal cord segmentation based on one-dimensional template matching and provide several metrics that can be used to compare with other segmentation methods. A set of ground-truth data from 10 subjects was manually-segmented by two different raters. These ground truth data formed the basis of the segmentation algorithm. A user was required to manually initialize the spinal cord center-line on new images, taking less than one minute. Template matching was used to segment the new cord and a refined center line was calculated based on multiple centroids within the segmentation. Arc distances down the spinal cord and cross-sectional areas were calculated. Inter-rater validation was performed by comparing two manual raters (n = 10). Semi-automatic validation was performed by comparing the two manual raters to the semi-automatic method (n = 10). Comparing the semi-automatic method to one of the raters yielded a Dice coefficient of 0.91 +/- 0.02 for ten subjects, a mean distance between spinal cord center lines of 0.32 +/- 0.08 mm, and a Hausdorff distance of 1.82 +/- 0.33 mm. The absolute variation in cross-sectional area was comparable for the semi-automatic method versus manual segmentation when compared to inter-rater manual segmentation. The results demonstrate that this novel segmentation method performs as well as a manual rater for most segmentation metrics. It offers a new approach to study spinal cord disease and to quantitatively track changes within the spinal cord in an individual case and across cohorts of subjects. PMID:26445367

  1. The dural sheath of the optic nerve: descriptive anatomy and surgical applications.

    PubMed

    Francois, P; Lescanne, E; Velut, S

    2011-01-01

    The aim of this work was to clarify the descriptive anatomy of the optic dural sheath using microanatomical dissections on cadavers. The orbit is the rostral part of the extradural neural axis compartment; the optic dural sheath forms the central portion of the orbit.In order to describe this specific anatomy, we carefully dissected 5 cadaveric heads (10 orbits) up to the meningeal structure of the orbit and its contents. 1 cadaveric head was reserved for electron microscopy to add to our knowledge of the collagen structure of the optic dural sheath.In this chapter, we describe the anatomy of the interperiostal-dural concept and the anatomy of the orbit. The optic dural sheath contains three portions: the intracranial, the intracanalicular and the intraorbital segment. Each one has specific anatomic relations which result in particular surgical considerations.

  2. Rigid shape matching by segmentation averaging.

    PubMed

    Wang, Hongzhi; Oliensis, John

    2010-04-01

    We use segmentations to match images by shape. The new matching technique does not require point-to-point edge correspondence and is robust to small shape variations and spatial shifts. To address the unreliability of segmentations computed bottom-up, we give a closed form approximation to an average over all segmentations. Our method has many extensions, yielding new algorithms for tracking, object detection, segmentation, and edge-preserving smoothing. For segmentation, instead of a maximum a posteriori approach, we compute the "central" segmentation minimizing the average distance to all segmentations of an image. For smoothing, instead of smoothing images based on local structures, we smooth based on the global optimal image structures. Our methods for segmentation, smoothing, and object detection perform competitively, and we also show promising results in shape-based tracking.

  3. [Dental anatomy of dogs].

    PubMed

    Sarkisian, E G

    2014-12-01

    The aim of the research was to investigate dog teeth anatomy as animal model for study of etiopathogenesis of caries disease and physiological tooth wear in human. After examining the dog's dental system, following conclusions were drawn: the dog has 42 permanent teeth, which are distributed over the dental arches not equally, and so the upper dentition consists of 20, and the lower of 22 teeth. The largest are considered upper fourth premolar and lower first molars, which are called discordant teeth. Between discordant teeth and fangs a dog has an open bite, which is limited to the top and bottom conical crown premolar teeth. Thus, in the closed position of the jaws, behind this occlusion is limited by discordant teeth, just in contact are smaller in size two molars. Only large dog's molars in a valid comparison can be likened to human molars, which allows us to use them in an analog comparison between them with further study of the morphological features ensure durability short-crown teeth and their predisposition to caries.

  4. Anatomy of trisomy 18.

    PubMed

    Roberts, Wallisa; Zurada, Anna; Zurada-ZieliŃSka, Agnieszka; Gielecki, Jerzy; Loukas, Marios

    2016-07-01

    Trisomy 18 is the second most common aneuploidy after trisomy 21. Due to its multi-systemic defects, it has a poor prognosis with a 50% chance of survival beyond one week and a <10% chance of survival beyond one year of life. However, this prognosis has been challenged by the introduction of aggressive interventional therapies for patients born with trisomy 18. As a result, a review of the anatomy associated with this defect is imperative. While any of the systems can be affected by trisomy 18, the following areas are the most likely to be affected: craniofacial, musculoskeletal system, cardiac system, abdominal, and nervous system. More specifically, the following features are considered characteristic of trisomy 18: low-set ears, rocker bottom feet, clenched fists, and ventricular septal defect. Of particular interest is the associated cardiac defect, as surgical repairs of these defects have shown an improved survivability. In this article, the anatomical defects associated with each system are reviewed. Clin. Anat. 29:628-632, 2016. © 2016 Wiley Periodicals, Inc. PMID:27087248

  5. Anatomy of an incident

    DOE PAGES

    Cournoyer, Michael E.; Trujillo, Stanley; Lawton, Cindy M.; Land, Whitney M.; Schreiber, Stephen B.

    2016-03-23

    A traditional view of incidents is that they are caused by shortcomings in human competence, attention, or attitude. It may be under the label of “loss of situational awareness,” procedure “violation,” or “poor” management. A different view is that human error is not the cause of failure, but a symptom of failure – trouble deeper inside the system. In this perspective, human error is not the conclusion, but rather the starting point of investigations. During an investigation, three types of information are gathered: physical, documentary, and human (recall/experience). Through the causal analysis process, apparent cause or apparent causes are identifiedmore » as the most probable cause or causes of an incident or condition that management has the control to fix and for which effective recommendations for corrective actions can be generated. A causal analysis identifies relevant human performance factors. In the following presentation, the anatomy of a radiological incident is discussed, and one case study is presented. We analyzed the contributing factors that caused a radiological incident. When underlying conditions, decisions, actions, and inactions that contribute to the incident are identified. This includes weaknesses that may warrant improvements that tolerate error. Measures that reduce consequences or likelihood of recurrence are discussed.« less

  6. FISICO: Fast Image SegmentatIon COrrection

    PubMed Central

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

    2016-01-01

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

  7. Integrated active contours for texture segmentation.

    PubMed

    Sagiv, Chen; Sochen, Nir A; Zeevi, Yehoshua Y

    2006-06-01

    We address the issue of textured image segmentation in the context of the Gabor feature space of images. Gabor filters tuned to a set of orientations, scales and frequencies are applied to the images to create the Gabor feature space. A two-dimensional Riemannian manifold of local features is extracted via the Beltrami framework. The metric of this surface provides a good indicator of texture changes and is used, therefore, in a Beltrami-based diffusion mechanism and in a geodesic active contours algorithm for texture segmentation. The performance of the proposed algorithm is compared with that of the edgeless active contours algorithm applied for texture segmentation. Moreover, an integrated approach, extending the geodesic and edgeless active contours approaches to texture segmentation, is presented. We show that combining boundary and region information yields more robust and accurate texture segmentation results. PMID:16764287

  8. Segmentation of Unstructured Datasets

    NASA Technical Reports Server (NTRS)

    Bhat, Smitha

    1996-01-01

    Datasets generated by computer simulations and experiments in Computational Fluid Dynamics tend to be extremely large and complex. It is difficult to visualize these datasets using standard techniques like Volume Rendering and Ray Casting. Object Segmentation provides a technique to extract and quantify regions of interest within these massive datasets. This thesis explores basic algorithms to extract coherent amorphous regions from two-dimensional and three-dimensional scalar unstructured grids. The techniques are applied to datasets from Computational Fluid Dynamics and from Finite Element Analysis.

  9. Efficient threshold for volumetric segmentation

    NASA Astrophysics Data System (ADS)

    Burdescu, Dumitru D.; Brezovan, Marius; Stanescu, Liana; Stoica Spahiu, Cosmin; Ebanca, Daniel

    2015-07-01

    Image segmentation plays a crucial role in effective understanding of digital images. However, the research on the existence of general purpose segmentation algorithm that suits for variety of applications is still very much active. Among the many approaches in performing image segmentation, graph based approach is gaining popularity primarily due to its ability in reflecting global image properties. Volumetric image segmentation can simply result an image partition composed by relevant regions, but the most fundamental challenge in segmentation algorithm is to precisely define the volumetric extent of some object, which may be represented by the union of multiple regions. The aim in this paper is to present a new method to detect visual objects from color volumetric images and efficient threshold. We present a unified framework for volumetric image segmentation and contour extraction that uses a virtual tree-hexagonal structure defined on the set of the image voxels. The advantage of using a virtual tree-hexagonal network superposed over the initial image voxels is that it reduces the execution time and the memory space used, without losing the initial resolution of the image.

  10. Toward a generic evaluation of image segmentation.

    PubMed

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

    2005-11-01

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

  11. Automatic Segmentation of Drosophila Neural Compartments Using GAL4 Expression Data Reveals Novel Visual Pathways.

    PubMed

    Panser, Karin; Tirian, Laszlo; Schulze, Florian; Villalba, Santiago; Jefferis, Gregory S X E; Bühler, Katja; Straw, Andrew D

    2016-08-01

    Identifying distinct anatomical structures within the brain and developing genetic tools to target them are fundamental steps for understanding brain function. We hypothesize that enhancer expression patterns can be used to automatically identify functional units such as neuropils and fiber tracts. We used two recent, genome-scale Drosophila GAL4 libraries and associated confocal image datasets to segment large brain regions into smaller subvolumes. Our results (available at https://strawlab.org/braincode) support this hypothesis because regions with well-known anatomy, namely the antennal lobes and central complex, were automatically segmented into familiar compartments. The basis for the structural assignment is clustering of voxels based on patterns of enhancer expression. These initial clusters are agglomerated to make hierarchical predictions of structure. We applied the algorithm to central brain regions receiving input from the optic lobes. Based on the automated segmentation and manual validation, we can identify and provide promising driver lines for 11 previously identified and 14 novel types of visual projection neurons and their associated optic glomeruli. The same strategy can be used in other brain regions and likely other species, including vertebrates. PMID:27426516

  12. Multi-contrast submillimetric 3 Tesla hippocampal subfield segmentation protocol and dataset.

    PubMed

    Kulaga-Yoskovitz, Jessie; Bernhardt, Boris C; Hong, Seok-Jun; Mansi, Tommaso; Liang, Kevin E; van der Kouwe, Andre J W; Smallwood, Jonathan; Bernasconi, Andrea; Bernasconi, Neda

    2015-01-01

    The hippocampus is composed of distinct anatomical subregions that participate in multiple cognitive processes and are differentially affected in prevalent neurological and psychiatric conditions. Advances in high-field MRI allow for the non-invasive identification of hippocampal substructure. These approaches, however, demand time-consuming manual segmentation that relies heavily on anatomical expertise. Here, we share manual labels and associated high-resolution MRI data (MNI-HISUB25; submillimetric T1- and T2-weighted images, detailed sequence information, and stereotaxic probabilistic anatomical maps) based on 25 healthy subjects. Data were acquired on a widely available 3 Tesla MRI system using a 32 phased-array head coil. The protocol divided the hippocampal formation into three subregions: subicular complex, merged Cornu Ammonis 1, 2 and 3 (CA1-3) subfields, and CA4-dentate gyrus (CA4-DG). Segmentation was guided by consistent intensity and morphology characteristics of the densely myelinated molecular layer together with few geometry-based boundaries flexible to overall mesiotemporal anatomy, and achieved excellent intra-/inter-rater reliability (Dice index ≥90/87%). The dataset can inform neuroimaging assessments of the mesiotemporal lobe and help to develop segmentation algorithms relevant for basic and clinical neurosciences. PMID:26594378

  13. Entangled decision forests and their application for semantic segmentation of CT images.

    PubMed

    Montillo, Albert; Shotton, Jamie; Winn, John; Iglesias, Juan Eugenio; Metaxas, Dimitri; Criminisi, Antonio

    2011-01-01

    This work addresses the challenging problem of simultaneously segmenting multiple anatomical structures in highly varied CT scans. We propose the entangled decision forest (EDF) as a new discriminative classifier which augments the state of the art decision forest, resulting in higher prediction accuracy and shortened decision time. Our main contribution is two-fold. First, we propose entangling the binary tests applied at each tree node in the forest, such that the test result can depend on the result of tests applied earlier in the same tree and at image points offset from the voxel to be classified. This is demonstrated to improve accuracy and capture long-range semantic context. Second, during training, we propose injecting randomness in a guided way, in which node feature types and parameters are randomly drawn from a learned (nonuniform) distribution. This further improves classification accuracy. We assess our probabilistic anatomy segmentation technique using a labeled database of CT image volumes of 250 different patients from various scan protocols and scanner vendors. In each volume, 12 anatomical structures have been manually segmented. The database comprises highly varied body shapes and sizes, a wide array of pathologies, scan resolutions, and diverse contrast agents. Quantitative comparisons with state of the art algorithms demonstrate both superior test accuracy and computational efficiency. PMID:21761656

  14. Out-of-atlas likelihood estimation using multi-atlas segmentation

    PubMed Central

    Asman, Andrew J.; Chambless, Lola B.; Thompson, Reid C.; Landman, Bennett A.

    2013-01-01

    Purpose: Multi-atlas segmentation has been shown to be highly robust and accurate across an extraordinary range of potential applications. However, it is limited to the segmentation of structures that are anatomically consistent across a large population of potential target subjects (i.e., multi-atlas segmentation is limited to “in-atlas” applications). Herein, the authors propose a technique to determine the likelihood that a multi-atlas segmentation estimate is representative of the problem at hand, and, therefore, identify anomalous regions that are not well represented within the atlases. Methods: The authors derive a technique to estimate the out-of-atlas (OOA) likelihood for every voxel in the target image. These estimated likelihoods can be used to determine and localize the probability of an abnormality being present on the target image. Results: Using a collection of manually labeled whole-brain datasets, the authors demonstrate the efficacy of the proposed framework on two distinct applications. First, the authors demonstrate the ability to accurately and robustly detect malignant gliomas in the human brain—an aggressive class of central nervous system neoplasms. Second, the authors demonstrate how this OOA likelihood estimation process can be used within a quality control context for diffusion tensor imaging datasets to detect large-scale imaging artifacts (e.g., aliasing and image shading). Conclusions: The proposed OOA likelihood estimation framework shows great promise for robust and rapid identification of brain abnormalities and imaging artifacts using only weak dependencies on anomaly morphometry and appearance. The authors envision that this approach would allow for application-specific algorithms to focus directly on regions of high OOA likelihood, which would (1) reduce the need for human intervention, and (2) reduce the propensity for false positives. Using the dual perspective, this technique would allow for algorithms to focus on

  15. Shape regression machine and efficient segmentation of left ventricle endocardium from 2D B-mode echocardiogram.

    PubMed

    Zhou, Shaohua Kevin

    2010-08-01

    We present a machine learning approach called shape regression machine (SRM) for efficient segmentation of an anatomic structure that exhibits a deformable shape in a medical image, e.g., left ventricle endocardial wall in an echocardiogram. The SRM achieves efficient segmentation via statistical learning of the interrelations among shape, appearance, and anatomy, which are exemplified by an annotated database. The SRM is a two-stage approach. In the first stage that estimates a rigid shape to solve an automatic initialization problem, it derives a regression solution to object detection that needs just one scan in principle and a sparse set of scans in practice, avoiding the exhaustive scanning required by the state-of-the-art classification-based detection approach while yielding comparable detection accuracy. In the second stage that estimates the nonrigid shape, it again learns a nonlinear regressor to directly associate nonrigid shape with image appearance. The underpinning of both stages is a novel image-based boosting ridge regression (IBRR) method that enables multivariate, nonlinear modeling and accommodates fast evaluation. We demonstrate the efficiency and effectiveness of the SRM using experiments on segmenting the left ventricle endocardium from a B-mode echocardiogram of apical four chamber view. The proposed algorithm is able to automatically detect and accurately segment the LV endocardial border in about 120ms.

  16. Segmental neuromyotonia

    PubMed Central

    Panwar, Ajay; Junewar, Vivek; Sahu, Ritesh; Shukla, Rakesh

    2015-01-01

    Unilateral focal neuromyotonia has been rarely reported in fingers or extraocular muscles. We report a case of segmental neuromyotonia in a 20-year-old boy who presented to us with intermittent tightness in right upper limb. Electromyography revealed myokymic and neuromyotonic discharges in proximal as well as distal muscles of the right upper limb. Patient's symptoms responded well to phenytoin therapy. Such an atypical involvement of two contiguous areas of a single limb in neuromyotonia has not been reported previously. Awareness of such an atypical presentation of the disease can be important in timely diagnosis and treatment of a patient. PMID:26167035

  17. TH-E-BRE-04: An Online Replanning Algorithm for VMAT

    SciTech Connect

    Ahunbay, E; Li, X; Moreau, M

    2014-06-15

    Purpose: To develop a fast replanning algorithm based on segment aperture morphing (SAM) for online replanning of volumetric modulated arc therapy (VMAT) with flattening filtered (FF) and flattening filter free (FFF) beams. Methods: A software tool was developed to interface with a VMAT planning system ((Monaco, Elekta), enabling the output of detailed beam/machine parameters of original VMAT plans generated based on planning CTs for FF or FFF beams. A SAM algorithm, previously developed for fixed-beam IMRT, was modified to allow the algorithm to correct for interfractional variations (e.g., setup error, organ motion and deformation) by morphing apertures based on the geometric relationship between the beam's eye view of the anatomy from the planning CT and that from the daily CT for each control point. The algorithm was tested using daily CTs acquired using an in-room CT during daily IGRT for representative prostate cancer cases along with their planning CTs. The algorithm allows for restricted MLC leaf travel distance between control points of the VMAT delivery to prevent SAM from increasing leaf travel, and therefore treatment delivery time. Results: The VMAT plans adapted to the daily CT by SAM were found to improve the dosimetry relative to the IGRT repositioning plans for both FF and FFF beams. For the adaptive plans, the changes in leaf travel distance between control points were < 1cm for 80% of the control points with no restriction. When restricted to the original plans' maximum travel distance, the dosimetric effect was minimal. The adaptive plans were delivered successfully with similar delivery times as the original plans. The execution of the SAM algorithm was < 10 seconds. Conclusion: The SAM algorithm can quickly generate deliverable online-adaptive VMAT plans based on the anatomy of the day for both FF and FFF beams.

  18. Anal anatomy and normal histology.

    PubMed

    Pandey, Priti

    2012-12-01

    The focus of this article is the anatomy and histology of the anal canal, and its clinical relevance to anal cancers. The article also highlights the recent histological and anatomical changes to the traditional terminology of the anal canal. The terminology has been adopted by the American Joint Committee on Cancer, separating the anal region into the anal canal, the perianal region and the skin. This paper describes the gross anatomy of the anal canal, along with its associated blood supply, venous and lymphatic drainage, and nerve supply. The new terminology referred to in this article may assist clinicians and health care providers to identify lesions more precisely through naked eye observation and without the need for instrumentation. Knowledge of the regional anatomy of the anus will also assist in management decisions.

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

    PubMed

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

    2006-08-01

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

  20. MO-C-17A-11: A Segmentation and Point Matching Enhanced Deformable Image Registration Method for Dose Accumulation Between HDR CT Images

    SciTech Connect

    Zhen, X; Chen, H; Zhou, L; Yan, H; Jiang, S; Jia, X; Gu, X; Mell, L; Yashar, C; Cervino, L

    2014-06-15

    Purpose: To propose and validate a novel and accurate deformable image registration (DIR) scheme to facilitate dose accumulation among treatment fractions of high-dose-rate (HDR) gynecological brachytherapy. Method: We have developed a method to adapt DIR algorithms to gynecologic anatomies with HDR applicators by incorporating a segmentation step and a point-matching step into an existing DIR framework. In the segmentation step, random walks algorithm is used to accurately segment and remove the applicator region (AR) in the HDR CT image. A semi-automatic seed point generation approach is developed to obtain the incremented foreground and background point sets to feed the random walks algorithm. In the subsequent point-matching step, a feature-based thin-plate spline-robust point matching (TPS-RPM) algorithm is employed for AR surface point matching. With the resulting mapping, a DVF characteristic of the deformation between the two AR surfaces is generated by B-spline approximation, which serves as the initial DVF for the following Demons DIR between the two AR-free HDR CT images. Finally, the calculated DVF via Demons combined with the initial one serve as the final DVF to map doses between HDR fractions. Results: The segmentation and registration accuracy are quantitatively assessed by nine clinical HDR cases from three gynecological cancer patients. The quantitative results as well as the visual inspection of the DIR indicate that our proposed method can suppress the interference of the applicator with the DIR algorithm, and accurately register HDR CT images as well as deform and add interfractional HDR doses. Conclusions: We have developed a novel and robust DIR scheme that can perform registration between HDR gynecological CT images and yield accurate registration results. This new DIR scheme has potential for accurate interfractional HDR dose accumulation. This work is supported in part by the National Natural ScienceFoundation of China (no 30970866 and no

  1. [Imaging anatomy of cranial nerves].

    PubMed

    Hermier, M; Leal, P R L; Salaris, S F; Froment, J-C; Sindou, M

    2009-04-01

    Knowledge of the anatomy of the cranial nerves is mandatory for optimal radiological exploration and interpretation of the images in normal and pathological conditions. CT is the method of choice for the study of the skull base and its foramina. MRI explores the cranial nerves and their vascular relationships precisely. Because of their small size, it is essential to obtain images with high spatial resolution. The MRI sequences optimize contrast between nerves and surrounding structures (cerebrospinal fluid, fat, bone structures and vessels). This chapter discusses the radiological anatomy of the cranial nerves.

  2. Adaptive image segmentation by quantization

    NASA Astrophysics Data System (ADS)

    Liu, Hui; Yun, David Y.

    1992-12-01

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

  3. Image Segmentation Using Hierarchical Merge Tree

    NASA Astrophysics Data System (ADS)

    Liu, Ting; Seyedhosseini, Mojtaba; Tasdizen, Tolga

    2016-10-01

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

  4. Salient Segmentation of Medical Time Series Signals

    PubMed Central

    Woodbridge, Jonathan; Lan, Mars; Sarrafzadeh, Majid; Bui, Alex

    2016-01-01

    Searching and mining medical time series databases is extremely challenging due to large, high entropy, and multidimensional datasets. Traditional time series databases are populated using segments extracted by a sliding window. The resulting database index contains an abundance of redundant time series segments with little to no alignment. This paper presents the idea of “salient segmentation”. Salient segmentation is a probabilistic segmentation technique for populating medical time series databases. Segments with the lowest probabilities are considered salient and are inserted into the index. The resulting index has little redundancy and is composed of aligned segments. This approach reduces index sizes by more than 98% over conventional sliding window techniques. Furthermore, salient segmentation can reduce redundancy in motif discovery algorithms by more than 85%, yielding a more succinct representation of a time series signal.

  5. The Anatomy of Anatomy: A Review for Its Modernization

    ERIC Educational Resources Information Center

    Sugand, Kapil; Abrahams, Peter; Khurana, Ashish

    2010-01-01

    Anatomy has historically been a cornerstone in medical education regardless of nation or specialty. Until recently, dissection and didactic lectures were its sole pedagogy. Teaching methodology has been revolutionized with more reliance on models, imaging, simulation, and the Internet to further consolidate and enhance the learning experience.…

  6. Anatomy Adventure: A Board Game for Enhancing Understanding of Anatomy

    ERIC Educational Resources Information Center

    Anyanwu, Emeka G.

    2014-01-01

    Certain negative factors such as fear, loss of concentration and interest in the course, lack of confidence, and undue stress have been associated with the study of anatomy. These are factors most often provoked by the unusually large curriculum, nature of the course, and the psychosocial impact of dissection. As a palliative measure, Anatomy…

  7. Clinical anatomy research in a research-driven anatomy department.

    PubMed

    Jones, D Gareth; Dias, G J; Mercer, S; Zhang, M; Nicholson, H D

    2002-05-01

    Clinical anatomy is too often viewed as a discipline that reiterates the wisdom of the past, characterized more by description of what is known than by active investigation and critical analysis of hypotheses and ideas. Various misconceptions follow from an acceptance of this premise: the teaching of clinical anatomists is textbook based, there is no clinical anatomy research worthy of the name, and any research that does exist fails to utilize modern technology and does not stand comparison with serious biomedical research as found in cell and molecular biology. The aim of this paper is to challenge each of these contentions by reference to ongoing clinical research studies within this department. It is argued that all teaching (including that of clinical anatomy) should be research-informed and that the discipline of clinical anatomy should have at its base a vigorous research ethos driven by clinically related problems. In interacting with physicians, the role of the clinical anatomist should be to promulgate a questioning scientific spirit, with its willingness to test and challenge accepted anatomic dicta. PMID:11948960

  8. The relationship of callosal anatomy to paw preference in dogs.

    PubMed

    Aydinlioglu, A A; Arslanirli, K A; Riza Erdogan, M A; Ragbetli, M C; Keleş, P; Diyarbakirli, S

    2000-04-01

    Previous studies have described the paw preference and asymmetry in dog brains, based on experimental studies. The purpose of the present study is to investigate a possible association between callosal anatomy and paw preference in dogs. The midsagittal area of the dog corpus callosum was measured in its entirety and in six subdivisions in a sample of 21 brains obtained from 9 male and 12 female mongrel dogs which had paw preference testing. The present study showed significant paw differences in dog corpus callosum. A posterior segment of the callosum, the isthmus, was significantly larger in the right pawedness than the left.

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

    NASA Astrophysics Data System (ADS)

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

    2016-06-01

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

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

    PubMed

    Chantelau, K

    1997-08-01

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

  11. Optimal segmentation and packaging process

    DOEpatents

    Kostelnik, K.M.; Meservey, R.H.; Landon, M.D.

    1999-08-10

    A process for improving packaging efficiency uses three dimensional, computer simulated models with various optimization algorithms to determine the optimal segmentation process and packaging configurations based on constraints including container limitations. The present invention is applied to a process for decontaminating, decommissioning (D and D), and remediating a nuclear facility involving the segmentation and packaging of contaminated items in waste containers in order to minimize the number of cuts, maximize packaging density, and reduce worker radiation exposure. A three-dimensional, computer simulated, facility model of the contaminated items are created. The contaminated items are differentiated. The optimal location, orientation and sequence of the segmentation and packaging of the contaminated items is determined using the simulated model, the algorithms, and various constraints including container limitations. The cut locations and orientations are transposed to the simulated model. The contaminated items are actually segmented and packaged. The segmentation and packaging may be simulated beforehand. In addition, the contaminated items may be cataloged and recorded. 3 figs.

  12. On the Anatomy of Understanding

    ERIC Educational Resources Information Center

    Wilhelmsson, Niklas; Dahlgren, Lars Owe; Hult, Hakan; Josephson, Anna

    2011-01-01

    In search for the nature of understanding of basic science in a clinical context, eight medical students were interviewed, with a focus on their view of the discipline of anatomy, in their fourth year of study. Interviews were semi-structured and took place just after the students had finished their surgery rotations. Phenomenographic analysis was…

  13. Curriculum Guidelines for Microscopic Anatomy.

    ERIC Educational Resources Information Center

    Journal of Dental Education, 1993

    1993-01-01

    The American Association of Dental Schools' guidelines for curricula in microscopic anatomy offer an overview of the histology curriculum, note primary educational goals, outline specific content for general and oral histology, suggest prerequisites, and make recommendations for sequencing. Appropriate faculty and facilities are also suggested.…

  14. Anatomy of the thymus gland.

    PubMed

    Safieddine, Najib; Keshavjee, Shaf

    2011-05-01

    In the case of the thymus gland, the most common indications for resection are myasthenia gravis or thymoma. The consistency and appearance of the thymus gland make it difficult at times to discern from mediastinal fatty tissues. Having a clear understanding of the anatomy and the relationship of the gland to adjacent structures is important.

  15. Lymphatic anatomy and biomechanics.

    PubMed

    Negrini, Daniela; Moriondo, Andrea

    2011-06-15

    Lymph formation is driven by hydraulic pressure gradients developing between the interstitial tissue and the lumen of initial lymphatics. While in vessels equipped with lymphatic smooth muscle cells these gradients are determined by well-synchronized spontaneous contractions of vessel segments, initial lymphatics devoid of smooth muscles rely on tissue motion to form lymph and propel it along the network. Lymphatics supplying highly moving tissues, such as skeletal muscle, diaphragm or thoracic tissues, undergo cyclic compression and expansion of their lumen imposed by local stresses arising in the tissue as a consequence of cardiac and respiratory activities. Active muscle contraction and not passive tissue displacement is required to support an efficient lymphatic drainage, as suggested by the fact that the respiratory activity promotes lymph formation during spontaneous, but not mechanical ventilation. The mechanical properties of the lymphatic wall and of the surrounding tissue also play an important role in lymphatic function. Modelling of stress distribution in the lymphatic wall suggests that compliant vessels behave as reservoirs accommodating absorbed interstitial fluid, while lymphatics with stiffer walls, taking advantage of a more efficient transmission of tissue stresses to the lymphatic lumen, propel fluid through the lumen of the lymphatic circuit.

  16. On the evaluation of segmentation editing tools

    PubMed Central

    Heckel, Frank; Moltz, Jan H.; Meine, Hans; Geisler, Benjamin; Kießling, Andreas; D’Anastasi, Melvin; dos Santos, Daniel Pinto; Theruvath, Ashok Joseph; Hahn, Horst K.

    2014-01-01

    Abstract. Efficient segmentation editing tools are important components in the segmentation process, as no automatic methods exist that always generate sufficient results. Evaluating segmentation editing algorithms is challenging, because their quality depends on the user’s subjective impression. So far, no established methods for an objective, comprehensive evaluation of such tools exist and, particularly, intermediate segmentation results are not taken into account. We discuss the evaluation of editing algorithms in the context of tumor segmentation in computed tomography. We propose a rating scheme to qualitatively measure the accuracy and efficiency of editing tools in user studies. In order to objectively summarize the overall quality, we propose two scores based on the subjective rating and the quantified segmentation quality over time. Finally, a simulation-based evaluation approach is discussed, which allows a more reproducible evaluation without the need for human input. This automated evaluation complements user studies, allowing a more convincing evaluation, particularly during development, where frequent user studies are not possible. The proposed methods have been used to evaluate two dedicated editing algorithms on 131 representative tumor segmentations. We show how the comparison of editing algorithms benefits from the proposed methods. Our results also show the correlation of the suggested quality score with the qualitative ratings. PMID:26158063

  17. Intrahepatic Vascular Anatomy in Rats and Mice—Variations and Surgical Implications

    PubMed Central

    Sänger, Constanze; Schenk, Andrea; Schwen, Lars Ole; Wang, Lei; Gremse, Felix; Zafarnia, Sara; Kiessling, Fabian; Xie, Chichi; Wei, Weiwei; Richter, Beate; Dirsch, Olaf; Dahmen, Uta

    2015-01-01

    Introduction The intra-hepatic vascular anatomy in rodents, its variations and corresponding supplying and draining territories in respect to the lobar structure of the liver have not been described. We performed a detailed anatomical imaging study in rats and mice to allow for further refinement of experimental surgical approaches. Methods LEWIS-Rats and C57Bl/6N-Mice were subjected to ex-vivo imaging using μCT. The image data were used for semi-automated segmentation to extract the hepatic vascular tree as prerequisite for 3D visualization. The underlying vascular anatomy was reconstructed, analysed and used for determining hepatic vascular territories. Results The four major liver lobes have their own lobar portal supply and hepatic drainage territories. In contrast, the paracaval liver is supplied by various small branches from right and caudate portal veins and drains directly into the vena cava. Variations in hepatic vascular anatomy were observed in terms of branching pattern and distance of branches to each other. The portal vein anatomy is more variable than the hepatic vein anatomy. Surgically relevant variations were primarily observed in portal venous supply. Conclusions For the first time the key variations of intrahepatic vascular anatomy in mice and rats and their surgical implications were described. We showed that lobar borders of the liver do not always match vascular territorial borders. These findings are of importance for the design of new surgical procedures and for understanding eventual complications following hepatic surgery. PMID:26618494

  18. Anatomy- vs. fluence-based planning for prostate cancer treatments using VMAT.

    PubMed

    Andreou, Maria; Karaiskos, Pantelis; Kordolaimi, Sofia; Koutsouveli, Efi; Sandilos, Panagiotis; Dimitriou, Panagiotis; Dardoufas, Constantinos; Georgiou, Enavgelos

    2014-03-01

    The purpose of this study was to compare the planning approaches used in two treatment planning systems (TPS) provided by Elekta for VMAT treatments. Ten prostate patients were studied retrospectively. Plan comparison was performed in terms of delivery efficiency and accuracy, as well as in terms of target coverage and critical organ protection by utilizing physical and radiobiological indices. These include: DVH (dose volume histogram) values, CI (conformity index), HI(%) (homogeneity index) and TCP (tumor control probability) for target coverage; mean doses, DVH values, dose to the normal non-target tissue, NTCP (normal tissue complication probability) and GI (gradient index) for critical organ sparing; MU/fraction and treatment time for delivery efficiency. The comparisons were performed using the two-sided Wilcoxon matched-pair signed rank test. Plans generated using the anatomy-based approach in ERGO++ and fluence-based approach in Monaco were found similar in terms of target coverage and TCP values, as well as in terms of rectum protection and corresponding NTCP values. The former exhibited increased delivery efficiency (comparable to that of 3D conformal radiotherapy) due to the relatively larger segments used. On the other hand advantages of the fluence-based approach in Monaco include increased conformity, better target dose homogeneity and higher dose gradient (lower dose to normal non-target-tissue) mainly due to the higher degree of modulation offered by the fluence-based approach, while the Monte Carlo algorithm used for dose calculation provides plans with increased accuracy despite the relatively small segments used.

  19. Seismic volumetric flattening and segmentation

    NASA Astrophysics Data System (ADS)

    Lomask, Jesse

    Two novel algorithms provide seismic interpretation solutions that use the full dimensionality of the data. The first is volumetric flattening and the second is image segmentation for tracking salt boundaries. Volumetric flattening is an efficient full-volume automatic dense-picking method applied to seismic data. First local dips (step-outs) are calculated over the entire seismic volume. The dips are then resolved into time shifts (or depth shifts) in a least-squares sense. To handle faults (discontinuous reflections), I apply a weighted inversion scheme. Additional information is incorporated in this flattening algorithm as geological constraints. The method is tested successfully on both synthetic and field data sets of varying degrees of complexity including salt piercements, angular unconformities, and laterally limited faults. The second full-volume interpretation method uses normalized cuts image segmentation to track salt interfaces. I apply a modified version of the normalized cuts image segmentation (NCIS) method to partition seismic images along salt interfaces. The method is capable of tracking interfaces that are not continuous, where conventional horizon tracking algorithms may fail. This method partitions the seismic image into two groups. One group is inside the salt body and the other is outside. Where the two groups meet is the salt boundary. By imposing bounds and by distributing the algorithm on a parallel cluster, I significantly increase efficiency and robustness. This method is demonstrated to be effective on both 2D and 3D seismic data sets.

  20. Segmenting images analytically in shape space

    NASA Astrophysics Data System (ADS)

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

    2008-03-01

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

  1. Automatic setae segmentation from Chaetoceros microscopic images.

    PubMed

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

    2014-09-01

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

  2. The future of gross anatomy teaching.

    PubMed

    Malamed, S; Seiden, D

    1995-01-01

    A survey of U.S. departments of anatomy, physiology, and biochemistry shows that 39% of the respondent anatomy departments reported declines in the numbers of graduate students taking the human gross anatomy course. Similarly, 42% of the departments reported decreases in the numbers of graduate students teaching human gross anatomy. These decreases were greater in anatomy than in physiology and in biochemistry. The percentages of departments reporting increases in students taking or teaching their courses was 6% for human gross anatomy and 0% to 19% for physiology and biochemistry courses. To reverse this trend the establishment of specific programs for the training of gross anatomy teachers is advocated. These new teachers will be available as the need for them is increasingly recognized in the future.

  3. Anatomy of Teaching Anatomy: Do Prosected Cross Sections Improve Students Understanding of Spatial and Radiological Anatomy?

    PubMed Central

    Vithoosan, S.; Kokulan, S.; Dissanayake, M. M.; Dissanayake, Vajira; Jayasekara, Rohan

    2016-01-01

    Introduction. Cadaveric dissections and prosections have traditionally been part of undergraduate medical teaching. Materials and Methods. Hundred and fifty-nine first-year students in the Faculty of Medicine, University of Colombo, were invited to participate in the above study. Students were randomly allocated to two age and gender matched groups. Both groups were exposed to identical series of lectures regarding anatomy of the abdomen and conventional cadaveric prosections of the abdomen. The test group (n = 77, 48.4%) was also exposed to cadaveric cross-sectional slices of the abdomen to which the control group (n = 82, 51.6%) was blinded. At the end of the teaching session both groups were assessed by using their performance in a timed multiple choice question paper as well as ability to identify structures in abdominal CT films. Results. Scores for spatial and radiological anatomy were significantly higher among the test group when compared with the control group (P < 0.05, CI 95%). Majority of the students in both control and test groups agreed that cadaveric cross section may be useful for them to understand spatial and radiological anatomy. Conclusion. Introduction of cadaveric cross-sectional prosections may help students to understand spatial and radiological anatomy better. PMID:27579181

  4. Classic versus millennial medical lab anatomy.

    PubMed

    Benninger, Brion; Matsler, Nik; Delamarter, Taylor

    2014-10-01

    This study investigated the integration, implementation, and use of cadaver dissection, hospital radiology modalities, surgical tools, and AV technology during a 12-week contemporary anatomy course suggesting a millennial laboratory. The teaching of anatomy has undergone the greatest fluctuation of any of the basic sciences during the past 100 years in order to make room for the meteoric rise in molecular sciences. Classically, anatomy consisted of a 2-year methodical, horizontal, anatomy course; anatomy has now morphed into a 12-week accelerated course in a vertical curriculum, at most institutions. Surface and radiological anatomy is the language for all clinicians regardless of specialty. The objective of this study was to investigate whether integration of full-body dissection anatomy and modern hospital technology, during the anatomy laboratory, could be accomplished in a 12-week anatomy course. Literature search was conducted on anatomy text, journals, and websites regarding contemporary hospital technology integrating multiple image mediums of 37 embalmed cadavers, surgical suite tools and technology, and audio/visual technology. Surgical and radiology professionals were contracted to teach during the anatomy laboratory. Literature search revealed no contemporary studies integrating full-body dissection with hospital technology and behavior. About 37 cadavers were successfully imaged with roentograms, CT, and MRI scans. Students were in favor of the dynamic laboratory consisting of multiple activity sessions occurring simultaneously. Objectively, examination scores proved to be a positive outcome and, subjectively, feedback from students was overwhelmingly positive. Despite the surging molecular based sciences consuming much of the curricula, full-body dissection anatomy is irreplaceable regarding both surface and architectural, radiological anatomy. Radiology should not be a small adjunct to understand full-body dissection, but rather, full-body dissection

  5. A statistically based flow for image segmentation.

    PubMed

    Pichon, Eric; Tannenbaum, Allen; Kikinis, Ron

    2004-09-01

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

  6. Anatomy of a Bird

    NASA Astrophysics Data System (ADS)

    2007-12-01

    Using ESO's Very Large Telescope, an international team of astronomers [1] has discovered a stunning rare case of a triple merger of galaxies. This system, which astronomers have dubbed 'The Bird' - albeit it also bears resemblance with a cosmic Tinker Bell - is composed of two massive spiral galaxies and a third irregular galaxy. ESO PR Photo 55a/07 ESO PR Photo 55a/07 The Tinker Bell Triplet The galaxy ESO 593-IG 008, or IRAS 19115-2124, was previously merely known as an interacting pair of galaxies at a distance of 650 million light-years. But surprises were revealed by observations made with the NACO instrument attached to ESO's VLT, which peered through the all-pervasive dust clouds, using adaptive optics to resolve the finest details [2]. Underneath the chaotic appearance of the optical Hubble images - retrieved from the Hubble Space Telescope archive - the NACO images show two unmistakable galaxies, one a barred spiral while the other is more irregular. The surprise lay in the clear identification of a third, clearly separate component, an irregular, yet fairly massive galaxy that seems to be forming stars at a frantic rate. "Examples of mergers of three galaxies of roughly similar sizes are rare," says Petri Väisänen, lead author of the paper reporting the results. "Only the near-infrared VLT observations made it possible to identify the triple merger nature of the system in this case." Because of the resemblance of the system to a bird, the object was dubbed as such, with the 'head' being the third component, and the 'heart' and 'body' making the two major galaxy nuclei in-between of tidal tails, the 'wings'. The latter extend more than 100,000 light-years, or the size of our own Milky Way. ESO PR Photo 55b/07 ESO PR Photo 55b/07 Anatomy of a Bird Subsequent optical spectroscopy with the new Southern African Large Telescope, and archive mid-infrared data from the NASA Spitzer space observatory, confirmed the separate nature of the 'head', but also added

  7. Segmentation of clustered nuclei based on concave curve expansion.

    PubMed

    Zhang, C; Sun, C; Pham, T D

    2013-07-01

    Segmentation of nuclei from images of tissue sections is important for many biological and biomedical studies. Many existing image segmentation algorithms may lead to oversegmentation or undersegmentation for clustered nuclei images. In this paper, we proposed a new image segmentation algorithm based on concave curve expansion to correctly and accurately extract markers from the original images. Marker-controlled watershed is then used to segment the clustered nuclei. The algorithm was tested on both synthetic and real images and better results are achieved compared with some other state-of-the-art methods.

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

    PubMed

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

    2006-01-01

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

  9. CT-based manual segmentation and evaluation of paranasal sinuses.

    PubMed

    Pirner, S; Tingelhoff, K; Wagner, I; Westphal, R; Rilk, M; Wahl, F M; Bootz, F; Eichhorn, Klaus W G

    2009-04-01

    Manual segmentation of computed tomography (CT) datasets was performed for robot-assisted endoscope movement during functional endoscopic sinus surgery (FESS). Segmented 3D models are needed for the robots' workspace definition. A total of 50 preselected CT datasets were each segmented in 150-200 coronal slices with 24 landmarks being set. Three different colors for segmentation represent diverse risk areas. Extension and volumetric measurements were performed. Three-dimensional reconstruction was generated after segmentation. Manual segmentation took 8-10 h for each CT dataset. The mean volumes were: right maxillary sinus 17.4 cm(3), left side 17.9 cm(3), right frontal sinus 4.2 cm(3), left side 4.0 cm(3), total frontal sinuses 7.9 cm(3), sphenoid sinus right side 5.3 cm(3), left side 5.5 cm(3), total sphenoid sinus volume 11.2 cm(3). Our manually segmented 3D-models present the patient's individual anatomy with a special focus on structures in danger according to the diverse colored risk areas. For safe robot assistance, the high-accuracy models represent an average of the population for anatomical variations, extension and volumetric measurements. They can be used as a database for automatic model-based segmentation. None of the segmentation methods so far described provide risk segmentation. The robot's maximum distance to the segmented border can be adjusted according to the differently colored areas.

  10. Automatic segmentation of phase-correlated CT scans through nonrigid image registration using geometrically regularized free-form deformation

    SciTech Connect

    Shekhar, Raj; Lei, Peng; Castro-Pareja, Carlos R.; Plishker, William L.; D'Souza, Warren D.

    2007-07-15

    Conventional radiotherapy is planned using free-breathing computed tomography (CT), ignoring the motion and deformation of the anatomy from respiration. New breath-hold-synchronized, gated, and four-dimensional (4D) CT acquisition strategies are enabling radiotherapy planning utilizing a set of CT scans belonging to different phases of the breathing cycle. Such 4D treatment planning relies on the availability of tumor and organ contours in all phases. The current practice of manual segmentation is impractical for 4D CT, because it is time consuming and tedious. A viable solution is registration-based segmentation, through which contours provided by an expert for a particular phase are propagated to all other phases while accounting for phase-to-phase motion and anatomical deformation. Deformable image registration is central to this task, and a free-form deformation-based nonrigid image registration algorithm will be presented. Compared with the original algorithm, this version uses novel, computationally simpler geometric constraints to preserve the topology of the dense control-point grid used to represent free-form deformation and prevent tissue fold-over. Using mean squared difference as an image similarity criterion, the inhale phase is registered to the exhale phase of lung CT scans of five patients and of characteristically low-contrast abdominal CT scans of four patients. In addition, using expert contours for the inhale phase, the corresponding contours were automatically generated for the exhale phase. The accuracy of the segmentation (and hence deformable image registration) was judged by comparing automatically segmented contours with expert contours traced directly in the exhale phase scan using three metrics: volume overlap index, root mean square distance, and Hausdorff distance. The accuracy of the segmentation (in terms of radial distance mismatch) was approximately 2 mm in the thorax and 3 mm in the abdomen, which compares favorably to the

  11. Poster — Thur Eve — 70: Automatic lung bronchial and vessel bifurcations detection algorithm for deformable image registration assessment

    SciTech Connect

    Labine, Alexandre; Carrier, Jean-François; Bedwani, Stéphane; Chav, Ramnada; De Guise, Jacques

    2014-08-15

    Purpose: To investigate an automatic bronchial and vessel bifurcations detection algorithm for deformable image registration (DIR) assessment to improve lung cancer radiation treatment. Methods: 4DCT datasets were acquired and exported to Varian treatment planning system (TPS) EclipseTM for contouring. The lungs TPS contour was used as the prior shape for a segmentation algorithm based on hierarchical surface deformation that identifies the deformed lungs volumes of the 10 breathing phases. Hounsfield unit (HU) threshold filter was applied within the segmented lung volumes to identify blood vessels and airways. Segmented blood vessels and airways were skeletonised using a hierarchical curve-skeleton algorithm based on a generalized potential field approach. A graph representation of the computed skeleton was generated to assign one of three labels to each node: the termination node, the continuation node or the branching node. Results: 320 ± 51 bifurcations were detected in the right lung of a patient for the 10 breathing phases. The bifurcations were visually analyzed. 92 ± 10 bifurcations were found in the upper half of the lung and 228 ± 45 bifurcations were found in the lower half of the lung. Discrepancies between ten vessel trees were mainly ascribed to large deformation and in regions where the HU varies. Conclusions: We established an automatic method for DIR assessment using the morphological information of the patient anatomy. This approach allows a description of the lung's internal structure movement, which is needed to validate the DIR deformation fields for accurate 4D cancer treatment planning.

  12. CDIS: Circle Density Based Iris Segmentation

    NASA Astrophysics Data System (ADS)

    Gupta, Anand; Kumari, Anita; Kundu, Boris; Agarwal, Isha

    Biometrics is an automated approach of measuring and analysing physical and behavioural characteristics for identity verification. The stability of the Iris texture makes it a robust biometric tool for security and authentication purposes. Reliable Segmentation of Iris is a necessary precondition as an error at this stage will propagate into later stages and requires proper segmentation of non-ideal images having noises like eyelashes, etc. Iris Segmentation work has been done earlier but we feel it lacks in detecting iris in low contrast images, removal of specular reflections, eyelids and eyelashes. Hence, it motivates us to enhance the said parameters. Thus, we advocate a new approach CDIS for Iris segmentation along with new algorithms for removal of eyelashes, eyelids and specular reflections and pupil segmentation. The results obtained have been presented using GAR vs. FAR graphs at the end and have been compared with prior works related to segmentation of iris.

  13. Random walks for image segmentation.

    PubMed

    Grady, Leo

    2006-11-01

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

  14. Polyp Segmentation in NBI Colonoscopy

    NASA Astrophysics Data System (ADS)

    Gross, Sebastian; Kennel, Manuel; Stehle, Thomas; Wulff, Jonas; Tischendorf, Jens; Trautwein, Christian; Aach, Til

    Endoscopic screening of the colon (colonoscopy) is performed to prevent cancer and to support therapy. During intervention colon polyps are located, inspected and, if need be, removed by the investigator. We propose a segmentation algorithm as a part of an automatic polyp classification system for colonoscopic Narrow-Band images. Our approach includes multi-scale filtering for noise reduction, suppression of small blood vessels, and enhancement of major edges. Results of the subsequent edge detection are compared to a set of elliptic templates and evaluated. We validated our algorithm on our polyp database with images acquired during routine colonoscopic examinations. The presented results show the reliable segmentation performance of our method and its robustness to image variations.

  15. Algorithm for Constructing Contour Plots

    NASA Technical Reports Server (NTRS)

    Johnson, W.; Silva, F.

    1984-01-01

    General computer algorithm developed for construction of contour plots. algorithm accepts as input data values at set of points irregularly distributed over plane. Algorithm based on interpolation scheme: points in plane connected by straight-line segments to form set of triangles. Program written in FORTRAN IV.

  16. Algorithms and Algorithmic Languages.

    ERIC Educational Resources Information Center

    Veselov, V. M.; Koprov, V. M.

    This paper is intended as an introduction to a number of problems connected with the description of algorithms and algorithmic languages, particularly the syntaxes and semantics of algorithmic languages. The terms "letter, word, alphabet" are defined and described. The concept of the algorithm is defined and the relation between the algorithm and…

  17. [Surgical anatomy of the nose].

    PubMed

    Nguyen, P S; Bardot, J; Duron, J B; Jallut, Y; Aiach, G

    2014-12-01

    Thorough knowledge of the anatomy of the nose is an essential prerequisite for preoperative analysis and the understanding of surgical techniques. Like a tent supported by its frame, the nose is an osteo-chondral structure covered by a peri-chondroperiosteal envelope, muscle and cutaneous covering tissues. For didactic reasons, we have chosen to treat this chapter in the form of comments from eight key configurations that the surgeon should acquire before performing rhinoplasty.

  18. [Functional dental anatomy and amalgam].

    PubMed

    Tavernier, B; Colon, P

    1989-01-01

    Very often, the functional dental anatomy are reflected during the rehabilitation of posterior quadrants. However, the placement, the shaping in correct relation of the different dental components are indispensable conditions to respect, in order to achieve an adequate integration of the restoration within the neuro-muscular system. A clinical protocol is proposed in order to reconcile the anatomical and biological prerequisite and the setting time of modern alloys.

  19. Anatomy of the infant head

    SciTech Connect

    Bosma, J.F.

    1986-01-01

    This text is mainly an atlas of illustration representing the dissection of the head and upper neck of the infant. It was prepared by the author over a 20-year period. The commentary compares the anatomy of the near-term infant with that of a younger fetus, child, and adult. As the author indicates, the dearth of anatomic information about postnatal anatomic changes represents a considerable handicap to those imaging infants. In part 1 of the book, anatomy is related to physiologic performance involving the pharynx, larynx, and mouth. Sequential topics involve the regional anatomy of the head (excluding the brain), the skeleton of the cranium, the nose, orbit, mouth, larynx, pharynx, and ear. To facilitate use of this text as a reference, the illustrations and text on individual organs are considered separately (i.e., the nose, the orbit, the eye, the mouth, the larynx, the pharynx, and the ear). Each part concerned with a separate organ includes materials from the regional illustrations contained in part 2 and from the skeleton, which is treated in part 3. Also included in a summary of the embryologic and fetal development of the organ.

  20. Segmentation of individual ribs from low-dose chest CT

    NASA Astrophysics Data System (ADS)

    Lee, Jaesung; Reeves, Anthony P.

    2010-03-01

    Segmentation of individual ribs and other bone structures in chest CT images is important for anatomical analysis, as the segmented ribs may be used as a baseline reference for locating organs within a chest as well as for identification and measurement of any geometric abnormalities in the bone. In this paper we present a fully automated algorithm to segment the individual ribs from low-dose chest CT scans. The proposed algorithm consists of four main stages. First, all the high-intensity bone structure present in the scan is segmented. Second, the centerline of the spinal canal is identified using a distance transform of the bone segmentation. Then, the seed region for every rib is detected based on the identified centerline, and each rib is grown from the seed region and separated from the corresponding vertebra. This algorithm was evaluated using 115 low-dose chest CT scans from public databases with various slice thicknesses. The algorithm parameters were determined using 5 scans, and remaining 110 scans were used to evaluate the performance of the segmentation algorithm. The outcome of the algorithm was inspected by an author for the correctness of the segmentation. The results indicate that over 98% of the individual ribs were correctly segmented with the proposed algorithm.

  1. Color segmentation using MDL clustering

    NASA Astrophysics Data System (ADS)

    Wallace, Richard S.; Suenaga, Yasuhito

    1991-02-01

    This paper describes a procedure for segmentation of color face images. A cluster analysis algorithm uses a subsample of the input image color pixels to detect clusters in color space. The clustering program consists of two parts. The first part searches for a hierarchical clustering using the NIHC algorithm. The second part searches the resultant cluster tree for a level clustering having minimum description length (MDL). One of the primary advantages of the MDL paradigm is that it enables writing robust vision algorithms that do not depend on user-specified threshold parameters or other " magic numbers. " This technical note describes an application of minimal length encoding in the analysis of digitized human face images at the NTT Human Interface Laboratories. We use MDL clustering to segment color images of human faces. For color segmentation we search for clusters in color space. Using only a subsample of points from the original face image our clustering program detects color clusters corresponding to the hair skin and background regions in the image. Then a maximum likelyhood classifier assigns the remaining pixels to each class. The clustering program tends to group small facial features such as the nostrils mouth and eyes together but they can be separated from the larger classes through connected components analysis.

  2. Dynamic 3D scanning as a markerless method to calculate multi-segment foot kinematics during stance phase: methodology and first application.

    PubMed

    Van den Herrewegen, Inge; Cuppens, Kris; Broeckx, Mario; Barisch-Fritz, Bettina; Vander Sloten, Jos; Leardini, Alberto; Peeraer, Louis

    2014-08-22

    Multi-segmental foot kinematics have been analyzed by means of optical marker-sets or by means of inertial sensors, but never by markerless dynamic 3D scanning (D3DScanning). The use of D3DScans implies a radically different approach for the construction of the multi-segment foot model: the foot anatomy is identified via the surface shape instead of distinct landmark points. We propose a 4-segment foot model consisting of the shank (Sha), calcaneus (Cal), metatarsus (Met) and hallux (Hal). These segments are manually selected on a static scan. To track the segments in the dynamic scan, the segments of the static scan are matched on each frame of the dynamic scan using the iterative closest point (ICP) fitting algorithm. Joint rotations are calculated between Sha-Cal, Cal-Met, and Met-Hal. Due to the lower quality scans at heel strike and toe off, the first and last 10% of the stance phase is excluded. The application of the method to 5 healthy subjects, 6 trials each, shows a good repeatability (intra-subject standard deviations between 1° and 2.5°) for Sha-Cal and Cal-Met joints, and inferior results for the Met-Hal joint (>3°). The repeatability seems to be subject-dependent. For the validation, a qualitative comparison with joint kinematics from a corresponding established marker-based multi-segment foot model is made. This shows very consistent patterns of rotation. The ease of subject preparation and also the effective and easy to interpret visual output, make the present technique very attractive for functional analysis of the foot, enhancing usability in clinical practice.

  3. Automatic evaluation of uterine cervix segmentations

    NASA Astrophysics Data System (ADS)

    Lotenberg, Shelly; Gordon, Shiri; Long, Rodney; Antani, Sameer; Jeronimo, Jose; Greenspan, Hayit

    2007-03-01

    In this work we focus on the generation of reliable ground truth data for a large medical repository of digital cervicographic images (cervigrams) collected by the National Cancer Institute (NCI). This work is part of an ongoing effort conducted by NCI together with the National Library of Medicine (NLM) at the National Institutes of Health (NIH) to develop a web-based database of the digitized cervix images in order to study the evolution of lesions related to cervical cancer. As part of this effort, NCI has gathered twenty experts to manually segment a set of 933 cervigrams into regions of medical and anatomical interest. This process yields a set of images with multi-expert segmentations. The objectives of the current work are: 1) generate multi-expert ground truth and assess the diffculty of segmenting an image, 2) analyze observer variability in the multi-expert data, and 3) utilize the multi-expert ground truth to evaluate automatic segmentation algorithms. The work is based on STAPLE (Simultaneous Truth and Performance Level Estimation), which is a well known method to generate ground truth segmentation maps from multiple experts' observations. We have analyzed both intra- and inter-expert variability within the segmentation data. We propose novel measures of "segmentation complexity" by which we can automatically identify cervigrams that were found difficult to segment by the experts, based on their inter-observer variability. Finally, the results are used to assess our own automated algorithm for cervix boundary detection.

  4. Pyramidal approach to license plate segmentation

    NASA Astrophysics Data System (ADS)

    Postolache, Alexandru; Trecat, Jacques C.

    1996-07-01

    Car identification is a goal in traffic control, transport planning, travel time measurement, managing parking lot traffic and so on. Most car identification algorithms contain a standalone plate segmentation process followed by a plate contents reading. A pyramidal algorithm for license plate segmentation, looking for textured regions, has been developed on a PC based system running Unix. It can be used directly in applications not requiring real time. When input images are relatively small, real-time performance is in fact accomplished by the algorithm. When using large images, porting the algorithm to special digital signal processors can easily lead to preserving real-time performance. Experimental results, for stationary and moving cars in outdoor scenes, showed high accuracy and high scores in detecting the plate. The algorithm also deals with cases where many character strings are present in the image, and not only the one corresponding to the plate. This is done by the means of a constrained texture regions classification.

  5. Segmentation of MR images for computer-assisted surgery of the lumbar spine

    NASA Astrophysics Data System (ADS)

    Hoad, C. L.; Martel, A. L.

    2002-10-01

    This paper describes a segmentation algorithm designed to separate bone from soft tissue in magnetic resonance (MR) images developed for computer-assisted surgery of the spine. The algorithm was applied to MR images of the spine of healthy volunteers. Registration experiments were carried out on a physical model of a spine generated from computed tomography (CT) data of a surgical patient. Segmented CT, manually segmented MR and MR images segmented using the developed algorithm were compared. The algorithm performed well at segmenting bone from soft tissue on images taken of healthy volunteers. Registration experiments showed similar results between the CT and MR data. The MR data, which were manually segmented, performed worse on visual verification experiments than both the CT and semi-automatic segmented data. The algorithm developed performs well at segmenting bone from soft tissue in MR images of the spine as measured using registration experiments.

  6. Digital tomosynthesis: technique modifications and clinical applications for neurovascular anatomy

    SciTech Connect

    Maravilla, K.R.; Murry, R.C. Jr.; Diehl, J.; Suss, R.; Allen, L.; Chang, K.; Crawford, J.; McCoy, R.

    1984-09-01

    Digital tomosynthesis studies (DTS) using a linear tomographic motion can provide good quality clinical images when combined with subtraction angiotomography. By modifying their hardware system and the computer software algorithms, the authors were able to reconstruct tomosynthesis images using an isocentric rotation (IR) motion. Applying a combination of linear tomographic and IR techniques in clinical cases, they performed DTS studies in six patients, five with aneurysms and one with a hypervascular tumor. The results showed detailed definitions of the pathologic entities and the regional neurovascular anatomy. Based on this early experience, DTS would seem to be a useful technique for the preoperative surgical planning of vascular abnormalities.

  7. [New findings of clinical anatomy in pelvis].

    PubMed

    Muraoka, Kuniyasu; Takenaka, Atsushi

    2016-01-01

    Surgical anatomy involves clarifying the mutual relationships of each structure in the operative field. Knowledge of new surgical anatomy has arisen via new methods or approaches. Associated with the development and spread of laparoscopic surgery in recent years, adaptation to changes in surgical techniques using knowledge of classical pelvic anatomy has been difficult. Better knowledge of the delicate structures surrounding the prostate is essential in order to provide both cancer control and functional preservation with regard to radical prostatectomy. In this report, we review the progress in knowledge of pelvic anatomy, particularly regarding the endopelvic fascia, prostatic fascia and Denonvilliers' fascia.

  8. Remediation Trends in an Undergraduate Anatomy Course and Assessment of an Anatomy Supplemental Study Skills Course

    ERIC Educational Resources Information Center

    Schutte, Audra Faye

    2013-01-01

    Anatomy A215: Basic Human Anatomy (Anat A215) is an undergraduate human anatomy course at Indiana University Bloomington (IUB) that serves as a requirement for many degree programs at IUB. The difficulty of the course, coupled with pressure to achieve grades for admittance into specific programs, has resulted in high remediation rates. In an…

  9. Colony image acquisition and segmentation

    NASA Astrophysics Data System (ADS)

    Wang, W. X.

    2007-12-01

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

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

    PubMed

    Xu, Hongming; Mandal, Mrinal

    2015-08-01

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

  11. Morphology and Functional Anatomy of the Recurrent Laryngeal Nerve with Extralaryngeal Terminal Bifurcation

    PubMed Central

    Dogan, Sami

    2016-01-01

    Anatomical variations of the recurrent laryngeal nerve (RLN), such as an extralaryngeal terminal bifurcation (ETB), threaten the safety of thyroid surgery. Besides the morphology of the nerve branches, intraoperative evaluation of their functional anatomy may be useful to preserve motor activity. We exposed 67 RLNs in 36 patients. The main trunk, bifurcation point, and terminal branches of bifid nerves were macroscopically determined and exposed during thyroid surgery. The functional anatomy of the nerve branches was evaluated by intraoperative nerve monitoring (IONM). Forty-six RLNs with an ETB were intraoperatively exposed. The bifurcation point was located along the prearterial, arterial, and postarterial segments in 11%, 39%, and 50% of bifid RLNs, respectively. Motor activity was determined in all anterior branches. The functional anatomy of terminal branches detected motor activity in 4 (8.7%) posterior branches of 46 bifid RLNs. The motor activity in posterior branches created a wave amplitude at 25–69% of that in the corresponding anterior branches. The functional anatomy of bifid RLNs demonstrated that anterior branches always contained motor fibres while posterior branches seldom contained motor fibres. The motor activity of the posterior branch was weaker than that of the anterior branch. IONM may help to differentiate between motor and sensory functions of nerve branches. The morphology and functional anatomy of all nerve branches must be preserved to ensure a safer surgery. PMID:27493803

  12. Simplified labeling process for medical image segmentation.

    PubMed

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

    2012-01-01

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

  13. Path planning by querying persistent stores of trajectory segments

    NASA Technical Reports Server (NTRS)

    Grossman, Robert L.; Mehta, S.; Qin, Xiao

    1993-01-01

    We introduce an algorithm for path planning (long duration) paths of dynamical systems, given a persistent object store containing suitable collections of short duration trajectory segments. We also describe experimental results from a proof-of-concept implementation of the algorithm. The basic idea is to interpret a path planning algorithm as a suitable query on a persistent object store consisting of short duration trajectory segments. The query returns a concatenation of short duration trajectory segments which is close to the desired path. The needed short duration segments are computed by using a divide and conquer algorithm to break up the original path into shorter paths; each shorter path is then matched to a nearby trajectory segment which is part of the persistent object store by using a suitable index function.

  14. Automated 3D vascular segmentation in CT hepatic venography

    NASA Astrophysics Data System (ADS)

    Fetita, Catalin; Lucidarme, Olivier; Preteux, Francoise

    2005-08-01

    In the framework of preoperative evaluation of the hepatic venous anatomy in living-donor liver transplantation or oncologic rejections, this paper proposes an automated approach for the 3D segmentation of the liver vascular structure from 3D CT hepatic venography data. The developed segmentation approach takes into account the specificities of anatomical structures in terms of spatial location, connectivity and morphometric properties. It implements basic and advanced morphological operators (closing, geodesic dilation, gray-level reconstruction, sup-constrained connection cost) in mono- and multi-resolution filtering schemes in order to achieve an automated 3D reconstruction of the opacified hepatic vessels. A thorough investigation of the venous anatomy including morphometric parameter estimation is then possible via computer-vision 3D rendering, interaction and navigation capabilities.

  15. Functional anatomy of the nose.

    PubMed

    Koppe, Thomas; Giotakis, Evangelos I; Heppt, Werner

    2011-04-01

    The human nose is a very complex entity with a great amount of variation among and within different human populations. Even though the morphology of the nasal pyramid and its soft tissue coverage is principally known, a standardized nomenclature does not yet exist. The past two decades have witnessed a considerable increase of new studies on the functional morphology of the external nasal anatomy. Detailed anatomic and clinical knowledge about the external nose is a prerequisite for successful rhinosurgery, thus this report deals with the basic structures necessary for functional and aesthetic rhinoplasty. PMID:21404156

  16. Gross anatomy of network security

    NASA Technical Reports Server (NTRS)

    Siu, Thomas J.

    2002-01-01

    Information security involves many branches of effort, including information assurance, host level security, physical security, and network security. Computer network security methods and implementations are given a top-down description to permit a medically focused audience to anchor this information to their daily practice. The depth of detail of network functionality and security measures, like that of the study of human anatomy, can be highly involved. Presented at the level of major gross anatomical systems, this paper will focus on network backbone implementation and perimeter defenses, then diagnostic tools, and finally the user practices (the human element). Physical security measures, though significant, have been defined as beyond the scope of this presentation.

  17. Simultaneous segmentation and statistical label fusion

    NASA Astrophysics Data System (ADS)

    Asman, Andrew J.; Landman, Bennett A.

    2012-02-01

    Labeling or segmentation of structures of interest in medical imaging plays an essential role in both clinical and scientific understanding. Two of the common techniques to obtain these labels are through either fully automated segmentation or through multi-atlas based segmentation and label fusion. Fully automated techniques often result in highly accurate segmentations but lack the robustness to be viable in many cases. On the other hand, label fusion techniques are often extremely robust, but lack the accuracy of automated algorithms for specific classes of problems. Herein, we propose to perform simultaneous automated segmentation and statistical label fusion through the reformulation of a generative model to include a linkage structure that explicitly estimates the complex global relationships between labels and intensities. These relationships are inferred from the atlas labels and intensities and applied to the target using a non-parametric approach. The novelty of this approach lies in the combination of previously exclusive techniques and attempts to combine the accuracy benefits of automated segmentation with the robustness of a multi-atlas based approach. The accuracy benefits of this simultaneous approach are assessed using a multi-label multi-atlas whole-brain segmentation experiment and the segmentation of the highly variable thyroid on computed tomography images. The results demonstrate that this technique has major benefits for certain types of problems and has the potential to provide a paradigm shift in which the lines between statistical label fusion and automated segmentation are dramatically blurred.

  18. A probabilistic level set formulation for interactive organ segmentation

    NASA Astrophysics Data System (ADS)

    Cremers, Daniel; Fluck, Oliver; Rousson, Mikael; Aharon, Shmuel

    2007-03-01

    Level set methods have become increasingly popular as a framework for image segmentation. Yet when used as a generic segmentation tool, they suffer from an important drawback: Current formulations do not allow much user interaction. Upon initialization, boundaries propagate to the final segmentation without the user being able to guide or correct the segmentation. In the present work, we address this limitation by proposing a probabilistic framework for image segmentation which integrates input intensity information and user interaction on equal footings. The resulting algorithm determines the most likely segmentation given the input image and the user input. In order to allow a user interaction in real-time during the segmentation, the algorithm is implemented on a graphics card and in a narrow band formulation.

  19. Towards Automatic Image Segmentation Using Optimised Region Growing Technique

    NASA Astrophysics Data System (ADS)

    Alazab, Mamoun; Islam, Mofakharul; Venkatraman, Sitalakshmi

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

  20. Improving image segmentation by learning region affinities

    SciTech Connect

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

    2010-11-03

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

  1. Evaluating segmentation error without ground truth.

    PubMed

    Kohlberger, Timo; Singh, Vivek; Alvino, Chris; Bahlmann, Claus; Grady, Leo

    2012-01-01

    The automatic delineation of the boundaries of organs and other anatomical structures is a key component of many medical image processing systems. In this paper we present a generic learning approach based on a novel space of segmentation features, which can be trained to predict the overlap error and Dice coefficient of an arbitrary organ segmentation without knowing the ground truth delineation. We show the regressor to be much stronger a predictor of these error metrics than the responses of probabilistic boosting classifiers trained on the segmentation boundary. The presented approach not only allows us to build reliable confidence measures and fidelity checks, but also to rank several segmentation hypotheses against each other during online usage of the segmentation algorithm in clinical practice. PMID:23285592

  2. Segmentation of knee injury swelling on infrared images

    NASA Astrophysics Data System (ADS)

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

    2011-03-01

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

  3. Bayesian Fusion of Color and Texture Segmentations

    NASA Technical Reports Server (NTRS)

    Manduchi, Roberto

    2000-01-01

    In many applications one would like to use information from both color and texture features in order to segment an image. We propose a novel technique to combine "soft" segmentations computed for two or more features independently. Our algorithm merges models according to a mean entropy criterion, and allows to choose the appropriate number of classes for the final grouping. This technique also allows to improve the quality of supervised classification based on one feature (e.g. color) by merging information from unsupervised segmentation based on another feature (e.g., texture.)

  4. Anatomy of the Dead Sea transform: Does it reflect continuous changes in plate motion?

    USGS Publications Warehouse

    ten Brink, U.S.; Rybakov, M.; Al-Zoubi, A. S.; Hassouneh, M.; Frieslander, U.; Batayneh, A.T.; Goldschmidt, V.; Daoud, M.N.; Rotstein, Y.; Hall, J.K.

    1999-01-01

    A new gravity map of the southern half of the Dead Sea transform offers the first regional view of the anatomy of this plate boundary. Interpreted together with auxiliary seismic and well data, the map reveals a string of subsurface basins of widely varying size, shape, and depth along the plate boundary and relatively short (25-55 km) and discontinuous fault segments. We argue that this structure is a result of continuous small changes in relative plate motion. However, several segments must have ruptured simultaneously to produce the inferred maximum magnitude of historical earthquakes.

  5. Design Projects in Human Anatomy & Physiology

    ERIC Educational Resources Information Center

    Polizzotto, Kristin; Ortiz, Mary T.

    2008-01-01

    Very often, some type of writing assignment is required in college entry-level Human Anatomy and Physiology courses. This assignment can be anything from an essay to a research paper on the literature, focusing on a faculty-approved topic of interest to the student. As educators who teach Human Anatomy and Physiology at an urban community college,…

  6. Frank Netter's Legacy: Interprofessional Anatomy Instruction

    ERIC Educational Resources Information Center

    Niekrash, Christine E.; Copes, Lynn E.; Gonzalez, Richard A.

    2015-01-01

    Several medical schools have recently described new innovations in interprofessional interactions in gross anatomy courses. The Frank H. Netter MD School of Medicine at Quinnipiac University in Hamden, CT has developed and implemented two contrasting interprofessional experiences in first-year medical student gross anatomy dissection laboratories:…

  7. Anatomy Education Faces Challenges in Pakistan

    ERIC Educational Resources Information Center

    Memon, Ismail K.

    2009-01-01

    Anatomy education in Pakistan is facing many of the same challenges as in other parts of the world. Roughly, a decade ago, all medical and dental colleges in Pakistan emphasized anatomy as a core basic discipline within a traditional medical science curriculum. Now institutions are adopting problem based learning (PBL) teaching philosophies, and…

  8. Shark Attack! Sinking Your Teeth into Anatomy.

    ERIC Educational Resources Information Center

    House, Herbert

    2002-01-01

    Presents a real life shark attack story and studies arm reattachment surgery to teach human anatomy. Discusses how knowledge of anatomy can be put to use in the real world and how the arm functions. Includes teaching notes and suggestions for classroom management. (YDS)

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

    NASA Astrophysics Data System (ADS)

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

    2015-03-01

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

  10. Scene segmentation in a machine vision system for histopathology

    NASA Astrophysics Data System (ADS)

    Thompson, Deborah B.; Bartels, H. G.; Haddad, J. W.; Bartels, Peter H.

    1990-07-01

    Algorithms and procedures employed to attain reliable and exhaustive segmentation in histopathologic imagery of colon and prostate sections are detailed. The algorithms are controlled and selectively called by a scene segmentation expert system as part of a machine vision system for the diagnostic interpretation of histopathologic sections. At this time, effective segmentation of scenes of glandular tissues is produced, with the system being conservative in the identification of glands; for the segmentation of overlapping glandular nuclei an overall success rate of approximately 90% has been achieved.

  11. Algorithm and program for information processing with the filin apparatus

    NASA Technical Reports Server (NTRS)

    Gurin, L. S.; Morkrov, V. S.; Moskalenko, Y. I.; Tsoy, K. A.

    1979-01-01

    The reduction of spectral radiation data from space sources is described. The algorithm and program for identifying segments of information obtained from the Film telescope-spectrometer on the Salyut-4 are presented. The information segments represent suspected X-ray sources. The proposed algorithm is an algorithm of the lowest level. Following evaluation, information free of uninformative segments is subject to further processing with algorithms of a higher level. The language used is FORTRAN 4.

  12. The 2008 Anatomy Ceremony: Essays

    PubMed Central

    Elansary, Mei; Goldberg, Ben; Qian, Ting; Rizzolo, Lawrence J.

    2009-01-01

    When asked to relate my experience of anatomy to the first-year medical and physician associate students at Yale before the start of their own first dissection, I found no better words to share than those of my classmates. Why speak with only one tongue, I said, when you can draw on 99 others? Anatomical dissection elicits what our course director, Lawrence Rizzolo, has called a “diversity of experience,” which, in turn, engenders a diversity of expressions. For Yale medical and physician associate students, this diversity is captured each year in a ceremony dedicated to those who donated their bodies for dissection. The service is an opportunity to offer thanks, but because only students and faculty are in attendance, it is also a place to share and address the complicated tensions that arise while examining, invading, and ultimately disassembling another’s body. It is our pleasure to present selected pieces from the ceremony to the Yale Journal of Biology and Medicine readership. — Peter Gayed, Co-editor-in-chief, Yale Journal of Biology and Medicine and Chair of the 2008 Anatomy Ceremony Planning Committee PMID:19325944

  13. Joint model of motion and anatomy for PET image reconstruction

    SciTech Connect

    Qiao Feng; Pan Tinsu; Clark, John W. Jr.; Mawlawi, Osama

    2007-12-15

    Anatomy-based positron emission tomography (PET) image enhancement techniques have been shown to have the potential for improving PET image quality. However, these techniques assume an accurate alignment between the anatomical and the functional images, which is not always valid when imaging the chest due to respiratory motion. In this article, we present a joint model of both motion and anatomical information by integrating a motion-incorporated PET imaging system model with an anatomy-based maximum a posteriori image reconstruction algorithm. The mismatched anatomical information due to motion can thus be effectively utilized through this joint model. A computer simulation and a phantom study were conducted to assess the efficacy of the joint model, whereby motion and anatomical information were either modeled separately or combined. The reconstructed images in each case were compared to corresponding reference images obtained using a quadratic image prior based maximum a posteriori reconstruction algorithm for quantitative accuracy. Results of these studies indicated that while modeling anatomical information or motion alone improved the PET image quantitation accuracy, a larger improvement in accuracy was achieved when using the joint model. In the computer simulation study and using similar image noise levels, the improvement in quantitation accuracy compared to the reference images was 5.3% and 19.8% when using anatomical or motion information alone, respectively, and 35.5% when using the joint model. In the phantom study, these results were 5.6%, 5.8%, and 19.8%, respectively. These results suggest that motion compensation is important in order to effectively utilize anatomical information in chest imaging using PET. The joint motion-anatomy model presented in this paper provides a promising solution to this problem.

  14. The algorithmic anatomy of model-based evaluation

    PubMed Central

    Daw, Nathaniel D.; Dayan, Peter

    2014-01-01

    Despite many debates in the first half of the twentieth century, it is now largely a truism that humans and other animals build models of their environments and use them for prediction and control. However, model-based (MB) reasoning presents severe computational challenges. Alternative, computationally simpler, model-free (MF) schemes have been suggested in the reinforcement learning literature, and have afforded influential accounts of behavioural and neural data. Here, we study the realization of MB calculations, and the ways that this might be woven together with MF values and evaluation methods. There are as yet mostly only hints in the literature as to the resulting tapestry, so we offer more preview than review. PMID:25267820

  15. A geometric flow for segmenting vasculature in proton-density weighted MRI.

    PubMed

    Descoteaux, Maxime; Collins, D Louis; Siddiqi, Kaleem

    2008-08-01

    Modern neurosurgery takes advantage of magnetic resonance images (MRI) of a patient's cerebral anatomy and vasculature for planning before surgery and guidance during the procedure. Dual echo acquisitions are often performed that yield proton-density (PD) and T2-weighted images to evaluate edema near a tumor or lesion. In this paper we develop a novel geometric flow for segmenting vasculature in PD images, which can also be applied to the easier cases of MR angiography data or Gadolinium enhanced MRI. Obtaining vasculature from PD data is of clinical interest since the acquisition of such images is widespread, the scanning process is non-invasive, and the availability of vessel segmentation methods could obviate the need for an additional angiographic or contrast-based sequence during preoperative imaging. The key idea is to first apply Frangi's vesselness measure [Frangi, A., Niessen, W., Vincken, K.L., Viergever, M.A., 1998. Multiscale vessel enhancement filtering. In: International Conference on Medical Image Computing and Computer Assisted Intervention, vol. 1496 of Lecture Notes in Computer Science, pp. 130-137] to find putative centerlines of tubular structures along with their estimated radii. This measure is then distributed to create a vector field which allows the flux maximizing flow algorithm of Vasilevskiy and Siddiqi [Vasilevskiy, A., Siddiqi, K., 2002. Flux maximizing geometric flows. IEEE Transactions on Pattern Analysis and Machine Intelligence 24 (12), 1565-1578] to be applied to recover vessel boundaries. We carry out a qualitative validation of the approach on PD, MR angiography and Gadolinium enhanced MRI volumes and suggest a new way to visualize the segmentations in 2D with masked projections. We validate the approach quantitatively on a single-subject data set consisting of PD, phase contrast (PC) angiography and time of flight (TOF) angiography volumes, with an expert segmented version of the TOF volume viewed as the ground truth. We then

  16. Automatic segmentation editing for cortical surface reconstruction

    NASA Astrophysics Data System (ADS)

    Han, Xiao; Xu, Chenyang; Rettmann, Maryam E.; Prince, Jerry L.

    2001-07-01

    Segmentation and representation of the human cerebral cortex from magnetic resonance images is an important goal in neuroscience and medicine. Accurate cortical segmentation requires preprocessing of the image data to separate certain subcortical structures from the cortex in order to generate a good initial white-matter/gray-matter interface. This step is typically manual or semi-automatic. In this paper, we propose an automatic procedure that is based on a careful analysis of the brain anatomy. Following a fuzzy segmentation of the brain image, the method first extracts the ventricles using a geometric deformable surface model. A region force, derived from the cerebrospinal membership function, is used to deform the surface towards the boundary of the ventricles, while a curvature force controls the smoothness of the surface and prevents it from growing into the outer pial surface. Next, region-growing identifies and fills the subcortical regions in each cortical slice using the detected ventricles as seeds and the white matter and several automatically determined sealing lines as boundaries. To make the method robust to segmentation artifacts, a putamen mask drawn in the Talairach coordinate system is also used to help the region growing process. Visual inspection and initial results on 15 subjects show the success of the proposed method.

  17. Segment alignment control system

    NASA Technical Reports Server (NTRS)

    Aubrun, JEAN-N.; Lorell, Ken R.

    1988-01-01

    The segmented primary mirror for the LDR will require a special segment alignment control system to precisely control the orientation of each of the segments so that the resulting composite reflector behaves like a monolith. The W.M. Keck Ten Meter Telescope will utilize a primary mirror made up of 36 actively controlled segments. Thus the primary mirror and its segment alignment control system are directly analogous to the LDR. The problems of controlling the segments in the face of disturbances and control/structures interaction, as analyzed for the TMT, are virtually identical to those for the LDR. The two systems are briefly compared.

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

    PubMed

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

    2009-02-01

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

  19. Optimization-based interactive segmentation interface for multiregion problems.

    PubMed

    Baxter, John S H; Rajchl, Martin; Peters, Terry M; Chen, Elvis C S

    2016-04-01

    Interactive segmentation is becoming of increasing interest to the medical imaging community in that it combines the positive aspects of both manual and automated segmentation. However, general-purpose tools have been lacking in terms of segmenting multiple regions simultaneously with a high degree of coupling between groups of labels. Hierarchical max-flow segmentation has taken advantage of this coupling for individual applications, but until recently, these algorithms were constrained to a particular hierarchy and could not be considered general-purpose. In a generalized form, the hierarchy for any given segmentation problem is specified in run-time, allowing different hierarchies to be quickly explored. We present an interactive segmentation interface, which uses generalized hierarchical max-flow for optimization-based multiregion segmentation guided by user-defined seeds. Applications in cardiac and neonatal brain segmentation are given as example applications of its generality. PMID:27335892

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

    PubMed

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

    2015-10-01

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

  1. 4D MR phase and magnitude segmentations with GPU parallel computing.

    PubMed

    Bergen, Robert V; Lin, Hung-Yu; Alexander, Murray E; Bidinosti, Christopher P

    2015-01-01

    The increasing size and number of data sets of large four dimensional (three spatial, one temporal) magnetic resonance (MR) cardiac images necessitates efficient segmentation algorithms. Analysis of phase-contrast MR images yields cardiac flow information which can be manipulated to produce accurate segmentations of the aorta. Phase contrast segmentation algorithms are proposed that use simple mean-based calculations and least mean squared curve fitting techniques. The initial segmentations are generated on a multi-threaded central processing unit (CPU) in 10 seconds or less, though the computational simplicity of the algorithms results in a loss of accuracy. A more complex graphics processing unit (GPU)-based algorithm fits flow data to Gaussian waveforms, and produces an initial segmentation in 0.5 seconds. Level sets are then applied to a magnitude image, where the initial conditions are given by the previous CPU and GPU algorithms. A comparison of results shows that the GPU algorithm appears to produce the most accurate segmentation.

  2. Sub-Markov Random Walk for Image Segmentation.

    PubMed

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

    2016-02-01

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

  3. Sipunculans and segmentation

    PubMed Central

    Kristof, Alen; Brinkmann, Nora

    2009-01-01

    Comparative molecular, developmental and morphogenetic analyses show that the three major segmented animal groups—Lophotrochozoa, Ecdysozoa and Vertebrata—use a wide range of ontogenetic pathways to establish metameric body organization. Even in the life history of a single specimen, different mechanisms may act on the level of gene expression, cell proliferation, tissue differentiation and organ system formation in individual segments. Accordingly, in some polychaete annelids the first three pairs of segmental peripheral neurons arise synchronously, while the metameric commissures of the ventral nervous system form in anterior-posterior progression. Contrary to traditional belief, loss of segmentation may have occurred more often than commonly assumed, as exemplified in the sipunculans, which show remnants of segmentation in larval stages but are unsegmented as adults. The developmental plasticity and potential evolutionary lability of segmentation nourishes the controversy of a segmented bilaterian ancestor versus multiple independent evolution of segmentation in respective metazoan lineages. PMID:19513266

  4. Station Tour: Russian Segment

    NASA Video Gallery

    Expedition 33 Commander Suni Williams concludes her tour of the International Space Station with a visit to the Russian segment, which includes Zarya, the first segment of the station launched in 1...

  5. Art, antiquarianism and early anatomy.

    PubMed

    Guest, Clare E L

    2014-12-01

    Discussions of the early relationship between art and anatomy are shaped by Vasari's account of Florentine artists who dissected bodies in order to understand the causes of movement, and the end of movement in action. This account eclipses the role of the study of antiquities in Renaissance anatomical illustration. Beyond techniques of presentation, such as sectioning and analytic illustration, or a preoccupation with the mutilated fragment, antiquarianism offered a reflection on the variant and the role of temperament which could be adapted for anatomical purposes. With its play on ambiguities of life and death, idealisation and damage, antiquarianism also provided a way of negotiating the difficulties of content inherent in anatomical illustration. As such, it goes beyond exclusively historical interest to provoke reflection on the modes, possibilities and humane responsibilities of medical illustration. PMID:24696510

  6. Art, antiquarianism and early anatomy.

    PubMed

    Guest, Clare E L

    2014-12-01

    Discussions of the early relationship between art and anatomy are shaped by Vasari's account of Florentine artists who dissected bodies in order to understand the causes of movement, and the end of movement in action. This account eclipses the role of the study of antiquities in Renaissance anatomical illustration. Beyond techniques of presentation, such as sectioning and analytic illustration, or a preoccupation with the mutilated fragment, antiquarianism offered a reflection on the variant and the role of temperament which could be adapted for anatomical purposes. With its play on ambiguities of life and death, idealisation and damage, antiquarianism also provided a way of negotiating the difficulties of content inherent in anatomical illustration. As such, it goes beyond exclusively historical interest to provoke reflection on the modes, possibilities and humane responsibilities of medical illustration.

  7. An atlas of radiological anatomy

    SciTech Connect

    Weir, J.; Abrahams, P.

    1986-01-01

    This book contains a wealth of radiologic images of normal human anatomy; plain radiographs, contrast-enhanced radiographs, and computed tomography (CT) scans. There are 18 pages of magnetic resonance (MR) images, most on the brain and spinal cord, so that there are only two pages on MR imaging of the heart and two pages on abdominal and pelvic MR imaging. Twelve pages of ultrasound (US) images are included. This book has the radiologic image paired with an explanatory drawing; the image is on the left with a paragraph or two of text, and the drawing is on the right with legends. This book includes images of the brain and spinal cord obtained with arteriography, venography, myelography, encephalography, CT, and MR imaging.

  8. High precision anatomy for MEG.

    PubMed

    Troebinger, Luzia; López, José David; Lutti, Antoine; Bradbury, David; Bestmann, Sven; Barnes, Gareth

    2014-02-01

    Precise MEG estimates of neuronal current flow are undermined by uncertain knowledge of the head location with respect to the MEG sensors. This is either due to head movements within the scanning session or systematic errors in co-registration to anatomy. Here we show how such errors can be minimized using subject-specific head-casts produced using 3D printing technology. The casts fit the scalp of the subject internally and the inside of the MEG dewar externally, reducing within session and between session head movements. Systematic errors in matching to MRI coordinate system are also reduced through the use of MRI-visible fiducial markers placed on the same cast. Bootstrap estimates of absolute co-registration error were of the order of 1mm. Estimates of relative co-registration error were <1.5mm between sessions. We corroborated these scalp based estimates by looking at the MEG data recorded over a 6month period. We found that the between session sensor variability of the subject's evoked response was of the order of the within session noise, showing no appreciable noise due to between-session movement. Simulations suggest that the between-session sensor level amplitude SNR improved by a factor of 5 over conventional strategies. We show that at this level of coregistration accuracy there is strong evidence for anatomical models based on the individual rather than canonical anatomy; but that this advantage disappears for errors of greater than 5mm. This work paves the way for source reconstruction methods which can exploit very high SNR signals and accurate anatomical models; and also significantly increases the sensitivity of longitudinal studies with MEG. PMID:23911673

  9. High precision anatomy for MEG☆

    PubMed Central

    Troebinger, Luzia; López, José David; Lutti, Antoine; Bradbury, David; Bestmann, Sven; Barnes, Gareth

    2014-01-01

    Precise MEG estimates of neuronal current flow are undermined by uncertain knowledge of the head location with respect to the MEG sensors. This is either due to head movements within the scanning session or systematic errors in co-registration to anatomy. Here we show how such errors can be minimized using subject-specific head-casts produced using 3D printing technology. The casts fit the scalp of the subject internally and the inside of the MEG dewar externally, reducing within session and between session head movements. Systematic errors in matching to MRI coordinate system are also reduced through the use of MRI-visible fiducial markers placed on the same cast. Bootstrap estimates of absolute co-registration error were of the order of 1 mm. Estimates of relative co-registration error were < 1.5 mm between sessions. We corroborated these scalp based estimates by looking at the MEG data recorded over a 6 month period. We found that the between session sensor variability of the subject's evoked response was of the order of the within session noise, showing no appreciable noise due to between-session movement. Simulations suggest that the between-session sensor level amplitude SNR improved by a factor of 5 over conventional strategies. We show that at this level of coregistration accuracy there is strong evidence for anatomical models based on the individual rather than canonical anatomy; but that this advantage disappears for errors of greater than 5 mm. This work paves the way for source reconstruction methods which can exploit very high SNR signals and accurate anatomical models; and also significantly increases the sensitivity of longitudinal studies with MEG. PMID:23911673

  10. [Functional anatomy of the central nervous system].

    PubMed

    Krainik, A; Feydy, A; Colombani, J M; Hélias, A; Menu, Y

    2003-03-01

    The central nervous system (CNS) has a particular regional functional anatomy. The morphological support of cognitive functions can now be depicted using functional imaging. Lesions of the central nervous system may be responsible of specific symptoms based on their location. Current neuroimaging techniques are able to show and locate precisely macroscopic lesions. Therefore, the knowledge of functional anatomy of the central nervous system is useful to link clinical disorders to symptomatic lesions. Using radio-clinical cases, we present the functional neuro-anatomy related to common cognitive impairments.

  11. Clinical aspects of rodent dental anatomy.

    PubMed

    Crossley, D A

    1995-12-01

    The order Rodentia is vast, encompassing a large number of species with significant anatomical variations developed during natural adaptation to differing habitats. Many veterinarians have little knowledge of the anatomy of species other than the commoner domestic large herbivores and small carnivores. Clinicians require a basic knowledge of the relevant anatomy of species they are likely to be asked to treat. This article provides sufficient working knowledge of the oral and dental anatomy of those rodents commonly kept as pets to enable veterinarians to interpret clinical and radiographic findings when investigating suspected dental disease.

  12. A diffusion tensor imaging tractography algorithm based on Navier-Stokes fluid mechanics.

    PubMed

    Hageman, Nathan S; Toga, Arthur W; Narr, Katherine L; Shattuck, David W

    2009-03-01

    We introduce a fluid mechanics based tractography method for estimating the most likely connection paths between points in diffusion tensor imaging (DTI) volumes. We customize the Navier-Stokes equations to include information from the diffusion tensor and simulate an artificial fluid flow through the DTI image volume. We then estimate the most likely connection paths between points in the DTI volume using a metric derived from the fluid velocity vector field. We validate our algorithm using digital DTI phantoms based on a helical shape. Our method segmented the structure of the phantom with less distortion than was produced using implementations of heat-based partial differential equation (PDE) and streamline based methods. In addition, our method was able to successfully segment divergent and crossing fiber geometries, closely following the ideal path through a digital helical phantom in the presence of multiple crossing tracts. To assess the performance of our algorithm on anatomical data, we applied our method to DTI volumes from normal human subjects. Our method produced paths that were consistent with both known anatomy and directionally encoded color images of the DTI dataset.

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

    PubMed

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

    2015-02-02

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

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

    PubMed

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

    2005-04-01

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

  15. Towards an elastographic atlas of brain anatomy.

    PubMed

    Guo, Jing; Hirsch, Sebastian; Fehlner, Andreas; Papazoglou, Sebastian; Scheel, Michael; Braun, Juergen; Sack, Ingolf

    2013-01-01

    Cerebral viscoelastic constants can be measured in a noninvasive, image-based way by magnetic resonance elastography (MRE) for the detection of neurological disorders. However, MRE brain maps of viscoelastic constants are still limited by low spatial resolution. Here we introduce three-dimensional multifrequency MRE of the brain combined with a novel reconstruction algorithm based on a model-free multifrequency inversion for calculating spatially resolved viscoelastic parameter maps of the human brain corresponding to the dynamic range of shear oscillations between 30 and 60 Hz. Maps of two viscoelastic parameters, the magnitude and the phase angle of the complex shear modulus, |G*| and φ, were obtained and normalized to group templates of 23 healthy volunteers in the age range of 22 to 72 years. This atlas of the anatomy of brain mechanics reveals a significant contrast in the stiffness parameter |G*| between different anatomical regions such as white matter (WM; 1.252±0.260 kPa), the corpus callosum genu (CCG; 1.104±0.280 kPa), the thalamus (TH; 1.058±0.208 kPa) and the head of the caudate nucleus (HCN; 0.649±0.101 kPa). φ, which is sensitive to the lossy behavior of the tissue, was in the order of CCG (1.011±0.172), TH (1.037±0.173), CN (0.906±0.257) and WM (0.854±0.169). The proposed method provides the first normalized maps of brain viscoelasticity with anatomical details in subcortical regions and provides useful background data for clinical applications of cerebral MRE.

  16. Unsupervised tattoo segmentation combining bottom-up and top-down cues

    NASA Astrophysics Data System (ADS)

    Allen, Josef D.; Zhao, Nan; Yuan, Jiangbo; Liu, Xiuwen

    2011-06-01

    Tattoo segmentation is challenging due to the complexity and large variance in tattoo structures. We have developed a segmentation algorithm for finding tattoos in an image. Our basic idea is split-merge: split each tattoo image into clusters through a bottom-up process, learn to merge the clusters containing skin and then distinguish tattoo from the other skin via top-down prior in the image itself. Tattoo segmentation with unknown number of clusters is transferred to a figureground segmentation. We have applied our segmentation algorithm on a tattoo dataset and the results have shown that our tattoo segmentation system is efficient and suitable for further tattoo classification and retrieval purpose.

  17. Posterior subscapular dissection: An improved approach to the brachial plexus for human anatomy students.

    PubMed

    Hager, Shaun; Backus, Timothy Charles; Futterman, Bennett; Solounias, Nikos; Mihlbachler, Matthew C

    2014-05-01

    Students of human anatomy are required to understand the brachial plexus, from the proximal roots extending from spinal nerves C5 through T1, to the distal-most branches that innervate the shoulder and upper limb. However, in human cadaver dissection labs, students are often instructed to dissect the brachial plexus using an antero-axillary approach that incompletely exposes the brachial plexus. This approach readily exposes the distal segments of the brachial plexus but exposure of proximal and posterior segments require extensive dissection of neck and shoulder structures. Therefore, the proximal and posterior segments of the brachial plexus, including the roots, trunks, divisions, posterior cord and proximally branching peripheral nerves often remain unobserved during study of the cadaveric shoulder and brachial plexus. Here we introduce a subscapular approach that exposes the entire brachial plexus, with minimal amount of dissection or destruction of surrounding structures. Lateral retraction of the scapula reveals the entire length of the brachial plexus in the subscapular space, exposing the brachial plexus roots and other proximal segments. Combining the subscapular approach with the traditional antero-axillary approach allows students to observe the cadaveric brachial plexus in its entirety. Exposure of the brachial dissection in the subscapular space requires little time and is easily incorporated into a preexisting anatomy lab curriculum without scheduling additional time for dissection.

  18. Brain anatomy of the marine tardigrade Actinarctus doryphorus (Arthrotardigrada).

    PubMed

    Persson, Dennis K; Halberg, Kenneth A; Jørgensen, Aslak; Møbjerg, Nadja; Kristensen, Reinhardt M

    2014-02-01

    Knowledge of tardigrade brain structure is important for resolving the phylogenetic relationships of Tardigrada. Here, we present new insight into the morphology of the brain in a marine arthrotardigrade, Actinarctus doryphorus, based on transmission electron microscopy, supported by scanning electron microscopy, conventional light microscopy as well as confocal laser scanning microscopy. Arthrotardigrades contain a large number of plesiomorphic characters and likely represent ancestral tardigrades. They often have segmented body outlines and each trunk segment, with its paired set of legs, may have up to five sensory appendages. Noticeably, the head carries numerous cephalic appendages that are structurally equivalent to the sensory appendages of the trunk segments. Our data reveal that the brain of A. doryphorus is partitioned into three paired lobes, and that these lobes exhibit a more pronounced separation as compared to that of eutardigrades. The first brain lobe in A. doryphorus is located anteriodorsally, with the second lobe just below it in an anterioventral position. Both of these two paired lobes are located anterior to the buccal tube. The third pair of brain lobes are situated posterioventrally to the first two lobes, and flank the buccal tube. In addition, A. doryphorus possesses a subpharyngeal ganglion, which is connected with the first of the four ventral trunk ganglia. The first and second brain lobes in A. doryphorus innervate the clavae and cirri of the head. The innervations of these structures indicate a homology between, respectively, the clavae and cirri of A. doryphorus and the temporalia and papilla cephalica of eutardigrades. The third brain lobes innervate the buccal lamella and the stylets as described for eutardigrades. Collectively, these findings suggest that the head region of extant tardigrades is the result of cephalization of multiple segments. Our results on the brain anatomy of Actinarctus doryphorus support the monophyly of

  19. Brain anatomy of the marine tardigrade Actinarctus doryphorus (Arthrotardigrada).

    PubMed

    Persson, Dennis K; Halberg, Kenneth A; Jørgensen, Aslak; Møbjerg, Nadja; Kristensen, Reinhardt M

    2014-02-01

    Knowledge of tardigrade brain structure is important for resolving the phylogenetic relationships of Tardigrada. Here, we present new insight into the morphology of the brain in a marine arthrotardigrade, Actinarctus doryphorus, based on transmission electron microscopy, supported by scanning electron microscopy, conventional light microscopy as well as confocal laser scanning microscopy. Arthrotardigrades contain a large number of plesiomorphic characters and likely represent ancestral tardigrades. They often have segmented body outlines and each trunk segment, with its paired set of legs, may have up to five sensory appendages. Noticeably, the head carries numerous cephalic appendages that are structurally equivalent to the sensory appendages of the trunk segments. Our data reveal that the brain of A. doryphorus is partitioned into three paired lobes, and that these lobes exhibit a more pronounced separation as compared to that of eutardigrades. The first brain lobe in A. doryphorus is located anteriodorsally, with the second lobe just below it in an anterioventral position. Both of these two paired lobes are located anterior to the buccal tube. The third pair of brain lobes are situated posterioventrally to the first two lobes, and flank the buccal tube. In addition, A. doryphorus possesses a subpharyngeal ganglion, which is connected with the first of the four ventral trunk ganglia. The first and second brain lobes in A. doryphorus innervate the clavae and cirri of the head. The innervations of these structures indicate a homology between, respectively, the clavae and cirri of A. doryphorus and the temporalia and papilla cephalica of eutardigrades. The third brain lobes innervate the buccal lamella and the stylets as described for eutardigrades. Collectively, these findings suggest that the head region of extant tardigrades is the result of cephalization of multiple segments. Our results on the brain anatomy of Actinarctus doryphorus support the monophyly of

  20. Obturator hernia. Embryology, anatomy, and surgical applications.

    PubMed

    Skandalakis, L J; Androulakis, J; Colborn, G L; Skandalakis, J E

    2000-02-01

    Obturator hernia is a rare clinical entity. In most cases, it produces small bowel obstruction with high morbidity and mortality. The embryology, anatomy, clinical picture, diagnosis, and surgery are presented in detail.

  1. Curricular Guidelines for Teaching Dental Anatomy.

    ERIC Educational Resources Information Center

    Okeson, Jeffrey; Buckman, James

    1981-01-01

    Guidelines developed by the Section on Dental Anatomy and Occlusion of the American Association of Dental Schools for use by individual educational institutions as curriculum development aids are provided. (MLW)

  2. CPR Instruction in a Human Anatomy Class.

    ERIC Educational Resources Information Center

    Lutton, Lewis M.

    1978-01-01

    Describes how cardiopulmonary resuscitation (CPR) instruction can be included in a college anatomy and physiology course. Equipment and instructors are provided locally by the Red Cross or American Heart Association. (MA)

  3. Anatomy Ontology Matching Using Markov Logic Networks

    PubMed Central

    Li, Chunhua; Zhao, Pengpeng; Wu, Jian; Cui, Zhiming

    2016-01-01

    The anatomy of model species is described in ontologies, which are used to standardize the annotations of experimental data, such as gene expression patterns. To compare such data between species, we need to establish relationships between ontologies describing different species. Ontology matching is a kind of solutions to find semantic correspondences between entities of different ontologies. Markov logic networks which unify probabilistic graphical model and first-order logic provide an excellent framework for ontology matching. We combine several different matching strategies through first-order logic formulas according to the structure of anatomy ontologies. Experiments on the adult mouse anatomy and the human anatomy have demonstrated the effectiveness of proposed approach in terms of the quality of result alignment. PMID:27382498

  4. Iterative approach to joint segmentation of cellular structures

    NASA Astrophysics Data System (ADS)

    Ajemba, Peter; Scott, Richard; Ramachandran, Janakiramanan; Liu, Qiuhua; Khan, Faisal; Zeineh, Jack; Donovan, Michael; Fernandez, Gerardo

    2012-02-01

    Accurate segmentation of overlapping nuclei is essential in determining nuclei count and evaluating the sub-cellular localization of protein biomarkers in image Cytometry and Histology. Current cellular segmentation algorithms generally lack fast and reliable methods for disambiguating clumped nuclei. In immuno-fluorescence segmentation, solutions to challenges including nuclei misclassification, irregular boundaries, and under-segmentation require reliable separation of clumped nuclei. This paper presents a fast and accurate algorithm for joint segmentation of cellular cytoplasm and nuclei incorporating procedures for reliably separating overlapping nuclei. The algorithm utilizes a combination of ideas and is a significant improvement on state-of-the-art algorithms for this application. First, an adaptive process that includes top-hat filtering, blob detection and distance transforms estimates the inverse illumination field and corrects for intensity non-uniformity. Minimum-error-thresholding based binarization augmented by statistical stability estimation is applied prior to seed-detection constrained by a distance-map-based scale-selection to identify candidate seeds for nuclei segmentation. The nuclei clustering step also incorporates error estimation based on statistical stability. This enables the algorithm to perform localized error correction. Final steps include artifact removal and reclassification of nuclei objects near the cytoplasm boundary as epithelial or stroma. Evaluation using 48 realistic phantom images with known ground-truth shows overall segmentation accuracy exceeding 96%. It significantly outperformed two state-of-the-art algorithms in clumped nuclei separation. Tests on 926 prostate biopsy images (326 patients) show that the segmentation improvement improves the predictive power of nuclei architecture features based on the minimum spanning tree algorithm. The algorithm has been deployed in a large scale pathology application.

  5. What is a segment?

    PubMed

    Hannibal, Roberta L; Patel, Nipam H

    2013-12-17

    Animals have been described as segmented for more than 2,000 years, yet a precise definition of segmentation remains elusive. Here we give the history of the definition of segmentation, followed by a discussion on current controversies in defining a segment. While there is a general consensus that segmentation involves the repetition of units along the anterior-posterior (a-p) axis, long-running debates exist over whether a segment can be composed of only one tissue layer, whether the most anterior region of the arthropod head is considered segmented, and whether and how the vertebrate head is segmented. Additionally, we discuss whether a segment can be composed of a single cell in a column of cells, or a single row of cells within a grid of cells. We suggest that 'segmentation' be used in its more general sense, the repetition of units with a-p polarity along the a-p axis, to prevent artificial classification of animals. We further suggest that this general definition be combined with an exact description of what is being studied, as well as a clearly stated hypothesis concerning the specific nature of the potential homology of structures. These suggestions should facilitate dialogue among scientists who study vastly differing segmental structures.

  6. Partial differential equations-based segmentation for radiotherapy treatment planning.

    PubMed

    Gibou, Frederic; Levy, Doron; Cardenas, Carlos; Liu, Pingyu; Boyer, Arthur

    2005-04-01

    The purpose of this study is to develop automatic algorithms for the segmentation phase of radiotherapy treatment planning. We develop new image processing techniques that are based on solving a partial diferential equation for the evolution of the curve that identifies the segmented organ. The velocity function is based on the piecewise Mumford-Shah functional. Our method incorporates information about the target organ into classical segmentation algorithms. This information, which is given in terms of a three- dimensional wireframe representation of the organ, serves as an initial guess for the segmentation algorithm. We check the performance of the new algorithm on eight data sets of three diferent organs: rectum, bladder, and kidney. The results of the automatic segmentation were compared with a manual seg- mentation of each data set by radiation oncology faculty and residents. The quality of the automatic segmentation was measured with the k-statistics", and with a count of over- and undersegmented frames, and was shown in most cases to be very close to the manual segmentation of the same data. A typical segmentation of an organ with sixty slices takes less than ten seconds on a Pentium IV laptop.

  7. Segmenting Student Markets with a Student Satisfaction and Priorities Survey.

    ERIC Educational Resources Information Center

    Borden, Victor M. H.

    1995-01-01

    A market segmentation analysis of 872 university students compared 2 hierarchical clustering procedures for deriving market segments: 1 using matching-type measures and an agglomerative clustering algorithm, and 1 using the chi-square based automatic interaction detection. Results and implications for planning, evaluating, and improving academic…

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

    PubMed

    Tosun, Akif Burak; Gunduz-Demir, Cigdem

    2011-03-01

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

  9. Segmentation of moving object in complex environment

    NASA Astrophysics Data System (ADS)

    Yong, Yang; Wang, Jingru; Zhang, Qiheng

    2005-02-01

    This paper presents a new automatic image segmentation method for segmenting moving object in complex environment by combining the motion information with edge information. We propose an adaptive optical flow method based on the Horn-Schunck algorithm to estimate the optical flow field. Our method puts different smoothness constraints on different directions and optical flow constraint is used according to the gradient magnitude. Canny edge detector can obtain the most edge information but miss some pixels. In order to restore these missing pixels the edge has a growing based on the continuity of optical flow field. Next, by remaining the block that has the longest edge could delete the noise in the background, and then the last segmentation result is obtained. The experimental result demonstrates that this method can segment the moving object in complex environment precisely.

  10. Roadmap for efficient parallelization of breast anatomy simulation

    NASA Astrophysics Data System (ADS)

    Chui, Joseph H.; Pokrajac, David D.; Maidment, Andrew D. A.; Bakic, Predrag R.

    2012-03-01

    A roadmap has been proposed to optimize the simulation of breast anatomy by parallel implementation, in order to reduce the time needed to generate software breast phantoms. The rapid generation of high resolution phantoms is needed to support virtual clinical trials of breast imaging systems. We have recently developed an octree-based recursive partitioning algorithm for breast anatomy simulation. The algorithm has good asymptotic complexity; however, its current MATLAB implementation cannot provide optimal execution times. The proposed roadmap for efficient parallelization includes the following steps: (i) migrate the current code to a C/C++ platform and optimize it for single-threaded implementation; (ii) modify the code to allow for multi-threaded CPU implementation; (iii) identify and migrate the code to a platform designed for multithreaded GPU implementation. In this paper, we describe our results in optimizing the C/C++ code for single-threaded and multi-threaded CPU implementations. As the first step of the proposed roadmap we have identified a bottleneck component in the MATLAB implementation using MATLAB's profiling tool, and created a single threaded CPU implementation of the algorithm using C/C++'s overloaded operators and standard template library. The C/C++ implementation has been compared to the MATLAB version in terms of accuracy and simulation time. A 520-fold reduction of the execution time was observed in a test of phantoms with 50- 400 μm voxels. In addition, we have identified several places in the code which will be modified to allow for the next roadmap milestone of the multithreaded CPU implementation.

  11. Segmentation of ribs in digital chest radiographs

    NASA Astrophysics Data System (ADS)

    Cong, Lin; Guo, Wei; Li, Qiang

    2016-03-01

    Ribs and clavicles in posterior-anterior (PA) digital chest radiographs often overlap with lung abnormalities such as nodules, and cause missing of these abnormalities, it is therefore necessary to remove or reduce the ribs in chest radiographs. The purpose of this study was to develop a fully automated algorithm to segment ribs within lung area in digital radiography (DR) for removal of the ribs. The rib segmentation algorithm consists of three steps. Firstly, a radiograph was pre-processed for contrast adjustment and noise removal; second, generalized Hough transform was employed to localize the lower boundary of the ribs. In the third step, a novel bilateral dynamic programming algorithm was used to accurately segment the upper and lower boundaries of ribs simultaneously. The width of the ribs and the smoothness of the rib boundaries were incorporated in the cost function of the bilateral dynamic programming for obtaining consistent results for the upper and lower boundaries. Our database consisted of 93 DR images, including, respectively, 23 and 70 images acquired with a DR system from Shanghai United-Imaging Healthcare Co. and from GE Healthcare Co. The rib localization algorithm achieved a sensitivity of 98.2% with 0.1 false positives per image. The accuracy of the detected ribs was further evaluated subjectively in 3 levels: "1", good; "2", acceptable; "3", poor. The percentages of good, acceptable, and poor segmentation results were 91.1%, 7.2%, and 1.7%, respectively. Our algorithm can obtain good segmentation results for ribs in chest radiography and would be useful for rib reduction in our future study.

  12. Robust defect segmentation in woven fabrics

    SciTech Connect

    Sari-Sarraf, H.; Goddard, J.S. Jr.

    1997-12-01

    This paper describes a robust segmentation algorithm for the detection and localization of woven fabric defects. The essence of the presented segmentation algorithm is the localization of those events (i.e., defects) in the input images that disrupt the global homogeneity of the background texture. To this end, preprocessing modules, based on the wavelet transform and edge fusion, are employed with the objective of attenuating the background texture and accentuating the defects. Then, texture features are utilized to measure the global homogeneity of the output images. If these images are deemed to be globally nonhomogeneous (i.e., defects are present), a local roughness measure is used to localize the defects. The utility of this algorithm can be extended beyond the specific application in this work, that is, defect segmentation in woven fabrics. Indeed, in a general sense, this algorithm can be used to detect and to localize anomalies that reside in images characterized by ordered texture. The efficacy of this algorithm has been tested thoroughly under realistic conditions and as a part of an on-line fabric inspection system. Using over 3700 images of fabrics, containing 26 different types of defects, the overall detection rate of this approach was 89% with a localization accuracy of less than 0.2 inches and a false alarm rate of 2.5%.

  13. Robust system for human airway-tree segmentation

    NASA Astrophysics Data System (ADS)

    Graham, Michael W.; Gibbs, Jason D.; Higgins, William E.

    2008-03-01

    Robust and accurate segmentation of the human airway tree from multi-detector computed-tomography (MDCT) chest scans is vital for many pulmonary-imaging applications. As modern MDCT scanners can detect hundreds of airway tree branches, manual segmentation and semi-automatic segmentation requiring significant user intervention are impractical for producing a full global segmentation. Fully-automated methods, however, may fail to extract small peripheral airways. We propose an automatic algorithm that searches the entire lung volume for airway branches and poses segmentation as a global graph-theoretic optimization problem. The algorithm has shown strong performance on 23 human MDCT chest scans acquired by a variety of scanners and reconstruction kernels. Visual comparisons with adaptive region-growing results and quantitative comparisons with manually-defined trees indicate a high sensitivity to peripheral airways and a low false-positive rate. In addition, we propose a suite of interactive segmentation tools for cleaning and extending critical areas of the automatically segmented result. These interactive tools have potential application for image-based guidance of bronchoscopy to the periphery, where small, terminal branches can be important visual landmarks. Together, the automatic segmentation algorithm and interactive tool suite comprise a robust system for human airway-tree segmentation.

  14. Image segmentation evaluation for very-large datasets

    NASA Astrophysics Data System (ADS)

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

    2016-03-01

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

  15. Auto-segmentation of normal and target structures in head and neck CT images: A feature-driven model-based approach

    SciTech Connect

    Qazi, Arish A.; Pekar, Vladimir; Kim, John; Xie, Jason; Breen, Stephen L.; Jaffray, David A.

    2011-11-15

    Purpose: Intensity modulated radiation therapy (IMRT) allows greater control over dose distribution, which leads to a decrease in radiation related toxicity. IMRT, however, requires precise and accurate delineation of the organs at risk and target volumes. Manual delineation is tedious and suffers from both interobserver and intraobserver variability. State of the art auto-segmentation methods are either atlas-based, model-based or hybrid however, robust fully automated segmentation is often difficult due to the insufficient discriminative information provided by standard medical imaging modalities for certain tissue types. In this paper, the authors present a fully automated hybrid approach which combines deformable registration with the model-based approach to accurately segment normal and target tissues from head and neck CT images. Methods: The segmentation process starts by using an average atlas to reliably identify salient landmarks in the patient image. The relationship between these landmarks and the reference dataset serves to guide a deformable registration algorithm, which allows for a close initialization of a set of organ-specific deformable models in the patient image, ensuring their robust adaptation to the boundaries of the structures. Finally, the models are automatically fine adjusted by our boundary refinement approach which attempts to model the uncertainty in model adaptation using a probabilistic mask. This uncertainty is subsequently resolved by voxel classification based on local low-level organ-specific features. Results: To quantitatively evaluate the method, they auto-segment several organs at risk and target tissues from 10 head and neck CT images. They compare the segmentations to the manual delineations outlined by the expert. The evaluation is carried out by estimating two common quantitative measures on 10 datasets: volume overlap fraction or the Dice similarity coefficient (DSC), and a geometrical metric, the median symmetric

  16. What is a segment?

    PubMed Central

    2013-01-01

    Animals have been described as segmented for more than 2,000 years, yet a precise definition of segmentation remains elusive. Here we give the history of the definition of segmentation, followed by a discussion on current controversies in defining a segment. While there is a general consensus that segmentation involves the repetition of units along the anterior-posterior (a-p) axis, long-running debates exist over whether a segment can be composed of only one tissue layer, whether the most anterior region of the arthropod head is considered segmented, and whether and how the vertebrate head is segmented. Additionally, we discuss whether a segment can be composed of a single cell in a column of cells, or a single row of cells within a grid of cells. We suggest that ‘segmentation’ be used in its more general sense, the repetition of units with a-p polarity along the a-p axis, to prevent artificial classification of animals. We further suggest that this general definition be combined with an exact description of what is being studied, as well as a clearly stated hypothesis concerning the specific nature of the potential homology of structures. These suggestions should facilitate dialogue among scientists who study vastly differing segmental structures. PMID:24345042

  17. Consistent depth video segmentation using adaptive surface models.

    PubMed

    Husain, Farzad; Dellen, Babette; Torras, Carme

    2015-02-01

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

  18. A method for the evaluation of thousands of automated 3D stem cell segmentations.

    PubMed

    Bajcsy, P; Simon, M; Florczyk, S J; Simon, C G; Juba, D; Brady, M C

    2015-12-01

    There is no segmentation method that performs perfectly with any dataset in comparison to human segmentation. Evaluation procedures for segmentation algorithms become critical for their selection. The problems associated with segmentation performance evaluations and visual verification of segmentation results are exaggerated when dealing with thousands of three-dimensional (3D) image volumes because of the amount of computation and manual inputs needed. We address the problem of evaluating 3D segmentation performance when segmentation is applied to thousands of confocal microscopy images (z-stacks). Our approach is to incorporate experimental imaging and geometrical criteria, and map them into computationally efficient segmentation algorithms that can be applied to a very large number of z-stacks. This is an alternative approach to considering existing segmentation methods and evaluating most state-of-the-art algorithms. We designed a methodology for 3D segmentation performance characterization that consists of design, evaluation and verification steps. The characterization integrates manual inputs from projected surrogate 'ground truth' of statistically representative samples and from visual inspection into the evaluation. The novelty of the methodology lies in (1) designing candidate segmentation algorithms by mapping imaging and geometrical criteria into algorithmic steps, and constructing plausible segmentation algorithms with respect to the order of algorithmic steps and their parameters, (2) evaluating segmentation accuracy using samples drawn from probability distribution estimates of candidate segmentations and (3) minimizing human labour needed to create surrogate 'truth' by approximating z-stack segmentations with 2D contours from three orthogonal z-stack projections and by developing visual verification tools. We demonstrate the methodology by applying it to a dataset of 1253 mesenchymal stem cells. The cells reside on 10 different types of biomaterial

  19. Auditory pathways: anatomy and physiology.

    PubMed

    Pickles, James O

    2015-01-01

    This chapter outlines the anatomy and physiology of the auditory pathways. After a brief analysis of the external, middle ears, and cochlea, the responses of auditory nerve fibers are described. The central nervous system is analyzed in more detail. A scheme is provided to help understand the complex and multiple auditory pathways running through the brainstem. The multiple pathways are based on the need to preserve accurate timing while extracting complex spectral patterns in the auditory input. The auditory nerve fibers branch to give two pathways, a ventral sound-localizing stream, and a dorsal mainly pattern recognition stream, which innervate the different divisions of the cochlear nucleus. The outputs of the two streams, with their two types of analysis, are progressively combined in the inferior colliculus and onwards, to produce the representation of what can be called the "auditory objects" in the external world. The progressive extraction of critical features in the auditory stimulus in the different levels of the central auditory system, from cochlear nucleus to auditory cortex, is described. In addition, the auditory centrifugal system, running from cortex in multiple stages to the organ of Corti of the cochlea, is described.

  20. Functional anatomy of the spine.

    PubMed

    Bogduk, Nikolai

    2016-01-01

    Among other important features of the functional anatomy of the spine, described in this chapter, is the remarkable difference between the design and function of the cervical spine and that of the lumbar spine. In the cervical spine, the atlas serves to transmit the load of the head to the typical cervical vertebrae. The axis adapts the suboccipital region to the typical cervical spine. In cervical intervertebrtal discs the anulus fibrosus is not circumferential but is crescentic, and serves as an interosseous ligament in the saddle joint between vertebral bodies. Cervical vertebrae rotate and translate in the sagittal plane, and rotate in the manner of an inverted cone, across an oblique coronal plane. The cervical zygapophysial joints are the most common source of chronic neck pain. By contrast, lumbar discs are well designed to sustain compression loads, but rely on posterior elements to limit axial rotation. Internal disc disruption is the most common basis for chronic low-back pain. Spinal muscles are arranged systematically in prevertebral and postvertebral groups. The intrinsic elements of the spine are innervated by the dorsal rami of the spinal nerves, and by the sinuvertebral nerves. Little modern research has been conducted into the structure of the thoracic spine, or the causes of thoracic spinal pain.

  1. Molecular Anatomy of Palate Development.

    PubMed

    Potter, Andrew S; Potter, S Steven

    2015-01-01

    The NIH FACEBASE consortium was established in part to create a central resource for craniofacial researchers. One purpose is to provide a molecular anatomy of craniofacial development. To this end we have used a combination of laser capture microdissection and RNA-Seq to define the gene expression programs driving development of the murine palate. We focused on the E14.5 palate, soon after medial fusion of the two palatal shelves. The palate was divided into multiple compartments, including both medial and lateral, as well as oral and nasal, for both the anterior and posterior domains. A total of 25 RNA-Seq datasets were generated. The results provide a comprehensive view of the region specific expression of all transcription factors, growth factors and receptors. Paracrine interactions can be inferred from flanking compartment growth factor/receptor expression patterns. The results are validated primarily through very high concordance with extensive previously published gene expression data for the developing palate. In addition selected immunostain validations were carried out. In conclusion, this report provides an RNA-Seq based atlas of gene expression patterns driving palate development at microanatomic resolution. This FACEBASE resource is designed to promote discovery by the craniofacial research community.

  2. Brain anatomy in Diplura (Hexapoda)

    PubMed Central

    2012-01-01

    Background In the past decade neuroanatomy has proved to be a valuable source of character systems that provide insights into arthropod relationships. Since the most detailed description of dipluran brain anatomy dates back to Hanström (1940) we re-investigated the brains of Campodea augens and Catajapyx aquilonaris with modern neuroanatomical techniques. The analyses are based on antibody staining and 3D reconstruction of the major neuropils and tracts from semi-thin section series. Results Remarkable features of the investigated dipluran brains are a large central body, which is organized in nine columns and three layers, and well developed mushroom bodies with calyces receiving input from spheroidal olfactory glomeruli in the deutocerebrum. Antibody staining against a catalytic subunit of protein kinase A (DC0) was used to further characterize the mushroom bodies. The japygid Catajapyx aquilonaris possesses mushroom bodies which are connected across the midline, a unique condition within hexapods. Conclusions Mushroom body and central body structure shows a high correspondence between japygids and campodeids. Some unique features indicate that neuroanatomy further supports the monophyly of Diplura. In a broader phylogenetic context, however, the polarization of brain characters becomes ambiguous. The mushroom bodies and the central body of Diplura in several aspects resemble those of Dicondylia, suggesting homology. In contrast, Archaeognatha completely lack mushroom bodies and exhibit a central body organization reminiscent of certain malacostracan crustaceans. Several hypotheses of brain evolution at the base of the hexapod tree are discussed. PMID:23050723

  3. [Anatomy cadaver ceremonies in Taiwan].

    PubMed

    Kao, T; Ha, H

    1999-07-01

    The practice of holding annual ceremonies in honor of cadaver donors in Taiwan's medical schools has a history of nearly a hundred years. It originated in Japan, where such ceremonies have been widely held in medical schools since the practice was founded by Toyo Yamawaki, who was the first medical scholar in Japan to engage in dissection of the human body and was the author of the first anatomy book to appear in Japan, the Zoshi. The practice of holding donor ceremonies was introduced into Taiwan after the Jaiwu Sino - Japanese war, when the island became a Japanese colony. The tradition was upheld in the Viceroy's Medical School, the Viceroy's College of Medicine, and Taihoku (Taipei) Imperial University College of Medicine, and continued since the restoration of Chinese power to the present. The practice of holding cadaver donor ceremonies in institutions of medical education is intended to express respect for the donor as well as to encourage the practice of cadaver donation to the benefit of medical education.

  4. Molecular Anatomy of Palate Development

    PubMed Central

    Potter, Andrew S.; Potter, S. Steven

    2015-01-01

    The NIH FACEBASE consortium was established in part to create a central resource for craniofacial researchers. One purpose is to provide a molecular anatomy of craniofacial development. To this end we have used a combination of laser capture microdissection and RNA-Seq to define the gene expression programs driving development of the murine palate. We focused on the E14.5 palate, soon after medial fusion of the two palatal shelves. The palate was divided into multiple compartments, including both medial and lateral, as well as oral and nasal, for both the anterior and posterior domains. A total of 25 RNA-Seq datasets were generated. The results provide a comprehensive view of the region specific expression of all transcription factors, growth factors and receptors. Paracrine interactions can be inferred from flanking compartment growth factor/receptor expression patterns. The results are validated primarily through very high concordance with extensive previously published gene expression data for the developing palate. In addition selected immunostain validations were carried out. In conclusion, this report provides an RNA-Seq based atlas of gene expression patterns driving palate development at microanatomic resolution. This FACEBASE resource is designed to promote discovery by the craniofacial research community. PMID:26168040

  5. Prognostic Determinants of Coronary Atherosclerosis in Stable Ischemic Heart Disease: Anatomy, Physiology, or Morphology?

    PubMed

    Ahmadi, Amir; Stone, Gregg W; Leipsic, Jonathon; Shaw, Leslee J; Villines, Todd C; Kern, Morton J; Hecht, Harvey; Erlinge, David; Ben-Yehuda, Ori; Maehara, Akiko; Arbustini, Eloisa; Serruys, Patrick; Garcia-Garcia, Hector M; Narula, Jagat

    2016-07-01

    Risk stratification in patients with stable ischemic heart disease is essential to guide treatment decisions. In this regard, whether coronary anatomy, physiology, or plaque morphology is the best determinant of prognosis (and driver an effective therapeutic risk reduction) remains one of the greatest ongoing debates in cardiology. In the present report, we review the evidence for each of these characteristics and explore potential algorithms that may enable a practical diagnostic and therapeutic strategy for the management of patients with stable ischemic heart disease.

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

    NASA Astrophysics Data System (ADS)

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

    1991-06-01

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

  7. Segmented Trough Reflector

    NASA Technical Reports Server (NTRS)

    Szmyd, W. R.

    1985-01-01

    Segmented troughlike reflector for solar cells approach concentration effectiveness of true parabolic reflector yet simpler and less expensive. Walls of segmented reflector composed of reflective aluminized membrane. Lengthwise guide wire applies tension to each wall, thereby dividing each into two separate planes. Planes tend to focus Sunlight on solar cells at center of trough between walls. Segmented walls provide higher Sunlight concentration ratios than do simple walls.

  8. Cardiac image segmentation using spatiotemporal clustering

    NASA Astrophysics Data System (ADS)

    Galic, Sasa; Loncaric, Sven

    2001-07-01

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

  9. Design features of on-line anatomy information resources: a comparison with the Digital Anatomist.

    PubMed

    Kim, S; Brinkley, J F; Rosse, C

    1999-01-01

    In order to update the design of the next generation of the Digital Anatomist, we have surveyed teaching assistants who have used the Digital Anatomist for learning and teaching anatomy as medical students, and have also examined available anatomy web sites with sufficient content to support learning. The majority of web sites function in an atlas mode and provide for the identification of structures. These atlases incorporate a variety of features for interactivity with 2D images, some of which are not available in the Digital Anatomist. The surveys suggest that the greatest need is for on-line access to comprehensive and detailed anatomical information and for the development of knowledge-based methods that allow the direct manipulation of segmented 3D graphical models by the user. The requirement for such interactivity is a comprehensive symbolic model of the physical organization of the body that can support inference.

  10. Design features of on-line anatomy information resources: a comparison with the Digital Anatomist.

    PubMed Central

    Kim, S.; Brinkley, J. F.; Rosse, C.

    1999-01-01

    In order to update the design of the next generation of the Digital Anatomist, we have surveyed teaching assistants who have used the Digital Anatomist for learning and teaching anatomy as medical students, and have also examined available anatomy web sites with sufficient content to support learning. The majority of web sites function in an atlas mode and provide for the identification of structures. These atlases incorporate a variety of features for interactivity with 2D images, some of which are not available in the Digital Anatomist. The surveys suggest that the greatest need is for on-line access to comprehensive and detailed anatomical information and for the development of knowledge-based methods that allow the direct manipulation of segmented 3D graphical models by the user. The requirement for such interactivity is a comprehensive symbolic model of the physical organization of the body that can support inference. Images Fig 1 PMID:10566421

  11. MRI of the cranial nerves--more than meets the eye: technical considerations and advanced anatomy.

    PubMed

    Casselman, Jan; Mermuys, Koen; Delanote, Joost; Ghekiere, Johan; Coenegrachts, Kenneth

    2008-05-01

    Magnetic resonance (MR) imaging is the method of choice to evaluate the cranial nerves. Although the skull base foramina can be seen on CT, the nerves themselves can only be visualized in detail on MR. To see the different segments of nerves I to XII, the right sequences must be used. Detailed clinical information is needed by the radiologist so that a tailored MR study can be performed. In this article, MR principles for imaging of the cranial nerves are discussed. The basic anatomy of the cranial nerves and the cranial nerve nuclei as well as their central connections are discussed and illustrated briefly. The emphasis is on less known or more advanced extra-axial anatomy, illustrated with high-resolution MR images.

  12. Impact assisted segmented cutterhead

    DOEpatents

    Morrell, Roger J.; Larson, David A.; Ruzzi, Peter L.

    1992-01-01

    An impact assisted segmented cutterhead device is provided for cutting various surfaces from coal to granite. The device comprises a plurality of cutting bit segments deployed in side by side relationship to form a continuous cutting face and a plurality of impactors individually associated with respective cutting bit segments. An impactor rod of each impactor connects that impactor to the corresponding cutting bit segment. A plurality of shock mounts dampening the vibration from the associated impactor. Mounting brackets are used in mounting the cutterhead to a base machine.

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

    NASA Astrophysics Data System (ADS)

    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.

  14. Color, complex document segmentation and compression

    NASA Astrophysics Data System (ADS)

    Fung, Hei Tao; Parker, Kevin J.

    1997-04-01

    We propose a novel segmentation algorithm called SMART for color, complex documents. It decomposes a document image into 'binarizable' and 'non-binarizable' components. The segmentation procedure includes color transformation, halftone texture suppression, subdivision of the image into 8 by 8 blocks, classification of the 8 by 8 blocks as 'active' or 'inactive', formation of macroblocks from the active blocks, and classification of the macroblocks as binarizable or non-binarizable. The classification processes involve the DCT coefficients and a histogram analysis. SMART is compared to three well-known segmentation algorithms: CRLA, RXYC, and SPACE. SMART can handle image components of various shapes, multiple backgrounds of different gray levels, different relative grayness of text to this background, tilted image components, and text of different gray levels. To compress the segmented image, we apply JPEG4 to the non-binarizable macroblocks and the Group 4 coding scheme to the binary image representing the binarizable macroblocks and to the bitmap storing the configuration of all macroblocks. Data about the representative gray values, the color information, and other descriptors of the binarizable macroblocks and the background regions are also sent to allow image reconstruction. The gain is using our compression algorithm over using JPEG for the whole image is significant. This gain increases as the proportion of the size of the subjects prefer the reconstructed images from our compression algorithm to those form the bitrate-matching JPEG images. In a series of test images, this document segmentation and compression system enables compression ratios two times to six times improved over standard methods.

  15. Patterning embryos with oscillations: structure, function and dynamics of the vertebrate segmentation clock.

    PubMed

    Oates, Andrew C; Morelli, Luis G; Ares, Saúl

    2012-02-01

    The segmentation clock is an oscillating genetic network thought to govern the rhythmic and sequential subdivision of the elongating body axis of the vertebrate embryo into somites: the precursors of the segmented vertebral column. Understanding how the rhythmic signal arises, how it achieves precision and how it patterns the embryo remain challenging issues. Recent work has provided evidence of how the period of the segmentation clock is regulated and how this affects the anatomy of the embryo. The ongoing development of real-time clock reporters and mathematical models promise novel insight into the dynamic behavior of the clock.

  16. Efficient terrestrial laser scan segmentation exploiting data structure

    NASA Astrophysics Data System (ADS)

    Mahmoudabadi, Hamid; Olsen, Michael J.; Todorovic, Sinisa

    2016-09-01

    New technologies such as lidar enable the rapid collection of massive datasets to model a 3D scene as a point cloud. However, while hardware technology continues to advance, processing 3D point clouds into informative models remains complex and time consuming. A common approach to increase processing efficiently is to segment the point cloud into smaller sections. This paper proposes a novel approach for point cloud segmentation using computer vision algorithms to analyze panoramic representations of individual laser scans. These panoramas can be quickly created using an inherent neighborhood structure that is established during the scanning process, which scans at fixed angular increments in a cylindrical or spherical coordinate system. In the proposed approach, a selected image segmentation algorithm is applied on several input layers exploiting this angular structure including laser intensity, range, normal vectors, and color information. These segments are then mapped back to the 3D point cloud so that modeling can be completed more efficiently. This approach does not depend on pre-defined mathematical models and consequently setting parameters for them. Unlike common geometrical point cloud segmentation methods, the proposed method employs the colorimetric and intensity data as another source of information. The proposed algorithm is demonstrated on several datasets encompassing variety of scenes and objects. Results show a very high perceptual (visual) level of segmentation and thereby the feasibility of the proposed algorithm. The proposed method is also more efficient compared to Random Sample Consensus (RANSAC), which is a common approach for point cloud segmentation.

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

    NASA Astrophysics Data System (ADS)

    Ruggiero, Christy; Ross, Amy; Porter, Reid

    2015-02-01

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

  18. Functional anatomy of bronchial veins.

    PubMed

    Charan, Nirmal B; Thompson, William H; Carvalho, Paula

    2007-01-01

    The amount of bronchial arterial blood that drains into the systemic venous system is not known. Therefore, in this study we further delineated the functional anatomy of the bronchial venous system in six adult, anesthetized, and mechanically ventilated sheep. Through a left thoracotomy, the left azygos vein was dissected and the insertion of the bronchial vein into the azygos vein was identified. A pouch was created by ligating the azygos vein on either side of the insertion of the bronchial vein. A catheter was inserted into this pouch for the measurement of bronchial venous occlusion pressure and bronchial venous blood flow. An ultrasonic flow probe was placed around the common bronchial branch of the bronchoesophageal artery to monitor the bronchial arterial blood flow. Catheters were also placed into the carotid artery and the pulmonary artery. The mean bronchial blood flow was 20.6+/-4.2mlmin(-1) (mean+/-SEM) and, of this, only about 13% of the blood flow drained into the azygos vein. The mean systemic artery pressure was 72.4+/-4.1mmHg whereas the mean bronchial venous occlusion pressure was 38.1+/-2.1mmHg. The mean values for blood gas analysis were as follows: bronchial venous blood pH=7.54+/-0.02, PCO(2)=35+/-2.6, PO(2)=95+/-5.7mmHg; systemic venous blood-pH=7.43+/-0.02, PCO(2)=48+/-3.2, PO(2)=42+/-2.0mmHg; systemic arterial blood-pH=7.51+/-0.03, PCO(2)=39+/-2.1, PO(2)=169+/-9.8mmHg. We conclude that the major portion of the bronchial arterial blood flow normally drains into the pulmonary circulation and only about 13% drains into the bronchial venous system. In addition, the oxygen content of the bronchial venous blood is similar to that in the systemic arterial blood.

  19. Female reproductive tract anatomy of the endangered Arabian oryx (Oryx leucoryx) in Jordan.

    PubMed

    Eljarah, Abdulhakeem H; Al-Zghoul, Mohd B; Jawasreh, Khaleel; Ismail, Zuhair A Bani; Ababneh, Mustafa M; Elhalah, Ashraf N; Alsumadi, Maen M

    2012-01-01

    Female reproductive anatomy of the Arabian oryx is unknown. In this study, reproductive tracts of seven female Arabian oryx (aged 2 to 7 years) were examined to characterize their reproductive anatomy. Observations and measurements were obtained in situ from dead animals during necropsy. Animals were allocated into two groups: cycling (n = 3; follicles or corpora lutea present) and not-cycling (n = 4; follicles or corpora lutea absent). Different reproductive tract segments for each animal in both groups were measured using a digital caliper. The mean, SD and range for each reproductive tract segment were generated and compared between groups. Female oryx reproductive anatomy share some anatomical characteristics with that of domestic ruminants except that the oryx uterus has no distinct uterine body and the cervix has two internal openings for each respective uterine horn. In addition, there were more than 8 rows of caruncles within each uterine horn. There were significant differences in the length and width (P < 0.05), but not in height, of both the right and left ovaries between cycling and not-cycling animals (P > 0.05). Posterior and anterior vaginal lengths varied between cycling and not-cycling groups (P < 0.05). Length of right and left oviducts, left and right uterine horns, cervix and vulva did not vary between cycling and not-cycling groups (P > 0.05). Defining this unique morphology of female Arabian oryx reproductive anatomy will help in the development of appropriate reproductive techniques in order to propagate this endangered species and control its reproduction. PMID:23420946

  20. Object segmentation based on guided layering from video image

    NASA Astrophysics Data System (ADS)

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

    2011-09-01

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