Determining the lines through four lines
Journal of Graphics Tools
Multiple view geometry in computer visiond
Multiple view geometry in computer visiond
Introductory Techniques for 3-D Computer Vision
Introductory Techniques for 3-D Computer Vision
Computer Vision: A Modern Approach
Computer Vision: A Modern Approach
Catadioptric Camera Calibration Using Geometric Invariants
IEEE Transactions on Pattern Analysis and Machine Intelligence
The Raxel Imaging Model and Ray-Based Calibration
International Journal of Computer Vision
Towards Complete Generic Camera Calibration
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
Automatic scene structure and camera motion using a catadioptric system
Computer Vision and Image Understanding
A method for calibrating the parabolic camera using homographic matrix
ROBIO'09 Proceedings of the 2009 international conference on Robotics and biomimetics
Camera Models and Fundamental Concepts Used in Geometric Computer Vision
Foundations and Trends® in Computer Graphics and Vision
| Hi-index | 0.00 |
This paper describes a new method to calibrate the intrinsic and extrinsic parameters of a generalized catadioptric camera (central or noncentral). The algorithm has two steps. The first one is the estimation of correspondences between incident lines in space and pixels (black box model calibration) in an arbitrary world reference frame. The second step is the calibration of the intrinsic parameters of the pinhole camera, the coefficients of the mirror expressed by a quadric (quadric mirror shape and the pose of the camera in relation to it), the position of the optical center of the camera in the world reference frame and its relative orientation (pose of the camera in world reference frame). A projection model relaxing Snell's Law is derived. The deviations from Snell's Law and the image reprojection errors are minimized by means of bundle adjustment. Information about the apparent contour of the mirror can be used to reduce the uncertainty in the estimation by introducing a new term in the cost function of the second step minimization process. Simulations and real experiments show good accuracy and robustness for this framework. However, the convergence is dependent on the initial guess as expected. A well-behaved algorithm to automatically generate the initial estimate to be used in the bundle adjustment is also presented.