A method and system for storing discrete data

Abstract

The application provides a discrete data storage method and system, the method comprising: establishing a grid system according to the distribution area of discrete data and a preset grid size, and constructing a search circle ring set corresponding to each grid vertex in the grid system with each grid vertex as a center; respectively traversing each search circle ring corresponding to each grid vertex, performing first weighting processing on each discrete sub-data according to the distance between the discrete sub-data covered by the current traversed circle ring and the center of the current traversed circle ring, and obtaining a plurality of first weighted data corresponding to each grid vertex; respectively performing second weighting processing on the plurality of first weighted data corresponding to each grid vertex according to the outer circle radius of the search circle ring where the first weighted data is located, obtaining second weighted data corresponding to each grid vertex, and storing the second weighted data in the corresponding grid vertex, thereby improving the efficiency and accuracy of regularizing storage of discrete data.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of visualization processing, and in particular to a discrete data storage method and system. BACKGROUND

[0002] With the continuous improvement of computer performance, the amount of result data of related simulation calculation is also increasing. Therefore, regularizing processing of discrete data of calculation results is an important means to improve data search efficiency, structured management and analysis of spatial data. Discrete data regularization can organize and manage data according to regular grid cells, making data easy to manage and maintain, and can improve data accessibility and usability. At the same time, the discrete data regularization storage method can adjust the precision and scale of the grid according to the demand. By flexibly adjusting the size and density of the grid, data storage and analysis can be performed at different precision and scale. This makes the discrete data regularization storage method suitable for various data requirements and application scenarios.

[0003] However, the existing discrete data gridding processing method still has some problems: when the discrete data is sparse in some areas, gridding processing may cause the data in these sparse areas to be blurred or lost; when processing large-scale and high-dimensional discrete data, the existing processing method considers the data points in a larger area near the target point to obtain a more accurate result, which greatly increases the complexity of the calculation; when the data to be processed has some geographical or spatial characteristics, the data points change along a certain rule or pattern, such as circular change or gradient change, the existing processing method is usually to establish a symmetric region centered on the target point and consider the data points in the symmetric region to obtain the interpolation result of the target point. This method of directly weighting and interpolating the data points in the same range symmetric region near the target point according to the distance cannot capture the spatial variability. SUMMARY

[0004] The present application provides a discrete data storage method and system, which improves the efficiency and accuracy of regularizing storage of discrete data.

[0005] In order to solve the above technical problems, in a first aspect, the embodiments of the present application provide a discrete data storage method, comprising:

[0006] According to the distribution area of the discrete data and the preset grid size, a grid system is established; wherein the discrete data includes a plurality of discrete sub-data;

[0007] respectively, each grid vertex in the grid system as the center of a circle, to construct a search ring set corresponding to each grid vertex; wherein each search ring set includes several search rings; the search ring includes: the semicircle ring between adjacent concentric semicircles and the area within the smallest concentric semicircle; the radii of the concentric semicircles are different, and each of the concentric semicircles is in the opposite direction of the data flow of the discrete data in the coverage direction of the grid system;

[0008] respectively, each grid vertex in the grid system as the center of a circle, to construct a search ring set corresponding to each grid vertex; wherein each search ring set includes several search rings; the search ring includes: the semicircle ring between adjacent concentric semicircles and the area within the smallest concentric semicircle; the radii of the concentric semicircles are different, and each of the concentric semicircles is in the opposite direction of the data flow of the discrete data in the coverage direction of the grid system;

[0009] respectively, each grid vertex in the grid system as the center of a circle, to construct a search ring set corresponding to each grid vertex; wherein each search ring set includes several search rings; the search ring includes: the semicircle ring between adjacent concentric semicircles and the area within the smallest concentric semicircle; the radii of the concentric semicircles are different, and each of the concentric semicircles is in the opposite direction of the data flow of the discrete data in the coverage direction of the grid system;

[0010] The embodiment of the application provides a discrete data storage method, which establishes a grid system by distributing the discrete data, generates a plurality of grid vertices; the discrete data is stored in all grid vertices of the grid system, wherein a plurality of search semicircles with different radii are established for each grid vertex, and the target data is weighted and mapped into the search semicircle according to the distance from the target data to the current grid vertex; then the data in the search semicircle is weighted and mapped into the current grid vertex according to the radius of each search semicircle, to realize regular storage of the discrete data. By dividing the distribution area of the discrete data into a plurality of circular rings, the mapping in each circular ring is performed first, and in the case that the discrete data is relatively sparse, more data points can be used to estimate the value of the current grid vertex, thereby improving the accuracy of regular storage of the discrete data. Through the method of twice weighted mapping, the accuracy and detail level of the mapping can be controlled in each search ring, so that the mapping result is more in line with the actual situation, and the accuracy of regular storage of the discrete data is improved. The search ring is established in the opposite direction of the data flow, which can more highlight and accurately reflect the change trend in the direction, effectively suppress the noise or interference signal in other directions, and further improve the accuracy of regular storage. In addition, since only the data around the data flow direction of the current grid vertex is considered, the amount of data to be processed and calculated can be reduced, and the efficiency of regular storage is improved.

[0011] Further, the grid system is established according to the distribution area of the discrete data and the preset grid size, specifically:

[0012] According to a distribution region of the discrete data and a preset grid size, the distribution region of the discrete data is divided into a plurality of grids;

[0013] A rectangular coordinate system is established with the center of the distribution region of the discrete data as an origin, coordinates of all the discrete data and coordinates of vertices of each of the grids are determined, and a grid system is formed.

[0014] The embodiment of the application provides a method for establishing a grid system according to a distribution region of discrete data and a preset grid size, the distribution region of the discrete data is divided into a plurality of grids, corresponding grid vertices can be generated for storing the discrete data, a rectangular coordinate system is established for the distribution region of the discrete data, the relative positions of each grid vertex and the discrete data can be accurately expressed, the distance from the discrete data to the grid vertex can be calculated, and the accuracy of regularized storage of the discrete data is improved.

[0015] In a possible implementation manner, the first weighting processing is performed on each discrete sub-data according to the distance between the discrete sub-data and the center of the current traversal circle, and the first weighted data corresponding to the current traversal circle is determined, and the first weighting processing is specifically as follows:

