Implicit polynomial representation through a fast fitting error estimation |
| |
Authors: | Rouhani Mohammad Sappa Angel Domingo |
| |
Affiliation: | Computer Vision Center, Universitat Autònoma de Barcelona Campus, Barcelona, Spain. |
| |
Abstract: | This paper presents a simple distance estimation for implicit polynomial fitting. It is computed as the height of a simplex built between the point and the surface (i.e., a triangle in 2-D or a tetrahedron in 3-D), which is used as a coarse but reliable estimation of the orthogonal distance. The proposed distance can be described as a function of the coefficients of the implicit polynomial. Moreover, it is differentiable and has a smooth behavior . Hence, it can be used in any gradient-based optimization. In this paper, its use in a Levenberg-Marquardt framework is shown, which is particularly devoted for nonlinear least squares problems. The proposed estimation is a generalization of the gradient-based distance estimation, which is widely used in the literature. Experimental results, both in 2-D and 3-D data sets, are provided. Comparisons with state-of-the-art techniques are presented, showing the advantages of the proposed approach. |
| |
Keywords: | |
本文献已被 PubMed 等数据库收录! |
|