A real-time ground change statistical analysis method based on a sub-table strategy

Abstract

The application discloses a real-time land change statistical analysis method based on a table strategy, comprising the following steps: obtaining original image patches from different themes in an image, classifying the union of the original image patches according to a preset rule to obtain minimum unit image patches, and associating the minimum unit image patches with a space unit table, a version table and a change patch table; each minimum unit image patch is associated with a unique child node, the original image patch is associated with a unique parent node, and the child node is associated with the parent node with the existence of image patch overlap source; the change patch is superimposed with the union, the space unit table, the version table and the change patch table are updated according to the intersection relationship between the change patch and the minimum unit image patch. The application has the beneficial effects that only the statistical analysis logic needs to be maintained, the original vector data does not need to be sorted, the maintenance cost is reduced, and when the analysis demand is proposed, the statistical report can be directly output from the existing vector data layer, and the timeliness is high.

Description

Technical Field

[0001] This invention relates to the field of data analysis technology, and in particular to a method for statistical analysis of real-time land use category changes based on a table partitioning strategy. Background Technology

[0002] In natural resource work, various types of operations are involved, including surveys, law enforcement, and farmland protection. Previously, land use change analysis models were built separately according to the requirements of each operation. Data processing and statistical analysis were then conducted when analytical needs arose, providing data analysis support for each operation. However, in routine natural resource monitoring, the traditional data analysis model has certain limitations, specifically as follows:

[0003] First, the maintenance cost is high. Routine natural resource monitoring often involves the integration of multiple sources and types of business operations. Each business unit focuses on the land use changes reflected in the monitoring results, but their key focus areas and data statistical logic are not entirely consistent. Even during the work process, data analysis is adjusted according to the latest requirements. With the continuous expansion of the scope of routine monitoring and the increasing number of business types, the frequency of adjustments is far higher than in traditional operating models. Under the traditional land use change analysis model, each adjustment requires the improvement of each model individually. Furthermore, due to the overlap of various business operations, the model's statistical logic becomes more complex, significantly increasing the model's maintenance cost.

[0004] Second, the timeliness is low. According to the characteristics of routine monitoring work, it is necessary to grasp the changes in each plot in real time. However, the previous analysis model required the data to be sorted out before the statistics were compiled. When dealing with large amounts of data, it takes a long time to sort out the data before the statistics can be compiled. This results in a long time from the submission of the analysis request to the completion of the analysis, which restricts the timeliness of the statistics. Summary of the Invention

[0005] To address the issues of high maintenance costs and low timeliness in traditional land use change analysis models, this invention proposes a real-time land use change statistical analysis method based on a table-splitting strategy. This method aims to meet the needs of routine land use change monitoring and analysis while reducing maintenance costs for rule adjustments and improving change response capabilities and statistical efficiency.

[0006] To solve the above-mentioned technical problems, the technical solution of the present invention is as follows:

[0007] A statistical analysis method for real-time land category changes based on a table partitioning strategy includes the following steps:

[0008] The original image patches from different themes are obtained from the image. The union of the original image patches is classified according to preset rules to obtain the smallest unit image patch. The smallest unit image patch is associated with a spatial unit table, a version table, and a change image patch table.

[0009] Create a unique child node for each of the smallest unit patches and a unique parent node for the original patch. The child node is associated with the parent node where there is a source of patch overlap.

[0010] The changed features are superimposed on the union of the changed features and the smallest unit features. Based on the intersection relationship between the changed features and the smallest unit features, the spatial unit table, the version table, and the changed feature table are updated.

[0011] In some implementations, the preset rules include: dividing the union into the smallest unit patches with different attributes based on the number of overlapping patches and the source of the overlapping patches as dividing conditions.

[0012] In some implementations, the spatial unit table stores the patch IDs and areas of all the smallest unit patches. Each patch ID corresponds to a version table, which records the patch ID, generation time, topic, and identifier code of the original patch contained in the smallest unit patch. Each original patch corresponds to a unique identifier code, and each identifier code corresponds to a changed patch table, which stores the corresponding identifier code and business information.

[0013] In some implementations, the business information includes land category or type of violation.

[0014] In some implementations, the name of the child node is defined as the patch ID of the corresponding smallest unit, and the name of the parent node is defined as the identifier code of the corresponding original patch.

[0015] In some implementations, the intersection relationship includes non-intersection, complete intersection, and partial intersection.

[0016] In some implementations, when the changed patch does not intersect with any of the smallest unit patches, the relevant information of the changed patch is directly added to the spatial unit table, the version table, and the changed patch table.

