Exploring Simple K-Means Clustering Algorithm For Automating Segregation Of Colors In Leaf Of Axonopus Compressus: Towards Maintenance Of An Urban Landscape

Images of green infrastructure (gardens, green corridor, green roofs and grasslands) large area can be captured and processed to provide spatial and temporal variation in colours of plant leaves. This may indicate average variation in plant growth over large urban landscape (community gardens, green corridor etc). Towards this direction, this short technical note explores development of a simple automated machine learning program that can accurately segregate colors from plant leaves. In this newly developed program, a machine learning algorithm has been modified and adapted to give the proportion of different colors present in a leaf. Python script is developed for an image processing. For validation, experiments are conducted in green house to grow Axonopus compressus. Script first extracts different RGB (Red Green and Blue) colors present in the leaf using the K-means clustering algorithm. Appropriate centroids required for the clusters of leaf colors are formed by the K-means algorithm. The new program provides saves computation time and gives output in form of different colors proportion as a CSV (Comma-Separated Values) file. This study is the first step towards the demonstration of using automated programs for the segregation of colors from the leaf in order to access the growth of the plant in an urban landscape.