منابع مشابه
Energy Based Multi-model Fitting & Matching for 3D Reconstruction
Standard geometric model fitting methods take as an input a fixed set of feature pairs greedily matched based only on their appearances. Inadvertently, many valid matches are discarded due to repetitive texture or large baseline between view points. To address this problem, matching should consider both feature appearances and geometric fitting errors. We jointly solve feature matching and mult...
متن کاملGeometric Multi-Model Fitting with a Convex Relaxation Algorithm
We propose a novel method to fit and segment multistructural data via convex relaxation. Unlike greedy methods – which maximise the number of inliers– this approach efficiently searches for a soft assignment of points to models by minimising the energy of the overall classification. Our approach is similar to state-of-the-art energy minimisation techniques which use a global energy. However, we...
متن کاملInteracting Geometric Priors For Robust Multi-Model Fitting: Supplementary Material
where l is a positive spatial smoothness penalty, G(fp, fq) is a function measuring the geometric inconsistency between fp and fq . Under the condition that l ≥ G(., .) ≥ 0, function (6) is submodular, and can be minimised by using graph-cut based methods (e.g., PEARL [1]). However, the condition l ≥ G(., .) ≥ 0 clearly limits the effect of the geometric consistency since the penalty G(., .) is...
متن کاملMulti-Class Model Fitting by Energy Minimization and Mode-Seeking
We propose a general formulation, called Multi-X, for multi-class multi-instance model fitting – the problem of interpreting the input data as a mixture of noisy observations originating from multiple instances of multiple classes. We extend the commonly used α-expansion-based technique with a new move in the label space. The move replaces a set of labels with the corresponding density mode in ...
متن کاملFATHALLA, VOGIATZIS: MULTI-MODEL FITTING BASED ON MINIMUM SPANNING TREE1 Multi-model fitting based on Minimum Spanning Tree
This paper presents a novel approach to the computation of primitive geometrical structures, where no prior knowledge about the visual scene is available and a high level of noise is expected. We based our work on the grouping principles of proximity and similarity, of points and preliminary models. The former was realized using Minimum Spanning Trees (MST), on which we apply a stable alignment...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Vision
سال: 2011
ISSN: 0920-5691,1573-1405
DOI: 10.1007/s11263-011-0474-7