A Comparison of Nature Inspired Algorithms for Multi-threshold Image Segmentation

In the field of image analysis, segmentation is one of the most important preprocessing steps. One way to achieve segmentation is by mean of threshold selection, where each pixel that belongs to a determined class islabeled according to the selected threshold, giving as a result pixel groups that share visual characteristics in the image. Several methods have been proposed in order to solve threshold selectionproblems; in this work, it is used the method based on the mixture of Gaussian functions to approximate the 1D histogram of a gray level image and whose parameters are calculated using three nature inspired algorithms (Particle Swarm Optimization, Artificial Bee Colony Optimization and Differential Evolution). Each Gaussian function approximates thehistogram, representing a pixel class and therefore a threshold point. Experimental results are shown, comparing in quantitative and qualitative fashion as well as the main advantages and drawbacks of each algorithm, applied to multi-threshold problem.Comment: 16 pages, this is a draft of the final version of the article sent to the Journa

Developing improved algorithms for detection and analysis of skin cancer

University of Technology Sydney. Faculty of Engineering and Information Technology.Malignant melanoma is one of the deadliest forms of skin cancer and number of cases showed rapid increase in Europe, America, and Australia over the last few decades. Australia has one of the highest rates of skin cancer in the world, at nearly four times the rates in Canada, the US and the UK. Cancer treatment costs constitute more 7.2% of health system costs. However, a recovery rate of around 95% can be achieved if melanoma is detected at an early stage. Early diagnosis is obviously dependent upon accurate assessment by a medical practitioner. The variations of diagnosis are sufficiency large and there is a lack of detail of the test methods. This thesis investigates the methods for automated analysis of skin images to develop improved algorithms and to extend the functionality of the existing methods used in various stages of the automated diagnostic system. This in the long run can provide an alternative basis for researchers to experiment new and existing methodologies for skin cancer detection and diagnosis to help the medical practitioners. The objective is to have a detailed investigation for the requirements of automated skin cancer diagnostic systems, improve and develop relevant segmentation, feature selection and classification methods to deal with complex structures present in both dermoscopic/digital images and histopathological images. During the course of this thesis, several algorithms were developed. These algorithms were used in skin cancer diagnosis studies and some of them can also be applied in wider machine learning areas. The most important contributions of this thesis can be summarized as below: - Developing new segmentation algorithms designed specifically for skin cancer images including digital images of lesions and histopathalogical images with attention to their respective properties. The proposed algorithm uses a two-stage approach. Initially coarse segmentation of lesion area is done based on histogram analysis based orientation sensitive fuzzy C Mean clustering algorithm. The result of stage 1 is used for the initialization of a level set based algorithm developed for detecting finer differentiating details. The proposed algorithms achieved true detection rate of around 93% for external skin lesion images and around 88% for histopathological images. - Developing adaptive differential evolution based feature selection and parameter optimization algorithm. The proposed method is aimed to come up with an efficient approach to provide good accuracy for the skin cancer detection, while taking care of number of features and parameter tuning of feature selection and classification algorithm, as they all play important role in the overall analysis phase. The proposed method was also tested on 10 standard datasets for different kind of cancers and results shows improved performance for all the datasets compared to various state-of the art methods. - Proposing a parallelized knowledge based learning model which can make better use of the differentiating features along with increasing the generalization capability of the classification phase using advised support vector machine. Two classification algorithms were also developed for skin cancer data analysis, which can make use of both labelled and unlabelled data for training. First one is based on semi advised support vector machine. While the second one based on Deep Learning approach. The method of integrating the results of these two methods is also proposed. The experimental analysis showed very promising results for the appropriate diagnosis of melanoma. The classification accuracy achieved with the help of proposed algorithms was around 95% for external skin lesion classification and around 92 % for histopathalogical image analysis. Skin cancer dataset used in this thesis is obtained mainly from Sydney Melanoma Diagnostic Centre, Royal Prince Alfred Hospital. While for comparative analysis and benchmarking of the few algorithms some standard online cancer datasets were also used. Obtained result shows a good performance in segmentation and classification and can form the basis of more advanced computer aided diagnostic systems. While in future, the developed algorithms can also be extended for other kind of image analysis applications

A Survey on Evolutionary Computation for Computer Vision and Image Analysis: Past, Present, and Future Trends

Computer vision (CV) is a big and important field in artificial intelligence covering a wide range of applications. Image analysis is a major task in CV aiming to extract, analyse and understand the visual content of images. However, imagerelated tasks are very challenging due to many factors, e.g., high variations across images, high dimensionality, domain expertise requirement, and image distortions. Evolutionary computation (EC) approaches have been widely used for image analysis with significant achievement. However, there is no comprehensive survey of existing EC approaches to image analysis. To fill this gap, this paper provides a comprehensive survey covering all essential EC approaches to important image analysis tasks including edge detection, image segmentation, image feature analysis, image classification, object detection, and others. This survey aims to provide a better understanding of evolutionary computer vision (ECV) by discussing the contributions of different approaches and exploring how and why EC is used for CV and image analysis. The applications, challenges, issues, and trends associated to this research field are also discussed and summarised to provide further guidelines and opportunities for future research

Learning Opposites with Evolving Rules

The idea of opposition-based learning was introduced 10 years ago. Since then a noteworthy group of researchers has used some notions of oppositeness to improve existing optimization and learning algorithms. Among others, evolutionary algorithms, reinforcement agents, and neural networks have been reportedly extended into their opposition-based version to become faster and/or more accurate. However, most works still use a simple notion of opposites, namely linear (or type- I) opposition, that for each $x\in[a,b]$ assigns its opposite as $\breve{x}_I=a+b-x$. This, of course, is a very naive estimate of the actual or true (non-linear) opposite $\breve{x}_{II}$, which has been called type-II opposite in literature. In absence of any knowledge about a function $y=f(\mathbf{x})$ that we need to approximate, there seems to be no alternative to the naivety of type-I opposition if one intents to utilize oppositional concepts. But the question is if we can receive some level of accuracy increase and time savings by using the naive opposite estimate $\breve{x}_I$ according to all reports in literature, what would we be able to gain, in terms of even higher accuracies and more reduction in computational complexity, if we would generate and employ true opposites? This work introduces an approach to approximate type-II opposites using evolving fuzzy rules when we first perform opposition mining. We show with multiple examples that learning true opposites is possible when we mine the opposites from the training data to subsequently approximate $\breve{x}_{II}=f(\mathbf{x},y)$.Comment: Accepted for publication in The 2015 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE 2015), August 2-5, 2015, Istanbul, Turke