[0016] The reciprocal sum of the distance from each discrete sub-data in the current traversal circle to the center of the current traversal circle is calculated.

[0017] The weight of each discrete sub-data in the current traversal circle in the first weighting processing is calculated according to the distance from each discrete sub-data in the current traversal circle to the center of the current traversal circle.

[0018] The data value of each discrete sub-data in the current traversal circle is first weighted according to the weight of each discrete sub-data in the current traversal circle in the first weighting processing, and the first weighted data corresponding to the current traversal circle is determined.

[0019] The embodiment of the application provides a method for first weighting and summing all discrete sub-data in the current search circle, the distance from the discrete sub-data to the grid vertex is calculated, the weight of each discrete sub-data in the first weighting processing is determined, and the first weighting processing is performed according to the weight, and the first weighted data is obtained. In order to fully consider the influence of each target data on the grid vertex, the reciprocal of the distance is used to determine the weight of each target data, so that the first weighting processing of each discrete sub-data is more reasonable and accurate.

[0020] Further, the reciprocal sum of the distance from each discrete sub-data in the current traversal circle to the center of the current traversal circle is calculated, and the specific formula is as follows:

[0021]

[0022] wherein, is the reciprocal sum of the distance from all discrete sub-data in the current traversed annulus to the center of the current traversed annulus, D i is the Euclidean distance from the i-th discrete sub-data in the current traversed annulus to the current traversed annulus, S0is the number of discrete sub-data in the current traversed annulus;

[0023] The weight of each discrete sub-data in the current traversed annulus in the first weighting processing is calculated according to the distance from each discrete sub-data in the current traversed annulus to the center of the current traversed annulus, and the specific formula is:

[0024]

[0025] wherein, w i is the weight of the i-th discrete sub-data in the current traversed annulus in the first weighting processing;

[0026] The data value of each discrete sub-data in the current traversed annulus is subjected to the first weighting processing according to the weight of each discrete sub-data in the current traversed annulus in the first weighting processing, and the first weighted data corresponding to the current traversed annulus is determined, and the specific formula is:

[0027]

[0028] wherein, F0is the first weighted data corresponding to the current traversed annulus, f i is the data value of the i-th target data in the current traversed annulus.

[0029] In a possible implementation manner, the second weighting processing is performed on the plurality of first weighted data corresponding to each grid vertex respectively according to the outer radius of the search annulus where each first weighted data is located, the second weighted data corresponding to each grid vertex is obtained, and each second weighted data is stored on the corresponding grid vertex, and the specific process is as follows:

[0030] The reciprocal sum of the outer radius of all search annuli corresponding to each grid vertex is calculated respectively;

[0031] The weight of the plurality of first weighted data in the second weighting processing is calculated according to the outer radius of the search annulus where each first weighted data is located;

[0032] The second weighting processing is performed on the plurality of first weighted data corresponding to each grid vertex respectively according to the weight of the plurality of first weighted data in the second weighting processing, the second weighted data corresponding to each grid vertex is obtained, and each second weighted data is stored on the corresponding grid vertex.

[0033] The embodiment of the present application provides a method for performing second weighting processing on first weighted data, determines the weight of each first weighted data in the second weighting processing by calculating the reciprocal sum of the outer radius of a circle ring, and performs the second weighting processing according to the weight, and maps the first weighted data corresponding to the current grid vertex into the current grid vertex. The method analogizes the first weighted data to common discrete data, analogizes the outer radius of the circle ring to the distance from the discrete data to the grid vertex, performs the second distance reciprocal weighting summation, and also considers that the influence of the first weighted data on the grid vertex is different at different distances, uses the reciprocal of the outer radius of the circle ring to determine the weight of each first weighted data, and improves the accuracy of regularized storage of the discrete data.

[0034] Further, the reciprocal sum of the outer radius of each search circle corresponding to each grid vertex is calculated respectively, and the specific formula is as follows:

[0035]

[0036] Wherein, is the reciprocal sum of the radius of all search circle rings corresponding to the current grid vertex, R j is the outer radius of the jth search circle ring corresponding to the current grid vertex, and N is the number of search circle rings corresponding to the current grid vertex.

[0037] The weight of the plurality of first weighted data in the second weighting processing is calculated according to the outer radius of the search circle ring where the first weighted data is located, and the specific formula is as follows:

[0038]

[0039] Wherein, is the weight of the jth first weighted data corresponding to the current grid vertex in the second weighting processing.

[0040] The plurality of first weighted data corresponding to each grid vertex is respectively subjected to the second weighting processing according to the weight of the plurality of first weighted data in the second weighting processing, the second weighted data corresponding to each grid vertex is obtained, and each second weighted data is stored in the corresponding grid vertex, and the specific formula is as follows:

[0041]

[0042] Wherein, F (X，Y) is the storage result of the second weighted data corresponding to the current grid vertex, (X, Y) is the coordinate of the current grid vertex, and F j is the jth first weighted data corresponding to the current grid vertex.

[0043] In a possible implementation manner, radii of adjacent semicircles in the search circle set corresponding to each grid vertex are fixed first preset values, a radius of a smallest semicircle in the concentric semicircles is one tenth of a shortest side length in the grid system, and the first preset values are one half of the radius of the smallest semicircle.

[0044] The embodiment of the present application further limits the radius of the smallest semicircle in the concentric semicircles and the size of the first preset value. The radius of the smallest semicircle and the first preset value determine the area of each search circle, further determine the amount of data that can be searched in each circle, and the amount of discrete data that needs to be stored around the grid vertex. By adjusting the size of the two parameters, the smoothness and accuracy of the interpolation result can be better controlled, and the efficiency of regularizing storage of discrete data can be improved.

[0045] In a second aspect, the embodiment of the present application also provides a discrete data storage system, which comprises a grid system establishing module, a search circle constructing module, a first weighting processing module and a second weighting processing module.

[0046] The grid system establishing module is configured to establish a grid system according to a distribution region of discrete data and a preset grid size, wherein the discrete data comprises a plurality of discrete sub-data.

[0047] The search circle constructing module is configured to construct a search circle set corresponding to each grid vertex in the grid system with each grid vertex as a center, wherein each search circle set comprises a plurality of search circles; the search circle comprises a semicircle ring between adjacent concentric semicircles and a region in the smallest concentric semicircle; the concentric semicircles have different radii, and the concentric semicircles are in a data flow direction of the discrete data in a covering direction of the grid system.