[0017] In some implementations, when the changed patch completely intersects with at least one of the minimum unit patches, the area of ​​the minimum unit patch in the spatial unit table is updated to the difference between the minimum unit patch and the changed patch, and a new patch ID and area for the changed patch are added; in the version table, the changed patch inherits the attributes of the corresponding minimum unit patch, and the patch ID of the inherited minimum unit patch attribute is changed to the patch ID of the changed patch, and a new patch ID, generation time, and topic for the changed patch are added; the identifier code and business information of the changed patch are added to the changed patch table.

[0018] In some implementations, when the changed feature intersects with at least one of the minimum unit features, the changed feature is divided into overlapping features and non-overlapping features. In the spatial unit table, the area of ​​the minimum unit feature is updated to the difference between the minimum unit feature and the overlapping feature, and the feature IDs and corresponding areas of the overlapping and non-overlapping features are added. In the version table, the overlapping feature inherits the attributes of the corresponding minimum unit feature, and the feature ID of the inherited minimum unit feature is changed to the feature ID of the overlapping feature. The feature IDs, generation time, and topic of the overlapping and non-overlapping features are added. The identifier code and business information of the changed feature are added to the changed feature table.

[0019] In some implementations, a patch withdrawal operation is also included: all records involving the original patch to be withdrawn are deleted from the spatial unit table, the version table, and the changed patch table.

[0020] The beneficial effects of this invention are as follows: By dividing the set of original superimposed polygons into multiple smallest unit polygons, each smallest unit polygon is regarded as a spatial range with a default version. Whenever a new changed polygon covers the original polygon, a new version will be generated within the superimposed range. Therefore, when facing adjustments to various business requirements, only the statistical analysis logic needs to be maintained, without having to start organizing from the original vector data, thus reducing maintenance costs. When analysis needs are raised, statistical reports can be directly output from the existing vector data layer, resulting in high timeliness. Attached Figure Description

[0021] Figure 1 This is a flowchart illustrating step 1 of the present invention.

[0022] Figure 2 This is a flowchart illustrating step 2 of the present invention.

[0023] Figure 3 This is a flowchart illustrating step 301 as disclosed in an embodiment of the present invention;

[0024] Figure 4 This is a flowchart illustrating step 302 as disclosed in an embodiment of the present invention;

[0025] Figure 5 This is a flowchart illustrating step 303 as disclosed in an embodiment of the present invention;

[0026] Figure 6 This is a flowchart illustrating step 4 of an embodiment of the present invention. Detailed Implementation

[0027] To make the objectives, technical solutions, and advantages of this invention clearer and more explicit, the content of this invention will be further described in detail below with reference to the accompanying drawings and specific embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and not intended to limit it. Furthermore, it should be noted that, for ease of description, only the parts relevant to this invention are shown in the accompanying drawings, not all of them.

[0028] This embodiment proposes a real-time statistical analysis method for land use category changes based on a table partitioning strategy. The method divides the set of original overlaid map features into multiple minimum unit map features, each of which is considered a spatial range with a default version. Whenever a new changed map feature covers an original map feature, a new version is generated within the overlaid range. Therefore, when faced with adjustments to various business requirements, only the statistical analysis logic needs to be maintained, without having to start organizing from the original vector data, reducing maintenance costs. Furthermore, when an analysis requirement arises, statistical reports can be directly output from the existing vector data layer, ensuring high timeliness.

[0029] Includes the following steps:

[0030] Step 1: Obtain the original image patches from different themes in the image. According to the preset rules, classify the union of the original image patches to obtain the smallest unit image patch. The smallest unit image patch is associated with the spatial unit table, version table and change image patch table.

[0031] In step 1, the union of the original patches is a set of multiple original patches. These patches will overlap to varying degrees; therefore, the aforementioned preset rule should use the area of ​​the union as the basis for classification. In one example, the preset rule includes dividing the union into the smallest unit patches with different attributes based on the number and source of patch overlap. For details, please refer to [link to relevant documentation]. Figure 1 Taking three original map features BSM1, BSM2, and BSM3 as an example, the overlapping portion of BSM1, BSM2, and BSM3 is defined as id1; the overlapping portion of BSM1 and BSM2 is defined as id3; the overlapping portion of BSM2 and BSM3 is defined as id7; and the overlapping portion of BSM1 and BSM3 is defined as id4. id2, id6, and id5 are the portions of BSM1, BSM2, and BSM3 that do not overlap with other original map features, respectively. In total, these are divided into 7 smallest unit map features. Taking id1 as an example, it belongs to the overlapping portion of the three original map features, and in this embodiment, there is one and only one. Furthermore, although id3, id4, and id7 all have two overlapping features, the sources of these overlapping features are different. For example, the overlapping source of id3 is BSM1 and BSM2, so it needs to be defined separately to distinguish it from id4 and id7.

