JPH033083A - Drawing recognizing device - Google Patents

Drawing recognizing device

Info

Publication number
JPH033083A
JPH033083A JP13615389A JP13615389A JPH033083A JP H033083 A JPH033083 A JP H033083A JP 13615389 A JP13615389 A JP 13615389A JP 13615389 A JP13615389 A JP 13615389A JP H033083 A JPH033083 A JP H033083A
Authority
JP
Japan
Prior art keywords
road
intersection
tracking
map data
intersection part
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
Application number
JP13615389A
Other languages
Japanese (ja)
Inventor
Yasutada Nagano
永野 靖忠
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Mitsubishi Electric Corp
Original Assignee
Mitsubishi Electric Corp
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Mitsubishi Electric Corp filed Critical Mitsubishi Electric Corp
Priority to JP13615389A priority Critical patent/JPH033083A/en
Publication of JPH033083A publication Critical patent/JPH033083A/en
Pending legal-status Critical Current

Links

Abstract

PURPOSE:To recognize roads expressed in a map by analyzing a road non- intersection part and a road intersection part to find out feature values and tracing the connection between the non-intersection part and the intersection part while deciding the continuity of the road based upon the feature values. CONSTITUTION:The road non-intersection part and the road intersection part extracted from map data inputted from a map data inputting means 1 are analyzed. The feature values of the analyzed result are found out by a road tracking/recognizing means 4 and the connection between the non-intersection part and the intersection part is traced while deciding the continuity of the road based upon the feature values to recognize the whole road. Consequently, the road can be recognized while deciding the continuity of the road and the road can be distinguished from other similar patterns.

Description

【発明の詳細な説明】[Detailed description of the invention] 【産業上の利用分野】[Industrial application field]

この発明は、地図に記入されている道路をデータ化して
認識する図面認識装置に関するものである。
The present invention relates to a drawing recognition device that converts roads marked on a map into data and recognizes them.

【従来の技術】[Conventional technology]

