Heuristic solution with similarity, affinities and projective transformation problems with Backtracing Search Algorithm (BSA)
Abstract
In this paper, three different types of coordinate transformations that are frequently used in geodetic applications are given the details of their application with evolutionary algorithms. Similarity (Helmert), Affin and Projective transformation models commonly used in coordinate transformation applications are examined in detail and classical and computational intelligence solutions of related problem solutions are compared. In numerical problem solving, the classic Least-Squares method can be easily captured in local solutions. Evolutionary algorithms have the ability to avoid local solutions, unlike classical methods, in solving numerical problems because of their intuitive solution search capabilities. Evolutionary search algorithms do not need derivative components of a problem in solving a numerical problem. For this reason, the use of evolutionary algorithms in system identification problems such as coordinate solutions provides highly efficient solutions. The application was made using a geodetic GPS measurement data in a test network built on the campus of Erciyes University. Backtracking Search Optimization Algorithm (BSA) is used in practice. BSA results were also compared with the results of four different evolutionary search methods.
Keywords
Cite this article
Günen, M. A., Çivicioğlu, P., & Beşdok, E. (2018). Heuristic solution with similarity, affinities and projective transformation problems with Backtracing Search Algorithm (BSA). In Ist International Symposium on Innovative Approaches in Scientific Studies (pp. 57). SET Technology.
Article History
- Published
- 23 Jun 2018
License
© 2018 SET Technology. This article is distributed under the terms of the CC BY 4.0.