WO2021204026A1 - Procédé de construction simultanée basé sur un système distribué pour des pavés de pyramide de dem massifs - Google Patents

Procédé de construction simultanée basé sur un système distribué pour des pavés de pyramide de dem massifs Download PDF

Info

Publication number
WO2021204026A1
WO2021204026A1 PCT/CN2021/084081 CN2021084081W WO2021204026A1 WO 2021204026 A1 WO2021204026 A1 WO 2021204026A1 CN 2021084081 W CN2021084081 W CN 2021084081W WO 2021204026 A1 WO2021204026 A1 WO 2021204026A1
Authority
WO
WIPO (PCT)
Prior art keywords
tile
key
dem
slice
value
Prior art date
Application number
PCT/CN2021/084081
Other languages
English (en)
Chinese (zh)
Inventor
朱必亮
徐忠建
李俊
Original Assignee
速度时空信息科技股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 速度时空信息科技股份有限公司 filed Critical 速度时空信息科技股份有限公司
Publication of WO2021204026A1 publication Critical patent/WO2021204026A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
    • G06T17/05—Geographic models
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
    • G06T17/20—Finite element generation, e.g. wire-frame surface description, tesselation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T3/00—Geometric image transformations in the plane of the image
    • G06T3/40—Scaling of whole images or parts thereof, e.g. expanding or contracting
    • G06T3/4007—Scaling of whole images or parts thereof, e.g. expanding or contracting based on interpolation, e.g. bilinear interpolation

