检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:吴宾[1] 余柏蒗[1] 岳文辉[1] 谈文琦 胡春凌 吴健平[1]
机构地区:[1]华东师范大学地理信息科学教育部重点实验室,上海200062 [2]上海市绿化与市容管理信息中心,上海200040
出 处:《华东师范大学学报(自然科学版)》2013年第2期38-49,共12页Journal of East China Normal University(Natural Science)
基 金:国家自然科学基金(41001270);高等学校博士学科点专项科研基金资助课题(新教师类)(20100076120017);中央高校基本科研业务费专项资金项目
摘 要:提出了一种基于分层网格点密度的单株树信息提取方法,从车载激光扫描点云数据中提取出组成单株行道树的激光点,并计算树高、冠幅等特征信息.该方法由建立规则网格,基于高程的点云分层,逐层计算网格点密度,逐层提取激光点,提取单株行道树和计算特征等步骤构成.通过实例证明,提取结果较好地保留了组成单株行道树的激光点,并能较准确地计算特征信息.该方法拓展了车载激光扫描系统的应用领域,并可为城市绿化管理提供新的技术方法.This paper presents a new layered extraction method for identifying laser scanning points that constitute an individual street tree using the grid points density information based on the cloud data of the laser scanning points. The characteristic information, including the height and crown diameter were derived after an individual tree was identified. The original 3D points cloud data were processed by the following steps: establishing regular grids, layering the points cloud based on elevation value, calculating grid points density for each layer, extracting laser scanning points for each layer, identifying individual tree, and deriving characteristic information. The feasibility of the method was proved through case studies. The results show most of the laser scanning points that constitute an individual tree are extracted correctly. And the de- rived characteristic information was estimated to be as fairly accurate as the in situ data. The proposed method will expand the application domain of VLS and provide a new approach to the urban green space development and management.
关 键 词:车载激光扫描系统 点云数据 行道树 分层 网格点密度
分 类 号:P237[天文地球—摄影测量与遥感] TN249[天文地球—测绘科学与技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3