TY - GEN
T1 - Recovering camera motion using L ∞ minimization
AU - Sim, Kristy
AU - Hartley, Richard
PY - 2006
Y1 - 2006
N2 - Recently, there has been interest in formulating various geometric problems in Computer Vision as L ∞ optimization problems. The advantage of this approach is that under L ∞ norm, such problems typically have a single minimum, and may he efficiently solved using Second-Order Cone Programming (SOCP). This paper shows that such techniques may be used effectively on the problem of determining the track of a camera given observations of features in the environment. The approach to this problem involves two steps: determination of the orientation of the camera by estimation of relative orientation between pairs of views, followed by determination of the translation of the camera. This paper focusses on the second step, that of determining the motion of the camera. It is shown that it may he solved effectively by using SOCP to reconcile translation estimates obtained for pairs or triples of views. In addition, it is observed that the individual translation estimates are not known with equal certainty in all directions. To account for this anisotropy in uncertainty, we introduce the use of covariances into the L ∞ optimization framework.
AB - Recently, there has been interest in formulating various geometric problems in Computer Vision as L ∞ optimization problems. The advantage of this approach is that under L ∞ norm, such problems typically have a single minimum, and may he efficiently solved using Second-Order Cone Programming (SOCP). This paper shows that such techniques may be used effectively on the problem of determining the track of a camera given observations of features in the environment. The approach to this problem involves two steps: determination of the orientation of the camera by estimation of relative orientation between pairs of views, followed by determination of the translation of the camera. This paper focusses on the second step, that of determining the motion of the camera. It is shown that it may he solved effectively by using SOCP to reconcile translation estimates obtained for pairs or triples of views. In addition, it is observed that the individual translation estimates are not known with equal certainty in all directions. To account for this anisotropy in uncertainty, we introduce the use of covariances into the L ∞ optimization framework.
UR - http://www.scopus.com/inward/record.url?scp=33845421939&partnerID=8YFLogxK
U2 - 10.1109/CVPR.2006.247
DO - 10.1109/CVPR.2006.247
M3 - Conference contribution
SN - 0769525970
SN - 9780769525976
T3 - Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
SP - 1230
EP - 1237
BT - Proceedings - 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2006
T2 - 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2006
Y2 - 17 June 2006 through 22 June 2006
ER -