Partial Symmetry in Polynomial Systems and its Applications in Computer Vision

Yubin Kuang, Yinqiang Zheng, Kalle Astrom; The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2014, pp. 438-445

Abstract


Algorithms for solving systems of polynomial equations are key components for solving geometry problems in computer vision. Fast and stable polynomial solvers are essential for numerous applications e.g. minimal problems or finding for all stationary points of certain algebraic errors. Recently, full symmetry in the polynomial systems has been utilized to simplify and speed up state-of-the-art polynomial solvers based on Grobner basis method. In this paper, we further explore partial symmetry (i.e. where the symmetry lies in a subset of the variables) in the polynomial systems. We develop novel numerical schemes to utilize such partial symmetry. We then demonstrate the advantage of our schemes in several computer vision problems. In both synthetic and real experiments, we show that utilizing partial symmetry allow us to obtain faster and more accurate polynomial solvers than the general solvers.

Related Material


[pdf]
[bibtex]
@InProceedings{Kuang_2014_CVPR,
author = {Kuang, Yubin and Zheng, Yinqiang and Astrom, Kalle},
title = {Partial Symmetry in Polynomial Systems and its Applications in Computer Vision},
booktitle = {The IEEE Conference on Computer Vision and Pattern Recognition (CVPR)},
month = {June},
year = {2014}
}