{"title":"Three-layer Fast Image Matching Algorithm Research Based on Evolutionary Algorithm","authors":"Y. Jingfeng, Guo Chaofeng","doi":"10.1109/ICFCSE.2011.169","DOIUrl":null,"url":null,"abstract":"A three-layer fast image matching algorithm based on Evolutionary Algorithm is proposed. It has some new features: 1A strategy from coarse matching to fine matching is adopted. Large numbers of non-matching points will be firstly eliminated by performing coarse matching with circular and cross templates, then a whole template is applied to confirming the final position to reduce the calculation workload; 2) two mutation strategies are proposed: low probability mutation strategy for the early mutation; and high probability strategy for the late mutation to enhance the diversity of population. The experimental results demonstrate that the performance in this paper outperforms that of other evolutionary algorithms in terms of the quality of the final solution, its stability is better and its computational cost is lower than the cost required by the correlation method and the circular method.","PeriodicalId":279889,"journal":{"name":"2011 International Conference on Future Computer Science and Education","volume":"103 25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Future Computer Science and Education","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICFCSE.2011.169","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
A three-layer fast image matching algorithm based on Evolutionary Algorithm is proposed. It has some new features: 1A strategy from coarse matching to fine matching is adopted. Large numbers of non-matching points will be firstly eliminated by performing coarse matching with circular and cross templates, then a whole template is applied to confirming the final position to reduce the calculation workload; 2) two mutation strategies are proposed: low probability mutation strategy for the early mutation; and high probability strategy for the late mutation to enhance the diversity of population. The experimental results demonstrate that the performance in this paper outperforms that of other evolutionary algorithms in terms of the quality of the final solution, its stability is better and its computational cost is lower than the cost required by the correlation method and the circular method.