CN102456014B - Method and system for obtaining gate address coordinates from electronic map - Google Patents
Method and system for obtaining gate address coordinates from electronic map Download PDFInfo
- Publication number
- CN102456014B CN102456014B CN201010517170.9A CN201010517170A CN102456014B CN 102456014 B CN102456014 B CN 102456014B CN 201010517170 A CN201010517170 A CN 201010517170A CN 102456014 B CN102456014 B CN 102456014B
- Authority
- CN
- China
- Prior art keywords
- door location
- street
- location
- cost
- electronic chart
- 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
Landscapes
- Navigation (AREA)
Abstract
The invention discloses a method for obtaining gate address coordinates from an electronic map. The method comprises the following steps of: obtaining coordinates of the original gate address in the electronic map in the electronic map; obtaining a missing gate address according to the original gate address in the electronic map; and computing according to the coordinates of the original gate address in the electronic map to obtain coordinates of the missing gate address. According to the method and the system for obtaining the gate address coordinates from the electronic map, the gate address recorded in the traditional electronic map is used as the original gate address in the electronic map for establishing a gate address map without carrying out massive on-site acquisition, thus cost is effectively reduced, defects of manual acquisition of the gate address data are overcome, and condition of acquisition errors is avoided.
Description
[technical field]
The present invention relates to geo-coding techniques, particularly relate to a kind of method and system of obtaining gate address coordinates from electronic map.
[background technology]
Geocoding carries out regulation and standardization process to place name or address information, to set up place name or process mutually corresponding between address with volume coordinate, become the process of volume coordinate by place name or address maps, such as, geographic coordinate can be generated according to certain address.
There is very many *** maps in internet, according to the electronic chart set up, user in *** maps behind input gate location, can inquire corresponding destination.
Door location is the one in map datum, generally includes the information such as street name, house number.User is by input gate location, and *** maps can inquire corresponding latitude and longitude coordinates according to the door location that user inputs, and indicates in electronic chart.In addition, for some address dates on internet, may not provide concrete longitude and latitude or specific to doorplate address etc., but we wish also to inquire corresponding latitude and longitude coordinates in electronic chart by these data.If collect the latitude and longitude coordinates of a location on electronic chart, then geocoding is the process of a door location retrieval.
Door location coordinate normally adopts the mode gathered to obtain on the spot, gathers the physical location referring to and arrive door location on the spot, obtains coordinate by locating device.The benefit of this method is that the coordinate obtained is comparatively accurate, but, gather the with high costs of this location coordinate, must operation on the spot.The making of common electronic chart is usually to investigate road, and road both sides only need gather a small amount of significant door location coordinate and can meet the demands.For the electronic chart based on door location coordinate, just must gather all door locations coordinate of each road both sides, a small amount of significant door location coordinate can not meet the demands, so for electronic cartography Fang Eryan, so huge cost is unacceptable.
[summary of the invention]
Based on this, be necessary a kind of method that cost-saved obtaining gate address coordinates from electronic map is provided.
In addition, there is a need to the system that a kind of cost-saved obtaining gate address coordinates from electronic map is provided.
A method for obtaining gate address coordinates from electronic map, comprises the steps: to obtain the coordinate of existing door location in electronic chart in electronic chart; Disappearance door location is obtained according to door location existing in described electronic chart; The coordinate of described disappearance door location is calculated according to the coordinate of described existing door location in electronic chart.
Preferably, describedly the step of the coordinate of described disappearance door location is calculated specifically according to the coordinate of described existing door location in electronic chart: be projected on the street in electronic chart door location existing in described electronic chart, obtain door location, street function; Calculating makes door location, street function meet the minimum cost of monotonicity, and recalls according to described minimum cost, obtains a location monotonic sequence; Judge whether described minimum cost is less than default threshold function table, is, then obtain by described door location monotonic sequence the coordinate lacking door location, and insert in electronic chart, otherwise, then split door location, described street function, obtain the coordinate lacking door location.
Preferably, in described acquisition electronic chart the coordinate of existing door location in electronic chart step after also comprise: the step of door location existing in described electronic chart being carried out to cutting and standardization.
Preferably, described door location existing in described electronic chart to be projected on the street in electronic chart, to obtain the step of door location, street function specifically: from described electronic chart, extract street curve, and get one end in the curve of described street as with reference to end; According to the coordinate of existing door location in electronic chart in described electronic chart, obtain the point nearest with described street curve middle distance as the subpoint on the curve of described street; Obtain the distance between the subpoint on described reference edge and street curve, and form door location, street function with existing door location house number in the electronic chart of described street curve.
Preferably, described calculating makes door location, street function meet the step of the minimum cost of monotonicity specifically: from the electronic chart of street curve, extract house number as middle house number in existing door location one by one, calculate respectively and superpose the first cost and the second cost, be met the mobile cost of door location, street Experience about Monotonicity of Functions, and be stored in array, described first cost is the cost meeting door location, street Experience about Monotonicity of Functions between reference edge to middle house number, described second cost is the cost meeting door location, street Experience about Monotonicity of Functions between middle house number to non-reference end, minimum value in described mobile cost is got as minimum cost from described array.
Preferably, described from described array, get the step of the minimum value in described mobile cost as minimum cost before also comprise the mobile cost in array screened, make described mobile cost in the scope of the higher limit preset and/or lower limit.
Preferably, door location, described fractionation described street function, obtains the step of the coordinate lacking door location specifically: according to house number, door location existing in all electronic charts is pressed odd number house number and the fractionation of even numbers house number, obtains the door location of both sides, street; Door location, place street, the door location function calculating both sides, described street respectively meets the minimum cost of monotonicity; Judge whether described minimum cost is less than default threshold function table, is, then obtain a location monotonic sequence, and obtain by described door location monotonic sequence the coordinate lacking door location, and insert in electronic chart, otherwise, then terminate.
Preferably, the described coordinate being obtained disappearance door location by described door location monotonic sequence, and the step inserted in electronic chart specifically: travel through described door location monotonic sequence, the house number obtaining being positioned at the first house number in the monotonic sequence of described door location and being positioned at last position is as target house number; According to the distance of described two target house numbers and the house number of disappearance door location, described disappearance door location is linearly inserted in electronic chart.
A system for obtaining gate address coordinates from electronic map, at least comprises: data obtaining module, for obtaining the coordinate of existing door location in electronic chart in electronic chart; Disappearance door location acquisition module, for obtaining disappearance door location according to door location existing in described electronic chart; Coordinate calculation module, for calculating the coordinate of described disappearance door location according to the coordinate of described existing door location in electronic chart.
Preferably, described coordinate calculation module comprises: projection module, for door location existing in described electronic chart being projected to the street in electronic chart, obtains door location, street function; Cost computing module, for calculating the minimum cost making door location, street function meet monotonicity, and obtains a location monotonic sequence according to described minimum cost backtracking; Disappearance recovers module, for judging whether described minimum cost is less than default threshold function table, is, then obtain by described door location monotonic sequence the coordinate lacking door location, and insert in electronic chart, otherwise, then split door location, described street function, obtain the coordinate lacking door location.
Preferably, also comprise pretreatment module, described pretreatment module is used for carrying out cutting and standardization to door location existing in described electronic chart.
Preferably, described projection module comprises: extraction unit, for extracting street curve from described electronic chart, and the one end of getting in the curve of described street is as reference end, according to the coordinate of existing door location in electronic chart in electronic chart, obtain the nearest point of street curve middle distance as the subpoint on the curve of street; Function generation unit, for obtaining the distance between the subpoint on described reference edge and street curve, and forms door location, street function with the house number of existing door location in the electronic chart of described street curve.
Preferably, described cost computing module comprises: cycling element, for extracting house number as middle house number one by one from the electronic chart of street curve existing door location, calculate respectively and superpose the first cost and the second cost, be met the mobile cost of door location, street Experience about Monotonicity of Functions, and be stored in array, described first cost is the cost meeting door location, street Experience about Monotonicity of Functions between reference edge to middle house number, and described second cost is the cost meeting door location, street Experience about Monotonicity of Functions between middle house number to non-reference end; Reading unit, for getting minimum value in described mobile cost as minimum cost from described array; Trace unit, for recalling according to described minimum cost, obtains a location monotonic sequence.
Preferably, described cost computing module also comprises screening unit, described screening unit also comprises and screening the mobile cost in array before being used for getting the step of the minimum value in described mobile cost as minimum cost from described array, makes described mobile cost in the scope of the higher limit preset and/or lower limit.
Preferably, described disappearance is recovered module and is comprised judging unit, plug-in unit, split cells, cost processing unit, described judging unit is for judging whether described minimum cost is less than default threshold function table, be, then described plug-in unit obtains by described door location monotonic sequence the coordinate lacking door location, and insert in electronic chart, otherwise, described split cells is according to house number, door location existing in all electronic charts is pressed odd number house number and the fractionation of even numbers house number, obtain the door location of both sides, street; Cost processing unit, door location, place street, door location function for calculating both sides, described street respectively meets the minimum cost of monotonicity, judge whether described minimum cost is less than default threshold function table, be, then obtain a location monotonic sequence, described plug-in unit obtains by described door location monotonic sequence the coordinate lacking door location, and inserts in electronic chart, otherwise, then stop performing.
Preferably, described plug-in unit travels through described door location monotonic sequence, the house number obtaining being positioned at the first house number in the monotonic sequence of described door location and being positioned at last position is as target house number, and according to the distance of described two target house numbers and the house number of disappearance door location, described disappearance door location is linearly inserted in electronic chart.
The method and system of above-mentioned obtaining gate address coordinates from electronic map utilize the door location of recording in existing electronic chart to set up a location map as door location existing in electronic chart, and need not carry out gathering on the spot on a large scale, significantly reduce cost, and overcome a defect that location data manually gather, thus avoid the situation gathering and make mistakes.
The method and system of above-mentioned obtaining gate address coordinates from electronic map carry out location estimation by calculating the minimum cost making door location, street function meet monotonicity to inquiry door location, the doorplate in whole street is analyzed, has possessed the ability of opposing misdata interference.
[accompanying drawing explanation]
Fig. 1 is the process flow diagram of the method for obtaining gate address coordinates from electronic map in an embodiment;
Fig. 2 is the process flow diagram of the coordinate calculating disappearance door location in an embodiment according to the coordinate of existing door location in electronic chart;
Fig. 3 is location, an embodiment Middle St sect function;
Fig. 4 is the schematic diagram of mobile cost in an embodiment;
Fig. 5 is the schematic diagram of insertion and deletion door location in electronic chart in an embodiment;
Fig. 6 is the schematic diagram of the system of obtaining gate address coordinates from electronic map in an embodiment;
Fig. 7 is the module map of coordinate calculation module in an embodiment;
Fig. 8 is the schematic diagram of projection module in an embodiment;
Fig. 9 is the schematic diagram of cost computing module in an embodiment;
In Figure 10 mono-embodiment, disappearance recovers the schematic diagram of module.
[embodiment]
Fig. 1 show the obtaining gate address coordinates from electronic map of an embodiment method flow, comprise the steps:
In step slo, the coordinate of existing door location in electronic chart in all electronic charts is obtained.In the present embodiment, the door location that acquisition collects on the spot is as door location existing in electronic chart.Due to the sub-fraction that the door location collected is all door locations in street, therefore there is a need to the coordinate of all door locations in electronic chart in supplementary complete street on the spot.Door location have recorded street and concrete house number, and such as, a complete door location can be Summer Palace Road, Haidian District, Beijing City No.5 Peking University.
In another embodiment, after the step of above-mentioned steps S10, also comprise the step of door location existing in electronic chart being carried out to cutting and standardization.In the present embodiment, according to the distinguishing hierarchy in administrative area, cutting is carried out, column criterion of going forward side by side process to inquiry door location.Such as, if door location is " Summer Palace Road, Haidian District, Beijing City No.5 Peking University ", be then Beijing by this location cutting | Haidian District | Summer Palace road | No. 5 | Peking University.In standardization to door location existing in electronic chart, the standardization that the most frequently used is to house number, such as, if the house number recorded in door location is any one in 38,38 or No. 38, this house number is all equivalent to No. 38, if record house number be interim 38, No. 38 face or 38 face in any one, then be all equivalent to interim No. 38.
In step S20, obtain disappearance door location according to door location existing in electronic chart.In the present embodiment, by the mode of traversal, by door location compared with door location existing in electronic chart, if do not mate, then this location is disappearance door location.
In step s 30, the coordinate of disappearance door location is calculated according to the coordinate of existing door location in electronic chart.In the present embodiment, in electronic chart, according to the coordinate of door location existing in electronic chart, to disappearance door location carry out coordinate estimate calculate, and in electronic chart insertion and deletion door location, thus can check in electronic chart disappearance door location particular location.
In other embodiments, as shown in Figure 2, the concrete steps of step S30 are:
In step S301, door location existing in electronic chart is projected on the street in electronic chart, obtains door location, street function.In the present embodiment, door location existing in electronic chart is projected on the street in electronic chart, obtain the process of door location, street function specifically: from electronic chart, extract street curve, and the one end of getting in the curve of street is as reference end, according to the coordinate of existing door location in electronic chart in electronic chart, obtain the point nearest with street curve middle distance as the subpoint on the curve of street, obtain the distance between reference edge and subpoint, and form door location, street function with the house number of existing door location in electronic chart.Can obtain the street curve in each street from electronic chart, in the two ends of street curve, get any one end as reference end, then the other end is as non-reference end, obtains the distance Y between existing door location in reference edge and electronic chart
i, and a corresponding house number X
i, obtain a series of (X
i, Y
i), form door location, street function, as shown in Figure 3.
In step s 302, calculate and make door location, street function meet the minimum cost of monotonicity, and according to minimum cost backtracking, obtain a location monotonic sequence.In the present embodiment, calculating makes door location, street function meet the process of the minimum cost of monotonicity specifically: from the electronic chart of street curve, extract house number as middle house number in existing door location one by one, calculate respectively and superpose the first cost and the second cost, be met the mobile cost of door location, street Experience about Monotonicity of Functions, and be stored in array, minimum value in mobile cost is got as minimum cost from array, first cost is the cost meeting door location, street Experience about Monotonicity of Functions between reference edge to middle house number, second cost is the cost meeting door location, street Experience about Monotonicity of Functions between middle house number to non-reference end.As can be seen from door location, street function, if the distribution of street number code is dull, so this door location, street function also should be a monotonic quantity, therefore, can know by analyzing door location, street function limit the dull degree that door location, street distributes.Particularly, mobile cost be defined through the position at some house number place mobile and obtain the cost that door location, whole street function meets monotone increasing or monotone decreasing, mobile cost is less, then monotonicity is better, in all mobile cost calculated, minimum mobile cost is minimum cost, if this door location, street function itself is dull, then any doorplate does not need mobile, and its minimum cost is 0.Minimum cost can be weighed by many modes, such as displacement, mobile number of times.Such as, as shown in Figure 4, fixing door location i, the door location of j to be house number be respectively No. 5 and No. 13, other numbers are evenly distributed between No. 5 and No. 13, then No. 7 doorplates need mobile 70 meters of ability to arrive the position of prediction, so mobile cost is 70, and the mobile cost of No. 11 doorplates is 110.
Door location, street function is made to meet the minimum cost of monotonicity for calculating, if acquire n door location on the spot, then corresponding house number is arranged as x [1...n] from small to large, corresponding distance is y [1...n], the maximal value of door location, street function is Y_max, minimum value is Y_min, under making cost [i] represent i-th fixed situation in door location, 1st to i-th door location is become the minimum cost of monotonic sequence, a upper fixed door location under representing minimum cost with seasonal prev [i].For convenience of calculating, suppose to there is at the minimum place of functional value, door location, street the door location that a house number is x [1]-1, the door location that a house number is x [n]+1 is there is at door location, street functional value maximum, therefore the index bound of x and y has all expanded [0...n+1] to, wherein, x [0]=x [1]-1, y [0]=Y_max, x [n+1]=x [n]+1, y [n+1]=Y_max, 0th and (n+1)th door location are fixed, and cost [n+1] is required minimum cost, and cost [0]=0.For obtaining cost [n+1], enumerate a fixed house number x [j], wherein j can be the 0th, the 1st ... n-th, prerequisite is that this house number is placed on the curve of street, meet monotone increasing or monotone decreasing, i.e. y [j]≤y [n+1] or y [j] >=y [n+1], cost [n+1]=cost [j]+movement from j+1 to n between the cost of all doorplates.Because cost [j] can according to cost [0], cost [1] ... cost [j-1] releases, and therefore asks the method for cost [n+1] to be actually and obtains cost [1], cost [2] ... successively until the process of cost [n+1].
Because a upper fixed house number has multiple choices, the mobile cost cost [n+1] calculated each time is stored in array, so cost [n+1] should select a mobile Least-cost from all possible selection, and a upper fixed position selected under cost [n+1] minimum is recorded in prev [n+1].
In another embodiment, calculate the minimum cost making door location, street function meet monotonicity to choose flexibly according to actual conditions, except the above-mentioned distance according to movement calculates except mobile cost, its simplest way is exactly directly return 1, as long as namely there is a mobile cost just to increase by 1.
In other embodiments, according to minimum cost backtracking, obtaining a detailed process for location monotonic sequence is:
From prev [n+1], take out a upper fixed position, be assumed to be p1, and then take out a upper fixed position p2 from prev [p1], ..., be till 0 until the fixed position of taking out, obtain the monotonic sequence p1 of a location, p2....
Also comprised get the step of the minimum value in mobile cost as minimum cost from array before and the mobile cost in array screened, make mobile cost between preset higher limit and/or lower limit scope in step.In the present embodiment, in order to avoid excessive mobile cost contributed by single doorplate, need to add a higher limit to mobile cost, i.e. maximum mobile cost.For ensure allow as far as possible need not movement doorplate keep motionless, a lower limit can also be added to mobile cost, i.e. minimum mobile cost.Maximum mobile cost and minimum mobile cost are empirical value, can adjust flexibly according to actual needs.
In other embodiments, also can be multiplied by a coefficient to the mobile cost in array, coefficient is less, then represent more unreliable, also less on the impact of mobile cost.This coefficient illustrates a degree of reliability for position, location, it is an empirical value, can adjust as required, this degree of reliability is measured according to the distance between the source of data acquisition and Men Zhiyu street, distance door location far away often distributes and does not more have rule, and what occur data acquisition mistake may be also larger.
In step S303, judge whether minimum cost is less than default threshold function table, is, then enter step S304, otherwise, then enter step S305.In the present embodiment, whether inspection door location monotonic sequence meets monotonicity requirement, is judged the regularity of a location by the minimum cost obtained.Because minimum cost is relevant with the range size (i.e. Y_max-Y_min) of the data amount check (n) collected on the spot, the distribution of door location, so the regularity of a location can not be judged by fixing threshold value, and should be a threshold function table H.If minimum cost is less than H, then think to have dull rule, otherwise without dull rule.
If calculating the minimum cost making door location, street function meet monotonicity is adopt the mode directly returning 1, so threshold function table can be:
H＝k
1×n
Wherein, k
1be a constant being less than 1, can get a smaller value, such as 0.2, n is the data amount check collected on the spot.
If calculating the minimum cost making door location, street function meet monotonicity is adopt the mode of displacement to measure, then threshold function table is:
H＝k
2×(Y_max-Y_min)×n
Wherein, k
2a constant being less than 1, such as 0.05.
In step s 304, obtain by door location monotonic sequence the coordinate lacking door location, and insert in electronic chart.In the present embodiment, traversal door location monotonic sequence, obtain the house number that is positioned at the first house number in a location monotonic sequence and is positioned at last position as target house number; According to the distance of two target house numbers and the house number of disappearance door location, disappearance door location is linearly inserted in electronic chart.Particularly, for the house number between the house number of first place and the house number of last position, according to the house number of disappearance door location, by the street curve equidistantly put between two target house numbers.
In other embodiments, the number that the monotonic sequence for door location lacks above, can carry out interpolation according to first summit of end points and monotonic sequence, such as, as in Fig. 5 No. 1 doorplate, No. 3 doorplates and No. 5 doorplates.
In step S305, split door location, street function, obtain the coordinate lacking door location.In the present embodiment, the process of step S305 is specifically: first, according to house number, door location existing in all electronic charts is pressed odd number house number and the fractionation of even numbers house number, obtain the door location of both sides, street, secondly, door location, place street, the door location function calculating both sides, street respectively meets the minimum cost of monotonicity, finally, judges whether minimum cost is less than default threshold function table, be, then obtain a location monotonic sequence, and obtain by described door location monotonic sequence the coordinate lacking door location, and insert in electronic chart, otherwise, then terminate.The street had in electronic chart needs the house number fractionation of the house number of odd number and even numbers to come, calculate the rule just having monotonicity respectively, therefore, when dull rule do not have for door location, street function, this door location, street function is split into odd or even number and calculates respectively.The calculating of the minimum cost after fractionation is consistent with noted earlier.
Fig. 6 shows the system of the obtaining gate address coordinates from electronic map of an embodiment, and this system comprises input media 10, disappearance door location acquisition module 20 and coordinate calculation module 30, wherein:
Data obtaining module 10, for obtaining the coordinate of existing door location in electronic chart in electronic chart.In the present embodiment, in the electronic chart accessed by data obtaining module 10, existing door location is the sub-fraction of all door locations in street, there is a need to the coordinate of all door locations in electronic chart in supplementary complete street.Door location have recorded street and concrete house number.
In another embodiment, the system of above-mentioned obtaining gate address coordinates from electronic map also comprises pretreatment module, and this pretreatment module is used for carrying out cutting and standardization to door location existing in electronic chart.In the present embodiment, pretreatment module, according to the distinguishing hierarchy in administrative area, carries out cutting, column criterion of going forward side by side process to inquiry door location.In the standardization that pretreatment module is carried out, the standardization that the most frequently used is to house number.
Disappearance door location acquisition module 20, for obtaining disappearance door location according to door location existing in electronic chart.In the present embodiment, disappearance door location acquisition module 20 is by the mode of traversal, and by door location compared with door location existing in electronic chart, if do not mate, then this location is disappearance door location.
Coordinate calculation module 30, for calculating the coordinate of disappearance door location according to the coordinate of existing door location in electronic chart.In the present embodiment, coordinate calculation module 30 in electronic chart, according to the position of door location existing in electronic chart, to disappearance door location carry out coordinate estimation, and in electronic chart insertion and deletion door location.
In other embodiments, as shown in Figure 7, coordinate calculation module 30 comprises projection module 310, cost computing module 320 and disappearance recovery module 330.
Projection module 310, for door location existing in electronic chart being projected to the street in electronic chart, obtains door location, street function.In the present embodiment, projection module 310 by door location existing in electronic chart is projected in the street in electronic chart, to obtain the detail location of existing door location in electronic chart in this electronic chart.
As shown in Figure 8, projection module 310 comprises extraction unit 312, function generation unit 314.
Extraction unit 312, for extracting street curve from electronic chart, and the one end of getting in the curve of street is as with reference to end, according to the coordinate of existing door location in electronic chart in electronic chart, obtains the nearest point of street curve middle distance as the subpoint on the curve of street.Extraction unit 312 can obtain the street curve in each street from electronic chart, and in the two ends of street curve, get any one end as reference end, then the other end is as non-reference end.
Function generation unit 314, for obtaining the distance between the subpoint on reference edge and street curve, and forms door location, street function with the house number of existing door location in electronic chart in the curve of street.Function generation unit 314 is to the distance Y obtained in reference edge and electronic chart between existing door location
i, have a corresponding house number X
i, obtain a series of (X
i, Y
i), define door location, street function.
Cost computing module 320, for calculating the minimum cost making door location, street function meet monotonicity, and obtains a location monotonic sequence according to minimum cost backtracking.
As shown in Figure 9, cost computing module 320 comprises cycling element 322, reading unit 324 and trace unit 326.
Cycling element 322, for extracting house number as middle house number in existing door location in electronic chart one by one from the curve of street, calculate respectively and superpose the first cost and the second cost, be met the mobile cost of door location, street Experience about Monotonicity of Functions, and be stored in array, first cost is the cost meeting door location, street Experience about Monotonicity of Functions between reference edge to middle house number, and the second cost is the cost meeting door location, street Experience about Monotonicity of Functions between middle house number to non-reference end.As can be seen from door location, street function, if the distribution of street number code is dull, so this door location, street function also should be a monotonic quantity, therefore, can know by analyzing door location, street function limit the dull degree that door location, street distributes.Particularly, mobile cost be defined through the position at some house number place mobile and obtain the cost that door location, whole street function meets monotone increasing or monotone decreasing, mobile cost is less, then monotonicity is better, in all mobile cost calculated, minimum mobile cost is minimum cost, if this door location, street function itself is dull, then any doorplate does not need mobile, and its minimum cost is 0.Minimum cost can be weighed by many modes, such as displacement, mobile number of times.
Cycling element 322 is calculate to make door location, street function meet the minimum cost of monotonicity, if acquire n door location on the spot, then corresponding house number is arranged as x [1...n] from small to large, corresponding distance is y [1...n], the maximal value of door location, street function is Y_max, minimum value is Y_min, under making cost [i] represent i-th fixed situation in door location, 1st to i-th door location is become the minimum cost of monotonic sequence, represent a fixed door location in minimum cost with seasonal prev [i].For convenience of calculating, suppose to there is at the minimum place of functional value, door location, street the door location that a house number is x [1]-1, the door location that a house number is x [n]+1 is there is at door location, street functional value maximum, therefore the index bound of x and y has all expanded [0...n+1] to, wherein, x [0]=x [1]-1, y [0]=Y_max, x [n+1]=x [n]+1, y [n+1]=Y_max, 0th and (n+1)th door location are fixed, and cost [n+1] is required minimum cost, and cost [0]=0.For obtaining cost [n+1], enumerate a fixed house number x [j], wherein j can be the 0th, the 1st ... n-th, prerequisite is that this house number is placed on the curve of street, meet monotone increasing or monotone decreasing, i.e. y [j]≤y [n+1] or y [j] >=y [n+1], cost [n+1]=cost [j]+movement from j+1 to n between the cost of all doorplates.Because cost [j] can according to cost [0], cost [1] ... cost [j-1] releases, therefore ask the method for cost [n+1] to be actually and obtain cost [1], cost [2] ... successively until the process of cost [n+1].
Because a upper fixed house number has multiple choices, the cost cost [n+1] that cycling element 322 calculates each time is stored in array, so cost [n+1] should select a Least-cost from all possible selection, and a upper fixed position selected under cost [n+1] minimum is recorded in prev [n+1].
In another embodiment, cycling element 322 calculates the mode making door location, street function meet the minimum cost of monotonicity and can choose flexibly according to actual conditions, except the above-mentioned distance according to movement calculates except mobile cost, its the simplest way is exactly directly return 1, as long as namely there is a mobile cost just to increase by 1.
Reading unit 324, for getting minimum value in mobile cost as minimum cost from array.
Trace unit 326, for according to minimum cost backtracking, obtains a location monotonic sequence.In the present embodiment, from prev [n+1], take out a upper fixed position, be assumed to be p1, and then take out a upper fixed position p2 from prev [p1] ..., be till 0 until the fixed position of taking out, obtain the monotonic sequence p1 of a location, p2....
In another embodiment, above-mentioned cost computing module 320 also comprises screening unit, this screening unit be used for the mobile cost in array is screened, make mobile cost between preset higher limit and/or lower limit scope in.In the present embodiment, in order to avoid excessive mobile cost contributed by single doorplate, need to add a higher limit to mobile cost, i.e. maximum mobile cost.For ensure allow as far as possible need not movement doorplate keep motionless, a lower limit can also be added to mobile cost, i.e. minimum mobile cost.Maximum mobile cost and minimum mobile cost are empirical value, can adjust flexibly according to actual needs.
Screening unit also can be multiplied by a coefficient to the mobile cost in array, coefficient is less, then represent more unreliable, also less on the impact of cost.This coefficient illustrates a degree of reliability for position, location, it is an empirical value, can adjust as required, this degree of reliability is measured apart from off-street distance according to the source of data acquisition and door location, distance door location far away often distributes and does not more have rule, and what occur data acquisition mistake may be also larger.
Disappearance recovers module 330, for judging whether minimum cost is less than default threshold function table, is, then obtain by described door location monotonic sequence the coordinate lacking door location, and insert in electronic chart, otherwise, then split door location, street function, obtain the coordinate lacking door location.In the present embodiment, disappearance is recovered module 330 inspection door location monotonic sequence and whether is met monotonicity requirement, is judged the regularity of a location by the minimum cost obtained.Because mobile cost is relevant with the range size (i.e. Y_max-Y_min) of the data amount check (n) collected on the spot, the distribution of door location, so the regularity of a location can not be judged by fixing threshold value, and should be a threshold function table H.If minimum cost is less than H, then think to have dull rule, otherwise without dull rule.
If calculating the minimum cost making door location, street function meet monotonicity is adopt the mode directly returning 1, so threshold function table can be:
H＝k
1×n
Wherein, k
1be a constant being less than 1, can get a smaller value, such as 0.2, n is the data amount check collected on the spot.
If calculating the minimum cost making door location, street function meet monotonicity is adopt the mode of displacement to measure, then threshold function table is:
H＝k
2×(Y_max-Y_min)×n
Wherein, k
2a constant being less than 1, such as 0.05.
As shown in Figure 10, disappearance recovery module 330 comprises judging unit 332, plug-in unit 334, split cells 336 and cost processing unit 338.
Judging unit 332, for judging whether minimum cost is less than default threshold function table, be, then plug-in unit 334 obtains by described door location monotonic sequence the coordinate lacking door location, and insert in electronic chart, otherwise then split cells 336 splits door location, street function, door location existing in all electronic charts is pressed odd number house number and the fractionation of even numbers house number, obtain the door location of both sides, street.In the present embodiment, threshold function table as previously mentioned.Door location existing in all electronic charts, according to house number, is pressed odd number house number and the fractionation of even numbers house number, is obtained the door location of both sides, street by split cells 336.Particularly, the street had in electronic chart needs the house number fractionation of the house number of odd number and even numbers to come, and calculates the rule just having monotonicity respectively.
Cost processing unit 338, door location, place street, door location function for calculating both sides, street respectively meets the minimum cost of monotonicity, judge whether minimum cost is less than default threshold function table, be, then obtain a location monotonic sequence, plug-in unit 334 obtains by described door location monotonic sequence the coordinate lacking door location, and inserts in electronic chart, otherwise, then stop performing.In the present embodiment, when not having a dull rule for door location, street function, this door location, street function is split into odd or even number and calculates respectively by cost processing unit 338.The calculating of the minimum cost after fractionation is consistent with noted earlier.
Plug-in unit 334, for traveling through a location monotonic sequence, the house number obtaining being positioned at the first house number in a location monotonic sequence and being positioned at last position is as target house number, and according to the distance of two target house numbers and the house number of disappearance door location, disappearance door location is linearly inserted in electronic chart by the house number of distance and disappearance door location.In the present embodiment, the number that the monotonic sequence for door location lacks above, judging unit 332 can carry out interpolation according to first summit of end points and monotonic sequence.
In the method and system of above-mentioned obtaining gate address coordinates from electronic map, user, at the mode input inquiry string by online or off-line, comes navigation or the inquiry of realize target position.This query string can be a concrete door location.When user input query string, travel through in the door location gathered on the spot and whether there is the door location consistent with query string, be, then show in the map of door location, otherwise, then carry out a location location estimation by the method and system of above-mentioned obtaining gate address coordinates from electronic map, obtain the position of query string in the map of door location.
The method and system of above-mentioned obtaining gate address coordinates from electronic map utilize the door location of recording in existing electronic chart to set up a location map as door location existing in electronic chart, and need not carry out gathering on the spot on a large scale, significantly reduce cost, and overcome a defect that location data manually gather, thus avoid the situation gathering and make mistakes.
The method and system of above-mentioned obtaining gate address coordinates from electronic map carry out location estimation by calculating the minimum cost making door location, street function meet monotonicity to inquiry door location, the doorplate in whole street is analyzed, has possessed the ability of opposing dirty data and interference.
The above embodiment only have expressed several embodiment of the present invention, and it describes comparatively concrete and detailed, but therefore can not be interpreted as the restriction to the scope of the claims of the present invention.It should be pointed out that for the person of ordinary skill of the art, without departing from the inventive concept of the premise, can also make some distortion and improvement, these all belong to protection scope of the present invention.Therefore, the protection domain of patent of the present invention should be as the criterion with claims.
Claims (12)
1. a method for obtaining gate address coordinates from electronic map, comprises the steps:
Obtain the coordinate of existing door location in electronic chart in electronic chart;
Disappearance door location is obtained according to door location existing in described electronic chart;
Door location existing in described electronic chart is projected on the street in electronic chart, obtain door location, street function, by calculating the minimum cost making door location, street function meet monotonicity, the coordinate that location estimation obtains lacking door location is carried out to disappearance door location, and in electronic chart insertion and deletion door location;
The described minimum cost making door location, street function meet monotonicity by calculating carries out to disappearance door location the coordinate that location estimation obtains lacking door location, and the step of insertion and deletion door location comprises in electronic chart:
Gather n door location on the spot, then corresponding house number is arranged as x [1 from small to large ... n], corresponding distance is y [1 ... n];
Under cost [i] represents i-th fixed situation in door location, the 1st to i-th door location is become the minimum cost of monotonic sequence, a upper fixed door location under prev [i] represents minimum cost simultaneously;
Suppose to there is at the minimum place of functional value, door location, street the door location that a house number is x [1]-1, the door location that a house number is x [n]+1 is there is at door location, street functional value maximum, therefore the index bound of x and y has all expanded [0...n+1] to, wherein, x [0]=x [1]-1, y [0]=Y_max, x [n+1]=x [n]+1, y [n+1]=Y_max, 0th and (n+1)th door location are fixed, cost [n+1] is the mobile cost meeting door location, street Experience about Monotonicity of Functions, and be stored in array, the upper fixed position that prev [n+1] is selected under recording cost [n+1] minimum,
Cost [n+1] should get minimum value in mobile cost as minimum cost from array, and is recorded in prev [n+1] by a upper fixed position selected under cost [n+1] minimum;
From prev [n+1], take out a upper fixed position, be assumed to be p1, and then take out a upper fixed position p2 from prev [p1], be till 0 until the fixed position of taking out, obtain the monotonic sequence p1 of a location, p2
Obtain by the monotonic sequence of door location the coordinate lacking door location, and insert in electronic chart.
2. the method for obtaining gate address coordinates from electronic map according to claim 1, is characterized in that, is describedly projected on the street in electronic chart door location existing in described electronic chart, obtains the step of door location, street function specifically:
From described electronic chart, extract street curve, and the one end of getting in the curve of described street is as reference end;
According to the coordinate of existing door location in electronic chart in described electronic chart, obtain the point nearest with described street curve middle distance as the subpoint on the curve of described street;
Obtain the distance between the subpoint on described reference edge and street curve, and form door location, street function with existing door location house number in the electronic chart of described street curve;
Described from prev [n+1] take out a upper fixed position, be assumed to be p1, and then take out a upper fixed position p2 from prev [p1], be till 0 until the fixed position of taking out, obtain the monotonic sequence p1 of a location, p2 ... step after, also comprise:
Judge whether described minimum cost is less than default threshold function table, be, then enter the described coordinate obtaining lacking door location by the monotonic sequence of described door location, and the step inserted in electronic chart, otherwise, door location, Ze Jiang street function splits into odd or even number and calculates minimum cost respectively, obtains the coordinate lacking door location.
3. the method for obtaining gate address coordinates from electronic map according to claim 1, is characterized in that, in described acquisition electronic chart the coordinate of existing door location in electronic chart step after also comprise:
Door location existing in described electronic chart is carried out to the step of cutting and standardization.
4. the method for obtaining gate address coordinates from electronic map according to claim 1, it is characterized in that, described cost [n+1] should get minimum value in mobile cost as minimum cost from array, and also comprise before a upper fixed position selected under cost [n+1] minimum being recorded in the step in prev [n+1] the mobile cost in array is screened, make described mobile cost in the scope of the higher limit preset and/or lower limit.
5. the method for obtaining gate address coordinates from electronic map according to claim 2, is characterized in that, describedly door location, street function is split into odd or even number calculates minimum cost respectively, obtains the step of the coordinate lacking door location specifically:
According to house number, door location existing in all electronic charts is pressed odd number house number and the fractionation of even numbers house number, obtain the door location of both sides, street;
Door location, place street, the door location function calculating both sides, described street respectively meets the minimum cost of monotonicity;
Judge whether described minimum cost is less than default threshold function table, is, then obtain a location monotonic sequence, and obtain by described door location monotonic sequence the coordinate lacking door location, and insert in electronic chart, otherwise, then terminate.
6. the method for obtaining gate address coordinates from electronic map according to claim 5, is characterized in that, the described coordinate being obtained disappearance door location by described door location monotonic sequence, and the step inserted in electronic chart is specifically:
Travel through described door location monotonic sequence, the house number obtaining being positioned at the first house number in the monotonic sequence of described door location and being positioned at last position is as target house number;
According to the distance of described two target house numbers and the house number of disappearance door location, described disappearance door location is linearly inserted in electronic chart.
7. a system for obtaining gate address coordinates from electronic map, is characterized in that, at least comprises:
Data obtaining module, for obtaining the coordinate of existing door location in electronic chart in electronic chart;
Disappearance door location acquisition module, for obtaining disappearance door location according to door location existing in described electronic chart;
Coordinate calculation module, for door location existing in described electronic chart being projected to the street in electronic chart, obtain door location, street function, by calculating the minimum cost making door location, street function meet monotonicity, the coordinate that location estimation obtains lacking door location is carried out to disappearance door location, and in electronic chart insertion and deletion door location;
Described coordinate calculation module acquires n door location on the spot, then corresponding house number is arranged as x [1 from small to large ... n], corresponding distance is y [1 ... n], under cost [i] represents i-th fixed situation in door location, the 1st to i-th door location is become the minimum cost of monotonic sequence, a upper fixed door location under prev [i] represents minimum cost simultaneously, suppose to there is at the minimum place of functional value, door location, street the door location that a house number is x [1]-1, the door location that a house number is x [n]+1 is there is at door location, street functional value maximum, therefore the index bound of x and y has all expanded [0...n+1] to, wherein, x [0]=x [1]-1, y [0]=Y_max, x [n+1]=x [n]+1, y [n+1]=Y_max, 0th and (n+1)th door location are fixed, cost [n+1] is the mobile cost meeting door location, street Experience about Monotonicity of Functions, and be stored in array, the upper fixed position that prev [n+1] is selected under recording cost [n+1] minimum,
Cost [n+1] should get minimum value in mobile cost as minimum cost from array, and is recorded in prev [n+1] by a upper fixed position selected under cost [n+1] minimum; From prev [n+1], take out a upper fixed position, be assumed to be p1, and then take out a upper fixed position p2 from prev [p1], be till 0 until the fixed position of taking out, obtain the monotonic sequence p1 of a location, p2 Obtain by the monotonic sequence of door location the coordinate lacking door location, and insert in electronic chart.
8. the system of obtaining gate address coordinates from electronic map according to claim 7, is characterized in that, described coordinate calculation module comprises:
Projection module, for door location existing in described electronic chart being projected to the street in electronic chart, obtains door location, street function;
Described projection module comprises:
Extraction unit, for extracting street curve from described electronic chart, and the one end of getting in the curve of described street is as with reference to end, according to the coordinate of existing door location in electronic chart in electronic chart, obtains the point nearest with street curve middle distance as the subpoint on the curve of street;
Function generation unit, for obtaining the distance between the subpoint on described reference edge and street curve, and forms door location, street function with the house number of existing door location in the electronic chart of described street curve;
Disappearance recovers module, for judging whether described minimum cost is less than default threshold function table, be, then obtain by described door location monotonic sequence the coordinate lacking door location, and insert in electronic chart, otherwise door location, Ze Jiang street function splits into odd or even number and calculates minimum cost respectively, obtain the coordinate lacking door location.
9. the system of obtaining gate address coordinates from electronic map according to claim 7, is characterized in that, also comprises pretreatment module, and described pretreatment module is used for carrying out cutting and standardization to door location existing in described electronic chart.
10. the system of obtaining gate address coordinates from electronic map according to claim 7, it is characterized in that, described coordinate calculation module also for getting minimum value in described mobile cost as before minimum cost from described array, mobile cost in array is screened, make described mobile cost between preset higher limit and/or lower limit scope in.
The system of 11. obtaining gate address coordinates from electronic maps according to claim 8, it is characterized in that, described disappearance is recovered module and is comprised judging unit, plug-in unit, split cells, cost processing unit, described judging unit is for judging whether described minimum cost is less than default threshold function table, be, then described plug-in unit obtains by described door location monotonic sequence the coordinate lacking door location, and insert in electronic chart, otherwise, described split cells is according to house number, door location existing in all electronic charts is pressed odd number house number and the fractionation of even numbers house number, obtain the door location of both sides, street,
Cost processing unit, door location, place street, door location function for calculating both sides, described street respectively meets the minimum cost of monotonicity, judge whether described minimum cost is less than default threshold function table, be, then obtain a location monotonic sequence, described plug-in unit obtains by described door location monotonic sequence the coordinate lacking door location, and inserts in electronic chart, otherwise, then stop performing.
The system of 12. obtaining gate address coordinates from electronic maps according to claim 11, it is characterized in that, described plug-in unit travels through described door location monotonic sequence, the house number obtaining being positioned at the first house number in the monotonic sequence of described door location and being positioned at last position is as target house number, and according to the distance of described two target house numbers and the house number of disappearance door location, described disappearance door location is linearly inserted in electronic chart.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010517170.9A CN102456014B (en) | 2010-10-21 | 2010-10-21 | Method and system for obtaining gate address coordinates from electronic map |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010517170.9A CN102456014B (en) | 2010-10-21 | 2010-10-21 | Method and system for obtaining gate address coordinates from electronic map |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102456014A CN102456014A (en) | 2012-05-16 |
| CN102456014B true CN102456014B (en) | 2015-07-01 |
Family
ID=46039212
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010517170.9A Active CN102456014B (en) | 2010-10-21 | 2010-10-21 | Method and system for obtaining gate address coordinates from electronic map |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102456014B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104422450B (en) * | 2013-09-06 | 2018-02-09 | 上海博泰悦臻电子设备制造有限公司 | The information loading method and device of navigation system, method for information display and device |
| CN105740253A (en) * | 2014-12-09 | 2016-07-06 | 北京四维图新科技股份有限公司 | Processing method and processing device of address information |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1553365A (en) * | 2003-06-04 | 2004-12-08 | 吴智伟 | Dynamic place name data processing method |
| CN1933518A (en) * | 2005-09-12 | 2007-03-21 | 王益群 | System for obtaining electronic map inquiry address via network number plate |
| CN101369326A (en) * | 2007-08-15 | 2009-02-18 | 王益群 | Numerical coding and inquiry system of digital doorplate |
| CN101769753A (en) * | 2008-11-28 | 2010-07-07 | 张政 | Method for acquiring coordinate of interest points |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2007255907A (en) * | 2006-03-20 | 2007-10-04 | Pioneer Electronic Corp | Route searching system, and device, method, and program for information registration, and computer-readable recording medium |
-
2010
- 2010-10-21 CN CN201010517170.9A patent/CN102456014B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1553365A (en) * | 2003-06-04 | 2004-12-08 | 吴智伟 | Dynamic place name data processing method |
| CN1933518A (en) * | 2005-09-12 | 2007-03-21 | 王益群 | System for obtaining electronic map inquiry address via network number plate |
| CN101369326A (en) * | 2007-08-15 | 2009-02-18 | 王益群 | Numerical coding and inquiry system of digital doorplate |
| CN101769753A (en) * | 2008-11-28 | 2010-07-07 | 张政 | Method for acquiring coordinate of interest points |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102456014A (en) | 2012-05-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10323948B2 (en) | GPS data repair | |
| CN102147260B (en) | Electronic map matching method and device | |
| US9880012B2 (en) | Hybrid road network and grid based spatial-temporal indexing under missing road links | |
| Barron et al. | A comprehensive framework for intrinsic OpenStreetMap quality analysis | |
| CN106779417A (en) | The collection of engineering investigation information digitalization, management and integrated application method | |
| CN102298873B (en) | Navigation electronic map data storage method and display method based on the same | |
| CN101231175B (en) | Method for labeling interest points on global positioning system electronic map | |
| CN106840175A (en) | A kind of vehicle driving trace matches the method and device of road network | |
| CN101452072A (en) | Electronic information system for earth monitor and method thereof | |
| CN103514235B (en) | A kind of method for building up of incremental code library and device | |
| CN105355042A (en) | Road network extraction method based on taxi GPS | |
| Zandbergen et al. | Positional accuracy of TIGER 2000 and 2009 road networks | |
| US10809072B1 (en) | Computationally efficient distance-based score approximations | |
| CN114048943A (en) | Urban waterlogging analysis method, device and medium based on unmanned aerial vehicle BIM and SWMM | |
| CN108228593A (en) | Point of interest importance measuring method and device | |
| John et al. | Deriving incline values for street networks from voluntarily collected GPS traces | |
| Will | Development of an automated matching algorithm to assess the quality of the OpenStreetMap road network: a case study in Göteborg, Sweden | |
| Morris et al. | Digital trail libraries | |
| CN110555432A (en) | Method, device, equipment and medium for processing interest points | |
| Lu et al. | Visual analysis of uncertainty in trajectories | |
| CN102456014B (en) | Method and system for obtaining gate address coordinates from electronic map | |
| CN101978708A (en) | Poi displaying method and electronic apparatus utilizing the method | |
| CN103246650B (en) | A kind of road logic model preparation method | |
| Jacobs | Quality assessment of volunteered geographic information: an investigation into the Ottawa-Gatineau OpenStreetMap database | |
| Braga-Neto et al. | Spatial data for fungal specimens: retrospective georeferencing and practical recommendations for mycologists |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20200825 Address after: 518000 Nanshan District science and technology zone, Guangdong, Zhejiang Province, science and technology in the Tencent Building on the 1st floor of the 35 layer Co-patentee after: TENCENT CLOUD COMPUTING (BEIJING) Co.,Ltd. Patentee after: TENCENT TECHNOLOGY (SHENZHEN) Co.,Ltd. Address before: Shenzhen Futian District City, Guangdong province 518044 Zhenxing Road, SEG Science Park 2 East Room 403 Patentee before: TENCENT TECHNOLOGY (SHENZHEN) Co.,Ltd. |
|
| TR01 | Transfer of patent right |