[0048] The first weighting processing module is configured to traverse each search circle corresponding to each grid vertex, perform first weighting processing on each discrete sub-data according to a distance between the discrete sub-data and a center of a current traversed circle, determine first weighting data corresponding to the current traversed circle, and then obtain a plurality of first weighting data corresponding to each grid vertex.

[0049] The second weighting processing module is configured to perform second weighting processing on the plurality of first weighting data corresponding to each grid vertex according to an outer radius of a search circle where the first weighting data is located, obtain second weighting data corresponding to each grid vertex, and store the second weighting data in the corresponding grid vertex.

[0050] Further, the grid system establishing module is configured to establish a grid system according to a distribution region of the discrete data and a preset grid size, specifically:

[0051] According to the distribution region of the discrete data and the preset grid size, the distribution region of the discrete data is divided into a plurality of grids;

[0052] A rectangular coordinate system is established with the center of the distribution region of the discrete data as the origin, the coordinates of all the discrete data and the coordinates of the vertices of each grid are determined, and a grid system is formed.

[0053] In a possible implementation, the first weighting processing module is configured to perform first weighting processing on each discrete sub-data according to the distance between the discrete sub-data and the center of the current traversed annulus, to determine the first weighted data corresponding to the current traversed annulus, specifically:

[0054] The first weighting processing module is configured to calculate the reciprocal sum of the distances from each discrete sub-data in the current traversed annulus to the center of the current traversed annulus;

[0055] The first weighting processing module is configured to calculate the weight of each discrete sub-data in the current traversed annulus in the first weighting processing according to the distance from each discrete sub-data in the current traversed annulus to the center of the current traversed annulus;

[0056] The first weighting processing module is configured to perform first weighting processing on the data value of each discrete sub-data in the current traversed annulus according to the weight of each discrete sub-data in the current traversed annulus in the first weighting processing, to determine the first weighted data corresponding to the current traversed annulus.

[0057] Further, the first weighting processing module is configured to calculate the reciprocal sum of the distances from each discrete sub-data in the current traversed annulus to the center of the current traversed annulus, specifically as follows:

[0058]

[0059] wherein, is the reciprocal sum of the distances from all the discrete sub-data in the current traversed annulus to the center of the current traversed annulus, D i is the Euclidean distance from the i-th discrete sub-data in the current traversed annulus to the current traversed annulus, and S0 is the number of discrete sub-data in the current traversed annulus;

[0060] The first weighting processing module is configured to calculate the weight of each discrete sub-data in the current traversed annulus in the first weighting processing according to the distance from each discrete sub-data in the current traversed annulus to the center of the current traversed annulus, specifically as follows:

[0061]

[0062] wherein, w i is the weight of the i-th discrete sub-data in the current traversed annulus in the first weighting processing;

[0063] The data value of each discrete sub-data in the current traversed annulus is first weighted according to the weight of each discrete sub-data in the current traversed annulus in the first weighting processing, to determine the first weighted data corresponding to the current traversed annulus, and the specific formula is:

[0064]

[0065] wherein, F0 is the first weighted data corresponding to the current traversed annulus, f i is the data value of the i-th target data in the current traversed annulus.

[0066] In a possible implementation manner, the second weighting processing module respectively performs second weighting processing on the plurality of first weighted data corresponding to each grid vertex according to the outer radius of the search annulus where each first weighted data is located, to obtain the second weighted data corresponding to each grid vertex, and stores each second weighted data on the corresponding grid vertex, and the specific formula is:

[0067] The reciprocal sum of the outer radius of all search annuli corresponding to each grid vertex is respectively calculated;

[0068] The weight of the plurality of first weighted data in the second weighting processing is calculated according to the outer radius of the search annulus where each first weighted data is located;

[0069] The plurality of first weighted data corresponding to each grid vertex is respectively second weighted according to the weight of the plurality of first weighted data in the second weighting processing, to obtain the second weighted data corresponding to each grid vertex, and each second weighted data is stored on the corresponding grid vertex.

[0070] Further, the reciprocal sum of the outer radius of all search annuli corresponding to each grid vertex is respectively calculated, and the specific formula is:

[0071]

[0072] wherein, is the reciprocal sum of the radius of all search annuli corresponding to the current grid vertex, R j is the outer radius of the j-th search annulus corresponding to the current grid vertex, and N is the number of search annuli corresponding to the current grid vertex;

[0073] The weight of the plurality of first weighted data in the second weighting processing is calculated according to the outer radius of the search annulus where each first weighted data is located, and the specific formula is:

[0074]

[0075] wherein, is the weight of the jth first weighted data corresponding to the current grid vertex in the second weighting process;

[0076] The second weighted data corresponding to each grid vertex is obtained by respectively performing second weighted processing on the plurality of first weighted data corresponding to each grid vertex according to the weight of the plurality of first weighted data corresponding to each grid vertex in the second weighting process, and the second weighted data is stored in the corresponding grid vertex, and the specific formula is:

[0077]

[0078] wherein, F (X，Y) is the storage result of the second weighted data corresponding to the current grid vertex, (X, Y) is the coordinate of the current grid vertex, F j is the jth first weighted data corresponding to the current grid vertex.

[0079] In a possible implementation manner, the radius difference of adjacent semicircles in the search ring set corresponding to each grid vertex is a fixed first preset value, wherein the radius of the smallest semicircle in the concentric semicircles is one tenth of the shortest side length in the grid system, and the first preset value is one half of the radius of the smallest semicircle. BRIEF DESCRIPTION OF DRAWINGS

[0080] Figure 1 : a flowchart of an embodiment of a discrete data storage method provided by the present application.

[0081] Figure 2 : a discrete data distribution diagram of an embodiment of a discrete data storage method provided by the present application.

[0082] Figure 3 : a schematic diagram of establishing a grid system of an embodiment of a discrete data storage method provided by the present application.

[0083] Figure 4 : a schematic diagram of constructing a search ring of an embodiment of a discrete data storage method provided by the present application.

[0084] Figure 5 : a schematic diagram of storing discrete data to a grid vertex of an embodiment of a discrete data storage method provided by the present application.

[0085] Figure 6 : an original wind speed cloud picture of an embodiment of a discrete data storage method provided by the present application.

[0086] Figure 7 : Raw triangular mesh distribution map of an embodiment of the discrete data storage method provided by the present application.

[0087] Figure 8 : Processed wind speed cloud map of an embodiment of the discrete data storage method provided by the present application.

[0088] Figure 9 : Processed regularized mesh distribution map of an embodiment of the discrete data storage method provided by the present application.

[0089] Figure 10 : Structural schematic diagram of an embodiment of the discrete data storage system provided by the present application. DETAILED DESCRIPTION

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

[0091] It should be noted that the step numbers in the text are only for the convenience of explanation of the specific embodiments, and do not serve as the function of limiting the execution sequence of the steps.

[0092] Embodiment One:

[0093] As shown in Figure 1 , embodiment one provides a discrete data storage method, comprising steps S1-S4:

[0094] Step S1, establishing a mesh system according to the distribution area of the discrete data and the preset mesh size; wherein the discrete data comprises a plurality of discrete sub-data;

[0095] Step S2, constructing a search ring set corresponding to each mesh vertex in the mesh system respectively with each mesh vertex as the center; wherein each search ring set comprises a plurality of search rings; the search ring comprises a semicircle ring between adjacent concentric semicircles and an area within the smallest concentric semicircle; the radii of the concentric semicircles are different, and each of the concentric semicircles is in the opposite direction of the data flow of the discrete data in the coverage direction of the mesh system;

[0096] Step S3, respectively traversing each search circle ring corresponding to each grid vertex, according to the distance between each discrete sub-data covered by the current traversed circle ring and the center of the current traversed circle ring, performing first weighting processing on the discrete sub-data to determine the first weighted data corresponding to the current traversed circle ring, and then obtaining a plurality of first weighted data corresponding to each grid vertex respectively;

[0097] Step S4, according to the outer radius of the search circle ring where each first weighted data is located, respectively performing second weighting processing on the plurality of first weighted data corresponding to each grid vertex to obtain second weighted data corresponding to each grid vertex, and storing each second weighted data on the corresponding grid vertex.

[0098] The embodiment of the present application provides a discrete data storage method, which comprises the following steps: establishing a grid system by a distribution area of discrete data, and generating a plurality of grid vertices; storing the discrete data in all grid vertices of the grid system, wherein a plurality of search semicircles with different radii are established for each grid vertex, and target data is respectively weighted and mapped into the search semicircle according to the distance between the target data and the current grid vertex; and then the data in the search semicircle is weighted and mapped into the current grid vertex according to the radius of each search semicircle, so as to realize regular storage of the discrete data. By dividing the distribution area of the discrete data into a plurality of circle rings, the mapping in each circle ring is performed first, and in the case that the discrete data is relatively sparse, more data points can be used to estimate the value of the current grid vertex, so as to improve the accuracy of regular storage of the discrete data. By the method of twice weighting and mapping, the accuracy and detail level of the mapping can be controlled in each search circle ring, so that the mapping result is more in line with the actual situation, and the over-smoothing and distortion are avoided, and the accuracy of regular storage of the discrete data is improved. The search circle ring is established in the opposite direction of the data flow, so that the change trend in the direction can be highlighted and accurately reflected, and the noise or interference signal in other directions can be effectively suppressed, and the accuracy of regular storage is further improved. In addition, since only the data around the data flow direction of the current grid vertex is considered, the amount of data to be processed and calculated can be reduced, and the efficiency of regular storage is improved.

[0099] Further, in step S1, the grid system is established according to the distribution area of the discrete data and the preset grid size, specifically:

[0100] The distribution area of the discrete data is divided into a plurality of grids according to the distribution area of the discrete data and the preset grid size.

[0101] A rectangular coordinate system is established with the center of the distribution area of the discrete data as the origin, the coordinates of all discrete data and the coordinates of the vertices of each grid are determined, and the grid system is formed.

[0102] The embodiment of the present application provides a method for establishing a grid system according to a distribution area of discrete data and a preset grid size, divides the distribution area of the discrete data into a plurality of grids, can generate corresponding grid vertices for storing the discrete data, establishes a rectangular coordinate system according to the distribution area of the discrete data, can accurately express the relative positions of the grid vertices and the discrete data, and is convenient for calculating the distance from the discrete data to the grid vertices and improving the accuracy of regularized storage of the discrete data.

[0103] In a preferred embodiment, the grid system is composed of squares of the same size, and the establishment process of the grid system is as shown in Figure 2 and Figure 3 . Wherein, Figure 2 is a schematic diagram of original irregular discrete data points, Figure 3 is a grid system established according to the distribution area of the discrete data.

[0104] Further, in step S2, the radius difference of adjacent semicircles in the search circular ring set corresponding to each grid vertex is a fixed first preset value, wherein the radius of the smallest semicircle in the concentric semicircles is one tenth of the shortest side length in the grid system, and the first preset value is one half of the radius of the smallest semicircle. The meaning of the data flow direction includes: when studying the wind field of complex terrain, the data flow direction takes the wind direction; when studying the river and pollutants, the data flow direction takes the diffusion direction of the pollutants; and the data flow direction of the remaining related models can be determined by analogy. Figure 4 is a schematic diagram of constructing a search semicircle ring according to the direction of the data flow.

[0105] The embodiment of the present application further limits the size of the radius of the smallest semicircle in the concentric semicircles and the first preset value. The radius of the smallest semicircle and the first preset value determine the area size of each search circular ring, further determine the amount of data that can be searched in each circular ring, and the amount of discrete data that needs to be stored around the grid vertex. By adjusting the size of the two parameters, the smoothness and accuracy of the interpolation result can be better controlled, and the efficiency of regularized storage of the discrete data can be improved.

[0106] In a possible implementation manner, in step S3, the first weighting processing is performed on the discrete sub-data according to the distance between each discrete sub-data covered by the current traversal circular ring and the center of the current traversal circular ring, to determine the first weighted data corresponding to the current traversal circular ring, and the first weighting processing is specifically:

[0107] calculating the reciprocal of the distance from each discrete sub-data in the current traversal circular ring to the center of the current traversal circular ring;

[0108] According to the distance from each discrete sub-data in the current traversed annulus to the center of the current traversed annulus, the weight of each discrete sub-data in the current traversed annulus in the first weighting processing is calculated.

