Abstract
An interesting property for curve length digital estimators is the convergence toward the continuous length and the associate convergence speed when the digitization step h tends to 0. On the one hand, it has been proved that the local estimators do not verify this convergence. On the other hand, DSS and MLP based estimators have been proved to converge but only under some convexity and smoothness or polygonal assumptions. In this frame, a new estimator class, the so called semi-local estimators, has been introduced by Daurat et al. in [4]. For this class, the pattern size depends on the resolution but not on the digitized function. The semi-local estimator convergence has been proved for functions of class \(\mathcal{C}^2\) with an optimal convergence speed that is a \(\mathcal{O}(h^{\frac 1 2})\) without convexity assumption (here, optimal means with the best estimation parameter setting). A semi-local estimator subclass, that we call sparse estimators, is exhibited here. The sparse estimators are proved to have the same convergence speed as the semi-local estimators under the weaker assumptions. Besides, if the continuous function that is digitized is concave, the sparse estimators are proved to have an optimal convergence speed in h. Furthermore, assuming a sequence of functions \(G_h\colon h\mspace{1.0mu}\mathbb{Z} \to h\mspace{1.0mu}\mathbb{Z}\) discretizing a given Euclidean function as h tends to 0, sparse length estimation computational complexity in the optimal setting is a \(\mathcal{O}(h^{-\frac{1}{2}})\).
This work was supported by the Agence Nationale de la Recherche through contract ANR-2010-BLAN-0205-01.
Chapter PDF
References
Asano, T., Kawamura, Y., Klette, R., Obokata, K.: Minimum-length polygons in approximation sausages. In: Arcelli, C., Cordella, L.P., Sanniti di Baja, G. (eds.) IWVF 2001. LNCS, vol. 2059, pp. 103–112. Springer, Heidelberg (2001)
Coeurjolly, D.: Algorithmique et géométrie discrète pour la caractérisation des courbes et des surfaces. Ph.D. thesis, Université Lyon 2 (2002)
Coeurjolly, D., Klette, R.: A comparative evaluation of length estimators of digital curves. IEEE Trans. Pattern Anal. Mach. Intell. 26(2), 252–257 (2004)
Daurat, A., Tajine, M., Zouaoui, M.: Les estimateurs semi-locaux de périmètre. Tech. rep., LSIIT CNRS, UMR 7005, Université de Strasbourg (2011), http://hal.inria.fr/hal-00576881
Daurat, A., Tajine, M., Zouaoui, M.: Patterns in discretized parabolas and length estimation. In: Brlek, S., Reutenauer, C., Provençal, X. (eds.) DGCI 2009. LNCS, vol. 5810, pp. 373–384. Springer, Heidelberg (2009)
De Vieilleville, F., Lachaud, J.O., Feschet, F.: Convex digital polygons, maximal digital straight segments and convergence of discrete geometric estimators. Journal of Mathematical Imaging and Vision 27(2), 139–156 (2007)
Debled-Rennesson, I., Reveillès, J.P.: A linear algorithm for segmentation of digital curves. International Journal of Pattern Recognition and Artificial Intelligence 09(04), 635–662 (1995)
Dorst, L., Smeulders, A.W.: Discrete straight line segments: parameters, primitives and properties. In: Vision Geometry: Proceedings of an AMS Special Session Held October 20-21, 1989,[at Hoboken, New Jersey], vol. 119, pp. 45–62 (1991)
Freeman, H.: On the encoding of arbitrary geometric configurations. IRE Transactions on Electronic Computers EC-10(2), 260–268 (1961)
Klette, R., Rosenfeld, A.: Digital Geometry. Morgan Kaufmann (2004)
Klette, R., Žunić, J.: Multigrid convergence of calculated features in image analysis. Journal of Mathematical Imaging and Vision 13(3), 173–191 (2000)
Kovalevsky, V.: New definition and fast recognition of digital straight segments and arcs. In: Proceedings of the 10th International Conference on Pattern Recognition, vol. ii, pp. 31–34 (1990)
Kulkarni, S.R., Mitter, S.K., Richardson, T.J., Tsitsiklis, J.N.: Local versus nonlocal computation of length of digitized curves. IEEE Trans. Pattern Anal. Mach. Intell. 16(7), 711–718 (1994)
Lachaud, J.O.: Espaces non-euclidiens et analyse d’ image: modèles déformables riemanniens et discrets, topologie et géométrie discrète. Habilitation á diriger des recherches, Université de Bordeaux 1 (Décembre 2006)
Mazo, L., Baudrier, E.: About multigrid convergence of some length estimators (extended version). Tech. rep., ICube, University of Strasbourg, CNRS (2014), http://hal.inria.fr/hal-00990694
Sloboda, F., Zatko, B., Stoer, J.: On approximation of planar one-dimensional continua. In: Advances in Digital and Computational Geometry, pp. 113–160 (1998)
Tajine, M., Daurat, A.: On local definitions of length of digital curves. In: Nyström, I., Sanniti di Baja, G., Svensson, S. (eds.) DGCI 2003. LNCS, vol. 2886, pp. 114–123. Springer, Heidelberg (2003)
Tajine, M., Daurat, A.: Patterns for multigrid equidistributed functions: Application to general parabolas and length estimation. Theoretical Computer Science 412(36), 4824–4840 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Mazo, L., Baudrier, É. (2014). About Multigrid Convergence of Some Length Estimators. In: Barcucci, E., Frosini, A., Rinaldi, S. (eds) Discrete Geometry for Computer Imagery. DGCI 2014. Lecture Notes in Computer Science, vol 8668. Springer, Cham. https://doi.org/10.1007/978-3-319-09955-2_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-09955-2_18
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09954-5
Online ISBN: 978-3-319-09955-2
eBook Packages: Computer ScienceComputer Science (R0)