Definitions

  • the invention relates to the technical field of geospatial data parallel processing, in particular to a method for parallel construction of massive DEM pyramid slices based on a distributed system.
  • Chinese patent document CN201710107308.X discloses a DEM-based method for delimiting an inflow lake catchment area, which includes obtaining DEM data of a digital elevation model in a set area, and cutting it to obtain basic DEM data. The DEM data establishes the ridge line in the set area, and divides the spatial unit to calculate the spatial raster data. This patent does not involve parallel and DEM pyramid algorithms.
  • Chinese patent document 201410687961.4 discloses a structured multi-scale reconstruction method suitable for regular grid DEM, which also does not involve pyramid building and parallel methods.
  • Chinese Patent Document 201410788404.1 discloses an adaptive image pyramid slicing method for relational database expansion.
  • An adaptive image slicing model is proposed, and the size of the image slice is adaptively selected according to the adaptive image slicing model.
  • the image slice involves the null value of the image element, and does not involve the stitching method of the DEM slice.
  • GIS software mainly commercial GIS software has the function of DEM pyramid slicing. These methods mainly use different sampling algorithms to segment the DEM, and do not implement distributed DEM pyramid slicing.
  • the technical problem to be solved by the present invention is to provide a method for parallel construction of massive DEM pyramid slices based on a distributed system, which can perform parallel segmentation of large-scale or massive DEM pyramid slices, and can be distributed in a high-performance computer cluster environment
  • Formula calculation reduces the time for pyramid construction and improves calculation efficiency.
  • the value of the edge of the DEM slice can be calculated in combination with the adjacent average method to solve the smooth transition between adjacent slices.
  • the technical solution adopted by the present invention is: the parallel construction method of massive DEM pyramid slices based on a distributed system specifically includes the following steps:
  • S1 gets the metadata Metadata of the source DEM
  • S2 establishes the local coordinate system of the source DEM, and divides the source DEM to form a number of parallel-calculated slice tiles (a slice is to cut a DEM into many small pieces of the same size); and according to the Calculate the parameters of the source DEM and record the index value of each sliced Tile as Key.
  • S3 sets or calculates the maximum level MaxZoom according to whether the maximum level MaxZoom is defined, and then sets the required output slice tile parameters; then calculates the output slice tile parameters according to the set coordinate system and segmentation rule, the output slice tile
  • the parameters include slice length, width, resolution, etc.
  • the S4 computing node constructs the assigned key-value pair ⁇ Key, Tile> in parallel, and merges the elevation value Value on the same computing node according to the index value Key; respectively according to the index value Key according to the length, width, and resolution parameters of the output tile Calculate the outer rectangle Extend of the corresponding tile, calculate the coordinates of each grid cell in the input tile, and then calculate the coordinates of each grid cell in the output coordinate system according to the set output coordinate system; Calculate the index value Key of the output slice Tile where the corresponding grid unit cell is located according to the coordinates of each grid unit cell, and add it to a mapping Map to form a mapping Map ⁇ Key, List ⁇ cell> >, where Key represents the index value of the slice, List represents a linked list, and cell represents a grid unit;
  • S5 merges the linked lists List ⁇ cell> of the same index value Key on the computing nodes; merges the linked lists List ⁇ cell> on all computing nodes according to the index value Key to form a key-value pair ⁇ Key, List ⁇ cell>>;
  • S6 calculates the coordinates of the grid unit cell of the output tile tile according to the parameters and coordinate system of the output tile tile, and then calculates the elevation value of the grid unit cell from the merged key-value pair ⁇ Key, List ⁇ cell>> according to the sampling method Value;
  • S7 uses the 8-neighbor algorithm to modify the elevation value of the tile edge of the output slice; according to the generated linked list List ⁇ Key, Tile>, the four-sided grid cell of each tile and the 8 adjacent slices are obtained cyclically Tile, take the average of the grid cell elevation values of adjacent tile tiles as the elevation value Value of the corresponding grid cell to achieve the smooth splicing of tile tiles;
  • S9 calculates and generates the next level slice Tile and index value Key in parallel according to the upper level slice tile and sampling algorithm; calculates the next level corresponding to the current level slice tile according to the index value Key, the next level and the parameters of the slice tile.
  • the first-level index value Key uses the sampling algorithm to sample the elevation value of the next level slice from the current level slice tile to form the sub-slices of the next level slice tile and the index value Key, and merge the same on each node
  • the index value Key of forms the key value pair ⁇ Key, List ⁇ Tile>>; then according to the index value Key, merge the slice tiles of the same index value Key on all nodes to form the next level of slice tiles, and then perform step S7 ;
  • S10 executes steps S8 ⁇ S9 in a loop until it is judged that the level Zoom meets the termination condition, the termination condition is: if the minimum level MinZoom is set, then it is judged whether the current level Zoom reaches the set minimum level MinZoom, if it reaches, then terminate; if The minimum level MinZoom is not set, if the current level zoom is less than 0, it will be terminated.
  • Tile represents the slice
  • Key represents the index value of the slice
  • Value represents the elevation value
  • List represents the linked list
  • cell represents the grid unit
  • Zoom represents the level
  • Map represents the mapping
  • Extend represents the outsourcing rectangle of the source DEM; using the above technical solution, obtain the pending Split the metadata Metadata of the source DEM as the basis for data segmentation and projection conversion; establish a coordinate system with the upper left corner of the source DEM as the origin and the positive direction downward and right, and the source DEM will be adjusted according to the width and height of the default tile
  • the map frame is segmented
  • the index value Key is formed according to the row and column numbers of the preliminary segmented Tile, and a key-value pair is constructed with the index value Key as the key and the sliced Tile as the value; the key-value pairs are distributed on different computing nodes as follows Calculation; according to the set MaxZoom or calculated MaxZoom, as well as the set width and height, coordinate system and sampling algorithm of the output tile tile, each computing node performs segmentation calculation
  • the metadata in the step S1 includes the original resolution, the coordinate system, and the extent data of the outer rectangle of the source DEM in the source coordinate system.
  • the purpose of obtaining the metadata of the source DEM is for the needs of subsequent calculations. These calculations include preliminary segmentation of the source data to facilitate the parallelization of subsequent calculations.
  • the establishment of the local coordinate system of the source DEM in step S2 is specifically: establishing a coordinate system with the upper left corner of the source DEM as the origin, and downward and right as the positive direction; according to the width of the set tile Hegao, divide the source DEM data into multiple slice tiles, in order to make a preliminary segmentation of the source DEM to form a linked list List ⁇ Key, Tile>, in which the calculation method of the index value Key:
  • C and R represent the row and column number of the tile
  • x and y represent the slice coordinates of any point of the tile
  • XMin represents the X minimum value of the outer rectangle Extent of the source DEM
  • YMin represents the Y minimum value of the outer rectangle Extent of the source DEM.
  • TH is the height of the initial tile
  • TW is the width of the initial tile.
  • the level MaxZoom needs to be calculated.
  • the calculation process is based on the coordinates of the lower left point and the upper right point of the outer envelope rectangle Extend of the source DEM, and the coordinates of the lower left point Perform projection conversion with the coordinates of the upper right point and convert them into latitude and longitude coordinates.
  • the coordinates of the lower left point are (SLon, SLat) and the coordinates of the upper right point are (ELon, ELat); then the level MaxZoom is calculated according to the formula, and the calculation formula is as follows:
  • MaxZoom is the maximum level
  • dLat is the difference in latitude
  • dLon is the difference in longitude
  • lat1 is the radian of SLat
  • lat2 is the radian of ELat
  • a is the calculated intermediate value
  • dist is the distance between two points
  • tilesize is the maximum side set by the Tile.
  • the grid unit cell ⁇ x, y, Value>, where x and y are the coordinates of the tile in the slice, and Value is the elevation value.
  • the step S4 calculates the input slice tiles in parallel, and divides the DEM value of the input slice Tile into different output slice tiles according to the parameters of the output slice Tile; among them, first, according to the index value of the input slice Tile, Key Calculate the Extend of the tile, the calculation formula:
  • MinX, MinY, MaxX, MaxY respectively represent the minimum and maximum XY coordinate values of the outer rectangle Extend, col, row are the row and column numbers of the input slice Tile, and ExMinX and ExMinY represent the minimum X and Y coordinate values of the outer rectangle Extend of the source DEM , H represents the height of the tile, and W represents the width of the tile.
  • the output linked list List ⁇ Key, Tile> is calculated in parallel for the adjacent tile tiles, and the intersection is divided by the four sides.
  • the cell value of the adjacent grid cell outside, and the upper and lower or left and right cells are selected, and the average value of the obtained cell value is taken as the elevation value of the specified grid cell;
  • the calculation of the elevation value of the four corner points is Take the values of the other three adjacent tiles and the corresponding corner points of the tile, and take the average value as the elevation value of the corresponding grid cell.
  • the present invention has the beneficial effects that: the distributed system-based parallel construction method for massive DEM pyramid slices has the following advantages: using high-performance computing clusters, the construction of DEM pyramid slices for large-scale DEM data is realized. Parallelization can reduce the time for DEM pyramid construction and improve calculation efficiency; 8-neighbor smoothing is performed on the edge elevation value of the slice to avoid the smoothing of DEM visualization and analysis calculation.
  • Fig. 1 is a working flow chart of the method for parallel construction of massive DEM pyramid slices based on a distributed system of the present invention
  • FIG. 2 is a schematic diagram of the local coordinate system segmentation DEM of the method for parallel construction of massive DEM pyramid slices based on the distributed system of the present invention
  • FIG. 3 is a schematic diagram of the calculation of a single computing node of the method for parallel construction of massive DEM pyramid slices based on a distributed system of the present invention
  • FIG. 4 is a schematic diagram of the merging of multiple computing nodes of the method for parallel construction of massive DEM pyramid slices based on the distributed system of the present invention
  • FIG. 5 is a schematic diagram of edge smoothing of the method for parallel construction of massive DEM pyramid slices based on a distributed system of the present invention
  • FIG. 6 is a visualization diagram of the method for parallel construction of massive DEM pyramid slices based on a distributed system of the present invention
  • Picture (a) is a 17-level picture
  • Picture (b) is a 17-level and 16-level mosaic display picture
  • Picture (c) is a 17-level Wireframe picture
  • Picture (d) is a 17-level and 16-level mosaic Wireframe picture.
  • Embodiment As shown in Figures 1 to 6, the parallel construction method of massive DEM pyramid slices based on a distributed system specifically includes the following steps:
  • Tile represents the slice
  • Key represents the index value of the slice
  • Value represents the elevation value
  • List represents the linked list
  • cell represents the grid unit
  • zoom represents the level
  • Map represents the mapping
  • Extend represents the outsourcing rectangle of the source DEM
  • ⁇ Key, Tile> represents the key Value pair
  • S1 uses source DEM data with a resolution of 30 meters and a part of high-precision source DEM data, the data format is tif, and the set coordinate system is WGS84; the pyramid slicing program based on the Flink distributed platform is developed separately;
  • S2 establishes a local coordinate system for the input source DEM data, sets the height and width of the initial division slice to be 126 (grid), uses the sliding window method to segment the source data, and then divides the source data according to the ranks of the tiles in the local coordinate system
  • Calculate the Key construct a series of ⁇ Key, Tile> key-value pairs, and distribute the key-value pair data to different computing nodes according to Flink’s algorithm for calculation; the establishment takes the upper left corner of the source DEM as the origin, and downwards to the right as The coordinate system in the positive direction; the calculation method of the index value Key:
  • C and R represent the row and column number of the tile
  • x and y represent the slice coordinates of any point of the tile
  • XMin represents the X minimum value of the outer rectangle Extent of the source DEM
  • YMin represents the Y minimum value of the outer rectangle Extent of the source DEM.
  • TH is the height of the initial tile
  • TW is the width of the initial tile;
  • S3 sets or calculates the maximum level MaxZoom according to whether the maximum level MaxZoom is defined, and then calculates the parameters of the output slice tile according to the set coordinate system and segmentation rule; the parameters of the output slice tile include the length, width, and resolution of the slice If the maximum level MaxZoom is not set, the maximum level MaxZoom needs to be calculated.
  • the calculation process is based on the coordinates of the lower left point and the upper right point of the outer rectangle Extend of the source DEM, and the coordinates of the lower left point and the upper right point are projected Convert to latitude and longitude coordinates, where the coordinates of the lower left point are (SLon, SLat), and the coordinates of the upper right point are (ELon, ELat); then the maximum level MaxZoom is calculated according to the formula, and the calculation formula is as follows:
  • MaxZoom is the maximum level
  • dLat is the difference in latitude
  • dLon is the difference in longitude
  • lat1 is the radian of SLat
  • lat2 is the radian of ELat
  • a is the calculated intermediate value
  • dist is the distance between two points
  • tilesize is the maximum side set by the Tile.
  • the parameters of the output slice tile set in step S3 are: width and height are 65 (grid), The coordinate system is WGS84, and the naming of the index value Key follows the TMS standard;
  • the S4 computing node constructs the assigned key-value pair ⁇ Key, Tile> in parallel, and merges the elevation value Value on the same computing node according to the index value Key; respectively according to the index value Key according to the length, width, and resolution parameters of the output tile
  • Calculate the outer rectangle Extend of the corresponding sliced Tile calculate the coordinates of each grid cell in the input slice Tile, and calculate the initial segmented tiles separately; first calculate the Extend of the tile according to the index value Key; calculate each tile in the input slice
  • the coordinates of a grid cell, where cell ⁇ x,y,Value>, where x and y are the coordinates of the Tile, and Value is the coordinates of the elevation value.
  • the step S4 calculates the input slice Tile in parallel, and divides the DEM value of the input slice Tile into different output slice tiles according to the parameters of the output slice Tile; among them, first according to the input slice Tile
  • the index value Key calculates the outer rectangle Extend of the Tile, the calculation formula is:
  • MinX, MinY, MaxX, MaxY respectively represent the minimum and maximum XY coordinate values of the outer rectangle Extend, col, row are the row and column numbers of the input slice Tile, and ExMinX and ExMinY represent the minimum X and Y coordinate values of the outer rectangle Extend of the source DEM , H represents the height of the tile, and W represents the width of the tile;
  • S7 uses the 8-neighborhood algorithm to modify the elevation value Value of the tile edge; according to the generated linked list List ⁇ Key, Tile>, it cyclically obtains the four-sided grid cell of each tile tile and the 8 adjacent tiles.
  • Tile take the average of the grid unit elevation values of adjacent tile tiles as the elevation value Value of the corresponding grid unit cell to achieve smooth tile tile splicing; according to the output key-value pair ⁇ Key, Tile>, according to the index value Key
  • calculate the 8 adjacent tiles of each tile take the cell value of the adjacent tiles, and use the average value as the value of the corresponding cell to achieve smooth tile splicing; the principle diagram is shown in Figure 5;
  • S9 calculates and generates the next level slice Tile and index value Key in parallel according to the upper level slice tile and sampling algorithm; calculates the next level corresponding to the current level slice tile according to the index value Key, the next level and the parameters of the slice tile.
  • the first-level index value Key uses the sampling algorithm to sample the elevation value of the next level slice from the current level slice tile to form the sub-slices of the next level slice tile and the index value Key, and merge the same on each node
  • the index value Key of forms the key value pair ⁇ Key, List ⁇ Tile>>; then according to the index value Key, merge the slice tiles of the same index value Key on all nodes to form the next level of slice tiles, and then perform step S7 ;
  • the nearest neighbor sampling algorithm is used;
  • S10 cyclically executes steps S8 ⁇ S9, calculating the next level of List ⁇ Key, Tile>, until it is judged that the current level of Zoom meets the termination condition, the termination condition is: if the minimum level of MinZoom is set, it is judged whether the current level of Zoom has reached Set the minimum level of MinZoom, if it reaches the minimum level, then terminate; if the minimum level of MinZoom is not set, the current level of Zoom is less than 0, then terminate.

