Skip to main content
Log in

Iterative circle fitting based on circular attracting factor

  • Published:
Journal of Central South University Aims and scope Submit manuscript

Abstract

An intuitive method for circle fitting is proposed. Assuming an approximate circle (C A,n ) for the fitting of some scattered points, it can be imagined that every point would apply a force to C A,n , which all together form an overall effect that “draws” C A,n towards best fitting to the group of points. The basic element of the force is called circular attracting factor (CAF) which is defined as a real scalar in a radial direction of C A,n . An iterative algorithm based on this idea is proposed, and the convergence and accuracy are analyzed. The algorithm converges uniformly which is proved by the analysis of Lyapunov function, and the accuracy of the algorithm is in accord with that of geometric least squares of circle fitting. The algorithm is adopted to circle detection in grayscale images, in which the transferring to binary images is not required, and thus the algorithm is less sensitive to lightening and background noise. The main point for the adaption is the calculation of CAF which is extended in radial directions of C A,n for the whole image. All pixels would apply forces to C A,n , and the overall effect of forces would be equivalent to a force from the centroid of pixels to C A,n . The forces from would-be edge pixels would overweigh that from noisy pixels, so the following approximate circle would be of better fitting. To reduce the amount of calculation, pixels are only used in an annular area including the boundary of C A,n just in between for the calculation of CAF. Examples are given, showing the process of circle fitting of scattered points around a circle from an initial assuming circle, comparing the fitting results for scattered points from some related literature, applying the method proposed for circular edge detection in grayscale images with noise, and/or with only partial arc of a circle, and for circle detection in BGA inspection.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. RIHA K, BENES R. Detection in pulsative medical video sequence [C]// Signal Processing (ICSP2010), 2010 IEEE 10th International Conference on. Beijing, China: IEEE, 2010: 674–677.

    Google Scholar 

  2. JARJES A A. Iris localization: Detecting accurate pupil contour and localizing limbus boundary [C]// Control, Automation and Robotics (CAR), 2010 2nd International Asia Conference on. Wuhan, China: IEEE, 2010: 349–352.

    Chapter  Google Scholar 

  3. JARJES A A. Improved greedy snake model for detecting accurate pupil contour [C]// Advanced Computer Control (ICACC), 2011 3rd International Conference on. Harbin, China: IEEE, 2011: 515–519.

    Google Scholar 

  4. CANNY J. A computational approach to edge detection [J]. Analysis and Machine Intelligence, 1986, 8(6): 679–714.

    Article  Google Scholar 

  5. DAVIS L S. A survey of edge detection techniques [J]. Computer Graphics and Image Processing, 1975, 4(3): 248–260.

    Article  Google Scholar 

  6. DONG W, SHISHENG Z, Color image recognition method based on the Prewitt operator [C]// Computer Science and Software Engineering, 2008 International Conference on. Wuhan, China: IEEE, 2008: 170–173.

    Chapter  Google Scholar 

  7. LANSER S, ECKSTEIN W. A modification of deriche’s approach to edge detection [C]. Pattern Recognition, 1992. Vol. III. Conference C: Image, Speech and Signal Analysis, 11th IAPR International Conference on. The Hague, Netherlands: IEEE, 1992: 633–637.

    Google Scholar 

  8. BALLARD D H. Generalizing the hough transform to detect arbitrary shapes [J]. Pattern Recognition, 1981, 13(2): 111–122.

    Article  MATH  Google Scholar 

  9. KIRYATI N. A probabilistic hough transform [J]. Pattern Recognition, 1991, 24(4): 303–316.

    Article  MathSciNet  Google Scholar 

  10. SHAKED D. Deriving stopping rules for the probabilistic hough transform by sequential analysis [J]. Computer Vision and Image Understanding, 1996, 63(4): 512–526.

    Article  Google Scholar 

  11. XU L. A new curve detection method-randomized hough transform (rht) [J]. Pattern Recognition Letters 1990, 11(5): 331–338.

    Article  MATH  Google Scholar 

  12. CHATZIS V, PITAS I. Fuzzy cell hough transform for curve detection [J]. Pattern Recognition, 1997, 30(12): 2031–2042.

    Article  Google Scholar 

  13. HAN J H. Fuzzy hough transform [J]. Pattern Recognition Letters, 1994, 15(7): 649–658.

    Article  Google Scholar 

  14. GANDER W, GOLUB G H, STREBEL R. Least-squares fitting of circles and ellipses [J]. BIT Numerical Mathematics, 1994, 34(4): 558–578.

    Article  MathSciNet  MATH  Google Scholar 

  15. SAMPSON P D. Fitting conic sections to very scattered data-An iterative refinement of the bookstein algorithm [J]. Computer Graphics and Image Processing 1982, 18(1): 97–108.

    Article  Google Scholar 

  16. FITZGIBBON A. Direct least square fitting of ellipses [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1999, 21(5): 239–252.

    Article  MathSciNet  Google Scholar 

  17. CHERNOV N, LESORT C. Least squares fitting of circles [J]. Journal of Mathematical Imaging and Vision, 2005, 23(3): 239–252.

    Article  MathSciNet  Google Scholar 

  18. JIA L, PENG C, LIU H. A fast randomized circle detection algorithm [C]// Image and Signal Processing (CISP), 2011 4th International Congress on. Shanghai, China: IEEE, 2011: 820–823.

    Chapter  Google Scholar 

  19. SHANG F, LIU J. An improved circle detection method based on right triangles inscribed in a circle [C]// Computer Science and Information Engineering, 2009 WRI World Congress on. Los Angeles, USA: IEEE, 2009: 382–387.

    Chapter  Google Scholar 

  20. BARWICK D S. Very fast best-fit circular and elliptical boundaries by chord data [J]. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 2009, 31(6): 1147–1152.

    Article  Google Scholar 

  21. CHERNOV N. Circular and linear regression: Fitting circles and lines by least squares [M]. London, UK: CRC Press, 2010: 47–49.

    Google Scholar 

  22. AIGNER M, SIR Z, JUTTLER B. Evolution-based least squares fitting using pythagorean hodograph spline curves [J]. Computer Aided Geometric Design 2007, 24(6): 310–322.

    Article  MathSciNet  MATH  Google Scholar 

  23. BULLOCK R. Least-squares circle fit [EB/OL]. [2006-10]. www.dtcenter.orgat:met-users-docs-writeups-circlefit.pdf.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Heng-sheng Wang  (王恒升).

Additional information

Foundation item: Project(2013CB035504) supported by the National Basic Research Program of China; Project(2012zzts078) supported by the Fundamental Research Funds for the Central Universities of Central South University, China; Project(2009ZX02038) supported by the National Science and Technology Major Project of the Ministry of Science and Technology of China

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, Hs., Zhang, Q. & Wang, Fl. Iterative circle fitting based on circular attracting factor. J. Cent. South Univ. 20, 2663–2675 (2013). https://doi.org/10.1007/s11771-013-1782-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11771-013-1782-6

Key words

Navigation