Camera Pose Revisited
Władysław Skarbek, Michał Salomonowicz, Michał Król
TL;DR
This paper revisits camera pose estimation for planar scenes by introducing PnP-ProCay78, a Cayley-parameterized nonlinear LS approach that eliminates translation analytically. It provides a deterministic, two-start initialization based on the kernel structure of the reconstruction-error matrix, aided by a Procrustes$^+$ correction to obtain valid rotations. Empirical results show projection and reprojection accuracy comparable to SQPnP and IPPE while offering a simpler, more interpretable algorithm, with consistent convergence across RGB and low-resolution IR data. The work also contributes a geometric and didactic framework, including Cayley-space trajectory visualization, and discusses implications for multi-sensor (RGB–IR) calibration and future extensions to quasi-planar scenes.
Abstract
Estimating the position and orientation of a camera with respect to an observed scene is one of the central problems in computer vision, particularly in the context of camera calibration and multi-sensor systems. This paper addresses the planar Perspective--$n$--Point problem, with special emphasis on the initial estimation of the pose of a calibration object. As a solution, we propose the \texttt{PnP-ProCay78} algorithm, which combines the classical quadratic formulation of the reconstruction error with a Cayley parameterization of rotations and least-squares optimization. The key component of the method is a deterministic selection of starting points based on an analysis of the reconstruction error for two canonical vectors, allowing costly solution-space search procedures to be avoided. Experimental validation is performed using data acquired also from high-resolution RGB cameras and very low-resolution thermal cameras in an integrated RGB--IR setup. The results demonstrate that the proposed algorithm achieves practically the same projection accuracy as optimal \texttt{SQPnP} and slightly higher than \texttt{IPPE}, both prominent \texttt{PnP-OpenCV} procedures. However, \texttt{PnP-ProCay78} maintains a significantly simpler algorithmic structure. Moreover, the analysis of optimization trajectories in Cayley space provides an intuitive insight into the convergence process, making the method attractive also from a didactic perspective. Unlike existing PnP solvers, the proposed \texttt{PnP-ProCay78} algorithm combines projection error minimization with an analytically eliminated reconstruction-error surrogate for translation, yielding a hybrid cost formulation that is both geometrically transparent and computationally efficient.
