Method for screening monitoring points in boundary area of adjacent monitoring units

Through the spatial analysis algorithm, the problem of uneven distribution of points in the boundary area of ​​the monitoring unit is solved, fast and accurate point screening is achieved, the inspection efficiency of monitoring data is improved, and the error rate is reduced.

CN118916436AActive Publication Date: 2024-11-08AGRO ENVIRONMENTAL PROTECTION INST OF MIN OF AGRI
View PDF 5 Cites 0 Cited by

Patent Information

Application Number
CN202410964729.4
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-18
Publication Date
2024-11-08
Estimated Expiration
2044-07-18

AI Technical Summary

Technical Problem

In large-scale monitoring and investigation, before the monitoring data difference of adjacent monitoring units is detected, it is necessary to find the boundary area of ​​the monitoring point, but the buffer function of the existing technology leads to uneven distribution of points, manual selection is time-consuming and labor-intensive and prone to errors , especially when multiple monitoring units are adjacent to each other, the point ownership cannot be distinguished.

Method used

A spatial analysis algorithm was designed to calculate the closest distance between the monitoring point and the boundary line, classify and sort the points, form a matrix to find the points closest to the common edge, and pair and filter the points to ensure the uniformity of the points distribution. .

Benefits of technology

It realizes the fast and accurate selection of points closest to the public edge from adjacent monitoring units, solves the problem of uneven point distribution, improves the inspection efficiency of monitoring data, and reduces the error rate.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118916436A_ABST
    Figure CN118916436A_ABST
Patent Text Reader

Abstract

The invention relates to a method for screening monitoring points in boundary areas of adjacent monitoring units, which comprises the following steps of: calculating the area Si of the monitoring unit and the number ni of monitoring points in the monitoring unit according to a formula # imgabs0 #, and taking the calculation result as a threshold value Li; calculating the shortest distance dis from all the monitoring points to the boundary line of the monitoring unit, and marking the monitoring points as class A when dis is less than or equal to Li; when dis is greater than Li, the monitoring point mark is B type; according to the dis of all the monitoring points, the monitoring points are set as a set Z from small to large, and Z = {a1, a2,..., ai}; determining dis pairing between a monitoring point A in a monitoring unit and a monitoring point of an adjacent unit, putting dis and a corresponding point pair into a matrix M, and putting the nearest distance and the corresponding point pair into the matrix M after point pairing one by one; calculating the distance k between every two point locations in the monitoring points A, selecting two point pairs corresponding to two points with the maximum k as point pairs needing to be screened, taking the point closest to the public boundary of the adjacent monitoring units in the two points as the first point, and sorting the k of the first point according to other points except the two points in the monitoring points A; and uniformly selecting point pairs corresponding to one or more points according to the distance, and finally realizing screening.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application belongs to the field of monitoring, and specifically relates to a method for screening monitoring points in the boundary area of ​​adjacent monitoring units. Background Art

[0002] When conducting monitoring surveys, especially large-scale surveys, the monitoring area is often divided into different monitoring units for the convenience of organization and management. Different monitoring teams are responsible for different monitoring units. There are situations where the sampling, sample preparation, testing and other monitoring work of two adjacent monitoring units are not completed by the same organization or the same team of personnel. Generally speaking, the monitoring data of spatially adjacent areas will be relatively close and will not have large differences. Therefore, when reviewing the monitoring data, it is necessary to detect the differences in the monitoring data of different monitoring units in the boundary areas of adjacent monitoring units to measure whether the monitoring data is accurate. Before performing the boundary value change rate detection, the monitoring points in the boundary areas of adjacent monitoring units must be found first, so that the monitoring data of the found monitoring points can be used for difference testing.

[0003] The "buffer" function of the geographic information system software can automatically generate a buffer zone with the common edge as the center line after the monitoring unit base map and monitoring points are uploaded to the geographic information system software. The buffer zone is given the width of the buffer zone and the common edge as the center line, and then the points falling within the buffer zone are selected. Alternatively, after the monitoring unit base map and monitoring points are uploaded, the points near the common edge can be manually selected one by one.

