Fitting Multiple Models via Density Analysis in Tanimoto Space

This paper deals with the extraction of multiple models from noisy, outlier-contaminated data. We build on the “preference trick” implemented by T-linkage, weakening the prior assumptions on the data: without requiring the tuning of the inlier threshold we develop a new automatic method which takes advantage of the geometric properties of Tanimoto space to bias the sampling toward promising models and exploits a density based analysis in the conceptual space in order to robustly estimate the models. Experimental validation proves that our method compares favourably with T-Linkage on public, real data-sets.

[1]  René Vidal,et al.  A Benchmark for the Comparison of 3-D Motion Segmentation Algorithms , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.

[2]  Hiroshi Kawakami,et al.  Detection of Planar Regions with Uncalibrated Stereo using Distributions of Feature Points , 2004, BMVC.

[3]  Charles V. Stewart,et al.  Bias in robust estimation caused by discontinuities and multiple structures , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Hans-Peter Kriegel,et al.  A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.

[5]  Jiri Matas,et al.  Randomized RANSAC with Td, d test , 2004, Image Vis. Comput..

[6]  Tat-Jun Chin,et al.  Accelerated Hypothesis Generation for Multistructure Data via Preference Analysis , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Jiri Matas,et al.  Randomized RANSAC with T(d, d) test , 2002, BMVC.

[8]  Yuri Boykov,et al.  Energy-Based Geometric Multi-model Fitting , 2012, International Journal of Computer Vision.

[9]  Jiri Matas,et al.  Matching with PROSAC - progressive sample consensus , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[10]  Tat-Jun Chin,et al.  Robust fitting of multiple structures: The statistical learning approach , 2009, 2009 IEEE 12th International Conference on Computer Vision.

[11]  R. Vidal,et al.  Sparse Subspace Clustering: Algorithm, Theory, and Applications. , 2013, IEEE transactions on pattern analysis and machine intelligence.

[12]  Jana Kosecka,et al.  Nonparametric Estimation of Multiple Structures with Outliers , 2006, WDV.

[13]  Emmanuel J. Candès,et al.  Robust Subspace Clustering , 2013, ArXiv.

[14]  B. S. Manjunath,et al.  The multiRANSAC algorithm and its application to detect planar homographies , 2005, IEEE International Conference on Image Processing 2005.

[15]  Andrea Fusiello,et al.  T-Linkage: A Continuous Relaxation of J-Linkage for Multi-model Fitting , 2014, 2014 IEEE Conference on Computer Vision and Pattern Recognition.

[16]  Andrea Fusiello,et al.  Robust Multiple Structures Estimation with J-Linkage , 2008, ECCV.

[17]  Andrew Zisserman,et al.  MLESAC: A New Robust Estimator with Application to Estimating Image Geometry , 2000, Comput. Vis. Image Underst..

[18]  Hans-Peter Kriegel,et al.  OPTICS: ordering points to identify the clustering structure , 1999, SIGMOD '99.

[19]  Thomas S. Huang,et al.  Image processing , 1971 .

[20]  Yong Yu,et al.  Robust Recovery of Subspace Structures by Low-Rank Representation , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[21]  S. Beucher,et al.  Morphological segmentation , 1990, J. Vis. Commun. Image Represent..

[22]  Tat-Jun Chin,et al.  Dynamic and hierarchical multi-structure geometric model fitting , 2011, 2011 International Conference on Computer Vision.

[23]  Erkki Oja,et al.  A new curve detection method: Randomized Hough transform (RHT) , 1990, Pattern Recognit. Lett..

[24]  Desire L. Massart,et al.  Looking for Natural Patterns in Analytical Data, 2. Tracing Local Density with OPTICS , 2002, J. Chem. Inf. Comput. Sci..