A Generic Algorithm for Segmenting a Specified Region of Interest Based on Chanvese’s Algorithm and Active Contours

Image processing and recognition is a modern field which is gaining popularity due to its capability to automate certain mundane object recognition tasks and provide unparalleled accuracy and precision. Computer graphics have evolved sufficiently so as to cater to a wide array of applications ranging from categorizing mechanical parts of a machine to identify foreign objects/tumors inside the human body [1]. In this particular application, we are working toward identifying cotton plants from a heap. Traditionally, this task has been performed by laborers who identify the cotton plants from a collection and classify them based on certain characteristics. This task can take anywhere from a day to a week depending upon how good the yield is. We propose that this entire task from identifying cotton to classifying it based on the prerequisite characteristics can be performed automatically. We have developed an algorithm that can provide the exact position of cotton buds from pictures of the harvested plant. From the hardware aspect, this is the scope of automating the harvesting task. We have used the techniques of image acquisition, segmentation, and feature extraction. A highly modified iterative version of Chanvese’s algorithm is utilized to chalk out a starting boundary (contour) and then work successively on it to reach at a final segment that defines the cotton buds.

[1]  Wooi-Nee Tan,et al.  Petals' shape descriptor for blooming flowers recognition , 2012, Digital Image Processing.

[2]  Agma J. M. Traina,et al.  An Efficient Algorithm for Fractal Analysis of Textures , 2012, 2012 25th SIBGRAPI Conference on Graphics, Patterns and Images.

[3]  Andrew Zisserman,et al.  Automated Flower Classification over a Large Number of Classes , 2008, 2008 Sixth Indian Conference on Computer Vision, Graphics & Image Processing.

[4]  Takeshi Saitoh,et al.  Automatic recognition of blooming flowers , 2004, ICPR 2004.

[5]  Shamik Sural,et al.  Segmentation and histogram generation using the HSV color space for image retrieval , 2002, Proceedings. International Conference on Image Processing.

[6]  Edward M. Riseman,et al.  Indexing Flower Patent Images Using Domain Knowledge , 1999, IEEE Intell. Syst..

[7]  Pong C. Yuen,et al.  Tongue image matching using color content , 2002, Pattern Recognit..

[8]  Zhong Yang,et al.  A New Iterative Triclass Thresholding Technique in Image Segmentation , 2014, IEEE Transactions on Image Processing.

[9]  Kevin W. Bowyer,et al.  Combination of multiple classifiers using local accuracy estimates , 1996, Proceedings CVPR IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[10]  Corinna Cortes,et al.  Support-Vector Networks , 1995, Machine Learning.

[11]  Maurice K. Wong,et al.  Algorithm AS136: A k-means clustering algorithm. , 1979 .

[12]  Pau-Choo Chung,et al.  A Fast Algorithm for Multilevel Thresholding , 2001, J. Inf. Sci. Eng..

[13]  W. Pitts,et al.  A Logical Calculus of the Ideas Immanent in Nervous Activity (1943) , 2021, Ideas That Created the Future.

[14]  D. S. Guru,et al.  Texture Features and KNN in Classification of Flower Images , 2010 .

[15]  Andrew Zisserman,et al.  Delving deeper into the whorl of flower segmentation , 2010, Image Vis. Comput..

[16]  J. A. Hartigan,et al.  A k-means clustering algorithm , 1979 .

[17]  Nanik Suciati,et al.  Flower Classification using Combined a* b* Color and Fractal-based Texture Feature , 2014 .