[0109] According to the weight of each discrete sub-data in the current traversed annulus in the first weighting processing, the data value of each discrete sub-data in the current traversed annulus is subjected to the first weighting processing, and the first weighted data corresponding to the current traversed annulus is determined.

[0110] The embodiment of the present application provides a method for performing first weighted summation on all discrete sub-data in a current search annulus, the weight of each discrete sub-data in the first weighting processing is determined by calculating the distance from the discrete sub-data to the grid vertex, and the first weighting processing is performed according to the weight, and the first weighted data is obtained. In order to fully consider the influence of each target data on the grid vertex, the weight of each target data is determined by using the reciprocal of the distance, so that the first weighting processing of each discrete sub-data is more reasonable and accurate.

[0111] Further, the distance reciprocal sum of each discrete sub-data in the current traversed annulus to the center of the current traversed annulus is calculated, and the specific formula is:

[0112]

[0113] wherein, the distance reciprocal sum of all discrete sub-data in the current traversed annulus to the center of the current traversed annulus is D i the Euclidean distance of the i th discrete sub-data in the current traversed annulus to the current traversed annulus is D i, and the number of discrete sub-data in the current traversed annulus is S0;

[0114] According to the distance from each discrete sub-data in the current traversed annulus to the center of the current traversed annulus, the weight of each discrete sub-data in the current traversed annulus in the first weighting processing is calculated, and the specific formula is:

[0115]

[0116] wherein, w i the weight of the i th discrete sub-data in the current traversed annulus in the first weighting processing is w i ;

[0117] According to the weight of each discrete sub-data in the current traversed annulus in the first weighting processing, the data value of each discrete sub-data in the current traversed annulus is subjected to the first weighting processing, and the first weighted data corresponding to the current traversed annulus is determined.

[0118]

[0119] wherein F0 is the first weighted data corresponding to the current traversed annulus, f i is the data value of the i-th target data in the current traversed annulus.

[0120] In one possible implementation, in step S4, the first weighted data corresponding to each grid vertex is second weighted according to the outer radius of the search annulus where the first weighted data is located, to obtain second weighted data corresponding to each grid vertex, and the second weighted data is stored in the corresponding grid vertex, specifically:

[0121] The reciprocal sum of the outer radius of all search annuli corresponding to each grid vertex is calculated respectively;

[0122] The weight of the first weighted data in the second weighting is calculated according to the outer radius of the search annulus where the first weighted data is located;

[0123] The first weighted data corresponding to each grid vertex is second weighted according to the weight of the first weighted data in the second weighting, to obtain second weighted data corresponding to each grid vertex, and the second weighted data is stored in the corresponding grid vertex.

[0124] The embodiment of the present application provides a method for second weighting of first weighted data, the weight of each first weighted data in the second weighting is determined by calculating the reciprocal sum of the outer radius of the annulus, and the second weighting is performed according to the weight, and the first weighted data corresponding to the current grid vertex is mapped into the current grid vertex. The present method analogizes the first weighted data to ordinary discrete data, analogizes the outer radius of the annulus to the distance from the discrete data to the grid vertex, performs second distance reciprocal weighting summation, and also considers that the influence of the first weighted data on the grid vertex is different at different distances, the weight of each first weighted data is determined by using the reciprocal of the outer radius of the annulus, and the accuracy of regularized storage of the discrete data is improved.

[0125] Further, the reciprocal sum of the outer radius of all search annuli corresponding to each grid vertex is calculated respectively, and the specific formula is:

[0126]

[0127] wherein, is the reciprocal sum of the radius of all search annuli corresponding to the current grid vertex, R j is the outer radius of the j-th search annulus corresponding to the current grid vertex, and N is the number of search annuli corresponding to the current grid vertex;

[0128] The weight of the plurality of first weighted data in the second weighting process is calculated according to the outer radius of the search circle in which each first weighted data is located, and the specific formula is:

[0129]

[0130] wherein, is the weight of the jth first weighted data corresponding to the current grid vertex in the second weighting process;

[0131] The second weighted data corresponding to each grid vertex is obtained by performing the second weighting process on the plurality of first weighted data corresponding to each grid vertex respectively according to the weight of the plurality of first weighted data in the second weighting process, and the second weighted data is stored in the corresponding grid vertex, and the specific formula is:

[0132]

[0133] wherein, F (X，Y) is the storage result of the second weighted data corresponding to the current grid vertex, (X, Y) is the coordinate of the current grid vertex, and F j is the jth first weighted data corresponding to the current grid vertex.

[0134] Figure 5 is the result schematic diagram of the discrete data after being regularly stored by using the discrete data storage method provided by the present application. Figure 2 and Figure 2 It can be found that the discrete data arranged irregularly can be interpolated to the regularly arranged grid vertices by using the method. Figure 5

[0135] In the preferred embodiment, the wind field at a height of 10m above the ground surface of a certain city is taken as the research object, the distribution area of the discrete data is a square area with a length and a width of 90KM, the original model of the discrete data is a triangular grid, and the area of each triangular grid is about 2500 square meters. The wind speed cloud diagram of the area before the discrete data processing and the triangular grid distribution are shown in Figure 6 and Figure 7 .

[0136] The grid system is established according to the distribution area of the discrete data, the size of a single regular grid is determined to be 50m*50m, and there are 1800 grids in the length and width directions. The data stored on the original triangular grid vertices is mapped to the regular grid vertices by using the discrete data storage method provided by the present application. The wind speed cloud diagram of the area after the data processing and the regular grid distribution are shown in Figure 8 and Figure 9 .

[0137] Example Two:​

[0138] As Figure 10 shown, embodiment two provides a discrete data storage system, comprising a grid system establishing module 10, a search ring constructing module 20, a first weighting processing module 30 and a second weighting processing module 40;

[0139] The grid system establishing module 10 is configured to establish a grid system according to a distribution region of discrete data and a preset grid size; the discrete data comprises a plurality of discrete sub-data.

[0140] The search ring constructing module 20 is configured to construct a search ring set corresponding to each grid vertex in the grid system with the grid vertex as the center of a circle, respectively; each search ring set comprises a plurality of search rings; the search ring comprises a semicircle ring between adjacent concentric semicircles and a region within the smallest concentric semicircle; the radii of the concentric semicircles are different, and the concentric semicircles are in the opposite direction of the data flow of the discrete data in the coverage direction of the grid system.