第6図は従来の図面認識装置を示すブロック接続図であ
り、図において、1は地図データを入力して記憶する地
図データ入力手段、2は上記地図データを解析して道路
の交差点と交差点との間の道路非交差点部を抽出する道
路非交差点部抽出手段、3は上記地図データおよび道路
非交差点部抽出結果をもとにして道路の交差点を抽出す
る道路交差点部抽出手段、5は抽出された非交差点部と
交差点部の接続関係を解析して、交差点部をノードとし
、非交差点部をアークとしたグラフ構造として道路を認
識する道路グラフ構造認識手段である。 次に動作について、第7図のフローチャートに従って説
明する。 まず、地図データ入力手段1に地図データを入力し、地
図を構成する線分をベクトル化して記憶する(ステップ
5TI)。その際、ベクトルが道路中心線ではなく、道
路輪郭を表すような形式にしておく、道路が中心線で記
入されている地図では、中心線の画像の輪郭ベクトルを
つくればよい。 次に、道路非交差点部抽出手段2によって、道路非交差
点部を抽出する。すなわち、ベクトルの中から最も長い
ものをとりだして、これをベクトル■とする(ステップ
5T2)。さらに、ベクトルVの右側にほぼ平行に並ん
でおり、かつ最も近くに並んでいるベクトルを求め、こ
れをベクトルWとする。左側でも同様に、はぼ平行に、
しかも最も近くに並んでいるベクトルを求める0次に、
ベクトル■、Wの間隔が道路幅程度ならば、ベクトルv
、Wをペアにして追跡しながら、道路芯線(道路中心線
に当たる)を発生させる。ベクトル■、Xのペアでも同
様に追跡して、道路芯線を発生させる(ステップ5T4
)。このステップST4では、第8図に示すように、ベ
クトルV、、W。 のペアを右方向に、まずベクトルV、、W、 、次にベ
クトルV3.W3と追跡している。こうしてペアを追跡
していって、道路の分岐などに到達し、それ以上追跡で
きなくなった場合には、追跡を中止する。この時、作成
してきた芯線の終端点と、いまたどってきたベクトルv
、WまたはベクトルV、Xの追跡終点とに、第9図に示
すようなベクトルA、Bを発生させる。これを「糊ベク
トル」と呼ぶ(ステップ5T5)。ここで、追跡してき
たベクトルを消去する(ステップ5T6)。 次に、長さが基準値し以上のベクトルの有無を調べ(ス
テップ5T7) 、有ればステップST2に戻って道路
非交差点部抽出を続け、無ければステップS T 81
c進み、道路交差点部を抽出する。 ここでいう道路交差点はT字路等の道路分岐点を含む。 このステップST8では、糊ベクトルA。 Bの周辺を調べ、例えば非交差点部にならなかった残り
のベクトルと糊ベクトルの集合から構成される閉ループ
があれば、この閉ループを検出することなどで、道路交
差点部を抽出し、第1θ図に示すように交差点内で交差
点に接続する芯線を結合させる。こうして、得られた道
路芯線の接続をもとに、道路の非交差点部をアーク、交
差点部をノードとしたグラフ構造を求め、処理を終了す
る。 そして、このような地図中の道路の認識のために、ステ
ップSTIの処理は地図データ入力手段lによって、ス
テップST2〜ST7の処理は道路非交差点部抽出手段
2によって、ステップST8の処理は道路交差点部抽出
手段3によって、ステップST9の処理は道路グラフ構
造P2識手段5によって、それぞれなされる。
FIG. 6 is a block connection diagram showing a conventional drawing recognition device. In the figure, 1 is a map data input means that inputs and stores map data, and 2 is a map data input means that analyzes the map data to identify road intersections and intersections. 3 is a road non-intersection extraction means for extracting road non-intersection parts between the road non-intersection parts; 3 is a road non-intersection extraction means for extracting road intersections based on the map data and the road non-intersection extraction results; 5 is a road non-intersection extraction means for extracting road non-intersection parts; This road graph structure recognition means analyzes the connection relationship between non-intersection areas and intersection areas, and recognizes the road as a graph structure with intersection areas as nodes and non-intersection areas as arcs. Next, the operation will be explained according to the flowchart shown in FIG. First, map data is input to the map data input means 1, and line segments forming the map are vectorized and stored (step 5TI). In this case, the vector should be in a format that represents the road contour rather than the road center line.For maps where roads are marked with center lines, it is sufficient to create a contour vector of an image of the center line. Next, the road non-intersection portion extracting means 2 extracts road non-intersection portions. That is, the longest one is extracted from among the vectors, and this is designated as vector (2) (step 5T2). Furthermore, a vector that is lined up almost parallel to the right side of vector V and lined up closest to it is determined, and this is set as vector W. Similarly, on the left side, the lines are parallel to each other,
Moreover, the 0th order to find the vectors that are lined up closest to each other,
If the interval between vectors ■ and W is about the width of the road, then vector v
, W are paired and tracked to generate a road center line (corresponding to the road center line). Similarly, the pair of vectors ■ and
). In this step ST4, as shown in FIG. 8, vectors V, , W. To the right, first the vectors V, , W, , then the vectors V3. We are tracking with W3. The pair is tracked in this way, and when the pair reaches a branch in the road and can no longer be tracked, the tracking is stopped. At this time, the terminal point of the skeleton line that has been created and the vector v that has just returned
, W or the tracking end points of vectors V and X, vectors A and B as shown in FIG. 9 are generated. This is called a "glue vector" (step 5T5). Here, the tracked vector is erased (step 5T6). Next, the presence or absence of a vector whose length is equal to or greater than the reference value is checked (step 5T7), and if found, the process returns to step ST2 to continue extracting road non-intersection areas; if not, the process returns to step ST81.
Go to step c and extract the road intersection. The road intersection referred to here includes road branch points such as T-junctions. In this step ST8, glue vector A is used. Examine the surroundings of B and, for example, if there is a closed loop consisting of a set of remaining vectors and glue vectors that did not become a non-intersection area, by detecting this closed loop, the road intersection area is extracted and the road intersection area is extracted. Connect the core lines that connect to the intersection within the intersection as shown in . Based on the connections of the road core lines obtained in this way, a graph structure is obtained in which non-intersection parts of the road are made into arcs and intersection parts are made into nodes, and the process is completed. In order to recognize such roads on the map, the process of step STI is performed by the map data input means 1, the process of steps ST2 to ST7 is performed by the road non-intersection part extraction means 2, and the process of step ST8 is performed by the road non-intersection part extraction means 2. The process of step ST9 is performed by the section extraction means 3 and the road graph structure P2 recognition means 5, respectively.

【発明が解決しようとする課題】[Problem to be solved by the invention]

