CN115329319A

CN115329319A - Spatial operator searching system based on elastic search technology

Info

Publication number: CN115329319A
Application number: CN202211058974.6A
Authority: CN
Inventors: 谭龙生; 汪蓓; 曾航; 周宏文; 戴一明; 罗波; 唐小洪; 沙漠; 张小敏; 雷秋霞; 柴垚; 向友云; 罗鲜华; 王俊秀; 唐险峰
Original assignee: Chongqing Planning And Natural Resources Information Center
Current assignee: Chongqing Planning And Natural Resources Information Center
Priority date: 2022-08-31
Filing date: 2022-08-31
Publication date: 2022-11-11
Anticipated expiration: 2042-08-31
Also published as: CN115329319B

Abstract

The invention provides a spatial operator searching system based on an elastic search technology, which comprises the following steps: s1, a retrieval user logs in a retrieval platform; and S2, after the retrieval user logs in the retrieval platform, the retrieval platform retrieves according to the retrieval words input by the user to obtain a retrieval result. The invention can display the retrieval result on the client after safely logging in the retrieval platform.

Description

Spatial operator searching system based on ElasticSearch technology

Technical Field

The invention relates to the technical field of geographic information, in particular to a spatial operator searching system based on an elastic search technology.

Background

The explosion of data has grown, placing more demand on searches. Among many requirements, fast search response and accurate results are the most basic and most concerned. In the fast aspect, there are numerous underlying search engines that provide good solutions, with the open-source Solr and Elasticsearch making important contributions to the search domain. The patent application number 2018109074899, entitled "a file indexing system and method based on elastic search full-text retrieval", discloses a file indexing system and method based on elastic search full-text retrieval, and comprises a user operation management module, a file system, an E l a S t i c S E a r c h cluster module, a database system and an elastic search client module, wherein the system can completely retrieve file contents in real time, retrieval results at any time can not be outdated and wrong, and resource waste caused by the elastic search when the file system full-text retrieval is executed is effectively reduced; the method can realize the bidirectional communication between the file and the elastic search, support the acquisition of the path of the file where the retrieval result is located, and execute more operations on the hit file.

Disclosure of Invention

The invention aims to at least solve the technical problems in the prior art, and particularly provides a spatial operator searching system based on an elastic search technology.

In order to achieve the above purpose, the invention provides a spatial operator search system based on an elastic search technology, which comprises a retrieval user login module, a spatial graph import module, a spatial graph retrieval module and a plot graph display module;

the data output end of the retrieval user login module is connected with the data input end of the space graph import module, the data output end of the space graph import module is connected with the data input end of the space graph retrieval module, and the data output end of the space graph retrieval module is connected with the data input end of the plot graph display module;

the retrieval user login module is used for retrieving a user login retrieval platform;

the space graph importing module is used for retrieving a space graph imported by a user at a client;

the spatial graph retrieval module is used for retrieving a spatial graph related to a user login retrieval platform according to the spatial graph introduced by the retrieval user by the retrieval platform after the user login retrieval platform is searched;

the plot graph display module is used for displaying plot graphs.

In a preferred embodiment of the present invention, the spatial graphics import module comprises the following steps:

s21, the client judges whether a trigger command for uploading the spatial pattern is received:

if the client receives the trigger command of uploading the spatial pattern, executing the next step;

if the client does not receive the spatial pattern uploading trigger command, continuing to wait, and returning to the step S21;

s22, the client acquires the space graph imported by the retrieval user in the uploading frame, and after acquiring the space graph imported by the retrieval user in the uploading frame, the client sends the acquired space graph to the retrieval platform;

the spatial pattern retrieval module comprises the following steps:

s23, after receiving the space graph sent by the client, the retrieval platform extracts the graph coordinates of the received space graph to obtain a graph coordinate set;

s24, the retrieval platform retrieves a graph intersected with the received space graph according to the graph coordinate set;

and S25, displaying the graph data searched by the search platform on the client, wherein the graph data comprises the area and the circumference of each graph.

In a preferred embodiment of the present invention, step S24 includes the following steps:

S241，H＝{H ₁ ,H ₂ ,H ₃ ,…,H _h h denotes a set of graphic coordinates, H ₁ Representing the 1 st coordinate, H, extracted from the received spatial pattern ₂ Representing the 2 nd coordinate, H, extracted from the received spatial pattern ₃ Representing the 3 rd coordinate, H, extracted from the received spatial pattern _h The h coordinate extracted from the received space graph is represented, and h represents the total number of the coordinates in the received space graph; [ H ] ₁ ∪H ₂ ∪H ₃ ∪…∪H _h ]For the space pattern received by the retrieval platform, the U represents that the set logic accords with the union set; let the self-increment value h' =1;

s242, judging the H' th coordinate H _h′ Whether pattern set G = { G = { (G) } ₁ ,G ₂ ,G ₃ ,…G _g In (v), G ₁ Representing the 1 st plot pattern, G ₂ Representing the 2 nd plot, G ₃ Representing the 3 rd plot pattern, G _g Representing the g plot graph, wherein g represents the total number of plots; g ₁ ∪G ₂ ∪G ₃ ∪…∪G _g For the whole plot pattern, the U represents the union of the set logics;

g′＝1、2、3、……、g，g″＝1、2、3、……、g，g′≠g″；

if the H' th coordinate is H _h′ In graphic set G = { G = ₁ ,G ₂ ,G ₃ ,…G _g In will H' th coordinate H _h′ Placing the corresponding plot graph in a plot collection set, wherein h '= h' +1; executing the next step;

if the H' th coordinate is H _h′ Not in the graphic set G = { G = ₁ ,G ₂ ,G ₃ ,…G _g In, then h '= h' +1; executing the next step;

s243, judging the size relation between h' and h:

if h '> h, h' represents the self-increment, and h represents the total number of coordinates in the received space graph, executing the next step;

if h 'is less than or equal to h, h' represents the self-increment value, and h represents the total number of coordinates in the received space graph, returning to the step S242;

s244, judging the size relationship between the number of the plot collection centralized plot graphs and the total number of coordinates in the received space graphs:

if h 'is less than h, h' represents the number of the plot graphs in the plot collection set, and h represents the total number of coordinates in the received space graph, deleting the same plot graphs in the plot collection set; executing the next step;

if h = h, h "represents the number of the plot patterns in the plot collection set, and h represents the total number of coordinates in the received space pattern, judging whether the plot patterns in the plot collection set are the same:

if the plot graphs in the plot collection set are the same, the graphs intersected with the received space graph are not obtained through retrieval;

if the plot graphs in the plot collection set are not all the same, deleting the same plot graphs in the plot collection set, and executing the next step;

s245, extracting the plot pattern in the plot collection set after deleting the same plot pattern in the plot collection set, wherein the plot pattern in the plot collection set is the plot pattern intersected with the received space pattern.

In a preferred embodiment of the present invention, in step S25, the area of each graph is calculated by:

wherein, plex _u Representing the area of the pixel point u;

U _s the total number of pixel points of the s-th plot graph is represented;

S _s representing the area of the s-th plot; s =1, 2, 3, \8230;, S' represents the total number of plot patterns intersecting the received spatial pattern;

the calculation method of the perimeter of each graph comprises the following steps:

wherein, plex _u Representing the area of the pixel point u;

l _s representing the total number of pixel points on the contour line of the s-th plot graph;

L _s representing the perimeter of the s-th plot; s =1, 2, 3, \8230;, S' represents the total number of plot patterns intersecting the received spatial pattern;

the calculation method of the intersection area of each land pattern comprises the following steps:

wherein, plex _u Representing the area of the pixel point u;

U′ _s′ the total number of pixel points of the s' -th intersected plot graph is represented;

S′ _s′ representing the area of the s' th intersecting plot; s' =1, 2, 3, \8230;, S "represents the total number of intersecting plot patterns among plot patterns intersecting the received spatial pattern;

