...
首页> 外文期刊>Computers & geosciences >Rapid computation of set boundaries of multi-scale grids and its application in coverage analysis of remote sensing images
【24h】

Rapid computation of set boundaries of multi-scale grids and its application in coverage analysis of remote sensing images

机译:多尺度网格集边界的快速计算及其在遥感图像覆盖分析中的应用

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

With the rapid development of remote sensing technology, the amount of remote sensing data is increasing, service objects are increasingly extensive, and requests from users to query the coverage of remote sensing images under specific conditions have also increased. These conditions have increased efficiency and precision requirements for concurrent access and response. Remote sensing images provide multiple coverages of the same area, and the nested and overlapping relationships among data are complex. Therefore, calculating the range of multiple overlaps of images becomes increasingly difficult as the number of images increases. To query the range of a coverage area of multiple images is to calculate its boundary, which is an important part of spatial overlay analysis. Traditional vector methods are inefficient in processing many spatial objects or complex shapes. The overlay of traditional spatial grids is mostly addressed via single-scale methods, which have low computational efficiency and low boundary fitting precision. Combined with the current gridding management method for multi-source remote sensing images, we proposed a new algorithm for rapid computation of the set boundaries of multi-scale grids and applied it to coverage analysis of remote sensing images. The algorithm can effectively trace the boundaries of multi-scale grids formed in the regions covered by remote sensing images, and it can solve all types of complex boundaries, such as convex and concave boundaries, holes and islands. The experiments in this study show that the new algorithm greatly improves computational efficiency and boundary fitting precision compared with the single-scale grid methods. Compared with the vector algorithms of ArcGIS and other commercial software, this study's algorithm can greatly improve calculation efficiency while ensuring a precision above 99%. The new algorithm is suitable for rapid calculations of large areas and widespread coverage of remote sensing images.
机译:随着遥感技术的快速发展,遥感数据的数量正在增加,服务对象越来越广泛,并且用户在特定条件下查询遥感图像覆盖的请求也增加了。这些条件提高了并发访问和响应的效率和精确要求。遥感图像提供相同区域的多个覆盖范围,数据之间的嵌套和重叠关系是复杂的。因此,随着图像的数量增加,计算图像的多重重叠的范围变得越来越困难。为了查询多个图像的覆盖区域的范围是计算其边界,这是空间覆盖分析的重要部分。传统的矢量方法在处理许多空间物体或复杂形状时效率低下。传统空间网格的覆盖主要通过单尺度方法来解决,具有低计算效率和低边界拟合精度。结合多源遥感图像的当前网格管理方法,我们提出了一种新的算法,用于快速计算多尺度网格的集合边界,并将其应用于遥感图像的覆盖分析。该算法可以有效地追踪在遥感图像覆盖的区域中形成的多尺度网格的边界,并且可以解决所有类型的复杂边界,例如凸起和凹形边界,孔和岛屿。该研究的实验表明,与单尺度网格方法相比,新算法大大提高了计算效率和边界拟合精度。与ArcGIS和其他商业软件的矢量算法相比,该研究的算法可以大大提高计算效率,同时确保高于99%的精度。新算法适用于大面积的快速计算和遥感图像的广泛覆盖范围。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号