Variable Length PSO-Based Image Clustering for Image Denoising

2016 ◽  
pp. 294-320 ◽  
Author(s):  
Somnath Mukhopadhyay ◽  
J. K. Mandal ◽  
Tandra Pal
Keyword(s):  
Digital Images ◽  
Fitness Function ◽  
Evaluation Criteria ◽  
Variable Length ◽  
Image Clustering ◽  
Initial Population ◽  
Restoration Technique ◽  
Image Prior ◽  
Weighted Median ◽  
Filtering Technique

This chapter proposed a variable length Particle Swarm Optimization based image clustering technique for restoration of noises from digital images. Here in this two step noise restoration technique the noise free pixels are kept unchanged. The denoising technique uses 3 × 3 test window on the center pixel of the noisy image. Prior to detection and filtering, variable length PSO based image clustering has been done. The output of clustering determines the performance of the subsequent stages of the algorithm. For denoising weighted median filtering technique is proposed. Variable length particles are considered and randomly encoded for the initial population. The length of particles is changed by adding and/or deleting cluster centers present in the particles. Three evaluation criteria are used in the fitness function of the proposed algorithm. The performance of the proposed algorithm is compared with some similar algorithms existing in the literature on several standard digital images.

scholarly journals Analysis of Selection Methods Used in Genetic Algorithms

2021 ◽  
Vol 4 ◽  
pp. 29-43
Author(s):  
Nataliya Gulayeva ◽  
Artem Ustilov
Keyword(s):  
Growth Rate ◽  
Genetic Algorithms ◽  
Selection Pressure ◽  
Fitness Function ◽  
Selection Method ◽  
Initial Population ◽  
Reproduction Rate ◽  
Selection Methods ◽  
Selection Scheme ◽  
Fitness Value

This paper offers a comprehensive review of selection methods used in the generational genetic algorithms.Firstly, a brief description of the following selection methods is presented: fitness proportionate selection methods including roulette-wheel selection (RWS) and its modifications, stochastic remainder selection with replacement (SRSWR), remainder stochastic independent selection (RSIS), and stochastic universal selection (SUS); ranking selection methods including linear and nonlinear rankings; tournament selection methods including deterministic and stochastic tournaments as well as tournaments with and without replacement; elitist and truncation selection methods; fitness uniform selection scheme (FUSS).Second, basic theoretical statements on selection method properties are given. Particularly, the selection noise, selection pressure, growth rate, reproduction rate, and computational complexity are considered. To illustrate selection method properties, numerous runs of genetic algorithms using the only selection method and no other genetic operator are conducted, and numerical characteristics of analyzed properties are computed. Specifically, to estimate the selection pressure, the takeover time and selection intensity are computed; to estimate the growth rate, the ratio of best individual copies in two consecutive populations is computed; to estimate the selection noise, the algorithm convergence speed is analyzed based on experiments carried out on a specific fitness function assigning the same fitness value to all individuals.Third, the effect of selection methods on the population fitness distribution is investigated. To do this, there are conducted genetic algorithm runs starting with a binomially distributed initial population. It is shown that most selection methods keep the distribution close to the original one providing an increased mean value of the distribution, while others (such as disruptive RWS, exponential ranking, truncation, and FUSS) change the distribution significantly. The obtained results are illustrated with the help of tables and histograms.

Adaptive Median Filtering Based on Unsupervised Classification of Pixels

2013 ◽  
pp. 273-296 ◽  
Author(s):  
J. K. Mandal ◽  
Somnath Mukhopadhyay
Keyword(s):  
Clustering Algorithm ◽  
Digital Images ◽  
Unsupervised Classification ◽  
Median Filtering ◽  
Adaptive Window ◽  
Novel Approach ◽  
Weighted Median ◽  
Window Selection ◽  
Filtering Approach

This chapter deals with a novel approach which aims at detection and filtering of impulses in digital images through unsupervised classification of pixels. This approach coagulates directional weighted median filtering with unsupervised pixel classification based adaptive window selection toward detection and filtering of impulses in digital images. K-means based clustering algorithm has been utilized to detect the noisy pixels based adaptive window selection to restore the impulses. Adaptive median filtering approach has been proposed to obtain best possible restoration results. Results demonstrating the effectiveness of the proposed technique are provided for numeric intensity values described in terms of feature vectors. Various benchmark digital images are used to show the restoration results in terms of PSNR (dB) and visual effects which conform better restoration of images through proposed technique.

scholarly journals Sine-Cosine Optimization-Based Bijective Substitution-Boxes Construction Using Enhanced Dynamics of Chaotic Map

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-16 ◽  
Author(s):  
Amer Awad Alzaidi ◽  
Musheer Ahmad ◽  
Hussam S. Ahmed ◽  
Eesa Al Solami
Keyword(s):  
Fitness Function ◽  
Chaotic Map ◽  
Search Space ◽  
Initial Population ◽  
Substitution Boxes ◽  
Novel Method ◽  
Sine Cosine Algorithm ◽  
And Performance ◽  
Optimization Mechanism ◽  
Independence Criterion