従来の図面認識装置は以上のように構成されているので
、道路をグラフ構造として認識するだけで、多数の交差
点とその交差点間の道路非交差点部の連続体としての一
本の道路を認識できないほか、歩道やハツチング領域(
斜線で影を施した領域)や河川のような道路類似パター
ンが存在した場合、これらを道路と誤認するなどの課題
があった。なお、かかる従来の図面認識装置に類似する
技術が、大沢・環内「輪郭線をベースにした芯線化方式
の改良」、第37回情報処理学会全国大会(昭和63年
後期)IW−2に記載されている。 この発明は上記のような課題を解消するためになされた
もので、道路の連続性を判定しながらこの道路の認識を
行うことができるとともに、他の類似パターンとの区別
をつけることができる図面認識装置を得ることを目的と
する。
Conventional drawing recognition devices are configured as described above, so they only recognize roads as a graph structure, but cannot recognize a single road as a continuum of many intersections and non-intersection parts of the road between the intersections. In addition, sidewalks and hatching areas (
When there are road-like patterns such as areas shaded with diagonal lines or rivers, there are problems such as misidentifying them as roads. In addition, a technology similar to the conventional drawing recognition device was published in Osawa and Tamanai's "Improvement of core line generation method based on contour lines", IW-2 of the 37th National Conference of the Information Processing Society of Japan (late 1986). Are listed. This invention was made to solve the above-mentioned problems, and it is possible to recognize the road while determining the continuity of the road, and also to create a drawing that can distinguish it from other similar patterns. The purpose is to obtain a recognition device.

【課題を解決するための手段】[Means to solve the problem]

この発明に係る図面認識装置は、地図データ入力手段か
らの地図データから抽出した道路非交差点部と道路交差
点部を解析して、道路追跡・認識手段によりその特徴量
を求め、その特徴量をもとに道路の連続性を判定しなが
ら道路非交差点部と交差点部のつながりを追跡して、道
路全体を認識するようにしたものである。
The drawing recognition device according to the present invention analyzes road non-intersection parts and road intersection parts extracted from map data from a map data input means, calculates their feature quantities using a road tracking/recognition means, and also calculates the feature quantities. This system recognizes the entire road by tracking the connections between non-intersection areas and intersection areas while determining the continuity of the road.

【作 用】[For use]

この発明における道路追跡・認識手段は、それまでに抽
出した道路非交差点部と道路交差点部を解析して、その
特徴量を求め、その特徴量をもとに道路の連続性を判定
しながら道路非交差点部と道路交差点部のつながりを追
跡して道路とし、地図に記入された道路を認識する。
The road tracking/recognition means in this invention analyzes the previously extracted road non-intersection areas and road intersection areas, obtains their feature quantities, and determines the continuity of the road based on the feature quantities. The connection between a non-intersection area and a road intersection area is tracked to form a road, and the road marked on the map is recognized.

【発明の実施例】[Embodiments of the invention]

以下、この発明の実施例を図について説明する。 第1図において、1は地図データを入力して記憶する地
図データ入力手段、2は上記地図データを解析して道路
の交差点と交差点の間の道路非交差点部を抽出する道路
非交差点部抽出手段、3は上記地図データを解析して、
道路交差点部を抽出する道路交差点部抽出手段、4は抽
出された道路非交差点部と道路交差点部のつながりを、
道路としての連続性を判定しながら追跡して、道路をL
2識する道路追跡・認識手段である。 次に動作について、第2図のフローチャートに従って説
明する。なお、ステップSTI〜ST8の処理は、それ
ぞれ上記従来例と同じであるので、その重複する説明を
省略する。すなわち、ステップSTI〜ST8で地図デ
ータから道路非交差点部と交差点部を抽出した後、道路
追跡・認識手段において各交差点部に接続する道路非交
差点部の幅員、接続方向、接続位置、カーブの仕方等の
特徴量を求める(ステップ5T9)、次に、ステップ5
TIO−3T17において道路を追跡する。 すなわち、まず、最も幅員の大きい道路非交差点部を、
追跡開始地点として取出しくステップ5T10)、次に
、接続する交差点へと道路を追跡する(ステップ5TI
I)。ここで、始めの追跡方向は任意に決めてよい。さ
らに、今の追跡ができたかどうかを調べ(ステップ5T
12)、追跡できていなければ道路の行止りであるので
、ステップ5T13の処理に進む、一方、追跡できてい
れば、交差点に接続するまだ道路として追跡されていな
い道路非交差点部を調べ、道路の連続性が最も保たれる
方へ道路を追跡する(ステップ5T13)、第3図はこ
のステップ5T13の処理方法を示すものである。すな
わち、第3図(A)は最も一般的な四辻の交差点を示し
、8a〜8eは抽出された道路非交差点部、8fは道路
交差点部であり、いま、道路非交差点部8aから右方向
に追跡し、道路交差点部8fに達しているとする。 次に、道路交差点部8fに接続する道路非交差点部8b
〜8eを調べ、道路非交差点部8aに対して道路方向、
幅員ともにほぼ連続で、道路非交差点部8aの直進方向
に対して正面の位置に接続している道路非交差点部8d
の方に追跡する。この時、誤って道路非交差点部として
抽出されているが、実は歩道であ之道路非交差点部8e
の方へ間違って追跡されることはない、また、誤って道
路非交差点部として抽出したハツチング領域、河川、細
長い街区等に対しても、道路として追跡することがない
。 第3図(B)は道路分岐点を示す、ここで8g〜8.i
は抽出された道路非交差点部、8jは道路交差点部であ
り、いま、道路非交差点部8gから道路交差点部8jに
追跡が達しているとすると、方向では道路非交差点部8
hが連続性が高いが、幅員では道路非交差点部81が連
続性が高い。追跡方向は、これらの要因を総合的に加味
して、予め定めた規準で決められる。 第3図(C)はカーブの仕方が意味を持つと考えられる
道路パターンを示し、カーブの仕方を優先して考えた場
合には道路非交差点部8kから道路非交差点部8mでは
なく)道路非交差点部81の方向へ行われる0次に、ス
テ、ツブ5T14で今の追跡ができたかどうか調べる。 追跡できていなければ、ステップ5T15に進む。追跡
できていれば、ステップ5TIIに戻って追跡を続ける
。 方、ステップ5T15では、追跡を開始した道路非交差
点部に対して、両方向へ追跡したか否かを調べ、一方向
の追跡しか終っていなければもうひとつの方向への追跡
を始め(ステップ5T16)両方向への追跡が終ってい
れば、追跡された道路非交差点部、交差点部をひとつの
連続した道路として記憶し、ステップ5T17に進む。 また、全ての道路を追跡し終っていなければ、ステップ
5TIOに戻って、次の追跡を始め、全ての道路を追跡
し終っていれば終了する(ステップST1?)。 以上のようにして、従来の図面認識装置では不可能であ
った連続した道路の認識ができる。 なお、上記実施例では道路非交差点部抽出手段2におい
て、ペアとなるベクトルv、W及びベクトル■9Xの追
跡を行っているが、追跡を行わずに、ベクトルv、Wお
よびベクトル■、Xの検出後、ただちに両ベクトルの端
点間に糊ベクトルを発生させる°だけでも、第4図に示
すように9a。 9c、9dが道路非交差点部として別個に抽出され、9
bが交差点部として抽出されるので、交差点部9bを拡
張した意味での道路交差点部として道路追跡を行えば、
上記実施例と同様に、道路が認識できるばかりでなく、
道路屈曲部を安定して認識でき、かつ、明確に区別して
認識できるという利点がある。また、同時に、道路途中
にある広場やロータリーも、同様に、拡張した意味での
交差点として、区別して抽出できる利点がある。 また、上記実施例では道路非交差点部抽出手段2におい
て道路芯線を発生させて、道路交差点部抽出手段3にお
いて、その端部を結合する処理を行っているが、これを
行わずに道路の輪郭のみを扱っても、上記実施例と同様
の効果が得られる。 さらに、上記実施例では道路の追跡において、接続しあ
う道路非交差点部および道路交差点部のみを追跡してい
るが、第5図(A)、  (B)に示すように、糊ベク
トルが互いに平行に並んでいる場合も、その間隙をとび
こして追跡するようにすれば、上記実施例と同様の効果
が得られるばかりでなく、第5図(A)のように道路の
一部に記入もれがある場合や第5図(B)のように立体
交差等により道路が分断されている場合にも、対応でき
るという利点がある。 また、さらに、道路非交差点部抽出方式及び道路交差点
部抽出方式は一例を示したに過ぎず、他の方式によって
もよい。また、この実施例とは逆に交差点部、非交差点
部の順に抽出することも考えられる。 なお、本実施例では道路の認識について述べたが水路等
の認識にも同様に応用することができる。 【発明の効果1 以上のように、この発明によれば道路非交差点部と道路
交差点部を抽出して、道路追跡・認識手段によりそのつ
ながりを道路としての連続性を判定しながら追跡するよ
うに構成したので、地図中に道路と類似した河川などの
パターンがあっても、これを除いて正しくひとつながり
の連続した道路を選択的に、高精度に認識することがで
きる図面認識装置が得られる効果がある。
Embodiments of the present invention will be described below with reference to the drawings. In FIG. 1, 1 is a map data input means for inputting and storing map data, and 2 is a road non-intersection part extraction means for analyzing the map data and extracting road non-intersection parts between road intersections. , 3 analyzes the above map data,
A road intersection extracting means for extracting a road intersection; 4 indicates the connection between the extracted road non-intersection and the road intersection;
The road is tracked while determining its continuity as a road.
It is a road tracking/recognition method that recognizes two things. Next, the operation will be explained according to the flowchart shown in FIG. Note that the processes in steps STI to ST8 are the same as those in the conventional example described above, so a redundant explanation thereof will be omitted. That is, after extracting road non-intersection parts and intersection parts from the map data in steps STI to ST8, the road tracking/recognition means extracts the width, connection direction, connection position, and curve of the road non-intersection part connected to each intersection part. (step 5T9), then step 5
Track the road in TIO-3T17. That is, first, the widest non-intersection part of the road is
Step 5T10), then trace the road to the connecting intersection (Step 5TI).
I). Here, the initial tracking direction may be arbitrarily determined. Furthermore, check whether the current tracking was successful (step 5T)
12) If it cannot be tracked, it is a dead end of the road, so proceed to step 5T13. On the other hand, if it can be tracked, check the non-intersection part of the road that is connected to the intersection and has not been tracked as a road yet. The road is tracked in the direction that best maintains the continuity of the road (step 5T13). FIG. 3 shows the processing method of step 5T13. That is, FIG. 3(A) shows the most common four-way intersection, 8a to 8e are extracted road non-intersection parts, 8f is a road intersection part, and now from the road non-intersection part 8a to the right It is assumed that the vehicle is tracked and reaches a road intersection 8f. Next, the road non-intersection portion 8b connected to the road intersection portion 8f
~8e, the road direction with respect to the road non-intersection part 8a,
A road non-intersection portion 8d that is substantially continuous in width and connected to the road non-intersection portion 8a at a position in front of the road non-intersection portion 8a in the straight-ahead direction.
track towards. At this time, it is mistakenly extracted as a road non-intersection area, but it is actually a sidewalk and a road non-intersection area 8e.
In addition, hatched areas, rivers, long and narrow city blocks, etc. that are mistakenly extracted as road non-intersections are not tracked as roads. FIG. 3(B) shows road junctions, where 8g to 8. i
is the extracted road non-intersection area, 8j is the road intersection area, and if the tracking is now reaching the road intersection area 8j from the road non-intersection area 8g, the road non-intersection area 8j is the extracted road non-intersection area.
h has high continuity, but road non-intersection portion 81 has high continuity in terms of width. The tracking direction is determined based on predetermined criteria, taking these factors into consideration comprehensively. Figure 3 (C) shows a road pattern in which the way the curve is considered to be significant. Next, in the direction of the intersection 81, step 5T14 checks to see if the current tracking was successful. If the tracking has not been completed, the process proceeds to step 5T15. If tracking is successful, return to step 5TII and continue tracking. On the other hand, in step 5T15, it is checked whether the non-intersection part of the road where tracking has been started is tracked in both directions, and if tracking has been completed in only one direction, tracking is started in the other direction (step 5T16). If tracking in both directions has been completed, the tracked road non-intersection portions and intersection portions are stored as one continuous road, and the process proceeds to step 5T17. Furthermore, if all the roads have not been tracked, the process returns to step 5TIO to start the next tracking, and if all the roads have been tracked, the process ends (step ST1?). In the manner described above, it is possible to recognize continuous roads, which was impossible with conventional drawing recognition devices. In the above embodiment, the road non-intersection extraction means 2 tracks the pair of vectors v, W and vector ■9X, but the vectors v, W and vectors ■, 9a, as shown in FIG. 4, even if a glue vector is immediately generated between the end points of both vectors after detection. 9c and 9d are extracted separately as road non-intersection parts, and 9
Since point b is extracted as an intersection, if road tracking is performed using intersection 9b as a road intersection in an expanded sense,
Similar to the above embodiment, not only can roads be recognized, but
This has the advantage of being able to stably recognize road bends and clearly distinguishing them. At the same time, plazas and roundabouts located along roads have the advantage of being able to be distinguished and extracted as intersections in an expanded sense. Furthermore, in the above embodiment, the road non-intersection extracting means 2 generates a road core line, and the road intersection extracting means 3 performs a process of joining the edges. The same effect as in the above embodiment can be obtained even if only the above-mentioned components are used. Furthermore, in the above embodiment, when tracking roads, only the connecting road non-intersection parts and road intersection parts are tracked, but as shown in FIGS. 5(A) and 5(B), the glue vectors are parallel to each other. Even when the roads are lined up, if the gaps are used for tracking, not only can the same effect as in the above embodiment be obtained, but also it is possible to mark a part of the road as shown in Fig. 5(A). This method has the advantage of being able to cope with cases where there is a traffic jam or where the road is divided by an overpass or the like as shown in FIG. 5(B). Further, the road non-intersection extraction method and the road intersection extraction method are merely examples, and other methods may be used. It is also conceivable to extract intersections and non-intersections in this order, contrary to this embodiment. In this embodiment, the recognition of roads has been described, but the present invention can be similarly applied to the recognition of waterways, etc. [Effect of the invention 1] As described above, according to the present invention, road non-intersection parts and road intersection parts are extracted, and the connection between them is tracked by the road tracking/recognition means while determining continuity as a road. With this configuration, even if there are patterns such as rivers that are similar to roads in the map, a drawing recognition device can be obtained that can correctly and selectively recognize continuous roads, excluding these patterns, with high accuracy. effective.

