2,740 research outputs found

    CT liver tumor segmentation hybrid approach using neutrosophic sets, fast fuzzy c-means and adaptive watershed algorithm

    Get PDF
    Liver tumor segmentation from computed tomography (CT) images is a critical and challenging task. Due to the fuzziness in the liver pixel range, the neighboring organs of the liver with the same intensity, high noise and large variance of tumors. The segmentation process is necessary for the detection, identification, and measurement of objects in CT images. We perform an extensive review of the CT liver segmentation literature

    Review on the methods of automatic liver segmentation from abdominal images

    Get PDF
    Automatic liver segmentation from abdominal images is challenging on the aspects of segmentation accuracy, automation and robustness. There exist many methods of liver segmentation and ways of categorisingthem. In this paper, we present a new way of summarizing the latest achievements in automatic liver segmentation.We categorise a segmentation method according to the image feature it works on, therefore better summarising the performance of each category and leading to finding an optimal solution for a particular segmentation task. All the methods of liver segmentation are categorized into three main classes including gray level based method, structure based method and texture based method. In each class, the latest advance is reviewed with summary comments on the advantages and drawbacks of each discussed approach. Performance comparisons among the classes are given along with the remarks on the problems existed and possible solutions. In conclusion, we point out that liver segmentation is still an open issue and the tendency is that multiple methods will be employed to-gether to achieve better segmentation performance

    Attribute Equilibrium Dominance Reduction Accelerator (DCCAEDR) Based on Distributed Coevolutionary Cloud and Its Application in Medical Records

    Full text link
    © 2013 IEEE. Aimed at the tremendous challenge of attribute reduction for big data mining and knowledge discovery, we propose a new attribute equilibrium dominance reduction accelerator (DCCAEDR) based on the distributed coevolutionary cloud model. First, the framework of N-populations distributed coevolutionary MapReduce model is designed to divide the entire population into N subpopulations, sharing the reward of different subpopulations' solutions under a MapReduce cloud mechanism. Because the adaptive balancing between exploration and exploitation can be achieved in a better way, the reduction performance is guaranteed to be the same as those using the whole independent data set. Second, a novel Nash equilibrium dominance strategy of elitists under the N bounded rationality regions is adopted to assist the subpopulations necessary to attain the stable status of Nash equilibrium dominance. This further enhances the accelerator's robustness against complex noise on big data. Third, the approximation parallelism mechanism based on MapReduce is constructed to implement rule reduction by accelerating the computation of attribute equivalence classes. Consequently, the entire attribute reduction set with the equilibrium dominance solution can be achieved. Extensive simulation results have been used to illustrate the effectiveness and robustness of the proposed DCCAEDR accelerator for attribute reduction on big data. Furthermore, the DCCAEDR is applied to solve attribute reduction for traditional Chinese medical records and to segment cortical surfaces of the neonatal brain 3-D-MRI records, and the DCCAEDR shows the superior competitive results, when compared with the representative algorithms

    Unsupervised Multi Class Segmentation of 3D Images with Intensity Inhomogeneities

    Full text link
    Intensity inhomogeneities in images constitute a considerable challenge in image segmentation. In this paper we propose a novel biconvex variational model to tackle this task. We combine a total variation approach for multi class segmentation with a multiplicative model to handle the inhomogeneities. Our method assumes that the image intensity is the product of a smoothly varying part and a component which resembles important image structures such as edges. Therefore, we penalize in addition to the total variation of the label assignment matrix a quadratic difference term to cope with the smoothly varying factor. A critical point of our biconvex functional is computed by a modified proximal alternating linearized minimization method (PALM). We show that the assumptions for the convergence of the algorithm are fulfilled by our model. Various numerical examples demonstrate the very good performance of our method. Particular attention is paid to the segmentation of 3D FIB tomographical images which was indeed the motivation of our work

    Ball-Scale Based Hierarchical Multi-Object Recognition in 3D Medical Images

    Full text link
    This paper investigates, using prior shape models and the concept of ball scale (b-scale), ways of automatically recognizing objects in 3D images without performing elaborate searches or optimization. That is, the goal is to place the model in a single shot close to the right pose (position, orientation, and scale) in a given image so that the model boundaries fall in the close vicinity of object boundaries in the image. This is achieved via the following set of key ideas: (a) A semi-automatic way of constructing a multi-object shape model assembly. (b) A novel strategy of encoding, via b-scale, the pose relationship between objects in the training images and their intensity patterns captured in b-scale images. (c) A hierarchical mechanism of positioning the model, in a one-shot way, in a given image from a knowledge of the learnt pose relationship and the b-scale image of the given image to be segmented. The evaluation results on a set of 20 routine clinical abdominal female and male CT data sets indicate the following: (1) Incorporating a large number of objects improves the recognition accuracy dramatically. (2) The recognition algorithm can be thought as a hierarchical framework such that quick replacement of the model assembly is defined as coarse recognition and delineation itself is known as finest recognition. (3) Scale yields useful information about the relationship between the model assembly and any given image such that the recognition results in a placement of the model close to the actual pose without doing any elaborate searches or optimization. (4) Effective object recognition can make delineation most accurate.Comment: This paper was published and presented in SPIE Medical Imaging 201

    Liver segmentation using marker controlled watershed transform

    Get PDF
    The largest organ in the body is the liver and primarily helps in metabolism and detoxification. Liver segmentation is a crucial step in liver cancer detection in computer vision-based biomedical image analysis. Liver segmentation is a critical task and results in under-segmentation and over-segmentation due to the complex structure of abdominal computed tomography (CT) images, noise, and textural variations over the image. This paper presents liver segmentation in abdominal CT images using marker-based watershed transforms. In the pre-processing stage, a modified double stage gaussian filter (MDSGF) is used to enhance the contrast, and preserve the edge and texture information of liver CT images. Further, marker controlled watershed transform is utilized for the segmentation of liver images from the abdominal CT images. Liver segmentation using suggested MDSGF and marker-based watershed transform help to diminish the under-segmentation and over-segmentation of the liver object. The performance of the proposed system is evaluated on the LiTS dataset based on Dice score (DS), relative volume difference (RVD), volumetric overlapping error (VOE), and Jaccard index (JI). The proposed method gives (Dice score of 0.959, RVD of 0.09, VOE of 0.089, and JI of 0.921)
    corecore