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

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

2011-05-31

arxiv.org/abs/1105.6277v1

Computer Science

Computer Vision and Pattern Recognition

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Incremental Top-k List Comparison Approach to Robust Multi-Structure Model Fitting does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Incremental Top-k List Comparison Approach to Robust Multi-Structure Model Fitting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Incremental Top-k List Comparison Approach to Robust Multi-Structure Model Fitting will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-338290