[0141] The first weighting processing module 30 is configured to traverse each search ring corresponding to each grid vertex, respectively, and perform first weighting processing on each discrete sub-data according to the distance between the discrete sub-data and the center of the current traversed ring, to determine the first weighted data corresponding to the current traversed ring, and then obtain a plurality of first weighted data corresponding to each grid vertex.

[0142] The second weighting processing module 40 is configured to perform second weighting processing on the plurality of first weighted data corresponding to each grid vertex according to the outer radius of the search ring where the first weighted data is located, to obtain second weighted data corresponding to each grid vertex, and store the second weighted data in the corresponding grid vertex.

[0143] Further, the grid system establishing module 10 is configured to establish a grid system according to a distribution region of discrete data and a preset grid size, specifically:

[0144] According to the distribution region of the discrete data and the preset grid size, the distribution region of the discrete data is divided into a plurality of grids.

[0145] A rectangular coordinate system is established with the center of the distribution region of the discrete data as the origin, the coordinates of all discrete data and the coordinates of the vertices of each grid are determined, and a grid system is formed.

[0146] In a possible implementation, the first weighting processing module 30 performs first weighting processing on each discrete sub-data according to the distance between the discrete sub-data and the center of the current traversed annulus, to determine the first weighted data corresponding to the current traversed annulus, specifically as follows.

[0147] calculating the reciprocal sum of the distances from each discrete sub-data in the current traversed annulus to the center of the current traversed annulus;

[0148] calculating the weight of each discrete sub-data in the current traversed annulus in the first weighting processing according to the distance from each discrete sub-data in the current traversed annulus to the center of the current traversed annulus;

[0149] performing first weighting processing on the data value of each discrete sub-data in the current traversed annulus according to the weight of each discrete sub-data in the current traversed annulus in the first weighting processing, to determine the first weighted data corresponding to the current traversed annulus.

[0150] Further, the calculation of the reciprocal sum of the distances from each discrete sub-data in the current traversed annulus to the center of the current traversed annulus is specifically as follows.

[0151]

[0152] wherein, is the reciprocal sum of the distances from all discrete sub-data in the current traversed annulus to the center of the current traversed annulus, and D i is the Euclidean distance from the ith discrete sub-data in the current traversed annulus to the current traversed annulus, and S0 is the number of discrete sub-data in the current traversed annulus;

[0153] The calculation of the weight of each discrete sub-data in the current traversed annulus in the first weighting processing according to the distance from each discrete sub-data in the current traversed annulus to the center of the current traversed annulus is specifically as follows.

[0154]

[0155] wherein, w i is the weight of the ith discrete sub-data in the current traversed annulus in the first weighting processing;

[0156] The first weighting processing on the data value of each discrete sub-data in the current traversed annulus according to the weight of each discrete sub-data in the current traversed annulus in the first weighting processing, to determine the first weighted data corresponding to the current traversed annulus, is specifically as follows.

[0157]

[0158] wherein F0is the first weighted data corresponding to the current traversed circle ring, f i is the data value of the i-th target data in the current traversed circle ring.

[0159] In one possible implementation manner, the second weighting processing module 40 respectively performs second weighting processing on the plurality of first weighted data corresponding to each grid vertex according to the outer radius of the search circle ring where each first weighted data is located, obtains the second weighted data corresponding to each grid vertex, and stores each second weighted data on the corresponding grid vertex, specifically as follows.

[0160] The reciprocal sum of the outer radius of all search circle rings corresponding to each grid vertex is respectively calculated.

[0161] The weight of the plurality of first weighted data in the second weighting processing is calculated according to the outer radius of the search circle ring where each first weighted data is located.

[0162] The plurality of first weighted data corresponding to each grid vertex is respectively processed according to the weight of the plurality of first weighted data in the second weighting processing, the second weighted data corresponding to each grid vertex is obtained, and each second weighted data is stored on the corresponding grid vertex.

[0163] Further, the reciprocal sum of the outer radius of all search circle rings corresponding to each grid vertex is respectively calculated, and the specific formula is as follows.

[0164]

[0165] wherein is the reciprocal sum of the radius of all search circle rings corresponding to the current grid vertex, R j is the outer radius of the j-th search circle ring corresponding to the current grid vertex, and N is the number of search circle rings corresponding to the current grid vertex.

[0166] The weight of the plurality of first weighted data in the second weighting processing is calculated according to the outer radius of the search circle ring where each first weighted data is located, and the specific formula is as follows.

[0167]

[0168] wherein is the weight of the j-th first weighted data corresponding to the current grid vertex in the second weighting processing.

[0169] The second weighting processing is performed on the plurality of first weighting data corresponding to each grid vertex respectively according to the weight of the second weighting processing of the plurality of first weighting data, the second weighting data corresponding to each grid vertex is obtained, and each second weighting data is stored in the corresponding grid vertex, and the specific formula is as follows:

[0170]

[0171] Wherein, F (X，Y) is the storage result of the second weighting data corresponding to the current grid vertex, (X, Y) is the coordinate of the current grid vertex, F j is the jth first weighting data corresponding to the current grid vertex.

[0172] In a possible implementation manner, the radius difference of adjacent semicircles in the search circular ring set corresponding to each grid vertex is a fixed first preset value, wherein the radius of the smallest semicircle in the concentric semicircles is one tenth of the shortest side length in the grid system, and the first preset value is one half of the radius of the smallest semicircle.

[0173] The embodiment of the present application provides a discrete data storage method, a grid system is established by distributing a discrete data, and a plurality of grid vertices are generated; the discrete data is stored in all grid vertices of the grid system, wherein a plurality of search semicircles with different radii are established for each grid vertex, target data is weighted and mapped into the search semicircle according to the distance between the target data and the current grid vertex; and then the data in the search semicircle is weighted and mapped into the current grid vertex according to the radius of each search semicircle, so that the regular storage of the discrete data is realized. By dividing the distribution area of the discrete data into a plurality of circular rings, the mapping in each circular ring is performed first, in the case that the discrete data is relatively sparse, more data points can be used to estimate the value of the current grid vertex, and the accuracy of the regular storage of the discrete data is improved; by the method of twice weighting and mapping, the accuracy and the degree of detail of the mapping can be controlled in each search circular ring, so that the mapping result is more consistent with the actual situation, the over-smoothing and distortion are avoided, and the accuracy of the regular storage of the discrete data is improved; the search circular ring is established in the opposite direction of the data flow, the change trend in the direction can be highlighted and accurately reflected, the noise or interference signal in other directions is effectively suppressed, and the accuracy of the regular storage is further improved; in addition, since only the data around the data flow direction of the current grid vertex is considered, the amount of data to be processed and calculated can be reduced, and the efficiency of the regular storage is improved.

