CN109740532A - A kind of Path Recognition and middle line optimization method based on annulus road - Google Patents
A kind of Path Recognition and middle line optimization method based on annulus road Download PDFInfo
- Publication number
- CN109740532A CN109740532A CN201811653805.0A CN201811653805A CN109740532A CN 109740532 A CN109740532 A CN 109740532A CN 201811653805 A CN201811653805 A CN 201811653805A CN 109740532 A CN109740532 A CN 109740532A
- Authority
- CN
- China
- Prior art keywords
- road
- point
- sideline
- annulus
- line
- 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.)
- Granted
Links
Landscapes
- Image Analysis (AREA)
- Image Processing (AREA)
Abstract
The invention discloses a kind of Path Recognition based on annulus road and middle line optimization methods, include the following steps: step S1, obtain the gray level image of annulus road；Step S2 chooses optimal threshold using Otsu algorithm, obtains best pixel point and be 0xff or be the binary image of 0x00；Step S3 determines image highway sideline using edge hunting method to binary image；Step S4 extracts the sideline feature of road in binary image, determines whether annulus, if annulus, is then optimized to sideline using once linear interpolation method, the secondary sideline after being optimized, to obtain first time road axis；Step S5 optimizes first time road axis, obtains second of road axis, i.e., final road axis.The present invention carries out identification comparison to annulus road image feature, can accurately identify annulus road, and the road Path Recognition of precise and high efficiency has far-reaching significance unpiloted development in this method.
Description
Technical field
The invention belongs to mode identification technologies, and in particular to a kind of Path Recognition and middle line based on annulus road are excellent
Change method.
Background technique
In recent years, unmanned by social institute's extensive concern.In unmanned, the Path Recognition of road is one again
A very important part.And in the prior art when passing through annulus road during unmanned due to the deficiency of algorithm, nothing
People drives and is easy to judge that traffic accident occurs in inaccuracy due to road conditions, in the image based on Path Recognition, needs pair
Mass data is calculated and is analyzed.
Summary of the invention
It is an object of the invention to overcome the deficiencies of the prior art and provide a kind of Path Recognition based on annulus road and
Middle line optimization method is capable of the identification annulus of precise and high efficiency and is optimized to center line, to obtain better center line
Diameter.
In order to solve the above technical problems, the present invention provides a kind of Path Recognition based on annulus road and middle line optimization sides
Method, characterized in that include the following steps:
Step S1 obtains the gray level image of annulus road；
Step S2 chooses optimal threshold using Otsu algorithm, obtains best pixel point and be 0xff or be the two-value of 0x00
Change image；
Step S3 determines road image sideline using edge hunting method to binary image；
Step S4 extracts the sideline feature of road in binary image, determines whether road is annulus, if annulus, then
Highway sideline is optimized using once linear interpolation method, the secondary highway sideline after being optimized, to obtain first time road
Center line；
Step S5 optimizes first time road axis, second of road axis of acquisition, i.e., in final road
Heart line.
Further, the process of optimal threshold is chosen in step s 2 are as follows:
Note M=256 single channel tonal gradation, Sum=sum of all pixels,
Background pixel accountingWherein N1For background pixel number；
Foreground pixel accountingIn formula, N2For preceding pixel number；
The average gray value of background
In formula, PiFor probability, C1For pixel background；
The average gray value of prospect
In formula, PiFor probability, C2For pixel prospect；
It can to sum up obtain, the gray scale accumulated value u=u of 0-M gray scale interval1*ω1+u2*ω2,
Then inter-class variance
G=ω1*(u-u1)2+ω2*(u-u2)2=ω1*ω2*(u1-u2)2,
Take inter-class variance g maximum, gray value at this time is optimal threshold.
Preferentially, the process in road image sideline is determined with edge hunting method in step s3 are as follows:
Since the d row of the binary image of road, initial d=1, from the left edge of entire binary image in
Between the jump that successively determines whether 0xff to 0x00 occur if having will indicate the d of the binary image of the road found
Capable sideline trip point is considered as the starting point of left side bearing, is denoted as a1；Successively from the right hand edge of entire binary image to centre
The jump for determining whether 0xff to 0x00 occur jumps the sideline of the d row of the binary image of the road found if having
Height is considered as the starting point of right side bearing, is denoted as b1；If failing in the d row of the binary image of road finds a1,b1,
Then the d line number value of the binary image of road increases by 1 i.e. d=d+1, by the left edge of the d row of the binary image of road
The jump for successively determining whether 0xff to 0x00 occur to centre respectively with right hand edge repeats this step until finding a1,b1；
Setting range x, in a1The trip point that next line is looked within the scope of ± x is denoted as a2, then in a2It is sought in the range of ± x
The trip point of next line is looked for be denoted as a3, and so in anUntil finding all trip point a in ± xn, n is positive integer, is owned
Trip point anLine is left side bearing；In b1The trip point that next line is looked within the scope of ± x is denoted as b2, then in b2The model of ± x
It encloses the interior trip point for finding next line and is denoted as b3, and so on until in all bnAll trip point b are found in ± xn, n is
Positive integer, all trip point bnLine is right side bearing, and the coordinate of the i-th left side bearing of note is (i, Li), remember the seat of the i-th right side bearing
It is designated as (i, Ri)；
After obtaining all sidelines, left side bearing and right side bearing are optimized, if certain a line left side bearing exists and phase
The edge-stitching point ordinate of adjacent two row left side bearings is apart greater than definite value e, then is considered as the row sideline and noise occur, take the row side at this time
The adjacent rows left side bearing point ordinate average value of line is as the row sideline point, as road image left side bearing；If certain a line
Right side bearing, which exists, is apart greater than definite value e with the edge-stitching point ordinate of adjacent rows right side bearing, then is considered as the row sideline and makes an uproar
Point, takes the adjacent rows right side bearing point ordinate average value in the row sideline as the row sideline point at this time, and as road image is right
Sideline.
Preferentially, determining the process of annulus in step s 4 is:
Process 1 takes the sideline of the lower half portion of binary image in step S3, and the coordinate in all sidelines is averaged
To a line segment；The slope of a line segment is obtained by common least square method, extends to obtain by a line segment according to this slope
One new straight line, coordinate are denoted as (i, Mi), using new straight line as annulus Preliminary Identification line, this identification line needs to meet:
Li< Mi< Ri
It is considered as if the pixel jump that adjacent rows occurs in identification line and finds annulus, remembers that the point is Ring；
Process 2 arranges to scanning by edge hunting method on the basis of finding point Ring and obtains a new edge line,
Note coordinate is (Yj), when ordinate is maximized, recording the point is R (Ymax,jmax), the sideline feature is examined, if the side
Line meets condition:
Then it is determined as annulus；
Process 3 is then needed to optimize processing to the highway sideline part of annulus, be found respectively if being determined as annulus
The inflection point A of the whole image road left side bearing and inflection point B of right side bearing, inflection point A and inflection point B, that is, left side bearing are without extreme point and right side bearing
Without extreme point, if the left side bearing and right side bearing in whole image road find multiple no extreme points respectively, left and right sideline is taken most
Two of close ring part are respectively seen as inflection point A and inflection point B without extreme point；Inflection point A and 2 midpoint R of process is utilized into primary line
Property interpolation method be connected to new sideline, not connected sideline is constant, similarly tie point B and point R, two secondary sides after being optimized
Line, and then obtain first time road axis.
Process 4 mends line process and repeats the above process 3 at annulus outlet.
Preferentially, inflection point A, inflection point B and the process of the point R in process 2 are connected in process 3 is:
If A (x1,y1), R (Ymax,jmax), interpolation point (x, y), then interpolation algorithm are as follows:
Similarly connection inflection point B and point R
Preferentially, in step s 5, road axis is optimized by common least square method, and final road axis is
Calculation formula are as follows:
。
Preferentially, the part of the adjacent left and right sides road where sideline, that is, camera of the lower half portion of binary image
Image takes and is equal to the highly long part of image 1/4.
The utility model has the advantages that
The present invention is identified and is compared to annulus road image feature, can accurately identify annulus road, solve nobody
The problem of annulus road is multiple accident point in driving procedure, the road Path Recognition of the method for the present invention precise and high efficiency drives nobody
The development sailed has far-reaching significance, and has made contribution outstanding to this unmanned technical field；The present invention is using primary
Linear interpolation algorithm carries out secondary treatment to annulus road image sideline, effectively optimizes median path.
Detailed description of the invention
Fig. 1 is flow chart of the invention.
Specific embodiment
The invention will be further described below in conjunction with the accompanying drawings.Following embodiment is only used for clearly illustrating the present invention
Technical solution, and not intended to limit the protection scope of the present invention.
The present invention is based on binary image, a kind of Path Recognition based on annulus road and middle line optimization method are provided,
It is characterized in that including the following steps:
Step S1 obtains the gray level image of annulus road；
Step S2 chooses optimal threshold using Otsu algorithm, obtains best pixel point and be 0xff or be the two-value of 0x00
Change image；
Step S3 determines road image sideline using edge hunting method to binary image；
Step S4 extracts the sideline feature of road in binary image, determines whether road is annulus, if annulus, then
Highway sideline is optimized using once linear interpolation method, the secondary highway sideline after being optimized, to obtain first time road
Center line；
Step S5 optimizes first time road axis, second of road axis of acquisition, i.e., in final road
Heart line.
Further, the process of optimal threshold is chosen in step s 2 are as follows:
Note M=256 single channel tonal gradation, Sum=sum of all pixels,
Background pixel accountingWherein N1For background pixel number；
Foreground pixel accountingIn formula, N2For preceding pixel number；
The average gray value of background
In formula, PiFor probability, C1For pixel background；
The average gray value of prospect
In formula, PiFor probability, C2For pixel prospect；
It can to sum up obtain, the gray scale accumulated value u=u of 0-M gray scale interval1*ω1+u2*ω2,
Then inter-class variance
G=ω1*(u-u1)2+ω2*(u-u2)2=ω1*ω2*(u1-u2)2,
Take inter-class variance g maximum, gray value at this time is optimal threshold.
Further, the process in road image sideline is determined with edge hunting method in step s3 are as follows:
Since the d row of the binary image of road, initial d=1, from the left edge of entire binary image in
Between the jump that successively determines whether 0xff to 0x00 occur if having will indicate the d of the binary image of the road found
Capable sideline trip point is considered as the starting point of left side bearing, is denoted as a1；Successively from the right hand edge of entire binary image to centre
The jump for determining whether 0xff to 0x00 occur jumps the sideline of the d row of the binary image of the road found if having
Height is considered as the starting point of right side bearing, is denoted as b1；If failing in the d row of the binary image of road finds a1, b1,
Then the d line number value of the binary image of road increases by 1 i.e. d=d+1, by the left edge of the d row of the binary image of road
The jump for successively determining whether 0xff to 0x00 occur to centre respectively with right hand edge repeats this step until finding a1,b1；
Setting range x, in a1The trip point that next line is looked within the scope of ± x is denoted as a2, then in a2It is sought in the range of ± x
The trip point of next line is looked for be denoted as a3, and so in anUntil finding all trip point a in ± xn, n is positive integer, is owned
Trip point anLine is left side bearing；In b1The trip point that next line is looked within the scope of ± x is denoted as b2, then in b2The model of ± x
It encloses the interior trip point for finding next line and is denoted as b3, and so on until in all bnAll trip point b are found in ± xn, n is
Positive integer, all trip point bnLine is right side bearing, and the coordinate of the i-th left side bearing of note is (i, Li), remember the seat of the i-th right side bearing
It is designated as (i, Ri)；
After obtaining all sidelines, left side bearing and right side bearing are optimized, if certain a line left side bearing exists and phase
The edge-stitching point ordinate of adjacent two row left side bearings is apart greater than definite value e, then is considered as the row sideline and noise occur, take the row side at this time
The adjacent rows left side bearing point ordinate average value of line is as the row sideline point, as road image left side bearing；If certain a line
Right side bearing, which exists, is apart greater than definite value e with the edge-stitching point ordinate of adjacent rows right side bearing, then is considered as the row sideline and makes an uproar
Point, takes the adjacent rows right side bearing point ordinate average value in the row sideline as the row sideline point at this time, and as road image is right
Sideline.
Further, determining the process of annulus in step s 4 is:
Process 1 takes the sideline of the lower half portion of binary image in step S3, and the coordinate in all sidelines is averaged
To a line segment；The slope of a line segment is obtained by common least square method, extends to obtain by a line segment according to this slope
One new straight line, coordinate are denoted as (i, Mi), using new straight line as annulus Preliminary Identification line, this identification line needs to meet:
Li< Mi< Ri
It is considered as if the pixel jump that adjacent rows occurs in identification line and finds annulus, remembers that the point is Ring；
Process 2 arranges to scanning by edge hunting method on the basis of finding point Ring and obtains a new edge line,
Note coordinate is (Yj), when ordinate is maximized, recording the point is R (Ymax,jmax), the sideline feature is examined, if the side
Line meets condition:
Then it is determined as annulus；
Process 3 is then needed to optimize processing to the highway sideline part of annulus, be found respectively if being determined as annulus
The inflection point A of the whole image road left side bearing and inflection point B of right side bearing, inflection point A and inflection point B, that is, left side bearing are without extreme point and right side bearing
Without extreme point, if the left side bearing and right side bearing in whole image road find multiple no extreme points respectively, left and right sideline is taken most
Two of close ring part are respectively seen as inflection point A and inflection point B without extreme point；Inflection point A and 2 midpoint R of process is utilized into primary line
Property interpolation method be connected to new sideline, not connected sideline is constant, similarly tie point B and point R, two secondary sides after being optimized
Line, and then obtain first time road axis.
Process 4 mends line process and repeats the above process 3 at annulus outlet.
Further, inflection point A, inflection point B and the process of the point R in process 2 are connected in process 3 is:
If A (x1,y1), R (Ymax,jmax), interpolation point (x, y), then interpolation algorithm are as follows:
Similarly connection inflection point B and point R
Further, in step s 5, road axis is optimized by common least square method, final road axis
For calculation formula are as follows:
。
Further, the portion of the adjacent left and right sides road where sideline, that is, camera of the lower half portion of binary image
Partial image takes and is equal to the highly long part of image 1/4.
The above is only a preferred embodiment of the present invention, it is noted that for the ordinary skill people of the art
For member, without departing from the technical principles of the invention, several improvement and deformations can also be made, these improvement and deformations
Also it should be regarded as protection scope of the present invention.
Claims (7)
1. a kind of Path Recognition and middle line optimization method based on annulus road, characterized in that include the following steps:
Step S1 obtains the gray level image of annulus road；
Step S2 chooses optimal threshold using Otsu algorithm, obtains best pixel point and be 0xff or be the binary picture of 0x00
Picture；
Step S3 determines road image sideline using edge hunting method to binary image；
Step S4 extracts the sideline feature of road in binary image, determines whether road is annulus, if annulus, the road Ze Dui
Kerb line is optimized using once linear interpolation method, the secondary highway sideline after being optimized, to obtain first time road-center
Line；
Step S5 optimizes first time road axis, obtains second of road axis, i.e., final road-center
Line.
2. a kind of Path Recognition and middle line optimization method based on annulus road according to claim 1, characterized in that
The process of optimal threshold is chosen in step S2 are as follows:
Note M=256 single channel tonal gradation, Sum=sum of all pixels,
Background pixel accountingWherein N1For background pixel number；
Foreground pixel accountingIn formula, N2For preceding pixel number；
The average gray value of background
In formula, PiFor probability, C1For pixel background；
The average gray value of prospect
In formula, PiFor probability, C2For pixel prospect；
It can to sum up obtain, the gray scale accumulated value u=u of 0-M gray scale interval1*ω1+u2*ω2,
Then inter-class variance
G=ω1*(u-u1)2+ω2*(u-u2)2=ω1*ω2*(u1-u2)2,
Take inter-class variance g maximum, gray value at this time is optimal threshold.
3. a kind of Path Recognition and middle line optimization method based on annulus road according to claim 1, characterized in that
The process in road image sideline is determined in step S3 with edge hunting method are as follows:
Since the d row of the binary image of road, initial d=1, from the left edge of entire binary image to centre according to
The secondary jump for determining whether 0xff to 0x00 occur will indicate the d row of the binary image of the road found if having
Sideline trip point is considered as the starting point of left side bearing, is denoted as a1；Successively determined from the right hand edge of entire binary image to centre
Whether the jump of 0xff to 0x00 is occurred, if having, by the sideline trip point of the d row of the binary image of the road found
It is considered as the starting point of right side bearing, is denoted as b1；If failing in the d row of the binary image of road finds a1,b1, then road
The d line number value of the binary image on road increases by 1 i.e. d=d+1, left edge and the right side by the d row of the binary image of road
The jump that edge successively determines whether 0xff to 0x00 occur to centre respectively repeats this step until finding a1,b1；
Setting range x, in a1The trip point that next line is looked within the scope of ± x is denoted as a2, then in a2Under being found in the range of ± x
The trip point of a line is denoted as a3, and so in anUntil finding all trip point a in ± xn, n is positive integer, all jumps
Height anLine is left side bearing；In b1The trip point that next line is looked within the scope of ± x is denoted as b2, then in b2In the range of ± x
The trip point for finding next line is denoted as b3, and so on until in all bnAll trip point b are found in ± xn, n is positive whole
Number, all trip point bnLine is right side bearing, and the coordinate of the i-th left side bearing of note is (i, Li), the coordinate of the i-th right side bearing of note is
(i,Ri)；
After obtaining all sidelines, left side bearing and right side bearing are optimized, if certain a line left side bearing exists and adjacent two
The edge-stitching point ordinate of row left side bearing is apart greater than definite value e, then is considered as the row sideline and noise occur, take the row sideline at this time
Adjacent rows left side bearing point ordinate average value is as the row sideline point, as road image left side bearing；If on the right of certain a line
Line, which exists, is apart greater than definite value e with the edge-stitching point ordinate of adjacent rows right side bearing, then is considered as the row sideline and noise occur, this
When take the adjacent rows right side bearing point ordinate average value in the row sideline as the row sideline point, as road image right side bearing.
4. a kind of Path Recognition and middle line optimization method based on annulus road according to claim 3, characterized in that
The process of annulus is determined in step S4 is:
Process 1 takes the sideline of the lower half portion of binary image in step S3, is averaged the coordinate in all sidelines to obtain one
Line segment；The slope of a line segment is obtained by common least square method, extends a line segment to obtain one according to this slope
New straight line, coordinate are denoted as (i, Mi), using new straight line as annulus Preliminary Identification line, this identification line needs to meet:
Li< Mi< Ri
It is considered as if the pixel jump that adjacent rows occurs in identification line and finds annulus, remembers that the point is Ring；
Process 2 arranges to scanning by edge hunting method on the basis of finding point Ring and obtains a new edge line, and note is sat
It is designated as (Yj, j), when ordinate is maximized, recording the point is R (Ymax,jmax), the sideline feature is examined, if the sideline
Meet condition:
Then it is determined as annulus；
Process 3 then needs to optimize processing to the highway sideline part of annulus if being determined as annulus, finds respectively entire
The inflection point A of the image road left side bearing and inflection point B of right side bearing, inflection point A and inflection point B, that is, left side bearing are electrodeless without extreme point and right side bearing
Be worth point, if the left side bearing and right side bearing in whole image road find multiple no extreme points respectively, take left and right sideline near
Two of ring part are respectively seen as inflection point A and inflection point B without extreme point；Inflection point A and 2 midpoint R of process is inserted using once linear
Value method is connected to new sideline, and not connected sideline is constant, similarly tie point B and point R, the secondary sideline after being optimized,
And then obtain first time road axis.
Process 4 mends line process and repeats the above process 3 at annulus outlet.
5. a kind of Path Recognition and middle line optimization method based on annulus road according to claim 4, characterized in that
Inflection point A, inflection point B and the process of the point R in process 2 are connected in process 3 is:
If A (x1,y1), R (Ymax,jmax), interpolation point (x, y), then interpolation algorithm are as follows:
Similarly connection inflection point B and point R.
6. a kind of Path Recognition and middle line optimization method based on annulus road according to claim 1, characterized in that
In step S5, road axis is optimized by common least square method, and final road axis is calculation formula are as follows:
7. a kind of Path Recognition and middle line optimization method based on annulus road according to claim 4, characterized in that two
The parts of images of adjacent left and right sides road where sideline, that is, camera of the lower half portion of value image, takes and is equal to image
The long part of 1/4 height.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811653805.0A CN109740532B (en) | 2018-12-29 | 2018-12-29 | Path identification and center line optimization method based on circular road |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811653805.0A CN109740532B (en) | 2018-12-29 | 2018-12-29 | Path identification and center line optimization method based on circular road |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109740532A true CN109740532A (en) | 2019-05-10 |
| CN109740532B CN109740532B (en) | 2022-09-16 |
Family
ID=66363104
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811653805.0A Active CN109740532B (en) | 2018-12-29 | 2018-12-29 | Path identification and center line optimization method based on circular road |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109740532B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110322457A (en) * | 2019-07-09 | 2019-10-11 | 中国大恒(集团)有限公司北京图像视觉技术分公司 | A kind of de-stacking method of 2D in conjunction with 3D vision |
| CN110320919A (en) * | 2019-07-31 | 2019-10-11 | 河海大学常州校区 | A kind of circulating robot method for optimizing route in unknown geographical environment |
| CN111731324A (en) * | 2020-05-29 | 2020-10-02 | 徐帅 | Control method and system for guiding AGV intelligent vehicle based on vision |
| CN111813117A (en) * | 2020-07-09 | 2020-10-23 | 北京布科思科技有限公司 | Robot line patrol priority navigation method, device and equipment |
| CN113450335A (en) * | 2021-06-30 | 2021-09-28 | 湖南三一华源机械有限公司 | Road edge detection method, road edge detection device and road surface construction vehicle |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1928892A (en) * | 2006-09-20 | 2007-03-14 | 王枚 | Method and device for license plate location recognition, vehicle-logo location recognition and vehicle type |
| CN107067536A (en) * | 2017-04-27 | 2017-08-18 | 深圳怡化电脑股份有限公司 | A kind of image boundary determines method, device, equipment and storage medium |
| CN107943061A (en) * | 2018-01-09 | 2018-04-20 | 辽宁工业大学 | A kind of model automobile automatic Pilot experimental provision and method based on machine vision |
| CN109033932A (en) * | 2018-05-23 | 2018-12-18 | 华南师范大学 | A kind of racing track recognition methods, identifying system, intelligent vehicle patrol mark method and patrol mark system |
-
2018
- 2018-12-29 CN CN201811653805.0A patent/CN109740532B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1928892A (en) * | 2006-09-20 | 2007-03-14 | 王枚 | Method and device for license plate location recognition, vehicle-logo location recognition and vehicle type |
| CN107067536A (en) * | 2017-04-27 | 2017-08-18 | 深圳怡化电脑股份有限公司 | A kind of image boundary determines method, device, equipment and storage medium |
| CN107943061A (en) * | 2018-01-09 | 2018-04-20 | 辽宁工业大学 | A kind of model automobile automatic Pilot experimental provision and method based on machine vision |
| CN109033932A (en) * | 2018-05-23 | 2018-12-18 | 华南师范大学 | A kind of racing track recognition methods, identifying system, intelligent vehicle patrol mark method and patrol mark system |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110322457A (en) * | 2019-07-09 | 2019-10-11 | 中国大恒(集团)有限公司北京图像视觉技术分公司 | A kind of de-stacking method of 2D in conjunction with 3D vision |
| CN110322457B (en) * | 2019-07-09 | 2021-05-14 | 中国大恒(集团)有限公司北京图像视觉技术分公司 | 2D and 3D vision combined unstacking method |
| CN110320919A (en) * | 2019-07-31 | 2019-10-11 | 河海大学常州校区 | A kind of circulating robot method for optimizing route in unknown geographical environment |
| CN110320919B (en) * | 2019-07-31 | 2022-05-20 | 河海大学常州校区 | Method for optimizing path of mobile robot in unknown geographic environment |
| CN111731324A (en) * | 2020-05-29 | 2020-10-02 | 徐帅 | Control method and system for guiding AGV intelligent vehicle based on vision |
| CN111813117A (en) * | 2020-07-09 | 2020-10-23 | 北京布科思科技有限公司 | Robot line patrol priority navigation method, device and equipment |
| CN111813117B (en) * | 2020-07-09 | 2023-09-01 | 北京布科思科技有限公司 | Robot line patrol priority navigation method, device and equipment |
| CN113450335A (en) * | 2021-06-30 | 2021-09-28 | 湖南三一华源机械有限公司 | Road edge detection method, road edge detection device and road surface construction vehicle |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109740532B (en) | 2022-09-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109740532A (en) | A kind of Path Recognition and middle line optimization method based on annulus road | |
| CN112424828B (en) | Nuclear fuzzy C-means quick clustering algorithm integrating space constraint | |
| US8280165B2 (en) | System and method for segmenting foreground and background in a video | |
| CN107578035B (en) | Human body contour extraction method based on super-pixel-multi-color space | |
| CN107945185B (en) | Image segmentation method and system based on wide residual pyramid pooling network | |
| US20200286239A1 (en) | Iterative method for salient foreground detection and multi-object segmentation | |
| CN110874844A (en) | Line segment detection method, device and equipment | |
| CN102222226B (en) | Priori analysis based iterative method for segmenting characters of licence plate | |
| CN101329727A (en) | Fingerprint identification method combining point with line | |
| CN105654501A (en) | Self-adaptive image segmentation method based on fuzzy threshold | |
| CN107705254B (en) | City environment assessment method based on street view | |
| CN102750708A (en) | Affine motion target tracing algorithm based on fast robust feature matching | |
| CN104794727B (en) | One is calculated as PSF quick calibrating method based on symmetric simple lens | |
| CN103218833B (en) | The color space the most steady extremal region detection method of Edge Enhancement type | |
| CN117058137B (en) | Visual inspection method for production quality of laminated glass | |
| CN105225281A (en) | A kind of vehicle checking method | |
| CN114155445B (en) | SAR image target detection method based on improvement YOLOv3 | |
| CN104537663B (en) | A kind of method for quickly correcting of flating | |
| CN107273884A (en) | A kind of License Plate Identification method based on mobile terminal camera | |
| CN111008608A (en) | Night vehicle detection method based on deep learning | |
| CN109101985A (en) | It is a kind of based on adaptive neighborhood test image mismatch point to elimination method | |
| CN109377455B (en) | Improved multi-sequence magnetic resonance image registration method based on self-similarity | |
| CN103577814A (en) | Weighting comparison method for motion-blur iris recognition | |
| CN117237396A (en) | Rail bolt rust area segmentation method based on image characteristics | |
| CN109658511B (en) | Method and related device for calculating pose information between adjacent frames based on images |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |