{"title":"Meta-Heuristics for Solving Curve Fitting Problems in Optical-Diffraction Based Image Depth Reconstruction","authors":"Qianyao Zhu, Kaizhou Gao, Yongjun Liu","doi":"10.1109/SEAI59139.2023.10217365","DOIUrl":null,"url":null,"abstract":"This paper investigates use meta-heuristic to solve curve fitting problems in Optical-Diffraction Based Image Depth Reconstruction. We aim to accurately establish a relationship curve between object distance and diffraction blur kernel through discrete data points. A mathematical model is first developed to formulate the concerned problems. Then, four meta-heuristic algorithms, particle swarm optimization, artificial bee colony, genetic algorithm and differential evolution, are employed and improved according to the problem’s feature. Finally, experiments are executed on a data set. A comparison of the similarity of the least squares method verifies the feasibility of meta-heuristics for solving curve fitting problems. Among the four meta-heuristics, differential evolution algorithm has the best competitiveness.","PeriodicalId":381082,"journal":{"name":"2023 IEEE 3rd International Conference on Software Engineering and Artificial Intelligence (SEAI)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 IEEE 3rd International Conference on Software Engineering and Artificial Intelligence (SEAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SEAI59139.2023.10217365","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
This paper investigates use meta-heuristic to solve curve fitting problems in Optical-Diffraction Based Image Depth Reconstruction. We aim to accurately establish a relationship curve between object distance and diffraction blur kernel through discrete data points. A mathematical model is first developed to formulate the concerned problems. Then, four meta-heuristic algorithms, particle swarm optimization, artificial bee colony, genetic algorithm and differential evolution, are employed and improved according to the problem’s feature. Finally, experiments are executed on a data set. A comparison of the similarity of the least squares method verifies the feasibility of meta-heuristics for solving curve fitting problems. Among the four meta-heuristics, differential evolution algorithm has the best competitiveness.