Medicinal leaves carry a huge value and importance in the medical field which can be directly used or medicines are made for medicinal purposes to cure patients. With the variety of leaves present, the proper identification of the leaves is very difficult without prior knowledge and experience. Computer Vision can bring the accurate identification of such leaves using the various feature extraction techniques using leaf images. The aim is to build a methodology using various feature extraction techniques to extract features, clustering algorithm to cluster the features and decision trees as a classifier. Feature extraction techniques like SIFT key descriptors which are robust and provide matching in spite of the change in intensity, size or rotation of the object in the images. Effective corner points are chosen from the image from which magnitude and orientation of surrounding are used to build descriptor that is the vector of feature for each corner points. For clustering the data, various partitional, hierarchical, density based methods are used to cluster the data which cluster the data with respect to inter-connectivity, similarity, closeness, etc. The clusters data is used to build the decision tree like C4.5 and CART which uses entropy and Gini index as the splitting criteria. All these methodologies put together to form an effective method to efficiently recognize the unknown leaf image using trained model.

SIFT Corner points, Chameleon Clustering, Decision Tree Classifier

[1 ] D. Lowe, “Object recognition from local scale-invariant features”, Proceedings of the International Conference on Computer Vision. pp. 1150-1157. 1999.
[2] D. G. Lowe, “Distinctive image features from scale-invariant key points”, International Journal of Computer Vision, November 2004, Vol 60, Issue 2, pp 91–110
[3] Karypis, George, Eui-Hong Han, and Vipin Kumar, "Chameleon: Hierarchical clustering using dynamic modeling." Computer, Vol: 32, Issue. 8, pp 68-75, Aug 1999
[4] Hendrickson, Bruce, and Robert W. Leland, "A Multi-Level Algorithm For Partitioning Graphs”, 95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing, Article No. 28, San Diego, California, USA — December 04 - 08, 1995
[5] Karypis, George, Kirk Schloegel, and Vipin Kumar, "Parmetis: Parallel graph partitioning and sparse matrix ordering library", Version 1.0, Dept. of Computer Science, University of Minnesota (1997)
[6] Karypis, George, and Vipin Kumar, "A Coarse-Grain Parallel Formulation of Multilevel k-way Graph Partitioning Algorithm", Eighth SIAM Conference on Parallel Processing for Scientific Computing PPSC 1997
[7] Quinlan, J. Ross, "Bagging, boosting, and C4. 5", Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, AAAI 96, IAAI 96, Portland, Oregon, August 4-8, 1996, Volume 1.
[8] Quinlan, J. Ross, "Improved use of continuous attributes in C4. 5" Journal of Artificial Intelligence Research archive, Volume 4 Issue 1, January 1996, pp 77-90
[9] Peng, Wei, Juhua Chen, and Haiping Zhou, "An implementation of ID3-decision tree learning algorithm" From web. arch. usyd. edu. au/wpeng/DecisionTree2. pdf Retrieved date: May 13 (2009).
[10] Hssina, Badr, et al, "A comparative study of decision tree ID3 and C4. 5", International Journal of Advanced Computer Science and Applications 4.2 (2014): pp13-19.
[11] Bradski, Gary, and Adrian Kaehler, “ Learning OpenCV: Computer vision with the OpenCV library", O’Reilly Media, Inc.", 2008.
[12] Quinlan, J. Ross, "Induction of decision trees", Machine learning 1.1 (1986):pp 81-106.
[13] Dashora, Rajnish, Harsh Bajaj, and Akshat Dube, "Parallel Algorithm for the Chameleon Clustering Algorithm using Dynamic Modeling",International Journal of Computer Applications (0975 – 8887),Volume 79 – No8, October 2013
[14] Agrawal, Gaurav L., and Hitesh Gupta,"Optimization of C4. 5 decision tree algorithm for data mining application", International Journal of Emerging Technology and Advanced Engineering, Volume 3, Issue 3, March 2013, pp: 341-345.
[15] Singh, Sonia, and Priyanka Gupta, "Comparative study ID3, cart and C4. 5 decision tree algorithm: a survey", International Journal of Advanced Information Science and Technology (IJAIST),ISSN: 2319:2682 Vol.27, No.27, July 2014, pp: 97-103
[16] Wu, Xindong, et al, "Top 10 algorithms in data mining", Knowledge and information systems 14.1 (2008), pp:1-37.
[17] Kernighan, Brian W., and Shen Lin, "An efficient heuristic procedure for partitioning graphs", The Bell system technical journal 49.2 (1970), pp:291-307
[18] Quinlan, J. Ross, “C4. 5: programs for machine learning”, Morgan Kaufmann Publishers, Inc., 1993