Abstract
Robust parameter estimation in computer vision is frequently accomplished by solving the maximum consensus (MaxCon) problem. Widely used randomized methods for MaxCon, however, can only produce random approximate solutions, while global methods are too slow to exercise on realistic problem sizes. Here we analyse MaxCon as iterative reweighted algorithms on the data residuals. We propose a smooth surrogate function, the minimization of which leads to an extremely simple iteratively reweighted algorithm for MaxCon. We show that our algorithm is very efficient and in many cases, yields the global solution. This makes it an attractive alternative for randomized methods and global optimizers. The convergence analysis of our method and its fundamental differences from the other iteratively reweighted methods are also presented.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
Since \(\mathbf {s}^{(l)}\) is only used to compute the weights \(\mathbf {w}^{(l+1)}\) in the next iteration, an approximate solution, which still minimizes the objective, is sufficient to initialize \(\mathbf {s}^{(l+1)}\).
- 2.
- 3.
- 4.
- 5.
- 6.
References
Meer, P.: Robust techniques for computer vision. In: Medioni, G., Kang, S.B. (eds.) Emerging Topics in Computer Vision, pp. 107–190. Prentice Hall (2004)
Huber, P.J.: Robust Statistics. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-04898-2
Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2, 183–202 (2009)
Olsson, C., Kahl, F.: Generalized convexity in multiple view geometry. J. Math. Imaging Vis. 38, 35–51 (2010)
Fischler, M.A., Bolles, R.C.: Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Commun. ACM 24, 381–395 (1981)
Choi, S., Kim, T., Yu, W.: Performance evaluation of RANSAC family. JCV 24, 271–300 (1997)
Torr, P.H., Zisserman, A.: MLESAC: a new robust estimator with application to estimating image geometry. CVIU 78, 138–156 (2000)
Raguram, R., Frahm, J.-M., Pollefeys, M.: A comparative analysis of RANSAC techniques leading to adaptive real-time random sample consensus. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008. LNCS, vol. 5303, pp. 500–513. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-88688-4_37
Raguram, R., Chum, O., Pollefeys, M., Matas, J., Frahm, J.M.: USAC: a universal framework for random sample consensus. IEEE TPAMI 35, 2022–2038 (2013)
Olsson, C., Enqvist, O., Kahl, F.: A polynomial-time bound for matching and registration with outliers. In: CVPR (2008)
Enqvist, O., Ask, E., Kahl, F., Åström, K.: Robust fitting for multiple view geometry. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012. LNCS, vol. 7572, pp. 738–751. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33718-5_53
Chin, T.J., Purkait, P., Eriksson, A., Suter, D.: Efficient globally optimal consensus maximisation with tree search. In: CVPR, pp. 2413–2421 (2015)
Li, H.: Consensus set maximization with guaranteed global optimality for robust geometry estimation. In: ICCV, pp. 1074–1080. IEEE (2009)
Zheng, Y., Sugimoto, S., Okutomi, M.: Deterministically maximizing feasible subsystems for robust model fitting with unit norm constraints. In: CVPR (2011)
Chum, O., Matas, J., Kittler, J.: Locally optimized RANSAC. In: Michaelis, B., Krell, G. (eds.) DAGM 2003. LNCS, vol. 2781, pp. 236–243. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-45243-0_31
Lebeda, K., Matas, J., Chum, O.: Fixing the locally optimized RANSAC-full experimental evaluation. In: BMVC12. Citeseer (2012)
Tordoff, B.J., Murray, D.W.: Guided-MLESAC: faster image transform estimation by using matching priors. IEEE TPAMI 27, 1523–1535 (2005)
Olsson, C., Eriksson, A., Hartley, R.: Outlier removal using duality. In: CVPR (2010)
Vanderbei, R.J.: LOQO User’s Manual-version 4.05. Princeton University, Princeton (2006)
Wächter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Prog. 106, 25–57 (2006)
Chartrand, R., Yin, W.: Iteratively reweighted algorithms for compressive sensing. In: ICASSP, pp. 3869–3872. IEEE (2008)
Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)
Kahl, F., Hartley, R.I.: Multiple-view geometry under the \(l_\infty \)-norm. IEEE TPAMI 30, 1603–1617 (2008)
Candes, E.J., Wakin, M.B., Boyd, S.P.: Enhancing sparsity by reweighted \(\mathbf{l}_1\) minimization. J. Fourier Anal. Appl. 14, 877–905 (2008)
Gorodnitsky, I.F., Rao, B.D.: Sparse signal reconstruction from limited data using focuss: a re-weighted minimum norm algorithm. TSP 45, 600–616 (1997)
Chartrand, R.: Exact reconstruction of sparse signals via nonconvex minimization. IEEE SPL 14, 707–710 (2007)
Sriperumbudur, B.K., Lanckriet, G.R.: A proof of convergence of the concave-convex procedure using Zangwill’s theory. Neural Comput. 24, 1391–1407 (2012)
Tu, L.W.: An Introduction to Manifolds. Springer, New York (2010). https://doi.org/10.1007/978-1-4419-7400-6
Megiddo, N.: Linear programming in linear time when the dimension is fixed. JACM 31, 114–127 (1984)
Ye, Y., Tse, E.: An extension of Karmarkar’s projective algorithm for convex quadratic programming. Math. Prog. 44, 157–179 (1989)
Sim, K., Hartley, R.: Removing outliers using the \(l_\infty \) norm. In: CVPR (2006)
Wipf, D., Nagarajan, S.: Iterative reweighted and methods for finding sparse solutions. JSTSP 4, 317–329 (2010)
Candes, E.J., Tao, T.: Decoding by linear programming. IEEE TIT 51, 4203–4215 (2005)
Grant, M., Boyd, S.: CVX: matlab software for disciplined convex programming (2008)
Hartley, R., Zisserman, A.: Multiple View Geometry in Computer Vision. Cambridge University Press, Cambridge (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Purkait, P., Zach, C., Eriksson, A. (2018). Maximum Consensus Parameter Estimation by Reweighted \(\ell _1\) Methods. In: Pelillo, M., Hancock, E. (eds) Energy Minimization Methods in Computer Vision and Pattern Recognition. EMMCVPR 2017. Lecture Notes in Computer Science(), vol 10746. Springer, Cham. https://doi.org/10.1007/978-3-319-78199-0_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-78199-0_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-78198-3
Online ISBN: 978-3-319-78199-0
eBook Packages: Computer ScienceComputer Science (R0)