【図面の簡単な説明】[Brief explanation of the drawing]

第1図はこの発明の一実施例による図面認識装置を示す
ブロック接続図、第2図はこの発明による図面認識手順
を示すフローチャート図、第3図はこの発明による道路
追跡の方法を示す説明図、第4図は道路交差点部の追跡
の方法を示す説明図、第5図は糊ベクトルが平行して並
んでいる場合の追跡の方法を示す説明図、第6図は従来
の図面認識装置を示すブロック接続図、第7図は従来の
図面認識手順を示すフローチャート図、第8図はベクト
ルのペアを追跡する方法を示す説明図、第9図は糊ベク
トルの発生状況を示す説明図、第10図は道路交差点部
のグラフ構造を示す説明図である。 1は地図データ入力手段、2は道路非交差点部抽出手段
、3は道路交差点部抽出手段、4は道路追跡・認識手段
。 なお、図中、同一符号は同一、又は相当部分を示す。 第1図 第6図 第 図 nの1) (A) FC+ 第 図 (での2) (A) +8) 第 図 (Yの1) 第 図 (イT2)
FIG. 1 is a block connection diagram showing a drawing recognition device according to an embodiment of the invention, FIG. 2 is a flowchart showing a drawing recognition procedure according to the invention, and FIG. 3 is an explanatory diagram showing a road tracking method according to the invention. , Fig. 4 is an explanatory diagram showing a method of tracking a road intersection, Fig. 5 is an explanatory diagram showing a method of tracking when glue vectors are arranged in parallel, and Fig. 6 is an explanatory diagram showing a method of tracking when glue vectors are arranged in parallel. FIG. 7 is a flowchart showing a conventional drawing recognition procedure; FIG. 8 is an explanatory diagram showing a method for tracking pairs of vectors; FIG. 9 is an explanatory diagram showing how glue vectors are generated; FIG. 10 is an explanatory diagram showing the graph structure of a road intersection. 1 is a map data input means, 2 is a road non-intersection part extraction means, 3 is a road intersection part extraction means, and 4 is a road tracking/recognition means. In addition, in the figures, the same reference numerals indicate the same or equivalent parts. Figure 1 Figure 6 Figure n-1) (A) FC+ Figure (2) (A) +8) Figure (Y-1) Figure (A-T2)

