CN106197440A - Road data compression method based on angle restriction - Google Patents
Road data compression method based on angle restriction Download PDFInfo
- Publication number
- CN106197440A CN106197440A CN201610482980.2A CN201610482980A CN106197440A CN 106197440 A CN106197440 A CN 106197440A CN 201610482980 A CN201610482980 A CN 201610482980A CN 106197440 A CN106197440 A CN 106197440A
- Authority
- CN
- China
- Prior art keywords
- point
- curve
- discrete point
- angle
- threshold value
- 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
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/28—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network with correlation of data from several navigational instruments
- G01C21/30—Map- or contour-matching
- G01C21/32—Structuring or formatting of map data
Landscapes
- Engineering & Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Automation & Control Theory (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The present invention proposes a kind of road data compression method based on angle restriction, comprises the steps: to set up the discrete point set of curve, determines the starting point and ending point of curve；The vertical threshold value of calculated curve, radially threshold value, angle threshold；Judge whether discrete point retains.The present invention proposes a kind of road data compression method based on angle restriction, this algorithm is improved on the basis of the Douglas Peucker algorithm retrained based on radial distance, Douglas Peucker algorithm based on angle restriction is proposed, by arranging threshold value to angle between two strip sections between road characteristic points, when angle is more than the threshold value set, retain this feature point, otherwise do not retain.Thus reach on the basis of retaining geometry feature as far as possible, reduce geometry feature point, thus reach to reduce the purpose in way section, road, improve the efficiency of path adaptation.
Description
Technical field
The present invention relates to path adaptation technical field, particularly to a kind of road data compression side based on angle restriction
Method.
Background technology
The algorithm related to due to the path adaptation process of vehicle data is complicated, it is big to calculate data volume, therefore to raising
Join the efficiency of algorithm, need to be compressed road data processing before path adaptation.
Road data is the one of curve vector data.Compression for curve vector data is GIS-Geographic Information System, meter
A FAQs in the subjects such as calculation machine autodraft and computer graphics.Compression to curve vector data processes and can divide
For lossless compress and lossy compression method two kinds.Lossless compress is in the case of some ordered sets N ensureing curve is constant, reduces N institute
The memory space taken.The lossless compression algorithm of curve vector data is broadly divided into two kinds i.e. LZW method and utilizes vector data special
Levy and express the method limiting change data word length of precision.
The ultimate principle of lossy compression method is that some ordered sets N to constituent curve extracts, and obtains new some sequence
Collection N ', and this subset N ' is as a new information source, in the accuracy rating specified, should reflect former from content as much as possible
Point ordered sets, simplifies in characteristic point quantity the most as far as possible.It is at present ripe that to damage Vector data compress methods algorithm main
Have: Douglas-Peucker (DP) algorithm, utilize the hanging down away from limit value method, the James method, little that utilizes angle restriction of distance restraint
Ripple compression method and light hurdle method.Additionally, yellow proposing on the basis of Douglas-Peucker algorithm of training has forecast function
Curve vector data compression method.
Douglas Pu Kefa (Dogulas-Peucker algorithm) is a kind of generally acknowledged effective Vector data compress methods side
Method, can utilize recursive procedure to realize this algorithm the most compactly in programming, and the time that can reach O (nlogn) is complicated
Degree.The shortcoming of Douglas-Peucker algorithm is: (1) may change it after compressing the linear ground object with common edge and open up
Flutter relation；(2) when curve starting point is uncertain, starting compression from different starting points, the result obtained may be different；(3) to curved
When bent more curve carries out abbreviation, there is compression degree and the contradiction retained between curvature Variation point.
Such as the patent of invention of Chinese patent CN 104165630 A, this invention provides a kind of path adaptation based on discrete point
Method and path adaptation device, but, when this invention carries out abbreviation to the curve that degree of crook is bigger, there is compression degree and guarantor
Stay the contradictory problems between curvature Variation point.
Summary of the invention
The purpose of the present invention is intended at least solve one of described technological deficiency.
To this end, it is an object of the invention to propose the road data pressure based on angle restriction that a kind of path adaptation efficiency is high
Compression method.
To achieve these goals, the present invention provides a kind of road data compression method based on angle restriction, including such as
Lower step:
Step S1, sets up the discrete point set of curve, determines the starting point and ending point of curve；
Step S2, the vertical threshold value of calculated curve, radially threshold value, angle threshold；
Step S3, if the hanging down away from the little of section that is directly connected to starting point and ending point of the discrete point in discrete point set
In the vertical threshold value of curve, then perform step S4, otherwise, the most do not retain this discrete point；
Step S4, if this discrete point to the radial distance of terminating point more than radially threshold value, then perform step S5；Otherwise,
The most do not retain this discrete point；
Step S5, if the discrete point in discrete point set is directly connected to the section of terminating point with starting point and ending point
Section between angle more than angle threshold, then section retains this discrete point after compression, and counts point set after curve compression
Close；Otherwise do not retain, and be not counted in some set after curve compression.
Step S6, when all curves are all disposed, the discrete point in point is gathered after being sequentially connected with curve compression, institute's shape
The broken line become, is curve of approximation after the compression of curve.
Further, in step sl, the discrete point set P of curve is
P={Pi|(xi,yi)},i∈1,2...,n
Wherein, n is the discrete point quantity in discrete point set P, xiIt is discrete point PiAbscissa, yiIt is discrete point Pi's
Vertical coordinate, P1For the starting point of curve, it is designated as an A, PnFor the terminating point of curve, it is designated as a B.
Further, in step s 2, the vertical threshold value of curve is D, and radially threshold value is r, and angle threshold is Θ；
Then, Θ=arcsin (D/r)
Wherein D is off-line section on curveFarthest characteristic point C is to line segmentHang down away from, r is characterized a C to terminating point
The distance of B, Θ is ∠ CBA.
Further, in step s3, if discrete point PiTo line segmentHang down away from diLess than vertical threshold value D of curve,
Then perform step S4, otherwise, the most do not retain this discrete point Pi。
Further, in step s 4, if discrete point PiRadial distance r to terminating point BiMore than radially threshold value r, then
Perform step S5；Otherwise, the most do not retain this discrete point Pi。
Further, in step s 5, if discrete point PiTo line segmentBetween angle more than angle threshold Θ, then
Section retains this discrete point P after compressioni, and count some set P ' after curve compression；Otherwise do not retain, and be not counted in curve
Point set P ' after compression.
The present invention proposes a kind of road data compression method based on angle restriction, and this algorithm is retraining based on radial distance
Douglas-Peucker algorithm on the basis of improved, propose Douglas-Peucker based on angle restriction calculate
Method, by arranging threshold value to angle between two strip sections between road characteristic points, when angle is more than the threshold value set, retains
This feature point, on the contrary do not retain.Thus reach, on the basis of retaining geometry feature, to reduce geometry feature as far as possible
Point, thus reach to reduce the purpose in way section, road, improve the efficiency of path adaptation, solve in compression degree and reservation curvature
Contradiction between variation characteristic point.
Aspect and advantage that the present invention adds will part be given in the following description, and part will become from the following description
Obtain substantially, or recognized by the practice of the present invention.
Accompanying drawing explanation
Above-mentioned and/or the additional aspect of the present invention and advantage are from combining the accompanying drawings below description to embodiment and will become
Substantially with easy to understand, wherein:
Fig. 1 is Douglas-Peucker algorithm schematic diagram based on radial distance constraint of the prior art；
Fig. 2 a-2d is in the case of selecting different radial distances, the compression process figure to same vector curve；
Fig. 3 a-3b is characteristic point and the relation schematic diagram of end points spacing after compression；
Fig. 4 is the Douglas-Peucker algorithm schematic diagram based on angle restriction of the present invention；
Fig. 5 is the flow chart of the present invention；
Fig. 6 be the present invention compression before roadway characteristic count the comparison diagram with geometric properties；
Fig. 7 be the present invention compression after roadway characteristic count the comparison diagram with geometric properties.
Detailed description of the invention
Embodiments of the invention are described below in detail, and the example of described embodiment is shown in the drawings, the most from start to finish
Same or similar label represents same or similar element or has the element of same or like function.Below with reference to attached
The embodiment that figure describes is exemplary, it is intended to is used for explaining the present invention, and is not considered as limiting the invention.
The present invention provides a kind of road data compression method based on angle restriction, with reference to accompanying drawing 5, comprises the steps:
Step S1, sets up the discrete point set of curve, determines the starting point and ending point of curve；
The discrete point set P of curve is:
P={Pi|(xi,yi), i ∈ 1,2..., n, (1)
Wherein, n is the discrete point quantity in discrete point set P, xiIt is discrete point PiAbscissa, yiIt is discrete point Pi's
Vertical coordinate, P1For the starting point of curve, it is designated as an A, PnFor the terminating point of curve, it is designated as a B.
Step S2, the vertical threshold value of calculated curve, radially threshold value, angle threshold；
If the vertical threshold value of curve is D, radially threshold value is r, and angle threshold is Θ；
Then, Θ=arcsin (D/r)
Wherein D is off-line section on curveFarthest characteristic point C is to line segmentHang down away from, r is characterized a C to terminating point
The distance of B, Θ is ∠ CBA.
Step S3, if the hanging down away from the little of section that is directly connected to starting point and ending point of the discrete point in discrete point set
In the vertical threshold value of curve, then perform step S4, otherwise, the most do not retain this discrete point；
If that is, discrete point PiTo line segmentHang down away from diLess than vertical threshold value D of curve, then perform step S4, otherwise,
The most do not retain this discrete point Pi。
Step S4, if this discrete point to the radial distance of terminating point more than radially threshold value, then perform step S5；Otherwise,
The most do not retain this discrete point；
If that is, discrete point PiRadial distance r to terminating point BiMore than radially threshold value r, then perform step S5；Otherwise, then
Do not retain this discrete point Pi。
Step S5, if the discrete point in discrete point set is directly connected to the section of terminating point with starting point and ending point
Section between angle more than angle threshold, then section retains this discrete point after compression, and counts point set after curve compression
Close；Otherwise do not retain, and be not counted in some set after curve compression.
If that is, discrete point PiTo line segmentBetween angle more than angle threshold Θ, then section retains this after compression
Discrete point Pi, and count some set P ' after curve compression；Otherwise do not retain, and be not counted in some set P ' after curve compression.
Step S6, when all curves are all disposed, the discrete point in point is gathered after being sequentially connected with curve compression, institute's shape
The broken line become, is curve of approximation after the compression of curve.
Fig. 1 is Douglas-Peucker algorithm schematic diagram based on radial distance constraint.Generally this algorithm is to extracting curve
Length of span is more effective, but in the case of curve shape complexity, calculates without selecting suitable radial distance to be compressed.
Fig. 2 a-2d is in the case of selecting different radial distances, the compression process figure to same vector curve.
In Fig. 2 a, middle ABCDE is primitive curve, sub-sectionD is characterized a C and arrivesDistance, r1Represent
Sub-sectionLength,WithLength equal be designated as r2.It can be seen that institute is a little away from end in primitive curve
Hanging down away from total vertical distance d less than curve of point, the most only needs to account for radial distance.Fig. 2 b, Fig. 2 c, Fig. 2 d are respectively
Give radially threshold value and be more than r2, less than or equal to r2More than r1, less than or equal to r1In the case of, primitive curve is carried out radial constraint
The effect of compression algorithm.
Fig. 3 a-3b is characteristic point and the relation schematic diagram of end points spacing after compression.
In a practical situation, when by compression curve two-end-point distant time, Douglas-based on radial constraint
Peucker algorithm has preferable effect to the geometric properties keeping curve, in the case of curve two-end-point is close together, and effect
Poor.
Fig. 3 a and Fig. 3 b gives radial distance threshold value asynchronous situation, according to Douglas-based on radial constraint
Peucker algorithm, when road segment end is positioned at B1Time, road section length is less than radial distance threshold value, and P point is cast out；Terminal is positioned at B2
Time, section distance is retained more than radial distance threshold value, P point；And in actual path adaptation processes, need section angle
The feature changed greatly retains, and is i.e. positioned at B when terminal1Retain P point after compression.
For solving problems, the present invention uses for reference Douglas-Peucker algorithm based on radial distance constraint, proposes base
Douglas-Peucker algorithm in angle restriction.As it is shown on figure 3, sectionWithAngle more than angle threshold θ0Time,
Section retention point P after compression, on the contrary do not retain.
Owing to the some ordered sets of road segmental arc is ordered set, therefore permissible for the walking direction problem in angle calculation
Solve with azimuth.
Present invention Douglas-Peucker based on angle restriction algorithm flow is as follows:
Table 1 Douglas-Peucker based on angle restriction algorithm flow
With Douglas-Peucker algorithm based on angle restriction, the curve in Fig. 1 is processed, as shown in Figure 4, if
Radial direction threshold value during compression is r2, vertical threshold value is d, then angle threshold can be set to arcsin (d/r2), in Fig. 4 it can be seen that with
Compression algorithm based on radial distance is compared, and the result of compression algorithm based on angle restriction more can be retained the several of curve
What feature.Fig. 6 and Fig. 7 be the present invention compression before and after roadway characteristic count the comparison diagram with geometric properties.
The present invention proposes a kind of road data compression method based on angle restriction, and this algorithm is retraining based on radial distance
Douglas-Peucker algorithm on the basis of improved, propose Douglas-Peucker based on angle restriction calculate
Method, by arranging threshold value to angle between two strip sections between road characteristic points, when angle is more than the threshold value set, retains
This feature point, on the contrary do not retain.Thus reach, on the basis of retaining geometry feature, to reduce geometry feature as far as possible
Point, thus reach to reduce the purpose in way section, road, improve the efficiency of path adaptation.
In the case of the present invention can be basically unchanged ensureing geometry feature, it is achieved the pressure to road data characteristic point
Contracting, reduces the sub-section quantity participating in matching treatment, solves the lance between compression degree and reservation curvature Variation point
Shield.
Although above it has been shown and described that embodiments of the invention, it is to be understood that above-described embodiment is example
Property, it is impossible to be interpreted as limitation of the present invention, those of ordinary skill in the art is without departing from the principle of the present invention and objective
In the case of above-described embodiment can be changed within the scope of the invention, revise, replace and modification.The scope of the present invention
Extremely it is equal to by claims and limits.
Claims (6)
1. a road data compression method based on angle restriction, it is characterised in that comprise the steps:
Step S1, sets up the discrete point set of curve, determines the starting point and ending point of curve；
Step S2, the vertical threshold value of calculated curve, radially threshold value, angle threshold；
Step S3, if the hanging down away from less than song of the section that is directly connected to starting point and ending point of the discrete point in discrete point set
The vertical threshold value of line, then perform step S4, otherwise, the most do not retain this discrete point；
Step S4, if this discrete point to the radial distance of terminating point more than radially threshold value, then perform step S5；Otherwise, the most not
Retain this discrete point；
Step S5, if the road that the discrete point in discrete point set is directly connected to the section of terminating point with starting point and ending point
Angle between Duan is more than angle threshold, then section retains this discrete point after compression, and counts some set after curve compression；Instead
Do not retain, and be not counted in some set after curve compression.
Step S6, when all curves are all disposed, the discrete point in point is gathered after being sequentially connected with curve compression, formed
Broken line, is curve of approximation after the compression of curve.
A kind of road data compression method based on angle restriction, it is characterised in that: in step S1
In, the discrete point set P of curve is
P={Pi|(xi, yi), i ∈ 1,2..., n
Wherein, n is the discrete point quantity in discrete point set P, xiIt is discrete point PiAbscissa, yiIt is discrete point PiVertical seat
Mark, P1For the starting point of curve, it is designated as an A, PnFor the terminating point of curve, it is designated as a B.
A kind of road data compression method based on angle restriction, it is characterised in that: in step S2
In, the vertical threshold value of curve is D, and radially threshold value is r, and angle threshold is Θ；
Then, Θ=arcsin (D/r)
Wherein D is off-line section on curveFarthest characteristic point C is to line segmentHang down away from, r be characterized a C to terminating point B away from
From, Θ is ∠ CBA.
A kind of road data compression method based on angle restriction, it is characterised in that: in step S3
In, if discrete point PiTo line segmentHang down away from diLess than vertical threshold value D of curve, then perform step S4, otherwise, do not retain
This discrete point Pi。
A kind of road data compression method based on angle restriction, it is characterised in that: in step S4
In, if discrete point PiRadial distance r to terminating point BiMore than radially threshold value r, then perform step S5；Otherwise, the most do not retain this
Discrete point Pi。
A kind of road data compression method based on angle restriction, it is characterised in that: in step S5
In, if discrete point PiTo line segmentBetween angle more than angle threshold Θ, then section retains this discrete point P after compressioni,
And count some set P ' after curve compression；Otherwise do not retain, and be not counted in some set P ' after curve compression.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610482980.2A CN106197440A (en) | 2016-06-27 | 2016-06-27 | Road data compression method based on angle restriction |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610482980.2A CN106197440A (en) | 2016-06-27 | 2016-06-27 | Road data compression method based on angle restriction |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106197440A true CN106197440A (en) | 2016-12-07 |
Family
ID=57460898
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610482980.2A Pending CN106197440A (en) | 2016-06-27 | 2016-06-27 | Road data compression method based on angle restriction |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106197440A (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106874919A (en) * | 2017-03-16 | 2017-06-20 | 广东工业大学 | A kind of method and apparatus for determining ship hull plate angle point |
| CN107222217A (en) * | 2017-05-26 | 2017-09-29 | 中国神华能源股份有限公司 | Data compression method and device |
| CN108469263A (en) * | 2018-03-07 | 2018-08-31 | 武汉中海庭数据技术有限公司 | A kind of method and system carrying out form point optimization based on curvature |
| EP3385673A1 (en) * | 2017-04-07 | 2018-10-10 | Continental Automotive GmbH | Method and device for the reduction of intermediate points in a polygon |
| CN110477906A (en) * | 2019-08-26 | 2019-11-22 | 电子科技大学 | A kind of electrocardiosignal QRS complex start-stop independent positioning method |
| CN110849366A (en) * | 2018-08-20 | 2020-02-28 | 广州弘度信息科技有限公司 | Navigation method and system based on fusion of vision and laser radar |
| CN111159321A (en) * | 2019-12-13 | 2020-05-15 | 智慧航海（青岛）科技有限公司 | Ship track data screening method and device |
| CN113390425A (en) * | 2020-03-13 | 2021-09-14 | 北京四维图新科技股份有限公司 | Map data processing method, map data processing device, map data processing equipment and storage medium |
| CN116505953A (en) * | 2023-06-30 | 2023-07-28 | 湖南腾琨信息科技有限公司 | Mass map data optimization compression processing method based on BIM and GIS |
| CN117553777A (en) * | 2024-01-12 | 2024-02-13 | 航天宏图信息技术股份有限公司 | Intelligent sparse and dense curve discrete folding line method, device and equipment for high-precision navigation chart |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1806266A (en) * | 2003-06-11 | 2006-07-19 | 松下电器产业株式会社 | Digital map position information compressing method and device |
| CN104467866A (en) * | 2014-10-14 | 2015-03-25 | 福建师范大学 | Angle-based track data compression method and device |
-
2016
- 2016-06-27 CN CN201610482980.2A patent/CN106197440A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1806266A (en) * | 2003-06-11 | 2006-07-19 | 松下电器产业株式会社 | Digital map position information compressing method and device |
| CN104467866A (en) * | 2014-10-14 | 2015-03-25 | 福建师范大学 | Angle-based track data compression method and device |
Non-Patent Citations (2)
| Title |
|---|
| 余洋: ""云计算环境下的大样本浮动车数据处理关键技术研究"", 《中国博士学位论文全文数据库 基础科学辑》 * |
| 杨得志: ""矢量数据压缩的Douglas- Peuck er算法的实现与改进"", 《测绘通报》 * |
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106874919A (en) * | 2017-03-16 | 2017-06-20 | 广东工业大学 | A kind of method and apparatus for determining ship hull plate angle point |
| US11226205B2 (en) | 2017-04-07 | 2022-01-18 | Continental Automotive Gmbh | Method and device for reducing intermediate points in a polygon |
| EP3385673A1 (en) * | 2017-04-07 | 2018-10-10 | Continental Automotive GmbH | Method and device for the reduction of intermediate points in a polygon |
| WO2018184952A1 (en) * | 2017-04-07 | 2018-10-11 | Continental Automotive Gmbh | Method and device for reducing intermediate points in a polygon |
| CN107222217A (en) * | 2017-05-26 | 2017-09-29 | 中国神华能源股份有限公司 | Data compression method and device |
| CN108469263B (en) * | 2018-03-07 | 2020-07-24 | 武汉中海庭数据技术有限公司 | Method and system for shape point optimization based on curvature |
| CN108469263A (en) * | 2018-03-07 | 2018-08-31 | 武汉中海庭数据技术有限公司 | A kind of method and system carrying out form point optimization based on curvature |
| CN110849366A (en) * | 2018-08-20 | 2020-02-28 | 广州弘度信息科技有限公司 | Navigation method and system based on fusion of vision and laser radar |
| CN110477906A (en) * | 2019-08-26 | 2019-11-22 | 电子科技大学 | A kind of electrocardiosignal QRS complex start-stop independent positioning method |
| CN110477906B (en) * | 2019-08-26 | 2021-11-26 | 电子科技大学 | Electrocardiosignal QRS wave start and stop point positioning method |
| CN111159321A (en) * | 2019-12-13 | 2020-05-15 | 智慧航海（青岛）科技有限公司 | Ship track data screening method and device |
| CN113390425A (en) * | 2020-03-13 | 2021-09-14 | 北京四维图新科技股份有限公司 | Map data processing method, map data processing device, map data processing equipment and storage medium |
| CN113390425B (en) * | 2020-03-13 | 2023-11-21 | 北京四维图新科技股份有限公司 | Map data processing method, device, equipment and storage medium |
| CN116505953A (en) * | 2023-06-30 | 2023-07-28 | 湖南腾琨信息科技有限公司 | Mass map data optimization compression processing method based on BIM and GIS |
| CN116505953B (en) * | 2023-06-30 | 2023-09-08 | 湖南腾琨信息科技有限公司 | Mass map data optimization compression processing method based on BIM and GIS |
| CN117553777A (en) * | 2024-01-12 | 2024-02-13 | 航天宏图信息技术股份有限公司 | Intelligent sparse and dense curve discrete folding line method, device and equipment for high-precision navigation chart |
| CN117553777B (en) * | 2024-01-12 | 2024-04-05 | 航天宏图信息技术股份有限公司 | Intelligent sparse and dense curve discrete folding line method, device and equipment for high-precision navigation chart |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106197440A (en) | Road data compression method based on angle restriction | |
| CN101894548B (en) | Modeling method and modeling device for language identification | |
| WO2016115940A1 (en) | Fingerprint information dynamic updating method and fingerprint recognition apparatus | |
| US20110299737A1 (en) | Vision-based hand movement recognition system and method thereof | |
| CN106980870B (en) | Method for calculating text matching degree between short texts | |
| CN109977668B (en) | Malicious code query method and system | |
| CN108875629B (en) | Palm vein identification method based on multi-sample feature fusion | |
| CN111327949A (en) | Video time sequence action detection method, device, equipment and storage medium | |
| CN104778442A (en) | Automatic cutting and counting method for fluorescent microscopic images of retinal cells | |
| CN109841264B (en) | Sequence comparison filtering processing method, system and device and readable storage medium | |
| CN111143442A (en) | Time series symbol aggregation approximate representation method fusing trend characteristics | |
| CN106777980A (en) | A kind of Time Series Similarity Forecasting Methodology based on DTW | |
| WO2010013863A1 (en) | Method of detecting character string pattern at high speed using layered shift tables | |
| KR101296734B1 (en) | Method for object segmentation by combination of gaussian mixture model and rgb clustering | |
| CN113128582B (en) | Matrix Profile-based time sequence variable-length die body mining method | |
| KR20190094881A (en) | System of recognizing a continuous gesture | |
| US9740720B2 (en) | Secure and lossless data compression | |
| Dehkordi et al. | Iris code matching using adaptive Hamming distance | |
| JPWO2017038695A1 (en) | Image processing apparatus, image processing method, and program | |
| CN103336963A (en) | Method and device for image feature extraction | |
| CN107944146A (en) | Polynary hydrology Time Series Matching model building method based on principal component analysis | |
| CN104598873A (en) | Three-dimensional face recognition method of door lock | |
| CN103208003A (en) | Geometric graphic feature point-based method for establishing shape descriptor | |
| CN111369595A (en) | Optical flow calculation method based on self-adaptive correlation convolution neural network | |
| CN110196964A (en) | The conversion method and equipment of font format |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into 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: 20161207 |