LMI-Based 2D-3D Registration: From Uncalibrated Images to Euclidean Scene

Danda Pani Paudel, Adlane Habed, Cedric Demonceaux, Pascal Vasseur; The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2015, pp. 4494-4502

Abstract


This paper investigates the problem of registering a scanned scene, represented by 3D Euclidean point coordinates, and two or more uncalibrated cameras. An unknown subset of the scanned points have their image projections detected and matched across images. The proposed approach assumes the cameras only known in some arbitrary projective frame and no calibration or autocalibration is required. The devised solution is based on a Linear Matrix Inequality (LMI) framework that allows simultaneously estimating the projective transformation relating the cameras to the scene and establishing 2D-3D correspondences without triangulating image points. The proposed LMI framework allows both deriving triangulation-free LMI cheirality conditions and establishing putative correspondences between 3D volumes (boxes) and 2D pixel coordinates. Two registration algorithms, one exploiting the scene's structure and the other concerned with robustness, are presented. Both algorithms employ the Branch-and-Prune paradigm and guarantee convergence to a global solution under mild initial bound conditions. The results of our experiments are presented and compared against other approaches.

Related Material


[pdf]
[bibtex]
@InProceedings{Paudel_2015_CVPR,
author = {Pani Paudel, Danda and Habed, Adlane and Demonceaux, Cedric and Vasseur, Pascal},
title = {LMI-Based 2D-3D Registration: From Uncalibrated Images to Euclidean Scene},
booktitle = {The IEEE Conference on Computer Vision and Pattern Recognition (CVPR)},
month = {June},
year = {2015}
}