Novel Adaptive Genetic Algorithm Sample Consensus

by   Ehsan Shojaedini, et al.

Random sample consensus (RANSAC) is a successful algorithm in model fitting applications. It is vital to have strong exploration phase when there are an enormous amount of outliers within the dataset. Achieving a proper model is guaranteed by pure exploration strategy of RANSAC. However, finding the optimum result requires exploitation. GASAC is an evolutionary paradigm to add exploitation capability to the algorithm. Although GASAC improves the results of RANSAC, it has a fixed strategy for balancing between exploration and exploitation. In this paper, a new paradigm is proposed based on genetic algorithm with an adaptive strategy. We utilize an adaptive genetic operator to select high fitness individuals as parents and mutate low fitness ones. In the mutation phase, a training method is used to gradually learn which gene is the best replacement for the mutated gene. The proposed method adaptively balance between exploration and exploitation by learning about genes. During the final Iterations, the algorithm draws on this information to improve the final results. The proposed method is extensively evaluated on two set of experiments. In all tests, our method outperformed the other methods in terms of both the number of inliers found and the speed of the algorithm.


page 1

page 2

page 3

page 4


A Novel Hybrid Crossover based Artificial Bee Colony Algorithm for Optimization Problem

Artificial bee colony (ABC) algorithm has proved its importance in solvi...

A Rank based Adaptive Mutation in Genetic Algorithm

Traditionally Genetic Algorithm has been used for optimization of unimod...

Genetic and Memetic Algorithm with Diversity Equilibrium based on Greedy Diversification

The lack of diversity in a genetic algorithm's population may lead to a ...

Kernel Density Estimation by Genetic Algorithm

This study proposes a data condensation method for multivariate kernel d...

Recommandation mobile, sensible au contexte de contenus évolutifs: Contextuel-E-Greedy

We introduce in this paper an algorithm named Contextuel-E-Greedy that t...

Leo: Lagrange Elementary Optimization

Global optimization problems are frequently solved using the practical a...

A multiset model of multi-species evolution to solve big deceptive problems

This chapter presents SMuGA, an integration of symbiogenesis with the Mu...

Please sign up or login with your details

Forgot password? Click here to reset