the calculation method of the intersecting perimeter of each land parcel figure comprises the following steps:

wherein, plex _u Representing the area of the pixel point u;

l′ _s′ representing the total number of pixel points on the contour line of the s' th intersected plot graph;

L′ _s′ representing the perimeter of the s' th intersecting plot; s' =1, 2, 3, \8230;, S "indicates the total number of intersected land parcel patterns existing in land parcel patterns intersected with the received spatial pattern.

In a preferred embodiment of the present invention, the retrieving user login module comprises the following steps:

s11, acquiring a retrieval account number, a retrieval password, an authentication code and a client ID code input by a retrieval user;

s12, fusing the retrieval password and the verification code obtained in the step S11 to obtain a two-code fusion code;

s13, mapping the two-code fusion code obtained in the step S12 into a two-code mapping code;

s14, converting the two-code mapping code obtained in the step S13 into a two-code security code and a two-code security image;

and S15, uploading the two-code security code and the two-code security image obtained in the step S14 and the retrieval account number and the client ID code obtained in the step S11 to a retrieval platform for verification.

In a preferred embodiment of the present invention, the method for converting the two-code mapping code into the two-code security code in step S14 includes the steps of:

s141, converting the two-code mapping code in the step S13 into a two-dimensional code;

s142, converting the two-code mapping code in the step S13 into a binary numerical value;

s143, sequentially writing the binary numerical values in the step S142 into the black frame of the two-dimensional code in the step S142 from left to right and from top to bottom;

s144, writing the numerical value 1 into a white frame of the two-dimensional code, and taking the last written black frame as an end point;

s145, sequentially taking out numerical values in the two-dimensional code from left to right and from top to bottom;

s146, converting the numerical value taken out in the step S145 into a security character with the same system as the binary code mapping code, wherein the security character is the binary code security code;

and S147, extracting the image of the two-dimensional code written with the

numerical values

0 and 1, wherein the image is the two-code security image.

In a preferred embodiment of the present invention, the method of retrieving the platform verification in step S15 includes the steps of:

s151, after receiving the two-code security code and the two-code security image, the retrieval account and the client ID code sent by the client, the retrieval platform respectively obtains the two-code security platform code and the two-code security platform image, and the retrieval platform account and the client ID platform code;

s152, converting the two-code security platform code obtained in the step S151 into a binary platform numerical value;

s153, sequentially writing the binary platform numerical values into the frame of the two-code safety platform image in the step S151 from left to right and from top to bottom;

s154, sequentially taking out numerical values from the black frame of the two-code security platform image from left to right and from top to bottom;

s155, converting the numerical value extracted in the step S154 into a binary code mapping platform code with the same system as the binary code mapping code; then the two-code mapping platform code is inversely mapped into a two-code platform code;

s156, searching according to the client ID platform code obtained in the step S151 to obtain a verification code sent by a retrieval platform;

s157, obtaining an analysis password and an analysis verification code according to the verification code obtained in the step S156 and the two-code platform code obtained in the step S155;

s158, determining whether the analysis verification code obtained in step S157 is consistent with the verification code obtained in step S156:

if the analysis verification code obtained in step S157 is consistent with the verification code obtained in step S156, executing the next step;

if the analysis verification code obtained in step S157 is not consistent with the verification code obtained in step S156, re-inputting the verification code, or re-inputting the search account number, the search password, and the verification code, and returning to step S11;

s159, searching for the retrieval platform password corresponding to the retrieval platform account according to the retrieval platform account obtained in step S151, and determining whether the retrieval platform password matches the analysis password obtained in step S157:

if the search platform password is consistent with the analysis password obtained in the step S157, the search user successfully logs in the search platform;

if the search platform password is not consistent with the analysis password obtained in step S157, the search password and the verification code are input again, or the search account number, the search password and the verification code are input again, and the process returns to step S11.

In a preferred embodiment of the present invention, the obtaining manner of the two-code fusion code in step S12 includes the following steps:

s121, judging the relationship between the digit of the retrieval password obtained in the step S11 and the digit of the verification code obtained in the step S11:

if A ₁ -A ₂ ≤A ₀ ，and

Wherein A is ₁ Number of digits, A, of the search code obtained in step S11 ₂ Indicating the number of digits of the authentication code obtained in step S11, A ₀ Representing a first threshold of a predetermined number of bits, and representing a logical relationship and,

indicating that the element set symbol does not belong to, Z ⁺ Representing a positive integer set, step S122 is performed;

if A ₁ -A ₂ ≥A ₀ ′，and

Wherein, A ₁ Presentation stepThe number of digits of the search code obtained in S11, A ₂ Indicating the number of digits, A, of the authentication code obtained in step S11 ₀ ' represents a second threshold of a preset number of bits, A ₀ ′-A ₀ =1, and represents a logical relationship and,

indicating that the element set symbol does not belong to, Z ⁺ Representing a positive integer set, and executing step S123;

if it is

Wherein A is ₁ Number of digits, A, of the search password obtained in step S11 ₂ Representing the number of bits of the captcha obtained in step S11, e representing the element set symbol belonging, Z ⁺ Representing a positive integer set, and executing step S124;

S122，

wherein B represents a two-code fusion code;

B ₁ a 1 st character indicating that the retrieval password obtained in step S11 is counted from left to right; that is, the top character of the retrieval password obtained in step S11 counted from left to right;

B ₂ a 2 nd digit character indicating that the retrieval password obtained in step S11 is counted from left to right;

B ₃ a 3 rd digit character indicating that the retrieval password obtained in step S11 is counted from left to right;

a-th code representing the search code obtained in step S11 counted from left to right ₁ A bit character; that is, the last character of the retrieval password obtained in step S11 counted from left to right;

b ₁ a 1 st character indicating that the verification code obtained in step S11 is counted from left to right; that is to say thatThe first character of the verification code obtained in the step S11 counted from left to right;

b ₂ a 2 nd character indicating that the verification code obtained in step S11 is counted from left to right;

b ₃ a 3 rd bit character indicating that the verification code obtained in the step S11 is counted from left to right;

the A-th code representing the verification code obtained in step S11 counted from left to right ₂ A bit character; that is, the last character of the verification code obtained in step S11 counted from left to right;

S123，

wherein B represents a two-code fusion code;

B ₁ a 1 st character indicating that the search password obtained in step S11 is counted from left to right; that is, the first character of the retrieval password obtained in step S11 counted from left to right;

B ₂ a 2 nd character indicating that the retrieval password obtained in step S11 is counted from left to right;

b ₁ a 1 st character indicating that the verification code obtained in step S11 is counted from left to right; that is, the first character of the verification code obtained in step S11 counted from left to right;

b ₂ the 2 nd bit indicating the verification code obtained in step S11 counted from left to rightA character;

S124，

wherein, B represents a two-code fusion code;

the A-th password representing the search password obtained in step S11 counted from left to right ₂ A bit character;

a-th code representing the search code obtained in step S11 counted from left to right ₂ A +1 bit character;

a-th code representing the search code obtained in step S11 counted from left to right ₂ + 2-bit characters;

the A-th password representing the search password obtained in step S11 counted from left to right ₂ A +3 bit character;

the A-th password representing the search password obtained in step S11 counted from left to right ₁ A bit character; that is, the last character of the retrieval password obtained in step S11 counted from left to right;

b ₂ a 2 nd-bit character indicating that the verification code obtained in the step S11 is counted from left to right;

b ₃ a 3 rd bit character indicating that the verification code obtained in step S11 is counted from left to right;

the A-th code representing the verification code obtained in step S11 counted from left to right ₂ A bit character; i.e. the last character from left to right of the verification code obtained in step S11.

In a preferred embodiment of the present invention, the method for obtaining the parsed password and the parsed verification code in step S157 includes the following steps:

s1571, determining a relationship between the digits of the two-code platform code obtained in step S155 and the digits of the verification code obtained in step S156:

if A is ₁ ′-2A ₂ ′≤A ₀ ，and

Wherein A is ₁ ' indicates the number of bits of the two-code platform code obtained in step S155, A ₂ ' indicates that in step S156, getTaking the number of digits of the verification code, A ₀ Representing a first threshold of a preset number of bits, and represents a logical relationship and,

indicating that the element set symbol does not belong to, Z ⁺ Representing a positive integer set, executing step S1572;

if A is ₁ ′-2A ₂ ′≤A ₀ ′，and

Wherein A is ₁ ' indicates the number of bits of the two-code platform code obtained in step S155, A ₂ ' indicates the number of digits of the authentication code obtained in step S156, A ₀ ' represents a second threshold of a preset number of bits, A ₀ ′-A ₀ =1, and denotes a logical relationship and,

indicating that the element set symbol does not belong to, Z ⁺ Representing a positive integer set, executing step S1573;

if it is

Wherein A is ₁ ' indicates the number of bits of the two-code platform code obtained in step S155, A ₂ ' represents the number of bits of the authentication code obtained in step S156, and e represents that the element set symbol belongs to, Z ⁺ Representing a positive integer set, step S1574 is performed;

S122，

wherein B' represents a two-code platform code;

B ₁ ' 1 st character indicating that the analytic password obtained in step S157 is counted from left to right; that is, the first character of the analyzed password obtained in step S157 counted from left to right;

B ₂ ' indicates the number from left to right of the analytic code obtained in step S1572-bit characters;

B ₃ ' represents the 3 rd digit character from left to right of the analytic password obtained in step S157;

a-th showing the number of analyzed passwords obtained in step S157 from left to right ₁ ′-A ₂ A' bit character; that is, the last character counted from left to right of the analyzed password obtained in step S157;

b ₂ ' represents the 2 nd digit character from left to right of the analytic verification code obtained in step S157;

b ₃ ' represents the 3 rd bit character from left to right of the parsing validation code obtained in step S157;

a-th showing the number of analysis verification codes from left to right obtained in step S157 ₂ A' bit character; that is, the last character counted from left to right of the parsing validation code obtained in step S157;

S123，

wherein B' represents a two-code platform code;

B ₂ ' a 2 nd character indicating that the analysis password obtained in step S157 is counted from left to right;

B ₃ ' indicates that acquisition in step S157 resultedThe 3 rd digit character of the analyzed password counted from left to right;

a-th showing the number of analyzed passwords obtained in step S157 from left to right ₁ ′-A ₂ A' bit character; that is, the last character counted from left to right of the parsed password obtained in step S157;

b ₂ ' a 2 nd character indicating that the parsing validation code obtained in step S157 is counted from left to right;

a-th representing the analysis verification code obtained in step S157 counted from left to right ₂ A' bit character; that is, the last character counted from left to right of the parsing validation code obtained in step S157;

S124，

wherein B' represents a two-code platform code;

a-th representing the analytic code obtained in step S157 counted from left to right ₂ A' bit character;

a-th representing the analytic code obtained in step S157 counted from left to right ₂ ' +1 bit character;

a-th representing the analytic code obtained in step S157 counted from left to right ₂ ' +2 bit characters;

a-th representing the analytic code obtained in step S157 counted from left to right ₂ ' +3 bit characters;

a-th representing the analytic code obtained in step S157 counted from left to right ₁ ′-A ₂ A' bit character; that is, the last character counted from left to right of the parsed password obtained in step S157;

b ₁ ' 1 st character indicating that the analysis password obtained in step S157 is counted from left to right; that is, the first character of the analyzed password obtained in step S157 counted from left to right;

a-th showing the number of analysis verification codes from left to right obtained in step S157 ₂ A' bit character; that is, the last character from left to right of the resolved authentication code obtained in step S157.

In a preferred embodiment of the present invention, step S141 is to convert the two-code mapping code in step S13 into a two-dimensional code; and rotating the obtained two-dimensional code clockwise or anticlockwise by alpha, wherein the alpha = pi/2, pi and 3 pi/2.

In a preferred embodiment of the present invention, in step S159, the secret analysis password is obtained by encrypting the analysis password obtained in step S157, and the method for obtaining the secret analysis password comprises:

wherein the secure partial actual password represents a secret resolution password;

the MD5 hash rule method | | | | represents that the MD5 hash algorithm is adopted;

representing a resolved password;

B ₁ ' bit 1 character which represents the number from left to right of the resolved password; that is, the first character of the password is analyzed from left to right;

B ₂ ' means 2 nd digit character from left to right of the analyzed password;

B ₃ ' represents the 3 rd digit character of the analyzed password counted from left to right;

a-th showing the number of resolved passwords from left to right ₁ ′-A ₂ A' bit character; i.e. the last character from left to right of the analyzed password;

a search platform password corresponding to the search platform account is obtained by searching the search platform account obtained in step S151, and it is determined whether the search platform password matches the confidential analysis password obtained in step S159:

if the search platform password is consistent with the secret analysis password obtained in the step S159, the search user successfully logs in the search platform;

if the search platform password does not match the confidential analysis password obtained in step S159, the search password and the authentication code are input again, or the search account number, the search password, and the authentication code are input again, and the process returns to step S11.

In summary, due to the adoption of the technical scheme, the retrieval result can be displayed on the client after the client logs in the retrieval platform safely.

Additional aspects and advantages of the invention will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of the invention.

Drawings

The above and/or additional aspects and advantages of the present invention will become apparent and readily appreciated from the following description of the embodiments, taken in conjunction with the accompanying drawings of which:

FIG. 1 is a schematic block diagram of the process of the present invention.

FIG. 2 is a schematic diagram of a two-dimensional code image according to the present invention.

FIG. 3 is a diagram of binary value writing into a two-dimensional code image according to the present invention.

FIG. 4 is a diagram of writing a value 1 into a two-dimensional code image according to the present invention.

Fig. 5 is a schematic diagram of a two-code security image of the present invention.

FIG. 6 is a diagram of a binary platform value written into a two-code security platform image according to the present invention.

Fig. 7 is a schematic diagram of a two-dimensional code image rotated 90 ° counterclockwise according to the present invention.

FIG. 8 is a diagram of binary value writing into a two-dimensional code image according to the present invention.

FIG. 9 is a diagram of writing a value 1 into a two-dimensional code image according to the present invention.

Fig. 10 is a schematic diagram of a two-code security image of the present invention.

FIG. 11 is a diagram of a binary platform value written into a binary secure platform image according to the present invention.

Detailed Description

Reference will now be made in detail to embodiments of the present invention, examples of which are illustrated in the accompanying drawings, wherein like reference numerals refer to the same or similar elements or elements having the same or similar functions throughout. The embodiments described below with reference to the accompanying drawings are illustrative only for the purpose of explaining the present invention, and are not to be construed as limiting the present invention.

The invention provides a spatial operator searching system based on an ElasticSearch technology, which comprises a retrieval user login module, a spatial graph import module, a spatial graph retrieval module and a plot graph display module, wherein the retrieval user login module is connected with the spatial graph import module through a network;

the spatial graph retrieval module is used for retrieving a spatial graph related to a user login retrieval platform according to the spatial graph introduced by the retrieval user by the retrieval platform after the user login retrieval platform is searched; the incidence relation comprises an intersection relation and an inclusion relation.

The plot graph display module is used for displaying plot graphs.

if the client does not receive the spatial graph uploading trigger command, continuing to wait, and returning to the step S21;

s22, the client acquires the space graph imported in the uploading frame by the retrieval user, and after the client acquires the space graph imported in the uploading frame by the retrieval user, the client sends the acquired space graph to the retrieval platform;

the spatial pattern retrieval module comprises the following steps:

s24, the retrieval platform retrieves a graph associated with the received space graph according to the graph coordinate set;

In a preferred embodiment of the present invention, when the correlation is an intersection in step S24, the method includes the following steps:

S241，H＝{H ₁ ,H ₂ ,H ₃ ,…,H _h h denotes a set of graphic coordinates, H ₁ Representing the 1 st coordinate, H, extracted from the received spatial pattern ₂ Representing the 2 nd coordinate, H, extracted from the received spatial pattern ₃ Representing the 3 rd coordinate, H, extracted from the received spatial pattern _h Representing the h coordinate extracted from the received space graph, wherein h represents the total number of coordinates in the received space graph; [ H ] ₁ ∪H ₂ ∪H ₃ ∪…∪H _h ]For the space pattern received by the retrieval platform, the U represents that the set logic accords with the union set; let the self-increment value h' =1;

s242, judging the H' th coordinate H _h′ Whether pattern set G = { G = { (G) } ₁ ,G ₂ ,G ₃ ,…G _g In (v), G ₁ Showing the graphic of the No. 1 land, G ₂ Representing the 2 nd plot, G ₃ Representing the 3 rd plot pattern, G _g Representing the g plot graph, wherein g represents the total number of plots; g ₁ ∪G ₂ ∪G ₃ ∪…∪G _g For the whole landThe graph, U represents the union of the set logics;

g′＝1、2、3、……、g，g″＝1、2、3、……、g，g′≠g″；

if the H' th coordinate is H _h′ In graphic set G = { G = { (G) ₁ ,G ₂ ,G ₃ ,…G _g In the H ', the H' th coordinate is represented by H _h′ Placing the corresponding plot graph in a plot collection set, wherein h '= h' +1; executing the next step;

if the H' th coordinate H _h′ Out of the graphic set G = { G = { (G) ₁ ,G ₂ ,G ₃ ,…G _g In, then h '= h' +1; executing the next step;

s243, judging the size relation between h' and h:

if h 'is less than or equal to h, h' represents the self-increment value, and h represents the total number of coordinates in the received space pattern, returning to the step S242;

s244, judging the size relation between the number of the plot images in the plot collection set and the total number of the coordinates in the received space images:

and S245, extracting the plot patterns in the plot collection set after the same plot patterns in the plot collection set are deleted, wherein the plot patterns in the plot collection set are the plot patterns intersected with the received space patterns.

In a preferred embodiment of the present invention, in step S25, the area of each pattern is calculated by:

wherein, plex _u Representing the area of the pixel point u;

U _s the total number of pixel points of the s-th plot graph is represented;

wherein, plex _u Representing the area of the pixel point u;

the calculation method of the intersection area of each plot figure comprises the following steps:

wherein, plex _u Representing the area of the pixel point u;

S′ _s′ representing the area of the s' th intersecting plot; s' =1, 2, 3, \8230;, S", S" indicates the total number of intersecting plot patterns present in the plot pattern that intersects the received space pattern;

the calculation method of the intersecting perimeter of each land figure comprises the following steps:

wherein, plex _u Representing the area of the pixel point u;

l′ _s′ representing the total number of pixel points on the contour line of the s' -th intersected plot graph;

L′ _s′ representing the perimeter of the s' th intersecting plot; s' =1, 2, 3, \8230;, S "indicates the total number of intersecting parcel patterns that exist in the parcel patterns that intersect the received spatial pattern.

In a preferred embodiment of the present invention, step S245 further includes painting a land pattern intersecting the received space pattern, where the painting method includes the following steps:

s2451, acquiring a plot graph intersected with the received space graph, and marking the acquired plot graph intersected with the received space graph on a space map as a marking point;

s2452, acquiring RGB values of pixel points of the space map corresponding to the mark points and RGB values of adjacent pixel points of the space map corresponding to the mark points;

s2453, calculating a color coating value according to the RGB value of the pixel point of the space map corresponding to the mark point obtained in the step S2452 and the RGB value of the adjacent pixel point of the space map corresponding to the mark point obtained in the step S2452; the calculation method of the color coating value comprises the following steps:

wherein, GRAY (X) _i ,Y _i ,Z _i ) The pixel of the ith pixel point of the space map corresponding to the mark point is representedA value;

(X _i ,Y _i ,Z _i ) Representing the position coordinates of the ith pixel point on the space map;

i represents the total number of pixel points of the space map corresponding to the mark points;

GRAY _max representing the maximum pixel value of all pixel points of the space map corresponding to the mark point;

GRAY _min representing the minimum pixel value of all pixel points of the space map corresponding to the mark point;

GRAY′(X′ _j ,Y′ _j ,Z′ _j ) The pixel value of the jth adjacent pixel point of the space map corresponding to the mark point is represented;

(X′ _j ,Y′ _j ,Z′ _j ) Representing the position coordinates of the jth adjacent pixel point on the space map;

j represents the total number of adjacent pixel points of the space map corresponding to the mark points;

GRAY′ _max representing the maximum pixel value of all adjacent pixel points of the space map corresponding to the mark point;

GRAY′ _min representing the minimum pixel value in all adjacent pixel points of the space map corresponding to the mark point;

Q(X _i ,Y _i ,Z _i ) Representing a color-coated value;

s2454, color number Q (X) _i ,Y _i ,Z _i ) Painting as the pixel value of the corresponding mark point;

s2455, displaying the painted plot on the client.

In a preferred embodiment of the present invention, when the association relationship is an inclusion relationship in step S24, the method includes the following steps:

S241，H＝{H ₁ ,H ₂ ,H ₃ ,…,H _h h denotes a graphic coordinate set, H ₁ Representing the 1 st coordinate, H, extracted from the received spatial pattern ₂ Representing the 2 nd coordinate, H, extracted from the received spatial pattern ₃ Indicates a received nullCoordinate 3, H obtained by inter-pattern extraction _h Representing the h coordinate extracted from the received space graph, wherein h represents the total number of coordinates in the received space graph; [ H ] ₁ ∪H ₂ ∪H ₃ ∪…∪H _h ]For the space pattern received by the retrieval platform, the U represents that the set logic accords with the union set; let the self-increment value h' =1;

g′＝1、2、3、……、g，g″＝1、2、3、……、g，g′≠g″；

if the H' th coordinate H _h′ In graphic set G = { G = { (G) ₁ ,G ₂ ,G ₃ ,…G _g In the H ', the H' th coordinate is represented by H _h′ The corresponding plot pattern is used as a plot pattern to be verified, and h '= h' +1; executing the next step;

if the H' th coordinate is H _h′ Out of the graphic set G = { G = { (G) ₁ ,G ₂ ,G ₃ ,…G _g In the previous step, a graph contained in the received space graph is not retrieved;

s243, judging the size relation between h' and h:

if h 'is less than or equal to h, h' represents the self-increment, and h represents the total number of coordinates in the received space graph, executing the next step;

if h '> h, h' represents the self-increment, and h represents the total number of coordinates in the received space graph, executing S245;

s244, judging the H' th coordinate H _h′ Whether the map is in the plot to be verified:

if the H' th coordinate is H _h′ Is waiting to be verifiedIn the plot pattern, h '= h' +1; returning to step S243;

if the H' th coordinate is H _h′ If the graph is not in the plot to be verified, the graph contained in the received space graph is not retrieved;

and S245, the plot to be verified is the plot contained in the received space plot.

In a preferred embodiment of the present invention, in step S245, the method for calculating the area of the land pattern intersecting with the land pattern to be verified is:

wherein, plex _u Representing the area of the pixel point u;

U _s representing the total number of pixel points of the s plot pattern intersected with the plot pattern to be verified;

S _s representing the area of the s plot intersecting the plot to be verified; s =1, 2, 3, \8230;, S' represents the total number of plot patterns intersecting the plot pattern to be verified;

the calculation method of the perimeter of the plot intersecting with the plot to be verified comprises the following steps:

wherein, plex _u Representing the area of the pixel point u;

l _s representing the total number of pixel points on the contour line of the s plot intersected with the plot to be verified;

L _s representing the perimeter of the s-th plot intersecting the plot to be verified; s =1, 2, 3, \8230;, S' indicates the total number of plot patterns intersecting the plot pattern to be verified.

In a preferred embodiment of the present invention, the step S245 further includes painting the plot pattern intersecting the plot pattern to be verified, where the painting method includes the following steps:

s2451, acquiring a plot graph intersected with the plot graph to be verified, and marking the acquired plot graph intersected with the plot graph to be verified on a space map as a marking point;

wherein, GRAY (X) _i ,Y _i ,Z _i ) The pixel value of the ith pixel point of the space map corresponding to the mark point is represented;

(X′ _j ,Y′ _j ,Z′ _j ) Representing the position coordinates of the j-th adjacent pixel point on the space map;

Q(X _i ,Y _i ,Z _i ) Representing a color value of the paint;

s2455, displaying the painted plot on the client.

In a preferred embodiment of the present invention, the step of searching the user login module comprises:

s11, acquiring a retrieval account number, a retrieval password, an authentication code and a client ID code input by a retrieval user; the client ID code is not limited to a mainboard ID code, a CPUID code, a display card ID code and a hard disk ID code, but also can be a Bluetooth ID code, an ICCID code and an IMEIID code, when the client is a PC computer, the client ID code is preferably the CPUID code, and when the client is a smart phone, the client ID code is preferably the Bluetooth ID code; the search account number, the search password and the verification code input by the user are 92-system characters, and numerical values represented by the characters are shown in table 2.

S12, fusing the retrieval password and the verification code obtained in the step S11 to obtain a two-code fusion code; the safety factor of the password is improved by adjusting the position sequence of the retrieval password and the verification code.

S13, mapping the two-code fusion code obtained in the step S12 into a two-code mapping code; the safety factor of the password can be improved by mapping the two-code fusion code into the two-code mapping code.

S14, converting the two-code mapping code obtained in the step S13 into a two-code security code and a two-code security image; and converting the two-code mapping code into a two-code security code and a two-code security image to realize the secure transmission of the password.

and S147, extracting the image of the two-dimensional code written with the

numerical values

0 and 1, wherein the image is the two-code security image.

s151, after receiving a two-code security code and a two-code security image, a retrieval account and a client ID code sent by a client, a retrieval platform respectively obtains a two-code security platform code and a two-code security platform image, and a retrieval platform account and a client ID platform code;

s154, sequentially taking out numerical values from the black frame of the two-code security platform image according to the sequence from left to right and from top to bottom;

s157, according to the verification code obtained in the step S156 and the two-code platform code obtained in the step S155, obtaining an analysis password and an analysis verification code;

if A ₁ -A ₂ ≤A ₀ ，and

Wherein, A ₁ Number of digits, A, of the search code obtained in step S11 ₂ Indicating the number of digits of the authentication code obtained in step S11, A ₀ Representing a first threshold of a preset number of bits, and represents a logical relationship and,

indicating that the element set symbol does not belong to, Z ⁺ Representing a positive integer set, and executing step S122;

if A is ₁ -A ₂ ≥A ₀ ′，and

Wherein, A ₁ Number of digits, A, of the search code obtained in step S11 ₂ Indicating the number of digits, A, of the authentication code obtained in step S11 ₀ ' represents a second threshold value of a predetermined number of bits, A ₀ ′-A ₀ =1, and represents a logical relationship and,

if it is

S122，

wherein, B represents a two-code fusion code;

B ₁ a 1 st character indicating that the search password obtained in step S11 is counted from left to right; that is, the top character of the retrieval password obtained in step S11 counted from left to right;

B ₂ represents the step S11, acquiring a 2 nd character of the obtained retrieval password counted from left to right;

S123，

wherein B represents a two-code fusion code;

B ₁ a 1 st character indicating that the retrieval password obtained in step S11 is counted from left to right; that is, the first character of the retrieval password obtained in step S11 counted from left to right;

B ₃ 3 rd bit word indicating the number of search codes obtained in step S11 from left to rightMarking;

S124，

wherein B represents a two-code fusion code;

the A-th password representing the search password obtained in step S11 counted from left to right ₂ +1 bit character;

the A-th code representing the verification code obtained in step S11 counted from left to right ₂ A bit character; i.e. the last character from left to right of the verification code obtained in step S11.According to the digit of the retrieval password and the verification code, the retrieval password and the verification code are sequentially adjusted, and password security is facilitated.

if A ₁ ′-2A ₂ ′≤A ₀ ，and

Wherein, A ₁ ' indicates the number of bits of the two-code platform code obtained in step S155, A ₂ ' indicates the number of bits of the authentication code obtained in step S156, A ₀ Representing a first threshold of a preset number of bits, and represents a logical relationship and,

if A ₁ ′-2A ₂ ′≤A ₀ ′，and

Wherein A is ₁ ' indicates the number of bits of the two-code platform code obtained in step S155, A ₂ ' indicates the number of bits of the authentication code obtained in step S156, A ₀ ' represents a second threshold value of a predetermined number of bits, A ₀ ′-A ₀ =1, and represents a logical relationship and,

indicating that the element set symbol does not belong to, Z ⁺ Representing the positive integer set, executing step S1573;

if it is

Wherein, A ₁ ' indicates the number of bits of the two-code platform code obtained in step S155, A ₂ ' represents the number of bits of the captcha obtained in step S156, and e represents the element set symbol belonging to, Z ⁺ Representing the positive integer set, executing step S1574;

S122，

wherein, B' represents a two-code platform code;

B ₃ ' a 3 rd digit character indicating that the analysis password obtained in step S157 is counted from left to right;

a-th representing the analytic code obtained in step S157 counted from left to right ₁ ′-A ₂ A' bit character; that is, the last character counted from left to right of the analyzed password obtained in step S157;

indicates that the analysis verification code obtained in step S157 is right to leftNumber A ₂ A' bit character; that is, the last character counted from left to right of the analysis verification code obtained in step S157;

S123，

wherein, B' represents a two-code platform code;

B ₂ ' represents the 2 nd digit character from left to right of the analytic password obtained in step S157;

b ₃ ' a 3 rd bit character indicating that the parsing validation code obtained in step S157 is counted from left to right;

a-th representing the analysis verification code obtained in step S157 counted from left to right ₂ A' bit character; that is, the parsing scheme obtained in step S157 is from the leftThe last character counted to the right;

S124，

wherein B' represents a two-code platform code;

a-th showing the number of analyzed passwords obtained in step S157 from left to right ₂ A' bit character;

a-th representing the analytic code obtained in step S157 counted from left to right ₂ ' +3 bit character;

shown in step S157Obtaining the A-th number of the obtained analysis password from left to right ₁ ′-A ₂ A' bit character; that is, the last character counted from left to right of the parsed password obtained in step S157;

a-th showing the number of analysis verification codes from left to right obtained in step S157 ₂ A' bit character; that is, the last character from left to right of the parsing validation code obtained in step S157.

Assume that the search account number, the search password and the verification code input by the search user are admin, 0 and 01, respectively. The number of bits of a typical verification code is four bits, and the number of password bits is not less than six bits, but for illustration purposes, the number of bits for retrieving the password and the verification code is shortened.

Firstly, acquiring the searching account number, the searching password and the verification code input by the searching user as admin, 0 and 01 respectively.

In the second step, since the digit of the search code 0 is 4, the digit of the verification code 01 is 2, that is, the two digits are matched

Thus, the two-code fusion code B = B ₁ b ₁ B ₂ b ₂ B ₃ B ₄ ＝？01？0。

Third, do two-code fusion codes according to table 1? 01?0 is mapped to the two-code mapping code 010201.

TABLE 1 mapping of character 1 to character 2

Character 1

0

1

2

3

4

5

6

7

8

9

a

b

c

d

e

f

g

h

i

Character 2

1

2

3

4

5

6

7

8

9

a

b

c

d

e

f

g

h

i

j

Character 1

j

k

l

m

n

o

p

q

r

s

t

u

v

w

x

y

z

A

B

Character 2

k

l

m

n

o

p

q

r

s

t

u

v

w

x

y

z

A

B

C

Character 1

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

Character 2

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

Character 1

V

W

X

Y

Z

)

！

@

#

$

％

^

&

*

(

-

＝

[

]

Character 2

W

X

Y

Z

)

！

@

#

$

％

^

&

*

(

-

＝

[

]

\

Character

1

\

；

‘

,

.

/

_

+

{

}

|

:

“

<

>

？

Character 2

；

‘

,

.

/

_

+

{

}

|

:

“

<

>

？

0

Fourthly, the two-code mapping code 010201 is converted into binary value 0100010001010110001100100001 according to the table 2, and the decimal value is 071656225.

TABLE 2 numerical values corresponding to characters

Character(s)	0	1	2	3	4	5	6	7	8	9	a	b	c	d	e	f	g	h	i
																				Numerical value	0	1	2	3	4	5	6	7	8	9	10	11	12	13	14	15	16	17	18
Character(s)	j	k	l	m	n	o	p	q	r	s	t	u	v	w	x	y	z	A	B
																				Numerical value	19	20	21	22	23	24	25	26	27	28	29	30	31	32	33	34	35	36	37
Character(s)	C	D	E	F	G	H	I	J	K	L	M	N	O	P	Q	R	S	T	U
																				Numerical value	38	39	40	41	42	43	44	45	46	47	48	49	50	51	52	53	54	55	56
Character(s)	V	W	X	Y	Z	)	！	@	#	$	％	^	&	*	(	-	＝	[	]
																				Numerical value	57	58	59	60	61	62	63	64	65	66	67	68	69	70	71	72	73	74	75
Character(s)	\	；	‘	,	.	/	_	+	{	}	\|	:	“	<	>	？
																				Numerical value	76	77	78	79	81	81	82	83	84	85	86	87	88	89	90	91

Fifthly, converting the two-code mapping code 010201 into a two-dimensional code image, as shown in fig. 2.

Sixthly, sequentially writing the binary value 0100010001010110001100100001 into the black frame of the two-dimensional code from left to right and from top to bottom, as shown in fig. 3.

And seventhly, writing the numerical value 1 into a white frame of the two-dimensional code, as shown in fig. 4.

And eighthly, sequentially taking out the numerical values 0100010111001110101100111110111011101110100011 in the two-dimensional code from left to right and from top to bottom.

And a ninth step of converting the extracted numerical value 0100010111001110101100111111011101111110100011 into a security character 02& fk [: of the same scale as the binary code mapping code (L, which is the decimal 153508168720291, and the security character 02& fk [: which is the binary code security code.

And a tenth step of extracting an image of the two-dimensional code written with the

values

0 and 1, wherein the image is a two-code security image, as shown in fig. 5.

And step ten, uploading the two-code security code 02&fk [ (L and the two-code security image obtained in the step ten as well as the retrieval account admin and the client ID code obtained in the step one) obtained in the step ninth to a retrieval platform.

The verification process of the retrieval platform comprises the following steps:

a twelfth step, after receiving the two-code security code and the two-code security image, the retrieval account and the client ID code sent by the client, the retrieval platform respectively obtains the two-code security platform code and the two-code security platform image, and the retrieval platform account and the client ID platform code; the method comprises the following steps that a retrieval platform receives a two-code security code 02&fk [ (L is a two-code security platform code, a two-code security image sent by a client is received by the retrieval platform and is a two-code security platform image, a retrieval account number admin sent by the client is received by the retrieval platform and is a retrieval platform account number, and a client ID code sent by the client is received by the retrieval platform and is a client ID platform code;

step ten, the two-code security platform code 02&fk [: in step ten (L is converted into binary platform numerical value 0100010111001110101100111011101110100011;

fourteenth, writing the binary platform values into the boxes of the two-code security platform image in the twelfth step in sequence from left to right and from top to bottom, as shown in fig. 6;

fifthly, sequentially taking out numerical values from a black frame of the two-code security platform image from left to right and from top to bottom, wherein the numerical values are 0100010001010110001100100001;

sixthly, converting the numerical value 0100010001010110001100100001 extracted in the fifteenth step into a binary code mapping platform code 010201 which is the same as the binary code mapping code;

seventeenth, according to table 3, the two-code mapping stage code 010201 is demapped into a two-code stage code? 01?0.

TABLE 3 character 1 demaps to character 2

Character 1

0

1

2

3

4

5

6

7

8

9

a

b

c

d

e

f

g

h

i

Character 2

？

0

1

2

3

4

5

6

7

8

9

a

b

c

d

e

f

j

h

Character 1

j

k

l

m

n

o

p

q

r

s

t

u

v

w

x

y

z

A

B

Character 2

i

j

k

l

m

n

o

p

q

r

s

t

u

v

w

x

y

z

A

Character 1

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

Character 2

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

Character 1

V

W

X

Y

Z

)

！

@

#

$

％

^

&

*

(

-

＝

[

]

Character 2

U

V

W

X

Y

Z

)

！

@

#

$

％

^

&

*

(

-

＝

[

Character 1

；

‘

\

,

.

/

_

+

{

}

:

“

|

<

>

？

Character 2

]

；

‘

\

,

.

/

_

+

{

}

:

“

|

<

>

Eighteen, searching according to the client ID platform code obtained in the twelfth step to obtain a verification code 01 sent by the retrieval platform;

nineteenth step, is due to the two-code platform code? 01? The digit of 0 is 6, and the digit of the verification code sent by the retrieval platform is 2, namely the verification code is in line with

Thus, the device

So that the password B is parsed ₁ ′B ₂ ′B ₃ ′B ₄ ' = 0, analyze verification code b ₁ ′b ₂ ′＝01。

Twentieth, since the analysis verification code 01 obtained in the nineteenth step is identical to the verification code 01 obtained in the tenth step, the next step is executed;

twenty-first, searching to obtain a retrieval platform password 0 corresponding to the retrieval platform account according to the retrieval platform account admin obtained in the twelfth step.

And a twentieth step, because the retrieval platform password 0 corresponding to the retrieval platform account admin obtained by the retrieval platform account search obtained in the twentieth step is consistent with the analysis password 0 obtained in the nineteenth step, the retrieval user successfully logs in the retrieval platform.

In a preferred embodiment of the present invention, step S141 is to convert the two-code mapping code in step S13 into a two-dimensional code; and rotating the obtained two-dimensional code by alpha clockwise or anticlockwise, wherein the alpha = pi/2, pi and 3 pi/2.

In another embodiment: firstly, acquiring the searching account number, the searching password and the verification code input by the searching user as admin, 0 and 01 respectively.

Second, since the number of digits of the retrieval key 0 is 4, the number of digits of the verification code 01 is setThe number of bits being 2, i.e. coincidence

Third, do two-code fusion codes according to table 1? 01?0 is mapped into a two-code mapping code 010201;

Fifthly, converting the two-code mapping code 010201 into a two-dimensional code image, as shown in fig. 2; the two-dimensional code image is rotated 90 deg. counterclockwise as shown in fig. 7.

Sixthly, sequentially writing the binary value 0100010001010110001100100001 into the black frame of the two-dimensional code from left to right and from top to bottom, as shown in fig. 8.

Seventhly, writing the numerical value 1 into a white frame of the two-dimensional code, as shown in fig. 9.

And eighthly, sequentially taking out the numerical values 01000101110101111101111111101111101011110101100101101 from the left to the right and from the top to the bottom in sequence.

And step nine, converting the extracted numerical value 01000101110101111101111111111111101011110101100101101 into a security character I4$ PTmn =withthe same scale as the binary code mapping code, wherein the decimal is 247389155871533, and the security character I4$ PTmn = is the binary code security code.

values

0 and 1, which is the two-code security image, as shown in fig. 10.

And a tenth step, uploading the two-code security code I4$ PTmn = obtained in the ninth step, the two-code security image obtained in the tenth step, the retrieval account admin and the client ID code obtained in the first step to a retrieval platform.

a twelfth step, after receiving the two-code security code and the two-code security image, the retrieval account and the client ID code sent by the client, the retrieval platform respectively obtains a two-code security platform code, a two-code security platform image, the retrieval platform account and the client ID platform code; the retrieval platform receives a two-code security code I4$ PTmn = a two-code security platform code sent by a client, the two-code security image sent by the client is a two-code security platform image, the retrieval platform receives a retrieval account number admin sent by the client as a retrieval platform account number, and the retrieval platform receives a client ID code sent by the client as a client ID platform code;

a thirteenth step, converting the two-code safe platform code I4$ PTmn = in the twelfth step into a binary platform numerical value 01000101110101111101111111101011110101100101101;

fourteenth, writing the binary platform values into the frames of the two-code security platform image in the twelfth step in sequence from left to right and from top to bottom, as shown in fig. 11;

fifteenth, sequentially taking out numerical values 0100010001010110001100100001 from the black frame of the two-code security platform image from left to right and from top to bottom;

seventeenth, according to table 3, the two-code mapping stage code 010201 is demapped into a two-code stage code? 01?0;

eighteen, searching according to the client ID platform code obtained in the twelve steps to obtain a verification code 01 sent by the retrieval platform;

Thus, it is possible to provide

So that the password B is parsed ₁ ′B ₂ ′B ₃ ′B ₄ ' = 0, parsing verification code b ₁ ′b ₂ ′＝01。

Twentieth, because the analysis verification code 01 obtained in the nineteenth step is identical to the verification code 01 obtained in the tenth step, executing the next step;

And a twentieth step, because the retrieval platform account number obtained in the twentieth step searches for the retrieval platform password 0 corresponding to the retrieval platform account number admin and the analysis password 0 obtained in the nineteenth step are consistent, the retrieval user successfully logs in the retrieval platform.

representing a resolved password;

B ₁ ' represents the 1 st character of the analyzed password counted from left to right; that is, the first character of the password is analyzed from left to right;

B ₂ ' bit 2 character from left to right of the resolved password;

a-th showing the number of resolved passwords from left to right ₁ ′-A ₂ A' bit character; that is, the last character counted from left to right of the password is analyzed;

searching the retrieval platform account obtained in step S151 to obtain a retrieval platform password corresponding to the retrieval platform account, and determining whether the retrieval platform password matches the confidential analysis password obtained in step S159:

if the search platform password does not match the confidential analysis password obtained in step S159, the search password and the authentication code are input again, or the search account number, the search password, and the authentication code are input again, and the process returns to step S11. The retrieval platform password is stored instead of the stored retrieval password input in the step S11, so that the password of the retrieval platform can be stored, the password of the retrieval platform can not be logged in the platform even if the password of the retrieval platform is taken by the client platform, and the effect of safety guarantee is achieved.

values

0 and 1, wherein the image is a two-code security image, as shown in fig. 5.

the twelfth step, converting the two-code security platform code 02&fk [: in the eleventh step (L is converted into a binary platform numerical value 0100010111001110101100111111011101110100011;

fourteenth, writing the binary platform values into the frames of the two-code security platform image in the twelfth step sequentially from left to right and from top to bottom, as shown in fig. 6;

sixthly, converting the numerical value 0100010001010110001100100001 extracted in the fifteenth step into a binary code mapping platform code 010201 in the same system as the binary code mapping code;

nineteenth step, is due to the two-code platform code? 01? The digit of 0 is 6, and the digit of the verification code sent by the retrieval platform is 2, namely, the verification code is in line with

Thus, the device

twenty-first, a retrieval platform password 03234EF598DA6686 corresponding to the retrieval platform account is obtained by searching according to the retrieval platform account admin obtained in the twelfth step.

A twenty-second step, performing an MD5 hash algorithm on the analytic password 0 obtained in the nineteenth step to obtain a hidden analytic password:

the Securely parse actual password＝MD5 hash rule method||B ₁ ′B ₂ ′B ₃ ′B ₄ ′||

＝MD5 hash rule method|| 0||

＝03234EF598DA6686

in the twentieth step, since the retrieval platform password 03234EF598DA6686 corresponding to the retrieval platform account admin obtained by searching the retrieval platform account obtained in the twentieth step is consistent with the confidential resolution password 03234EF598DA6686 obtained in the twentieth step, the retrieval user successfully logs in the retrieval platform.

In another embodiment: firstly, acquiring a retrieval account, a retrieval password and a verification code which are respectively admin, 0 and 01 and input by a retrieval user.

Third, do two-code fusion codes according to table 1? 01? Mapping 0 into a two-code mapping code 010201;

And seventhly, writing the value 1 into a white frame of the two-dimensional code, as shown in fig. 9.

And step nine, converting the extracted numerical value 01000101110101111101111111111101011110101100101101 into a security character I4$ PTmn =whichhas the same scale as the binary code mapping code and is decimal 247389155871533, wherein the security character I4$ PTmn = is the binary code security code.

values

0 and 1, which is the two-code security image, as shown in fig. 10.

And step eleven, uploading the two-code security code I4$ PTmn = obtained in the step nine, the two-code security image obtained in the step eleven, the retrieval account admin obtained in the step one and the client ID code to a retrieval platform.

a twelfth step, after receiving the two-code security code and the two-code security image, the retrieval account and the client ID code sent by the client, the retrieval platform respectively obtains the two-code security platform code and the two-code security platform image, and the retrieval platform account and the client ID platform code; the method comprises the following steps that a retrieval platform receives a two-code security code I4$ PTmn = as a two-code security platform code sent by a client, the two-code security image received by the retrieval platform and sent by the client is a two-code security platform image, a retrieval account admin received by the retrieval platform and sent by the client is a retrieval platform account, and a client ID code received by the retrieval platform and sent by the client is a client ID platform code;

a tenth step, converting the two-code security platform code I4$ PTmn = in the twelfth step into a binary platform numerical value 01000101110101111101111101011110101100101101;

fourteenth, writing the binary platform values into the frames of the two-code security platform image in the twelfth step sequentially from left to right and from top to bottom, as shown in fig. 11;

nineteenth step, is two-code platform code? 01? The digit of 0 is 6, and the digit of the verification code sent by the retrieval platform is 2, namely the verification code is in line with

Thus, the device

Twenty-second step, performing MD5 hash algorithm on the analytic password 0 obtained in the nineteenth step to obtain a concealed analytic password:

＝MD5 hash rule method|| 0||

＝03234EF598DA6686

On a retrieval platform, the method for obtaining the retrieval platform password comprises the following steps:

s01, acquiring a retrieval password input by a retrieval user in a password registration frame during registration;

s02, mapping the retrieval password obtained in the step S01 into a retrieval mapping code;

s03, converting the retrieval mapping code obtained in the step S02 into a password security code and a password security image; the method for converting the search mapping code into the password security code and the password security image comprises the following steps:

s031, convert the search mapping code in step S03 into two-dimensional code;

s032, converting the retrieval mapping code in the step S03 into a binary numerical value;

s033, writing the binary values in step S032 into the black frames of the two-dimensional codes in step S032 sequentially from left to right and from top to bottom;

s034, writing the numerical value 1 into a white frame of the two-dimensional code, and taking the last written black frame as an end point;

s035, sequentially taking out numerical values in the two-dimensional codes from left to right and from top to bottom;

s036, converting the numerical value extracted in the step S035 into a security character with the same scale as the retrieval mapping code, wherein the security character is a password security code;

s037, extracting the image of the two-dimensional code written with the

numerical values

0 and 1, wherein the image is the password security image.

And S04, uploading the client ID code, the password security code obtained in the step S03 and the password security image to a retrieval platform for verification and registration. The method for verifying registration of the retrieval platform comprises the following steps:

s041, after receiving the password security code, the password security image and the client ID code sent by the client, the retrieval platform respectively obtains a password security platform code, a password security platform image and a client ID platform code;

s042, the password security platform code obtained in the step S041 is converted into a binary platform numerical value;

s043, sequentially writing the binary system platform values into the frame of the password security platform image in the step S041 from left to right and from top to bottom;

s044, sequentially taking out numerical values from the black frame of the password security platform image according to the sequence from left to right and from top to bottom;

s045, converting the numerical value extracted in the step S044 into a password mapping platform code with the same scale as the retrieval mapping code; then the password mapping platform code is inversely mapped into a password platform code; or, converting the value taken out in the step S044 into a password mapping platform code with the same scale as the retrieval mapping code; then, the password mapping platform code is inversely mapped into a password platform code;

and S046, generating a registration account according to the client ID platform code obtained in the step S041, associating the registration account with the password platform code, storing the registration account in a retrieval platform database, and returning the registration account to the retrieval user, wherein the registration process of the retrieval user is completed at this moment.

Or, in S041, after receiving the password security code, the password security image, and the client ID code sent by the client, the retrieval platform obtains the password security platform code, the password security platform image, and the client ID platform code, respectively;

s042, converting the password security platform code obtained in the step S041 into a binary platform numerical value;

s043, sequentially writing the binary platform values into the frame of the password security platform image in the step S041 from left to right and from top to bottom;

s044, sequentially taking out numerical values from the black frame of the password security platform image from left to right and from top to bottom;

s046, obtaining a hidden password platform code by the password platform code in the step S045 by using the MD5 hash algorithm;

s047, generating a registration account according to the client ID platform code obtained in the step S041, associating the registration account with the platform code of the secret password, storing the registration account in a retrieval platform database, and returning the registration account to the retrieval user, wherein the registration process of the retrieval user is completed at this moment.

While embodiments of the invention have been shown and described, it will be understood by those of ordinary skill in the art that: various changes, modifications, substitutions and alterations can be made to the embodiments without departing from the principles and spirit of the invention, the scope of which is defined by the claims and their equivalents.

Claims

1. A spatial operator searching system based on an ElasticSearch technology is characterized by comprising a retrieval user login module, a spatial graph import module, a spatial graph retrieval module and a plot graph display module;

the plot graph display module is used for displaying plot graphs.

2. The system of claim 1, wherein the spatial operator search module comprises:

if the client receives the spatial graph uploading trigger command, executing the next step;

the spatial pattern retrieval module comprises the following steps:

3. The system of claim 2, wherein the step S24 comprises the following steps:

g′＝1、2、3、……、g，g″＝1、2、3、……、g，g′≠g″；

if the H' th coordinate H _h′ Not in the graphic set G = { G = ₁ ,G ₂ ,G ₃ ,…G _g In, then h '= h' +1; executing the next step;

s243, judging the size relation between h' and h:

4. The system of claim 2, wherein in step S25, the area of each graph is calculated by:

wherein, plex _u Representing the area of the pixel point u;

U _s the total number of pixel points of the s-th plot graph is represented;

wherein, plex _u Representing the area of the pixel point u;

L _s a perimeter representing an s-th plot; s =1, 2, 3, \8230;, S' represents the total number of plot patterns intersecting the received spatial pattern;

wherein, plex _u Representing the area of the pixel point u;

U′ _s′ the total number of pixel points of the s' th intersected plot graph is represented;

S′ _s′ representing the area of the s' th intersecting plot; s '=1, 2, 3, \8230- \8230, S' represents the total number of intersecting parcel patterns in parcel patterns intersecting the received spatial pattern;

wherein, plex _u Representing the area of the pixel point u;

5. The system of claim 1, wherein the search user login module comprises the following steps:

6. The system of claim 5, wherein the method for converting the two-code mapping code into the two-code security code in step S14 comprises the following steps:

and S147, extracting the image of the two-dimensional code written with the numerical values 0 and 1, wherein the image is the two-code security image.

7. The system of claim 5, wherein the method for retrieving platform verification in step S15 comprises the following steps:

if the analysis verification code obtained in step S157 is consistent with the verification code obtained in step S156, performing the next step;

8. The system of claim 5, wherein the obtaining of the two-code fusion code in step S12 comprises the following steps:

if A is ₁ -A ₂ ≤A ₀ ，and

Wherein, A ₁ Number of digits, A, of the search code obtained in step S11 ₂ Indicating the number of digits, A, of the authentication code obtained in step S11 ₀ Representing a first threshold of a predetermined number of bits, and representing a logical relationship and,

if A ₁ -A ₂ ≥A ₀ ′，and

Wherein A is ₁ Number of digits, A, of the search code obtained in step S11 ₂ Indicating the number of digits, A, of the authentication code obtained in step S11 ₀ ' represents a second threshold of a preset number of bits, A ₀ ′-A ₀ =1, and denotes a logical relationship and,

if it is

Wherein A is ₁ Number of digits, A, of the search code obtained in step S11 ₂ Representing the number of bits of the captcha obtained in step S11, e representing the element set symbol belongs to, Z ⁺ Representing a positive integer set, and executing step S124;

S122，

wherein B represents a two-code fusion code;

S123，

wherein, B represents a two-code fusion code;

B ₁ a 1 st character indicating that the search password obtained in step S11 is counted from left to right; that is, the first character of the search password obtained in step S11 counted from left to right；

S124，

wherein B represents a two-code fusion code;

a-th code representing the search code obtained in step S11 counted from left to right ₂ A bit character;

a-th code representing the search code obtained in step S11 counted from left to right ₂ +1 bit character;

a-th code representing the search code obtained in step S11 counted from left to right ₂ A +3 bit character;

the A-th code representing the verification code obtained in step S11 counted from left to right ₂ A bit character; that is, the last character of the verification code obtained in step S11 counted from left to right.

9. The system of claim 7, wherein the method for resolving the password and the verification code in step S157 comprises the following steps:

if A ₁ ′-2A ₂ ′≤A ₀ ，and

Wherein A is ₁ ' indicates the number of bits of the two-code platform code obtained in step S155, A ₂ ' indicates the number of digits of the authentication code obtained in step S156, A ₀ Representing a first threshold of a preset number of bits, and represents a logical relationship and,

if A ₁ ′-2A ₂ ′≤A ₀ ′，and

Wherein, A ₁ ' indicates the number of bits of the two-code platform code obtained in step S155, A ₂ ' indicates the number of bits of the authentication code obtained in step S156, A ₀ ' represents a second threshold value of a predetermined number of bits, A ₀ ′-A ₀ =1, and represents a logical relationship and,

if it is

Wherein, A ₁ ' indicates the number of bits of the two-code platform code obtained in step S155, A ₂ ' represents the number of bits of the authentication code obtained in step S156, and e represents that the element set symbol belongs to, Z ⁺ Representing the positive integer set, executing step S1574;

S122，

wherein B' represents a two-code platform code;

b ₂ ' indicates the resolved authentication code obtained in step S157The 2 nd character from left to right;

S123，

wherein B' represents a two-code platform code;

S124，

wherein, B' represents a two-code platform code;

a-th representing the analysis verification code obtained in step S157 counted from left to right ₂ A' bit character; that is, the last character from left to right of the resolved authentication code obtained in step S157.

10. The system according to claim 3, wherein step S141 is to convert the two-code mapping code in step S13 into a two-dimensional code; rotating the obtained two-dimensional code clockwise or anticlockwise by alpha, wherein the alpha = pi/2, pi and 3 pi/2;

or/and step S159, the method for obtaining the secret analysis password by encrypting the analysis password obtained in step S157 comprises:

the Securely parse actual password＝MD5 hash rule method

wherein the secure parse actual password represents a secret analysis password;

representing a resolved password;

B ₂ ' means 2 nd digit character from left to right of the analyzed password;

B ₃ ' means the 3 rd digit character from left to right of the resolved password;

if the search platform password is consistent with the secret analysis password obtained in step S159, the search user successfully logs in the search platform;