Claims (1)

【特許請求の範囲】[Claims] 地図データを入力として、地図を構成する線分をベクト
ル化して記憶する地図データ入力手段と、上記地図デー
タを解析して、道路の交差点と交差点との間の道路部分
を抽出する道路非交差点部抽出手段と、上記地図データ
を解析して、道路の交差点部を抽出する道路交差点部抽
出手段と、上記抽出した道路の交差点部および非交差点
部のつながりを、道路としての連続性を判定しながら追
跡することにより、道路を認識する道路追跡・認識手段
とを備えた図面認識装置。
A map data input means that inputs map data and vectorizes and stores the line segments that make up the map; and a road non-intersection section that analyzes the map data and extracts road sections between road intersections. an extraction means; a road intersection extraction means that analyzes the map data and extracts road intersections; and a road intersection extraction means that analyzes the map data to extract intersections of roads; A drawing recognition device comprising road tracking/recognition means for recognizing roads by tracking them.
JP13615389A 1989-05-31 1989-05-31 Drawing recognizing device Pending JPH033083A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP13615389A JPH033083A (en) 1989-05-31 1989-05-31 Drawing recognizing device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP13615389A JPH033083A (en) 1989-05-31 1989-05-31 Drawing recognizing device

Publications (1)

Publication Number Publication Date
JPH033083A true JPH033083A (en) 1991-01-09

Family

ID=15168553

Family Applications (1)

Application Number Title Priority Date Filing Date
JP13615389A Pending JPH033083A (en) 1989-05-31 1989-05-31 Drawing recognizing device

Country Status (1)

Country Link
JP (1) JPH033083A (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH04270476A (en) * 1991-02-26 1992-09-25 Hitachi Software Eng Co Ltd Line width detecting method for linear picture
JPH0512442A (en) * 1991-07-02 1993-01-22 Hitachi Software Eng Co Ltd Line image tracking method
JPH0778254A (en) * 1993-09-08 1995-03-20 Hitachi Ltd Graphic closed area extraction method
US6487305B2 (en) 1996-06-19 2002-11-26 Matsushita Electric Industrial Co. Ltd. Deformed map automatic generation system including automatic extraction of road area from a block map and shape deformation of at least one road area drawn in the map

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH04270476A (en) * 1991-02-26 1992-09-25 Hitachi Software Eng Co Ltd Line width detecting method for linear picture
JPH0512442A (en) * 1991-07-02 1993-01-22 Hitachi Software Eng Co Ltd Line image tracking method
JPH0778254A (en) * 1993-09-08 1995-03-20 Hitachi Ltd Graphic closed area extraction method
US6487305B2 (en) 1996-06-19 2002-11-26 Matsushita Electric Industrial Co. Ltd. Deformed map automatic generation system including automatic extraction of road area from a block map and shape deformation of at least one road area drawn in the map
US6714664B2 (en) 1996-06-19 2004-03-30 Matsushita Electric Industrial Co., Ltd. Road area extracting apparatus for extracting a road area from a block map, deformed map automatic generation system for generating a deformed map from road area data obtained by the road area extracting apparatus, map information providing system, geographical information providing system and geographical information describing method

Similar Documents

Publication Publication Date Title
JP3793032B2 (en) Road guide method and apparatus
Bertozzi et al. Vision-based vehicle guidance
Kim et al. Development of a graph-based approach for building detection
Hinz et al. Automatic extraction of urban road networks from multi-view aerial imagery
Kang et al. Road lane segmentation using dynamic programming for active safety vehicles
JP2002260160A (en) Method and device for guidance
CN111158365A (en) Path planning method and device, robot and storage medium
CN115077550A (en) Unmanned vehicle route planning method based on matching of navigation map and high-precision map
JPH033083A (en) Drawing recognizing device
Morgan et al. Road edge tracking for robot road following: a real-time implementation
Lee et al. Modeling 3-D complex buildings with user assistance
Wu et al. Top-to-down segment process based urban road extraction from high-resolution remote sensing image
Wong et al. Single camera vehicle localization using feature scale tracklets
Habib et al. Line-based modified iterated Hough transform for autonomous single-photo resection
JP4509429B2 (en) Obstacle recognition method and recognition processing apparatus using a stereo camera
Chen et al. A robust algorithm of principal curve detection
Kiy et al. Global image analysis: detection and recognition of basic informative elements of road scenes
Cheng et al. A robust algorithm for image principal curve detection
Kiy et al. Geometrized Histograms Method: Integrated Analysis of Road Scenes
JPH033082A (en) Drawing recognizing device
CN116380090A (en) Overpass structure extraction method based on floating car GPS track data
Maganto et al. A monocular vision system for autonomous vehicle guidance
JPS6228884A (en) Method for detecting image to be detected
Duchow et al. Aggregating lane markings into lanes for intersection assistance
JPH06265330A (en) Image measuring apparatus