Access the full text.
Sign up today, get DeepDyve free for 14 days.
A Bab-Hadiashar, D Suter (1999)
Robust segmentation of visual data using ranked unbiased scale estimateRobotica, 17
R Tennakoon, A Sadri, R Hoseinnezhad, A Bab-Hadiashar (2018)
Effective sampling: Fast segmentation using robust geometric model fittingIEEE Trans. Image Process., 27
D Barath, J Matas (2021)
Graph-cut ransac: Local optimization on spatially coherent structuresIEEE Transactions on Pattern Analysis and Machine Intelligence, 44
T-T Pham, T-J Chin, J Yu, D Suter (2014)
The random cluster model for robust geometric fittingIEEE Trans. Pattern Anal. Mach. Intell., 36
H Wang, T-J Chin, D Suter (2012)
Simultaneously fitting and segmenting multiple-structure data with outliersIEEE Trans. Pattern Anal. Mach. Intell., 34
S Lin, X Wang, G Xiao, Y Yan, H Wang (2021)
Hierarchical representation via message propagation for robust model fittingIEEE Trans. Ind. Electron., 68
R Tennakoon, A Bab-Hadiashar, Z Cao, R Hoseinnezhad, D Suter (2016)
Robust model fitting using higher than minimal subset samplingIEEE Trans. Pattern Anal. Mach. Intell., 38
T Lai, R Chen, C Yang, Q Li, H Fujita, A Sadri, H Wang (2020)
Efficient robust model fitting for multistructure data using global greedy searchIEEE Trans. Cybern., 50
T Lai, H Wang, Y Yan, T-J Chin, J Zheng, B Li (2020)
Accelerated guided sampling for multistructure model fittingIEEE Trans. Cybern., 50
J Li (2021)
A practical o(n2) outlier removal method for correspondence-based point cloud registrationIEEE Transactions on Pattern Analysis and Machine Intelligence, 44
S Lin, H Luo, Y Yan, G Xiao, H Wang (2022)
Co-clustering on bipartite graphs for robust model fittingIEEE Transactions on Image Processing, 31
T Lai, H Wang, TJ Chin, WL Zhao (2017)
Motion segmentation via a sparsity constraintIEEE Trans. Intell. Transp. Syst., 18
Shuyuan Lin, Guobao Xiao, Y. Yan, D. Suter, Hanzi Wang (2019)
Hypergraph Optimization for Multi-Structural Geometric Model FittingArXiv, abs/2002.05350
H. Wong, Tat-Jun Chin, Jin Yu, D. Suter (2013)
Mode seeking over permutations for rapid geometric model fittingPattern Recognit., 46
S Lin (2022)
6605IEEE Transactions on Image Processing, 31
H Wang, G Xiao, Y Yan, D Suter (2019)
Searching for representative modes on hypergraphs for robust geometric model fittingIEEE Trans. Pattern Anal. Mach. Intell., 41
MA Fischler (1981)
381Commun. ACM, 24
M. Fischler, R. Bolles (1981)
Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartographyCommun. ACM, 24
I. Djurović (2017)
QML-RANSAC: PPS and FM signals estimation in heavy noise environmentsSignal Process., 130
T-J Chin, J Yu, D Suter (2012)
Accelerated hypothesis generation for multistructure data via preference analysisIEEE Trans. Pattern Anal. Mach. Intell., 34
Andrew Delong, A. Osokin, Hossam Isack, Yuri Boykov (2010)
Fast Approximate Energy Minimization with Label CostsInternational Journal of Computer Vision, 96
R Vidal, Y Ma, S Sastry (2005)
Generalized principal component analysis (gpca)IEEE Trans. Pattern Anal. Mach. Intell., 27
J Li, Q Hu, M Ai, S Wang (2021)
A geometric estimation technique based on adaptive m-estimators: Algorithm and applicationsIEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 14
Quoc-Huy Tran, Tat-Jun Chin, W. Chojnacki, D. Suter (2013)
Sampling Minimal Subsets with Large Spans for Robust EstimationInternational Journal of Computer Vision, 106
Xu Tan, Jiawei Yang, S. Rahardja (2022)
Sparse random projection isolation forest for outlier detectionPattern Recognit. Lett., 163
H Wang (2012)
1177IEEE Trans. Pattern Anal. Mach. Intell., 34
Yu Sun, Fuxiang Wu (2022)
DESAC: differential evolution sample consensus algorithm for image registrationApplied Intelligence, 52
E Elhamifar, R Vidal (2013)
Sparse subspace clustering: Algorithm, theory, and applicationsIEEE Trans. Pattern Anal. Mach. Intell., 35
H Guo, Y Lu, H Chen, H Luo, G Xiao, H Zhang, H Wang (2022)
Motion consistency guided robust geometric model fitting with severe outliersIEEE Trans. Ind. Electron., 69
Jiawei Yang, Yu Chen, S. Rahardja (2022)
Neighborhood representative for improving outlier detectorsInf. Sci., 625
Taotao Lai, Hanzi Wang, Yan Yan, Da-han Wang, Guobao Xiao (2016)
Rapid hypothesis generation by combining residual sorting with local constraintsMultimedia Tools and Applications, 75
K. Lee, P. Meer, Rae-Hong Park (1998)
Robust Adaptive Segmentation of Range ImagesIEEE Trans. Pattern Anal. Mach. Intell., 20
X Xu, LF Cheong, Z Li (2021)
3D rigid motion segmentation with mixed and unknown number of modelsIEEE Trans. Pattern Anal. Mach. Intell., 43
T Lai, H Fujita, C Yang, Q Li, R Chen (2019)
Robust model fitting based on greedy search and specified inlier thresholdIEEE Trans. Ind. Electron., 66
Jingjing Wu, Ke Li, Qiuju Zhang, W. An, Yi Jiang, Xueliang Ping, Peng Chen (2017)
Iterative RANSAC based adaptive birth intensity estimation in GM-PHD filter for multi-target trackingSignal Process., 131
Robust model estimation aims to estimate the parameters of a given geometric model, and then separate the outliers and inliers belonging to different model instances into different groups based on the estimated parameters. Robust model estimation is a fundamental task in computer vision and artificial intelligence, and mainly contains two components: data sampling for generating hypotheses and model selection for segmenting data. Over the past decade, a number of guided data sampling algorithms and model selection algorithms have been proposed separately. This results in that the performance of the robust model estimation method is still unsatisfactory. In this paper, we first present a comprehensive study of the above algorithms, by analyzing and comparing them. Then, we propose an efficient and effective robust model estimation method by using preference analysis and information theory principles. Specifically, we first employ our previously proposed data sampling algorithm based on preference analysis to sample data subsets for generating promising hypotheses. Then, we build a discriminative sparse affinity matrix based on the generated hypotheses by using information theory principles. Finally, we segment data by conducting a spectral clustering on the discriminative affinity matrix. Experimental results on the AdelaideRMF and the Hopkins 155 datasets show that the proposed method achieves higher segmentation accuracies than several state-of-the-art model estimation methods.
Applied Intelligence – Springer Journals
Published: Oct 1, 2023
Keywords: Robust model estimation; Preference analysis; Information theory principles
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.