Landscapes

  • Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Geometry (AREA)
  • Software Systems (AREA)
  • Computer Graphics (AREA)
  • Remote Sensing (AREA)
  • Image Processing (AREA)
  • Image Generation (AREA)

Abstract

L'invention concerne un procédé de construction simultanée basé sur un système distribué pour des pavés de pyramide de modèles numériques d'élévation (DEM) massifs, comprenant les étapes spécifiques suivantes : obtenir les métadonnées d'un DEM devant être segmenté ; établir un système de coordonnées locales de DEM ; segmenter le DEM en plusieurs pavés qui peuvent être calculés simultanément ; calculer le zoom maximal, et régler la largeur et la hauteur d'un pavé de sortie, un système de coordonnées et un algorithme d'échantillonnage ; chaque nœud de calcul réalise un calcul de segmentation sur un pavé d'entrée distribué ; fusionner les valeurs de cellule de la même clé sur chaque nœud de calcul ; fusionner une pluralité de paires de clé/valeur délivrées par les cellules de la même clé sur différents nœuds de calcul ; utiliser un algorithme de 8 voisinages pour corriger la valeur d'élévation du bord du pavé ; et utiliser une liste de sortie de niveau supérieur <Clé, Pavé> en tant qu'entrée, calculer de manière circulaire le zoom et les données de largeur et de hauteur du pavé d'un niveau suivant, effectuer une segmentation, un échantillonnage et une fusion sur chaque nœud de calcul, et délivrer un pavé de niveau suivant jusqu'à ce que la circulation soit terminée.
PCT/CN2021/084081 2020-04-09 2021-03-30 Procédé de construction simultanée basé sur un système distribué pour des pavés de pyramide de dem massifs WO2021204026A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202010271605.XA CN111243091B (zh) 2020-04-09 2020-04-09 基于分布式系统的海量dem金字塔切片并行构建方法
CN202010271605.X 2020-04-09

