Measure of circularity for parts of digital boundaries and its fast computation

This paper focuses on the design of an effective method that computes the measure of circularity of a part of a digital boundary. An existing circularity measure of a set of discrete points, which is used in computational metrology, is extended to the case of parts of digital boundaries. From a single digital boundary, two sets of points are extracted so that the circularity measure computed from these sets is representative of the circularity of the digital boundary. Therefore, the computation consists of two steps. First, the inner and outer sets of points are extracted from the input part of a digital boundary using digital geometry tools. Next, the circularity measure of these sets is computed using classical tools of computational geometry. It is proved that the algorithm is linear in time in the case of convex parts thanks to the specificity of digital data, and is in O(nlogn) otherwise. Experiments done on synthetic and real images illustrate the interest of the properties of the circularity measure.

[1]  Chul E. Kim,et al.  Digital disks and a digital compactness measure , 1984, STOC '84.

[2]  D. T. Lee,et al.  Out-of-Roundness Problem Revisited , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Jovisa D. Zunic,et al.  On the Maximal Number of Edges of Convex Digital Polygons Included into an m x m -Grid , 1995, J. Comb. Theory, Ser. A.

[4]  Peter Damaschke.  The linear time recognition of digital arcs , 1995, Pattern Recognit. Lett..

[5]  Peter Smart,et al.  Circular hough transform for roundness measurement of objects , 1995, Pattern Recognit..

[6]  Prosenjit Bose,et al.  Computing constrained minimum-width annuli of point sets , 1998, Comput. Aided Des..

[7]  Marcel Worring,et al.  Digitized Circular Arcs: Characterization and Parameter Estimation , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  E. T..  An Introduction to the Theory of Numbers , 1946, Nature.

[9]  W. Eddy,et al.  A Statistical , 2008 .

[10]  Son Pham.  Digital circles with non-lattice point centers , 2005, The Visual Computer.

[11]  Richard O. Duda,et al.  Use of the Hough transformation to detect lines and curves in pictures , 1972, CACM.

[12]  N. Megiddo,et al.  Computing circular separability , 1986 .

[13]  Steve Fisk.  Separating Point Sets by Circles, and the Recognition of Digital Disks , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[14]  Franco P. Preparata,et al.  Culling a Set of Points for Roundness or Cylindricity Evaluations , 2003, Int. J. Comput. Geom. Appl..

[15]  Robert M. Haralick,et al.  A Statistical, Nonparametric Methodology for Document Degradation Model Validation , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[16]  Karl Tombre,et al.  Robust and accurate vectorization of line drawings , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[17]  P. Agarwal,et al.  Approximation Algorithms for Minimum-Width Annuli and Shells , 2000 .

[18]  V. Karimdki.  Effective circle fitting for particle trajectories , 2002 .

[19]  A. Thom,et al.  A Statistical Examination of the Megalithic Sites in Britain , 1955 .

[20]  Avraham A. Melkman,et al.  On-Line Construction of the Convex Hull of a Simple Polyline , 1987, Inf. Process. Lett..

[21]  Kevin Q. Brown,et al.  Voronoi Diagrams from Convex Hulls , 1979, Inf. Process. Lett..

[22]  Iuri Frosio,et al.  Real-time accurate circle fitting with occlusions , 2008, Pattern Recognit..

[23]  Laure Tougne,et al.  An elementary algorithm for digital arc segmentation , 2001, Electron. Notes Theor. Comput. Sci..

[24]  Laure Tougne,et al.  Test and Measure of Circularity for Digital Curves , 2008, IPCV.

[25]  Prosenjit Bose,et al.  Testing the Quality of Manufactured Disks and Balls , 2003, Algorithmica.

[26]  M.J. Bottema,et al.  Circularity of objects in images , 2000, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100).

[27]  Yiu-Tong Chan,et al.  A simple approach for the estimation of circular arc center and its radius , 1989, Comput. Vis. Graph. Image Process..

[28]  U. M. Landau,et al.  Estimation of a circular arc center and its radius , 1987, Comput. Vis. Graph. Image Process..

[29]  Nimrod Megiddo,et al.  Linear Programming in Linear Time When the Dimension Is Fixed , 1984, JACM.

[30]  Soo-Chang Pei,et al.  Circular arc detection based on Hough transform , 1995, Pattern Recognit. Lett..

[31]  Kurt Swanson.  An Optimal Algorithm for Roundness Determination on Convex Polygons , 1993, WADS.

[32]  C. M. Shakarji,et al.  Reference Algorithms for Chebyshev and One-Sided Data Fitting for Coordinate Metrology , 2004 .

[33]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[34]  Micha Sharir,et al.  Approximation and exact algorithms for minimum-width annuli and shells , 1999, SCG '99.

[35]  Robert M. Haralick,et al.  A Measure for Circularity of Digital Figures , 1974, IEEE Trans. Syst. Man Cybern..

[36]  Raimund Seidel,et al.  Small-dimensional linear programming and convex hulls made easy , 1991, Discret. Comput. Geom..

[37]  H. Wadell.  Volume, Shape, and Roundness of Rock Particles , 1932, The Journal of Geology.

[38]  V. A. Kovalevsky.  New definition and fast recognition of digital straight segments and arcs , 1990, [1990] Proceedings. 10th International Conference on Pattern Recognition.

[39]  Tomio Hirata,et al.  A Unified Linear-Time Algorithm for Computing Distance Maps , 1996, Inf. Process. Lett..

[40]  Isabelle Debled-Rennesson,et al.  A Linear Algorithm for Segmentation of Digital Curves , 1995, Int. J. Pattern Recognit. Artif. Intell..

[41]  Zvi Drezner,et al.  On the circle closest to a set of points , 2002, Comput. Oper. Res..

[42]  Mu-Chen Chen,et al.  Roundness measurements for discontinuous perimeters via machine visions , 2002, Comput. Ind..

[43]  Saul I. Gass,et al.  Fitting Circles and Spheres to Coordinate Measuring Machine Data , 1998 .

[44]  Nimrod Megiddo,et al.  Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[45]  Reinhard Klette,et al.  A Comparative Evaluation of Length Estimators of Digital Curves , 2004, IEEE Trans. Pattern Anal. Mach. Intell..

[46]  Utpal Roy,et al.  Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error , 1992, Comput. Aided Des..

[47]  Mark Berman,et al.  Large sample bias in least squares estimators of a circular arc center and its radius , 1989, Comput. Vis. Graph. Image Process..

[48]  W. Bihlmayer,et al.  Approximation by circles , 1989, ZOR Methods Model. Oper. Res..

[49]  Laure Tougne,et al.  Robust decomposition of a digital curve into convex and concave parts , 2008, 2008 19th International Conference on Pattern Recognition.

[50]  J. Pegna,et al.  Computational metrology of the circle , 1998, Proceedings. Computer Graphics International (Cat. No.98EX149).