Outlier removal using duality

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Volumn , Issue , 2010, Pages 1450-1457

  Olsson, Carl ^a   Eriksson, Anders ^b   Hartley, Richard ^c  

^a LUND UNIVERSITY   (Sweden)

^b UNIVERSITY OF ADELAIDE   (Australia)

^c AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

HARTLEY; MULTI-VIEW RECONSTRUCTION; NUMBER OF DATUM; POST PROCESSING; QUASICONVEX; THEORETICAL RESULT;

COMPUTER VISION;

COMPUTATIONAL METHODS;

EID: 77956001554     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2010.5539800     Document Type: Conference Paper

References (19)

1. ∞ problems in multiview geometry. In Conf. Computer Vision and Pattern Recognition, Anchorage, USA, 2008.
2. K. Åström, O. Enqvist, C. Olsson, and F. Kahl. An l-infinity approach to structure and motion problems in 1d-vision. In Int. Conf. Computer Vision, Rio de Janeiro, Brazil, 2007.
3. M. Bazaraa, H. Sherali, and C. Shetty. Nonlinear Programming, Theory and Algorithms. Wiley, 1993.
4. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
5. E. J. Candes and T. Tao. Decoding by linear programming. Information Theory, IEEE Transactions on, 51(12):4203-4215, 2005.
6. A. Dalalyan and R. Keriven. L1-penalized robust estimation for a class of inverse problems arising in multiview geometry. In Annual Conference on Neural Information Processing Systems, Vancouver, Canada, 2009.
7. D. L. Donoho. For most large underdetermined systems of equations, the minimal l1-norm near-solution approximates the sparsest near-solution. Communications on pure and applied mathematics, 59(7):907-934, 2006.
8. M. Gugat. A fast algorithm for a class of generalized fractional programs. Managment Sci., 42:1493-1499, 1996. (Pubitemid 126592444)
9. R. Hartley. In defence of the 8-point algorithm. In Int. Conf. Computer Vision, pages 1064-1070, Boston, USA, 1995.
10. ∞-norm. IEEE Trans. Pattern Analysis and Machine Intelligence, 30(9):1603-1617, 2008.
11. Q. Ke and T. Kanade. Quasiconvex optimization for robust geometric reconstruction. IEEE Trans. Pattern Analysis and Machine Intelligence, 29(10):1834-1847, 2007.
12. D. Lowe. Distinctive image features from scale-invariant keypoints. Int. Journal Computer Vision, 2004.
13. D. Martinec and T. Pajdla. Robust rotation and translation estimation in multiview reconstruction. In Conf. Computer Vision and Pattern Recognition, Minneapolis, USA, 2007.
14. C. Olsson, O. Enqvist, and F. Kahl. A polynomial-time bound for matching and registration with ouliers. In Conf. Computer Vision and Pattern Recognition, Anchorage, USA, 2008.
15. Y. Seo, H. Lee, and S. W. Lee. Outlier removal by convex optimization for l-infinity approaches. In PSIVT '09: Pacific Rim Symposium on Advances in Image and Video Technology, 2009.
16. ∞- norm. In Conf. Computer Vision and Pattern Recognition, pages 485-492, New York City, USA, 2006.
17. H. Stewénius, C. Engels, and D. Nistér. Recent developments on direct relative orientation. ISPRS Journal of Photogrammetry and Remote Sensing, 60:284-294, 2006. (Pubitemid 43815728)
18. J. F. Sturm. Using SeDuMi 1.02, a Matlab toolbox for optimization over symmetric cones. Optimization Methods and Software, 11-12:625-653, 1999.
19. J. Tropp. Just relax: convex programming methods for identifying sparse signals in noise. Information Theory, IEEE Transactions on, 52(3):1030-1051, March 2006.