Skip to main content

Comparing String Representations and Distances in a Natural Images Classification Task

  • Conference paper
Graph-Based Representations in Pattern Recognition (GbRPR 2005)

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

Abstract

This paper shows how strings can be used in a natural images classification task. We propose to build an attributed string from a set of regions of interest detected thanks to an interest point detector. These salient zones are characterized by local signatures describing singularities and they are linked by using graph seriation algorithms and perceptual methods. Once each image is represented by a string of signatures, we propose to use string-based edit distances and an ordered histograms-based distance in order to perform the classification task. Experiments have shown that whereas seriation algorithms give approximately the same results, the ordered histogram based distance is more efficient for the considered application.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Atkins, J.E., Boman, E.G., Hendrickson, B.: A Spectral Algorithm for Seriation and the Consecutive Ones Problem. SIAM Journal on Computing 28(1), 297–310 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bres, S., Jolion, J.M.: Detection of Interest Points for Image Indexation. In: 3rd Int. Conf. on Visual Information Systems, pp. 427–434 (1999)

    Google Scholar 

  3. Gouet, V., Boujeema, N.: Object-based queries using color points of interest. In: IEEE Workshop on Content-Based Access of Image and Video Libraries, December 2001, pp. 30–36 (2001)

    Google Scholar 

  4. Hancock, E.R., Vento, M.: Graph Matching Using Spectral Seriation and String Edit Distance. In: Hancock, E.R., Vento, M. (eds.) GbRPR 2003. LNCS, vol. 2726. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  5. Harris, C., Stephens, M.: A Combined Corner and Edge Detector. In: 4th Alvey Vision Conference, 1988, pp. 147–151 (1988)

    Google Scholar 

  6. Jolion, J.M., Simand, I.: Representation d’Images par des Chaines de Symboles: Application à l’Indexation d’Images. In: COmpression et REprésentation des Signaux Audiovisuels, french workshop (2004)

    Google Scholar 

  7. Laurent, C., Laurent, N., Visani, M.: Color Image Retrieval Based on Wavelet Salient Features Detection. In: 3rd Int. Workshop on Content-Based Multimedia Indexing, pp. 327–334 (2003)

    Google Scholar 

  8. Levenstein, A.: Binary Codes Capable of Correcting Deletions, Insertions and Reversals. Soviet Phys. Dokl. 10, 707–710 (1966)

    MathSciNet  Google Scholar 

  9. Loupias, E., Sebe, N., Bres, S., Jolion, J.M.: Wavelet-based Salient Points for Image Retrieval. In: IEEE Int. Conf. on Image Processing, pp. 518–521 (2000)

    Google Scholar 

  10. Mallat, S.: Theory for Multiresolution Signal Decomposition: The Wavelet Representation. IEEE Transactions on Pattern Analysis and Machine Intelligence 11(7), 674–693 (1989)

    Article  MATH  Google Scholar 

  11. Manjunath, B.S., Ma, W.Y.: Texture features for browsing and retrieval of image data. IEEE Transactions on Pattern Analysis and Machine Intelligence 18(8), 837–842 (1996)

    Article  Google Scholar 

  12. Marzal, A., Vidal, E.: Computation of normalized edit distance and applications. IEEE Transactions on Pattern Analysis and Machine Intelligence 19(9), 926–932 (1993)

    Article  Google Scholar 

  13. Ros, J., Laurent, C.: Natural Image Classification Using Foveal Strings. In: The International Workshop on Multidisciplinary Image, Video, and Audio Retrieval and Mining (October 2004)

    Google Scholar 

  14. Schmid, C., Mohr, R.: Local Grayvalue Invariants for Image Retrieval. IEEE Transactions on Pattern Analysis and Machine Intelligence 19(5), 530–535 (1997)

    Article  Google Scholar 

  15. Shapiro, J.M.: Embedded Image Coding Using Zerotrees of Wavelet Coefficients. IEEE Transactions on Signal Processing 41(12), 3445–3462 (1993)

    Article  MATH  Google Scholar 

  16. Swain, M.J., Ballard, D.H.: Color Indexing. International Journal on Computer Vision 7(1), 11–38 (1991)

    Article  Google Scholar 

  17. Vidal, E., Marzal, A., Aibar, P.: Fast Computation of Normalized Edit Distances. IEEE Transactions on Pattern Analysis and Machine Intelligence 17(9), 899–902 (1995)

    Article  Google Scholar 

  18. Wagner, R.A., Fischer, M.J.: The String-to-String Correction Problem. Journal of the Association for Computing Machinery 21(1), 168–173 (1974)

    MATH  MathSciNet  Google Scholar 

  19. Wei, J.: Markov Edit Distance. IEEE Transactions on Pattern Analysis and Machine Intelligence 26(3), 311–321 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ros, J., Laurent, C., Jolion, JM., Simand, I. (2005). Comparing String Representations and Distances in a Natural Images Classification Task. In: Brun, L., Vento, M. (eds) Graph-Based Representations in Pattern Recognition. GbRPR 2005. Lecture Notes in Computer Science, vol 3434. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31988-7_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31988-7_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25270-2

  • Online ISBN: 978-3-540-31988-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics