Computer Vision and Image Understanding
Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Constrained Structure and Motion From Multiple Uncalibrated Views of a Piecewise Planar Scene
International Journal of Computer Vision
Multi-camera Scene Reconstruction via Graph Cuts
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
Multiple View Geometry in Computer Vision
Multiple View Geometry in Computer Vision
Convex Optimization
Distinctive Image Features from Scale-Invariant Keypoints
International Journal of Computer Vision
Removing Outliers Using The L\infty Norm
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1
Quasiconvex Optimization for Robust Geometric Reconstruction
IEEE Transactions on Pattern Analysis and Machine Intelligence
Multiple-View Geometry Under the {$L_\infty$}-Norm
IEEE Transactions on Pattern Analysis and Machine Intelligence
Global Stereo Reconstruction under Second-Order Smoothness Priors
IEEE Transactions on Pattern Analysis and Machine Intelligence
Generalized Convexity in Multiple View Geometry
Journal of Mathematical Imaging and Vision
Optimal two-view planar scene triangulation
ACCV'10 Proceedings of the 10th Asian conference on Computer vision - Volume Part II
| Hi-index | 0.00 |
In this theoretical paper we consider the problem of accurately triangulating a scene plane. Rather than first triangulating a set of points and then fitting a plane to these points, we try to minimize the back-projection errors as functions of the plane parameters directly. As this is both geometrically and statistically meaningful our method performs better than the standard two step procedure. Furthermore, we show that the error residuals of this formulation are quasiconvex thereby making it very easy to solve using for example standard local optimization methods.