Publications (1)

Publication Number Publication Date
WO2021204026A1 true WO2021204026A1 (fr) 2021-10-14

Family

ID=70871339

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/084081 WO2021204026A1 (fr) 2020-04-09 2021-03-30 Procédé de construction simultanée basé sur un système distribué pour des pavés de pyramide de dem massifs

Country Status (2)

Country Link
CN (1) CN111243091B (fr)
WO (1) WO2021204026A1 (fr)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114357104A (zh) * 2022-02-25 2022-04-15 北京嘉诚瑞杰信息技术有限公司 一种无索引地图切片聚合方法
CN116302488A (zh) * 2023-01-17 2023-06-23 重庆市地理信息和遥感应用中心(重庆市测绘产品质量检验测试中心) 一种地形图数据坐标多进程自动识别转换方法
CN117874301A (zh) * 2024-03-11 2024-04-12 浙江省气象台 基于网格数据金字塔切片的处理、存储、调用的实现方法

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111243091B (zh) * 2020-04-09 2020-07-24 速度时空信息科技股份有限公司 基于分布式系统的海量dem金字塔切片并行构建方法
CN112381715B (zh) * 2020-11-16 2024-04-09 航天科工(北京)空间信息应用股份有限公司 海量遥感影像并行生成地图瓦片的方法和装置
CN112883130A (zh) * 2021-01-05 2021-06-01 中国人民解放军国防科技大学 基于空间数据库输出地图高程数据的方法及设备、介质
CN113724229B (zh) * 2021-08-31 2023-07-28 北京英视睿达科技股份有限公司 高程差的确定方法、装置及电子设备
CN113989454B (zh) * 2021-12-30 2022-03-18 山东省地质测绘院 适用于地质数据和地理信息数据的融合方法、装置及系统
CN117724850B (zh) * 2024-02-06 2024-04-19 天津先进技术研究院 野外预通行路径可行性评估方法、系统、设备及介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110282635A1 (en) * 2010-05-14 2011-11-17 Conocophillips Company Stochastic downscaling algorithm and applications to geological model downscaling
CN103034999A (zh) * 2012-12-05 2013-04-10 上海创图网络科技发展有限公司 一种基于dem数据的金字塔切片方法
CN103455624A (zh) * 2013-09-16 2013-12-18 湖北文理学院 一种轻量级全球多维遥感影像网络地图服务实现方法
CN111243091A (zh) * 2020-04-09 2020-06-05 速度时空信息科技股份有限公司 基于分布式系统的海量dem金字塔切片并行构建方法

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6426714B1 (en) * 2001-06-26 2002-07-30 Nokia Corporation Multi-level quantizer with current mode DEM switch matrices and separate DEM decision logic for a multibit sigma delta modulator
US8477190B2 (en) * 2010-07-07 2013-07-02 Pictometry International Corp. Real-time moving platform management system
CN106815807B (zh) * 2017-01-11 2018-02-06 重庆市地理信息中心 一种基于gpu‑cpu协同的无人机影像快速镶嵌方法
CN107229742A (zh) * 2017-06-20 2017-10-03 华中科技大学 一种基于遥感大数据确定城市易涝点的方法

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110282635A1 (en) * 2010-05-14 2011-11-17 Conocophillips Company Stochastic downscaling algorithm and applications to geological model downscaling
CN103034999A (zh) * 2012-12-05 2013-04-10 上海创图网络科技发展有限公司 一种基于dem数据的金字塔切片方法
CN103455624A (zh) * 2013-09-16 2013-12-18 湖北文理学院 一种轻量级全球多维遥感影像网络地图服务实现方法
CN111243091A (zh) * 2020-04-09 2020-06-05 速度时空信息科技股份有限公司 基于分布式系统的海量dem金字塔切片并行构建方法

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114357104A (zh) * 2022-02-25 2022-04-15 北京嘉诚瑞杰信息技术有限公司 一种无索引地图切片聚合方法
CN116302488A (zh) * 2023-01-17 2023-06-23 重庆市地理信息和遥感应用中心(重庆市测绘产品质量检验测试中心) 一种地形图数据坐标多进程自动识别转换方法
CN116302488B (zh) * 2023-01-17 2024-01-23 重庆市地理信息和遥感应用中心(重庆市测绘产品质量检验测试中心) 一种地形图数据坐标多进程自动识别转换方法
CN117874301A (zh) * 2024-03-11 2024-04-12 浙江省气象台 基于网格数据金字塔切片的处理、存储、调用的实现方法
CN117874301B (zh) * 2024-03-11 2024-05-31 浙江省气象台 基于网格数据金字塔切片的处理、存储、调用的实现方法

