Generative Adversarial Networks for Solving Hand-Eye Calibration without Data Correspondence
Ilkwon Hong, Junhyoung Ha
TL;DR
This work reframes hand-eye calibration without data correspondence as a distribution-matching problem solvable by Generative Adversarial Networks (GANs). By constraining the generator to act as $G(A)=X^{-1}AX$ with $X\in SE(3)$, the method aligns the distributions of $\{B_j\}$ and $\{X^{-1}A_iX\}$ without requiring correspondences or explicit pdf models. The approach yields a mode-collapse-free, geometry-aware calibration procedure that leverages the full data distribution, demonstrated on synthetic data and a real hardware setup, with notable improvements in rotation accuracy and robustness to time offsets. The paper also discusses stabilization techniques (orthogonality-preserving updates, data normalization, multi-start optimization) and extends the framework to general parameter estimation problems beyond hand-eye calibration. Overall, the method offers a new GAN-based tool for unsupervised, distribution-level calibration on nonlinear manifolds, with practical impact for multi-sensor systems and online calibration scenarios.
Abstract
In this study, we rediscovered the framework of generative adversarial networks (GANs) as a solver for calibration problems without data correspondence. When data correspondence is not present or loosely established, the calibration problem becomes a parameter estimation problem that aligns the two data distributions. This procedure is conceptually identical to the underlying principle of GAN training in which networks are trained to match the generative distribution to the real data distribution. As a primary application, this idea is applied to the hand-eye calibration problem, demonstrating the proposed method's applicability and benefits in complicated calibration problems.
