Review and analysis of solutions of the three point perspective pose estimation problem
International Journal of Computer Vision
Bundle Adjustment - A Modern Synthesis
ICCV '99 Proceedings of the International Workshop on Vision Algorithms: Theory and Practice
Linear Pose Estimation from Points or Lines
IEEE Transactions on Pattern Analysis and Machine Intelligence
Multiple View Geometry in Computer Vision
Multiple View Geometry in Computer Vision
How Hard is 3-View Triangulation Really?
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
A Comparison and Evaluation of Multi-View Stereo Reconstruction Algorithms
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)
A Minimal Solution to the Generalised 3-Point Pose Problem
Journal of Mathematical Imaging and Vision
VideoTrace: rapid interactive scene modelling from video
ACM SIGGRAPH 2007 papers
A minimal solution for relative pose with unknown focal length
Image and Vision Computing
Automatic Generator of Minimal Problem Solvers
ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part III
A Column-Pivoting Based Strategy for Monomial Ordering in Numerical Gröbner Basis Calculations
ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part IV
| Hi-index | 0.00 |
In this paper we describe how we can do camera resectioning from a box with unknown dimensions, i.e. determine the camera model, assuming that image pixels are square. This assumption is equivalent to assuming that the camera has an aspect ratio of one and zero skew, and this holds for most -- if not all -- digital cameras. Our proposed method works by first deriving 9 linear constraints on the projective camera matrix from the box, leaving a 3-dimensional subspace in which the projective camera matrix can lie. A single solution in this 3D subspace is then found via a method by Triggs in 1999, which uses the square pixel assumption to set up a 4th degree polynomial to which the solution is the desired model. This approach is, however, numerically challenging, and we use several means to tackle this issue. Lastly the solution is refined in an iterative manner, i.e. using bundle adjustment.