Abstract
This paper presents new results about digital straight segments, their recognition and related properties. They come from the study of the arithmetically based recognition algorithm proposed by I. Debled-Rennesson and J.-P. Reveillès in 1995 [1]. We indeed exhibit the relations describing the possible changes in the parameters of the digital straight segment under investigation. This description is achieved by considering new parameters on digital segments: instead of their arithmetic description, we examine the parameters related to their combinatoric description. As a result we have a better understanding of their evolution during recognition and analytical formulas to compute them. We also show how this evolution can be projected onto the Stern-Brocot tree. These new relations have interesting consequences on the geometry of digital curves. We show how they can for instance be used to bound the slope difference between consecutive maximal segments.
Chapter PDF
Similar content being viewed by others
References
Debled-Renesson, I., Reveillès, J.P.: A linear algorithm for segmentation of discrete curves. Int. J. Pattern Recognit. Artif. Intell. 9, 635–662 (1995)
Klette, R., Rosenfeld, A.: Digital straightness: a review. Discrete Appl. Math. 139(1-3), 197–230 (2004)
Dorst, L., Smeulders, A.W.M.: Discrete representation of straight lines. IEEE Trans. Pattern Anal. Mach. Intell. 6, 450–463 (1984)
Coeurjolly, D.: Supercover model and digital straight line recognition on irregular isothetic grids. In: Andrès, É., Damiand, G., Lienhardt, P. (eds.) DGCI 2005. LNCS, vol. 3429, pp. 311–322. Springer, Heidelberg (2005)
Berstel, J., De Luca, A.: Sturmian words, lyndon words and trees. Theoret. Comput. Sci. 178(1-2), 171–203 (1997)
Voss, K.: Discrete Images, Objects, and Functions in ℤn. Springer, Heidelberg (1993)
de Vieilleville, F., Lachaud, J.-O., Feschet, F.: Maximal digital straight segments and convergence of discrete geometric estimators. In: Kalviainen, H., Parkkinen, J., Kaarna, A. (eds.) SCIA 2005. LNCS, vol. 3540, pp. 988–997. Springer, Heidelberg (2005)
de Vieilleville, F., Lachaud, J.O., Feschet, F.: Maximal digital straight segments and convergence of discrete geometric estimators. Research Report 1350-05, LaBRI, University Bordeaux 1, Talence, France (2005)
Feschet, F.: Optimal time computation of the tangent of a discrete curve: Application to the curvature. In: Bertrand, G., Couprie, M., Perroton, L. (eds.) DGCI 1999. LNCS, vol. 1568, pp. 31–40. Springer, Heidelberg (1999)
Klette, R., Rosenfeld, A.: Digital Geometry - Geometric Methods for Digital Picture Analysis. Morgan Kaufmann, San Francisco (2004)
Debled-Rennesson, I.: Etude et reconnaissance des droites et plans discrets. PhD thesis, Université Louis Pasteur, Strasbourg, France (1995)
Feschet, F., Tougne, L.: On the min DSS problem of closed discrete curves. In: Del Lungo, A., Di Gesù, V., Kuba, A. (eds.) IWCIA. Electonic Notes in Discrete Math., vol. 12, Elsevier, Amsterdam (2003)
Lachaud, J.-O., Vialard, A., de Vieilleville, F.: Analysis and comparative evaluation of discrete tangent estimators. In: Andrès, É., Damiand, G., Lienhardt, P. (eds.) DGCI 2005. LNCS, vol. 3429, pp. 240–251. Springer, Heidelberg (2005)
Reiter-Doerksen, H., Debled-Rennesson, I.: Convex and concave parts of digital curves. In: Dagstuhl Seminar, Geometric Properties from Incomplete Data (2004)
Reveillès, J.P.: Géométrie discrète, calcul en nombres entiers et algorithmique. Thèse d’etat, Université Louis Pasteur, Strasbourg (1991)
Sivignon, I., Dupont, F., Chassery, J.-M.: New results about digital intersections. In: Nyström, I., Sanniti di Baja, G., Svensson, S. (eds.) DGCI 2003. LNCS, vol. 2886, pp. 102–113. Springer, Heidelberg (2003)
Sivignon, I.: De la caractérisation des primitives à la reconstruction polyédrique de surfaces en géométrie discrète. PhD thesis, Institut national polytechnique de Grenoble, France (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Vieilleville, F., Lachaud, JO. (2006). Revisiting Digital Straight Segment Recognition. In: Kuba, A., Nyúl, L.G., Palágyi, K. (eds) Discrete Geometry for Computer Imagery. DGCI 2006. Lecture Notes in Computer Science, vol 4245. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11907350_30
Download citation
DOI: https://doi.org/10.1007/11907350_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-47651-1
Online ISBN: 978-3-540-47652-8
eBook Packages: Computer ScienceComputer Science (R0)