This paper proposes a novel method of constructing strong substitution-boxes (S-boxes) of order n (4 ≤ n ≤ 8) based on a recent optimization algorithm known as sine-cosine algorithm (SCA). The paper also proposes a new 1D chaotic map, which owns enhanced dynamics compared to conventional chaotic map, for generating initial population of S-boxes and facilitating the optimization mechanism of SCA. The proposed method applies the SCA with enhanced chaotic map to explore and exploit the search space for obtaining optimized S-boxes on the basis of maximization of nonlinearity as fitness function. The S-box construction involves three phases such as initialization of population, optimization, and adjustment. The simulation and performance analyses are done using standard measures of nonlinearity, strict avalanche criterion, bits independence criterion, differential uniformity, linear approximation probability, and autocorrelation function. The obtained experimental results are compared with some immediate optimization-based and other S-boxes to show the strength of proposed method for constructing bijective S-boxes of salient cryptographic features.

scholarly journals Denoising of digital images through PSO based pixel classification

2013 ◽  
Vol 3 (4) ◽  
Author(s):  
Somnath Mukhopadhyay ◽  
Jyotsna Mandal
Keyword(s):  
Digital Images ◽  
Fitness Function ◽  
Unsupervised Classification ◽  
Noisy Image ◽  
Pixel Classification ◽  
Visual Effects ◽  
Swarm Optimization ◽  
Image Pixels ◽  
Noise Models

AbstractThis paper proposes a de-noising method where the detection and filtering is based on unsupervised classification of pixels. The noisy image is grouped into subsets of pixels with respect to their intensity values and spatial distances. Using a novel fitness function the image pixels are classified using the Particle Swarm Optimization (PSO) technique. The distance function measured similarity/dissimilarity among pixels using not only the intensity values, but also the positions of the pixels. The detection technique enforced PSO based clustering, which is very simple and robust. The filtering operator restored only the noisy pixels keeping noise free pixels intact. Four types of noise models are used to train the digital images and these noisy images are restored using the proposed algorithm. Results demonstrated the effectiveness of the proposed technique. Various benchmark images are used to produce restoration results in terms of PSNR (dB) along with other parametric values. Some visual effects are also presented which conform better restoration of digital images through the proposed technique.

A Natural Evolution Based Numerical Optimisation Framework to Develop and Enhance Airfoil-Slat Arrangement

2019 ◽  
Author(s):  
Sushrut Kumar ◽  
Priyam Gupta ◽  
Raj Kumar Singh
Keyword(s):  
Genetic Algorithm ◽  
Fitness Function ◽  
Fuel Efficiency ◽  
Optimal Solution ◽  
Leading Edge ◽  
Initial Population ◽  
Invasive Weed ◽  
Fitness Value ◽  
Leading Edge Slats ◽  
Dynamics Simulations

Abstract Leading Edge Slats are popularly being put into practice due to their capability to provide a significant increase in the lift generated by the wing airfoil and decrease in the stall. Consequently, their optimum design is critical for increased fuel efficiency and minimized environmental impact. This paper attempts to develop and optimize the Leading-Edge Slat geometry and its orientation with respect to airfoil using Genetic Algorithm. The class of Genetic Algorithm implemented was Invasive Weed Optimization as it showed significant potential in converging design to an optimal solution. For the study, Clark Y was taken as test airfoil. Slats being aerodynamic devices require smooth contoured surfaces without any sharp deformities and accordingly Bézier airfoil parameterization method was used. The design process was initiated by producing an initial population of various profiles (chromosomes). These chromosomes are composed of genes which define and control the shape and orientation of the slat. Control points, Airfoil-Slat offset and relative chord angle were taken as genes for the framework and different profiles were acquired by randomly modifying the genes within a decided design space. To compare individual chromosomes and to evaluate their feasibility, the fitness function was determined using Computational Fluid Dynamics simulations conducted on OpenFOAM. The lift force at a constant angle of attack (AOA) was taken as fitness value. It was assigned to each chromosome and the process was then repeated in a loop for different profiles and the fittest wing slat arrangement was obtained which had an increase in CL by 78% and the stall angle improved to 22°. The framework was found capable of optimizing multi-element airfoil arrangements.

scholarly journals A Composite Hybrid Feature Selection Learning-Based Optimization of Genetic Algorithm For Breast Cancer Detection

2020 ◽  
Author(s):  
Ahmed Abdullah Farid ◽  
Gamal Selim ◽  
Hatem Khater
Keyword(s):  
Breast Cancer ◽  
Genetic Algorithm ◽  
Feature Selection ◽  
Early Stage ◽  
Fitness Function ◽  
Support Vector ◽  
Initial Population ◽  
Tree Classifier ◽  
Selection Approach ◽  
Feature Selection Approach

