By Topic

Fitting Noisy Data to a Circle: A Simple Iterative Maximum Likelihood Approach

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Wei Li ; Sch. of Eng. & Comput. Sci., Victoria Univ., Wellington, New Zealand ; Jing Zhong ; Gulliver, T.A. ; Bo Rong
more authors

Fitting noisy measurements to a circle is a classic statistical estimation problem. In this paper, we make two contributions to the study of this problem. First, we propose a novel formulation of the maximum likelihood (ML) estimator for identifying the center and radius of the circle from noisy measurements. This new estimator uses the unknown true values of the measurement points as the nuisance parameter to obtain an exact ML formulation. We then examine the Karush-Kuhn-Tucker (KKT) conditions for the optimum solution to the ML estimator. We show analytically that this new estimator is in fact equivalent to the well-known least squares (LS) form of the circle fitting problem. Second, from the insights gained in deriving the optimum solution, a computationally simple circle fitting algorithm based on greedy search is proposed. Performance results are given to illustrate the performance of the proposed algorithm.

Published in:

Communications (ICC), 2011 IEEE International Conference on

Date of Conference:

5-9 June 2011