[0004] However, the width of adjacent areas circled by the buffer function is the same, which leads to the selected points being clustered together, or too many points being selected on one side of the common edge and too few points on the other side, which is not conducive to the subsequent inspection of monitoring data on both sides. In addition, when there are multiple monitoring units adjacent to each other, that is, when they share a common edge, the buffers overlap with each other, and it is impossible to distinguish the ownership of the points in each buffer. Manually selecting one point at a time, judging the distance between the point and the common edge with the naked eye, and marking the ownership of the monitoring units of the selected points one by one is time-consuming and labor-intensive, with a high error rate, and cannot be completed manually when there are many monitoring units.

[0005] This application intends to design a spatial analysis algorithm to solve the problem of uneven distribution of monitoring points on both sides of the common boundary of adjacent monitoring units, quickly select one or more point pairs closest to the common edge from adjacent monitoring units, and ensure that the selected points belonging to the same monitoring unit are not clustered. Summary of the invention

[0006] In view of large-scale monitoring and investigation work, this application proposes a method for accurately and quickly finding monitoring points in the boundary area of ​​adjacent monitoring units. This method uses the spatial positions of the monitoring points of adjacent monitoring units to find the monitoring points of different monitoring units in the boundary area of ​​adjacent monitoring units to verify the difference in their monitoring data.

[0007] In order to solve the above technical problems, the method for finding the monitoring points in the boundary area of ​​adjacent monitoring units includes the following steps:

[0008] Step S1: The area S of the monitoring unit i and the number of monitoring points n i According to the formula Calculate and use the result as the threshold L i ;

[0009] Step S2: Calculate the shortest distance dis from all monitoring points to the monitoring unit boundary line, using the threshold L i Standard: When dis≤L i When dis>L i When , the monitoring point is marked as Class B;

[0010] Step S3: sort all monitoring points according to the shortest distances dis calculated in step S2 from small to large, and set the monitoring points to {a 1 ,a 2 ,···,a i} Set Z;

[0011] Step S4: Determine the closest distance pairing between the monitoring point A in the monitoring unit and the monitoring points of the adjacent unit, and put the closest distance and the corresponding point pair into the matrix M:

[0012] Step S5, repeat step S4 for the monitoring unit to obtain the final matrix M of the monitoring unit;

[0013] Step S6, calculate the distance k between any two points in monitoring point A, select the two point pairs corresponding to the two points with the farthest distance as the point pairs to be screened, and take the point closest to the common boundary line of the adjacent monitoring units among the two points as the first point, sort the other points other than the two points in A from small to large according to the distance k between the first point, and select the point pairs corresponding to one or more points evenly according to the distance.

[0014] In step S3, the set Z stores the number, coordinates, distance value and A and B classifications of the monitoring points.

[0015] In step S4, this operation is performed on each Class A monitoring point, and the point closest to each Class A monitoring point is found in the adjacent monitoring units.

[0016] The specific steps in step S4 include:

[0017] Step S4a, find the adjacent monitoring units of the monitoring unit, and calculate the a 1 The distance from the monitoring point to all monitoring points in the adjacent monitoring units;

[0018] Step S4b: compare the adjacent monitoring unit with a 1 The point with the shortest distance to point a 1 Match, match the matched points to p 1 and the corresponding distance d min Put it into the matrix M and put a 1 Delete from set Z;

[0019] Step S4c: 2 Repeat the above pairing steps to iterate all monitoring points in the set Z and obtain {(p 1 ,d min1 ),(p 2 ,d min2 ),···,(p i ,d mini )}Matrix M;

[0020] Step S4d: replace d in matrix M min Compared with the threshold of the monitoring unit, d is finally deleted in the matrix M min >L i +L i+1 point pair; wherein, the L i+1 is the threshold of adjacent cells;

[0021] Step S4e: According to the p retained in the final matrix M i a i The monitoring points of category A are deleted, and only the monitoring points existing in M ​​are retained, and the other points are placed in the monitoring points of category B.

[0022] The point pair information in step S4b includes: point a 1 And the adjacent monitoring unit with point a 1 The number and coordinates of the nearest point, as well as point a 1 And the adjacent monitoring unit with point a 1 The distance between the closest points.

[0023] In step S4d, L i +L i+1 It is the sum of the thresholds of two adjacent monitoring units.

[0024] In step S6, point pairs corresponding to two points in the A-type point with the largest k are first screened out as a reference for subsequent point selection.

