Fetching the paper…
Reading the bibliography…
Outlier-robust estimation is a fundamental problem and has been extensively investigated by statisticians and practitioners.
1905
Earlier work this paper cites.
1909
Earlier work this paper cites.
1911
Earlier work this paper cites.
T. Fan, H. Wang, M. Rubenstein, and T. Murphey, “Efficient and guaranteed planar pose graph optimization using the complex number representation,” in IEEE/RSJ Intl. Conf. on Intelligent Robots and Systems (IROS) , 2019, pp. 1904–1911
1911
Earlier work this paper cites.
G. Wahba, “A least squares estimate of satellite attitude,” SIAM review , vol. 7, no. 3, pp. 409–409, 1965
1965
Earlier work this paper cites.
J. W. Tukey, “Mathematics and the picturing of data,” Proceedings of the International Congress of Mathematicians , vol. 2, pp. 523–531, 1975. [Online]. Available: https://cir.nii.ac.jp/crid/1573950399770196096
1975
Earlier work this paper cites.
P. Huber, Robust Statistics . John Wiley & Sons, New York, NY, 1981
1981
Earlier work this paper cites.
P. J. Rousseeuw and A. M. Leroy, Robust Regression and Outlier Detection . John Wiley & Sons, New York, NY, 1981
1981
Earlier work this paper cites.
M. Fischler and R. Bolles, “Random sample consensus: a paradigm for model fitting with application to image analysis and automated cartography,” Commun. ACM , vol. 24, pp. 381–395, 1981
1981
Earlier work this paper cites.
B. K. P. Horn, “Closed-form solution of absolute orientation using unit quaternions,” J. Opt. Soc. Amer. , vol. 4, no. 4, pp. 629–642, Apr 1987
1987
Earlier work this paper cites.
——, Robust Regression and Outlier Detection . John Wiley & Sons, New York, NY, 1987
1987
Earlier work this paper cites.
Y. Bar-Shalom and X. Li, Estimation and Tracking: principles, techniques and software . Boston, London: Artech House, 1993
1993
Earlier work this paper cites.
T. F. Cootes, C. J. Taylor, D. H. Cooper, and J. Graham, “Active shape models - their training and application,” Comput. Vis. Image Underst. , vol. 61, no. 1, pp. 38–59, January 1995
1995
Earlier work this paper cites.
M. J. Black and A. Rangarajan, “On the unification of line processes, outlier rejection, and robust statistics with applications in early vision,” Intl. J. of Computer Vision , vol. 19, no. 1, pp. 57–91, 1996
1996
Earlier work this paper cites.
N. Shor, “Nondifferentiable optimization and polynomial problems,” Nonconvex Optimization and its Applications , vol. 24, 1998
1998
Earlier work this paper cites.
B. Triggs, P. F. McLauchlan, R. I. Hartley, and A. W. Fitzgibbon, “Bundle adjustment—a modern synthesis,” in International workshop on vision algorithms . Springer, 1999, pp. 298–372
1999
Earlier work this paper cites.
F. Dellaert, D. Fox, W. Burgard, and S. Thrun, “Monte Carlo Localization for mobile robots,” in IEEE Intl. Conf. on Robotics and Automation (ICRA) , 1999
1999
Earlier work this paper cites.
P. Parrilo, “Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization,” Ph.D. dissertation, California Institute of Technology, 2000
2000
Earlier work this paper cites.
Y. Nesterov, “Squared functional systems and optimization problems, high performance optimization,” Appl. Optim. , vol. 33, pp. 405–440, 2000
2000
Earlier work this paper cites.
2001
Earlier work this paper cites.
J. B. Lasserre, “Global optimization with polynomials and the problem of moments,” SIAM J. Optim. , vol. 11, no. 3, pp. 796–817, 2001
2001
Earlier work this paper cites.
P. A. Parrilo, “Semidefinite programming relaxations for semialgebraic problems,” Mathematical programming , vol. 96, no. 2, pp. 293–320, 2003
2003
Earlier work this paper cites.
R. H. Tütüncü, K.-C. Toh, and M. J. Todd, “Solving semidefinite-quadratic-linear programs using SDPT3,” Mathematical programming , vol. 95, no. 2, pp. 189–217, 2003
2003
Earlier work this paper cites.
2004
Earlier work this paper cites.
T. Bernholt, “Robust estimators are hard to compute,” Dortmund, Technical Report 2005,52, 2006. [Online]. Available: http://hdl.handle.net/10419/22645
2006
Earlier work this paper cites.
H. Bay, T. Tuytelaars, and L. V. Gool, “SURF: speeded up robust features,” in European Conf. on Computer Vision (ECCV) , 2006
2006
Earlier work this paper cites.
F. Kahl and D. Henrion, “Globally optimal estimates for geometric reconstruction problems,” Intl. J. of Computer Vision , vol. 74, no. 1, pp. 3–15, 2007
2007
Earlier work this paper cites.
2007
Earlier work this paper cites.
H. Li and R. Hartley, “The 3D-3D registration problem revisited,” in Intl. Conf. on Computer Vision (ICCV) . IEEE, 2007, pp. 1–8
2007
Earlier work this paper cites.
O. Enqvist and F. Kahl, “Robust optimal pose estimation,” in European Conf. on Computer Vision (ECCV) . Springer, 2008, pp. 141–153
2008
Earlier work this paper cites.
C. Olsson, O. Enqvist, and F. Kahl, “A polynomial-time bound for matching and registration with outliers,” in IEEE Conf. on Computer Vision and Pattern Recognition (CVPR) . IEEE, 2008, pp. 1–8
2008
Earlier work this paper cites.
M.-F. Balcan, A. Blum, and S. Vempala, “A discriminative framework for clustering via similarity functions,” in Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing , ser. STOC ’08, 2008, pp. 671–680
2008
Earlier work this paper cites.
G. Schweighofer and A. Pinz, “Globally optimal O(n) solution to the PnP problem for general camera models.” in British Machine Vision Conf. (BMVC) , 2008, pp. 1–10
2008
Earlier work this paper cites.
H. Li, “Consensus set maximization with guaranteed global optimality for robust geometry estimation,” in Intl. Conf. on Computer Vision (ICCV) , 2009, pp. 1074–1080
2009
Earlier work this paper cites.
A. R. Klivans, P. M. Long, and R. A. Servedio, “Learning halfspaces with malicious noise,” in Automata, Languages and Programming , S. Albers, A. Marchetti-Spaccamela, Y. Matias, S. Nikoletseas, and W. Thomas, Eds., 2009, pp. 609–621
2009
Earlier work this paper cites.
J. Wright and Y. Ma, “Dense error correction via ℓ 1 \mathchar 352^{\mathchar 28721} -minimization,” IEEE Trans. on Information Theory , vol. 56, no. 7, pp. 3540–3560, 2010
2010
Earlier work this paper cites.
J.-B. Lasserre, Moments, positive polynomials and their applications . World Scientific, 2010, vol. 1
2010
Earlier work this paper cites.
D. Scaramuzza and F. Fraundorfer, “Visual odometry: Part I the first 30 years and fundamentals,” 2011
2011
Earlier work this paper cites.
N. Sunderhauf and P. Protzel, “Towards a robust back-end for pose graph SLAM,” in IEEE Intl. Conf. on Robotics and Automation (ICRA) , 2012, pp. 1254–1261
2012
Earlier work this paper cites.
J. C. Bazin, Y. Seo, and M. Pollefeys, “Globally optimal consensus set maximization through rotation search,” in Asian Conference on Computer Vision . Springer, 2012, pp. 539–551
2012
Earlier work this paper cites.
——, “Robust fitting for multiple view geometry,” in European Conf. on Computer Vision (ECCV) . Springer, 2012, pp. 738–751
2012
Earlier work this paper cites.
G. Blekherman, P. A. Parrilo, and R. R. Thomas, Semidefinite optimization and convex algebraic geometry . SIAM, 2012
2012
Earlier work this paper cites.
B. Barak, F. Brandao, A. Harrow, J. Kelner, D. Steurer, and Y. Zhou, “Hypercontractivity, sum-of-squares proofs, and their applications,” in Proc. of the Annual ACM Symp. on Theory of Computing , 2012, pp. 307–326
2012
Earlier work this paper cites.
R. Hartley, J. Trumpf, Y. Dai, and H. Li, “Rotation averaging,” IJCV , vol. 103, no. 3, pp. 267–305, 2013
2013
Earlier work this paper cites.
P. Agarwal, G. D. Tipaldi, L. Spinello, C. Stachniss, and W. Burgard, “Robust map optimization using dynamic covariance scaling,” in IEEE Intl. Conf. on Robotics and Automation (ICRA) , 2013
2013
Earlier work this paper cites.
Y. Chen, C. Caramanis, and S. Mannor, “Robust sparse regression under adversarial corruption,” in Intl. Conf. on Machine Learning (ICML) , vol. 28, no. 3, 2013, pp. 774–782
2013
Cited alongside, same era.
N. Nguyen and T. Tran, “Exact recoverability from dense corrupted observations via ℓ 1 \mathchar 352_{\mathchar 28721} -minimization,” IEEE Trans. on Information Theory , vol. 59, no. 4, pp. 2017–2035, 2013
2013
Cited alongside, same era.
2013
Cited alongside, same era.
J. Yang, H. Li, and Y. Jia, “Optimal essential matrix estimation via inlier-set maximization,” in European Conf. on Computer Vision (ECCV) . Springer, 2014, pp. 111–126
2014
Cited alongside, same era.
2018
Later among the works it cites.
A. Eriksson, C. Olsson, F. Kahl, and T.-J. Chin, “Rotation averaging and strong duality,” IEEE Conf. on Computer Vision and Pattern Recognition (CVPR) , 2018
2018
Later among the works it cites.
Á. Parra Bustos and T. J. Chin, “Guaranteed outlier removal for point cloud registration with correspondences,” IEEE Trans. Pattern Anal. Machine Intell. , vol. 40, no. 12, pp. 2868–2882, 2018
2018
Later among the works it cites.
P. K. Kothari, J. Steinhardt, and D. Steurer, “Robust moment estimation and improved clustering via sum of squares,” in Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing , ser. STOC 2018, 2018, pp. 1035–1046
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
E. Tsakonas, J. Jaldén, N. Sidiropoulos, and B. Ottersten, “Convergence of the huber regression M-estimate in the presence of dense outliers,” IEEE Signal Processing Letters , vol. 21, no. 10, pp. 1211–1214, 2014
2014
Cited alongside, same era.
L. Kneip, H. Li, and Y. Seo, “UPnP: An optimal o(n) solution to the absolute pose problem with universal applicability,” in European Conf. on Computer Vision (ECCV) . Springer, 2014, pp. 127–142
2014
Cited alongside, same era.
J. Nie, “Optimality conditions and finite convergence of lasserre’s hierarchy,” Mathematical programming , vol. 146, no. 1-2, pp. 97–121, 2014
2014
Cited alongside, same era.
I. Goodfellow, J. Shlens, and C. Szegedy, “Explaining and harnessing adversarial examples,” arXiv e-print: 1412.6572 , 2014
2014
Cited alongside, same era.
B. Barak, J. A. Kelner, and D. Steurer, “Rounding sum-of-squares relaxations,” in Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing , ser. STOC ’14, 2014, pp. 31–40
2014
Cited alongside, same era.
X. Zhou, S. Leonardos, X. Hu, and K. Daniilidis, “3D shape reconstruction from 2D landmarks: A convex formulation,” in IEEE Conf. on Computer Vision and Pattern Recognition (CVPR) , 2015
2015
Cited alongside, same era.
L. Carlone and F. Dellaert, “Duality-based verification techniques for 2D SLAM,” in IEEE Intl. Conf. on Robotics and Automation (ICRA) , 2015, pp. 4589–4596, \href
2015
Cited alongside, same era.
K. M. Tavish and T. D. Barfoot, “At all costs: A comparison of robust cost functions for camera correspondence outliers,” in Conf. Computer and Robot Vision . IEEE, 2015, pp. 62–69
2015
Cited alongside, same era.
I. Diakonikolas, G. Kamath, D. M. Kane, J. Li, A. Moitra, and A. Stewart, “Robustly learning a gaussian: Getting optimal error, efficiently,” in Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms , ser. SODA ’18, 2018, p. 2683–2702
2018
Later among the works it cites.
I. Diakonikolas, D. M. Kane, and A. Stewart, “Learning geometric concepts with nasty noise,” in Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing , ser. STOC 2018, 2018, pp. 1061–1073
2018
Later among the works it cites.
2018
Later among the works it cites.
I. Diakonikolas, D. M. Kane, and A. Stewart, “List-decodable robust mean estimation and learning mixtures of spherical gaussians,” in Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing , ser. STOC 2018, 2018, pp. 1047–1060
2018
Later among the works it cites.
J. Briales, L. Kneip, and J. Gonzalez-Jimenez, “A certifiably globally optimal solution to the non-minimal relative pose problem,” in IEEE Conf. on Computer Vision and Pattern Recognition (CVPR) , 2018
2018
Later among the works it cites.
J. Lasserre, “The Moment-SoS hierarchy,” in Int. Cong. of Math. , vol. 4, 2018, pp. 3791–3815
2018
Later among the works it cites.
S. B. Hopkins and J. Li, “Mixture models, robustness, and sum of squares proofs,” in Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing , ser. STOC 2018, 2018, pp. 1021–1034
2018
Later among the works it cites.
T. Weisser, J. B. Lasserre, and K.-C. Toh, “Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity,” Math. Program. Comput. , vol. 10, no. 1, pp. 1–32, 2018
2018
Later among the works it cites.
I. Diakonikolas, G. Kamath, D. Kane, J. Li, J. Steinhardt, and A. Stewart, “Sever: A robust meta-algorithm for stochastic optimization,” in Intl. Conf. on Machine Learning (ICML) , ser. Proceedings of Machine Learning Research, K. Chaudhuri and R. Salakhutdinov, Eds., vol. 97, 2019, pp. 1596–1606
2019
Later among the works it cites.
I. Diakonikolas, W. Kong, and A. Stewart, “Efficient algorithms and lower bounds for robust linear regression,” in Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms , ser. SODA ’19, 2019, pp. 2745–2754
2019
Later among the works it cites.
2019
Later among the works it cites.
S. Karmalkar, A. Klivans, and P. Kothari, “List-decodable linear regression,” in Advances in Neural Information Processing Systems (NIPS) , vol. 32, 2019
2019
Later among the works it cites.
M. Hsiao and M. Kaess, “MH-iSAM2: multi-hypothesis iSAM using Bayes Tree and Hypo-tree,” in IEEE Intl. Conf. on Robotics and Automation (ICRA) , 2019, pp. 1274–1280
2019
Later among the works it cites.
J. T. Barron, “A general and adaptive robust loss function,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , 2019, pp. 4331–4339
2019
Later among the works it cites.
H. M. Le, T.-J. Chin, A. Eriksson, T.-T. Do, and D. Suter, “Deterministic approximate methods for maximum consensus robust fitting,” IEEE Trans. Pattern Anal. Machine Intell. , 2019
2019
Later among the works it cites.
——, “Robust estimators in high-dimensions without the computational intractability,” SIAM Journal on Computing , vol. 48, no. 2, pp. 742–864, 2019
2019
Later among the works it cites.
N. Fleming, P. Kothari, and T. Pitassi, “Semialgebraic proofs and efficient algorithm design,” Foundations and Trends in Theoretical Computer Science , vol. 14, no. 1-2, pp. 1–221, 2019
2019
Later among the works it cites.
A. Prasad, A. S. Suggala, S. Balakrishnan, and P. Ravikumar, “Robust estimation via robust gradient estimation,” Journal of the Royal Statistical Society: Series B (Statistical Methodology) , vol. 82, 2020
2020
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
P. Raghavendra and M. Yau, “List decodable learning via sum of squares,” in Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms , ser. SODA ’20, 2020, p. 161–180
2020
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
2021
Later among the works it cites.
2021
Later among the works it cites.
T. D’Orsi, G. Novikov, and D. D. Steurer, “Consistent regression when oblivious outliers overwhelm,” in Intl. Conf. on Machine Learning (ICML) , vol. 139, 2021, pp. 2297–2306
2021
Later among the works it cites.
H. Yang, C. Doran, and J.-J. Slotine, “Dynamical pose estimation,” in Intl. Conf. on Computer Vision (ICCV) , 2021
2021
Later among the works it cites.
A. Bakshi and P. K. Kothari, “List-decodable subspace recovery: Dimension independent error in polynomial time,” in Proc. of the Annual ACM-SIAM Symp. on Discrete Algorithms (SODA) , ser. SODA ’21, 2021, pp. 1279–1297
2021
Later among the works it cites.
2021
Later among the works it cites.
J. Wang, V. Magron, and J.-B. Lasserre, “Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension,” SIAM Journal on Optimization , vol. 31, no. 1, pp. 114–141, 2021
2021
Later among the works it cites.
J. Wang, V. Magron, and J.-B. Lasserre, “TSSOS: A Moment-SOS hierarchy that exploits term sparsity,” SIAM Journal on Optimization , vol. 31, no. 1, pp. 30–58, 2021
2021
Later among the works it cites.
2022
Closest in time.
T. Hitchcox and J. R. Forbes, “Mind the gap: Norm-aware adaptive robust loss for multivariate least-squares problems,” IEEE Robotics and Automation Letters , vol. 7, no. 3, pp. 7116–7123, 2022
2022
Closest in time.
2022
Closest in time.
2022
Closest in time.
I. Diakonikolas, D. M. Kane, S. Karmalkar, A. Pensia, and T. Pittas, “Robust sparse mean estimation via sum of squares,” in Proceedings of Thirty Fifth Conference on Learning Theory , ser. Proceedings of Machine Learning Research, vol. 178. PMLR, 2022, pp. 4703–4763
2022
Closest in time.
2022
Closest in time.
2022
Closest in time.
M. Ikram, S. Khaliq, M. Anjum, and W. Hussain, “Perceptual aliasing++: Adversarial attack for visual SLAM front-end and back-end,” IEEE Robotics and Automation Letters , vol. 7, no. 2, pp. 4670–4677, 2022
2022
Closest in time.
D. P. Paudel, A. Habed, C. Demonceaux, and P. Vasseur, “Robust and optimal sum-of-squares-based point-to-plane registration of image sets and structured scenes,” in Intl. Conf. on Computer Vision (ICCV) , 2015, pp. 2048–2056
2056
Closest in time.