Uncertainty Models in Quasiconvex Optimization for Geometric Reconstruction

June 2006

Uncertainty Models in Quasiconvex Optimization for Geometric Reconstruction

Authors:

Qifa Ke and Takeo Kanade
Conference Paper
Proceedings of (CVPR) Computer Vision and Pattern Recognition

Abstract:

Geometric reconstruction problems in computer vision can be solved by minimizing the maximum of reprojection errors, i.e., the Linfty-norm. Unlike L2-norm (sum of squared reprojection errors), the global minimum of Linfty-norm can be efficiently achieved by quasiconvex optimization. However, the maximum of reprojection errors is the meaningful measure to minimize only when the measurement noises are independent and identically distributed at every 2D feature point and in both directions in the image. This is rarely the case in real data, where the positional noise not only varies at different features, but also has strong directionality. In this paper, we incorporate the directional uncertainty model into a quasiconvex optimization framework, in which global minimum of meaningful errors can be efficiently achieved, and accurate geometric reconstructions can be obtained from feature points that contain high directional uncertainty.
@conference{Ke-2006-9511,
author = {Qifa Ke And Takeo Kanade},
title = {Uncertainty Models in Quasiconvex Optimization for Geometric Reconstruction},
booktitle = {Proceedings of (CVPR) Computer Vision and Pattern Recognition},
year = {2006},
month = {June},
pages = {1199 - 1205},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.