A General Coding Scheme for Families of Digital Curve Segments

Abstract This paper deals with sets consisting of digital curve segments which are presented on ann×ngrid. The main result is a general coding scheme which can be applied to the sets of digital curve segments, which may consist even of digital curve segments that result from digitization of curves of different kinds. Ifhis an upper bound for the number of intersection points of two digitized curves, thenh+3 integer parameters are sufficient for the coding. The proposed coding scheme preserves an asymptotically optimal coding (the minimum possible number of bits is used) whenhis assumed to be a constant. If it is allowed thathtends to infinity (whenntends to infinity, too), then the number of bits used for the coding is O (h2·logn). In addition, the authors show that the coding of digital curve segments by their least-squares polynomial fits is possible. It turns out that such a coding is a special case of the general coding scheme proposed here.

[1]  A. C. Aitken.  Determinants and matrices , 1940 .

[2]  Peter Veelaert.  Elimination theory for systems of linear inequalities applied to problems in digital geometry , 1993, Other Conferences.

[3]  Aviezri S. Fraenkel,et al.  Nonhomogeneous spectra of numbers , 1981, Discret. Math..

[4]  Azriel Rosenfeld,et al.  Supportedness and tameness differentialless geometry of plane curves , 1998, Pattern Recognit..

[5]  Leonid Levant,et al.  A Problem Book in Algebra , 1979 .

[6]  Aviezri S. Fraenkel,et al.  A Linear Algorithm for Nonhomogeneous Spectra of Numbers , 1984, J. Algorithms.

[7]  Marcel Worring,et al.  Digital curvature estimation , 1993 .

[8]  Jovisa D. Zunic,et al.  On the number of digital convex polygons inscribed into an (m, m)-grid , 1994, IEEE Trans. Inf. Theory.

[9]  Ivan Stojmenovic,et al.  A new characterization of digital lines by least square fits , 1993, Pattern Recognit. Lett..

[10]  Fabrizio Luccio,et al.  The Discrete Equation of the Straight Line , 1975, IEEE Transactions on Computers.

[11]  AZRIEL ROSENFELD,et al.  Digital Straight Line Segments , 1974, IEEE Transactions on Computers.

[12]  Jovisa D. Zunic,et al.  A coding scheme for certain sets of digital curves , 1995, Pattern Recognit. Lett..

[13]  Arnold W. M. Smeulders,et al.  Discrete Representation of Straight Lines , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[14]  Ivan Stojmenovic,et al.  A Parametrization of Digital Planes by Least-Squares Fits and Generalizations , 1996, CVGIP Graph. Model. Image Process..

[15]  Alfred M. Bruckstein,et al.  The number of digital straight lines on an N×N grid , 1990, IEEE Trans. Inf. Theory.

[16]  H. Klaasman.  Some aspects of the accuracy of the approximated position of a straight line on a square grid , 1975 .

[17]  Jovisa Zunic,et al.  Representation of digital parabolas by least-square fit , 1995, Other Conferences.

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

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

[20]  Carlo Arcelli,et al.  On the parallel generation of straight digital lines , 1978 .

[21]  Ronald L. Graham,et al.  Spectra of Numbers , 1978 .

[22]  Azriel Rosenfeld,et al.  New views of linearity and connectedness in digital geometry , 1989, Pattern Recognit. Lett..

[23]  Kinley Larntz,et al.  Applied Statistical Methods , 1974 .