[0025] Compared with the prior art, the advantages and effects of this application are as follows:

[0026] 1. This application intends to design a spatial analysis algorithm that can efficiently solve the problem of regional point screening of adjacent monitoring units when the distribution of monitoring points on both sides of the common boundary of adjacent monitoring units is uneven.

[0027] 2. The method adopted in this application can quickly select one or more point pairs closest to the common edge from adjacent monitoring units, and ensure that the selected points belonging to the same monitoring unit are not clustered.

[0028] The above description is only an overview of the technical solution of the present application. In order to more clearly understand the technical means of the present application so that it can be implemented in accordance with the contents of the specification, and to make the above and other purposes, features and advantages of the present application more obvious and easy to understand, the following is a detailed description of the preferred embodiments of the present application in conjunction with the accompanying drawings as follows.

[0029] Based on the detailed description of the specific embodiments of the present application in combination with the accompanying drawings below, those skilled in the art will become more aware of the above and other objects, advantages and features of the present application. BRIEF DESCRIPTION OF THE DRAWINGS

[0030] In order to more clearly illustrate the technical solutions in the embodiments of the present application or the prior art, the drawings required for use in the embodiments or the prior art descriptions are briefly introduced below. Obviously, the drawings described below are some embodiments of the present application. For ordinary technicians in this field, other drawings can also be obtained based on these drawings without creative work. In all drawings, similar elements or parts are generally identified by similar reference numerals. In the drawings, each element or part is not necessarily drawn according to the actual scale.

[0031] in:

[0032] Attached Figure 1 It is the distribution map of monitoring units and monitoring points;

[0033] Attached Figure 2 is the threshold range map;

[0034] Attached Figure 3 It is the data map of Class A monitoring points and Class B monitoring points;

[0035] Attached Figure 4 for a 1 Point distance diagram with adjacent monitoring units;

[0036] Attached Figure 5 Correction map for monitoring point A;

[0037] Attached Figure 6 for (p1 ,d min ) point pair and a 1 A map of distances to other monitoring points within the same monitoring unit. Specific embodiments

[0038] To make the purpose, technical scheme and advantages of the embodiment of the present application clearer, the technical scheme in the embodiment of the present application will be clearly and completely described below in conjunction with the accompanying drawings in the embodiment of the present application. Obviously, the described embodiment is a part of the embodiment of the present application, rather than all of the embodiments. In the following description, specific details such as specific configuration and components are provided only to help fully understand the embodiments of the present application. Therefore, it should be clear to those skilled in the art that various changes and modifications can be made to the embodiments described herein without departing from the scope and spirit of the present application. In addition, for clarity and brevity, the description of known functions and structures is omitted in the embodiment.

[0039] It should be understood that the references to "one embodiment" or "this embodiment" throughout the specification mean that the specific features, structures, or characteristics associated with the embodiment are included in at least one embodiment of the present application. Therefore, the references to "one embodiment" or "this embodiment" appearing throughout the specification do not necessarily refer to the same embodiment. In addition, these specific features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.

[0040] In addition, the present application may repeat reference numerals and / or letters in different examples. This repetition is for the purpose of simplicity and clarity, and does not in itself indicate the relationship between the various embodiments and / or settings discussed.

[0041] The term "and / or" in this article is only a description of the association relationship of associated objects, indicating that there can be three relationships. For example, A and / or B can mean: A exists alone, B exists alone, and A and B exist at the same time. The term " / and" in this article describes another type of association object relationship, indicating that there can be two relationships. For example, A / and B can mean: A exists alone, and A and B exist alone. In addition, the character " / " in this article generally indicates that the associated objects before and after are in an "or" relationship.

[0042] The term "at least one" in this article is merely a description of the association relationship of associated objects, indicating that there may be three relationships. For example, at least one of A and B can mean: A exists alone, A and B exist at the same time, and B exists alone.

[0043] It should also be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusions.

[0044] Example 1

[0045] according to Figure 1 As shown, there is an imbalance in the distribution of monitoring points on both sides of the monitoring unit. This embodiment designs a method for screening monitoring points in the boundary area of ​​adjacent monitoring units. The steps specifically include:

[0046] according to Figure 2 As shown, step S1, the area S of each monitoring unit i and the number of monitoring points n i According to the formula Calculate and use the result as the threshold L i ;

