Abstract

Plant leaf segmentation has a very important role in most plant identification methods. Tree leaves segmentation in images with complex background is very difficult when there is no prior information about the leaves and backgrounds. In practice, the parameters of unsupervised image segmentation algorithms must be set for each image to get the best results. In this paper, to overcome this problem, fusion of the results of five leaf segmentation algorithms (fuzzy c-means, SOM and k-means in various color spaces or different parameters) is applied. To fuse the results of these segmentations, new equations for mutual information (g-mutual information equations) based on the g-calculus are introduced to find the best consensus segmentation. The results of the mentioned primary clustering algorithms are considered as a new feature vector for each pixel. To reduce the time complexity, a fast method is employed using truth table containing different feature vectors. To evaluate this new approach, a leaf image database with natural scenes, taken from Pl@ntLeaves database, is generated to have different positions and orientations. In addition, a widely used database is used to compare the proposed method with other methods. The experimental results presented in this paper show that the use of g-calculus in fusion of image segmentations improves the evaluation parameters.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call