Skip to main content

Contour Regularity Extraction Based on String Edit Distance

  • Conference paper
  • 1729 Accesses

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

Abstract

In this paper, we present a new method for constructing prototypes representing a set of contours encoded by Freeman Chain Codes. Our method build new prototypes taking into account similar segments shared between contours instances. The similarity criterion was based on the Levenshtein Edit Distance definition. We also outline how to apply our method to reduce a data set without sensibly affect its representational power for classification purposes. Experimental results shows that our scheme can achieve compressions about 50% while classification error increases only by 0.75%.

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. Duta, N., Sonka, M., Jain, A.: Learning Shape Models from Examples Using Automatic Shape Clustering and Procrustes Analysis. In: Information Processing in Medical Imaging. LNCS, vol. 1613, pp. 370–375 (2008)

    Google Scholar 

  2. Jiang, X., Abegglen, K., Bunke, H., Csirik, J.: Dynamic computation of generalised median strings. Journal Pattern Analysis and Applications 6, 185–193 (2003)

    Article  MathSciNet  Google Scholar 

  3. Jiang, X., Schiffmann, L., Bunke, H.: Computation of median shapes. In: 4th Asian Conference on Computer Vision (2000)

    Google Scholar 

  4. Cárdenas, R.: A Learning Model for Multiple-Prototype Classification of Strings. In: 17th International Conference on Pattern Recognition, vol. 4, pp. 420–442 (2004)

    Google Scholar 

  5. Wagner, R., Fischer, M.: The String-to-String Correction Problem. Journal of the ACM 21, 168–173 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  6. Freeman, H.: Computer Processing of Line-Drawing Data. Computer Surveys 6, 57–96 (1974)

    Article  MATH  Google Scholar 

  7. Chikkerur, S., Wu, C., Govindaraju, V.: A Systematic Approach for Feature Extraction in Fingerprint Images. In: Zhang, D., Jain, A.K. (eds.) ICBA 2004. LNCS, vol. 3072, pp. 344–350. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  8. Govindaraju, V., Shi, Z., Schneider, J.: Feature Extraction Using a Chaincoded Contour Representation of Fingerprint Images. In: AVBPA, pp. 268–275 (2003)

    Google Scholar 

  9. Duta, N., Jain, A., Dubuisson-Jolly, M.: Automatic Construction of 2D Shape Models. IEEE Transactions on Pattern Analysis and Machine Intelligence 23, 433–446 (2001)

    Article  Google Scholar 

  10. Rico-Juan, J.R., Mico, L.: Comparison of AESA and LAESA search algorithms using string and tree-edit-distances. Pattern Recognition Letters 24, 1417–1426 (2003)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Abreu Salas, J.I., Rico-Juan, J.R. (2009). Contour Regularity Extraction Based on String Edit Distance. In: Araujo, H., Mendonça, A.M., Pinho, A.J., Torres, M.I. (eds) Pattern Recognition and Image Analysis. IbPRIA 2009. Lecture Notes in Computer Science, vol 5524. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02172-5_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02172-5_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02171-8

  • Online ISBN: 978-3-642-02172-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics