Multi-tree woody structure reconstruction from mobile terrestrial laser scanner point clouds based on a dual neighbourhood connectivity graph algorithm

A process is presented for the vector reconstruction of fruit plantations based on the model developed by Verroust and Lazarus. To solve occlusion problems, the use of a dual graph of local and extended connectivity is proposed. The process allows vegetation variables such as the length and volume o...

Descripción completa

Detalles Bibliográficos
Autores: Méndez, Valeriano, Rosell Polo, Joan Ramon, Pascual Roca, Miquel, Escolà i Agustí, Alexandre
Tipo de recurso: artículo
Estado:Versión aceptada para publicación
Fecha de publicación:2016
País:España
Institución:Universitat de Lleida (UdL)
Repositorio:Repositori Obert UdL
OAI Identifier:oai:repositori.udl.cat:10459.1/58099
Acceso en línea:https://doi.org/10.1016/j.biosystemseng.2016.04.013
http://hdl.handle.net/10459.1/58099
Access Level:acceso abierto
Palabra clave:Multi-tree reconstruction
LiDAR
Mobile terrestrial laser scanner
Point cloud
Tree training
Ligneous structure
id ES_b397ee76e2b9035a604c377e37bd42c8
oai_identifier_str oai:repositori.udl.cat:10459.1/58099
network_acronym_str ES
network_name_str España
repository_id_str
spelling Multi-tree woody structure reconstruction from mobile terrestrial laser scanner point clouds based on a dual neighbourhood connectivity graph algorithmMéndez, ValerianoRosell Polo, Joan RamonPascual Roca, MiquelEscolà i Agustí, AlexandreMulti-tree reconstructionLiDARMobile terrestrial laser scannerPoint cloudTree trainingLigneous structureA process is presented for the vector reconstruction of fruit plantations based on the model developed by Verroust and Lazarus. To solve occlusion problems, the use of a dual graph of local and extended connectivity is proposed. The process allows vegetation variables such as the length and volume of the ligneous structure to be measured, enabling studies such as intensity of pruning operations. The process has been tested against simulated models and real trees with different training systems: open-vase system (peach trees) and central leader hedgerow system (pear trees). The cost of the algorithm will be given by the cost of the implementation of Dijkstra's algorithm, which in its standard version is of potential (O(n2)). Algorithm accuracy was checked against point clouds of virtual trees. The reconstruction was also applied before and after a pruning operation of real trees to enable a study of the evolution of the vegetation indices. Results showed the algorithm to be suitable for multi-tree reconstruction of both central leader and open-vase training systems.This research was partially funded by the Spanish Ministry of Economy and Competitiveness (projects SAFESPRAY: AGL2010-22304-C04-03 and AGVANCE: AGL2013-48297-C2-2-R).Elsevier2016info:eu-repo/semantics/articleinfo:eu-repo/semantics/acceptedVersionhttps://doi.org/10.1016/j.biosystemseng.2016.04.013http://hdl.handle.net/10459.1/58099reponame:Repositori Obert UdL instname:Universitat de Lleida (UdL)Inglésinfo:eu-repo/grantAgreement/MICINN//AGL2010-22304-C04-03info:eu-repo/grantAgreement/MINECO//AGL2013-48297-C2-2-RVersió postprint del document publicat a https://doi.org/10.1016/j.biosystemseng.2016.04.013Biosystems Engineering, 2016, vol. 148, p. 34–47cc-by-nc-nd, (c) Elsevier, 2016info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-nd/4.0/oai:repositori.udl.cat:10459.1/580992026-06-24T12:42:17Z
dc.title.none.fl_str_mv Multi-tree woody structure reconstruction from mobile terrestrial laser scanner point clouds based on a dual neighbourhood connectivity graph algorithm
title Multi-tree woody structure reconstruction from mobile terrestrial laser scanner point clouds based on a dual neighbourhood connectivity graph algorithm
spellingShingle Multi-tree woody structure reconstruction from mobile terrestrial laser scanner point clouds based on a dual neighbourhood connectivity graph algorithm
Méndez, Valeriano
Multi-tree reconstruction
LiDAR
Mobile terrestrial laser scanner
Point cloud
Tree training
Ligneous structure
title_short Multi-tree woody structure reconstruction from mobile terrestrial laser scanner point clouds based on a dual neighbourhood connectivity graph algorithm
title_full Multi-tree woody structure reconstruction from mobile terrestrial laser scanner point clouds based on a dual neighbourhood connectivity graph algorithm
title_fullStr Multi-tree woody structure reconstruction from mobile terrestrial laser scanner point clouds based on a dual neighbourhood connectivity graph algorithm
title_full_unstemmed Multi-tree woody structure reconstruction from mobile terrestrial laser scanner point clouds based on a dual neighbourhood connectivity graph algorithm
title_sort Multi-tree woody structure reconstruction from mobile terrestrial laser scanner point clouds based on a dual neighbourhood connectivity graph algorithm
dc.creator.none.fl_str_mv Méndez, Valeriano
Rosell Polo, Joan Ramon
Pascual Roca, Miquel
Escolà i Agustí, Alexandre
author Méndez, Valeriano
author_facet Méndez, Valeriano
Rosell Polo, Joan Ramon
Pascual Roca, Miquel
Escolà i Agustí, Alexandre
author_role author
author2 Rosell Polo, Joan Ramon
Pascual Roca, Miquel
Escolà i Agustí, Alexandre
author2_role author
author
author
dc.subject.none.fl_str_mv Multi-tree reconstruction
LiDAR
Mobile terrestrial laser scanner
Point cloud
Tree training
Ligneous structure
topic Multi-tree reconstruction
LiDAR
Mobile terrestrial laser scanner
Point cloud
Tree training
Ligneous structure
description A process is presented for the vector reconstruction of fruit plantations based on the model developed by Verroust and Lazarus. To solve occlusion problems, the use of a dual graph of local and extended connectivity is proposed. The process allows vegetation variables such as the length and volume of the ligneous structure to be measured, enabling studies such as intensity of pruning operations. The process has been tested against simulated models and real trees with different training systems: open-vase system (peach trees) and central leader hedgerow system (pear trees). The cost of the algorithm will be given by the cost of the implementation of Dijkstra's algorithm, which in its standard version is of potential (O(n2)). Algorithm accuracy was checked against point clouds of virtual trees. The reconstruction was also applied before and after a pruning operation of real trees to enable a study of the evolution of the vegetation indices. Results showed the algorithm to be suitable for multi-tree reconstruction of both central leader and open-vase training systems.
publishDate 2016
dc.date.none.fl_str_mv 2016
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/acceptedVersion
format article
status_str acceptedVersion
dc.identifier.none.fl_str_mv https://doi.org/10.1016/j.biosystemseng.2016.04.013
http://hdl.handle.net/10459.1/58099
url https://doi.org/10.1016/j.biosystemseng.2016.04.013
http://hdl.handle.net/10459.1/58099
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv info:eu-repo/grantAgreement/MICINN//AGL2010-22304-C04-03
info:eu-repo/grantAgreement/MINECO//AGL2013-48297-C2-2-R
Versió postprint del document publicat a https://doi.org/10.1016/j.biosystemseng.2016.04.013
Biosystems Engineering, 2016, vol. 148, p. 34–47
dc.rights.none.fl_str_mv cc-by-nc-nd, (c) Elsevier, 2016
info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-nd/4.0/
rights_invalid_str_mv cc-by-nc-nd, (c) Elsevier, 2016
http://creativecommons.org/licenses/by-nc-nd/4.0/
eu_rights_str_mv openAccess
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:Repositori Obert UdL
instname:Universitat de Lleida (UdL)
instname_str Universitat de Lleida (UdL)
reponame_str Repositori Obert UdL
collection Repositori Obert UdL
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869417190732595200
score 15,812429

Similares en LA Referencia