Skip to main content
SpringerLink
Log in

Graph Cuts-Based Feature Extraction of Plant Leaf

  • Conference paper
  • First Online:
Practical Applications of Intelligent Systems

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 279))

  • 1224 Accesses

Abstract

As leaf is one of the most important organs in a plant, contour features of plant leaves are important for the identification of plant species. So researchers have proposed many methods to improve the progress of the plant identification. In this paper, we present a graph cuts-based method using Min-Cut/Max Flow algorithm to obtain the leaf blade section. Then, five basic features are computed to further obtain six digital morphological features. These experimental results show that the graph cuts algorithm and the presented leaf features are important for leaf recognition.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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

References

  1. Fu H, Chi Z (2006) Combined thresholding and neural network approach for vein pattern extraction from leaf images. IEE Proc Vis Image Signal Process 153:881–892

    Article  Google Scholar 

  2. Daly DC, Hickey LJ, Johnson KR, Mitchell JD, Wilf P, Wing SL (2009) Manual of leaf architecture. CABI, Anderson

    Google Scholar 

  3. Du JX, Wang XF, Zhang GJ (2007) Leaf shape based plant species recognition. Appl Math Comput 185(2):883–893

    Article  MATH  Google Scholar 

  4. Ye Y, Chen C, Li CT, Fu H, Chi Z (2004) A computerized plant species recognition system. In: IEEE proceedings of 2004 international symposium on intelligent multimedia, video and speech processing, 2004 pp 723–726

    Google Scholar 

  5. Baker B, Olszyk DM, Tingey D (1996) Digital image analysis to estimate leaf area. J Plant Physiol 148:530–535

    Article  Google Scholar 

  6. Chien CF, Lin TT (2002) Leaf area measurement of selected vegetable seedlings using elliptical Hough transform. Trans ASAE 45(5):1669–1677

    Google Scholar 

  7. Hiroyoshi I, Hirohisa N, Seishi N (2002) Diallel analysis of leaf shape variations of citrus varieties based on elliptic Fourier descriptors. Breed Sci 52:89–94

    Article  Google Scholar 

  8. Eriksson AP, Barr O, Astrom K (2006) Image segmentation using minimal graph cuts. Published at: Swedish symposium on image. http://www.maths.lth.se/vision/publdb/reports/pdf/eriksson-barretal-ssia-06.pdf

  9. Zhou H, Zheng J, Wei L (2013) Texture aware image segmentation using graph cuts and active contours. Pattern Recogn 46(6):1719–1733

    Article  MATH  Google Scholar 

  10. Zheng Q, Dong E, Cao Z, Sun W, Li Z (2013) Modified localized graph cuts based active contour model for local segmentation with surrounding nearby clutter and intensity inhomogeneity. Signal Process 93(4):961–966

    Article  Google Scholar 

  11. Yang Y, Han S, Wang T, Tao W, Tai X (2013) Multilayer graph cuts based unsupervised color-texture image segmentation using multivariate mixed student’s t-distribution and regional credibility merging. Pattern Recogn 46(4):1101–1124

    Article  MATH  Google Scholar 

  12. Kim D, Paik J (2012) Automatic moving object segmentation using histogram-based graph cut and label maps. Electron Lett 48(19):1198–1199

    Article  Google Scholar 

  13. Dinic EA (1970) Algorithm for solution of a problem of maximum flow in networks with power estimation. Soviet Math Dokl 11:1277–1280

    Google Scholar 

  14. Yuri B, Vladimir K (2004) An experimental comparison of min-cut/max-flow Algorithms for energy minimization in vision. IEEE Trans Pattern Anal Mach Intell 26(9):1124–1137

    Article  Google Scholar 

  15. Boykov Y, Gareth FL (2006) Graph cuts and efficient N-D image segmentation. Int J Comput Vision 70(2):109–131

    Article  Google Scholar 

  16. Peng B, Zhang L, Zhang D (2013) A survey of graph theoretical approaches to image segmentation. Pattern Recogn 46(3):1020–1038

    Article  Google Scholar 

  17. Yuri B, Olga V, Ramin Z (2001) Efficient approximate energy minimization via graph Cuts. IEEE Trans PAMI 20(12):1222–1239

    Google Scholar 

  18. Vladimir K, Ramin Z (2004) What energy functions can be minimized via graph cuts? IEEE Trans Pattern Anal Mach Intell 26(2):147–159

    Article  Google Scholar 

Download references

Acknowledgment

The work reported in this paper was supported by Jinhua Polytechnic under the research grant 2011S002, and the Talent Start-up Foundation of Zhejiang A&F University under grant No. 2013FR059.

Author information

Authors and Affiliations

  1. Jinhua Polytechnic, Jinhua, 321007, China

    Feng-hua Lv

  2. Tianmu College, Zhejiang A&F University, Lin’an, 311300, China

    Hang-jun Wang

Authors
  1. Feng-hua Lv
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hang-jun Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hang-jun Wang .

Editor information

Editors and Affiliations

  1. College of Computer and Software Engineering, Shenzhen University, Shenzhen, China

    Zhenkun Wen

  2. School of Information Science and Technology, Southwest Jiaotong University, Chengdu, China

    Tianrui Li

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lv, Fh., Wang, Hj. (2014). Graph Cuts-Based Feature Extraction of Plant Leaf. In: Wen, Z., Li, T. (eds) Practical Applications of Intelligent Systems. Advances in Intelligent Systems and Computing, vol 279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54927-4_89

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-54927-4_89

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-54926-7

  • Online ISBN: 978-3-642-54927-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation