AbstractWe study a popular algorithm for fitting polynomial curves to scattered data based on the least squares with gradient weights. We show that sometimes this algorithm admits a substantial reduction of complexity, and, furthermore, find precise conditions under which this is possible. It turns out that this is, indeed, possible when one fits circles but not ellipses or hyperbolas
We consider fitting given data points in the plane by an algebraic curve in parametric form. The obj...
An Adaptive Regularisation framework using Cubics (ARC) was proposed for unconstrained optimization ...
DoctoralThis course explains least squares optimization, nowadays a simple and well-mastered technol...
AbstractWe study a popular algorithm for fitting polynomial curves to scattered data based on the le...
Fitting circles and ellipses to given points in the plane is a problem that arises in many applicati...
An efficient algorithm for selecting the degree of a polynomial that defines a curve that best appro...
AbstractWe introduce the following problem which is motivated by applications in vision and pattern ...
Journal ArticleAn algebraic curve is defined as the zero set of a polynomial in two variables. Alge...
Journal ArticleAn algebraic curve is defined as the zero set of a polynomial in two variables. Alge...
This paper presents a new method for fitting an ellipse to a point sequence extracted from images. I...
We consider the task of reconstructing a curve in constant dimensional space from noisy data. We con...
This paper presents a robust and accurate technique for an estimation of the best-fit ellipse going ...
This work presents a new efficient method for fitting ellipses to scattered data. Previous algorithm...
Abstract. Given a large set of irregularly spaced points in the plane, an algorithm for partitioning...
AbstractIn this paper, we present a weighted least squares method to fit scattered data with noise. ...
We consider fitting given data points in the plane by an algebraic curve in parametric form. The obj...
An Adaptive Regularisation framework using Cubics (ARC) was proposed for unconstrained optimization ...
DoctoralThis course explains least squares optimization, nowadays a simple and well-mastered technol...
AbstractWe study a popular algorithm for fitting polynomial curves to scattered data based on the le...
Fitting circles and ellipses to given points in the plane is a problem that arises in many applicati...
An efficient algorithm for selecting the degree of a polynomial that defines a curve that best appro...
AbstractWe introduce the following problem which is motivated by applications in vision and pattern ...
Journal ArticleAn algebraic curve is defined as the zero set of a polynomial in two variables. Alge...
Journal ArticleAn algebraic curve is defined as the zero set of a polynomial in two variables. Alge...
This paper presents a new method for fitting an ellipse to a point sequence extracted from images. I...
We consider the task of reconstructing a curve in constant dimensional space from noisy data. We con...
This paper presents a robust and accurate technique for an estimation of the best-fit ellipse going ...
This work presents a new efficient method for fitting ellipses to scattered data. Previous algorithm...
Abstract. Given a large set of irregularly spaced points in the plane, an algorithm for partitioning...
AbstractIn this paper, we present a weighted least squares method to fit scattered data with noise. ...
We consider fitting given data points in the plane by an algebraic curve in parametric form. The obj...
An Adaptive Regularisation framework using Cubics (ARC) was proposed for unconstrained optimization ...
DoctoralThis course explains least squares optimization, nowadays a simple and well-mastered technol...
DOI
Add to ORKG