Skip to main content

A Shape-Based Retrieval Scheme for Leaf Images

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3767))

Abstract

Content-based image retrieval (CBIR) usually utilizes image features such as color, shape, and texture. For good retrieval performance, appropriate object features should be selected, well represented and efficiently evaluated for matching. If images have similar color or texture like leaves, shape-based image retrieval could be more effective than retrieval using color or texture. In this paper, we present an effective and robust leaf image retrieval system based on shape feature. For the shape representation, we revised the MPP algorithm in order to reduce the number of points to consider. Moreover, to improve the matching time, we proposed a new dynamic matching algorithm based on the Nearest Neighbor search method. We implemented a prototype system and performed various experiments to show its effectiveness. Its performance is compared with other methods including Centroid Contour Distance (CCD), Fourier Descriptor, Curvature Scale Space Descriptor (CSSD), Moment Invariants, and MPP. Experimental results on one thousand leaf images show that our approach achieves a better performance than other methods.

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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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. Gonzalez, R.C., Woods, R.C.: Digital Image Processing. Addison-Wesley, Reading (1992)

    Google Scholar 

  2. Lin, H.J., Kao, Y.T.: A prompt contour detection method. The Distributed Multimedia Systems (2001)

    Google Scholar 

  3. Heath, M., et al.: A Robust Visual Method for Assessing the Relative Performance of Edge Detection Algorithms. IEEE Transactions on Pattern Analysis and Machine Intelligence 19(12), 1338–1359 (1997)

    Article  Google Scholar 

  4. Sundar, H., Silver, D., Gagvani, N., Dickinson, S.: Skeleton based shape matching and retrieval. In: Shape Modeling International, p. 130 (2003)

    Google Scholar 

  5. Kurozumi, Y., Davis, W.A.: Polygonal approximation by the minimax method. In: Computer Vision, Graphics and Image Processing, pp. 248–264 (1982)

    Google Scholar 

  6. Sklansky, C., et al.: Minimum perimeter polygons of digitized silhouetts (1972)

    Google Scholar 

  7. Sklansky, J.: Finding the Convex Hull of a Simple Polygon. Pattern Recognition Letters 1(2), 79–84 (1982)

    Article  MATH  Google Scholar 

  8. Nishida, H.: Structural feature indexing for retrieval of partially visible shapes. Pattern Recognition 35(1), 55–67 (2002)

    Article  MATH  Google Scholar 

  9. Loncaeic, S.: A survey of shape analysis techniques. Pattern Recognition 31(8), 983–1001 (1998)

    Article  Google Scholar 

  10. Freeman, H., Saghri, J.: Comparative Analysis of Line Drawing Modelling Schemes. Computer Graphics and Image Processing 12 (1980)

    Google Scholar 

  11. Chang, C., Wenyin, L., Zhang, H.: Image Retrieval Based on Region Shape Similarity. In: Electronic Imaging Storage and Retrieval for Image and Video Databases (2001)

    Google Scholar 

  12. Veltkamp, R.: Shape matching: similarity measures and algorithms. Technical Report UU-CS-2001-03, Netherlands (2001)

    Google Scholar 

  13. Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: The 30 annual ACM symposium on Theory of computing, pp. 604–613 (1998)

    Google Scholar 

  14. Lee, C.B.: The Korea Plant Picture Book. Hang-moon-sa (1982), ISBN-8971871954

    Google Scholar 

  15. Petrakis, E., Diplaros, A., Milios, E.: Matching and Retrieval of Distorted and Occluded Shapes Using Dynamic Programming. IEEE Transactions on Pattern Analysis and Machine Intelligence 24(11), 1501–1516 (2002)

    Article  Google Scholar 

  16. Choi, W., Lam, K., Siu, W.: An adaptive active contour model for highly irregular boundaries. Pattern Recognition 34, 323–331 (2001)

    Article  MATH  Google Scholar 

  17. Alt, H., Behrends, B., Blomer, J.: Approximate matching of polygonal shapes. Ann. Math. Artif. Intell. 13, 251–266 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  18. Wang, Z., Chi, Z., Feng, D., Wang, Q.: Leaf Image Retrieval with Shape Features. In: Laurini, R. (ed.) VISUAL 2000. LNCS, vol. 1929, pp. 477–487. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  19. Mokhtarian, F., Abbasi, S.: Matching Shapes with Self-Intersections: Application to Leaf Classification. IEEE Transactions on Image Processing 13(5), 653–661 (2004)

    Article  Google Scholar 

  20. The MathWorks - MATLAB and Simulink for Technical Computing, http://www.mathworks.com

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

Nam, Y., Hwang, E. (2005). A Shape-Based Retrieval Scheme for Leaf Images. In: Ho, YS., Kim, H.J. (eds) Advances in Multimedia Information Processing - PCM 2005. PCM 2005. Lecture Notes in Computer Science, vol 3767. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11581772_77

Download citation

  • DOI: https://doi.org/10.1007/11581772_77

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30027-4

  • Online ISBN: 978-3-540-32130-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics