关键词: 计算机视觉, 三维重建, 无穷范数最小, 外点, 二次锥面规划

Abstract: Various geometric vision problems can be solved optimally by minimizing L_∞-norm error.However，the approach based on L_∞-norm error is often sensitive to outliers.Although some improved algorithms can overcome the impact of outliers，it is too time-consuming.This paper proposes a new fast and precise method based on refining L_∞-norm minimization framework for the triangulation problem from images sequence.Experimental results have shown that the proposed method can achieve global optimization and is faster than traditional methods.

Key words: computer vision, triangulation, L_∞-minimization, outliers, Second-Order Cone Programming（SOCP）