Test Methods Research of Cracks in Ceramics Based on Genetic Algorithm

2014 ◽  
Vol 977 ◽  
pp. 25-29
Author(s):  
Bing Xiang Liu ◽  
Feng Qin Wang ◽  
Xu Dong Wu ◽  
Ying Xi Li
Keyword(s):  
Genetic Algorithm ◽  
Image Segmentation ◽  
Optimization Problem ◽  
Fitness Function ◽  
Recognition Rate ◽  
Test Methods ◽  
Segmentation Method ◽  
Maximum Variance ◽  
Best Value ◽  
Crossover And Mutation

In order to improve the reliability of cracks in ceramics test, this paper puts forward a target adaptive segmentation method used by genetic algorithm and maximum-variance algorithm in all classes. This proposed method makes some appropriate improvements about crossover and mutation in genetic algorithm. Besides, the fitness function draws merits of maximum-variance algorithm in all classes and turns the best value in image segmentation into corresponding optimization problem. The simulation results of experiment shows the method proposed shortens the searching time and strengthens anti-noise property during image segmentation and improves recognition rate of cracks in ceramics.

Study on Otsu Threshold Method for Image Segmentation Based on Genetic Algorithm

2014 ◽  
Vol 998-999 ◽  
pp. 925-928 ◽  
Author(s):  
Zhi Bo Xu ◽  
Pei Jiang Chen ◽  
Shi Li Yan ◽  
Tai Hua Wang
Keyword(s):  
Genetic Algorithm ◽  
Image Processing ◽  
Image Segmentation ◽  
Image Process ◽  
Segmentation Method ◽  
Threshold Method ◽  
Threshold Segmentation ◽  
Maximum Variance ◽  
Segmentation Image ◽  
Selection Of

Threshold segmentation method was widely applied in image process and the selection of threshold affected the final results of image segmentation to a large extent. In order to improve the accuracy and the calculation speed of image segmentation, an Otsu threshold segmentation method based on genetic algorithm was offered. According to the threshold and the gray scale values of pixels, the pixels were divided into two categories, and then the genetic algorithm was used to find the maximum variance between clusters and obtain the optimal threshold of segmentation image. The experimental results show that this method can be used to segment the image effectively, which make the basis for image processing and analysis in the next step.

Crop Disease Leaf Image Segmentation Based on Genetic Algorithm and Maximum Entropy

2015 ◽  
Vol 713-715 ◽  
pp. 1670-1674 ◽  
Author(s):  
Ming Gang Du ◽  
Shan Wen Zhang
Keyword(s):  
Genetic Algorithm ◽  
Image Segmentation ◽  
Maximum Entropy ◽  
Fitness Function ◽  
Convergence Criterion ◽  
Segmentation Method ◽  
Uniform Illumination ◽  
Crop Disease ◽  
Main Spot ◽  
Leaf Image

Crop disease leaf image segmentation is a key step in crop disease recognition. In the paper, a segmentation method of crop disease leaf image is proposed to segment leaf image with non-uniform illumination based on maximum entropy and genetic algorithm (GA). The information entropy is regarded as the fitness function of GA, the maximum entropy as convergence criterion of GA. After genetic operation, the optimal threshold is obtained to segment the image of disease leaf. The experimental results of the maize disease leaf image show that the proposed method can select the threshold automatically and efficiently, and has an advantage over the other three algorithms, and also can reserve the main spot features of the original disease leaf image.

A Genetic Algorithm Based Procedure for Extracting Optimal Solutions From a Morphological Chart

2007 ◽  
Author(s):  
Santosh Tiwari ◽  
Joshua Summers ◽  
Georges Fadel
Keyword(s):  
Genetic Algorithm ◽  
Optimization Problem ◽  
Mathematical Representation ◽  
Optimal Solutions ◽  
Proof Of Concept ◽  
Optimization Framework ◽  
Mutation Operators ◽  
Novel Approach ◽  
Morphological Chart ◽  
Crossover And Mutation

A novel approach using a genetic algorithm is presented for extracting globally satisfycing (Pareto optimal) solutions from a morphological chart where the evaluation and combination of “means to sub-functions” is modeled as a combinatorial multi-objective optimization problem. A fast and robust genetic algorithm is developed to solve the resulting optimization problem. Customized crossover and mutation operators specifically tailored to solve the combinatorial optimization problem are discussed. A proof-of-concept simulation on a practical design problem is presented. The described genetic algorithm incorporates features to prevent redundant evaluation of identical solutions and a method for handling of the compatibility matrix (feasible/infeasible combinations) and addressing desirable/undesirable combinations. The proposed approach is limited by its reliance on the quantifiable metrics for evaluating the objectives and the existence of a mathematical representation of the combined solutions. The optimization framework is designed to be a scalable and flexible procedure which can be easily modified to accommodate a wide variety of design methods that are based on the morphological chart.

A Video Image Segmentation Technology Based on Adaptive Thresholding Algorithm

