Symmetric similarity 3D coordinate transformation based on dual quaternion algorithm
Sebahattin Bekta\c{s}

TL;DR
This paper introduces a new dual quaternion-based iterative algorithm for symmetric 3D coordinate transformation, addressing error minimization and providing models with and without constraints, applicable to both 2D and 3D cases.
Contribution
It proposes a novel dual quaternion algorithm for symmetric similarity 3D transformations, including detailed derivation and error analysis, adaptable to symmetric and asymmetric cases.
Findings
The algorithm effectively computes transformation parameters and errors.
Models with and without constraints are evaluated and compared.
The method is applicable to both 2D and 3D transformations.
Abstract
Nowadays, we have seen that dual quaternion algorithms are used in 3D coordinate transformation problems due to their advantages. 3D coordinate transformation problem is one of the important problems in geodesy. This transformation problem is encountered in many application areas other than geodesy. Although there are many coordinate transformation methods (similarity, affine, projective, etc.), similarity transformation is used because of its simplicity. The asymmetric transformation is preferred to the symmetric coordinate transformation because of its ease of use. In terms of error theory, the symmetric transformation should be preferred. In this study, the topic of symmetric similarity 3D coordinate transformation based on the dual quaternion algorithm is discussed, and the bottlenecks encountered in solving the problem and the solution method are discussed. A new iterative…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
