Exploring simple K-means clustering algorithm for automating segregation of colors in leaf of axonopus compressus: towards maintenance of an urban landscape

Show simple item record

dc.contributor.author Singh, Lovepreet
dc.contributor.author Huang, He
dc.contributor.author Bordoloi, Sanandam
dc.contributor.author Garg, Ankit
dc.contributor.author Jiang, Mingjie
dc.coverage.spatial Netherlands
dc.date.accessioned 2020-12-26T13:48:45Z
dc.date.available 2020-12-26T13:48:45Z
dc.date.issued 2021-01
dc.identifier.citation Singh, Lovepreet; Huang, He; Bordoloi, Sanandam; Garg, Ankit; Jiang, Mingjie, “Exploring simple K-means clustering algorithm for automating segregation of colors in leaf of axonopus compressus: towards maintenance of an urban landscape”, Journal of Intelligent & Fuzzy Systems, DOI: 10.3233/JIFS-201542, vol. 40, no. 1, pp. 1219-1243, Jan. 2021. en_US
dc.identifier.issn 1064-1246
dc.identifier.uri https://doi.org/10.3233/JIFS-201542
dc.identifier.uri https://repository.iitgn.ac.in/handle/123456789/6150
dc.description.abstract 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.
dc.description.statementofresponsibility by Lovepreet Singh, He Huang, Sanandam Bordoloi, Ankit Garg and Mingjie Jiang
dc.language.iso en_US en_US
dc.publisher IOS Press en_US
dc.subject Color segregation en_US
dc.subject K-means algorithm en_US
dc.subject Automation en_US
dc.subject Cluster analysis en_US
dc.subject Python script en_US
dc.title Exploring simple K-means clustering algorithm for automating segregation of colors in leaf of axonopus compressus: towards maintenance of an urban landscape en_US
dc.type Article en_US
dc.relation.journal Journal of Intelligent & Fuzzy Systems


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search Digital Repository


Browse

My Account