Skip to main content

Accurate Curvature Estimation along Digital Contours with Maximal Digital Circular Arcs

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 6636))

Abstract

We propose in this paper a new curvature estimator based on the set of maximal digital circular arcs. For strictly convex shapes with continuous curvature fields digitized on a grid of step h, we show that this estimator is mutligrid convergent if the discrete length of the maximal digital circular arcs grows in \(\Omega(h^{-\frac{1}{2}})\). We indeed observed this order of magnitude. Moreover, experiments showed that our estimator is at least as fast to compute as existing estimators and more accurate even at low resolution.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Coeurjolly, D., Miguet, S., Tougne, L.: Discrete curvature based on osculating circle estimation. In: Arcelli, C., Cordella, L.P., Sanniti di Baja, G. (eds.) IWVF 2001. LNCS, vol. 2059, pp. 303–312. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  2. Coeurjolly, D., Svensson, S.: Estimation of curvature along curves with application to fibres in 3D images of paper. In: Bigun, J., Gustavsson, T. (eds.) SCIA 2003. LNCS, vol. 2749, pp. 247–254. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. Esbelin, H.-A., Malgouyres, R.: Convergence of binomial-based derivative estimation for c2- noisy discretized curves. In: Brlek, S., Reutenauer, C., Provençal, X. (eds.) DGCI 2009. LNCS, vol. 5810, pp. 57–66. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  4. Feschet, F., Tougne, L.: 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)

    Chapter  Google Scholar 

  5. Fiorio, C., Mercat, C., Rieux, F.: Curvature estimation for discrete curves based on auto-adaptive masks of convolution. In: Barneva, R.P., Brimkov, V.E., Hauptman, H.A., Natal Jorge, R.M., Tavares, J.M.R.S. (eds.) CompIMAGE 2010. LNCS, vol. 6026, pp. 47–59. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  6. Fleischmann, O., Wietzke, L., Sommer, G.: A Novel Curvature Estimator for Digital Curves and Images. In: Goesele, M., Roth, S., Kuijper, A., Schiele, B., Schindler, K. (eds.) DAGM 2010. LNCS, vol. 6376, pp. 442–451. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  7. Gross, A., Latecki, L.: Digitizations preserving topological and differential geometric properties. Comput. Vis. Image Underst. 62(3), 370–381 (1995)

    Article  Google Scholar 

  8. Hermann, S., Klette, R.: A comparative study on 2d curvature estimators. In: Proc. ICCTA, pp. 584–589 (2007)

    Google Scholar 

  9. Kerautret, B., Lachaud, J.-O.: Curvature estimation along noisy digital contours by approximate global optimization. Pattern Recognition 42(10), 2265–2278 (2009)

    Article  MATH  Google Scholar 

  10. Klette, R., Rosenfeld, A.: Digital Geometry - Geometric Methods for Digital Picture. Morgan Kaufmann, San Francisco (2004)

    MATH  Google Scholar 

  11. Lachaud, J.-O., Vialard, A., de Vieilleville, F.: Fast, accurate and convergent tangent estimation on digital contours. Image and Vis. Comput. 25(10), 1572–1587 (2007)

    Article  Google Scholar 

  12. Liu, H., Latecki, L., Liu, W.: A unified curvature definition for regular, polygonal, and digital planar curves. Int. Jour. of Comput. Vis. 80, 104–124 (2008)

    Article  Google Scholar 

  13. Malgouyres, R., Brunet, F., Fourey, S.: Binomial convolutions and derivatives estimation from noisy discretizations. In: Coeurjolly, D., Sivignon, I., Tougne, L., Dupont, F. (eds.) DGCI 2008. LNCS, vol. 4992, pp. 370–379. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  14. Marji, M.: On the detection of dominant points on digital planar curves. PhD thesis, Wayne State University, Detroit, Michigan (2003)

    Google Scholar 

  15. Roussillon, T., Sivignon, I., Tougne, L.: On three constrained versions of the digital circular arc recognition problem. In: Brlek, S., Reutenauer, C., Provençal, X. (eds.) DGCI 2009. LNCS, vol. 5810, pp. 34–45. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  16. Vialard, A.: Geometrical parameters extraction from discrete paths. In: Miguet, S., Ubéda, S., Montanvert, A. (eds.) DGCI 1996. LNCS, vol. 1176, pp. 24–35. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  17. Worring, M., Smeulders, A.W.M.: Digital curvature estimation. CVGIP: Image Understanding 58(3), 366–382 (1993)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Roussillon, T., Lachaud, JO. (2011). Accurate Curvature Estimation along Digital Contours with Maximal Digital Circular Arcs. In: Aggarwal, J.K., Barneva, R.P., Brimkov, V.E., Koroutchev, K.N., Korutcheva, E.R. (eds) Combinatorial Image Analysis. IWCIA 2011. Lecture Notes in Computer Science, vol 6636. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21073-0_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21073-0_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21072-3

  • Online ISBN: 978-3-642-21073-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics