Improved Tree Leaves Segmentation Using Hybrid GAC Approach

Nivasini.R.P*, S. Thilagamani**
* PG Scholar, Department of Computer Science and Engineering, M. Kumarasamy College of Engineering (Autonomous), Karur, India.
** Dean, Department of Computer Science and Engineering, M. Kumarasamy College of Engineering (Autonomous), Karur, India.
Periodicity:December - February'2016
DOI : https://doi.org/10.26634/jpr.2.4.5945

Abstract

Leaves are one of the important parts in a tree. Extracting accurately the shape of a leaf is a crucial step in image-based systems. The partial or total absence of textures on leaf surface and the high color variability of leaves belonging to the same species make shape as the main recognition element. For such reasons, leaf segmentation plays a decisive role in the leaf extraction process. Even though many general segmentation methods have been proposed in the last decades, leaf segmentation presents specific challenges. In particular, a pixel-level precision is required in order to highlight fine scale boundary structures and discriminate similar global shapes. The authors propose a robust and accurate method for segmenting objects acquired under various controlled conditions. Then, they have improved the performance of the segmentation methods using preprocessing tools such as, color distance map and input strokes. Based on these methods, we can eliminate unwanted boundaries and localize the leaf object efficiently. They have implemented a Hybrid Guided Active Contour (GAC) method to measure geometric properties of leaf images, and have provided with a comparative study for various segmentation algorithms based on performance metrics. Based on experimental results, GAC provides improved performance in leaf datasets.

Keywords

Active Contour, Color Distances, Leave Segmentation, Leaf Surface, Leave Strokes.

How to Cite this Article?

Nivasini, R. P., and Thilagamani, S. (2016). Improved Tree Leaves Segmentation Using Hybrid GAC Approach. i-manager’s Journal on Pattern Recognition, 2(4), 18-25. https://doi.org/10.26634/jpr.2.4.5945

References

[1]. R. Achanta, A. Shaji, K. Smith, A. Lucchi, P. Fua, and S. Süsstrunk, (2012). “SLIC superpixels compared to state-ofthe- art superpixel methods”. IEEE Trans. Pattern Anal. Mach. Intell., Vol.34, No.11, pp.2274-2282.
[2]. P. Brigger, J. Hoeg, and M. Unser, (2000). “B-spline snakes: A flexible tool for parametric contour detection”. IEEE Trans. Image Process., Vol.9, No.9, pp.1484-1496.
[3]. J. Canny, (1986). “A computational approach to edge detection”. IEEE Trans. Pattern Anal. Mach. Intell., Vol.8, No.6, pp.679-698.
[4]. D. Casanova, J. B. Florindo, W. N. Gonçalves, and O. M. Bruno, (2012). “IFSC/USP at ImageCLEF 2012: Plant identification task”. Proc. Eval. Labs Workshop, Online Working Notes, pp.1-7.
[5]. G. Cerutti, L. Tougne, J. Mille, A. Vacavant, and D. Coquin, (2013). “Understanding leaves in natural images-A model-based approach for tree species identification”. Comput. Vis. Image Understand., Vol.117, No.10, pp.1482-1501.
[6]. T. F. Chan and L. A. Vese, (2001). “Active contours without edges”. IEEE Trans. Image Process., Vol.10, No.2, pp.266-277.
[7]. Y. Cheng, (1995). “Mean shift, mode seeking, and clustering”. IEEE Trans. Pattern Anal. Mach. Intell., Vol.17, No.8, pp.790-799.
[8]. D. Comaniciu and P. Meer, (2002). “Mean shift: A robust approach toward feature space analysis”. IEEE Trans. Pattern Anal. Mach. Intell., Vol.24, No.5, pp.603- 619.
[9]. C. Couprie, L. Najman, L. Grady, and H. Talbot, (2009). “Power watersheds: A new image segmentation framework extending graph cuts, randomwalker and th optimal spanning forest”. Proc. IEEE 12 Int. Conf. Comput. Vis., pp.731-738.
[10]. P. F. Felzenszwalb and D. P. Huttenlocher, (2004). “Efficient graph-based image segmentation”. Int. J. Comput. Vis., Vol.59, No.2, pp.167-181.
[11]. H. Goëau et al., (2011). “The CLEF 2011 plant images classification task”. Image CLEF 2011 Working Notes.
[12]. J. Horvath, (2006). “Image segmentation using fuzzy c-means”. Proc. Symp. Appl. Mach. Intell., pp.144-151.
[13]. J. Shi and J. Malik, (2000). “Normalized cuts and image segmentation”. IEEE Trans. Pattern Anal. Mach. Intell., Vol.22, No.8, pp.888-905.
[14]. A. Karsnas, R. Strand, and P. K. Saha, (2012). “The st vectorial minimum barrier distance”. Proc. 21 Int. Conf. Pattern Recognit., pp.792-795.
[15]. M. Kass, A. Witkin, and D. Terzopoulos, (1988). “Snakes: Active contour models”. Int. J. Comput. Vis., Vol.1, No.4, pp.321-331.
[16]. A. M. Khan and S. Ravi, (2013). “Image segmentation methods: A comparative study”. Int. J. Soft Comput. Eng., Vol.3, No.4, pp.84-92.
[17]. N. Kumar et al., (2012). “Leafsnap: A computer vision system for automatic plant species identification”. Proc. Eur. Conf. Comput. Vis., pp.502-516.
[18]. M. Lynch, O. Ghita, and P. F. Whelan, (2006). “Automatic segmentation of the left ventricle cavity and myocardium in MRI data”. Comput. Biol. Med., Vol.36, No.4, pp.389-407.
[19]. J. Weber, S. Lefevre, and P. Gancarski, (2011). “Interactive video segmentation based on quasi-flat zones”. Proc. 7 Int. Symp. Image Signal Process.Anal., pp.265-270.
[20]. N. Valliammal and S. N. Geethalakshmi, (2012). “Plant leaf segmentation using non linear K means clustering”. Int. J. Comput. Sci. Issues, Vol.9, No.3, pp.212- 218.
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.