{"title":"Robust motion estimation for overlapping images via genetic algorithm","authors":"Yingchun Zhang, Juan Cao, Bohong Su","doi":"10.1109/ICNC.2012.6234722","DOIUrl":null,"url":null,"abstract":"We propose a robust method based on genetic algorithm for the estimation of the motion between two successive overlapping images, a classic problem in computer vision. To calculate the motion parameters encoded as a chromosome, we employed roulette wheel selection and total arithmetic crossover and developed a novel adaptive mutation operator. The experimental results show that the normalized registration error of the final solution exhibits a significant improvement over those obtained by direct search approaches to such problems. Also, in contrast to other popular approaches such as the least-squares and Levenberg-Marquardt algorithm, the proposed method can escape from local extrema and can potentially produce the global optimum.","PeriodicalId":404981,"journal":{"name":"2012 8th International Conference on Natural Computation","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 8th International Conference on Natural Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNC.2012.6234722","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
We propose a robust method based on genetic algorithm for the estimation of the motion between two successive overlapping images, a classic problem in computer vision. To calculate the motion parameters encoded as a chromosome, we employed roulette wheel selection and total arithmetic crossover and developed a novel adaptive mutation operator. The experimental results show that the normalized registration error of the final solution exhibits a significant improvement over those obtained by direct search approaches to such problems. Also, in contrast to other popular approaches such as the least-squares and Levenberg-Marquardt algorithm, the proposed method can escape from local extrema and can potentially produce the global optimum.