An Estimation of Distribution Algorithm Based on Variational Bayesian for Point-Set Registration

• Published in: IEEE transactions on evolutionary computation Vol. 26; no. 5; pp. 926 - 940
• Main Authors: Cao, Hualong, He, Qiqi, Wang, Haifeng, Xiong, Zenghui, Zhang, Ni, Yang, Yang
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.10.2022; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Adaptation models; Algorithms; Asymmetric generalized Gaussian mixture model (AGGMM); Bayes methods; Bayesian analysis; Clustering algorithms; Complexity; Computer vision; Conditional probability; Estimation; estimation of distribution algorithm (EDA); evolution strategy (ES); Optimization; Pattern recognition; point-set registration (PSR); Probabilistic logic; Probabilistic models; Registration; Robustness; Simulated annealing; Solution space; variational Bayesian
• ISSN: 1089-778X; 1941-0026
• DOI: 10.1109/TEVC.2021.3139304

Point-set registration is widely used in computer vision and pattern recognition. However, it has become a challenging problem since the current registration algorithms suffer from the complexities of the point-set distributions. To solve this problem, we propose a robust registration algorithm based on the estimation of distribution algorithm (EDA) to optimize the complex distributions from a global search mechanism. We propose an EDA probability model based on the asymmetric generalized Gaussian mixture model, which describes the area in the solution space as comprehensively as possible and constructs a probability model of complex distribution points, especially for missing and outliers. We propose a transformation and a Gaussian evolution strategy in the selection mechanism of EDA to process the deformation, rotation, and denoising of selected dominant individuals. Considering the complexity of the model, we choose to optimize from the perspective of variational Bayesian, and introduce a prior probability distribution through local variation to reinforce the convergence of the algorithm in dealing with complex point sets. In addition, a local search mechanism based on the simulated annealing algorithm is added to realize the coarse-to-fine registration. Experimental results show that our method has the best robustness compared with the state-of-the-art registration algorithms.