[0047] according to Figure 3 As shown, step S2, calculate the shortest distance dis from all monitoring point data to the monitoring unit boundary line, using the threshold L i Standard: dis<L i When dis>L i When , the monitoring point data is marked as B;

[0048] Step S3: In each monitoring unit, all monitoring points are sorted from small to large according to the shortest distances dis calculated in step S2, and the monitoring points are set to {a 1 ,a 2 ,···,a i} Set Z;

[0049] Step S4: Determine the closest distance pairing between the monitoring point A in the monitoring unit and the monitoring points of the adjacent monitoring unit, and put the closest distance and the corresponding point pair into the matrix M:

[0050] Step S5, repeat step S4 for each monitoring unit to obtain the final M matrix in each monitoring unit;

[0051] according to Figure 6As shown, step S6, in each monitoring unit, calculate the distance k between any two points in monitoring point A, select the point pair corresponding to the farthest two points as the point pair to be screened, and take the point between the two points closest to the common boundary line of the adjacent monitoring units as the first point, sort the other points other than the two points in A from small to large according to the distance k between the first point, and select the point pairs corresponding to one or more points evenly according to the distance.

[0052] The present application intends to design a spatial analysis algorithm, using the two point pairs corresponding to the two points with the farthest distance as comparison data, sorting them according to the distance k from the first point in the two point pairs to other points in the Class A points of the monitoring unit, and evenly selecting the point pairs corresponding to one or more points in the middle as the point pairs that need to be screened. This can effectively solve the problem of uneven distribution of monitoring points on both sides of the common boundary of adjacent monitoring units, and can quickly select one or more point pairs closest to the common edge from adjacent monitoring units.

[0053] Example 2

[0054] This embodiment designs a method for screening monitoring points in the boundary area of ​​adjacent monitoring units, which is further designed on the basis of Embodiment 1.

[0055] In step S3, the set Z stores the number, coordinates, distance value and A and B classifications of the monitoring points.

[0056] In step S4, this operation is performed on each Class A monitoring point, and the point closest to each Class A monitoring point is found in the adjacent monitoring units.

[0057] The specific steps in step S4 include:

[0058] according to Figure 4 As shown, step S4a, find the adjacent monitoring units of each monitoring unit, calculate a in the monitoring unit 1 The distance from the monitoring point to all monitoring points in the adjacent monitoring units;

[0059] Step S4b: compare the adjacent monitoring unit with a 1 The point with the shortest distance to point a 1 Match, match the matched points to p 1 and the corresponding distance d min Put it into the matrix M and put a 1 Delete from set Z;

[0060] Step S4c: 2 Repeat the above pairing steps to iterate all monitoring points in the set Z and obtain {(p 1 ,d min1 ),(p 2 ,d min2 ),···,(pi ,d mini )}Matrix M;

[0061] Step S4d: replace d in matrix M min Compared with the threshold of the monitoring unit, d is finally deleted in the matrix M min >L i +L i+1 Point pair (the threshold of the monitoring unit is L i , the threshold of the adjacent unit is L i+1 );

[0062] according to Figure 6 As shown, step S4e, according to the p retained in the final matrix M i a i The monitoring points of category A are deleted, and only the monitoring points existing in M ​​are retained, and the other points are placed in the monitoring points of category B.

[0063] The point pair information in step S4b includes: point a 1 And the adjacent monitoring unit with point a 1 The number and coordinates of the nearest point, as well as point a 1 And the adjacent monitoring unit with point a 1 The distance between the closest points.

[0064] In step S4d, L i +L i+1 It is the sum of the thresholds of two adjacent monitoring units.

[0065] In step S6, the point pairs corresponding to the two points in the A-type point with the largest k are first screened out as a reference for the subsequent point selection.

[0066] The present application provides a method for screening monitoring points in the boundary area of ​​adjacent monitoring units. For large-scale monitoring and investigation work, the method can utilize the spatial positions of the monitoring points of adjacent monitoring units to find out the monitoring points in the boundary area of ​​adjacent monitoring units that belong to different monitoring units, so as to verify the differences in their monitoring data. The method is accurate and fast.

