International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 42 - Number 17 |
Year of Publication: 2012 |
Authors: R. S. Sabeenian, M. E. Paramasivam, P. M. Dinesh |
10.5120/5788-8041 |
R. S. Sabeenian, M. E. Paramasivam, P. M. Dinesh . Identification and Counting of Fertile Pollen Grains using Morphological operators, FSF and CGF. International Journal of Computer Applications. 42, 17 ( March 2012), 36-40. DOI=10.5120/5788-8041
The pollen grain in a plant is apart used to transport the male gamete (i. e. male DNA) to the female part of a flower. There are two types of pollen grains-fertile and sterile. Only the fertile pollen grains provide good yield. The scope of the work is to identify the fertile pollen grains using Morphological operators along with FSF and CGF. This identification can be done using two approaches-based on intensity and size variation. The Proposed work mainly focuses on the identification of fertile pollen grains based on size variation. When we look into the pollen images, the fertile ones appear larger than the sterile. Thus, by finding the size of each pollen grain we can differentiate the fertile and sterile pollen grains. In order to find the size of the pollen grains we go in for approximate radius calculation. We have developed a Graphical User Interface using MATLAB for identification and counting of the fertile pollen grains which can be used in research centers