2015 International Conference on 3D Vision 2015
DOI: 10.1109/3dv.2015.68
|View full text |Cite
|
Sign up to set email alerts
|

Estimation of Branch Angle from 3D Point Cloud of Plants

Abstract: Measuring geometric features in plant specimens either quantitatively or qualitatively, is crucial for plant phenotyping. However, traditional measurement methods tend to be manual and can be tedious, or employ coarse 2D imaging techniques. Emerging 3D imaging technologies show much promise in capturing architectural complexity. However, automated 3D acquisition and accurate estimation of plant morphology for the construction of quantitative plant models remain largely aspiration. In this paper, we propose an … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 8 publications
(10 citation statements)
references
References 30 publications
0
10
0
Order By: Relevance
“…An approach analogous to that used here has recently been published by Lou et al (2015), although they work on point cloud data generated using a multi-view stereo imaging system. The methodology is similar: a graph is first constructed to build neighbourhood relationships between the plant's points, and next a spectral clustering approach is performed on this graph.…”
Section: Related Workmentioning
confidence: 97%
See 4 more Smart Citations
“…An approach analogous to that used here has recently been published by Lou et al (2015), although they work on point cloud data generated using a multi-view stereo imaging system. The methodology is similar: a graph is first constructed to build neighbourhood relationships between the plant's points, and next a spectral clustering approach is performed on this graph.…”
Section: Related Workmentioning
confidence: 97%
“…More general approaches such as expectation maximization could be used, but as k-means clustering they do not naturally benefit from the neighbourhood information (graph edges). Note that Lou et al (2015) merge neighbouring clusters with similar normals, but this may lead to under-segmentation since different elementary units (e.g. two leaves) may have similar normals.…”
Section: Spectral Clusteringmentioning
confidence: 98%
See 3 more Smart Citations