12,196 research outputs found

    AN IMPROVEMENT OF CROSS ENTROPY THRESHOLDING FOR SKIN CANCER

    Get PDF
    Image processing procedures in medical diagnosis are used to improve diagnosis accuracy. An example of this is skin cancer detection using the thresholding approach. Thus, research studies involved in identification of inherited mutations predisposing family members to malignant melanoma have been performed in the Cancer Genetics field. Melanoma is one of the deadliest cancers, but could be cured when diagnosed early. A fundamental step in image processing is segmentation that includes thresholding, among others. Thresholding is based on finding the optimal thresholds value that partitions the image into multiple classes to be able to distinguish the objects from the background. The algorithm developed in this work is based on Minimum Cross Entropy Thresholding (MCET) method, using statistical distributions. We improved the previous work of Pal by using separately different statistical distributions (Gaussian, Lognormal and Gamma) instead of Poisson distribution. We applied our improved methods on bimodal skin cancer images and obtained promising experimental results. The resulting segmented skin cancer images, using Gamma distribution yielded better estimation of the optimal threshold than does the same MCET method with Lognormal, Gaussian and Poisson distribution

    Multi-Level Thresholding for Image Segmentation With Swarm Optimization Algorithms

    Get PDF
    Image segmentation is an important problem for image processing. The image processing applications are generally affectedfromthe segmentation success. There is noany image segmentation method which gives good results for all sorts of images. That's why there are many approaches and methods forimage segmentationin the literature. And one of the most used is the thresholding technique. Thresholding techniques can be categorized into two topics: bi-level and multi-level thresholding. Bi-level thresholding technique has one threshold value which separates the image into two groups. However, multi-level thresholding technique uses n threshold values where n greater than one. In this paper, two swarm optimization algorithms (Particle Swarm Optimization, PSO and Cat Swarm Optimization, CSO) are applied on finding the optimum threshold values for the multi-level thresholding. In literature, there are some minimization or maximization functions to find the best threshold values for thresholding problem. Some of these methods are: Tsalli's Entropy, Kapur's Entropy, Renyi's Entropy, Otsu's Method (within class variance/between class variance), the Minimum Cross Entropy Thresholding (MCET) etc.In this work, Otsu's (within class variance) method, which is one of these popular functions,is used as the fitness function of algorithms.In the experiments, five real images are segmented by usingParticle Swarm Algorithm and Cat Swarm Optimization Algorithms. The performances of the swarm algorithms on multi-level thresholding problem arecompared with Peak Signal-to-Noise Ratio (PSNR) and fitness function (FS) values. As a result, the PSO yields better performance than CSO

    Locally Adaptive Block Thresholding Method with Continuity Constraint

    Full text link
    We present an algorithm that enables one to perform locally adaptive block thresholding, while maintaining image continuity. Images are divided into sub-images based some standard image attributes and thresholding technique is employed over the sub-images. The present algorithm makes use of the thresholds of neighboring sub-images to calculate a range of values. The image continuity is taken care by choosing the threshold of the sub-image under consideration to lie within the above range. After examining the average range values for various sub-image sizes of a variety of images, it was found that the range of acceptable threshold values is substantially high, justifying our assumption of exploiting the freedom of range for bringing out local details.Comment: 12 Pages, 4 figures, 1 Tabl

    Remote sensing imagery segmentation: A hybrid approach

    Full text link
    In remote sensing imagery, segmentation techniques fail to encounter multiple regions of interest due to challenges such as dense features, low illumination, uncertainties, and noise. Consequently, exploiting vast and redundant information makes segmentation a difficult task. Existing multilevel thresholding techniques achieve low segmentation accuracy with high temporal difficulty due to the absence of spatial information. To mitigate this issue, this paper presents a new Rényi’s entropy and modified cuckoo search-based robust automatic multi-thresholding algorithm for remote sensing image analysis. In the proposed method, the modified cuckoo search algorithm is combined with Rényi’s entropy thresholding criteria to determine optimal thresholds. In the modified cuckoo search algorithm, the Lévy flight step size was modified to improve the convergence rate. An experimental analysis was conducted to validate the proposed method, both qualitatively and quantitatively against existing metaheuristic-based thresholding methods. To do this, the performance of the proposed method was intensively examined on high-dimensional remote sensing imageries. Moreover, numerical parameter analysis is presented to compare the segmented results against the gray-level co-occurrence matrix, Otsu energy curve, minimum cross entropy, and Rényi’s entropy-based thresholding. Experiments demonstrated that the proposed approach is effective and successful in attaining accurate segmentation with low time complexity

    Coarse-to-Fine Adaptive People Detection for Video Sequences by Maximizing Mutual Information

    Full text link
    Applying people detectors to unseen data is challenging since patterns distributions, such as viewpoints, motion, poses, backgrounds, occlusions and people sizes, may significantly differ from the ones of the training dataset. In this paper, we propose a coarse-to-fine framework to adapt frame by frame people detectors during runtime classification, without requiring any additional manually labeled ground truth apart from the offline training of the detection model. Such adaptation make use of multiple detectors mutual information, i.e., similarities and dissimilarities of detectors estimated and agreed by pair-wise correlating their outputs. Globally, the proposed adaptation discriminates between relevant instants in a video sequence, i.e., identifies the representative frames for an adaptation of the system. Locally, the proposed adaptation identifies the best configuration (i.e., detection threshold) of each detector under analysis, maximizing the mutual information to obtain the detection threshold of each detector. The proposed coarse-to-fine approach does not require training the detectors for each new scenario and uses standard people detector outputs, i.e., bounding boxes. The experimental results demonstrate that the proposed approach outperforms state-of-the-art detectors whose optimal threshold configurations are previously determined and fixed from offline training dataThis work has been partially supported by the Spanish government under the project TEC2014-53176-R (HAVideo

    Global Thresholding and Multiple Pass Parsing

    Full text link
    We present a variation on classic beam thresholding techniques that is up to an order of magnitude faster than the traditional method, at the same performance level. We also present a new thresholding technique, global thresholding, which, combined with the new beam thresholding, gives an additional factor of two improvement, and a novel technique, multiple pass parsing, that can be combined with the others to yield yet another 50% improvement. We use a new search algorithm to simultaneously optimize the thresholding parameters of the various algorithms.Comment: Fixed latex errors; fixed minor errors in published versio

    Accurate detection of dysmorphic nuclei using dynamic programming and supervised classification

    Get PDF
    A vast array of pathologies is typified by the presence of nuclei with an abnormal morphology. Dysmorphic nuclear phenotypes feature dramatic size changes or foldings, but also entail much subtler deviations such as nuclear protrusions called blebs. Due to their unpredictable size, shape and intensity, dysmorphic nuclei are often not accurately detected in standard image analysis routines. To enable accurate detection of dysmorphic nuclei in confocal and widefield fluorescence microscopy images, we have developed an automated segmentation algorithm, called Blebbed Nuclei Detector (BleND), which relies on two-pass thresholding for initial nuclear contour detection, and an optimal path finding algorithm, based on dynamic programming, for refining these contours. Using a robust error metric, we show that our method matches manual segmentation in terms of precision and outperforms state-of-the-art nuclear segmentation methods. Its high performance allowed for building and integrating a robust classifier that recognizes dysmorphic nuclei with an accuracy above 95%. The combined segmentation-classification routine is bound to facilitate nucleus-based diagnostics and enable real-time recognition of dysmorphic nuclei in intelligent microscopy workflows

    Dropout Sampling for Robust Object Detection in Open-Set Conditions

    Full text link
    Dropout Variational Inference, or Dropout Sampling, has been recently proposed as an approximation technique for Bayesian Deep Learning and evaluated for image classification and regression tasks. This paper investigates the utility of Dropout Sampling for object detection for the first time. We demonstrate how label uncertainty can be extracted from a state-of-the-art object detection system via Dropout Sampling. We evaluate this approach on a large synthetic dataset of 30,000 images, and a real-world dataset captured by a mobile robot in a versatile campus environment. We show that this uncertainty can be utilized to increase object detection performance under the open-set conditions that are typically encountered in robotic vision. A Dropout Sampling network is shown to achieve a 12.3% increase in recall (for the same precision score as a standard network) and a 15.1% increase in precision (for the same recall score as the standard network).Comment: to appear in IEEE International Conference on Robotics and Automation 2018 (ICRA 2018
    corecore