Fetching the paper…
Reading the bibliography…
Maximum consensus estimation plays a critically important role in robust fitting problems in computer vision.
M. Frank and P. Wolfe, “An algorithm for quadratic programming,” Naval Research Logistics Quaterly , vol. 3, no. 95, 1956
1956
Earlier work this paper cites.
P. J. Huber et al. , “Robust estimation of a location parameter,” The Annals of Mathematical Statistics , vol. 35, no. 1, pp. 73–101, 1964
1964
Earlier work this paper cites.
O. Mangasarian, “Characterization of linear complementarity problems as linear programs,” in Complementarity and Fixed Point Problems . Springer, 1978, pp. 74–87
1978
Earlier work this paper cites.
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 , vol. 24, no. 6, pp. 381–395, 1981
1981
Earlier work this paper cites.
Z. Zhang, “Determining the epipolar geometry and its uncertainty: A review,” International journal of computer vision , vol. 27, no. 2, pp. 161–195, 1998
1998
Earlier work this paper cites.
O. Chum, J. Matas, and J. Kittler, “Locally optimized ransac,” in DAGM . Springer, 2003
2003
Earlier work this paper cites.
R. Hartley and A. Zisserman, Multiple view geometry in computer vision . Cambridge university press, 2003
2003
Earlier work this paper cites.
F. Kahl, “Multiple view geometry and the l∞-norm,” in Tenth IEEE International Conference on Computer Vision (ICCV’05) Volume 1 , vol. 2. IEEE, 2005, pp. 1002–1009
2005
Earlier work this paper cites.
O. Chum and J. Matas, “Matching with prosac-progressive sample consensus,” in 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’05) , vol. 1. IEEE, 2005, pp. 220–226
2005
Earlier work this paper cites.
B. J. Tordoff and D. W. Murray, “Guided-mlesac: Faster image transform estimation by using matching priors,” IEEE transactions on pattern analysis and machine intelligence , vol. 27, no. 10, pp. 1523–1535, 2005
2005
Earlier work this paper cites.
J. Nocedal and S. Wright, Numerical optimization . Springer Science & Business Media, 2006
2006
Earlier work this paper cites.
K. Sim and R. Hartley, “Removing outliers using the linfty norm,” in 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’06) , vol. 1. IEEE, 2006, pp. 485–494
2006
Earlier work this paper cites.
N. Snavely, S. M. Seitz, and R. Szeliski, “Photo tourism: exploring photo collections in 3d,” in ACM transactions on graphics (TOG) , vol. 25, no. 3. ACM, 2006, pp. 835–846
2006
Cited alongside, same era.
Q. Ke and T. Kanade, “Quasiconvex optimization for robust geometric reconstruction,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 29, no. 10, pp. 1834–1847, 2007
2007
Cited alongside, same era.
R. Hartley and F. Kahl, “Optimal algorithms in multiview geometry,” in Asian conference on computer vision . Springer, 2007, pp. 13–34
2007
Cited alongside, same era.
C. Olsson, O. Enqvist, and F. Kahl, “A polynomial-time bound for matching and registration with outliers,” in Computer Vision and Pattern Recognition, 2008. CVPR 2008. IEEE Conference on . IEEE, 2008, pp. 1–8
2008
Cited alongside, same era.
K. Lebeda, J. Matas, and O. Chum, “Fixing the locally optimized ransac–full experimental evaluation,” in British Machine Vision Conference . Citeseer, 2012, pp. 1–11
2012
Later among the works it cites.
O. Enqvist, E. Ask, F. Kahl, and K. Åström, “Robust fitting for multiple view geometry,” in European Conference on Computer Vision . Springer, 2012, pp. 738–751
2012
Later among the works it cites.
A. Eriksson and M. Isaksson, “Pseudoconvex proximal splitting for l-infty problems in multiview geometry,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , 2014, pp. 4066–4073
2014
Later among the works it cites.
T.-J. Chin, P. Purkait, A. Eriksson, and D. Suter, “Efficient globally optimal consensus maximisation with tree search,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , 2015, pp. 2413–2421
2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Agarwal, N. Snavely, and S. M. Seitz, “Fast algorithms for l∞ problems in multiview geometry,” in Computer Vision and Pattern Recognition, 2008. CVPR 2008. IEEE Conference on . IEEE, 2008, pp. 1–8
2008
Cited alongside, same era.
S. Choi, T. Kim, and W. Yu, “Performance evaluation of RANSAC family,” in British Machine Vision Conference (BMVC) , 2009
2009
Cited alongside, same era.
H. Li, “Consensus set maximization with guaranteed global optimality for robust geometry estimation,” in 2009 IEEE 12th International Conference on Computer Vision . IEEE, 2009, pp. 1074–1080
2009
Cited alongside, same era.
C. Olsson, A. P. Eriksson, and R. Hartley, “Outlier removal using duality,” in IEEE Int. Conf. on Copmuter Vision and Pattern Recognition . IEEE Computer Society, 2010, pp. 1450–1457
2010
Cited alongside, same era.
A. Vedaldi and B. Fulkerson, “Vlfeat: An open and portable library of computer vision algorithms,” in Proceedings of the 18th ACM international conference on Multimedia . ACM, 2010, pp. 1469–1472
2010
Cited alongside, same era.
Y. Zheng, S. Sugimoto, and M. Okutomi, “Deterministically maximizing feasible subsystem for robust model fitting with unit norm constraint,” in Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on . IEEE, 2011, pp. 1825–1832
2011
Cited alongside, same era.
S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, “Distributed optimization and statistical learning via the alternating direction method of multipliers,” Foundations and Trends® in Machine Learning , vol. 3, no. 1, pp. 1–122, 2011
2011
Cited alongside, same era.
H. S. Wong, T.-J. Chin, J. Yu, and D. Suter, “Dynamic and hierarchical multi-structure geometric model fitting,” in Computer Vision (ICCV), 2011 IEEE International Conference on . IEEE, 2011, pp. 1044–1051
2011
Cited alongside, same era.
K. Aftab and R. Hartley, “Convergence of iteratively re-weighted least squares to robust m-estimators,” in 2015 IEEE Winter Conference on Applications of Computer Vision . IEEE, 2015, pp. 480–487
2015
Later among the works it cites.
2015
Later among the works it cites.
A. Eriksson, M. Isaksson, and T.-J. Chin, “High breakdown bundle adjustment,” in Applications of Computer Vision (WACV), 2015 IEEE Winter Conference on . IEEE, 2015, pp. 310–317
2015
Later among the works it cites.
M. Hong, Z.-Q. Luo, and M. Razaviyayn, “Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems,” SIAM Journal on Optimization , vol. 26, no. 1, pp. 337–364, 2016
2016
Later among the works it cites.
A. Eriksson, J. Bastian, T.-J. Chin, and M. Isaksson, “A consensus-based framework for distributed bundle adjustment,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , 2016, pp. 1754–1762
2016
Later among the works it cites.
H. Le, T.-J. Chin, and D. Suter, “An exact penalty method for locally convergent maximum consensus,” in Computer Vision and Pattern Recognition (CVPR), 2017 IEEE Conference on . IEEE, 2017
2017
Closest in time.
R. Raguram, J.-M. Frahm, and M. Pollefeys, “Exploiting uncertainty in random sample consensus,” in Computer Vision, 2009 IEEE 12th International Conference on . IEEE, 2009, pp. 2074–2081
2081
Closest in time.