[0174] The above-described specific embodiments further illustrate the purpose, technical solutions and beneficial effects of the present application. It should be understood that the above-described specific embodiments are merely examples of the present application and are not intended to limit the protection scope of the present application. It is particularly pointed out that any modification, equivalent replacement, improvement, etc. made by those skilled in the art within the spirit and principle of the present application shall be included in the protection scope of the present application.

Claims

1. A discrete data storage method, characterized in that, include: A grid system is established based on the distribution area of ​​the discrete data and the preset grid size; wherein the discrete data includes several discrete sub-data. Each set of search rings is constructed with each grid vertex in the grid system as its center; each set of search rings includes several search rings; each search ring includes: a semicircle between adjacent concentric semicircles and a region within the smallest concentric semicircle; the radii of the concentric semicircles are different, and the coverage direction of each concentric semicircle in the grid system is opposite to the data flow direction of the discrete data; Each search ring corresponding to each grid vertex is traversed. Based on the distance between each discrete sub-data covered by the current traversed ring and the center of the current traversed ring, the discrete sub-data is subjected to a first weighting process to determine the first weighted data corresponding to the current traversed ring, and then multiple first weighted data corresponding to each grid vertex are obtained. Based on the outer radius of the search ring where each first weighted data is located, the second weighting process is performed on the multiple first weighted data corresponding to each grid vertex to obtain the second weighted data corresponding to each grid vertex, and the second weighted data is stored on the corresponding grid vertex.

2. The discrete data storage method as described in claim 1, characterized in that, The establishment of a grid system based on the distribution area of ​​discrete data and a preset grid size specifically involves: Based on the distribution area of ​​the discrete data and the preset grid size, the distribution area of ​​the discrete data is divided into multiple grids; A rectangular coordinate system is established with the center of the distribution area of ​​the discrete data as the origin, and the coordinates of all discrete data and the coordinates of the vertices of each grid are determined to form a grid system.

3. The discrete data storage method as described in claim 1, characterized in that, The first weighted data is determined by performing a first weighting process on each discrete sub-data covered by the current traversal ring and the center of the current traversal ring, specifically: Calculate the sum of the reciprocals of the distances from each discrete sub-data in the currently traversed annulus to the center of the currently traversed annulus; Based on the distance from each discrete sub-data in the current traversal ring to the center of the current traversal ring, calculate the weight of each discrete sub-data in the current traversal ring during the first weighted processing; Based on the weights of each discrete sub-data in the current traversal ring during the first weighting process, the data values ​​of each discrete sub-data in the current traversal ring are subjected to the first weighting process to determine the first weighted data corresponding to the current traversal ring.

4. The discrete data storage method as described in claim 3, characterized in that, The specific formula for calculating the sum of the reciprocals of the distances from each discrete sub-data point in the currently traversed annulus to the center of the currently traversed annulus is as follows: in, D is the sum of the reciprocals of the distances from all discrete sub-data points in the currently traversed annulus to the center of the currently traversed annulus. i S0 is the Euclidean distance from the i-th discrete sub-data in the current traversal ring to the current traversal ring, and S0 is the number of discrete sub-data in the current traversal ring. The weight of each discrete data point in the current traversed annulus during the first weighted processing is calculated based on the distance from each discrete data point in the current traversed annulus to the center of the current traversed annulus. The specific formula is as follows: Among them, w i The weight of the i-th discrete sub-data in the currently traversed annulus during the first weighted processing; The process involves performing a first weighting process on the data values ​​of each discrete sub-data in the currently traversed annulus based on their weights during the first weighting process, thereby determining the first weighted data corresponding to the currently traversed annulus. The specific formula is as follows: Where F0 is the first weighted data corresponding to the currently traversed ring, f i Let be the data value of the i-th target data in the currently traversed annulus.

5. A discrete data storage method as described in claim 1, characterized in that, The process involves performing a second weighting process on the multiple first weighted data corresponding to each grid vertex based on the outer radius of the search ring containing each first weighted data point, obtaining the second weighted data corresponding to each grid vertex, and storing each second weighted data on the corresponding grid vertex. Specifically: Calculate the sum of the reciprocals of the outer radii of all search annexes corresponding to each grid vertex; Based on the outer radius of the search ring containing each first-weighted data point, calculate the weight of the multiple first-weighted data points during the second-weighted processing. Based on the weights of the multiple first weighted data during the second weighting process, the multiple first weighted data corresponding to each grid vertex are subjected to the second weighting process to obtain the second weighted data corresponding to each grid vertex, and the second weighted data is stored on the corresponding grid vertex.

6. The discrete data storage method as described in claim 5, characterized in that, The specific formula for calculating the sum of the reciprocals of the outer radii of all search rings corresponding to each grid vertex is as follows: in, R is the sum of the reciprocals of the radii of all search annexes corresponding to the current grid vertex. j Let N be the outer radius of the j-th search ring corresponding to the current grid vertex, and N be the number of search rings corresponding to the current grid vertex. The weights of the multiple first-weighted data points in the second weighting process are calculated based on the outer radius of the search ring containing each first-weighted data point. The specific formula is as follows: in, The weight of the j-th first-weighted data corresponding to the current grid vertex during the second-weighted processing; The second weighting process is performed on the multiple first weighted data corresponding to each grid vertex according to their respective weights during the second weighting process, to obtain the second weighted data corresponding to each grid vertex, and the second weighted data is stored on the corresponding grid vertex. The specific formula is as follows: Among them, F (X，Y) This is the storage result of the second weighted data corresponding to the current grid vertex, where (X, Y) are the coordinates of the current grid vertex, and F... j This refers to the j-th first weighted data corresponding to the current grid vertex.

