QUANTUMIZED GENETIC ALGORITHM FOR SEGMENTATION AND OPTIMIZATION TASKS

2020 ◽  
Vol 32 (03) ◽  
pp. 2050022
Author(s):  
Malihe Sabeti ◽  
Laleh Karimi ◽  
Naemeh Honarvar ◽  
Mahsa Taghavi ◽  
Reza Boostani

Specialists mostly assess the skeletal maturity of short-height children by observing their left hand X-Ray image (radiograph), whereas precise separation of areas capturing the bones and growing plates is always not possible by visual inspection. Although a few attempts are made to estimate a suitable threshold for segmenting digitized radiograph images, their results are not still promising. To finely estimate segmentation thresholds, this paper presents the quantumized genetic algorithm (QGA) that is the integration of quantum representation scheme in the basic genetic algorithm (GA). This hybridization between quantum inspired computing and GA has led to an efficient hybrid framework that achieves better balance between the exploration and the exploitation capabilities. To assess the performance of the proposed quantitative bone maturity assessment framework, we have collected an exclusive dataset including 65 left-hand digitized images, aged from 3 to 13 years. Thresholds are estimated by the proposed method and the results are compared to harmony search algorithm (HSA), particle swarm optimization (PSO), quantumized PSO and standard GA. In addition, for more comparison of the proposed method and the other mentioned evolutionary algorithms, ten known benchmarks of complex functions are considered for optimization task. Our results in both segmentation and optimization tasks show that QGA and GA provide the best optimization results in comparison with the other mentioned algorithms. Moreover, the empirical results demonstrate that QGA is able to provide better diversity than that of GA.

2019 ◽  
Author(s):  
Kee Huong Lai ◽  
Woon Jeng Siow ◽  
Ahmad Aniq bin Mohd Nooramin Kaw ◽  
Pauline Ong ◽  
Zarita Zainuddin

2020 ◽  
Author(s):  
M Bidoki ◽  
M Fakhrahmad ◽  
M R Moosavi

Abstract Today, automated extractive text summarization is one of the most common techniques for organizing information. In extractive summarization, the most appropriate sentences are selected from the text and build a representative summary. Therefore, probing for the best sentences is a fundamental task. This paper has coped with extractive summarization as a multi-objective optimization problem and proposed a language-independent, semantic-aware approach that applies the harmony search algorithm to generate appropriate multi-document summaries. It learns the objective function from an extra set of reference summaries and then generates the best summaries according to the trained function. The system also performs some supplementary activities for better achievements. It expands the sentences by using an inventive approach that aims at tuning conceptual densities in the sentences towards important topics. Furthermore, we introduced an innovative clustering method for identifying important topics and reducing redundancies. A sentence placement policy based on the Hamiltonian shortest path was introduced for producing readable summaries. The experiments were conducted on DUC2002, DUC2006 and DUC2007 datasets. Experimental results showed that the proposed framework could assist the summarization process and yield better performance. Also, it was able to generally outperform other cited summarizer systems.


2014 ◽  
Vol 989-994 ◽  
pp. 2532-2535
Author(s):  
Hong Gang Xia ◽  
Qing Zhou Wang

This paper presents a modified harmony search (MHS) algorithm for solving numerical optimization problems. MHS employs a novel self-learning strategy for generating new solution vectors that enhances accuracy and convergence rate of harmony search (HS) algorithm. In the proposed MHS algorithm, the harmony memory consideration rate (HMCR) is dynamically adapted to the changing of objective function value in the current harmony memory. The other two key parameters PAR and bw adjust dynamically with generation number. Based on a large number of experiments, MHS has demonstrated stronger convergence and stability than original harmony search (HS) algorithm and its two improved algorithms (IHS and GHS).


Author(s):  
DSNM Rao ◽  
Niranjan Kumar

This paper discusses economic load dispatch Problem is modeled with non-convex functions. These are problem are not solvable using a convex optimization techniques. So there is a need for using a heuristic method. Among such methods Teaching and Learning Based Optimization (TLBO) is a recently known algorithm and showed promising results. This paper utilized this algorithm to provide load dispatch solutions. Comparisons of this solution with other standard algorithms like Particle Swarm Optimization (PSO), Differential Evolution (DE) and Harmony Search Algorithm (HSA). This proposed algorithm is applied to solve the load dispatch problem for 6 unit and 10 unit test systems along with the other algorithms. This comparisional investigation explored various merits of TLBO with respect to PSO, DE, and HAS in the field economic load dispatch.


Sign in / Sign up

Export Citation Format

Share Document