Novel adaptive genetic algorithm sample consensus

doi:10.1016/j.asoc.2019.01.052

Return

Novel adaptive genetic algorithm sample consensus

2019-04-01

Mahshid Majd

Reza Safabakhsh *

DOI：10.1016/j.asoc.2019.01.052

Original

Save

View PDF

Abstract

En 中文

Random Sample Consensus (RANSAC) is a successful algorithm in model fitting applications when there are numerous outliers within the dataset. Achieving a proper model is guaranteed through the pure exploration strategy of RANSAC. However, finding the optimum result requires exploitation. Genetic Algorithm Sample Consensus (GASAC) is an evolutionary paradigm which adds the exploitation capability to RANSAC. 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 algorithms using an adaptive strategy. We propose an adaptive genetic operator to select the proper number of high fitness individuals as parents and mutate the rest. This operator can adjust the ratio of exploration vs. exploitation phases according to the amount of outliers. Also, a learning method is proposed for the mutation operator to gradually learn which gene is the best replacement for the mutated gene. This operator guides the exploration phase towards good solution areas and therefore produces better individuals for further exploitation. The proposed method is extensively evaluated in two sets 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. (C) 2019 Elsevier B.V. All rights reserved.

Keywords:

Adaptive Random Sample Consensus

AGASAC

RANSAC

GASAC

Genetic algorithm

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.