In order to apply the recent successes of automated plant phenotyping and machine learning on a large scale, efficient and general algorithms must be designed to intelligently split crop fields into small, yet actionable, portions that can then be processed by more complex algorithms. In this paper we notice a similarity between the current state-of-the-art for this problem and a commonly used density-based clustering algorithm, Quickshift. Exploiting this similarity we propose a number of novel, application specific algorithms with the goal of producing a general and scalable plant segmentation algorithm. The novel algorithms proposed in this work are shown to produce quantitatively better results than the current state-of-the-art while being less sensitive to input parameters and maintaining the same algorithmic time complexity. When incorporated into field-scale phenotyping systems, the proposed algorithms should work as a drop in replacement that can greatly improve the accuracy of results while ensuring that performance and scalability remain undiminished.
翻译:为了应用最近自动化植物编织和机器大规模学习的成功经验,必须设计高效和一般的算法,以便明智地将作物田分为小的、但又可操作的部分,然后可以由更复杂的算法处理。在本文件中,我们注意到目前对这一问题最先进的算法与普遍使用的基于密度的群集算法Quickfortive的相似之处。利用这种相似性,我们提议了一些新的、应用的具体算法,目的是产生一种一般的和可伸缩的植物分解算法。这项工作中提议的新算法在数量上比目前的最新算法产生更好的结果,同时对输入参数不那么敏感,并保持同样的算法时间复杂性。在纳入外地规模的剖析系统时,拟议的算法应作为一种低的替代方法,可以大大提高结果的准确性,同时确保性能和伸缩性保持不减。