2013 ◽  
Vol 380-384 ◽  
pp. 1189-1192 ◽  
Author(s):  
Hai Jun Zhao
Keyword(s):  
Image Processing ◽  
Image Segmentation ◽  
Variance Decomposition ◽  
Optimum Number ◽  
Segmentation Method ◽  
Class Difference ◽  
Classification Image ◽  
Maximum Variance ◽  
Important Position ◽  
Thresholding Algorithm

Image segmentation is a key step in image processing and image analysis and occupies an important position in image engineering.In this paper, basing on maximum variance between-class, an adaptive and multi-objective image segmentation method is proposed. The concrete implement is to determine adaptively the optimum number of threshold of image using the idea of variance decomposition,while calculating the weighted ratio of within class difference and class difference existing in each classification image. By comparing the ratio, the optimum number of target for image can be get. The experimental results show that the sub-images after segmentation are relatively clear and the differences between classes are obvious.

The Attacking Dispersion Optimization in Multi Launch Rocket System Base-On Improved Genetic Algorithm

2014 ◽  
Vol 670-671 ◽  
pp. 1499-1502
Author(s):  
Wei Wang ◽  
Wei Dong Chen ◽  
Shu Qiang Zhang ◽  
Jiang Long Li ◽  
Ya En Xie
Keyword(s):  
Genetic Algorithm ◽  
Optimization Problem ◽  
Fitness Function ◽  
Reference Value ◽  
Weapon System ◽  
Improved Genetic Algorithm ◽  
Optimal Model ◽  
Overall Design ◽  
Mixed Coding ◽  
Rocket System

Firing dispersion of multi-launch rocket system is affected by launch sequence and firing interval significantly. Firing order and firing interval of the existing multi launch rocket system (MLRS) are optimized to improve the firing performance of the existing weapon system without changing the overall design of the weapon system. On one hand, based on optimization problem, the firing dispersion optimal model is established and the genetic algorithm is improved therefore, a sequence of mixed coding genetic algorithm is designed. On the other hand, simulation optimization of firing dispersion has been finished by the aid of fitness function which is based on the optimal model. Meanwhile, it testifies this algorithm’s validity and the simulation results can provide a certain reference value for engineering experiment.

Power System Reactive Power Optimization Based on Improved Genetic Agorithm

2012 ◽  
Vol 614-615 ◽  
pp. 1361-1366
Author(s):  
Ai Ning Su ◽  
Hui Qiong Deng ◽  
Tian Wei Xing
Keyword(s):  
Genetic Algorithm ◽  
Power System ◽  
Optimization Problem ◽  
Reactive Power ◽  
Power Optimization ◽  
Fitness Function ◽  
Reactive Power Optimization ◽  
Penalty Factor ◽  
Mutation Strategy ◽  
Optimization Search

Reactive power optimization is an effective method for improving the electricity quality and reducing the power loss in power system, and it is a mixed nonlinear optimization problem, so the optimization process becomes very complicated. Genetic algorithm is a kind of adaptive global optimization search algorithm based on simulating biological genetic in the natural environment and evolutionary processes, can be used to solve complex optimization problems such as reactive power optimization. Genetic algorithm is used to solve reactive power optimization problem in this study, improved the basic genetic algorithm, included the select, crossover and mutation strategy, and proposed a individual fitness function with penalty factor. The proposed algorithm is applied to the IEEE9-bus system to calculate reactive power. The results show the superiority of the proposed model and algorithm.

Nuclear Magnetic Image Segmentation of Rectal Cancer Based on Improved Genetic Neural Network

2020 ◽  
Vol 10 (7) ◽  
pp. 1644-1653
Author(s):  
Danyang Li ◽  
Yumei Sun ◽  
Wanqing Liu ◽  
Bing Hu ◽  
Jianlin Wu ◽  
...  
Keyword(s):  
Neural Network ◽  
Rectal Cancer ◽  
Image Segmentation ◽  
Fitness Function ◽  
Segmentation Method ◽  
Magnetic Image ◽  
Network Algorithm ◽  
Neural Network Algorithm ◽  
Genetic Neural Network ◽  
Nuclear Magnetic

Image segmentation is the basis of image analysis and understanding, and has an unshakable position in the field of computer vision. In order to improve the accuracy of nuclear magnetic image segmentation of rectal cancer, this paper proposes an improved genetic neural network algorithm for the problems of traditional BP neural network algorithm. In order to enhance the network performance, this paper improves the genetic neural network from the two aspects of fitness function and genetic operator, which makes the training speed and convergence precision greatly improved. Target samples were analyzed by image histogram analysis, and the improved genetic neural network was used to learn the samples to obtain the training network. Taking the pixel matrix of the image as the input vector, it is put into the trained network for classification, and finally the segmentation is realized. The simulation experiment proves that compared with the classical image segmentation method, the improved genetic neural network image segmentation method has a good segmentation effect and is a feasible image segmentation method.

Sign in / Sign up

Export Citation Format

Share Document