CN111274345A - Similar area retrieval method and system based on grid division and value taking - Google Patents

Similar area retrieval method and system based on grid division and value taking Download PDF

Info

Publication number
CN111274345A
CN111274345A CN202010070771.3A CN202010070771A CN111274345A CN 111274345 A CN111274345 A CN 111274345A CN 202010070771 A CN202010070771 A CN 202010070771A CN 111274345 A CN111274345 A CN 111274345A
Authority
CN
China
Prior art keywords
grid
equivalent
similarity
input
area
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202010070771.3A
Other languages
Chinese (zh)
Inventor
郑理
李为民
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chengdu Zhiku 2861 Information Technology Co ltd
Original Assignee
Chengdu Zhiku 2861 Information Technology Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Chengdu Zhiku 2861 Information Technology Co ltd filed Critical Chengdu Zhiku 2861 Information Technology Co ltd
Priority to CN202010070771.3A priority Critical patent/CN111274345A/en
Publication of CN111274345A publication Critical patent/CN111274345A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/29Geographical information databases
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/95Retrieval from the web
    • G06F16/953Querying, e.g. by the use of web search engines
    • G06F16/9537Spatial or temporal dependent retrieval, e.g. spatiotemporal queries

Landscapes

  • Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Remote Sensing (AREA)
  • Image Analysis (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention discloses a similar area retrieval method and a system based on grid division and value taking, wherein the method comprises the following steps of grid division, namely dividing any geographical area into a plurality of same grids d; searching a similar area, acquiring equivalent grid set coordinates of an input grid set, and calculating the similarity between the input grid set and the equivalent grid set; judging a retrieval result, and if the similarity between the input grid set and the equivalent grid set is greater than the threshold similarity, judging that the input grid set and the equivalent grid set are similar; otherwise, the judgment is not similar. The invention aims to provide a similar region retrieval method and a similar region retrieval system based on grid division and value taking.

Description

Similar area retrieval method and system based on grid division and value taking
Technical Field
The invention relates to the technical field of data quantitative analysis application, in particular to a similar area retrieval method and system based on grid division and value taking.
Background
Any geographic area can be regarded as one or more grid sets with the same specification, once the size of the grid is determined, the size of the grid coverage area is determined, and the coverage area of a geographic area by which grids are covered is determined. Similarly, by arbitrarily designating a set of grid sets, this set can approximately cover an arbitrarily shaped geographic area.
Each mesh is quantized using the same set of dimensions, i.e., features of the mesh. Such a set of features is a set of multidimensional data (also called vectors). The quantitative result of the strength, the size and the degree of the certain feature of a grid is the value of the corresponding feature position in the grid vector.
The retrieval of similar areas means that for a given area and the multi-dimensional feature vectors of the area, the area which is identical or similar to the given area in shape and feature vectors is searched and retrieved in the geographic area. In retrieving this particular area in similar geographic regions, there are three core problems that need to be solved:
(1) the basic unit forming the area can be a grid or a grid set, and the area formed by the grid set is not necessarily in a regular shape;
(2) the two groups of grids are described by two groups of multi-dimensional feature vectors, and how to quantify the similarity between the two groups of grids;
(3) the two regions used for comparison may differ in direction, but may still be considered similar in geographic area, and such changes in direction may include rotation and symmetry.
In summary, under the similar geographic region retrieval scene, a richer and more comprehensive retrieval mode needs to be provided on the region granularity, the quantization dimension and the region azimuth. However, in the current similar geographic search analysis method, especially for the search method in the multi-dimensional quantization and region direction, there is no quantization method for calculating the similarity by using the multi-dimensional data similarity and the region orientation transformation.
Disclosure of Invention
The invention aims to provide a similar region retrieval method and a similar region retrieval system based on grid division and value taking.
The invention is realized by the following technical scheme:
a similar area retrieval method based on grid division and value taking comprises the following steps:
dividing a random geographical area into a plurality of grids d with the same size and shape;
D={d1,d2,...,dm}
where D represents a geographic area containing m grids, DmRepresenting the mth grid in the geographic area;
searching a similar area, acquiring equivalent grid set coordinates of an input grid set, and calculating the similarity between the input grid set and the equivalent grid set;
judging a retrieval result, if the similarity between the input grid set and the equivalent grid set is greater than the threshold similarity, judging that the area where the input grid set is located is similar to the area where the equivalent grid set is located; otherwise, the area of the input grid set is judged to be dissimilar to the area of the equivalent grid set.
In the technical scheme, the geographic area is subjected to grid division, and each grid is quantized into a group of eigenvalue vectors. For an input target area, the target area is defined as a group of grid sets covering the target area, other grid sets with characteristic value vectors similar to the grid set of the target area are searched in the whole geographic area, and the similar geographic area can be accurately found. In addition, as the geographic area is divided into grids, the area with any shape can be represented by the grids, so that the applicability of the scheme is increased.
Wherein, the arbitrary grid d contains two sets of attribute information:
(1) coordinates (a, b) of the grid d in the entire geographical area;
(2) the feature vector v of the grid dx,vx=[vx1,vx2,...,vxn]Wherein v isxnRepresents the feature vector vxThe n-th element in (1), the feature vector vxEach element in (a) is characteristic information of the geographical location where the grid d is located. The characteristic information of the geographic position of the grid d comprises the population number, the greening rate, the average price of restaurant consumption and the like of the geographic position.
The obtaining of the equivalent grid set coordinates of the input grid set specifically includes:
randomly selecting one grid d from grids d in the geographic area as a reference point dyReference point dyThe coordinates of (i, j);
within said geographic area, except for said reference point dyRandomly selecting one grid set from the rest grids d as an original point set;
wrapping the set of origin points around the reference point dyRotating or bringing the set of origin points to the reference point dyAfter the horizontal axis or the vertical axis is processed symmetrically, a plurality of equivalent grid sets of the original point set and coordinates of the equivalent grid sets are obtained.
The efficient and accurate similar area retrieval can be performed by considering special conditions such as area rotation, mirror image and the like which can occur in a geographical area scene.
Wherein, calculating the similarity between the input grid set and the equivalent grid set comprises:
quantizing each grid d in the input grid set and any equivalent grid set by using an n-dimensional vector to obtain 2 m x n matrixes, wherein m represents the number of grids d in one grid set;
and calculating the number A of the same element value at each corresponding position in the 2 matrixes, wherein the ratio of the number A of the same elements to the total number of the elements is the similarity of the two grid sets.
Calculating the similarity between the input grid set and the equivalent grid set comprises:
quantizing each grid d in the input grid set and any equivalent grid set by using an n-dimensional vector to obtain 2 m x n matrixes, wherein m represents the number of grids d in one grid set;
and calculating the similarity of the two grid sets by calculating the distance between the two vectors after the vectorization of the two matrixes, wherein the similarity of the two grid sets is in inverse proportion to the distance between the two vectors.
A similar area retrieval system based on grid division and value taking comprises:
the dividing unit is used for dividing any geographical area into a plurality of grids d with the same size and shape;
D={d1,d2,...,dm}
where D represents a geographic area containing m grids, DmRepresenting the mth grid in the geographic area;
the retrieval unit is used for acquiring equivalent grid set coordinates of the input grid set according to the grid information divided by the dividing unit, calculating the similarity between the input grid set and the equivalent grid set and transmitting the calculated similarity to the judging unit;
the judging unit is used for receiving the similarity between the input grid set and the equivalent grid set transmitted by the retrieval unit and comparing the similarity with the threshold similarity; if the similarity between the input grid set and the equivalent grid set is greater than the threshold similarity, judging that the area where the input grid set is located is similar to the area where the equivalent grid set is located; otherwise, the area of the input grid set is judged to be dissimilar to the area of the equivalent grid set.
The arbitrary mesh d contains two sets of attribute information:
(1) coordinates (a, b) of the grid d in the entire geographical area;
(2) the feature vector v of the grid dx,vx=[vx1,vx2,...,vxn]Wherein v isxnRepresents the feature vector vxThe n-th element in (1), the feature vector vxIs the gridd, the characteristic information of the geographic position of the grid d comprises the population number, the greening rate, the average price of restaurant consumption and the like of the geographic position.
The obtaining of the equivalent grid set coordinates of the input grid set specifically includes:
randomly selecting one grid d from grids d in the geographic area as a reference point dyReference point dyThe coordinates of (i, j);
within said geographic area, except for said reference point dyRandomly selecting one grid set from the rest grids d as an original point set;
wrapping the set of origin points around the reference point dyRotating or bringing the set of origin points to the reference point dyAfter the horizontal axis or the vertical axis is processed symmetrically, a plurality of equivalent grid sets of the original point set and coordinates of the equivalent grid sets are obtained.
Calculating the similarity between the input grid set and the equivalent grid set comprises:
quantizing each grid d in the input grid set and any equivalent grid set by using an n-dimensional vector to obtain 2 m x n matrixes, wherein m represents the number of grids in one grid set;
and calculating the number A of the same element value at each corresponding position in the 2 matrixes, wherein the ratio of the number A of the same elements to the total number of the elements is the similarity of the two grid sets.
Calculating the similarity between the input grid set and the equivalent grid set comprises:
quantizing each grid d in the input grid set and any equivalent grid set by using an n-dimensional vector to obtain 2 m x n matrixes, wherein m represents the number of grids d in one grid set;
and calculating the similarity of the two grid sets by calculating the distance between the two vectors after the vectorization of the two matrixes, wherein the similarity of the two grid sets is in inverse proportion to the distance between the two vectors.
Compared with the prior art, the invention has the following advantages and beneficial effects:
1. the method comprises the steps of carrying out grid division on a geographic area, quantizing each grid d into a group of characteristic value vectors, defining the target area as a group of grid sets covering the target area for the input target area, and searching other grid sets with characteristic value vectors similar to the grid set of the target area in the whole geographic area so as to accurately find out the similar geographic area.
2. The method supports regions of any shapes, and can perform effective and accurate similar region retrieval under special conditions of region rotation, mirror image and the like which may occur in a geographical region scene.
Drawings
The accompanying drawings, which are included to provide a further understanding of the embodiments of the invention and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the invention and together with the description serve to explain the principles of the invention. In the drawings:
FIG. 1 is a schematic diagram of the location of reference points in a grid in accordance with one embodiment of the present invention;
FIG. 2 is a schematic diagram of the location of each grid within a grid geographic region in accordance with an embodiment of the present invention;
fig. 3 is a schematic diagram illustrating the locations of grid sets in a geographic region according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is further described in detail below with reference to examples and accompanying drawings, and the exemplary embodiments and descriptions thereof are only used for explaining the present invention and are not meant to limit the present invention.
Examples
As shown in the figures 1-3 of the drawings,
a similar area retrieval method based on grid division and value taking comprises the following steps:
dividing a random geographical area into a plurality of grids d with the same size and shape;
D={d1,d2,...,dm}
where D represents a geographic area containing m grids, DmRepresenting the mth grid in the geographic area;
searching a similar area, acquiring equivalent grid set coordinates of an input grid set, and calculating the similarity between the input grid set and the equivalent grid set;
judging a retrieval result, if the similarity between the input grid set and the equivalent grid set is greater than the threshold similarity, judging that the area where the input grid set is located is similar to the area where the equivalent grid set is located; otherwise, the area of the input grid set is judged to be dissimilar to the area of the equivalent grid set.
The arbitrary mesh d contains two sets of attribute information:
(1) coordinates (a, b) of the grid d in the entire geographical area;
(2) the feature vector v of the grid dx,vx=[vx1,vx2,...,vxn],vxnRepresents the feature vector vxThe n-th element in (1), the feature vector vxEach element in the table is feature information of a geographic location where the grid d is located, the feature information of the geographic location where the grid d is located includes the population number, the greening rate, the average price of restaurant consumption and the like of the geographic location, and each element is a value quantifying one dimension of the grid.
The obtaining of the equivalent grid set coordinates of the input grid set specifically includes:
randomly selecting one grid d from grids d in the geographic area as a reference point dyReference point dyThe coordinates of (i, j);
within said geographic area, except for said reference point dyRandomly selecting one grid set from the rest grids d as an original point set;
wrapping the set of origin points around the reference point dyRotating or bringing the set of origin points to the reference point dyAfter the horizontal axis or the vertical axis is processed symmetrically, a plurality of equivalent grid sets and a plurality of equivalent grid sets of the original point set are obtainedCoordinates of the collection.
Calculating the similarity between the input grid set and the equivalent grid set comprises:
quantizing each grid d in the input grid set and any equivalent grid set by using an n-dimensional vector to obtain 2 m x n matrixes, wherein m represents the number of grids d in one grid set;
and calculating the number A of the same element value at each corresponding position in the 2 matrixes, wherein the ratio of the number A of the same elements to the total number of the elements is the similarity of the two grid sets.
Calculating the similarity between the input grid set and the equivalent grid set comprises:
quantizing each grid d in the input grid set and any equivalent grid set by using an n-dimensional vector to obtain 2 m x n matrixes, wherein m represents the number of grids d in one grid set;
and calculating the similarity of the two grid sets by calculating the distance between the two vectors after the vectorization of the two matrixes, wherein the similarity of the two grid sets is in inverse proportion to the distance between the two vectors.
For ease of understanding, the description is made with specific examples:
as shown in fig. 1, any 1 geographic area is divided into a grid set composed of 49 grids, in the figure, grid 0 is a reference point, where the coordinate of reference point 0 is (i, j). A grid d is arbitrarily chosen around the reference point 0 and is labeled 1, with the coordinates of grid 1 being (a, b). Taking a reference point 0 as a center, rotating the grid 1 around the reference point 0 clockwise or anticlockwise to obtain a plurality of equivalent grids; the horizontal axis or the vertical axis of the reference point 0 is used for symmetry processing, so that a plurality of equivalent grids can be obtained, and it is worth to say that the equivalent grids can also be obtained in other ways, not only limited to the two ways, but also the number of the equivalent grids can be selected according to actual situations. In this embodiment, after the grid 1 is processed, 7 reference grids equivalent to the grid 1 are obtained and are respectively denoted by 2, 3, 4, 5, 6, 7, and 8, as shown in fig. 2.
Thus, the equivalent grid of grid 1 with respect to reference point 0 includes grid 2, grid 3, grid 4, grid 5, grid 6, grid 7, and grid 8. The equivalent position coordinates of each equivalent grid are shown in table 1:
Figure BDA0002377232940000061
Figure BDA0002377232940000071
TABLE 1
It should be noted that the grid 1 can be expanded to an arbitrary shape grid set, in this embodiment, the grid set 1 is composed of three adjacent grids, whose coordinates are [ (a, b), (a, b +1), (a +1, b +1) ], and the equivalent grid set of the grid set 1 relative to the reference point 0 has 2, 3, 4, 5, 6, 7, 8, as shown in fig. 3, where the equivalent position coordinates of each equivalent grid are shown in table 2:
Figure BDA0002377232940000072
TABLE 2
Therefore, for any one mesh set, as long as the reference mesh and the original mesh set are given, the equivalent mesh set with respect to the reference mesh can be directly obtained.
After the coordinates of the equivalent grid set of the input grid set are obtained, the similarity between the input grid set and the equivalent grid set can be calculated.
In this embodiment, taking the grid set 1 as an example, the grid set 1 includes three grids, and each grid is quantized by an n-dimensional vector, thereby forming a 3 × n matrix; each equivalent grid set is also quantized with an n-dimensional vector, from which 7 different 3 x n matrices are obtained. Each element in the matrix represents characteristic information of a grid in different geographic positions, the characteristic information can be the population number, the greening rate and the average price of restaurant consumption or other parameters of the geographic position, and the value of n is selected according to actual conditions.
After all the grid sets are quantized, the similarity between the input grid set and the equivalent grid set can be calculated, and the similarity calculation method comprises two methods:
(1) and calculating the number A of the same element value at each corresponding position in the matrix of the grid set and the matrix of the equivalent grid set, wherein the ratio of the number A of the same elements to the total number of the elements is the similarity of the two grid sets.
(2) Calculating the similarity of the two grid sets by calculating the distance between the two vectors after the vectorization of the two matrixes, wherein the closer the distance between the two vectors is, the greater the similarity of the two grid sets is; the further the distance between the two vectors, the less similar the two sets of grids. The similarity calculation method may be a euclidean distance, a manhattan distance, a mahalanobis distance, or other calculation method.
No matter which method is used for similarity calculation, as long as the similarity between the input grid set and the equivalent grid set is greater than the threshold similarity, the area where the input grid set is located is judged to be similar to the area where the equivalent grid set is located; otherwise, the judgment is not similar.
A similar area retrieval system based on grid division and value taking comprises:
the dividing unit is used for dividing any geographical area into a plurality of grids d with the same size and shape;
D={d1,d2,...,dm}
where D represents a geographic area containing m grids, DmRepresenting the mth grid in the geographic area;
the retrieval unit is used for acquiring equivalent grid set coordinates of the input grid set according to the grid information divided by the dividing unit, calculating the similarity between the input grid set and the equivalent grid set and transmitting the calculated similarity to the judging unit;
the judging unit is used for receiving the similarity between the input grid set and the equivalent grid set transmitted by the retrieval unit and comparing the similarity with the threshold similarity; if the similarity between the input grid set and the equivalent grid set is greater than the threshold similarity, judging that the area where the input grid set is located is similar to the area where the equivalent grid set is located; otherwise, the area of the input grid set is judged to be dissimilar to the area of the equivalent grid set.
The arbitrary mesh d contains two sets of attribute information:
(1) coordinates (a, b) of the grid d in the entire geographical area;
(2) the feature vector v of the grid dx,vx=[vx1,vx2,...,vxn],vxnRepresents the feature vector vxThe n-th element in (1), the feature vector vxEach element in the table is feature information of a geographic location where the grid d is located, the feature information of the geographic location where the grid d is located includes the population number, the greening rate, the average price of restaurant consumption and the like of the geographic location, and each element is a value quantifying one dimension of the grid.
The obtaining of the equivalent grid set coordinates of the input grid set specifically includes:
randomly selecting one grid d from grids d in the geographic area as a reference point dyReference point dyThe coordinates of (i, j);
within said geographic area, except for said reference point dyRandomly selecting one grid set from the rest grids d as an original point set;
wrapping the set of origin points around the reference point dyRotating or bringing the set of origin points to the reference point dyAfter the horizontal axis or the vertical axis is processed symmetrically, a plurality of equivalent grid sets of the original point set and coordinates of the equivalent grid sets are obtained.
Calculating the similarity between the input grid set and the equivalent grid set comprises:
quantizing each grid d in the input grid set and any equivalent grid set by using an n-dimensional vector to obtain 2 m x n matrixes, wherein m represents the number of grids d in one grid set;
and calculating the number A of the same element value at each corresponding position in the 2 matrixes, wherein the ratio of the number A of the same elements to the total number of the elements is the similarity of the two grid sets.
Calculating the similarity between the input grid set and the equivalent grid set comprises:
quantizing each grid d in the input grid set and any equivalent grid set by using an n-dimensional vector to obtain 2 m x n matrixes, wherein m represents the number of grids d in one grid set;
and calculating the similarity of the two grid sets by calculating the distance between the two vectors after the vectorization of the two matrixes, wherein the similarity of the two grid sets is in inverse proportion to the distance between the two vectors.
For ease of understanding, the description is made with specific examples: as shown in fig. 1, an arbitrary 1 geographic area is divided into a grid set composed of 49 grids, in the figure, grid 0 is a reference point, where the coordinate of reference point 0 is (i, j), one grid d is arbitrarily selected and labeled as 1 around reference point 0, and the coordinate of grid 1 is (a, b). Taking a reference point 0 as a center, rotating the grid 1 around the reference point 0 clockwise or anticlockwise to obtain a plurality of equivalent grids; the horizontal axis or the vertical axis of the reference point 0 is used for symmetry processing, so that a plurality of equivalent grids can be obtained, and it is worth to say that the equivalent grids can also be obtained in other ways, not only limited to the two ways, but also the number of the equivalent grids can be selected according to actual situations. In this embodiment, after the grid 1 is processed, 7 reference grids equivalent to the grid 1 are obtained and are respectively denoted by 2, 3, 4, 5, 6, 7, and 8, as shown in fig. 2.
Therefore, the equivalent grids of grid 1 include grid 2, grid 3, grid 4, grid 5, grid 6, grid 7 and grid 8 with respect to reference point 0, and the equivalent position coordinates of each equivalent grid are shown in table 1:
Figure BDA0002377232940000091
Figure BDA0002377232940000101
TABLE 1
It should be noted that the grid 1 can be expanded to an arbitrary shape grid set, in this embodiment, the grid set 1 is composed of three adjacent grids, whose coordinates are [ (a, b), (a, b +1), (a +1, b +1) ], and the equivalent grid set of the grid set 1 relative to the reference point 0 has 2, 3, 4, 5, 6, 7, 8, as shown in fig. 3, where the equivalent position coordinates of each equivalent grid are shown in table 2:
Figure BDA0002377232940000102
TABLE 2
Therefore, for any one mesh set, as long as the reference mesh and the original mesh set are given, the equivalent mesh set with respect to the reference mesh can be directly obtained.
After the coordinates of the equivalent grid set of the input grid set are obtained, the similarity between the input grid set and the equivalent grid set can be calculated.
In this embodiment, taking the grid set 1 as an example, the grid set 1 includes three grids, and each grid is quantized by an n-dimensional vector, thereby forming a 3 × n matrix; each equivalent grid set is also quantized with an n-dimensional vector, from which 7 different 3 x n matrices are obtained. Each element in the matrix represents characteristic information of a grid in different geographic positions, the characteristic information can be the population number, the greening rate, the average price of restaurant consumption or the like of the geographic position, and the value of n is selected according to actual conditions.
After all the grid sets are quantized, the similarity between the input grid set and the equivalent grid set can be calculated, and the similarity calculation method comprises two methods:
(1) and calculating the number A of the same element value at each corresponding position in the matrix of the grid set and the matrix of the equivalent grid set, wherein the ratio of the number A of the same elements to the total number of the elements is the similarity of the two grid sets.
(2) Calculating the similarity of the two grid sets by calculating the distance between the two vectors after the vectorization of the two matrixes, wherein the closer the distance between the two vectors is, the greater the similarity of the two grid sets is; the further the distance between the two vectors, the less similar the two sets of grids. The similarity calculation method may be a euclidean distance, a manhattan distance, a mahalanobis distance, or other calculation method.
No matter which method is used for similarity calculation, as long as the similarity between the input grid set and the equivalent grid set is greater than the threshold similarity, the area where the input grid set is located is judged to be similar to the area where the equivalent grid set is located; otherwise, the judgment is not similar.
The above-mentioned embodiments are intended to illustrate the objects, technical solutions and advantages of the present invention in further detail, and it should be understood that the above-mentioned embodiments are merely exemplary embodiments of the present invention, and are not intended to limit the scope of the present invention, and any modifications, equivalent substitutions, improvements and the like made within the spirit and principle of the present invention should be included in the scope of the present invention.

Claims (10)

1. A similar area retrieval method based on grid division and value taking is characterized by comprising the following steps:
dividing a random geographical area into a plurality of grids d with the same size and shape;
D={d1,d2,...,dm}
where D represents a geographic area containing m grids, DmRepresenting the mth grid in the geographic area;
searching a similar area, acquiring equivalent grid set coordinates of an input grid set, and calculating the similarity between the input grid set and the equivalent grid set;
judging a retrieval result, if the similarity between the input grid set and the equivalent grid set is greater than the threshold similarity, judging that the area where the input grid set is located is similar to the area where the equivalent grid set is located; otherwise, the area of the input grid set is judged to be dissimilar to the area of the equivalent grid set.
2. The method for retrieving the similar region based on the grid division and the value taking as claimed in claim 1, wherein the arbitrary grid d comprises two sets of attribute information:
(1) coordinates (a, b) of the grid d in the entire geographical area;
(2) the feature vector v of the grid dx,vx=[vx1,vx2,...,vxn]Wherein v isxnRepresents the feature vector vxThe n-th element in (1), the feature vector vxEach element in (a) is characteristic information of the geographical location of the grid d.
3. The method for retrieving similar regions based on grid division and value taking according to any one of claims 1 or 2, wherein the obtaining of the equivalent grid set coordinates of the input grid set specifically includes:
randomly selecting one grid d from grids d in the geographic area as a reference point dyReference point dyThe coordinates of (i, j);
within said geographic area, except for said reference point dyRandomly selecting one grid set from the rest grids d as an original point set;
wrapping the set of origin points around the reference point dyRotating or bringing the set of origin points to the reference point dyAfter the horizontal axis or the vertical axis is processed symmetrically, a plurality of equivalent grid sets of the original point set and coordinates of the equivalent grid sets are obtained.
4. The method of claim 3, wherein calculating the similarity between the input mesh set and the equivalent mesh set comprises:
quantizing each grid d in the input grid set and any equivalent grid set by using an n-dimensional vector to obtain 2 m x n matrixes, wherein m represents the number of grids d in one grid set;
and calculating the number A of the same element value at each corresponding position in the 2 matrixes, wherein the ratio of the number A of the same elements to the total number of the elements is the similarity of the two grid sets.
5. The method of claim 3, wherein calculating the similarity between the input mesh set and the equivalent mesh set comprises:
quantizing each grid d in the input grid set and any equivalent grid set by using an n-dimensional vector to obtain 2 m x n matrixes, wherein m represents the number of grids d in one grid set;
and calculating the similarity of the two grid sets by calculating the distance between the two vectors after the vectorization of the two matrixes, wherein the similarity of the two grid sets is in inverse proportion to the distance between the two vectors.
6. A similar area retrieval system based on meshing and value taking is characterized by comprising:
the dividing unit is used for dividing any geographical area into a plurality of grids d with the same size and shape;
D={d1,d2,...,dm}
where D represents a geographic area containing m grids, DmRepresenting the mth grid in the geographic area;
the retrieval unit is used for acquiring equivalent grid set coordinates of the input grid set according to the grid information divided by the dividing unit, calculating the similarity between the input grid set and the equivalent grid set and transmitting the calculated similarity to the judging unit;
the judging unit is used for receiving the similarity between the input grid set and the equivalent grid set transmitted by the retrieval unit and comparing the similarity with the threshold similarity; if the similarity between the input grid set and the equivalent grid set is greater than the threshold similarity, judging that the area where the input grid set is located is similar to the area where the equivalent grid set is located; otherwise, the area of the input grid set is judged to be dissimilar to the area of the equivalent grid set.
7. The system according to claim 6, wherein the arbitrary mesh d includes two sets of attribute information:
(1) coordinates (a, b) of the grid d in the entire geographical area;
(2) the feature vector v of the grid dx,vx=[vx1,vx2,...,vxn]Wherein v isxnRepresents the feature vector vxThe n-th element in (1), the feature vector vxEach element in (a) is characteristic information of the geographical location where the grid d is located.
8. The system according to any one of claims 6 or 7, wherein the obtaining of the equivalent grid set coordinates of the input grid set specifically comprises:
randomly selecting one grid d from grids d in the geographic area as a reference point dyReference point dyThe coordinates of (i, j);
within said geographic area, except for said reference point dyRandomly selecting one grid set from the rest grids d as an original point set;
wrapping the set of origin points around the reference point dyRotating or bringing the set of origin points to the reference point dyAfter the horizontal axis or the vertical axis is processed symmetrically, a plurality of equivalent grid sets of the original point set and coordinates of the equivalent grid sets are obtained.
9. The system of claim 8, wherein calculating the similarity between the input mesh set and the equivalent mesh set comprises:
quantizing each grid d in the input grid set and any equivalent grid set by using an n-dimensional vector to obtain 2 m x n matrixes, wherein m represents the number of grids d in one grid set;
and calculating the number A of the same element value at each corresponding position in the 2 matrixes, wherein the ratio of the number A of the same elements to the total number of the elements is the similarity of the two grid sets.
10. The system of claim 8, wherein calculating the similarity between the input mesh set and the equivalent mesh set comprises:
quantizing each grid d in the input grid set and any equivalent grid set by using an n-dimensional vector to obtain 2 m x n matrixes, wherein m represents the number of grids d in one grid set;
and calculating the similarity of the two grid sets by calculating the distance between the two vectors after the vectorization of the two matrixes, wherein the similarity of the two grid sets is in inverse proportion to the distance between the two vectors.
CN202010070771.3A 2020-01-21 2020-01-21 Similar area retrieval method and system based on grid division and value taking Pending CN111274345A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010070771.3A CN111274345A (en) 2020-01-21 2020-01-21 Similar area retrieval method and system based on grid division and value taking

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010070771.3A CN111274345A (en) 2020-01-21 2020-01-21 Similar area retrieval method and system based on grid division and value taking

Publications (1)

Publication Number Publication Date
CN111274345A true CN111274345A (en) 2020-06-12

Family

ID=71003372

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010070771.3A Pending CN111274345A (en) 2020-01-21 2020-01-21 Similar area retrieval method and system based on grid division and value taking

Country Status (1)

Country Link
CN (1) CN111274345A (en)

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2005086092A1 (en) * 2004-03-03 2005-09-15 Nec Corporation Image similarity calculation system, image search system, image similarity calculation method, and image similarity calculation program
JP2007065763A (en) * 2005-08-29 2007-03-15 Sharp Corp Image data retrieval device, image data retrieval method, program and recording medium
CN104978437A (en) * 2015-07-22 2015-10-14 浙江大学 Geographic position-based recommendation method and recommendation system
CN108960624A (en) * 2018-07-03 2018-12-07 深圳市和讯华谷信息技术有限公司 Grid similarity determination method, device and system based on user's visiting information
CN109509016A (en) * 2018-09-25 2019-03-22 中国平安人寿保险股份有限公司 Sale processing method, apparatus and computer readable storage medium
CN110688435A (en) * 2018-07-04 2020-01-14 北京嘀嘀无限科技发展有限公司 Similar track searching method and system

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2005086092A1 (en) * 2004-03-03 2005-09-15 Nec Corporation Image similarity calculation system, image search system, image similarity calculation method, and image similarity calculation program
JP2007065763A (en) * 2005-08-29 2007-03-15 Sharp Corp Image data retrieval device, image data retrieval method, program and recording medium
CN104978437A (en) * 2015-07-22 2015-10-14 浙江大学 Geographic position-based recommendation method and recommendation system
CN108960624A (en) * 2018-07-03 2018-12-07 深圳市和讯华谷信息技术有限公司 Grid similarity determination method, device and system based on user's visiting information
CN110688435A (en) * 2018-07-04 2020-01-14 北京嘀嘀无限科技发展有限公司 Similar track searching method and system
CN109509016A (en) * 2018-09-25 2019-03-22 中国平安人寿保险股份有限公司 Sale processing method, apparatus and computer readable storage medium

Similar Documents

Publication Publication Date Title
CN111199214B (en) Residual network multispectral image ground object classification method
US8849030B2 (en) Image retrieval using spatial bag-of-features
JP2002319024A (en) Image retrieval method based on combination of color and material feeling
CN108428220B (en) Automatic geometric correction method for ocean island reef area of remote sensing image of geostationary orbit satellite sequence
US8774508B2 (en) Local feature amount calculating device, method of calculating local feature amount, corresponding point searching apparatus, and method of searching corresponding point
CN110633262A (en) Map intersection area calculation method and system based on Spark
CN113487523B (en) Method and device for optimizing graph contour, computer equipment and storage medium
CN106780639A (en) Hash coding method based on the sparse insertion of significant characteristics and extreme learning machine
CN112465122A (en) Device and method for optimizing original dimension operator in neural network model
CN116993555A (en) Partition method, system and storage medium for identifying territory space planning key region
CN118038379A (en) Vehicle small target detection method and device based on lightweight network design
CN114554592A (en) Optimized positioning method and device for combining communication big data rasterization algorithm with Gis engine
CN110991562B (en) Animal group geographic division method based on species composition characteristics
CN111274345A (en) Similar area retrieval method and system based on grid division and value taking
CN116704171A (en) Cross-view and cross-mode geographic positioning method based on multi-scale local descriptor aggregation network
CN113360586B (en) Address aggregation degree query method, device, equipment and computer readable storage medium
Cruces et al. A compact representation of raster time series
CN112235723B (en) Positioning method, positioning device, electronic equipment and computer readable storage medium
US11537622B2 (en) K-nearest neighbour spatial queries on a spatial database
Zhang et al. Parallel selectivity estimation for optimizing multidimensional spatial join processing on gpus
CN116630564B (en) Three-dimensional geocoding method for large-scale full-element scene
CN113256645B (en) Color image segmentation method based on improved density clustering
CN110210533B (en) Picture group geographical positioning method based on maximum coverage position problem
CN113486093B (en) Typhoon path similarity evaluation method
CN117152650B (en) Video content analysis method and video event information network for massive videos

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication

Application publication date: 20200612

RJ01 Rejection of invention patent application after publication