On Three Constrained Versions of the Digital Circular Arc Recognition Problem

In this paper, the problem of digital circular arcs recognition is investigated in a new way. The main contribution is a simple and linear-time algorithm for solving three subproblems: online recognition of digital circular arcs coming from the digitization of a disk having either a given radius, a boundary that is incident to a given point, or a center that is on a given straight line. Solving these subproblems is interesting in itself, but also for the recognition of digital circular arcs. The proposed algorithm can be iteratively used for this problem. Moreover, since the algorithm is online, it provides a way to segment digital curves.

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

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

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

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

[5]  Ronald L. Graham,et al.  An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..

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

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

[8]  Peter Sauer.  On the Recognition of Digital Circles in Linear Time , 1992, Comput. Geom..

[9]  Alon Efrat,et al.  Subpixel image registration using circular fiducials , 1994, Int. J. Comput. Geom. Appl..

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

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

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

[13]  David G. Kirkpatrick,et al.  On the shape of a set of points in the plane , 1983, IEEE Trans. Inf. Theory.

[14]  Lilian Buzer,et al.  A linear incremental algorithm for naive and standard digital lines and planes recognition , 2003, Graph. Model..

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

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

[17]  Chul E. Kim,et al.  Digital Disks , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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