Orthogonal distance least squares fitting: A novel approach

11Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Least squares is a common method of conic fitting that minimizes the squared sum of a distance measure between a set of points and a conic. Orthogonal distance, when used as the distance that is minimized, provides more accurate fits as it is the shortest distance between a point and a conic. The problem however lies in the calculation of the orthogonal distance for a general conic, which results in an unstable closed form solution. Existing methods avoid this closed form solution by using non-linear iterative procedures or incorporating conic specific information. This paper introduces a novel method to directly calculate the orthogonal distance for an arbitrary conic, thereby eliminating the need for iterative procedures and conic specific information. It further describes a least squares fitting algorithm that uses the orthogonal distance thus calculated, to fit general conics. This technique is then extended to fit quadrics to three dimensional data. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Wijewickrema, S., Esson, C., & Papliński, A. (2010). Orthogonal distance least squares fitting: A novel approach. In Communications in Computer and Information Science (Vol. 68 CCIS, pp. 255–268). https://doi.org/10.1007/978-3-642-11840-1_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free