CN111008255B - Method and device for identifying illegal places, electronic equipment and storage medium - Google Patents
Method and device for identifying illegal places, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN111008255B CN111008255B CN201910984652.6A CN201910984652A CN111008255B CN 111008255 B CN111008255 B CN 111008255B CN 201910984652 A CN201910984652 A CN 201910984652A CN 111008255 B CN111008255 B CN 111008255B
- Authority
- CN
- China
- Prior art keywords
- cells
- cell
- coordinate points
- query
- dividing
- 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.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/903—Querying
- G06F16/90335—Query processing
- G06F16/90344—Query processing by using string matching techniques
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
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)
- Computational Linguistics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
A method of violation site identification, the method comprising: receiving an input query request aiming at a violation high-speed place; determining a query area according to the geographic position coordinates and the query distance; determining a dividing distance according to a query region by using a multidimensional space point index algorithm, and dividing the planarized earth into a plurality of grids; dividing a grid into a plurality of cells; acquiring a prestored multidimensional space point index character string from a distributed search server, and mapping coordinate points of the multidimensional space point index character string with the same prefix into the same cell; correcting coordinate points in the cells; determining the cells with the number of the coordinate points being greater than a preset number threshold as target cells, wherein the target cells belong to the illegal high-rise places; outputting the geographic identification corresponding to the target cell. The invention also provides a device for identifying the illegal places, electronic equipment and a storage medium. The method can be more effective in judging the illegal high-rise places.
Description
Technical Field
The present invention relates to the field of data processing technologies, and in particular, to a method and apparatus for identifying a violation site, an electronic device, and a storage medium.
Background
With the improvement of the living standard of people, the number of individuals or families having automobiles is increasing. Urban congestion, complex roads, numerous vehicles, unfamiliar drivers with vehicles, limited driving level and the like, which all increase driving difficulty, more and more vehicle owners generate violation events, cause economic loss and threaten lives of people.
In order to minimize the occurrence of the illegal events, the user needs to know which places belong to the illegal places in advance, but usually, for objective reasons, the names of places are not clear enough in many times, the places are more in the same nationwide, and meanwhile, the places are scattered, so that the user can hardly acquire the information of the specific illegal places.
Therefore, how to identify the high-rise place of the violation is a technical problem to be solved.
Disclosure of Invention
In view of the foregoing, it is desirable to provide a method, apparatus, electronic device, and storage medium for identifying places of violation, which can be more effective in determining places of violation high-rise.
A first aspect of the present invention provides a method of identifying a violation site, the method comprising:
receiving an input query request aiming at a violation high-speed place, wherein the query request carries the current geographic position coordinates of a user and a query distance;
Determining a query area according to the geographic position coordinates and the query distance;
determining a dividing distance according to the query region by using a multidimensional space point index algorithm, and dividing the planarized earth into a plurality of grids according to the dividing distance;
dividing the grid into a plurality of cells for each of the grids;
according to the dividing distance, a prestored multidimensional space point index character string is obtained from a distributed search server, and coordinate points of the multidimensional space point index character strings with the same prefix are mapped in the same cell, wherein the multidimensional space point index character strings are character string data used for representing illegal places;
correcting coordinate points in each cell;
determining the cells with the number of coordinate points larger than a preset number threshold value from the processed cells as target cells, wherein the target cells belong to illegal high-rise places;
outputting a geographic identifier corresponding to the target cell, wherein the geographic identifier is the geographic identifier of the illegal high-speed place.
In a possible implementation manner, the query request further carries a query time, and the method further includes:
Determining a time range corresponding to the inquiry time;
the obtaining the prestored multidimensional space point index character string from the distributed search server comprises the following steps:
acquiring a multidimensional space point index character string in the time range from a distributed search server;
the mapping coordinate points of the multidimensional space point index strings having the same prefix within the same cell includes:
and mapping coordinate points of the multidimensional space point index strings with the same prefix in the time range into the same cell.
In one possible implementation manner, the correcting the coordinate point in the cell for each cell includes:
for a first coordinate point of each cell, determining a centroid range of the first coordinate point according to a preset length;
judging whether a second coordinate point is in the centroid range, wherein the second coordinate point is positioned on the boundary between the cell and the adjacent cell;
and if the second coordinate point is in the centroid range, determining that the second coordinate point belongs to the cell.
In one possible implementation manner, the correcting the coordinate point in the cell for each cell includes:
Judging whether the coordinate points of the cells belong to the query area or not according to the coordinate points of each cell;
and if the coordinate points of the cells do not belong to the query area, deleting the coordinate points which do not belong to the query area.
In one possible implementation manner, after determining, as the target cell, the cells whose number of coordinate points is greater than the preset number threshold from the plurality of processed cells, the method further includes:
counting a first number of the target cells;
judging whether the dividing distance of a plurality of cells meets the requirement or not according to the first quantity;
if the dividing distance of the cells does not meet the requirement, dividing the grid into a plurality of cells again;
determining a first cell belonging to the illegal high-rise place from the repartitioned multiple cells according to the mapped coordinate points;
the outputting the geographic identification corresponding to the target cell comprises:
and outputting the geographic identification corresponding to the first cell.
In one possible implementation manner, after determining, as the target cell, the cells whose number of coordinate points is greater than the preset number threshold from the plurality of processed cells, the method further includes:
Calculating the geographic distance between any two adjacent target cells;
judging whether the dividing distances of a plurality of grids meet the requirement according to the query distance, the geographic distance and the number of target cells;
if the dividing distance of a plurality of grids does not meet the requirement, dividing the grids into a plurality of unit grids again;
determining a second cell belonging to the illegal high-rise place from the repartitioned multiple cells according to the mapped coordinate points;
the outputting the geographic identification corresponding to the target cell comprises:
and outputting the geographic identification corresponding to the second cell.
In one possible implementation, the method further includes:
obtaining violation places of all areas;
the violation places are coded through map data and converted into violation longitude and latitude data;
converting the violation longitude and latitude data into a multidimensional space point index character string by using a multidimensional space point index algorithm;
and storing the multidimensional space point index character string into a distributed search server.
A second aspect of the present invention provides an apparatus for identifying a place of violation, the apparatus comprising:
the receiving module is used for receiving an input query request aiming at the illegal high-speed place, wherein the query request carries the current geographic position coordinates of the user and the query distance;
The determining module is used for determining a query area according to the geographic position coordinates and the query distance;
the determining module is further used for determining a dividing distance according to the query region by using a multidimensional space point index algorithm;
the dividing module is used for dividing the planarized earth into a plurality of grids according to the dividing distance;
the dividing module is further configured to divide the grid into a plurality of cells for each grid;
the acquisition module is used for acquiring a prestored multidimensional space point index character string from the distributed search server according to the dividing distance;
the mapping module is used for mapping coordinate points of multi-dimensional space point index character strings with the same prefix into the same cell, wherein the multi-dimensional space point index character strings are character string data used for representing illegal places;
the correction module is used for correcting coordinate points in each cell;
the determining module is further configured to determine, from the processed multiple cells, cells with the number of coordinate points greater than a preset number threshold as target cells, where the target cells belong to a violation high-occurrence place;
And the output module is used for outputting the geographic identifier corresponding to the target cell, wherein the geographic identifier is the geographic identifier of the illegal high-rise place.
A third aspect of the invention provides an electronic device comprising a processor and a memory, the processor being arranged to implement the method of identifying a violation location when executing a computer program stored in the memory.
A fourth aspect of the present invention provides a computer readable storage medium having stored thereon a computer program which when executed by a processor implements the violation location identifying method.
According to the technical scheme, after receiving an input query request for a violation high-speed place, a query area can be determined according to the geographic position coordinates and the query distance, a multi-dimensional space point index algorithm is used, a dividing distance is determined according to the query area, a planarized earth is divided into a plurality of grids according to the dividing distance, the grids are divided into a plurality of cells according to each grid, a prestored multi-dimensional space point index character string is acquired from a distributed search server according to the dividing distance, coordinate points of the multi-dimensional space point index character string with the same prefix are mapped in the same cell, wherein the multi-dimensional space point index character string is character string data for representing the violation place, correction processing is further carried out on the coordinate points in the cell according to each cell, and a cell with the number of the coordinate points larger than a preset number threshold is determined as a target cell from the processed cells, and the target high-speed place belongs to the violation place; and finally outputting the geographic identification corresponding to the target cell, wherein the geographic identification is the geographic identification of the illegal high-speed place. Therefore, in the invention, the data of the illegal places can be converted into the multi-dimensional space point index character strings based on the multi-dimensional space point index algorithm, the coordinate points are mapped in the cells divided based on the query area, further, correction processing is carried out on the mapped coordinate points, so that the attribution of the coordinate points is more accurate, meanwhile, the follow-up statistics on the number of the coordinate points in the cells is more accurate, the names of the illegal places are subjected to character string formation through longitude and latitude, so that the illegal places can be identified and counted, meanwhile, the database index is fully utilized, and the identification efficiency of the illegal places is improved.
Drawings
FIG. 1 is a flow chart of a preferred embodiment of a method of identifying a offending location as disclosed herein.
FIG. 2 is a functional block diagram of a preferred embodiment of a violation site identifying device of the present disclosure.
FIG. 3 is a schematic diagram of an electronic device implementing a preferred embodiment of the method for identifying a offending location according to the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. The terminology used herein in the description of the invention is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention.
The electronic device is an electronic device capable of automatically performing numerical calculation and/or information processing according to a preset or stored instruction, and the hardware of the electronic device comprises, but is not limited to, a microprocessor, an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA), a digital processor (DSP), an embedded device and the like. The electronic device may also include a network device and/or a user device. Wherein the network device includes, but is not limited to, a single network server, a server group of multiple network servers, or a cloud based on cloud computing (CloudComputing) composed of a large number of hosts or network servers. The user equipment includes, but is not limited to, any electronic product that can perform man-machine interaction with a user through a keyboard, a mouse, a remote controller, a touch pad, a voice control device or the like, for example, a personal computer, a tablet computer, a smart phone, a personal digital assistant PDA and the like.
FIG. 1 is a flow chart of a preferred embodiment of a method of identifying a offending location as disclosed herein. The sequence of steps in the flowchart may be changed and some steps may be omitted according to different needs.
S11, the electronic equipment receives an input query request aiming at the illegal high-speed place, wherein the query request carries the current geographic position coordinates of the user and the query distance.
When the user needs to inquire the illegal high-speed places nearby the surroundings, the user can input the current geographical position coordinates of the user and the inquiry distance, wherein the current geographical position of the user can be positioned through the GPS (Global Positioning System ) of the user terminal so as to acquire the geographical position coordinates, and the inquiry distance is 2 kilometers. The user terminal may include, but is not limited to, a smart phone, a smart watch, an IPAD, etc.
And S12, the electronic equipment determines a query area according to the geographic position coordinates and the query distance.
The circular area with the geographic position coordinate as the center and the query distance as the radius can be determined as the query area.
S13, the electronic equipment uses a multidimensional space point index algorithm, determines a dividing distance according to the query area, and divides the planarized earth into a plurality of grids according to the dividing distance.
The basic principle of the multidimensional space point index algorithm GeoHash is that the earth is understood as a two-dimensional plane, the plane is recursively decomposed into smaller sub-blocks, and each sub-block has the same code in a certain longitude and latitude range. The space index is established in a GeoHash mode, so that the efficiency of carrying out longitude and latitude retrieval on space data can be improved.
The following table is a corresponding relation table of the GeoHash precision level and the dividing distance.
| geohash precision grade | Dividing distance |
| 1 | About 5,004km x 5,004km |
| 2 | About 1,251km x |
| 3 | About 156km x 156km |
| 4 | About 39km x 19.5km |
| 5 | About 4.9km x4.9km |
| 6 | About 1.2km x 0.61km |
| 7 | About 152.8m x 152.8m |
| 8 | About 38.2m x 19.1m |
| 9 | About 4.78m x 4.78m |
| 10 | About 1.19m x 0.60m |
| 11 | About 14.9cm by 14.9cm |
| 12 | About 3.7cm x 1.8cm |
From the above table, it can be seen that the higher the GeoHash accuracy level, the smaller the dividing distance and the smaller the area of the corresponding grid.
In the embodiment of the invention, the size of the grid to be divided needs to be determined according to the query area, for example, the query area is in a range of 2km nearby, then according to the table, the division distance can be determined to be about 4.9km×4.9km, and the corresponding geohash precision level is 5, wherein the query area needs to be covered by the area of each divided grid, and the division distance (for example, 4.9 km) is slightly larger than the distance (for example, 2 km) of the query area.
S14, the electronic equipment divides the grids into a plurality of unit grids for each grid.
After the grids are divided, each grid needs to be further divided by using a relatively larger geohash precision level, for example: the division precision of the grids is 5, the division precision of the unit grids is larger than 5, the geohash precision grade 6 can be selected, and the corresponding division distance is 1.2km x 0.61km.
S15, the electronic equipment acquires a prestored multidimensional space point index character string from the distributed search server according to the dividing distance, and maps coordinate points of the multidimensional space point index character string with the same prefix in the same cell, wherein the multidimensional space point index character string is character string data for representing the illegal places.
The distributed search server, namely the elastic search server, can utilize the characteristics of distributed computation and original support of geographic coordinates of the elastic search, store relevant violation data, such as multidimensional space point index character strings, in the distributed search server, and query violation places through the distributed search server, so that the query is more flexible, full-text search can be supported, and meanwhile, the method is easy to expand.
The multidimensional space point index string is converted from longitude and latitude data of the violation site, for example, if the longitude of a certain violation site is 114.060938 and the latitude is 22.533027, the multidimensional space point index string ws105w08kkxt is converted.
The pre-stored multi-dimensional space point index character strings can be obtained from the distributed search server according to the dividing distance, for example, if the dividing distance is 4.9km x 4.9km, the multi-dimensional space point index character strings with the range of 4.9km x 4.9km are obtained from the distributed search server, that is, the area range of the obtained multi-dimensional space point index character strings is larger than the range of the query area.
The coordinate points of the multidimensional space point index character strings with the same prefix are mapped in the same cell according to the prefix of the multidimensional space point index character strings after the prestored multidimensional space point index character strings are acquired, so that the coordinate points of the multidimensional space point index character strings in the same cell are coordinate points belonging to the vicinity and have a relatively close geographic position.
As an alternative embodiment, the method further comprises:
obtaining violation places of all areas;
the violation places are coded through map data and converted into violation longitude and latitude data;
converting the violation longitude and latitude data into a multidimensional space point index character string by using a multidimensional space point index algorithm;
and storing the multidimensional space point index character string into a distributed search server.
Wherein the violation sites of all areas can be obtained by third party suppliers or official collection authorities.
Optionally, because the violation site has regional characteristics, the collection mechanism of each place is different, basically each city has its own collection mechanism, and the data formats and fields of the collection mechanisms are different. Such as: the Shenzhen acquisition organization records the information of the illegal places of a certain license plate from a certain area, then the information of the places, but the certain area is not unique in the city of China, so that the information of the illegal places generated in the city can be recorded in other cities. Therefore, after obtaining the violation sites of all areas, the violation sites further need to be confirmed, optionally, the city can be extracted from the violation collection organization to confirm the violation sites, or the first letter behind the province is utilized to confirm the city of the vehicle owner, so that the violation sites can be reduced, or the user can interact with the user, and the user manually inputs the real name of the violation sites, thereby obtaining longitude and latitude data.
The illegal places, namely the geographic names, may have the same geographic names in different provinces and cities, the geographic names are a string of Chinese characters, the segmentation is difficult, and the random segmentation can lead to the same illegal places to be far apart. The geographic names are converted into longitudes and latitudes through the map data, so that the situation that the place names are randomly segmented is avoided, the more detailed the address is, the more accurate the longitudes and latitudes of the map are, and meanwhile, the situation that the place names of different provinces and cities are repeated and places of violations are enlarged due to the fact that the data are gathered by the place names are simply relied on is avoided.
The multidimensional space point index algorithm GeoHash converts two-dimensional longitude and latitude data into character strings (namely multidimensional space point index character strings), so that the data can be conveniently indexed, and the query speed is improved. In Geohash coding, similar character strings represent similar distances, for example, places corresponding to the character strings of the multidimensional space point indexes with the same prefix are similar, so that prefix matching of the character strings can be utilized to query nearby place information.
The distributed search server can also store information such as violation places, violation longitudes and latitudes, violation times, violation behaviors, deductions, longitudes and latitudes, multidimensional space point index character strings, creation time and the like of the user. And the relevant data of the violation is stored in the distributed search server, so that the follow-up efficient and quick inquiry of the relevant information of the violation is facilitated.
As an optional implementation manner, the query request further carries a query time, and the method further includes:
determining a time range corresponding to the inquiry time;
the obtaining the prestored multidimensional space point index character string from the distributed search server comprises the following steps:
acquiring a multidimensional space point index character string in the time range from a distributed search server;
the mapping coordinate points of the multidimensional space point index strings having the same prefix within the same cell includes:
and mapping coordinate points of the multidimensional space point index strings with the same prefix in the time range into the same cell.
In this alternative embodiment, the user wishes to query valid violation data in the last period of time, and as the hardware facility changes continuously, the violation data may change, such as road repairment, street lamp configuration, etc., which may result in the restriction of the original high place of violation not belonging. When a user inputs a query time, a time range, such as the last month, the last half year, etc., based on the query time may be determined according to the query time, and the multidimensional space point index string is screened from the distributed search server according to the time range.
S16, the electronic equipment corrects coordinate points in each cell.
When coordinate points of the index strings of multidimensional space points with the same prefix are mapped in the same cell, various situations may occur, for example, a certain coordinate point is mapped at the boundary of two cells, for example, some coordinate points do not belong to the range of the query area, and these situations may affect the subsequent judgment of the illegal high-occurrence place, so for these situations, correction processing needs to be performed on the coordinate points in the cells.
Specifically, the correcting the coordinate point in each cell includes:
for a first coordinate point of each cell, determining a centroid range of the first coordinate point according to a preset length;
judging whether a second coordinate point is in the centroid range, wherein the second coordinate point is positioned on the boundary between the cell and the adjacent cell;
and if the second coordinate point is in the centroid range, determining that the second coordinate point belongs to the cell.
In this alternative embodiment, a certain coordinate point may be mapped at the boundary of two cells, in which case it is difficult to specify which cell the coordinate point belongs to, which has an effect on the number of coordinate points of the subsequent statistical cell.
Specifically, a preset length (not exceeding the length of the cell) may be designated based on any coordinate point (such as the first coordinate point), a centroid range of the first coordinate point (i.e., a region range of a circle with the preset length as a radius with the first coordinate point as a center) may be determined, whether a second coordinate point located on a boundary between the cell and an adjacent cell is within the centroid range may be determined, if the second coordinate point is within the centroid range, it indicates that the second coordinate point falls on the boundary between the cell or may be merged into the cell range, it may be determined that the second coordinate point belongs to the cell, and then, when the number of coordinate points of the cell is counted, the second coordinate point may be counted in the cell, but the second coordinate point may not be counted in the adjacent cell.
Specifically, the correcting the coordinate point in each cell includes:
judging whether the coordinate points of the cells belong to the query area or not according to the coordinate points of each cell;
and if the coordinate points of the cells do not belong to the query area, deleting the coordinate points which do not belong to the query area.
In this alternative embodiment, when the grid division is performed, the area of the grid is to cover the query area, that is, the area of the grid is to be larger than the area of the query area, and when the data is acquired according to the divided grid, the obtained data is more than the data of the actual query area, so after mapping, a situation that the coordinate point exceeds the query area may occur, and the coordinate point exceeding the query area belongs to an invalid coordinate point, and deletion processing is required.
Wherein if a certain cell is located outside the query area, all coordinate points of the cell do not belong to the query area, and if a certain cell has a partial area located inside the query area and a partial area located outside the query area, coordinate points located inside the query area belong to the query area, and coordinate points located outside the query area do not belong to the query area. Specifically, the coordinate points of each cell may be used as a judgment object, and the coordinate points not belonging to the query region may be deleted.
And S17, the electronic equipment determines the cells with the number of the coordinate points larger than a preset number threshold value from the processed cells as target cells, wherein the target cells belong to the illegal high-rise places.
Wherein, a preset quantity threshold value can be preset, and the preset quantity threshold value is a critical value of the illegal high-rise place.
After the coordinate points of each cell are processed, the number of the coordinate points in each cell can be counted, if the number of the coordinate points of a certain cell is greater than a preset number threshold value, the position corresponding to the cell is indicated to belong to a violation high-occurrence place, each target cell can be regarded as a violation high-occurrence place, and the cell can be determined as a target cell.
S18, the electronic equipment outputs a geographic identifier corresponding to the target cell, wherein the geographic identifier is the geographic identifier of the illegal high-speed place.
Wherein the geographic identification is such as geographic name, geographic longitude and latitude.
As an alternative embodiment, after step S17, the method further includes:
counting a first number of the target cells;
judging whether the dividing distance of a plurality of cells meets the requirement or not according to the first quantity;
if the dividing distance of the cells does not meet the requirement, dividing the grid into a plurality of cells again;
determining a first cell belonging to the illegal high-rise place from the repartitioned multiple cells according to the mapped coordinate points;
The outputting the geographic identification corresponding to the target cell comprises:
and outputting the geographic identification corresponding to the first cell.
In this alternative embodiment, a first number of target cells may be initially counted, each representing a high-rise site, and if the first number of target cells exceeds a normal value by too much, it is indicated that the previously divided grid is too small, so that the high-rise site is too many, and the grid needs to be re-divided. For example, the first number of target cells is 150, while the normal value is 50, and the first number is too far beyond the normal value, which is undesirable and requires repartitioning of the grid.
Specifically, whether the first number is greater than a preset normal number threshold may be determined according to the first number, if the first number is greater than the preset normal number threshold, it is determined that the dividing distances of the plurality of cells do not meet the requirement, the grid may be divided into a plurality of cells again by using a larger dividing distance, then, mapping of coordinate points may be performed according to the similar method, and the number of coordinate points in the cells is counted to determine the first cell belonging to the illegal high-speed location.
As an alternative embodiment, after step S17, the method further includes:
calculating the geographic distance between any two adjacent target cells;
judging whether the dividing distances of a plurality of grids meet the requirement according to the query distance, the geographic distance and the number of target cells;
if the dividing distance of a plurality of grids does not meet the requirement, dividing the grids into a plurality of unit grids again;
determining a second cell belonging to the illegal high-rise place from the repartitioned multiple cells according to the mapped coordinate points;
the outputting the geographic identification corresponding to the target cell comprises:
and outputting the geographic identification corresponding to the second cell.
In this alternative embodiment, it is necessary to calculate the geographical distance between any two adjacent target cells, and if the distance between any two adjacent target cells is too close, and the number of target cells that are too close is relatively large, this indicates that the previously divided grids are too dense, so that the high-rise sites are gathered closer. Such as: the range to be queried is 2 km, 50 high-rise points are obtained, the distance between two adjacent high-rise points is less than 1 km and is half of the total high-rise points, namely 25 points and more, which is undesirable and the grid is required to be divided again.
Specifically, after calculating the geographic distance between any two adjacent target cells, half of the query distance may be used as a screening distance, and the target number of the geographic distance greater than the screening distance is counted, if the ratio of the target number to the number of the target cells is greater than a certain ratio threshold (for example, 1/2), it is indicated that the divided grids are too dense, and it may be determined that the division distances of a plurality of grids do not meet the requirement and need to be divided again.
The grid can be divided into a plurality of cells again by adopting a larger dividing distance, then, the mapping of the coordinate points can be carried out according to the similar method, and the number of the coordinate points in the cells is counted to determine the second cell belonging to the illegal high-rise place.
In the method flow described in fig. 1, after receiving an input query request for a violation high-issue place, a query area may be determined according to the geographic position coordinates and the query distance, a multi-dimensional space point index algorithm is used, a division distance is determined according to the query area, a planarized earth is divided into a plurality of grids according to the division distance, the grids are divided into a plurality of cells for each grid, a prestored multi-dimensional space point index character string is acquired from a distributed search server according to the division distance, coordinate points of the multi-dimensional space point index character string with the same prefix are mapped in the same cell, wherein the multi-dimensional space point index character string is character string data for representing the violation place, correction processing is further performed on the coordinate points in the cells for each cell, and a cell with the number of the coordinate points being greater than a preset number threshold is determined as a target cell from the processed cells, and the target high-issue place belongs to the violation place; and finally outputting the geographic identification corresponding to the target cell, wherein the geographic identification is the geographic identification of the illegal high-speed place. Therefore, the data of the illegal places can be converted into the multi-dimensional space point index character strings based on the multi-dimensional space point index algorithm, the coordinate points are mapped in the cells divided based on the query area, further, correction processing is carried out on the mapped coordinate points, so that attribution of the coordinate points is more accurate, meanwhile, follow-up statistics on the number of the coordinate points in the cells is more accurate, the illegal places are subjected to character serialization through longitude and latitude, the illegal places can be identified and counted, meanwhile, the database index is fully utilized, and the identification effectiveness of the illegal places is improved.
While the invention has been described with reference to specific embodiments, it will be understood by those skilled in the art that various changes in form and detail may be made therein without departing from the spirit and scope of the invention.
FIG. 2 is a functional block diagram of a preferred embodiment of a violation site identifying device of the present disclosure.
In some embodiments, the violation location identifying means is run in an electronic device. The violation site identifying means may comprise a plurality of functional modules consisting of program code segments. Program code of each program segment in the violation location identifying device may be stored in a memory and executed by at least one processor to perform part or all of the steps in the violation location identifying method described in fig. 1, and specifically, reference may be made to the related description in the method described in fig. 1, which is not repeated herein.
In this embodiment, the offence identification device may be divided into a plurality of functional modules according to the functions performed by the offence identification device. The functional module may include: the device comprises a receiving module 201, a determining module 202, a dividing module 203, an obtaining module 204, a mapping module 205, a correcting module 206 and an output module 207. The module referred to in the present invention refers to a series of computer program segments capable of being executed by at least one processor and of performing a fixed function, stored in a memory.
The receiving module 201 is configured to receive an input query request for a violation high-speed location, where the query request carries a current geographic location coordinate and a query distance of a user;
a determining module 202, configured to determine a query area according to the geographic location coordinates and the query distance;
the determining module 202 is further configured to determine a division distance according to the query region using a multidimensional space point index algorithm;
a dividing module 203 for dividing the planarized earth into a plurality of grids according to the dividing distance;
the dividing module 203 is further configured to divide, for each of the grids, the grid into a plurality of cells;
an obtaining module 204, configured to obtain a prestored multidimensional space point index string from a distributed search server according to the division distance;
a mapping module 205, configured to map coordinate points of multidimensional space point index strings having the same prefix into the same cell, where the multidimensional space point index strings are string data for representing a violation location;
a correction module 206, configured to perform correction processing on coordinate points in the cells for each of the cells;
The determining module 202 is further configured to determine, from the processed multiple cells, cells with the number of coordinate points greater than a preset number threshold as target cells, where the target cells belong to a violation high-occurrence place;
and the output module 207 is configured to output a geographic identifier corresponding to the target cell, where the geographic identifier is a geographic identifier of a violation high-speed location.
As an optional implementation manner, the query request further carries a query time, and the determining module 202 is further configured to determine a time range corresponding to the query time;
the method for the obtaining module 204 to obtain the prestored multidimensional space point index string from the distributed search server specifically includes:
acquiring a multidimensional space point index character string in the time range from a distributed search server;
the mapping module 205 maps coordinate points of the multidimensional space point index strings having the same prefix in the same cell specifically as follows:
and mapping coordinate points of the multidimensional space point index strings with the same prefix in the time range into the same cell.
As an optional implementation manner, the correction module 206 specifically performs correction processing on the coordinate points in the cells for each cell:
For a first coordinate point of each cell, determining a centroid range of the first coordinate point according to a preset length;
judging whether a second coordinate point is in the centroid range, wherein the second coordinate point is positioned on the boundary between the cell and the adjacent cell;
and if the second coordinate point is in the centroid range, determining that the second coordinate point belongs to the cell.
As an optional implementation manner, the correction module 206 specifically performs correction processing on the coordinate points in the cells for each cell:
judging whether the coordinate points of the cells belong to the query area or not according to the coordinate points of each cell;
and if the coordinate points of the cells do not belong to the query area, deleting the coordinate points which do not belong to the query area.
As an alternative embodiment, the violation site identifying device may further include:
a statistics module, configured to, after the determining module 202 determines, from the processed plurality of cells, cells whose number of coordinate points is greater than a preset number threshold as target cells, count a first number of the target cells;
The first judging module is used for judging whether the dividing distances of the plurality of cells meet the requirement according to the first quantity;
the dividing module 203 is further configured to re-divide the grid into a plurality of cells if the dividing distances of the plurality of cells do not meet the requirement;
the determining module 202 is further configured to determine, from the repartitioned multiple cells, a first cell belonging to the violation high-occurrence place according to the mapped coordinate point;
the outputting module 207 outputs the geographic identifier corresponding to the target cell specifically includes:
and outputting the geographic identification corresponding to the first cell.
As an alternative embodiment, the violation site identifying device may further include:
a calculating module, configured to calculate a geographic distance between any two adjacent target cells after the determining module 202 determines, from the processed plurality of cells, cells whose number of coordinate points is greater than a preset number threshold as target cells;
the second judging module is used for judging whether the dividing distances of the grids meet the requirements according to the query distance, the geographic distance and the number of the target cells;
The dividing module 203 is further configured to re-divide the grid into a plurality of cells if the dividing distances of the plurality of grids do not meet the requirement;
the determining module 202 is further configured to determine, from the repartitioned multiple cells, a second cell belonging to the violation high-occurrence place according to the mapped coordinate point;
the outputting module 207 outputs the geographic identifier corresponding to the target cell specifically includes:
and outputting the geographic identification corresponding to the second cell.
As an optional implementation manner, the obtaining module 204 is further configured to obtain violation sites of all areas;
the violation site identifying device may further include:
the conversion module is used for converting the violation places into violation longitude and latitude data through map data coding;
the conversion module is further used for converting the violation longitude and latitude data into a multidimensional space point index character string by using a multidimensional space point index algorithm;
and the storage module is used for storing the multidimensional space point index character string into a distributed search server.
In the violation location identifying device described in fig. 2, after receiving an input query request for a violation high-speed location, a query area may be determined according to the geographic position coordinates and the query distance, a multi-dimensional space point index algorithm may be used, a dividing distance may be determined according to the query area, a planarized earth may be divided into a plurality of grids according to the dividing distance, the grids may be divided into a plurality of cells for each grid, a pre-stored multi-dimensional space point index string may be obtained from a distributed search server according to the dividing distance, and coordinate points of the multi-dimensional space point index string having the same prefix may be mapped in the same cell, wherein the multi-dimensional space point index string is character string data for representing the violation location, further, correction processing may be performed on the coordinate points in the cells for each cell, and a number of coordinate points greater than a preset number of threshold may be determined as a target cell from the plurality of processed cells, the target cell belongs to the violation high-speed location; and finally outputting the geographic identification corresponding to the target cell, wherein the geographic identification is the geographic identification of the illegal high-speed place. Therefore, the data of the illegal places can be converted into the multi-dimensional space point index character strings based on the multi-dimensional space point index algorithm, the coordinate points are mapped in the cells divided based on the query area, further, correction processing is carried out on the mapped coordinate points, so that attribution of the coordinate points is more accurate, meanwhile, follow-up statistics on the number of the coordinate points in the cells is more accurate, the illegal places are subjected to character serialization through longitude and latitude, the illegal places can be identified and counted, meanwhile, the database index is fully utilized, and the identification effectiveness of the illegal places is improved.
FIG. 3 is a schematic diagram of an electronic device implementing a preferred embodiment of the method for identifying a offending location according to the present invention. The electronic device 3 comprises a memory 31, at least one processor 32, a computer program 33 stored in the memory 31 and executable on the at least one processor 32, and at least one communication bus 34.
It will be appreciated by those skilled in the art that the schematic diagram shown in fig. 3 is merely an example of the electronic device 3 and is not limiting of the electronic device 3, and may include more or less components than illustrated, or may combine certain components, or different components, e.g. the electronic device 3 may further include input-output devices, network access devices, etc.
The at least one processor 32 may be a central processing unit (Central Processing Unit, CPU), but may also be other general purpose processors, digital signal processors (Digital Signal Processor, DSP), application specific integrated circuits (Application Specific Integrated Circuit, ASIC), field-programmable gate arrays (Field-Programmable Gate Array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or the like. The processor 32 may be a microprocessor or the processor 32 may be any conventional processor or the like, the processor 32 being a control center of the electronic device 3, the various interfaces and lines being used to connect the various parts of the entire electronic device 3.
The memory 31 may be used to store the computer program 33 and/or modules/units, and the processor 32 may implement various functions of the electronic device 3 by running or executing the computer program and/or modules/units stored in the memory 31 and invoking data stored in the memory 31. The memory 31 may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program (such as a sound playing function, an image playing function, etc.) required for at least one function, and the like; the storage data area may store data created according to the use of the electronic device 3 (such as audio data) and the like. In addition, the memory 31 may include a nonvolatile memory such as a hard disk, a memory, a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash Card (Flash Card), at least one magnetic disk storage device, a Flash memory device, or other nonvolatile solid state storage device.
In connection with fig. 1, the memory 31 in the electronic device 3 stores a plurality of instructions to implement a method of identifying a violation site, the processor 32 being executable to implement:
Receiving an input query request aiming at a violation high-speed place, wherein the query request carries the current geographic position coordinates of a user and a query distance;
determining a query area according to the geographic position coordinates and the query distance;
determining a dividing distance according to the query region by using a multidimensional space point index algorithm, and dividing the planarized earth into a plurality of grids according to the dividing distance;
dividing the grid into a plurality of cells for each of the grids;
according to the dividing distance, a prestored multidimensional space point index character string is obtained from a distributed search server, and coordinate points of the multidimensional space point index character strings with the same prefix are mapped in the same cell, wherein the multidimensional space point index character strings are character string data used for representing illegal places;
correcting coordinate points in each cell;
determining the cells with the number of coordinate points larger than a preset number threshold value from the processed cells as target cells, wherein the target cells belong to illegal high-rise places;
Outputting a geographic identifier corresponding to the target cell, wherein the geographic identifier is the geographic identifier of the illegal high-speed place.
Specifically, the specific implementation method of the above instructions by the processor 32 may refer to the description of the relevant steps in the corresponding embodiment of fig. 1, which is not repeated herein.
In the electronic device 3 depicted in fig. 3, after receiving an input query request for a high-issue place against rules and regulations, a query area may be determined according to the geographic position coordinates and the query distance, and a multidimensional space point index algorithm is used, according to the query area, a division distance is determined, and according to the division distance, the planarized earth is divided into a plurality of grids, for each grid, the grid is divided into a plurality of cells, according to the division distance, a prestored multidimensional space point index string is obtained from a distributed search server, and coordinate points of multidimensional space point index strings with the same prefix are mapped in the same cell, wherein the multidimensional space point index string is character string data for representing the place against rules and regulations, further, correction processing is performed on the coordinate points in the cell, and from the processed cells, the number of coordinate points is greater than a preset number threshold, and the target cell is determined as the target cell, and the target place against rules and regulations are located in the same cell; and finally outputting the geographic identification corresponding to the target cell, wherein the geographic identification is the geographic identification of the illegal high-speed place. Therefore, the data of the illegal places can be converted into the multi-dimensional space point index character strings based on the multi-dimensional space point index algorithm, the coordinate points are mapped in the cells divided based on the query area, further, correction processing is carried out on the mapped coordinate points, so that attribution of the coordinate points is more accurate, meanwhile, follow-up statistics on the number of the coordinate points in the cells is more accurate, the illegal places are subjected to character serialization through longitude and latitude, the illegal places can be identified and counted, meanwhile, the database index is fully utilized, and the identification effectiveness of the illegal places is improved.
The modules/units integrated in the electronic device 3 may be stored in a computer readable storage medium if implemented in the form of software functional units and sold or used as separate products. Based on such understanding, the present invention may implement all or part of the flow of the method of the above embodiment, or may be implemented by a computer program to instruct related hardware, where the computer program may be stored in a computer readable storage medium, and when the computer program is executed by a processor, the computer program may implement the steps of each of the method embodiments described above. Wherein the computer program comprises computer program code which may be in source code form, object code form, executable file or some intermediate form etc. The computer readable medium may include: any entity or device capable of carrying the computer program code, a recording medium, a U disk, a removable hard disk, a magnetic disk, an optical disk, a computer Memory, a Read-Only Memory (ROM).
In the several embodiments provided in the present invention, it should be understood that the disclosed systems, devices, and methods may be implemented in other manners. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the modules is merely a logical function division, and there may be other manners of division when actually implemented.
The modules described as separate components may or may not be physically separate, and components shown as modules may or may not be physical units, may be located in one place, or may be distributed over multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional module in the embodiments of the present invention may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units can be realized in a form of hardware or a form of hardware and a form of software functional modules.
It will be evident to those skilled in the art that the invention is not limited to the details of the foregoing illustrative embodiments, and that the present invention may be embodied in other specific forms without departing from the spirit or essential characteristics thereof. The present embodiments are, therefore, to be considered in all respects as illustrative and not restrictive, the scope of the invention being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein. Any reference signs in the claims shall not be construed as limiting the claim concerned. Furthermore, it is evident that the word "comprising" does not exclude other elements or steps, and that the singular does not exclude a plurality. A plurality of units or means recited in the system claims can also be implemented by means of software or hardware by means of one unit or means. The terms second, etc. are used to denote a name, but not any particular order.
Finally, it should be noted that the above-mentioned embodiments are merely for illustrating the technical solution of the present invention and not for limiting the same, and although the present invention has been described in detail with reference to the preferred embodiments, it should be understood by those skilled in the art that modifications and equivalents may be made to the technical solution of the present invention without departing from the spirit and scope of the technical solution of the present invention.
Claims (10)
1. A method of identifying a violation site, the method comprising:
receiving an input query request aiming at a violation high-speed place, wherein the query request carries the current geographic position coordinates of a user and a query distance;
determining a query area according to the geographic position coordinates and the query distance;
determining a dividing distance according to the query region by using a multidimensional space point index algorithm, and dividing the planarized earth into a plurality of grids according to the dividing distance;
dividing the grid into a plurality of cells for each of the grids;
according to the dividing distance, a prestored multidimensional space point index character string is obtained from a distributed search server, and coordinate points of the multidimensional space point index character strings with the same prefix are mapped in the same cell, wherein the multidimensional space point index character strings are character string data used for representing illegal places;
Correcting coordinate points in each cell;
determining the cells with the number of coordinate points larger than a preset number threshold value from the processed cells as target cells, wherein the target cells belong to illegal high-rise places;
outputting a geographic identifier corresponding to the target cell, wherein the geographic identifier is the geographic identifier of the illegal high-speed place.
2. The method of claim 1, wherein the query request further carries a query time, the method further comprising:
determining a time range corresponding to the inquiry time;
the obtaining the prestored multidimensional space point index character string from the distributed search server comprises the following steps:
acquiring a multidimensional space point index character string in the time range from a distributed search server;
the mapping coordinate points of the multidimensional space point index strings having the same prefix within the same cell includes:
and mapping coordinate points of the multidimensional space point index strings with the same prefix in the time range into the same cell.
3. The method of claim 1, wherein the correcting the coordinate points within the cells for each of the cells comprises:
For a first coordinate point of each cell, determining a centroid range of the first coordinate point according to a preset length;
judging whether a second coordinate point is in the centroid range, wherein the second coordinate point is positioned on the boundary between the cell and the adjacent cell;
and if the second coordinate point is in the centroid range, determining that the second coordinate point belongs to the cell.
4. The method of claim 1, wherein the correcting the coordinate points within the cells for each of the cells comprises:
judging whether the coordinate points of the cells belong to the query area or not according to the coordinate points of each cell;
and if the coordinate points of the cells do not belong to the query area, deleting the coordinate points which do not belong to the query area.
5. The method according to any one of claims 1 to 4, wherein after determining, as the target cell, a cell whose number of coordinate points is greater than a preset number threshold value from the plurality of cells after processing, the method further comprises:
counting a first number of the target cells;
judging whether the dividing distance of a plurality of cells meets the requirement or not according to the first quantity;
If the dividing distance of the cells does not meet the requirement, dividing the grid into a plurality of cells again;
determining a first cell belonging to the illegal high-rise place from the repartitioned multiple cells according to the mapped coordinate points;
the outputting the geographic identification corresponding to the target cell comprises:
and outputting the geographic identification corresponding to the first cell.
6. The method according to any one of claims 1 to 4, wherein after determining, as the target cell, a cell whose number of coordinate points is greater than a preset number threshold value from the plurality of cells after processing, the method further comprises:
calculating the geographic distance between any two adjacent target cells;
judging whether the dividing distances of a plurality of grids meet the requirement according to the query distance, the geographic distance and the number of target cells;
if the dividing distance of a plurality of grids does not meet the requirement, dividing the grids into a plurality of unit grids again;
determining a second cell belonging to the illegal high-rise place from the repartitioned multiple cells according to the mapped coordinate points;
the outputting the geographic identification corresponding to the target cell comprises:
And outputting the geographic identification corresponding to the second cell.
7. The method according to any one of claims 1 to 4, further comprising:
obtaining violation places of all areas;
the violation places are coded through map data and converted into violation longitude and latitude data;
converting the violation longitude and latitude data into a multidimensional space point index character string by using a multidimensional space point index algorithm;
and storing the multidimensional space point index character string into a distributed search server.
8. A violation site identifying device, characterized in that the violation site identifying device comprises:
the receiving module is used for receiving an input query request aiming at the illegal high-speed place, wherein the query request carries the current geographic position coordinates of the user and the query distance;
the determining module is used for determining a query area according to the geographic position coordinates and the query distance;
the determining module is further used for determining a dividing distance according to the query region by using a multidimensional space point index algorithm;
the dividing module is used for dividing the planarized earth into a plurality of grids according to the dividing distance;
The dividing module is further configured to divide the grid into a plurality of cells for each grid;
the acquisition module is used for acquiring a prestored multidimensional space point index character string from the distributed search server according to the dividing distance;
the mapping module is used for mapping coordinate points of multi-dimensional space point index character strings with the same prefix into the same cell, wherein the multi-dimensional space point index character strings are character string data used for representing illegal places;
the correction module is used for correcting coordinate points in each cell;
the determining module is further configured to determine, from the processed multiple cells, cells with the number of coordinate points greater than a preset number threshold as target cells, where the target cells belong to a violation high-occurrence place;
and the output module is used for outputting the geographic identifier corresponding to the target cell, wherein the geographic identifier is the geographic identifier of the illegal high-rise place.
9. An electronic device comprising a processor and a memory, the processor being configured to execute a computer program stored in the memory to implement the method of identifying a violation location as claimed in any of claims 1 to 7.
10. A computer readable storage medium storing at least one instruction that when executed by a processor implements the method of identifying a violation location as claimed in any of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910984652.6A CN111008255B (en) | 2019-10-16 | 2019-10-16 | Method and device for identifying illegal places, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910984652.6A CN111008255B (en) | 2019-10-16 | 2019-10-16 | Method and device for identifying illegal places, electronic equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111008255A CN111008255A (en) | 2020-04-14 |
| CN111008255B true CN111008255B (en) | 2023-06-02 |
Family
ID=70111823
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910984652.6A Active CN111008255B (en) | 2019-10-16 | 2019-10-16 | Method and device for identifying illegal places, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111008255B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111680813B (en) * | 2020-04-27 | 2024-05-03 | 平安国际智慧城市科技股份有限公司 | Method, device, equipment and storage medium for intelligent reserved vaccination |
| CN113688193B (en) * | 2020-05-19 | 2024-05-17 | 北京京东振世信息技术有限公司 | Track data storage and indexing method and device, electronic equipment and readable medium |
| CN111859187B (en) * | 2020-06-30 | 2024-02-20 | 杭州欧若数网科技有限公司 | POI query method, device, equipment and medium based on distributed graph database |
| CN113836445A (en) * | 2021-09-16 | 2021-12-24 | 北京百度网讯科技有限公司 | Semantization method and device, electronic equipment and readable storage medium |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7487405B1 (en) * | 2002-05-10 | 2009-02-03 | Oracle International Corporation | Method and mechanism for dynamically configuring logical paths of state machines |
| CN103927933A (en) * | 2013-01-14 | 2014-07-16 | 北京中交兴路信息科技有限公司 | Method and device for rendering mass moving targets |
| WO2017008412A1 (en) * | 2015-07-16 | 2017-01-19 | 中兴通讯股份有限公司 | Peccancy vehicle alarm method, device and system |
| CN107908769A (en) * | 2017-11-29 | 2018-04-13 | 中国平安财产保险股份有限公司 | Violation data querying method, device, system, equipment and readable storage medium storing program for executing |
| CN108280175A (en) * | 2018-01-22 | 2018-07-13 | 大连大学 | The row's of the falling space index method divided based on medical services region |
| US10311088B1 (en) * | 2017-02-03 | 2019-06-04 | Marklogic Corporation | Apparatus and method for resolving geospatial queries |
| CN110334113A (en) * | 2019-06-05 | 2019-10-15 | 上海易点时空网络有限公司 | Violation information shared system and method based on GEO |
-
2019
- 2019-10-16 CN CN201910984652.6A patent/CN111008255B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7487405B1 (en) * | 2002-05-10 | 2009-02-03 | Oracle International Corporation | Method and mechanism for dynamically configuring logical paths of state machines |
| CN103927933A (en) * | 2013-01-14 | 2014-07-16 | 北京中交兴路信息科技有限公司 | Method and device for rendering mass moving targets |
| WO2017008412A1 (en) * | 2015-07-16 | 2017-01-19 | 中兴通讯股份有限公司 | Peccancy vehicle alarm method, device and system |
| US10311088B1 (en) * | 2017-02-03 | 2019-06-04 | Marklogic Corporation | Apparatus and method for resolving geospatial queries |
| CN107908769A (en) * | 2017-11-29 | 2018-04-13 | 中国平安财产保险股份有限公司 | Violation data querying method, device, system, equipment and readable storage medium storing program for executing |
| CN108280175A (en) * | 2018-01-22 | 2018-07-13 | 大连大学 | The row's of the falling space index method divided based on medical services region |
| CN110334113A (en) * | 2019-06-05 | 2019-10-15 | 上海易点时空网络有限公司 | Violation information shared system and method based on GEO |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111008255A (en) | 2020-04-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111008255B (en) | Method and device for identifying illegal places, electronic equipment and storage medium | |
| US10281284B2 (en) | Hybrid road network and grid based spatial-temporal indexing under missing road links | |
| CN107026881B (en) | Method, device and system for processing service data | |
| US20200311565A1 (en) | Analyzing geotemporal proximity of entities through a knowledge graph | |
| WO2019205020A1 (en) | Road condition recognition method, apparatus and device | |
| CN112579718B (en) | Urban land function identification method and device and terminal equipment | |
| US11257200B1 (en) | Computationally efficient distance-based score approximations | |
| CN114065364B (en) | Urban engineering planning method and system based on unmanned aerial vehicle remote sensing mapping | |
| US10489431B2 (en) | Digital location-based data methods and product | |
| CN111866727A (en) | Display method and device for driver gathering point, electronic equipment and storage medium | |
| Doherty et al. | Georeferencing incidents from locality descriptions and its applications: a case study from Yosemite National Park search and rescue | |
| CN111597279B (en) | Information prediction method based on deep learning and related equipment | |
| CN112132033B (en) | Vehicle type recognition method and device, electronic equipment and storage medium | |
| CN114201482A (en) | Dynamic population distribution statistical method and device, electronic equipment and readable storage medium | |
| CN112396837A (en) | Congestion area vehicle source path analysis method and system based on traffic big data | |
| CN116384844B (en) | Decision method and device based on geographic information cloud platform | |
| WO2024212360A1 (en) | Risk assessment method and apparatus for driving route of vehicle, terminal, and storage medium | |
| CN111382220A (en) | POI data dividing method and device | |
| CN111611337B (en) | Terminal data processing system | |
| McCarthy et al. | Garbage in, garbage out: geocoding accuracy and spatial analysis of crime | |
| CN113656979A (en) | Road network data generation method and device, electronic equipment and storage medium | |
| CN117596551B (en) | Green road network user behavior restoration method and device based on mobile phone signaling data | |
| CN111611336B (en) | Terminal data processing system | |
| WO2023139651A1 (en) | Congestion resolution location determination device and congestion resolution location determination method | |
| CN118861391A (en) | Map query method and device based on Internet of vehicles data, vehicle and medium |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |