Methods, devices, equipment, media and products for determining flood inundation range

Through data chunking and compression storage technology, combined with seed spread algorithm and parallel computing, the existing flood flood range determination algorithm is solved inefficient and memory consumption in large-scale terrain data processing, and efficient identification of high-risk flooded areas is achieved. The capability of the , suitable for memory-constrained environments and improves computing efficiency.

CN118821631BActive Publication Date: 2024-11-22CHINA INST OF WATER RESOURCES & HYDROPOWER RES
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411306394.3
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-09-19
Publication Date
2024-11-22
Estimated Expiration
2044-09-19

AI Technical Summary

Technical Problem

The existing flood flood range determination algorithm is inefficient and has high memory consumption when processing large-scale terrain data, making it difficult to quickly and accurately determine the flood flood range.

Method used

Using data chunking and compressed storage technology, through seed spread algorithms and parallel computing, combined with Manning formula, reduce memory usage and improve computing efficiency, identify potentially high-risk flooded areas, adapt to memory-constrained computing environments, and use multi-threaded models Calculation saves calculation time.

Benefits of technology

It significantly reduces the computer memory burden, improves the applicability and flexibility of the algorithm, can quickly identify high-risk flooded areas, provide a basis for flood control resource allocation and emergency response, and improves computing efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118821631B_ABST
    Figure CN118821631B_ABST
Patent Text Reader

Abstract

The present invention discloses a method, device and equipment for determining flood inundation range. The medium and product relate to the technical field of flood disaster identification. The method for determining flood inundation range includes: obtaining section information, elevation information, strip height and compression block size; the section information includes: the latitude and longitude of the section point, the water level of the section and the corresponding time; the strip height is the pixel value of the segmented strip; the compression block size is the grid size of the segmented elevation data; data compression is performed on the section information, elevation information, strip height and compression block size to obtain strip-section-grid association information; based on the strip-section-grid association information, a seed spreading algorithm is used to determine the connected block; based on the connected block, the flood inundation range is determined. The above method in the present application can improve computing efficiency and reduce memory consumption.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of flood disaster identification technology, and in particular to a method, apparatus, equipment, medium and product for determining the extent of flood inundation. Background Technology

[0002] Floods are a common natural disaster that poses a significant threat to human society and the ecological environment. With the acceleration of global climate change and urbanization, the frequency and scope of flood disasters are showing an increasing trend. Flood disasters not only cause casualties and property damage but also have long-term impacts on infrastructure, agricultural production, and the ecological environment. Therefore, effectively predicting and assessing flood disasters is of great importance for flood prevention and disaster reduction efforts.

[0003] In flood disaster assessment and management, quickly and accurately determining the flood inundation area is crucial. Traditional flood simulation methods, such as those based on hydrodynamic models, offer high simulation accuracy but are computationally complex and time-consuming. With the development of GIS technology, flood inundation analysis methods based on DEM data have been widely used due to their simple calculations and ability to quickly determine the inundation area. However, existing algorithms suffer from inefficiency and high memory consumption when processing large-scale topographic data.

[0004] Therefore, how to provide a flood inundation simulation algorithm that can efficiently process large-scale DEM data has become an urgent problem to be solved in this field. Summary of the Invention

[0005] The purpose of this invention is to provide a method, apparatus, equipment, medium, and product for determining the extent of flood inundation, which can improve computational efficiency and reduce memory consumption.

[0006] To achieve the above objectives, the present invention provides the following solution:

[0007] Firstly, this application provides a method for determining the extent of flood inundation, the method comprising:

[0008] The system acquires cross-sectional information, elevation information, strip height, and compression block size. The cross-sectional information includes the latitude and longitude of the cross-section location, the water level of the cross-section, and the corresponding time. The strip height is the pixel value used to divide the strip. The compression block size is the grid size used to divide the elevation data.

[0009] The cross-sectional information, elevation information, strip height, and compression block size are compressed to obtain the strip-cross-section-grid association information;

[0010] Based on the associated information of the strip-section-mesh, a seed propagation algorithm is used to determine connected components;

[0011] The flood inundation range is determined based on the connected components.

[0012] Optionally, the data compression of the cross-sectional information, elevation information, strip height, and compression block size specifically includes the following steps:

[0013] Preset strip height;

[0014] The elevation information is divided into multiple strips based on the preset strip height.

[0015] Preset the grid size;

[0016] The multiple stripes are divided based on the pre-set grid size to obtain multiple grids;

[0017] The latitude and longitude of the grid are sequentially determined to be within the latitude and longitude range of the current strip. If they are, the current grid is bound to the current strip.

[0018] The grid is sequentially checked to see if it intersects with the cross section. When it intersects with the cross section, the grid is determined to belong to the cross section.

[0019] Determine whether the latitude and longitude of the cross section are within the latitude and longitude range of the strip. If they are, then determine the cross section contained in the strip.

[0020] The sections contained in the strip are bound and associated according to the strip-section-mesh.

[0021] Optionally, determining connected components using a seed propagation algorithm based on the strip-section-mesh association information specifically includes the following steps:

[0022] Traverse the strip information sequentially to obtain all grids under the current strip;

[0023] Calibrate the average elevation of the grid within the strip;

[0024] Read the input cross-sectional information, determine the intersection relationship between the cross-section and the grid, and if the cross-section intersects the grid, update the water level data of the grid intersecting the cross-section from the elevation value of the grid itself to the water level in the cross-sectional information.

[0025] Find all the submerged grids;

[0026] Define all submerged grids as a grid dictionary and obtain the corresponding stripes from the grid dictionary;

[0027] Based on the correlation between the latitude and longitude of the cross section and the corresponding grid of the strip, the correlation between the cross section and the flooded grid is obtained. The flooded grid of the cross section is used as the initial seed point for grid flooding, and the initial seed point is defined as the seed grid.

[0028] Find connected components based on the seed grid.

[0029] Optionally, finding connected components based on the seed grid specifically includes the following steps:

[0030] Get all seed grids in the current strip;

[0031] Randomly select any subgrid as the current seed grid;

[0032] Determine whether the current seed grid has been visited. If it has been visited, skip the seed grid and visit the next unvisited seed grid.

[0033] If it has not been visited, define an initial connected component and an initial queue; the initial connected component is empty; the initial queue includes any selected current seed grid.

[0034] Determine if the water level depth of the neighboring grids of the current seed grid is greater than zero. If it is greater than zero, it means that the seed grid is submerged, and the seed grid is added to the initial queue as a new grid.

[0035] The process is repeated until all seed grids have been visited, at which point the search for this round ends and all seed grids traversed in this round are saved to the initial connected component; the initial connected component represents a flooded area formed by the flooded grids.

[0036] Optionally, the flood inundation range determination method further includes, after determining the flood inundation range based on the connected components:

[0037] Obtain the compressed cross-sectional information, elevation information, strip height, and compression block size;

[0038] Based on the compressed cross-sectional information, elevation information, strip height, and compressed block size, and according to the current server resources, CPU, hard disk, and memory conditions, a process pool is constructed and divided into multiple processes; the number of processes corresponds to the cross-sectional time series data. When the input time series data is N hours of water level information, there are N corresponding processes, each performing seed spread algorithm flooding calculation for N hours.

[0039] The calculation results are then overwhelmed by integrating the seed spread algorithm over N hours.

[0040] The calculation results are then mapped onto the initial elevation map using GIS technology.

[0041] Optionally, the water level depth is calculated by subtracting the average elevation of the grid from the grid water level.

[0042] Secondly, this application provides a device for determining the extent of flood inundation, the device comprising:

[0043] The information acquisition module is used to acquire cross-sectional information, elevation information, strip height, and compression block size; the cross-sectional information includes: the latitude and longitude of the cross-section location, the water level of the cross-section, and the corresponding time; the strip height is the pixel value of the segmented strip; the compression block size is the grid size of the segmented elevation data;

[0044] The data compression module is used to compress the cross-sectional information, elevation information, strip height, and compression block size to obtain the strip-cross-section-grid association information;

[0045] The connected component determination module is used to determine connected components based on the strip-section-mesh association information using a seed propagation algorithm;

[0046] A flood inundation range determination module is used to determine the flood inundation range based on the connected blocks.

[0047] Thirdly, this application provides a computer device, including: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the steps of the flood inundation range determination method described in any one of the above.

[0048] Fourthly, this application provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of the flood inundation range determination method described in any one of the above descriptions.

[0049] Fifthly, this application provides a computer program product, including a computer program that, when executed by a processor, implements the steps of the flood inundation range determination method described in any one of the above descriptions.

[0050] According to specific embodiments provided by the present invention, the present invention discloses the following technical effects:

[0051] While traditional flood simulation methods employ hydrodynamic models with high accuracy, they are computationally complex and time-consuming. Static horizontal inundation algorithms suffer from inefficiency and high memory consumption when processing large-scale topographic data. This application utilizes data partitioning and compressed storage techniques to significantly reduce memory usage. By compressing the data within each strip, the algorithm retains only necessary elevation information and inundation status in memory, rather than the entire DEM dataset. This approach not only alleviates the burden on computer memory but also enables the algorithm to adapt to memory-constrained computing environments, improving its applicability and flexibility. Furthermore, by combining Manning's formula and the seed spread algorithm, the algorithm can identify potentially high-risk inundation areas, providing a basis for flood control resource allocation and emergency response. In addition to the algorithm's design, parallel computing is employed. By constructing a linear pool for multi-threaded model calculations and flexibly constructing process pools based on server performance, the seed spread simulation is performed in time slots, effectively saving computation time for the inundation grid. Attached Figure Description

[0052] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0053] Figure 1 A flowchart illustrating the method for determining the flood inundation area provided in this application;

[0054] Figure 2 The multi-process computation flowchart provided in this application;

[0055] Figure 3 A schematic diagram of the rendering result of mesh flooding provided in this application;

[0056] Figure 4 This is a schematic diagram of the structure of a computer device provided in this application. Detailed Implementation

[0057] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, and not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0058] This application has the following three main purposes:

[0059] First, design a method for striping and gridding elevation data, which divides a large-scale terrain area into multiple strip files based on its height, stores them on a hard drive, and then performs gridding processing on the strips.

[0060] Second, a calculation method for connecting submerged grid regions is designed. By collecting information from the set cross-sections, associating the grid elevations corresponding to the cross-sections, and obtaining the submerged point grids, the breadth-first traversal of the graph is adopted according to the logic of the seed spread algorithm to calculate the other adjacent submerged grids and construct the connected regions.

[0061] Third, a parallel computing method for processing large-scale time-series data is designed. The seed spread algorithm belongs to the static horizontal flooding algorithm. It adopts the parallel design concept and divides the calculation into multiple modules according to the CPU performance, which effectively saves the calculation time of the flooding grid.

[0062] To achieve the above objectives, this application provides three sub-modules: data compression, connected component search, and multi-process computation.

[0063] Data compression involves binding the water level and elevation data to a grid, following the strip order and the cross-sectional indexes contained within each strip, and then performing inundation point analysis to determine the initial inundation points. This mainly includes strip division and cross-sectional association: Strip division refers to dividing the current elevation data into regions based on the strip width and saving the blocks to the hard drive; cross-sectional association includes two parts: cross-sectional flow conversion and cross-sectional grid association. Cross-sectional flow conversion involves calculating the flow rate of a known cross-section based on the river's inflow and outflow and the cross-sectional mileage, and then extrapolating the cross-sectional water level data using the Manning formula; cross-sectional grid association binds the corresponding strip modules based on the cross-sectional latitude and longitude, recording and storing the indexes of the cross-sections existing within that strip.

[0064] The method for finding connected components is based on the seed flooding algorithm of the flooded point grid and surrounding grids. It uses a breadth-first search traversal algorithm to calculate the connected components, and finally saves the calculated results for GIS rendering.

[0065] Multi-process computing enables parallel execution of tasks by creating independent processes at the operating system level. Each process has its own memory space, preventing the crash of one process from affecting others, thus improving program stability. Simultaneously, since each process can run independently on a different CPU core, it allows programs to fully utilize the advantages of multi-core processors, achieving efficient resource allocation and rapid task completion. This parallel processing capability is particularly important when handling large amounts of data or complex calculations, as it can significantly reduce waiting time and improve overall computational efficiency and performance. Furthermore, multi-processing facilitates error isolation and resource management, enhancing program maintainability and scalability. In flood-related tasks, it can significantly improve the efficiency of result computation.

[0066] To make the above-mentioned objectives, features and advantages of this application more apparent and understandable, the application will be further described in detail below with reference to the accompanying drawings and specific embodiments.

[0067] Example 1

[0068] Figure 1 The flowchart of the method for determining the flood inundation range provided in this application is as follows: Figure 1 As shown, the method in this application includes:

[0069] Step 101: Obtain cross-section information, elevation information, strip height, and compression block size; the cross-section information includes: the latitude and longitude of the cross-section point, the water level of the cross-section, and the corresponding time; the strip height is the pixel value of the strip division, which defaults to 4096 pixels and can be specified during input; the compression block size is the grid size of the elevation data division, which defaults to a pixel range of 128*128 and can be specified during input; the elevation information includes the DEM file of the elevation data.

[0070] Step 102: Compress the cross-sectional information, elevation information, strip height, and compression block size to obtain the association information of strip-cross-section-grid.

[0071] Specifically, the original elevation file is divided into multiple strips based on a pre-set strip height (4096m, adjustable upon input). Within each strip, the grid is further subdivided according to a pre-set grid size (32m, adjustable upon input), and each grid block is bound to a strip (a grid belongs to a strip if its latitude and longitude fall within the range of the strip's latitude and longitude). Then, the strip-section-grid combination is established based on the cross-section's latitude and longitude (the strip data includes the strip ID and its corresponding latitude and longitude, the cross-section data includes the cross-section information and its corresponding latitude and longitude, and the grid information includes the corresponding grid ID and the grid's latitude and longitude). The latitude and longitude are used to determine whether the grid intersects with the cross section. If it intersects with the cross section, the grid is determined to belong to that cross section. Then, the latitude and longitude of the cross section are determined to be within the latitude and longitude range of the strip to identify the cross sections contained in the strip. Finally, the strip-cross section-grid are associated, and the corresponding index of the cross section is recorded. Finally, the elevation data is striped and saved in batches as elevation files (tif). According to the correspondence of the grids, the grid information (including grid ID, grid latitude and longitude, etc.) contained in different strips is saved as a data file (dat) according to the strip number.

[0072] Step 103: Based on the association information of the strip-section-mesh, the seed propagation algorithm is used to determine the connected components.

[0073] The seed spread algorithm takes cross-sectional information, strip information, and compressed grid information as input, associates the grids in the strips with the cross-sections based on latitude and longitude data, and then determines whether the grid is submerged based on whether the water level in the cross-section is higher than the minimum height data of the grid. The submerged grids are used as the initial grids for seed spread as seed points. The algorithm uses breadth-first search to find adjacent connected grids, constructs connected components, and marks the connected components that meet the conditions as output.

[0074] The core module of this algorithm is to determine the inundation point. This involves identifying the seed inundation point and then merging the inundation grids using a breadth-first search approach to form connected components. After receiving cross-sectional grid information, striped elevation data, cross-sectional and striped indices, and time-series data of the cross-section, this module traverses the striped grid data containing cross-sectional information. It updates the time-series water level based on the cross-sectional information, updates the initial water level parameters of the grid, calibrates the average elevation of the grid within the strip (correcting the elevation of the boundary region), and calculates the inundation depth (using grid water level minus average grid elevation) to obtain a grid list for each strip.

[0075] After obtaining the grid list, it is combined with the cross-section information to obtain the initial grid points for seed flooding. The seed grid is saved based on the correlation between the cross-section latitude and longitude and the corresponding grids of the strips. Using the initial grid points for seed flooding as the initial flooding points, connected component lookup is performed. The specific logical steps are as follows:

[0076] Step 1031: Based on the previous strip association information (i.e., the strip-section-mesh association information in step 102), traverse the strip information in order to obtain all the meshes under the current strip;

[0077] Step 1032: Calibrate the average elevation of the grid within the strip (repair the elevation of the boundary area. Repair the elevation data of the boundary, handle outliers, fill in missing values, etc., to facilitate the calculation of subsequent average elevation), calculate the flooding depth (using the grid water level - grid average elevation method, when the grid water level is higher than the grid average elevation, it means that the grid is flooded), and obtain the strip and the corresponding dictionary of all grids;

[0078] Step 1033: Read the input cross-sectional information, determine the intersection relationship between the cross-section and the grid, and if the cross-section intersects with the grid, update the water level data of the grid intersecting with the cross-section from the elevation value of the grid itself to the water level in the cross-sectional information.

[0079] Step 1034: Based on the correlation between the latitude and longitude of the cross section and the corresponding grid of the strip, obtain the correlation between the cross section and the flooded grid, and use the flooded grid of the cross section as the initial seed point for grid flooding, which will be referred to as the seed grid thereafter.

[0080] Step 1035: The connected component search module needs to traverse all seed grids in the current strip, randomly setting the current seed grid as the selected seed grid. It checks if the grid has been visited. If visited, it skips the selected seed grid and visits the next unvisited seed grid. If unvisited, it defines an initial connected component and an initial queue (both set to null). The initial queue initially contains only the selected seed grid itself. Later, it checks whether neighboring grids of the selected grid need to be added to the queue. This check is based on whether the water level depth (grid water level - average grid elevation) of the neighboring grid is greater than zero. If the grid is submerged, it can be added to the queue as a new grid. This process is repeated, traversing the grids in the queue until the queue is empty. At this point, the search ends, and all grids traversed in this round are saved to the initial connected component, indicating that these submerged grids form a complete submerged area. When other seed grids are encountered in the queue during the search, the water level information is updated before further checks. This real-time updating method ensures the accuracy of the submersion.

[0081] Step 1036: Determine if the grids are adjacent, if the grid is submerged, and if the neighboring grids have not been visited. If the conditions are met, proceed to step 1037; otherwise, continue traversing the grid information in the queue.

[0082] Step 1037: Determine whether the grid belongs to the cross-section grid. If so, update the water level and grid depth, and add the neighboring grid to the queue. Otherwise, continue to traverse the grid information in the queue until the queue is empty. Output the connected component information and save the grid information of the connected component (grid ID, connected component ID, grid latitude and longitude, grid depth).

[0083] Traditional academic research seed spread algorithms often use uniform water level data. In the algorithm of this application, the water level can be flexibly adjusted according to the cross-sectional information. The more accurate the cross-sectional information, the more accurate the water level information of the submerged grid.

[0084] Step 104: Determine the flood inundation range based on the connected components.

[0085] Step 105: Obtain the compressed cross-sectional information, elevation information, strip height, and compressed block size;

[0086] Step 106: Based on the compressed cross-sectional information, elevation information, strip height, and compressed block size, and according to the current server resources, CPU, hard disk, and memory conditions, construct a process pool and divide it into multiple processes; the number of processes corresponds to the cross-sectional time series data. When the input time series data is N hours of water level information, then there are N processes, and the seed spread algorithm is used to calculate the flooding for each of the N hours.

[0087] Step 107: Integrate the flooding calculation results of the seed spread algorithm over N hours (including grid ID, connected component ID, grid latitude and longitude, and grid flooding depth), and output the results after integrating the grid data at different times;

[0088] Step 108: Map the calculation results onto the initial elevation map using GIS technology.

[0089] Steps 106-108 above involve multi-process computation; see [link / reference]. Figure 2 Multi-process computation involves scheduling data compression and seed propagation algorithms. When data needs to be computed at multiple time points, it is divided into different time points for data compression and seed propagation computation. After the model receives elevation data, cross-section and strip indexes, and cross-section time-series data, multi-process computation splits the time-series data into cross-section information at multiple time points, and then performs seed propagation flood simulation under the elevation data.

[0090] The above multi-process computation flexibly constructs the process pool based on server performance (the process pool size will default to the number of CPU cores in the system), and simulates seed spread in time periods (including obtaining compressed data and seed list, graph breadth-first traversal, finding connected components, etc.). After the simulation is completed, the context manager set in the code will automatically manage the life cycle of the process pool to ensure that all processes are properly closed after the task is completed. Finally, the results of each time period are sorted and summarized and saved as a DataFrame. Later, it can be output as a CSV file or stored in a database as needed for the project.

[0091] Following the above approach, an inundation analysis was conducted on a watershed in Yunnan Province. Using elevation data from the China Institute of Water Resources and Hydropower Research, and after linking the watershed cross-sectional data with GIS, the data was input into a data compression stage. The output strip information and the grid information contained within the strips were then input into a connectivity module. Finally, the grid information (grid ID, grid latitude and longitude, and the corresponding inundation depth) was output. The grid data was then mapped onto an initial elevation map using GIS technology, and the grid inundation rendering results were obtained. Figure 3 As shown, the shades of black reflect changes in elevation, and the grid points indicate submerged locations.

[0092] Example 2

[0093] Based on the same inventive concept, this application also provides a flood inundation range determination device for implementing the flood inundation range determination method described above. The solution provided by this device is similar to the solution described in the above method; therefore, the specific limitations in one or more embodiments of the flood inundation range determination device provided below can be found in the limitations of the flood inundation range determination method described above, and will not be repeated here.

[0094] In one exemplary embodiment, a flood inundation range determination device is provided, comprising:

[0095] The information acquisition module is used to acquire cross-sectional information, elevation information, strip height, and compression block size; the cross-sectional information includes: the latitude and longitude of the cross-section location, the water level of the cross-section, and the corresponding time; the strip height is the pixel value of the segmented strip; the compression block size is the grid size of the segmented elevation data;

[0096] The data compression module is used to compress the cross-sectional information, elevation information, strip height, and compression block size to obtain the strip-cross-section-grid association information;

[0097] The connected component determination module is used to determine connected components based on the strip-section-mesh association information using a seed propagation algorithm;

[0098] A flood inundation range determination module is used to determine the flood inundation range based on the connected blocks.

[0099] In one exemplary embodiment, a computer device is provided, which may be a server or a terminal, and its internal structure diagram may be as follows. Figure 4 As shown, the computer device includes a processor, memory, input / output (I / O) interfaces, and a communication interface. The processor, memory, and I / O interfaces are connected via a system bus, and the communication interface is also connected to the system bus via the I / O interfaces. The processor provides computational and control capabilities. The memory includes non-volatile storage media and internal memory. The non-volatile storage media stores the operating system, computer programs, and a database. The internal memory provides the environment for the operation of the operating system and computer programs stored in the non-volatile storage media. The database stores data for determining flood inundation extent. The I / O interfaces are used for exchanging information between the processor and external devices. The communication interface is used for communicating with external terminals via a network connection. When executed by the processor, the computer program implements a method for determining flood inundation extent.

[0100] Those skilled in the art will understand that Figure 4 The structure shown is merely a block diagram of a portion of the structure related to the present application and does not constitute a limitation on the computer device to which the present application is applied. Specific computer devices may include more or fewer components than those shown in the figure, or combine certain components, or have different component arrangements.

[0101] In one exemplary embodiment, a computer device is also provided, including a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to implement the steps in the above-described method embodiments.

[0102] In one exemplary embodiment, a computer-readable storage medium is provided storing a computer program that, when executed by a processor, implements the steps in the above-described method embodiments.

[0103] In one exemplary embodiment, a computer program product is provided, including a computer program that, when executed by a processor, implements the steps in the above-described method embodiments.

[0104] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, data stored, data displayed, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties, and the collection, use and processing of the relevant data must comply with relevant regulations.

[0105] Those skilled in the art will understand that all or part of the processes in the above embodiments can be implemented by a computer program instructing related hardware. The computer program can be stored in a non-volatile computer-readable storage medium. When executed, the computer program can include the processes of the embodiments described above. Any references to memory, databases, or other media used in the embodiments provided in this application can include at least one of non-volatile and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. By way of illustration and not limitation, RAM can take many forms, such as Static Random Access Memory (SRAM) or Dynamic Random Access Memory (DRAM).

[0106] The databases involved in the embodiments provided in this application may include at least one type of relational database and non-relational database. Non-relational databases may include, but are not limited to, blockchain-based distributed databases. The processors involved in the embodiments provided in this application may be general-purpose processors, central processing units, graphics processing units, digital signal processors, programmable logic devices, quantum computing-based data processing logic devices, etc., and are not limited to these.

[0107] The technical features of the above embodiments can be combined in any way. For the sake of brevity, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0108] This document uses specific examples to illustrate the principles and implementation methods of this application. The descriptions of the above embodiments are only for the purpose of helping to understand the methods and core ideas of this application. Furthermore, those skilled in the art will recognize that, based on the ideas of this application, there will be changes in the specific implementation methods and application scope. Therefore, the content of this specification should not be construed as a limitation of this application.

Claims

1. A method for determining a flood inundation range, characterized in that: The method for determining the flood inundation range comprises: Obtain section information, elevation information, strip height and compressed block size; the section information includes: the latitude and longitude of the section point, the water level of the section and the corresponding time; the strip height is the pixel value of the segmented strip; the compressed block size is the grid size of the segmented elevation data; Compressing the cross-section information, elevation information, strip height and compression block size to obtain strip-section-grid association information; Determine the connected blocks using a seed spreading algorithm based on the strip-section-grid association information; Determine the flood inundation range based on the connected blocks; wherein The data compression of the cross-section information, elevation information, strip height and compression block size specifically includes the following steps: Preset strip height; Dividing the elevation information into a plurality of strips based on the preset strip height; Preset grid size; Dividing the plurality of strips based on the preset grid size to obtain a plurality of grids; Determine in turn whether the longitude and latitude of the grid are within the longitude and latitude range of the current strip, and if so, bind the current grid to the current strip; Determining in sequence whether the grid intersects with the cross section, and when the grid intersects with the cross section, determining that the grid belongs to the cross section; Determine whether the longitude and latitude of the section are within the longitude and latitude range of the strip. If so, determine the section included in the strip. Bind the sections contained in the strip according to strip-section-grid; Determining the connected blocks using a seed spreading algorithm based on the strip-section-grid association information specifically includes the following steps: Traverse the strip information in order and obtain all the grids under the current strip; Calibrate the grid mean elevation within the strip; Read the input section information, determine the intersection relationship between the section and the grid, and if the section intersects the grid, update the water level data of the grid intersecting with the section from the elevation value of the grid itself to the water level in the section information; Find all flooded grids; Define all flooded grids as grid dictionaries and obtain the strips corresponding to the grid dictionaries; According to the association relationship between the longitude and latitude of the section and the grid corresponding to the strip, the association between the section and the submerged grid is obtained, the submerged grid in the section is used as the initial seed point of the grid submergence, and the initial seed point is defined as the seed grid; Finding connected blocks based on the seed grid; wherein Searching for connected blocks based on the seed grid specifically includes the following steps: Get all seed grids in the current strip; Randomly select any sub-grid as the current seed grid; Determine whether the current seed grid has been visited, if it has been visited, skip the seed grid and visit the next seed grid that has not been visited; If it has not been visited, an initial connected block and an initial queue are defined; the initial connected block is a null value; the initial queue includes an arbitrarily selected current seed grid; Determine whether the water level depth of the adjacent grid of the current seed grid is greater than zero. If it is greater than zero, it means that the seed grid is submerged, and the seed grid is added to the initial queue as a new grid; The process is repeated until all seed grids have been visited, and then this round of search ends and all seed grids traversed in this round are saved in the initial connected block; the initial connected block indicates that the submerged grids form a complete submerged area.

2. The method for determining flood inundation range according to claim 1, characterized in that: The flood inundation range determination method further comprises, after the step of determining the flood inundation range based on the connected blocks: Obtain cross-section information, elevation information, strip height and compressed block size after data compression; Based on the cross-sectional information, elevation information, strip height and compressed block size after the data compression, a process pool is constructed according to the current server resources, CPU, hard disk and memory conditions, and divided into multiple processes; the number of processes corresponds to the cross-sectional time series data. When the input time series data is the water level information of N hours, it corresponds to N processes, and the seed spreading algorithm flooding calculation is performed for N hours respectively; Integrate N hours of seed spreading algorithm to flood the calculation results; The calculation results are mapped onto the initial elevation map through GIS technology.

3. The method for determining flood inundation range according to claim 1, characterized in that: The water level depth is calculated by subtracting the grid average elevation from the grid water level.

4. A device for determining a flood inundation range, characterized in that: The flood inundation range determination device comprises: The information acquisition module is used to obtain section information, elevation information, strip height and compressed block size; the section information includes: the longitude and latitude of the section point, the water level of the section and the corresponding time; the strip height is the pixel value of the segmented strip; the compressed block size is the grid size of the segmented elevation data; A data compression module, used for compressing the cross-section information, elevation information, strip height and compression block size to obtain strip-section-grid association information; A connected block determination module, used for determining connected blocks by using a seed spreading algorithm based on the strip-section-grid association information; A flood inundation range determination module is used to determine the flood inundation range based on the connected blocks; wherein The data compression of the cross-section information, elevation information, strip height and compression block size specifically includes the following steps: Preset strip height; Dividing the elevation information into a plurality of strips based on the preset strip height; Preset grid size; Dividing the plurality of strips based on the preset grid size to obtain a plurality of grids; Determine in turn whether the longitude and latitude of the grid are within the longitude and latitude range of the current strip, and if so, bind the current grid to the current strip; Determining in sequence whether the grid intersects with the cross section, and when the grid intersects with the cross section, determining that the grid belongs to the cross section; Determine whether the longitude and latitude of the section are within the longitude and latitude range of the strip. If so, determine the section included in the strip. Bind the sections contained in the strip according to strip-section-grid; Determining the connected blocks using a seed spreading algorithm based on the strip-section-grid association information specifically includes the following steps: Traverse the strip information in order and obtain all the grids under the current strip; Calibrate the grid mean elevation within the strip; Read the input section information, determine the intersection relationship between the section and the grid, and if the section intersects the grid, update the water level data of the grid intersecting with the section from the elevation value of the grid itself to the water level in the section information; Find all flooded grids; Define all flooded grids as grid dictionaries and obtain the strips corresponding to the grid dictionaries; According to the association relationship between the longitude and latitude of the section and the grid corresponding to the strip, the association between the section and the submerged grid is obtained, the submerged grid in the section is used as the initial seed point of the grid submergence, and the initial seed point is defined as the seed grid; Finding connected blocks based on the seed grid; wherein Searching for connected blocks based on the seed grid specifically includes the following steps: Get all seed grids in the current strip; Randomly select any sub-grid as the current seed grid; Determine whether the current seed grid has been visited, if it has been visited, skip the seed grid and visit the next seed grid that has not been visited; If it has not been visited, an initial connected block and an initial queue are defined; the initial connected block is a null value; the initial queue includes an arbitrarily selected current seed grid; Determine whether the water level depth of the adjacent grid of the current seed grid is greater than zero. If it is greater than zero, it means that the seed grid is submerged, and the seed grid is added to the initial queue as a new grid; The process is repeated until all seed grids have been visited, and then this round of search ends and all seed grids traversed in this round are saved in the initial connected block; the initial connected block indicates that the submerged grids form a complete submerged area.

5. A computer device comprising: A memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the flood inundation range determination method according to any one of claims 1 to 3.

6. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the method for determining a flood inundation range described in any one of claims 1 to 3 is implemented.

7. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the method for determining a flood inundation range described in any one of claims 1 to 3 is implemented.