[0032] The spatial unit table stores the patch IDs and areas of all the smallest unit patches. Each patch ID corresponds to a version table, which records the patch IDs, generation times, themes, and identifiers of the original patches contained within the smallest unit patch. Each original patch corresponds to a unique identifier, and each identifier corresponds to a changed patch table, which stores the corresponding identifier and business information. (Continue reading...) Figure 1 , Figure 1 The example demonstrates three tables associated with seven minimum unit patches. The spatial unit table stores the patch IDs (id1-id7) and their corresponding areas for all minimum unit patches. In the version table, the number of entries for each minimum unit patch is based on the number of sources of the original patch. Taking ID1 as an example, since the minimum unit patch ID1 originates from the superposition of three original patches, any version change of ID1 within this spatial range must be associated with BSM1, BSM2, and BSM3. Therefore, the version table has three entries for ID1, each recording information from the three original patches. For instance, one row of ID1 entries might record the time, topic, and identifier as t1, daily survey, and BSM1, respectively, representing information from the original patch BSM1. Similarly, the minimum unit patch ID7 originates from the superposition of two original patches, BSM2 and BSM3. Therefore, the version table has two entries for ID7, each recording information from BSM2 and BSM3. Finally, in this embodiment, there are only three original map patches, BSM1, BSM2, and BSM3. Therefore, the changed map patch table stores the identification codes and business information corresponding to BSM1, BSM2, and BSM3. This business information includes land type or violation type, or other data that users expect to add.

[0033] Step 2: Create a unique child node for each smallest unit patch and a unique parent node for each original patch. The child nodes are associated with the parent nodes that represent the sources of patch overlap. In one optional implementation, the child node's name is defined as the patch ID of the corresponding smallest unit, and the parent node's name is defined as the identifier code of the corresponding original patch. That is, each smallest unit patch has a unique child node named "patch ID," and each original patch has a unique parent node named "identifier code." Figure 1 The examples in the document have already presented the smallest unit polygons id1-id7, as well as the original polygons BSM1, BSM2, and BSM3, therefore, as Figure 2 As shown, child nodes are created using the patch ID of the smallest unit patch, and parent nodes are created using the identifiers BSM1, BSM2, and BSM3 of the original patch, thus determining the mapping relationship between parent and child nodes.

[0034] Step 3: Overlay the changed patches with the union, and update the spatial unit table, version table, and changed patch table according to the intersection relationship between the changed patches and the smallest unit patch.

[0035] The intersection relationship in step 3 includes three cases: non-intersection, complete intersection, and partial intersection, which will be explained in steps 301-303 below.

[0036] Step 301: When the changed feature does not intersect with any of the smallest unit features, directly add the relevant information of the changed feature to the spatial unit table, version table, and changed feature table. (See also...) Figure 3 Assuming that a new national satellite image change patch BSM4 is added in space at time t5, and BSM4 does not intersect with any of the smallest unit patches in space, then id8 and the area corresponding to the change patch BSM4 are added to the spatial unit table, while the relevant information of id8 is directly added to the version table and the change patch table.

[0037] Step 302: When a changed feature completely intersects with at least one minimum unit feature, in the spatial unit table, update the area of ​​the minimum unit feature to the difference between the minimum unit feature and the changed feature, as well as the feature ID and area of ​​the newly added changed feature; in the version table, the changed feature inherits the attributes of the corresponding minimum unit feature, and changes the feature ID of the inherited minimum unit feature's attributes to the feature ID of the changed feature, along with the feature ID, generation time, and topic of the newly added changed feature; the changed feature table adds the identifier code and business information of the changed feature. (See also...) Figure 4 Suppose that a new change feature BSM4 is added in the space at time t4, completely covering the original id7 feature. Then, the id7 feature will be cut by the new id8 feature. The area of ​​the original id7 in the spatial cell table will be recalculated and updated, and id8 will be added and its area calculated. Since id8 intersects with the original id7 feature in the version table, it will directly inherit the attributes of the id7 feature. The time, topic, and other information of the id8 feature will also be added. Since id8 belongs to the daily survey topic, a new row of data will be added to the daily survey table in the change feature table.

[0038] Step 303: When a changed feature intersects with at least one minimum unit feature, the changed feature is divided into overlapping and non-overlapping features. In the spatial unit table, the area of ​​the minimum unit feature is updated to the difference between the minimum unit feature and the overlapping feature, along with the feature IDs and corresponding areas of the newly added overlapping and non-overlapping features. In the version table, the overlapping feature inherits the attributes of the corresponding minimum unit feature, and the feature ID of the inherited minimum unit feature is changed to the feature ID of the overlapping feature, along with the feature IDs, generation time, and topic of the newly added overlapping and non-overlapping features. The changed feature table is updated with the identifier code and business information of the changed feature. (See also...) Figure 5Assuming a new national satellite imagery patch BSM4 is added in space at time t5, spatially intersecting with patch id6, after dividing the patch into its smallest units, BSM4 is divided into two parts, id8 and id9. The spatial unit table adds id8 and id9. Since the original id6 is divided by BSM4, its area needs to be updated accordingly to ensure that the area of ​​the divided patch id8 + id6 equals the area of ​​the original id6. In the version table, id8 has two layers of patch information to record: one layer directly inherits the information from the original id6, and the other layer directly adds the information from BSM4. Additionally, attribute information for id9 needs to be added. The changed patch table only needs to add the relevant information for BSM4 to the corresponding thematic table.

