Local Texture Based Borderline Detection of Mowing

Jiashun Xia, Uuganbayar Ganbold, Yi Zhang, Hayato Sasaki, D. Shima, T. Akashi
{"title":"Local Texture Based Borderline Detection of Mowing","authors":"Jiashun Xia, Uuganbayar Ganbold, Yi Zhang, Hayato Sasaki, D. Shima, T. Akashi","doi":"10.1109/NICOInt.2019.00008","DOIUrl":null,"url":null,"abstract":"With the development of automatic robots technology, it is using for more and more fields, mowing is still done manually. One of the important reasons of this is that it is difficult to automatically plan the mowing path. Therefore, we proposed a method for finding the boundary line between the cut grass and the uncut grass based on GLCM (grey-level co-occurrence matrix) for this problem. The features we extracted were energy, contrast, correlation and entropy by each GLCM, then using the average of each feature to segment the image of the grass. We used these features to find a boundary line that maximizes the difference in features on both sides. Finally, GA (genetic algorithm) is used to solve the maximization problem. The experiment shows that it is feasible to distinguish between the cut grass and the uncut grass using GA and GLCM features.","PeriodicalId":436332,"journal":{"name":"2019 Nicograph International (NicoInt)","volume":"625 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 Nicograph International (NicoInt)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NICOInt.2019.00008","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

With the development of automatic robots technology, it is using for more and more fields, mowing is still done manually. One of the important reasons of this is that it is difficult to automatically plan the mowing path. Therefore, we proposed a method for finding the boundary line between the cut grass and the uncut grass based on GLCM (grey-level co-occurrence matrix) for this problem. The features we extracted were energy, contrast, correlation and entropy by each GLCM, then using the average of each feature to segment the image of the grass. We used these features to find a boundary line that maximizes the difference in features on both sides. Finally, GA (genetic algorithm) is used to solve the maximization problem. The experiment shows that it is feasible to distinguish between the cut grass and the uncut grass using GA and GLCM features.
基于局部纹理的割草机边缘检测
随着自动机器人技术的发展,它在越来越多的领域得到应用,但割草仍然是人工完成的。其中一个重要原因是难以自动规划割草路径。因此,针对该问题,我们提出了一种基于灰度共生矩阵(GLCM)的割草与未割草边界线查找方法。我们通过每个GLCM提取能量、对比度、相关性和熵特征,然后使用每个特征的平均值对草地图像进行分割。我们使用这些特征来找到一条边界线,使两边的特征差异最大化。最后,利用遗传算法求解最优化问题。实验表明,利用遗传算法和GLCM特征来区分割草和未割草是可行的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信