Breast cancer is a significant health issue across the world. Breast cancer is the most widely-diagnosed cancer in women; early-stage diagnosis of disease and therapies increase patient safety. This paper proposes a synthetic model set of features focused on the optimization of the genetic algorithm (CHFS-BOGA) to forecast breast cancer. This hybrid feature selection approach combines the advantages of three filter feature selection approaches with an optimize Genetic Algorithm (OGA) to select the best features to improve the performance of the classification process and scalability. We propose OGA by improving the initial population generating and genetic operators using the results of filter approaches as some prior information with using the C4.5 decision tree classifier as a fitness function instead of probability and random selection. The authors collected available updated data from Wisconsin UCI machine learning with a total of 569 rows and 32 columns. The dataset evaluated using an explorer set of weka data mining open-source software for the analysis purpose. The results show that the proposed hybrid feature selection approach significantly outperforms the single filter approaches and principal component analysis (PCA) for optimum feature selection. These characteristics are good indicators for the return prediction. The highest accuracy achieved with the proposed system before (CHFS-BOGA) using the support vector machine (SVM) classifiers was 97.3%. The highest accuracy after (CHFS-BOGA-SVM) was 98.25% on split 70.0% train, remainder test, and 100% on the full training set. Moreover, the receiver operating characteristic (ROC) curve was equal to 1.0. The results showed that the proposed (CHFS-BOGA-SVM) system was able to accurately classify the type of breast tumor, whether malignant or benign.

PALMPRINTS: A COOPERATIVE CO-EVOLUTIONARY ALGORITHM FOR CLUSTERING HAND IMAGES

2005 ◽  
Vol 05 (03) ◽  
pp. 595-616 ◽  
Author(s):  
NAWWAF KHARMA ◽  
CHING Y. SUEN ◽  
PEI F. GUO
Keyword(s):  
Genetic Algorithm ◽  
Evolutionary Algorithm ◽  
Practical Problem ◽  
Research Effort ◽  
Fitness Function ◽  
Image Clustering ◽  
Number Of Clusters ◽  
Fitness Value ◽  
Evolutionary Genetic ◽  
Hand Image

The main objective of Project PalmPrints is to develop and demonstrate a special co-evolutionary genetic algorithm (GA) that optimizes (a clustering fitness function) with respect to three quantities, (a) the dimensions of the clustering space; (b) the number of clusters; and (c) and the locations of the various clusters. This genetic algorithm is applied to the specific practical problem of hand image clustering, with success. In addition to the above, this research effort makes the following contributions: (i) a CD database of (raw and processed) right-hand images; (ii) a number of novel features designed specifically for hand image classification; (iii) an extended fitness function, which is particularly suited to a dynamic (i.e. dimensionality varying) clustering space. Despite the complexity of the multi-optimizational task, the results of this study are clear. The GA succeeded in achieving a maximum fitness value of 99.1%; while reducing the number of dimensions (features) of the space by more than half (from 84 to 41).

Boosting Algorithm and Meta-Heuristic Based on Genetic Algorithms for Textual Plagiarism Detection

2015 ◽  
Vol 9 (4) ◽  
pp. 65-87 ◽  
Author(s):  
Hadj Ahmed Bouarara ◽  
Reda Mohamed Hamou ◽  
Amine Rahmani ◽  
Abdelmalek Amine
Keyword(s):  
Learning Algorithm ◽  
Fitness Function ◽  
Modern World ◽  
Initial Population ◽  
Plagiarism Detection ◽  
Detection Systems ◽  
Global View ◽  
Boosting Algorithm ◽  
Crossover And Mutation

Day after day, the plagiarism cases increase and become a crucial problem in the modern world, caused by the quantity of textual information available in the web and the development of communication means such as email service. This paper deals on the unveiling of two plagiarism detection systems: Firstly boosting system based on machine learning algorithm (decision tree C4.5 and K nearest neighbour) composed on three steps (text pre-processing, first detection, and second detection). Secondly using genetic algorithm based on an initial population generated from the dataset used a fitness function fixed and the reproduction rules (selection, crossover, and mutation). For their experimentation, the authors have used the benchmark pan 09 and a set of validation measures (precision, recall, f-measure, FNR, FPR, and entropy) with a variation in configuration of each system; They have compared their results with the performance of other approaches found in literature; Finally, the visualisation service was developed that provides a graphical vision of the results using two methods (3D cub and a cobweb) with the possibility to have a detailed and global view using the functionality of zooming and rotation. The authors' aims are to improve the quality of plagiarism detection systems and preservation of copyright.

Sign in / Sign up

Export Citation Format

Share Document