Maximal Digital Straight Segments and convergence of discrete geometric estimators

Lecture Notes in Computer Science

Volumn 3540, Issue , 2005, Pages 988-997

  De Vieilleville, François ^a   Lachaud, Jacques Olivier ^a   Feschet, Fabien ^b  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b UNIVERSITÉ CLERMONT AUVERGNE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; CONVERGENCE OF NUMERICAL METHODS; IMAGE ANALYSIS; OPTICAL RESOLVING POWER; PATTERN RECOGNITION; PROBLEM SOLVING;

ASYMPTOTIC GROWTH; DIGITAL CONVEXITY; DISCRETE GEOMETRIC ESTIMATORS; MAXIMAL DIGITAL STRAIGHT SEGMENTS; RANDOM POLYTOPES;

ESTIMATION;

EID: 26444459801     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11499145_100     Document Type: Conference Paper

References (17)

1. Antal Balog and Imre Bárány. On the convex hull of the integer points in a disc. In SCG '91: Proceedings of the seventh annual symposium on Computational geometry, pages 162-165. ACM Press, 1991.
2. J. Berstel and A. De Luca. Sturmian words, lyndon words and trees. Theoret. Comput. Sci., 178(1-2):171-203, 1997.
3. D. Coeurjolly. Algorithmique et géométrie pour la caractérisation des courbes et des surfaces. PhD thesis, Université Lyon 2, Décembre 2002.
4. D. Coeurjolly and R. Klette. A comparative evaluation of length estimators of digital curves. IEEE Trans. on Pattern Anal. and Machine Intell., 26(2):252-257, 2004.
5. Chul E.Kim. Digital convexity, straightness, and convex polygons. IEEE Trans. on Pattern Anal. and Machine Intell., 6(6):618-626, 1982.
6. J.-O. Lachaud F. de Vieilleville and F. Feschet. Maximal digital straight segments and convergence of discrete geometric estimators. Research Report 1350-05, LaBRI, University Bordeaux 1, Talence, France, 2005.
7. F. Feschet and L. Tougne. Optimal time computation of the tangent of a discrete curve: application to the curvature. In Discrete Geometry and Computer Imagery (DGCI), volume 1568 of LNCS, pages 31-40. Springer Verlag, 1999.
8. F. Feschet. and L. Tougne. On the Min DSS Problem of Closed Discrete Curves. In A. Del Lungo, V. Di Gesù, and A. Kuba, editors, IWCIA, volume 12 of Electonic Notes in Discrete Math. Elsevier, 2003.
9. G.H. Hardy and E.M. Wright. An introduction to the theory of numbers. Oxford University Press, fourth edition, 1960.
10. A. S. Hayes and D. C. Larman. The vertices of the knapsack polytope. Discrete Applied Mathematics, 6:135-138, 1983.
11. R. Klette and J. Žunić. Multigrid convergence of calculated features in image analysis. Journal of Mathematical Imaging and Vision, 13:173-191, 2000.
12. V. Kovalevsky and S. Fuchs. Theoretical and experimental analysis of the accuracy of perimeter estimates. In Förster and Ruwiedel, editors, Proc. Robust Computer Vision, pages 218-242, 1992.
13. J.-O. Lachaud. On the convergence of some local geometric estimators on digitized curves. Research Report 1347-05, LaBRI, University Bordeaux 1, Talence, France, 2005.
14. J.-O. Lachaud, A. Vialard, and F. de Vieilleville. Analysis and comparative evaluation of discrete tangent estimators. In E. Andrès, G. Damiand, and P. Lienhardt, editors, Proc. Int. Conf. Discrete Geometry for Computer Imagery (DGCI'2005), Poitiers, France, LNCS. Springer, 2005. To appear.
15. J.-P. Réveillès. Géométrie discrète, calcul en nombres entiers et algorithmique. Thèse d'etat, Université Louis Pasteur, Strasbourg, 1991.
16. V. N. Shevchenko. On the number of extreme points in linear programming. Kibernetika, 2:133-134, 1981. In russian.
17. n. Springer-Verlag, 1993.