Also Published As

Publication number Publication date
CN111243091A (zh) 2020-06-05
CN111243091B (zh) 2020-07-24

Similar Documents

Publication Publication Date Title
WO2021204026A1 (fr) Procédé de construction simultanée basé sur un système distribué pour des pavés de pyramide de dem massifs
CN103700088B (zh) 一种基于可变形图结构表示的图像集无监督共分割方法
CN113781667B (zh) 三维结构简化重建方法、装置、计算机设备和存储介质
US8224089B2 (en) Information processing device and information processing method, image processing device and image processing method, and computer program
CN110827398B (zh) 基于深度神经网络的室内三维点云自动语义分割方法
CN112257597B (zh) 一种点云数据的语义分割方法
CN109685080A (zh) 基于霍夫变换与区域生长的多尺度平面提取方法
CN112115534A (zh) 一种将三维房屋模型转换带高度属性的二维矢量面的方法
CN106815842A (zh) 一种改进的基于超像素的图像显著性检测方法
CN109741358B (zh) 基于自适应超图学习的超像素分割方法
CN115797592B (zh) 一种基于倾斜摄影三维模型自动生成建筑物体块的方法和装置
CN112364190B (zh) 一种球面图像索引方法及装置
CN116402973A (zh) 一种基于lod重构的倾斜摄影模型优化方法、系统
CN113177592A (zh) 一种图像分割方法、装置、计算机设备及存储介质
Dong et al. Rw-tree: A learned workload-aware framework for r-tree construction
CN102136151A (zh) 一种光栅图像的矢量化方法
CN112632303A (zh) 一种影像数据的分布式存储方法、分析方法及装置
Wu et al. A novel Building Section Skeleton for compact 3D reconstruction from point clouds: A study of high-density urban scenes
CN107918926B (zh) 一种基于四边形和三角形面片的数字图像放大方法
CN107492101B (zh) 基于自适应构造最优图的多模态鼻咽肿瘤分割算法
CN109961451A (zh) 一种基于边缘信息的材料晶粒组织分割方法
CN106651864B (zh) 一种面向高分辨率遥感图像的分割方法
CN115661398A (zh) 一种用于实景三维模型的建筑物提取方法、装置及设备
CN116416387B (zh) Osgb三维模型快速顶层重建方法
Otepka et al. A framework for generic spatial search in 3d point clouds

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 21785043

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 21785043

Country of ref document: EP

Kind code of ref document: A1