[0067] The above description is only the preferred embodiment of the present invention, which does not limit the protection scope of the present invention. For those skilled in the art, the present invention can be modified and varied in various ways. Within the spirit and principle of the present invention, any change, modification, replacement, integration and parameter change of these embodiments by conventional substitution or capable of achieving the same function without departing from the principle and spirit of the present invention shall fall within the protection scope of the present invention.

Claims

1. A method for screening monitoring points in the boundary area of ​​adjacent monitoring units, characterized in that: The method specifically comprises: Step S1: The area S of the monitoring unit i and the number of monitoring points n i According to the formula Calculate and use the result as the threshold L i ; Step S2: Calculate the shortest distance dis from all monitoring points to the monitoring unit boundary line, using the threshold L i Standard: When dis≤L i When dis>L i When , the monitoring point is marked as Class B; Step S3: sort all monitoring points in ascending order according to the shortest distances dis calculated in step S2, and set the monitoring points to {a1, a2, ···, a i } Set Z; Step S4: Determine the closest distance pairing between the monitoring point A in the monitoring unit and the monitoring points of the adjacent unit, and put the closest distance and the corresponding point pair into the matrix M: Step S5, repeat step S4 for the monitoring unit to obtain the final matrix M of the monitoring unit; Step S6, calculate the distance k between any two points in monitoring point A, select the two point pairs corresponding to the two points with the farthest distance as the point pairs to be screened, and take the point closest to the common boundary line of the adjacent monitoring units among the two points as the first point, sort the other points other than the two points in A from small to large according to the distance k between the first point, and select the point pairs corresponding to one or more points evenly according to the distance.

2. A method for screening monitoring points in the boundary area of ​​adjacent monitoring units according to claim 1, characterized in that: In step S3, the set Z stores the number, coordinates, distance value and A and B classifications of the monitoring points.

3. The method for screening monitoring points in the boundary area of ​​adjacent monitoring units according to claim 1, characterized in that: In step S4, this operation is performed on each Class A monitoring point, and the point closest to each Class A monitoring point is found in the adjacent monitoring units.

4. A method for screening monitoring points in the boundary area of ​​adjacent monitoring units according to claim 3, characterized in that: The specific steps in step S4 include: Step S4a, searching for adjacent monitoring units of the monitoring unit, and calculating the distances from the monitoring point a1 in the monitoring unit to all monitoring points in the adjacent monitoring units; Step S4b, match the point with the shortest distance to a1 in the adjacent monitoring unit with point a1, and match the matched point pair p1 and the corresponding distance d min Put it into the matrix M and delete a1 in the set Z; Step S4c: Repeat the above pairing steps for a2, and iterate all monitoring points in the set Z to obtain {(p1,d min1 ),(p2,d min2 ),···,(p i ,d mini )}Matrix M; Step S4d: replace d in matrix M min Compared with the threshold of the monitoring unit, d is finally deleted in the matrix M min >L i +L i+1 point pair; wherein, the L i+1 is the threshold of adjacent cells; Step S4e: According to the p retained in the final matrix M i a i The monitoring points of category A are deleted, and only the monitoring points existing in M ​​are retained, and the other points are placed in the monitoring points of category B.

5. A method for screening monitoring points in the boundary area of ​​adjacent monitoring units according to claim 4, characterized in that: The point pair information in step S4b includes: the number and coordinates of point a1 and the point closest to point a1 in the adjacent monitoring unit, and the distance between point a1 and the point closest to point a1 in the adjacent monitoring unit.

6. A method for screening monitoring points in the boundary area of ​​adjacent monitoring units according to claim 4, characterized in that: In step S4d, L i +L i+1 It is the sum of the thresholds of two adjacent monitoring units.

7. A method for screening monitoring points in the boundary area of ​​adjacent monitoring units according to claim 1, characterized in that: In step S6, point pairs corresponding to two points in the A-type point with the largest k are first screened out as a reference for subsequent point selection.

Citation Information

Patent Citations

  • Methods and systems for detection in an industrial internet of things data collection environment with large data sets

    CA3072045A1

  • Heavy metal content dynamic prediction method

    CN115116558A

  • Odor substance screening method for pesticide-polluted site

    CN115639340A

  • Method and device for reconstructing three-dimensional temperature field of concrete dam and electronic equipment

    CN116502319A

  • Method and system for optimizing and adjusting positions of soil environment monitoring network points

    CN117113689A