Evidence map›Paper›PMID 33092292›Full record

ArticleSensors (Basel, Switzerland)2020

Plant Leaf Position Estimation with Computer Vision.

James Beadle, C James Taylor, Kirsti Ashworth, David Cheneler

Abstract read
In one paragraph

Article in Sensors (Basel, Switzerland), 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

James BeadleEngineering Department, Lancaster University, Lancaster LA1 4YW, UK.
C James TaylorEngineering Department, Lancaster University, Lancaster LA1 4YW, UK.ORCID 0000-0002-5247-5193
Kirsti AshworthLancaster Environment Centre, Lancaster University, Lancaster LA1 4YW, UK.ORCID 0000-0001-5627-3014
David ChenelerEngineering Department, Lancaster University, Lancaster LA1 4YW, UK.ORCID 0000-0003-1353-0329

Funding

Engineering and Physical Sciences Research Council EP/R02572X/1
6 · The paper itself

Abstract

Autonomous analysis of plants, such as for phenotyping and health monitoring etc., often requires the reliable identification and localization of single leaves, a task complicated by their complex and variable shape. Robotic sensor platforms commonly use depth sensors that rely on either infrared light or ultrasound, in addition to imaging. However, infrared methods have the disadvantage of being affected by the presence of ambient light, and ultrasound methods generally have too wide a field of view, making them ineffective for measuring complex and intricate structures. Alternatives may include stereoscopic or structured light scanners, but these can be costly and overly complex to implement. This article presents a fully computer-vision based solution capable of estimating the three-dimensional location of all leaves of a subject plant with the use of a single digital camera autonomously positioned by a three-axis linear robot. A custom trained neural network was used to classify leaves captured in multiple images taken of a subject plant. Parallax calculations were applied to predict leaf depth, and from this, the three-dimensional position. This article demonstrates proof of concept of the method, and initial tests with positioned leaves suggest an expected error of 20 mm. Future modifications are identified to further improve accuracy and utility across different plant canopies.

Indexed as

AlgorithmsPlant LeavesRoboticsComputersPlantscomputer visiondepth estimationneural networkparallaxposition estimation

Identifiers

PMID33092292
PMCPMC7594066

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.