7. A discrete data storage method as described in claim 1, characterized in that, The radius difference between adjacent semicircles in the search ring set corresponding to each grid vertex is a fixed first preset value, wherein the radius of the smallest semicircle in the concentric semicircles is one-tenth of the shortest side length in the grid system, and the first preset value is one-half of the radius of the smallest semicircle.

8. A discrete data storage system, characterized in that, It includes a grid system establishment module, a search ring construction module, a first weighted processing module, and a second weighted processing module; The grid system establishment module is used to establish a grid system based on the distribution area of ​​the discrete data and the preset grid size; wherein the discrete data includes several discrete sub-data. The search ring construction module is used to construct a set of search rings corresponding to each grid vertex in the grid system, with each grid vertex as the center. Each set of search rings includes several search rings. The search rings include: semicircles between adjacent concentric semicircles and regions within the smallest concentric semicircle. The radii of the concentric semicircles are different, and the coverage direction of each concentric semicircle in the grid system is opposite to the data flow direction of the discrete data. The first weighted processing module is used to traverse each search ring corresponding to each grid vertex, and perform first weighted processing on each discrete sub-data based on the distance between each discrete sub-data covered by the current traversed ring and the center of the current traversed ring, to determine the first weighted data corresponding to the current traversed ring, and then obtain multiple first weighted data corresponding to each grid vertex. The second weighted processing module is used to perform second weighted processing on the multiple first weighted data corresponding to each grid vertex according to the outer circle radius of the search ring where each first weighted data is located, to obtain the second weighted data corresponding to each grid vertex, and to store each second weighted data on the corresponding grid vertex.

9. A discrete data storage system as described in claim 8, characterized in that, The grid system establishment module is used to establish a grid system based on the distribution area of ​​discrete data and a preset grid size, specifically: Based on the distribution area of ​​the discrete data and the preset grid size, the distribution area of ​​the discrete data is divided into multiple grids; A rectangular coordinate system is established with the center of the distribution area of ​​the discrete data as the origin, and the coordinates of all discrete data and the coordinates of the vertices of each grid are determined to form a grid system.

10. A discrete data storage system as described in claim 8, characterized in that, The first weighted processing module performs a first weighted processing on each discrete sub-data based on the distance between each discrete sub-data covered by the current traversal ring and the center of the current traversal ring, to determine the first weighted data corresponding to the current traversal ring, specifically as follows: Calculate the sum of the reciprocals of the distances from each discrete sub-data in the currently traversed annulus to the center of the currently traversed annulus; Based on the distance from each discrete sub-data in the current traversal ring to the center of the current traversal ring, calculate the weight of each discrete sub-data in the current traversal ring during the first weighted processing; Based on the weights of each discrete sub-data in the current traversal ring during the first weighting process, the data values ​​of each discrete sub-data in the current traversal ring are subjected to the first weighting process to determine the first weighted data corresponding to the current traversal ring.

11. A discrete data storage system as described in claim 10, characterized in that, The specific formula for calculating the sum of the reciprocals of the distances from each discrete sub-data point in the currently traversed annulus to the center of the currently traversed annulus is as follows: in, D is the sum of the reciprocals of the distances from all discrete sub-data points in the currently traversed annulus to the center of the currently traversed annulus. i S0 is the Euclidean distance from the i-th discrete sub-data in the current traversal ring to the current traversal ring, and S0 is the number of discrete sub-data in the current traversal ring. The weight of each discrete data point in the current traversed annulus during the first weighted processing is calculated based on the distance from each discrete data point in the current traversed annulus to the center of the current traversed annulus. The specific formula is as follows: Among them, w i The weight of the i-th discrete sub-data in the currently traversed annulus during the first weighted processing; The process involves performing a first weighting process on the data values ​​of each discrete sub-data in the currently traversed annulus based on their weights during the first weighting process, thereby determining the first weighted data corresponding to the currently traversed annulus. The specific formula is as follows: Where F0 is the first weighted data corresponding to the currently traversed ring, f i Let be the data value of the i-th target data in the currently traversed annulus.

12. A discrete data storage system as described in claim 8, characterized in that, The second weighted processing module performs second weighted processing on the multiple first weighted data corresponding to each grid vertex according to the outer radius of the search ring where each first weighted data is located, to obtain the second weighted data corresponding to each grid vertex, and stores each second weighted data on the corresponding grid vertex, specifically: Calculate the sum of the reciprocals of the outer radii of all search annexes corresponding to each grid vertex; Based on the outer radius of the search ring containing each first-weighted data point, calculate the weight of the multiple first-weighted data points during the second-weighted processing. Based on the weights of the multiple first weighted data during the second weighting process, the multiple first weighted data corresponding to each grid vertex are subjected to the second weighting process to obtain the second weighted data corresponding to each grid vertex, and the second weighted data is stored on the corresponding grid vertex.

13. A discrete data storage system as described in claim 12, characterized in that, The specific formula for calculating the sum of the reciprocals of the outer radii of all search rings corresponding to each grid vertex is as follows: in, R is the sum of the reciprocals of the radii of all search annexes corresponding to the current grid vertex. j Let N be the outer radius of the j-th search ring corresponding to the current grid vertex, and N be the number of search rings corresponding to the current grid vertex. The weights of the multiple first-weighted data points in the second weighting process are calculated based on the outer radius of the search ring containing each first-weighted data point. The specific formula is as follows: in, The weight of the j-th first-weighted data corresponding to the current grid vertex during the second-weighted processing; The second weighting process is performed on the multiple first weighted data corresponding to each grid vertex according to their respective weights during the second weighting process, to obtain the second weighted data corresponding to each grid vertex, and the second weighted data is stored on the corresponding grid vertex. The specific formula is as follows: Among them, F (X，Y) This is the storage result of the second weighted data corresponding to the current grid vertex, where (X, Y) are the coordinates of the current grid vertex, and F... j This refers to the j-th first weighted data corresponding to the current grid vertex.

14. A discrete data storage system as described in claim 8, characterized in that, The radius difference between adjacent semicircles in the search ring set corresponding to each grid vertex is a fixed first preset value, wherein the radius of the smallest semicircle in the concentric semicircles is one-tenth of the shortest side length in the grid system, and the first preset value is one-half of the radius of the smallest semicircle.

Images