Object Pose: The Link between Weak Perspective, Paraperspective, and Full Perspective

Radu Horaud, Fadi Dornaika, Bart Lamiroy, Stephane ChristyarXiv 2026 · DOI · arXiv

Determining the 3D pose of an object from a single 2D image is a fundamental challenge in computer vision. In their paper, "Object Pose: The Link between Weak Perspective, Paraperspective, and Full Perspective," Radu Horaud and his colleagues provide an elegant bridge between fast, linear approximations and the complex, non-linear reality of full perspective projection.

TL;DR

The authors propose an iterative paraperspective algorithm that computes an object's 3D pose from 2D-3D point correspondences. By using a first-order linear approximation that converges to a full perspective solution, their method is 100 times faster than standard non-linear optimization and significantly more robust than previous "weak perspective" techniques.

What Problem Does This Paper Address?

To find an object's pose (its rotation and translation relative to the camera), we typically use the Full Perspective model. However, this model is non-linear, making it computationally expensive and sensitive to having a good "starting guess" to avoid getting stuck in local minima.

Earlier work by DeMenthon and Davis used Weak Perspective—a zero-order linear approximation—to simplify the problem. While fast, weak perspective assumes the object is centered on the camera's optical axis. If the object is off-center or close to the camera, the approximation breaks down, leading to slow convergence or outright failure. This paper seeks a middle ground: a method that is as fast as linear models but as accurate and robust as full perspective.

Methods

The core innovation is the move from weak perspective to Paraperspective.

  1. First-Order Approximation: While weak perspective assumes all points lie on a plane parallel to the image, paraperspective (a first-order approximation) accounts for the angle between the object and the optical axis.
  2. Iterative Refinement: The authors treat the difference between the linear model and full perspective as a small correction term ($\epsilon_i$). They solve a linear system to get an initial pose, use that pose to update the correction terms, and repeat. This "iterative paraperspective" process quickly converges to the true perspective pose.
  3. Orthogonality Constraint: Linear methods often produce "rotation" matrices that aren't perfectly orthogonal. The authors introduce a simple, closed-form fix using unit quaternions to ensure the estimated rotation is physically valid, which significantly boosts accuracy.
  4. Handling Planar Objects: For coplanar points, affine models suffer from a "reversal ambiguity" (two possible orientations). The authors use a binary tree search to track both possibilities and select the one most consistent with the data (see Figure 5).
Figure 2: Comparison of Weak, Para, and Full Perspective projections. Paraperspective provides a much closer approximation for off-axis objects.

Datasets

The authors evaluated their method using:

  • Simulated Data: A tetrahedron of four points was used to rigorously test convergence and sensitivity to image noise and camera calibration errors.
  • Real-World Images: They demonstrated the algorithm on polyhedral objects in laboratory settings, matching junctions and lines to determine pose in real-time (see Figures 14 and 17 in the paper).

Key Insights and Ideas

  • The Crucial Choice of Origin: The quality of paraperspective depends on choosing a good reference point ($P_0$). The authors suggest using the center of gravity of the image points to minimize projection errors.
  • Speed vs. Accuracy: By turning a non-linear problem into a sequence of linear ones, they achieve the "best of both worlds"—the global convergence properties of linear methods and the precision of perspective models.
  • Calibration Sensitivity: The paper identifies an "optimal experimental setup" where the object is 5 to 10 times its own size away from the camera. At this distance, the impact of imprecise camera calibration (like an incorrectly estimated optical center) is naturally minimized.
Figure 5: A binary tree search used to resolve orientation ambiguity when dealing with coplanar object points.

Key Results

  • Convergence Speed: The iterative paraperspective algorithm converges 2 to 3 times faster (fewer iterations) than the iterative weak perspective method.
  • Computational Efficiency: The method is approximately 100 times faster than standard non-linear minimization techniques, making it ideal for real-time robotics.
  • Robustness: In scenarios where the object is far from the optical axis, weak perspective often fails to converge. Paraperspective remains stable and accurate in these same conditions.
  • Accuracy: With the added orthogonality constraint, the linear method's accuracy becomes nearly indistinguishable from much slower non-linear optimizations.

Limitations and Future Work

  • Noise Sensitivity: Like most linear algebraic techniques, the method is slightly more sensitive to high levels of image noise than robust non-linear minimization.
  • Calibration Dependency: While the paper analyzes sensitivity, the method still requires reasonably accurate intrinsic camera parameters (focal length, etc.) to function.
  • Future Directions: The authors suggest extending this iterative framework to the problem of reconstruction from multiple views, potentially linking linear and projective approaches in 3D modeling.

Summary updated

Abstract

Recently, DeMenthon and Davis [4,5] proposed a method for determining the pose of a 3-D object with respect to a camera from 3-D to 2-D point correspondences. The method consists of iteratively improving the pose computed with a weak perspective camera model to converge, at the limit, to a pose estimation computed with a perspective camera model. In this paper we give an algebraic derivation of DeMenthon and Davis' method and we show that it belongs to a larger class of methods where the perspective camera model is approximated either at zero order (weak perspective) or first order (paraperspective). We describe in detail an iterative paraperspective pose computation method for both non coplanar and coplanar object points. We analyse the convergence of these methods and we conclude that the iterative paraperspective method (proposed in this paper) has better convergence properties than the iterative weak perspective method. We introduce a simple way of taking into account the orthogonality constraint associated with the rotation matrix. We analyse the sensitivity to camera calibration errors and we define the optimal experimental setup with respect to imprecise camera calibration. We compare the results obtained with this method and with a non-linear optimization method.
BibTeX
@misc{horaud2026object,
  author = {Radu Horaud and Fadi Dornaika and Bart Lamiroy and Stephane Christy},
  title = {{Object Pose: The Link between Weak Perspective, Paraperspective, and Full Perspective}},
  year = {2026},
  eprint = {2611.24095},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.24095},
}

Loading related content...

Figure