Pre-Clustering Point Clouds of Crop Fields Using Scalable Methods

07/22/2021
by   Henry J. Nelson, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 4

page 5

page 6

research
05/10/2018

Multi-View Semantic Labeling of 3D Point Clouds for Automated Plant Phenotyping

Semantic labeling of 3D point clouds is important for the derivation of ...
research
12/20/2022

Eff-3DPSeg: 3D organ-level plant shoot segmentation using annotation-efficient point clouds

Reliable and automated 3D plant shoot segmentation is a core prerequisit...
research
02/07/2023

Using t-distributed stochastic neighbor embedding for visualization and segmentation of 3D point clouds of plants

In this work, the use of t-SNE is proposed to embed 3D point clouds of p...
research
02/14/2020

Clustering based on Point-Set Kernel

Measuring similarity between two objects is the core operation in existi...
research
11/17/2018

Towards Scalable Subscription Aggregation and Real Time Event Matching in a Large-Scale Content-Based Network

Although many scalable event matching algorithms have been proposed to a...
research
01/26/2018

Efficient Hierarchical Graph-Based Segmentation of RGBD Videos

We present an efficient and scalable algorithm for segmenting 3D RGBD po...
research
09/26/2013

Convex Relaxations of Bregman Divergence Clustering

Although many convex relaxations of clustering have been proposed in the...

Please sign up or login with your details

Forgot password? Click here to reset