Fast and automatic forest volume estimation based on K nearest neighbor and SAR

Ying Guo, Zeng-yuan Li, E. Chen, Xu Zhang
{"title":"Fast and automatic forest volume estimation based on K nearest neighbor and SAR","authors":"Ying Guo, Zeng-yuan Li, E. Chen, Xu Zhang","doi":"10.1117/12.912332","DOIUrl":null,"url":null,"abstract":"In the recent years, the estimation of forest volume using radar data has developed greatly. However, as the radar data was large scale, the efficiency of processing based on KNN decreased seriously. Moreover, because the different K and distance measured method could result in the different accuracy, the treatment could have a low degree of automation under the condition of keeping the relatively better precision. Therefore, the study implemented a tool which could have the feature of fast and automatic processing radar data based on KNN. For enhancing the efficiency of processing, the tool was implemented in the way of parallelization by using the message passing interface (MPI) technology and run on the high performance cluster environment. To certain the suitable parameter automatically such as K and the appropriate distance measured method during the processing; the study used leave-one-out cross-validation method to check the precision and selected the optimum model based on the accuracy. The result shows that the tool accelerated the computation speed as eight time as before while ensuring the treatment precision and improved the automatic degree of the treatment. To some extend, it solved the bottleneck of processing large scale SAR data.","PeriodicalId":194292,"journal":{"name":"International Symposium on Lidar and Radar Mapping Technologies","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Lidar and Radar Mapping Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.912332","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

In the recent years, the estimation of forest volume using radar data has developed greatly. However, as the radar data was large scale, the efficiency of processing based on KNN decreased seriously. Moreover, because the different K and distance measured method could result in the different accuracy, the treatment could have a low degree of automation under the condition of keeping the relatively better precision. Therefore, the study implemented a tool which could have the feature of fast and automatic processing radar data based on KNN. For enhancing the efficiency of processing, the tool was implemented in the way of parallelization by using the message passing interface (MPI) technology and run on the high performance cluster environment. To certain the suitable parameter automatically such as K and the appropriate distance measured method during the processing; the study used leave-one-out cross-validation method to check the precision and selected the optimum model based on the accuracy. The result shows that the tool accelerated the computation speed as eight time as before while ensuring the treatment precision and improved the automatic degree of the treatment. To some extend, it solved the bottleneck of processing large scale SAR data.
基于K近邻和SAR的森林体积快速自动估计
近年来,利用雷达数据估算森林体积有了很大的发展。然而,由于雷达数据规模较大,基于KNN的处理效率严重下降。此外,由于不同的K值和测量距离的方法会导致不同的精度,在保持相对较好的精度的情况下,处理的自动化程度较低。因此,本研究实现了一种基于KNN的雷达数据快速自动处理工具。为了提高处理效率,采用消息传递接口(MPI)技术以并行化的方式实现该工具,并在高性能集群环境下运行。在加工过程中自动确定合适的K等参数和合适的距离测量方法;采用留一交叉验证法对模型进行精密度检验,并根据精密度选择最优模型。结果表明,该工具在保证加工精度的同时,将计算速度提高了8倍,提高了加工的自动化程度。在一定程度上解决了大规模SAR数据处理的瓶颈。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信