Circle detection using fast finding and fitting (fff) algorithm

Abstract

This paper describes a Fast Finding and Fitting (FFF) Algorithm based on the geometric symmetry of the circle. A comparison with other circle detection approaches, in particular the Hough Transform and its extensions is presented. A method to determine a relevant estimation of accuracy is also given. Experiments show that FFF possesses advantages in memory usage, high speed, reliability and accuracy are also presented. © 2000 Taylor & Francis Group, LLC.