Discrete Polynomial Curve Fitting Guaranteeing Inclusion-Wise Maximality of Inlier Set
نویسندگان
چکیده
This paper deals with the problem of fitting a discrete polynomial curve to 2D noisy data. We use a discrete polynomial curve model achieving connectivity in the discrete space. We formulate the fitting as the problem to find parameters of this model maximizing the number of inliers i.e., data points contained in the discrete polynomial curve. We propose a method guaranteeing inclusion-wise maximality of its obtained
منابع مشابه
Discrete Polynomial Curve Fitting to Noisy Data
A discrete polynomial curve is defined as a set of points lying between two polynomial curves. This paper deals with the problem of fitting a discrete polynomial curve to given integer points in the presence of outliers. We formulate the problem as a discrete optimization problem in which the number of points included in the discrete polynomial curve, i.e., the number of inliers, is maximized. ...
متن کاملEfficiently Updating Feasible Regions for Fitting Discrete Polynomial Curve
We deal with the problem of fitting a discrete polynomial curve to 2D data in the presence of outliers. Finding a maximal inlier set from given data that describes a discrete polynomial curve is equivalent with finding the feasible region corresponding to the set in the parameter space. When iteratively adding a data point to the current inlier set, how to update its feasible region is a crucia...
متن کاملAutomatic Estimation of the Inlier Threshold in Robust Multiple Structures Fitting
This paper tackles the problem of estimating the inlier threshold in RANSAC-like approaches to multiple models fitting. An iterative approach finds the maximum of a score function which resembles the Silhouette index used in clustering validation. Although several methods have been proposed to solve this problem for the single model case, this is the first attempt to address multiple models. Ex...
متن کاملOn enumerating all minimal solutions of feedback problems
We present an algorithm that generates all (inclusion-wise) minimal feedback vertex sets of a directed graph G = (V, E). The feedback vertex sets of G are generated with a polynomial delay of O ( |V |(|V | + |E|) ) . We further show that the underlying technique can be tailored to generate all minimal solutions for the undirected case and the directed feedback arc set problem, both with a polyn...
متن کاملScale Estimation in Multiple Models Fitting via Consensus Clustering
This paper presents a new procedure for fitting multiple geometric structures without having a priori knowledge of scale. Our method leverages on Consensus Clustering, a single-term model selection strategy relying on the principle of stability, thereby avoiding the explicit tradeoff between data fidelity (i.e., modeling error) and model complexity. In particular we tailored this model selectio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016