Skip to main content

Robust Curvature Extrema Detection Based on New Numerical Derivation

  • Conference paper
Advanced Concepts for Intelligent Vision Systems (ACIVS 2008)

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

Abstract

Extrema of curvature are useful key points for different image analysis tasks. Indeed, polygonal approximation or arc decomposition methods used often these points to initialize or to improve their algorithms. Several shape-based image retrieval methods focus also their descriptors on key points. This paper is focused on the detection of extrema of curvature points for a raster-to-vector-conversion framework. We propose an original adaptation of an approach used into nonlinear control for fault-diagnosis and fault-tolerant control based on algebraic derivation and which is robust to noise. The experimental results are promising and show the robustness of the approach when the contours are bathed into a high level speckled noise.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Basseville, M., Nikiforov, I.V.: Detection of Abrupt Changes: Theory and Application. Prentice-Hall, Englewood Cliffs (1993)

    Google Scholar 

  2. Fliess, M., Join, C., Sira-Ramírez, H.: Non-linear estimation is easy. Int. J. Modelling Identification Control, T. 3 (2008), http://hal.inria.fr/inria-00158855/fr/

  3. Fliess, M., Sira-Ramírez, H.: Closed-loop parametric identification for continuous-time linear systems via new algebraic techniques. In: Garnier, H., Wang, L. (eds.) Continuous-Time Model Identification from Sampled Data. Springer, Berlin (2008), http://hal.inria.fr/inria-00114958/fr/

    Google Scholar 

  4. Kolesnikov, A.: Efficient algorithms for vectorization and polygonal approximation, Ph.D thesis, University of Joensu, Finland (2003)

    Google Scholar 

  5. Lavielle, M.: Using penalized contrasts for change-point problem. Signal Processing 85, 1501–1510 (2005)

    Article  MATH  Google Scholar 

  6. Mboup, M., Join, C., Fliess, M.: A revised look at numerical differentiation with an application to nonlinear feedback control. In: Proc. 15th Mediterrean Conf. Control Automation (MED 2007), Athènes (2007), http://hal.inria.fr/inria-00142588/fr/

  7. Mboup, M., Join, C., Fliess, M.: A delay estimation approach to change-point detection. In: Proc. 16th Mediterrean Conf. Control Automation (MED 2007), Ajaccio (2007), http://hal.inria.fr/inria-00179775/fr/

  8. Lee, J.-H., Chung, J.-W., Kim, J.-K.: Optimal vertex adjustement method using Viterbi algorithm for vertex-based shape coding. Electronics Letters 35 (1999)

    Google Scholar 

  9. Marji, M., Siy, P.: A new algorithm for dominant points detection and polygonization of digital curves. Pattern recognition 36 (2003)

    Google Scholar 

  10. Mikheev, A., Vincent, L., Faber, V.: High-Quality Polygonal Contour Approximation Based on Relaxation. In: International conference on document analysis and recognition (2001)

    Google Scholar 

  11. Perez, J.C., Vidal, E.: Optimum Polygonal Approximation of Digitized Curves. Pattern recognition letters 15(8) (1994)

    Google Scholar 

  12. Ray, B.K.: A New Split-and-merge Technique for Polygonal Approximation of Chain Coded Curves. Pattern recognition letters 16 (1995)

    Google Scholar 

  13. Röösli, M., Monagan, G.: Adding Geometric Constraints to the Vectorization of Line Drawings. In: Kasturi, R., Tombre, K. (eds.) Graphics Recognition 1995. LNCS, vol. 1072. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  14. Rosin, P.L.: Assessing the behaviour of polygonal approximation algorithms. Pattern recognition 36 (2004)

    Google Scholar 

  15. Song, J., Su, F., Tai, C.-L., Cai, S.: An Object-Oriented Progressive-Simplification Based Vectorization System for Engineering Drawings: Model, Algorithm, and Performance. IEEE Transactions on Pattern Analysis 24(8) (2002)

    Google Scholar 

  16. Tombre, K., Tabbone, S.: Vectorization in graphics recognition: to thin or not to thin. In: Proceedings of the 15th International Conference on Pattern Recognition, Barcelona, Spain, vol. 2 (2000)

    Google Scholar 

  17. Traver, V.J., Recatalá, G., Inesta, J.M.: Exploring the performance of genetic algorithms as polygonal approximators. In: International Conference on Pattern Recognition (2000)

    Google Scholar 

  18. Wu, W.-Y.: An adaptive method for detecting dominant points. Pattern Recognition 36(10) (2003)

    Google Scholar 

  19. Yin, P.-Y.: Algorithms for straight line fitting using K-means. Pattern recognition letters 19 (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Join, C., Tabbone, S. (2008). Robust Curvature Extrema Detection Based on New Numerical Derivation. In: Blanc-Talon, J., Bourennane, S., Philips, W., Popescu, D., Scheunders, P. (eds) Advanced Concepts for Intelligent Vision Systems. ACIVS 2008. Lecture Notes in Computer Science, vol 5259. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88458-3_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88458-3_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88457-6

  • Online ISBN: 978-3-540-88458-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics