CN107818131A - A kind of method for comparing travel paths using string of binary characters - Google Patents
A kind of method for comparing travel paths using string of binary characters Download PDFInfo
- Publication number
- CN107818131A CN107818131A CN201710850727.2A CN201710850727A CN107818131A CN 107818131 A CN107818131 A CN 107818131A CN 201710850727 A CN201710850727 A CN 201710850727A CN 107818131 A CN107818131 A CN 107818131A
- Authority
- CN
- China
- Prior art keywords
- point
- rectangle
- path
- travel paths
- stroke
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
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/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9537—Spatial or temporal dependent retrieval, e.g. spatiotemporal queries
-
- 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
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)
- Computational Linguistics (AREA)
- Remote Sensing (AREA)
- Position Fixing By Use Of Radio Waves (AREA)
Abstract
A kind of method for being compared travel paths using string of binary characters of the present invention, is comprised the following steps：(1) collect user and drive run-length data；(2) point on stroke is iterated by smoothing by RDP algorithms (general gram of algorithm of Douglas)；(3) by DDA algorithms (numerical differentiation) will it is smooth after path point polishing be in line；(4) world map is divided into 20 meters * 20 meters of rectangle by longitude and latitude；(5) each rectangle numbering is given；(6) path point on square boundary is screened, and judged on which rectangle；(7) all rectangles numbering on path is spliced into a character string, and is converted into binary-coded character；(8) the unique mark character string of each stroke is compared using smallest edit distance, it is possible to obtain the similarity degree of travel paths.The present invention can allow user to be matched in 30 seconds after completing stroke with oneself there is the travel information of identical travel paths.
Description
Technical field
The present invention relates to a kind of method of relatively travel paths, more particularly to one kind carrys out comparison row using string of binary characters
The method in journey path.
Background technology
The method of existing relatively travel paths is all based on capturing road name to form the method for road name-direction-distance substantially
Each stroke is identified, is compared by cutting character string, uses very inconvenient, and carrying cost is high.
The content of the invention
The technical problem to be solved in the present invention is to provide one kind need not capture road name, and that saves carrying cost uses binary system
Character string compares the method for travel paths.
To reach above-mentioned purpose, technical scheme is as follows：
A kind of method for being compared travel paths using string of binary characters, methods described are comprised the following steps：
(1) start, user's steering external path data is obtained by the d GPS locating module in smart mobile phone, wherein counting
According to including GPS location information；
(2) above-mentioned data are traveled through, following processing is carried out to first stroke；
(3) by all GPS location points of first travel paths, the point on stroke is iterated by RDP algorithms flat
Cunningization, offset point, error dot on path are rejected, main path point retained, and records；
(4) whether the point after judging smoothly is very few, and Rule of judgment is：Whether original route similar route is still formed, passed through
A little distance is cumulative is judged for institute, if the accumulation distance of institute a little differs by more than 30% with the total distance in original track, expression
Point after smooth is very few, then return to step (2) is until the point after smooth is normal；If accumulation distance a little and original track
Total distance difference is no more than 30%, and the point after representing smooth is normal, then continues next step；(5) will remain in step 3
Main path point by DDA algorithms will it is smooth after path point polishing be in line, obtain the path profile being made up of multiple line segments；
(6) by the way that world's longitude and latitude is divided by 400 square metres, numbering is provided by longitude and latitude, specifically from
0,0 point starts, and every 0.00005 longitude and every 0.00005 latitude are calculated as a rectangle, after rectangle is sorted by latitude order again
Sorted by longitude order, provide the unique corresponding numbering of each rectangle；
(7) it is starting point if the rectangle numbering where path point is 1, if the rectangle numbering where path point is equal to road
Footpath point sum is then terminal；
(8) path point after all completions is screened, judges the path point after completion whether on the border of rectangle,
If on border, into next step；If not on border, return to step (5), until the path point after completion exists
On the border of rectangle；The step is to find out the point again on square boundary, for determining which rectangle path have passed through；
(9) point that all steps (8) retain is calculated, the rectangle that each point passes through is found out, by the volume of rectangle
Number arrange in order, be spliced into a character string, and first GPS point that original stroke recorded and original stroke recording
To last GPS point be put at beginning and end；
(10) character string after the completion of splicing is handled, is converted to 64 strings of binary characters；
(11) it is converted into all travel paths mark datas deposit database of 64 strings of binary characters；
(12) judge also whether travel paths are untreated, specific determination methods are：By being inquired about in database
Whether untreated stroke is had, and processed can add marks, untreated, does not have；If any untreated, then next stroke is made
For first stroke return to step 3, until without untreated travel paths；It is such as no untreated, then into next step；
(13) after the completion of the mark data processing of all travel paths, for the ratio of all strokes progress between any two
Compared with number of comparisons is the factorial time of number of strokes, and comparative approach is smallest edit distance method；
(14) smallest edit distance is judged less than threshold value right, if similarity degree is less than 80%, is skipped；It is if similar
Degree is more than 80%, then is stored in similar run-length data storehouse, and editing distance algorithm returns to similar proportion；
(15) terminate.
In one embodiment of the invention, the RDP algorithms in step (3) aspirate algorithm, and its principle is：One section of track
It is end-to-end into a line, if all points are both less than 3KM apart from the distance of this line therebetween, removes middle all
Point；If conditions above is unsatisfactory for, the maximum point of distance is taken, initial trace is split into two tracks, repeats above iteration,
Until completing, wherein it is smooth also to have carried out iteration to reject offset point, error dot for effect.
In one embodiment of the invention, the path point in step (8) after completion whether rectangle borderline tool
Body determination methods are：Path point after all completions is screened, whether the 5th decimal is 0 or 5 for matching, the 5th decimal
It is exactly borderline point for 0 or 5, is not otherwise just borderline point.
In one embodiment of the invention, between the smallest edit distance algorithm in step (13) refers to two word strings,
As the minimum edit operation number needed for one changes into another；The edit operation of license is another including a character is substituted for
Individual character, a character is inserted, delete a character；In general, editing distance is smaller, and the similarity of two strings is bigger.
Pass through above-mentioned technical proposal, the beneficial effects of the invention are as follows：
Travel information only need to be converted into string of binary characters and can be carried out comparing by the present invention, without capturing road name, section
About carrying cost；And user can be allowed to be matched in 30 seconds after completing stroke with oneself there are identical travel paths
Travel information.
The present invention is without external interface, it is only necessary to which local can completes all processing.
The present invention need not store Chinese character or English character, and carrying cost is saved with binary-coded character.
Brief description of the drawings
In order to illustrate more clearly about the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing
There is the required accompanying drawing used in technology description to be briefly described, it should be apparent that, drawings in the following description are only this
Some embodiments of invention, for those of ordinary skill in the art, on the premise of not paying creative work, can be with
Other accompanying drawings are obtained according to these accompanying drawings.
Fig. 1 is FB(flow block) of the present invention；
Fig. 2 is cathetus equation schematic diagram of the present invention；
Embodiment
In order that the technical means, the inventive features, the objects and the advantages of the present invention are easy to understand, tie below
Conjunction is specifically illustrating, and the present invention is expanded on further.
Referring to shown in Fig. 1 and Fig. 2, the invention discloses a kind of side for comparing travel paths using string of binary characters
Method, methods described comprise the following steps：
(1) start, user's steering external path data is obtained by the d GPS locating module in smart mobile phone, wherein counting
According to including GPS location information；
(2) above-mentioned data are traveled through, following processing is carried out to first stroke；
(3), will row by RDP algorithms (Douglas-Pu Ke algorithms) by all GPS location points of first travel paths
Point in journey is iterated smoothing, and offset point, error dot on path are rejected, main path point retained, and records；
RDP algorithms aspirate algorithm, and its principle is：One section of track be end-to-end it is into a line, if all points are apart from this therebetween
The distance of line is both less than 3KM, then removes middle all points；If conditions above is unsatisfactory for, the maximum point of distance is taken, original
Beginning, track split into two tracks, and repetition above iteration, until completing, wherein effect is also carried out to reject offset point, error dot
Iteration is smooth.
(4) whether the point after judging smoothly is very few, and Rule of judgment is：Whether original route similar route is still formed, passed through
A little distance is cumulative is judged for institute, if the accumulation distance of institute a little differs by more than 30% with the total distance in original track, expression
Point after smooth is very few, then return to step (2) is until the point after smooth is normal；If accumulation distance a little and original track
Total distance difference is no more than 30%, and the point after representing smooth is normal, then continues next step；
(5) by the main path remained in step 3 point by DDA algorithms (numerical differentiation) will it is smooth after path point
Polishing is in line, and obtains the path profile being made up of multiple line segments；The fundamental differential of its cathetus is：
If straight-line pass point
P1(x1, y1) and P2(x2, y2), then linear equation is represented by：
If it is known that i-th point of coordinate, the coordinate that i+1 point can be obtained with step-length StepX and StepY are：
xi+1=xi+StepX
yi+1=yi+StepY
Or
yi+1=yi+kStepX
K ＜ 1
StepX=1
StepY=k
The changing coordinates that will each be put on counted straight line, round off obtain the position of optical grating point (see Fig. 2).
(6) by the way that world's longitude and latitude is divided by 400 square metres, numbering is provided by longitude and latitude, specifically from
0,0 point starts, and every 0.00005 longitude and every 0.00005 latitude are calculated as a rectangle, after rectangle is sorted by latitude order again
Sorted by longitude order, provide the unique corresponding numbering of each rectangle；
(7) it is starting point if the rectangle numbering where path point is 1, if the rectangle numbering where path point is equal to road
Footpath point sum is then terminal；If path point is not beginning or end, into next step；If path point is starting point or end
Point, then last GPS point that first GPS point and original stroke that recorded original stroke recorded are put into beginning and knot
At tail；
(8) path point after all completions is screened, judges the path point after completion whether on the border of rectangle,
If on border, into next step；If not on border, return to step (5), until the path point after completion exists
On the border of rectangle；The step is to find out the point again on square boundary, for determining which rectangle path have passed through；After completion
Path point whether in the borderline specific determination methods of rectangle be：Path point after all completions is screened, matching is
No 5th decimal is 0 or 5, and the 5th decimal is exactly borderline point for 0 or 5, is not otherwise just borderline point；
(9) point that all steps (8) retain is calculated, the rectangle that each point passes through is found out, by the volume of rectangle
Number arrange in order, be spliced into a character string；
(10) character string after the completion of splicing is handled, is converted to 64 strings of binary characters；
(11) it is converted into all travel paths mark datas deposit database of 64 strings of binary characters；
(12) judge also whether travel paths are untreated, specific determination methods are：By being inquired about in database
Whether untreated stroke is had, and processed can add marks, untreated, does not have；If any untreated, then next stroke is made
For first stroke return to step 3, until without untreated travel paths；It is such as no untreated, then into next step；
(13) after the completion of the mark data processing of all travel paths, for the ratio of all strokes progress between any two
Compared with number of comparisons is the factorial time of number of strokes, and comparative approach is smallest edit distance method；Smallest edit distance algorithm refers to two
Between word string, as the minimum edit operation number needed for one changes into another；The edit operation of license is included a character
Another character is substituted for, inserts a character, deletes a character；In general, editing distance is smaller, two string it is similar
Degree is bigger；
(14) smallest edit distance is judged less than threshold value right, if similarity degree is less than 80%, is skipped；It is if similar
Degree is more than 80%, then is stored in similar run-length data storehouse, and editing distance algorithm returns to similar proportion；
(15) terminate.
The general principle and principal character and advantages of the present invention of the present invention has been shown and described above.The technology of the industry
Personnel are it should be appreciated that the present invention is not limited to the above embodiments, and the simply explanation described in above-described embodiment and specification is originally
The principle of invention, without departing from the spirit and scope of the present invention, various changes and modifications of the present invention are possible, these changes
Change and improvement all fall within the protetion scope of the claimed invention.The claimed scope of the invention by appended claims and its
Equivalent thereof.
Claims (4)
- A kind of 1. method for comparing travel paths using string of binary characters, it is characterised in that methods described includes following step Suddenly：(1) start, user's steering external path data, wherein packet are obtained by the d GPS locating module in smart mobile phone Include GPS location information；(2) above-mentioned data are traveled through, following processing is carried out to first stroke；(3) by all GPS location points of first travel paths, the point on stroke is iterated by smoothing by RDP algorithms, Offset point, error dot on path are rejected, main path point retained, and records；(4) whether the point after judging smoothly is very few, and Rule of judgment is：Whether original route similar route is still formed, by all Point distance is cumulative to be judged, if the accumulation distance of institute a little differs by more than 30% with the total distance in original track, is represented smoothly Point afterwards is very few, then return to step (2) is until the point after smooth is normal；If accumulation distance a little and original track always away from It is no more than 30% from difference, the point after representing smooth is normal, then continues next step；(5) by the main path remained in step 3 point by DDA algorithms will it is smooth after path point polishing be in line, obtain The path profile being made up of multiple line segments；(6) by the way that world's longitude and latitude is divided by 400 square metres, numbering is provided by longitude and latitude, specifically from 0,0 point Start, every 0.00005 longitude and every 0.00005 latitude are calculated as a rectangle, again by warp after rectangle is sorted by latitude order Degree order sorts, and provides the unique corresponding numbering of each rectangle；(7) it is starting point if the rectangle numbering where path point is 1, if the rectangle numbering where path point is equal to path point It is total then be terminal；(8) path point after all completions is screened, judges the path point after completion whether on the border of rectangle, if On border, then into next step；If not on border, return to step (5), until the path point after completion is in rectangle Border on；The step is to find out the point again on square boundary, for determining which rectangle path have passed through；(9) point that all steps (8) retain is calculated, finds out the rectangle that each point passes through, the numbering of rectangle is pressed Order arranges, be spliced into a character string, and first GPS point that original stroke recorded and original stroke recorded Last GPS point is put at beginning and end；(10) character string after the completion of splicing is handled, is converted to 64 strings of binary characters；(11) it is converted into all travel paths mark datas deposit database of 64 strings of binary characters；(12) judge also whether travel paths are untreated, specific determination methods are：By inquired about in database whether There is untreated stroke, processed can add marks, untreated, does not have；If any untreated, then using next stroke as One stroke return to step 3, until without untreated travel paths；It is such as no untreated, then into next step；(13) after the completion of the mark data processing of all travel paths, comparison between any two is carried out for all strokes, than Factorial time compared with number for number of strokes, comparative approach is smallest edit distance method；(14) smallest edit distance is judged less than threshold value right, if similarity degree is less than 80%, is skipped；If similarity degree More than 80%, then similar run-length data storehouse is stored in, editing distance algorithm returns to similar proportion；(15) terminate.
- A kind of 2. method for comparing travel paths using string of binary characters according to claim 1, it is characterised in that RDP algorithms in step (3) aspirate algorithm, and its principle is：One section of track be end-to-end it is into a line, if all therebetween Point is both less than 3KM apart from the distance of this line, then removes middle all points；If conditions above is unsatisfactory for, distance is taken most Big point, initial trace is split into two tracks, repetition above iteration, until completing, wherein effect is rejecting offset point, missed Almost, it is smooth iteration has also been carried out.
- A kind of 3. method for comparing travel paths using string of binary characters according to claim 1, it is characterised in that Path point in step (8) after completion whether in the borderline specific determination methods of rectangle be：By the path after all completions Point screens, and whether the 5th decimal is 0 or 5 for matching, and the 5th decimal is exactly borderline point for 0 or 5, is not otherwise just Borderline point.
- A kind of 4. method for comparing travel paths using string of binary characters according to claim 1, it is characterised in that Between smallest edit distance algorithm in step (13) refers to two word strings, as the minimum editor behaviour needed for one changes into another Make number；The edit operation of license includes a character being substituted for another character, inserts a character, deletes a word Symbol；In general, editing distance is smaller, and the similarity of two strings is bigger.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710850727.2A CN107818131A (en) | 2017-09-20 | 2017-09-20 | A kind of method for comparing travel paths using string of binary characters |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710850727.2A CN107818131A (en) | 2017-09-20 | 2017-09-20 | A kind of method for comparing travel paths using string of binary characters |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107818131A true CN107818131A (en) | 2018-03-20 |
Family
ID=61607717
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710850727.2A Pending CN107818131A (en) | 2017-09-20 | 2017-09-20 | A kind of method for comparing travel paths using string of binary characters |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107818131A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109948711A (en) * | 2019-03-21 | 2019-06-28 | 上海赢科信息技术有限公司 | The method and system of the similar stroke of stroke similarity acquisition methods and equipment, lookup |
| CN113392987A (en) * | 2021-05-07 | 2021-09-14 | 杭州数知梦科技有限公司 | Multi-source data fusion-based bus station position repairing method |
| CN114705214A (en) * | 2022-04-15 | 2022-07-05 | 北京龙驹代驾服务有限公司 | Mileage track calculation method and device, storage medium and electronic equipment |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2000020595A (en) * | 1998-07-01 | 2000-01-21 | Tsubasa System Kk | Journey management system and computer-readable medium having recorded program thereon |
| CN101145218A (en) * | 2007-10-24 | 2008-03-19 | 中山大学 | Road automatic coding system |
| JP4817070B2 (en) * | 2007-01-25 | 2011-11-16 | 日本ビクター株式会社 | Navigation device and navigation method |
| CN103383682A (en) * | 2012-05-01 | 2013-11-06 | 刘龙 | Geographic coding method, and position inquiring system and method |
| CN104182937A (en) * | 2014-08-18 | 2014-12-03 | 中国科学院深圳先进技术研究院 | Method and system for enhancing shape symmetry |
| CN104376084A (en) * | 2014-11-18 | 2015-02-25 | 百度在线网络技术（北京）有限公司 | Method and device for calculating path similarity |
| CN104548597A (en) * | 2014-12-26 | 2015-04-29 | 北京像素软件科技股份有限公司 | Navigation grid automatic-generation method and navigation grid automatic-generation device |
| CN104899317A (en) * | 2015-06-18 | 2015-09-09 | 重庆优跑科技发展有限公司 | Path similarity based service provider selection method and device |
| CN105136158A (en) * | 2008-06-30 | 2015-12-09 | 通腾科技股份有限公司 | An efficient location referencing method |
| CN105184387A (en) * | 2015-07-23 | 2015-12-23 | 北京理工大学 | Path similarity comparison method |
| CN106920387A (en) * | 2015-12-24 | 2017-07-04 | 阿里巴巴集团控股有限公司 | Obtain the method and device of route temperature in traffic route |
| CN107014391A (en) * | 2017-03-28 | 2017-08-04 | 驭势（上海）汽车科技有限公司 | Travel paths planing method, device and electronic equipment |
-
2017
- 2017-09-20 CN CN201710850727.2A patent/CN107818131A/en active Pending
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2000020595A (en) * | 1998-07-01 | 2000-01-21 | Tsubasa System Kk | Journey management system and computer-readable medium having recorded program thereon |
| JP4817070B2 (en) * | 2007-01-25 | 2011-11-16 | 日本ビクター株式会社 | Navigation device and navigation method |
| CN101145218A (en) * | 2007-10-24 | 2008-03-19 | 中山大学 | Road automatic coding system |
| CN105136158A (en) * | 2008-06-30 | 2015-12-09 | 通腾科技股份有限公司 | An efficient location referencing method |
| CN103383682A (en) * | 2012-05-01 | 2013-11-06 | 刘龙 | Geographic coding method, and position inquiring system and method |
| CN104182937A (en) * | 2014-08-18 | 2014-12-03 | 中国科学院深圳先进技术研究院 | Method and system for enhancing shape symmetry |
| CN104376084A (en) * | 2014-11-18 | 2015-02-25 | 百度在线网络技术（北京）有限公司 | Method and device for calculating path similarity |
| CN104548597A (en) * | 2014-12-26 | 2015-04-29 | 北京像素软件科技股份有限公司 | Navigation grid automatic-generation method and navigation grid automatic-generation device |
| CN104899317A (en) * | 2015-06-18 | 2015-09-09 | 重庆优跑科技发展有限公司 | Path similarity based service provider selection method and device |
| CN105184387A (en) * | 2015-07-23 | 2015-12-23 | 北京理工大学 | Path similarity comparison method |
| CN106920387A (en) * | 2015-12-24 | 2017-07-04 | 阿里巴巴集团控股有限公司 | Obtain the method and device of route temperature in traffic route |
| CN107014391A (en) * | 2017-03-28 | 2017-08-04 | 驭势（上海）汽车科技有限公司 | Travel paths planing method, device and electronic equipment |
Non-Patent Citations (1)
| Title |
|---|
| 谭乐怡 等: "基于双重超像素集的快速路径相似度图像分割算法", 《自动化学报》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109948711A (en) * | 2019-03-21 | 2019-06-28 | 上海赢科信息技术有限公司 | The method and system of the similar stroke of stroke similarity acquisition methods and equipment, lookup |
| CN109948711B (en) * | 2019-03-21 | 2023-07-18 | 上海赢科信息技术有限公司 | Stroke similarity acquisition method and equipment, and method and system for searching similar strokes |
| CN113392987A (en) * | 2021-05-07 | 2021-09-14 | 杭州数知梦科技有限公司 | Multi-source data fusion-based bus station position repairing method |
| CN114705214A (en) * | 2022-04-15 | 2022-07-05 | 北京龙驹代驾服务有限公司 | Mileage track calculation method and device, storage medium and electronic equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP0546343B1 (en) | Diagram recognizing system | |
| CN110008872B (en) | Road network extraction method combining vehicle track and remote sensing image | |
| CN107818131A (en) | A kind of method for comparing travel paths using string of binary characters | |
| CN106840175B (en) | Method and device for matching vehicle running track with road network | |
| KR101759858B1 (en) | Edge orientation for second derivative edge detection methods | |
| CN102622370B (en) | Method and device for acquisition of route description and electronic map server | |
| CN103345538B (en) | Based on the railway station yard network topology model modeling method of image recognition | |
| CN110968617B (en) | Road network key road section correlation analysis method based on position field | |
| CN111046049B (en) | Truck GPS track data compression method | |
| CN112232341B (en) | Text detection method, electronic device and computer readable medium | |
| CN104636717B (en) | The method and device of Chart recognition | |
| CN104239910B (en) | Stroke addition recognition method for online handwritten Chinese characters | |
| CN112905578A (en) | Truck GPS track stop point identification method | |
| CN104598887B (en) | Recognition methods for non-canonical format handwritten Chinese address | |
| CN105466434A (en) | Road data reduction and storage method suitable for real-time road condition broadcast | |
| CN106651972A (en) | Binary image coding and decoding methods and devices | |
| CN112801012B (en) | Traffic element processing method and device, electronic equipment and storage medium | |
| CN114332822A (en) | Method and device for determining lane group type and electronic equipment | |
| CN100585623C (en) | Method and system for discriminating handwriting characters | |
| JP4820771B2 (en) | Sign object recognition device, sign object recognition method, and sign object recognition program | |
| JP4884330B2 (en) | Removal target sign recognition device, removal target sign recognition method, and removal target sign recognition program | |
| CN105046217A (en) | Face recognition large data amount concurrency scheme processing method | |
| CN114136333B (en) | Hierarchical feature-based high-precision map road data generation method, device and equipment | |
| JP2002063548A (en) | Handwritten character recognizing method | |
| CN107144863A (en) | A kind of GPS/BD positioning track optimization methods based on cartographic information |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180320 |