Incremental Top-k List Comparison Approach to Robust Multi-Structure Model Fitting

05/31/2011
by   Hoi Sim Wong, et al.
0

Random hypothesis sampling lies at the core of many popular robust fitting techniques such as RANSAC. In this paper, we propose a novel hypothesis sampling scheme based on incremental computation of distances between partial rankings (top-k lists) derived from residual sorting information. Our method simultaneously (1) guides the sampling such that hypotheses corresponding to all true structures can be quickly retrieved and (2) filters the hypotheses such that only a small but very promising subset remain. This permits the usage of simple agglomerative clustering on the surviving hypotheses for accurate model selection. The outcome is a highly efficient multi-structure robust estimation technique. Experiments on synthetic and real data show the superior performance of our approach over previous methods.

READ FULL TEXT

page 6

page 12

page 14

research
07/24/2018

Deterministic Fitting of Multiple Structures using Iterative MaxFS with Inlier Scale Estimation and Subset Updating

We present an efficient deterministic hypothesis generation algorithm fo...
research
09/05/2022

Fast geometric trim fitting using partial incremental sorting and accumulation

We present an algorithmic contribution to improve the efficiency of robu...
research
01/29/2019

Learning for Multi-Model and Multi-Type Fitting

Multi-model fitting has been extensively studied from the random samplin...
research
02/20/2018

Latent RANSAC

We present a method that can evaluate a RANSAC hypothesis in constant ti...
research
07/25/2018

Deterministic Hypothesis Generation for Robust Fitting of Multiple Structures

We present a novel algorithm for generating robust and consistent hypoth...
research
11/18/2020

More Informed Random Sample Consensus

Random sample consensus (RANSAC) is a robust model-fitting algorithm. It...

Please sign up or login with your details

Forgot password? Click here to reset