Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Optimal circle fitting via branch and bound|
|Author:||Zelniker, Emanuel Emil|
Appleton, B. C.
Clarkson, V. L.
|Citation:||Optimal circle fitting via branch and bound. Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, March 18-23 2005: pp. 709 - 712|
|Conference Name:||IEEE International Conference on Acoustics, Speech, and Signal Processing (2005 : Philadelphia, USA)|
|School/Discipline:||School of Computer Science|
|Abstract:||We examine the problem of fitting a circle to a set of noisy measurements of points from the circle's circumference, assuming independent, identically distributed Gaussian measurement errors. We propose an algorithm based on branch and bound to obtain the maximum likelihood estimate and show that this algorithm obtains the optimal estimate. We examine the rate of convergence and determine the computational complexity of the proposed algorithm. We also provide timings and compare them to those of existing techniques for circle fitting proposed in the literature. Finally, we demonstrate that our algorithm is statistically efficient by comparing our results to the Cramer-Rao lower bound.|
|Description:||© Copyright 2005 IEEE|
|Appears in Collections:||Computer Science publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.