Exploiting p-fold symmetries for faster polynomial equation solving

Proceedings - International Conference on Pattern Recognition

Volumn , Issue , 2012, Pages 3232-3235

  Ask, Erik ^a   Kuang, Yubin ^a   Astrom, Kalle ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COEFFICIENT MATRIX; GEOMETRIC PROBLEMS; MINIMAL INFORMATION; NUMERICAL LINEAR ALGEBRA; POLYNOMIAL EQUATION; POLYNOMIAL EQUATION SOLVING; SPEED INCREASE; STATIONARY POINTS; ZERO VECTORS;

LINEAR ALGEBRA; PATTERN RECOGNITION;

POLYNOMIALS;

EID: 84874559594     PISSN: 10514651     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. S. Agarwal, M. K. Chandraker, F. Kahl, D. J. Kriegman, and S. Belongie. Practical global optimization for multiview geometry. In Proc. 9th European Conf. on Computer Vision, Graz, Austria, pages 592-605, 2006.
2. M. Byröd, M. Brown, and K. Åström. Minimal solutions for panoramic stitching with radial distortion. In bmvc09, 2009.
3. M. Byröd, K. Josephson, and K. Åström. Fast and stable polynomial equation solving and its application to computer vision. Int. Journal of Computer Vision, 84(3):237-255, 2009.
4. M. Chasles. Question 296. Nouv. Ann. Math., 14(50), 1855.
5. D. Cox, J. Little, and D. O'Shea. Ideals, Varieties, and Algorithms. Springer, 2007.
6. O. Enqvist, E. Ask, F. Kahl, and K. Åström. Robust fitting for multiple view geometry. In European Conference on Computer Vision, 2012.
7. O. Enqvist, K. Josephson, and F. Kahl. Optimal correspondences from pairwise constraints. In Proc. 12th Int. Conf. on Computer Vision, Kyoto, Japan, 2009.
8. M. A. Fischler and R. C. Bolles. Random sample consensus: A paradigm for model fitting with applications to image analysis and automated cartography. Communications of the ACM, 24(6):381-95, 1981.
9. R. Hartley and F. Schaffalitzky. L1 minimization in geometric reconstruction problems. In Proc. Conf. Computer Vision and Pattern Recognition, Washington DC, pages 504-509, Washington DC, USA, 2004.
10. R. Hartley and P. Sturm. Triangulation. Computer Vision and Image Understanding, 68:146-157, 1997.
11. F. Kahl. Multiple view geometry and the L1-norm. In International Conference on Computer Vision, pages 1002-1009, Beijing, China, 2005.
12. C. Olsson, O. Enqvist, and F. Kahl. A polynomial-time bound for matching and registration with outliers. In Proc. Conf. on Computer Vision and Pattern Recognition, 2008.
13. H. Stewénius. Gröbner Basis Methods for Minimal Problems in Computer Vision. PhD thesis, Lund University, Apr. 2005.
14. H. Stewénius, F. Kahl, D. Nistér, and F. Schaffalitzky. A minimal solution for relative pose with unknown focal length. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR), volume 2, pages 789-794, San-Diego, USA, June 2005. Chapter 8 of my thesis.
15. H. Stewénius, F. Schaffalitzky, and D. Nistér. How hard is three-view triangulation really? In Proc. Int. Conf. on Computer Vision, pages 686-693, Beijing, China, 2005.
16. P. Torr and A. Zisserman. Robust parameterization and computation of the trifocal tensor. Image and Vision Computing, 15(8):591-605, 1997.
17. P. Torr and A. Zisserman. Robust computation and parametrization of multiple view relations. In Proc. 6th Int. Conf. on Computer Vision, Mumbai, India, pages 727-732, 1998.