[14] Tianyu Ding, Zhihui Zhu, René Vidal, and Daniel P Robinson. Dual principal component pursuit for robust subspace learning: Theory and algorithms for a holistic approach. In Proceedings of the International Conference on Machine Learning, pages 2739-2748, 2021.
[15] Ehsan Elhamifar and René Vidal. Sparse subspace clustering: Algorithm, theory, and applications. IEEE Transactions on Pattern Analysis and Machine Intelligence, 35(11):2765-2781, 2013.
[16] Martin Ester, Hans-Peter Kriegel, Jörg Sander, and Xiaowei Xu. Density-based spatial clustering of applications with noise. In Proceedings of the International Conference on Knowledge Discovery and Data Mining, volume 240, page 6, 1996.
[17] Aoxiang Fan, Xingyu Jiang, Yang Wang, Junjun Jiang, and Jiayi Ma. Geometric estimation via robust subspace recovery. In Proceedings of the European Conference on Computer Vision, pages 462-478, 2020.
[18] Aoxiang Fan, Jiayi Ma, Xingyu Jiang, and Haibin Ling. Efficient deterministic search with robust loss functions for geometric model fitting. IEEE Transactions on Pattern Analysis and Machine Intelligence, 44(11):8212-8229, 2022.
[19] Martin A Fischler and Robert C Bolles. Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Communications of the ACM, 24(6):381-395, 1981.
[20] Andreas Geiger, Philip Lenz, Christoph Stiller, and Raquel Urtasun. Vision meets robotics: The kitti dataset. The International Journal of Robotics Research, 32(11):1231-1237, 2013.
[21] Richard Hartley and Andrew Zisserman. Multiple view geometry in computer vision. Cambridge University Press, 2003.
[22] Maksym Ivashechkin, Daniel Barath, and Jií Matas. Vsac: Efficient and accurate estimator for h and f. In Proceedings of the IEEE International Conference on Computer Vision, pages 15243-15252, 2021.
[23] Xingyu Jiang, Jiayi Ma, Junjun Jiang, and Xiaojie Guo. Robust feature matching using spatial clustering with heavy outliers. IEEE Transactions on Image Processing, 29:736-746, 2020.
[24] Xingyu Jiang, Jiayi Ma, Guobao Xiao, Zhenfeng Shao, and Xiaojie Guo. A review of multimodal image matching: Methods and applications. Information Fusion, 73:22-71, 2021.
[25] Ken-ichi Kanatani. Motion segmentation by subspace separation and model selection. In Proceedings of the IEEE International Conference on Computer Vision, pages 586–591, 2001.
[26] Evgeny S Levitin and Boris T Polyak. Constrained minimization methods. USSR Computational Mathematics and Mathematical Physics, 6(5):1-50, 1966.
[27] Yifan Lu, Jiayi Ma, Leyuan Fang, Xin Tian, and Junjun Jiang. Robust and scalable gaussian process regression and its applications. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 21950-21959, 2023.
[28] Jiayi Ma, Xingyu Jiang, Aoxiang Fan, Junjun Jiang, and Junchi Yan. Image matching from handcrafted to deep features: A survey. International Journal of Computer Vision, 129(1):23-79, 2021.
[29] Luca Magri and Andrea Fusiello. T-linkage: A continuous relaxation of j-linkage for multi-model fitting. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 3954-3961, 2014.
[30] Luca Magri and Andrea Fusiello. Robust multiple model fitting with preference analysis and low-rank approximation. In Proceedings of the British Machine Vision Conference, 2015.
[31] Luca Magri and Andrea Fusiello. Fitting multiple heterogeneous models by multi-class cascaded t-linkage. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 7460-7468, 2019.
[32] Luca Magri, Filippo Leveni, and Giacomo Boracchi. Multilink: Multi-class structure recovery via agglomerative clustering and model selection. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 1853-1862, 2021.
[33] Raul Mur-Artal, Jose Maria Martinez Montiel, and Juan D Tardos. Orb-slam: a versatile and accurate monocular slam system. IEEE Transactions on Robotics, 31(5):1147-1163, 2015.
[34] Arkadj Semenovic Nemirovskij and David Borisovich Yudin. Problem complexity and method efficiency in optimization. Wiley-Interscience Series in Discrete Mathematics, John Wiley & Sons, New York, 1983.