Consensus set maximization with guaranteed global optimality for robust geometry estimation

Proceedings of the IEEE International Conference on Computer Vision

Volumn , Issue , 2009, Pages 1074-1080

  Li, Hongdong ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

GLOBAL OPTIMALITY; MIXED-INTEGER PROGRAMMING; SPECIAL STRUCTURE;

COMPUTATIONAL EFFICIENCY; COMPUTER VISION; ESTIMATION; GLOBAL OPTIMIZATION; INTEGER PROGRAMMING;

BRANCH AND BOUND METHOD;

EID: 77953184592     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCV.2009.5459398     Document Type: Conference Paper

References (20)

1. V. Balakrishnan, S. Boyd, and S. Balemi. Branch and bound algorithm for computing the minimum stability degree of parameter-dependent linear system. International Journal of Robust and Nonlinear Control, 1(4):295-317, 1991.
2. T. M. Breuel. Implementation techniques for geometric branch-and-bound matching methods. CVIU, 90(3):258-294, 2003.
3. M. Chandraker and D. Kriegman. Globally optimal bilinear programming for computer vision applications. CVPR'08, 2008.
4. O. Chum and J. Matas. Optimal randomized ransac. IEEE Trans. Pattern Anal. Mach. Intell., 30(8):1472-1482, 2008.
5. M. A. Fischler and R. C. Bolles. Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Commun. ACM, 24(6):381-395, 1981.
6. A. Fitzgibbon, M. Pilu, and R. B. Fisher. Direct least square fitting of ellipses. IEEE PAMI., 21(5):476-480, 1999.
7. D. A. Forsyth and J. Ponce. Computer Vision: A Modern Approach. Prentice Hall, 2002.
8. R. Hartley and A. Zisserman. Multiple view geometry in computer vision 2nd ed. Cambridge University Press, 2004.
9. F. Kahl, S. Agarwal, M. K. Chandraker, D. Kriegman, and S. Belongie. Practical global optimization for multiview geometry. Int. J. Comput. Vision, 79(3):271-284, 2008.
10. H. Li. A simple solution to the six-point two-view focal-length problem. In 9th European Conference on Computer Vision (ECCV 2006), pages 200-213, 2006.
11. H. Li and R. Hartley. Five-point motion estimation made easy. In ICPR 2006, pages 630-633. IEEE Computer Society.
12. H. Li and R. Hartley. The 3d-3d registration problem revisited. In ICCV 2007, pages 1-8. IEEE, 2007.
13. G. McCormick. Computability of global solutions to factorable non-convex programs - part i - convex underestimating problems. Math. Prog., 10:147-175., 1976.
14. D. Nister. Preemptive ransac for live structure and motion estimation. Proc. ICCV, 1:199-206., 2003.
15. C. Olsson, O. Enqvist, and F. Kahl. A polynomial-time bound for matching and registration with outliers. Proc. CVPR'08, 2008.
16. C. Olsson, F. Kahl, and M. Oskarsson. Branch and bound methods for euclidean registration problems. IEEE PAMI, May 2008.
17. R. Raguram, J.-M. Frahm, and M. Pollefeys. A comparative analysis of ransac techniques leading to adaptive real-time random sample consensus. Proc. ECCV'08, pages 500-513, 2008.
18. H. Sherali and A. Alameddine. A new reformulation-linearization technique for bilinear programming problems,. Journal of Global Optimization, (2):379-410, 2002.
19. B. Tordoff and D. W. Murray. Guided sampling and consensus for motion estimation. ECCV '02: Proc. of the 7th European Conference on Computer Vision, pages 82-98, 2002.
20. P. Torr and A. Zisserman. Mlesac: A new robust estimator with application to estimating image geometry. CVIU, pages 138-156., 2000.