Maximal digital straight segments and convergence of discrete geometric estimators

Discrete geometric estimators approach geometric quantities on digitized shapes without any knowledge of the continuous shape. A classical yet difficult problem is to show that an estimator asymptotically converges toward the true geometric quantity as the resolution increases. We study here the convergence of local estimators based on Digital Straight Segment (DSS) recognition. It is closely linked to the asymptotic growth of maximal DSS, for which we show bounds both about their number and sizes. These results not only give better insights about digitized curves but indicate that curvature estimators based on local DSS recognition are not likely to converge. We indeed invalidate an hypothesis which was essential in the only known convergence theorem of a discrete curvature estimator. The proof involves results from arithmetic properties of digital lines, digital convexity, combinatorics, continued fractions and random polytopes.

[1]  Laure Tougne,et al.  Optimal Time Computation of the Tangent of a Discrete Curve: Application to the Curvature , 1999, DGCI.

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

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

[4]  Reinhard Klette,et al.  Multigrid Convergence of Calculated Features in Image Analysis , 2000, Journal of Mathematical Imaging and Vision.

[5]  Chul E. Kim,et al.  Digital Convexity, Straightness, and Convex Polygons , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Laure Tougne,et al.  On the min DSS problem of closed discrete curves , 2003, Electron. Notes Discret. Math..

[7]  K. Voss Discrete Images, Objects, and Functions in Zn , 1993 .

[8]  David Coeurjolly Algorithmique et géométrie discrète pour la caractérisation des courbes et des surfaces. (Algorithmic and digital geometry for curve and surface characterization) , 2002 .

[9]  Jean-Pierre Reveillès Géométrie discrète, calcul en nombres entiers et algorithmique , 1991 .

[10]  Antal Balog,et al.  On the convex hull of the integer points in a disc , 1991, SCG '91.

[11]  François de Vieilleville,et al.  Analysis and Comparative Evaluation of Discrete Tangent Estimators , 2005, DGCI.

[12]  Aldo de Luca,et al.  Sturmian Words, Lyndon Words and Trees , 1997, Theor. Comput. Sci..

[13]  David G. Larman,et al.  The vertices of the knapsack polytope , 1983, Discret. Appl. Math..