[0039] Step 4 also includes the polygon withdrawal operation: all records involving the original polygon to be withdrawn are deleted from the spatial unit table, version table, and changed polygon table. Polygon withdrawal applies to the original polygon before cutting; each original polygon corresponds to a unique identifier code (BSM). See [link / reference] Figure 6 Suppose we need to withdraw a map feature with the unique identifier BSM2. We need to delete all id6 records belonging to this map feature in the spatial unit table, and delete all records involving BSM2 in the version table and the changed map feature table. In this way, the map feature withdrawal function can be realized under the premise of real-time statistics.

[0040] The above embodiments are merely illustrative of the technical concept and features of the present invention, and are intended to enable those skilled in the art to understand the content of the present invention and implement it accordingly. They should not be construed as limiting the scope of protection of the present invention. All equivalent changes or modifications made based on the essence of the content of the present invention should be covered within the scope of protection of the present invention.

Claims

1. A method for statistical analysis of real-time land category changes based on a table-segmentation strategy, characterized in that, Includes the following steps: The original image patches from different themes are obtained from the image. The union of the original image patches is classified according to preset rules to obtain the smallest unit image patch. The smallest unit image patch is associated with a spatial unit table, a version table, and a change image patch table. The preset rules include: dividing the union into the smallest unit patches with different attributes based on the number of overlapping patches and the source of overlapping patches as dividing conditions; The spatial unit table stores the patch IDs and areas of all the smallest unit patches. Each patch ID corresponds to a version table, which records the patch ID, generation time, topic, and identifier code of the original patch contained in the smallest unit patch. Each original patch corresponds to a unique identifier code, and each identifier code corresponds to a changed patch table, which stores the corresponding identifier code and business information. Create a unique child node for each of the smallest unit patches and a unique parent node for the original patch. The child node is associated with the parent node where there is a source of patch overlap. The changed features are superimposed on the union of the changed features and the smallest unit features. The spatial unit table, the version table, and the changed feature table are updated according to the intersection relationship between the changed features and the smallest unit features. The intersection relationship includes non-intersection, complete intersection, and partial intersection.

2. The method for statistical analysis of real-time land category changes based on a table partitioning strategy as described in claim 1, characterized in that, The business information includes location type or type of violation.

3. The method for statistical analysis of real-time land category changes based on a table partitioning strategy as described in claim 1, characterized in that, The name of the child node is defined as the patch ID of the corresponding smallest unit, and the name of the parent node is defined as the identifier code of the corresponding original patch.

4. The method for statistical analysis of real-time land category changes based on a table-splitting strategy as described in claim 1, characterized in that, When the changed patch does not intersect with any of the smallest unit patches, the relevant information of the changed patch is directly added to the spatial unit table, the version table, and the changed patch table.

5. The method for statistical analysis of real-time land category changes based on a table-segmentation strategy as described in claim 1, characterized in that, When the changed feature completely intersects with at least one of the minimum unit features, the area of ​​the minimum unit feature in the spatial unit table is updated to the difference between the minimum unit feature and the changed feature, and a new feature ID and area are added to the changed feature; in the version table, the changed feature inherits the attributes of the corresponding minimum unit feature, and the feature ID of the inherited minimum unit feature is changed to the feature ID of the changed feature, and a new feature ID, generation time, and theme are added to the changed feature table; the identifier code and business information of the changed feature are added to the changed feature table.

6. The method for real-time statistical analysis of land category changes based on a table partitioning strategy as described in claim 1, characterized in that, When a changed feature intersects with at least one of the minimum unit features, the changed feature is divided into overlapping features and non-overlapping features. In the spatial unit table, the area of ​​the minimum unit feature is updated to the difference between the minimum unit feature and the overlapping feature, and the feature IDs and corresponding areas of the overlapping and non-overlapping features are added. In the version table, the overlapping feature inherits the attributes of the corresponding minimum unit feature, and the feature ID of the inherited minimum unit feature is changed to the feature ID of the overlapping feature. The feature IDs, generation time, and topic of the overlapping and non-overlapping features are added. The identifier code and business information of the changed feature are added to the changed feature table.

7. The method for statistical analysis of real-time land category changes based on a table-segmentation strategy as described in claim 1, characterized in that, It also includes a patch withdrawal operation: deleting all records involving the original patch to be withdrawn from the spatial unit table, the version table, and the changed patch table.

Images