Deprecated: The each() function is deprecated. This message will be suppressed on further calls in /home/zhenxiangba/zhenxiangba.com/public_html/phproxy-improved-master/index.php on line 456
JPS603674B2 - Preprocessing device for shape recognition - Google Patents
[go: Go Back, main page]

JPS603674B2 - Preprocessing device for shape recognition - Google Patents

Preprocessing device for shape recognition

Info

Publication number
JPS603674B2
JPS603674B2 JP53066206A JP6620678A JPS603674B2 JP S603674 B2 JPS603674 B2 JP S603674B2 JP 53066206 A JP53066206 A JP 53066206A JP 6620678 A JP6620678 A JP 6620678A JP S603674 B2 JPS603674 B2 JP S603674B2
Authority
JP
Japan
Prior art keywords
signal
frame
point
detected
preprocessing device
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.)
Expired
Application number
JP53066206A
Other languages
Japanese (ja)
Other versions
JPS54157442A (en
Inventor
真澄 吉田
清 岩田
栄一郎 山本
猛 桝井
幸和 蕪山
慎一 清水
俊夫 松浦
茂美 長田
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.)
Fujitsu Ltd
Original Assignee
Fujitsu Ltd
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 Fujitsu Ltd filed Critical Fujitsu Ltd
Priority to JP53066206A priority Critical patent/JPS603674B2/en
Publication of JPS54157442A publication Critical patent/JPS54157442A/en
Publication of JPS603674B2 publication Critical patent/JPS603674B2/en
Expired legal-status Critical Current

Links

Landscapes

  • Image Analysis (AREA)

Description

【発明の詳細な説明】 本発明は、円、三角形、四角形などの開ループからなる
図形要素が他の同様な閉ル−プ図形と線分で連結されて
いる図形例えばフローチャートの議取りに必要な前処理
詳しくは該閉ループ図形要素およびその連結状態の認識
装置に関する。
DETAILED DESCRIPTION OF THE INVENTION The present invention is necessary for discussion of figures such as flowcharts in which figure elements consisting of open loops such as circles, triangles, and quadrilaterals are connected to other similar closed loop figures by line segments. More specifically, the present invention relates to a device for recognizing closed-loop graphic elements and their connected states.

周知のように情報処理システムの動作状況を説明するフ
ローチャートは複数個の矩形、菱形、円形等の図形要素
を線分で連結し、該図形要素またはシンボルに文字を書
込んだものからなる。か)るフローチャートの自動議取
りを行なうには文字認識の他にシンボルおよびその連結
状態についての図形認識が必要である。また各家庭に対
する水道管の配談状況を示す図は地図上の各家庭を○印
で示し、水道管の数段状況に従ってその各○印を線分で
結んでなる。か)る図の統計処理に当っては、該図の自
動議取りが望ましくなる。閉ループ図形要素を線分で結
んだ図形はこの他にも多々ある。本発明はか)る図形の
認識の前処理用装置を提案するものであり、その特徴と
する所は閉ループで構成される所定範囲の大きさの簡単
な図形要素の複数個を線分で連結してなる図形における
該図形要素を切出し、それに連結される線分の数を検知
する図形認識の前処理用装置において、該図形要素の内
部空間のX,Y軸方向における限界を示す4つの座標点
を抽出する抽出手段とも、これらの座標点に一定の闇値
を加えて該図形要素を包囲しかつ×,Y軸に平行な辺を
持つ四辺形枠体を作成する枠体作成手段と、該枠体に沿
って該枠体を貫通する線分を調べることにより前記連結
線の数を求める連結線数検出手段とを有する点にある。
As is well known, a flowchart for explaining the operating status of an information processing system consists of a plurality of graphical elements such as rectangles, diamonds, circles, etc. connected by line segments and characters written on the graphical elements or symbols. In addition to character recognition, graphic recognition of symbols and their connected states is required for automatic discussion of flowcharts. In addition, the diagram showing the arrangement status of water pipes for each household shows each household on the map as a circle, and connects each circle with a line segment according to the status of the water pipes. When performing statistical processing on such figures, it is desirable to have automatic discussion of the figures. There are many other shapes in which closed-loop graphic elements are connected by line segments. The present invention proposes such a preprocessing device for figure recognition, and its feature is that a plurality of simple figure elements of a predetermined range of sizes are connected by line segments in a closed loop. In a figure recognition preprocessing device that cuts out a figure element in a figure formed by a figure and detects the number of line segments connected to it, four coordinates indicating the limits of the internal space of the figure element in the X and Y axis directions an extraction means for extracting points; a frame creation means for adding a certain darkness value to these coordinate points to create a quadrilateral frame surrounding the graphic element and having sides parallel to the x and Y axes; The present invention further includes a connecting line number detecting means for determining the number of connecting lines by examining line segments passing through the frame along the frame.

以下図面を参照しながらこれを詳細に説明する。第1図
は複数個の円のシンボルPEを直線1で結んでなる図形
の例を、また第2図は複数個の菱形のシンボルPEを直
線1で結んでなる図形の例を示す。これらの図形の認識
においては各シンボルの切出しおよび相互連結状態の抽
出が必要になる。即ち第3図に示すように各円シンボル
に1,2・・・・・・5の符号をつけると、本例ではシ
ンボル1はシンボル2と3に連結し、シンボル2はシン
ポルーと4と5に連結している訳であるが、この連結状
態の把握が重要である。本発明はか)るシンボルの切出
し及び相互連結状態の抽出に対する前処理に係り、シン
ボルの存在を示す位置から該シンボルを囲む枠を作り、
該枠から何個の連結線が出ているかを知るものである。
この枠には図形の形状に応じて2つの種類がある。その
第1は、対象とするシンボルが円、正方形などの場合で
、この場合はシンボルの外接四辺形が正方形となるので
枠体も正方形とし(こ)ではか)る図形を単純図形とい
う)、その第2は対象とするシンボルが楕円、長方形、
菱形などの場合で、この場合は外接四辺形枠が長方形と
なるので枠体も長方形とする(こ)ではか)る図形を複
雑図形という)。先ず第4図を参照しながら単純図形に
対する本発明の前処理用装置を説明する。先ず走査によ
り円図形要素11を認識するが、これは円図形が白地に
黒線で画かれているとすると、本発明が対象とする閉ル
ープ図形要素は大きさも一定範囲内にあるから、閉ルー
プの始まりは白から黒になり、次いで黒部分の間に白部
分が現われかつ該白部分の長さが一定値以下のものとし
て認識でき、閉ループの終りはその逆のアルゴリズムで
かつ所定距離内の位置に検知でき、これらの始終端が見
つけられたときそれは一つの座標軸(走査を×鞠方向に
行なった場合はY軸)についての開ループの始終点であ
るとする。他方の座標軸本例ではX軸についての始終点
は例えば同様走査をY軸方向について行なって得られる
。閉ループは第3図の図形要素1,2,5,3とそれら
を結ぶ直線等によっても構成されるが、これは黒部分の
間の白部分の長さが所定値以上ということで対象外とい
うことが簡単に分る。また点P,などもスタート点とし
て認識されるが、この場合はX軸方向走査の進行につれ
て間もなく黒部分間白部分長さが所定値以上となり、ま
たスタート点に対応するエンド点が所定距離内に見出せ
ないから、閉ループのスタート点ではないと判別できる
。走査により開ループ図形11が認識でき該閉ループの
×、Y座標軸方向の4つの始終点座標値則ちY軸方向に
ついてのスタート点S,およびエンド点S′,ならびに
X軸方向についてのスタート点およびエンド点S2およ
びS′2が求まったら、これら4点の中心座標Cを求め
る。単純図形の場合は点Cから該4点までの距離はすべ
て等しいから、この性質を使って点Cを簡単に決めるこ
とができる。次に中心座標点Cから上記4点の1つまで
の距離1にマージン(閥値)山日を加え、その2倍を一
辺とする線幅Wの正方形枠12を画く。この正方形枠の
各辺はX、Y軸に平行とする。次にこの枠に沿って、該
枠と交叉する線が有るか無いかを調べ、交叉点E,,E
2,E3の数、本例では3を図形11が持つ連結の数と
する。次に第5図を参照しながら複雑図形に対する処理
方式を説明する。
This will be explained in detail below with reference to the drawings. FIG. 1 shows an example of a figure formed by connecting a plurality of circular symbols PE with a straight line 1, and FIG. 2 shows an example of a figure formed by connecting a plurality of diamond-shaped symbols PE with a straight line 1. Recognizing these figures requires cutting out each symbol and extracting the state of interconnection. That is, as shown in Figure 3, if each circle symbol is numbered 1, 2...5, then in this example, symbol 1 is connected to symbols 2 and 3, and symbol 2 is connected to symbols 2 and 3, and symbol 2 is connected to symbols 2 and 3. However, it is important to understand the state of this connection. The present invention relates to preprocessing for such symbol extraction and interconnection state extraction, and includes creating a frame surrounding the symbol from a position indicating the existence of the symbol;
It is used to know how many connecting lines are coming out from the frame.
There are two types of frames depending on the shape of the figure. The first is when the target symbol is a circle, square, etc. In this case, the circumscribed quadrilateral of the symbol is a square, so the frame is also a square (this figure is called a simple figure). The second is that the target symbol is an ellipse, a rectangle,
In the case of a rhombus, etc., in this case, the circumscribed quadrilateral frame is a rectangle, so the frame is also a rectangle (this figure is called a complex figure). First, the preprocessing apparatus of the present invention for simple figures will be explained with reference to FIG. First, the circular figure element 11 is recognized by scanning, but this is because if the circle figure is drawn with black lines on a white background, the size of the closed loop figure element targeted by the present invention is within a certain range. The beginning is from white to black, then a white part appears between the black parts, and the length of the white part can be recognized as being less than a certain value, and the end of the closed loop is the reverse algorithm and a position within a predetermined distance. When these start and end points are found, it is assumed that they are the start and end points of an open loop about one coordinate axis (Y axis when scanning is performed in the x direction). In this example, the start and end points for the other coordinate axis, the X-axis, are obtained by performing a similar scan in the Y-axis direction, for example. A closed loop is also formed by graphical elements 1, 2, 5, 3 in Figure 3 and straight lines connecting them, but this is not considered because the length of the white part between the black parts is greater than a predetermined value. It's easy to understand. In addition, points P, etc. are also recognized as starting points, but in this case, as the scanning in the X-axis direction progresses, the length of the white part between the black parts will soon exceed a predetermined value, and the end point corresponding to the start point will be within a predetermined distance. Since it cannot be found, it can be determined that it is not the starting point of a closed loop. The open loop figure 11 can be recognized by scanning, and the coordinate values of the four start and end points in the x and Y coordinate axes directions of the closed loop, namely the start point S and end point S' in the Y axis direction, and the start point and Once the end points S2 and S'2 are determined, the center coordinates C of these four points are determined. In the case of a simple figure, the distances from point C to the four points are all equal, so point C can be easily determined using this property. Next, a square frame 12 with a line width W of twice the distance 1 from the center coordinate point C to one of the four points above is added, and a margin (separate value) mountain day is drawn. Each side of this square frame is parallel to the X and Y axes. Next, along this frame, check whether there is a line that intersects the frame or not, and find the intersection points E,,E
The number 2, E3, in this example 3, is the number of connections that the figure 11 has. Next, a processing method for complex figures will be explained with reference to FIG.

一般に前述の如き単純図形の処理方式で解決できる図形
処理は余り存在せず、本例の処理方式による場合が多い
。本例でも前述の如き操作で閉ループ図形15の4つの
座標点S,,S′,およびS2,S′2を求める。次に
この4点を通り×,Y軸に平行な辺を持つ四辺形枠13
を作る。この四辺形枠13は閉ループ図形15の内部点
S,,S′,,S2,S′2(図形15の線幅だけ内部
に入っている)を通る四辺形枠であり、そこでこの四辺
形に線幅および水平垂直方向のマージンdH,dVを加
えて外方へ拡大した四辺形枠14を作る。この枠14に
沿って前記と同様に交叉する線を調べ交叉点E,,E2
,E3を求める。交叉線の検知方法としては簡単には走
査を行えばよく、例えば枠14の内側及び又は外側をサ
ーチすることにより交叉線が容易に検出できる。勿論こ
の走査は実際に行なわなくても、例えばスタート点S,
およびエンド点S′,の検出のための走査を行なったと
きの走査データをメモリに記憶させておき、このメモリ
を謙出(枠14の内、外側に沿うアドレスで)してもよ
い。交叉線が検知できれば、当然その交点の×,Y座標
つまりアドレスも分かる。第6図にこれらの交叉点の抽
出フローを示す。水平、垂直走査によって得た入力図形
のスタート点およびエンド点情報から中心値Cを抽出し
、次いで水平、垂直方向の閉状態の値S(S=S,,S
2,S′,,S′2)を抽出してC−S,,C−S2…
…の距離を算出する。これらの距離がすべて等しければ
単純図形、等しくなければ複雑図形であり、単純図形の
場合は閥値dHを加えて四辺形枠12を作り、複雑図形
の場合はSを通る四辺形枠13を作り、次いで関値山日
,dVを加えて四辺形枠14を作り、これらの枠12,
14に沿って交叉点E,,E2,E3を抽出する。第7
図は交叉点抽出回路の概要を示す。
In general, there are not many graphical processes that can be solved by the above-mentioned simple graphical processing method, and the processing method of this example is often used. In this example as well, the four coordinate points S, S', and S2, S'2 of the closed loop figure 15 are determined by the operations described above. Next, a quadrilateral frame 13 with sides parallel to the x and Y axis passes through these four points.
make. This quadrilateral frame 13 is a quadrilateral frame that passes through the internal points S, , S', , S2, and S'2 of the closed-loop figure 15 (which are inside by the line width of the figure 15). A quadrilateral frame 14 expanded outward is created by adding line width and horizontal and vertical margins dH and dV. Examine the intersecting lines along this frame 14 in the same manner as above and find the intersection points E, , E2.
, E3. A simple method for detecting a cross line is scanning. For example, by searching inside and/or outside the frame 14, a cross line can be easily detected. Of course, this scanning does not have to be actually performed; for example, starting point S,
The scanning data obtained when scanning for detecting the end points S' and S' may be stored in a memory, and this memory may be retrieved (at an address along the outside of the frame 14). If an intersection line can be detected, the x and y coordinates of the intersection point, that is, the address, can of course be known. FIG. 6 shows the extraction flow of these intersection points. The center value C is extracted from the start point and end point information of the input figure obtained by horizontal and vertical scanning, and then the closed state value S in the horizontal and vertical directions (S=S,,S
2, S',, S'2) and extract C-S,, C-S2...
Calculate the distance between... If these distances are all equal, it is a simple figure; if not, it is a complex figure. If it is a simple figure, add the cutoff value dH to create a quadrilateral frame 12, and if it is a complex figure, create a quadrilateral frame 13 that passes through S. , then add the barrier value peak day, dV to create a rectangular frame 14, and these frames 12,
Intersection points E, , E2, and E3 are extracted along 14. 7th
The figure shows an overview of the intersection point extraction circuit.

21は閉ループスタート点S,の検出回路であってX方
向走査データを入力され、前述の上が黒、下が黒間内白
という条件でスタート点S,の×、Y座標(XS,、Y
S,)を求める。
21 is a detection circuit for the closed-loop start point S, which receives the X-direction scanning data, and calculates the ×, Y coordinates (XS,, Y
Find S,).

22は閉ループエンド点検出領域決定回路であって、予
め既知である認識対象閉ループの大きさとこの検知され
たスタート点S,の座標値とから、鎖線枠25内に示す
ように閉ループエンド点の存在予定範囲のX,Y座標値
X,,X2,Y,,Y2をX,=XS,一dQ、X2=
XS,十dQ、Y,=YS,十dQ′、Y2=YS,十
d8として決定する。
Reference numeral 22 denotes a closed loop end point detection area determination circuit, which determines the existence of a closed loop end point as shown in a chain line frame 25 based on the previously known size of the closed loop to be recognized and the coordinate values of the detected start point S. The X, Y coordinate values of the planned range X,,X2,Y,,Y2 are
It is determined that XS, 10dQ, Y, = YS, 10dQ', Y2 = YS, 10d8.

ここでdQ、dQ′、d8はずれを見込んで適当に定め
た存在予定範囲の大きさを示す数値である。23は閉ル
ープエンド点S′,の検出回路であって、前述の逆のア
ルゴリズム則ち上が黒間白、下が黒の条件でエンド点S
′,を検出する。
Here, dQ, dQ', and d8 are numerical values indicating the size of the expected range of existence, which is appropriately determined in anticipation of deviation. 23 is a detection circuit for the closed loop end point S', which detects the end point S using the reverse algorithm described above, that is, under the condition that the top is white between black and the bottom is black.
′, is detected.

24は閉ループ決定回路であって回路23からのエンド
点S′,が回路22からの指定領域内に現われると被走
査図形は認識対象の閉ループであることを知り、該エン
ド点S′,を閉ループエンド点であるとしてそのX,Y
座標値(XS′,、YS′,)を出力する。
24 is a closed loop determining circuit which, when the end point S' from the circuit 23 appears within the specified area from the circuit 22, knows that the scanned figure is a closed loop to be recognized, and selects the end point S', from the closed loop. Assuming that it is the end point, its X, Y
Output the coordinate values (XS', YS',).

次に26は黒白変イ幻庚出回路、27は白黒変化検出回
路、28はカウンタであって、黒から白へ変った時点で
回路26からスタートパルスを受けてクロツクの計数を
開始し、白から黒へ変った時点で回路27からストップ
パルスを受け、そしてか)る動作はスタート点S,が検
出されたことを示す信号(回路21から回路26へ入力
する)があってから行なわれ、エンド点S′,が検出さ
れたことを示す信号(回路24から回路26へ入力する
)があると停止するので、結局カウンタ28は閉ループ
内の×軸方向幅を示すことになる。29は最大値検出回
路であって各走査毎のカウンタ28の出力を受け、前回
走査より今回走査の方がカウンタ出力(計数値)が大な
らば今回出力を最大値回路30へ書込む。
Next, 26 is a black-and-white change detection circuit, 27 is a black-and-white change detection circuit, and 28 is a counter, which receives a start pulse from the circuit 26 when black changes to white and starts clock counting. A stop pulse is received from the circuit 27 when the color changes from to black, and the above operation is performed after a signal (input from the circuit 21 to the circuit 26) indicating that the start point S is detected, Since the counter 28 stops when there is a signal (inputted from the circuit 24 to the circuit 26) indicating that the end point S' has been detected, the counter 28 ends up indicating the width in the x-axis direction within the closed loop. 29 is a maximum value detection circuit which receives the output of the counter 28 for each scan, and writes the current output to the maximum value circuit 30 if the counter output (count value) is larger in the current scan than in the previous scan.

従ってスタート点S,検出以後回路30の記憶値は次第
に大になり、最大中の所で最大となり、以後記憶内容の
更新は停止する。この最大幅の所における始終端座標は
S2(XS2、YS2)、S′2(XS′2、YS′2
)はY軸走査時の開ループスタート点およびストップ点
の座標に外ならず、この座標S2,S′2は最大幅が検
出された時点のかつ回路26,27が出力を生じた時点
の座標を記憶しておくことにより容易に得られる。回路
31はこれらのスタートおよびエンド点S,,S2,S
′,,S′2を回路21,24,30から受け、1次枠
決定回路32、2次枠決定回路33はこれらの点をもと
にして前述の要領で1次枠13および2次枠12,14
を決定し、連結点検出回路34は2次枠12,14から
連結点E,〜E3を検出する。なおこの閉ループ図形要
素認識方法は凸図形に適用するのが好ましく、凹図形で
は若干問題がある。
Therefore, after the detection of the starting point S, the stored value of the circuit 30 gradually increases, reaches the maximum at the maximum point, and thereafter updates of the stored contents are stopped. The start and end coordinates at this maximum width are S2 (XS2, YS2), S'2 (XS'2, YS'2)
) are the coordinates of the open loop start point and stop point during Y-axis scanning, and these coordinates S2 and S'2 are the coordinates at the time when the maximum width is detected and when the circuits 26 and 27 produce outputs. can be easily obtained by memorizing. The circuit 31 connects these start and end points S,,S2,S
',,S'2 are received from the circuits 21, 24, and 30, and the primary frame determination circuit 32 and the secondary frame determination circuit 33 determine the primary frame 13 and the secondary frame in the manner described above based on these points. 12,14
is determined, and the connection point detection circuit 34 detects connection points E, to E3 from the secondary frames 12 and 14. Note that this closed-loop graphic element recognition method is preferably applied to convex shapes, and has some problems with concave shapes.

例えば凹図形として三ケ月を考え、これがその両端を上
、中央部を下にして配置されたものを想定すると、前記
説明から明らかなようにスタート点S,は2個発生し、
エンド点は所望通り1個検出できるが、図形の両側を決
めるスタート点S2およびエンド点S′2は最大値回路
301こよっては得られない。またこの図形要素認識方
法では図形要素はその輪廓線のみが黒つまり2値データ
の一方「1」をとり、その内部は外部と同様に白つまり
生地の白、本例では2値データの他方「0,一である必
要があり、一方フローチャートでは図形要素内に種種の
文字が書込まれているからこれが邪魔になる。しかしこ
の問題は、図形要素の色と文字の色とを変える等の方法
により簡単に回避できる。以上詳細に説明したように本
発明によれば開ループからなる簡単な形の図形要素の複
数個を線分で連結した図形から、該図形要素を切り出し
、該図形要素に対する連結線の数、更には連結線位置の
検出から連結相手図形要素の推定が可能であり、前記図
形の完全認識に対する前処理用装置として極めて有効で
ある。
For example, if we consider a three-moon shape as a concave figure and assume that it is arranged with both ends up and the center down, as is clear from the above explanation, two starting points S, will occur,
One end point can be detected as desired, but the start point S2 and end point S'2, which determine both sides of the figure, cannot be obtained by the maximum value circuit 301. In addition, in this graphic element recognition method, only the outline of the graphic element is black, that is, one of the binary data is "1", and the inside is white like the outside, that is, the white of the fabric, and in this example, the other of the binary data is "1". 0, 1, and on the other hand, in a flowchart, various characters are written inside the graphic elements, which gets in the way.However, this problem can be solved by changing the color of the graphic elements and the color of the text. As explained in detail above, according to the present invention, a graphic element is cut out from a figure in which a plurality of simple graphic elements consisting of open loops are connected by line segments, and It is possible to estimate the connected graphic elements by detecting the number of connecting lines and the position of the connecting lines, and it is extremely effective as a preprocessing device for complete recognition of the figures.

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

第1図〜第3図は図形要素を線分で接続した図形の例を
示す説明図、第4図および第5図は図形要素連結線の求
め方を説明する図、第6図はそのフローチャート、第7
図は本発明の実施例を示すブロック図である。 図面ではPE,11,13は図形要素、1は連結線、S
,,S′,,S2,S′2は4つの座標点、12,14
は四辺形枠体である。 第1図 第2図 第3図 第4図 第5図 第6図 第7図
Figures 1 to 3 are explanatory diagrams showing examples of figures in which figure elements are connected by line segments, Figures 4 and 5 are diagrams explaining how to find figure element connection lines, and Figure 6 is a flowchart. , 7th
The figure is a block diagram showing an embodiment of the present invention. In the drawing, PE, 11, 13 are graphic elements, 1 is a connecting line, and S
,,S',,S2,S'2 are four coordinate points, 12, 14
is a quadrilateral frame. Figure 1 Figure 2 Figure 3 Figure 4 Figure 5 Figure 6 Figure 7

Claims (1)

【特許請求の範囲】 1 閉ループで構成される所定範囲の大きさの簡単な図
形要素の複数個を線分で連結してなる図形における該図
形要素を切出し、それに連結される線分の数を検知する
図形認識の前処理用装置において、該図形要素の内部空
間のX、Y軸方向における限界を示す4つの座標点を抽
出する抽出手段とも、これらの座標点に一定の閾値を加
えて該図形要素を包囲しかつX、Y軸に平行な辺を持つ
四辺形枠体を作成する枠体作成手段と、該枠体に沿って
該枠体を貫通する線分を調べることにより前記連結線の
数を求める連結線数検出手段とを有することを特徴とす
る図形認識の前処理用装置。 2 前記抽出手段は、図形要素をX、Y軸方向に走査し
て該図形要素の輪郭を示す2値データの一方「1」およ
び該図形要素が画かれた地を示す2値データの他方「0
」からなる信号を得、前回走査で得られた「1」信号が
今回走査で「1」信号に挾まれた「0」信号に変ること
により、X、Y軸方向における閉ループ図形要素の開始
座標点を検知し、また前回走査で得られた「1」信号に
挾まれた「0」信号が「1」信号に変り、かつそれが前
記開始座標点から予定距離範囲内で生じるとき、X、Y
軸方向における閉ループ図形要素の終端座標点を検知す
ることを特徴とする特許請求の範囲第1項記載の図形認
識の前処理用装置。
[Claims] 1. Cut out a graphic element in a figure formed by connecting a plurality of simple graphic elements of a predetermined range of sizes formed by closed loops with line segments, and calculate the number of line segments connected to it. In the preprocessing device for figure recognition to be detected, the extraction means for extracting four coordinate points indicating the limits in the X and Y axis directions of the internal space of the figure element also adds a certain threshold to these coordinate points to a frame creating means for creating a quadrilateral frame that surrounds a graphical element and has sides parallel to the X and Y axes; 1. A preprocessing device for figure recognition, comprising: means for detecting the number of connected lines. 2. The extracting means scans the graphical element in the X and Y axis directions and extracts one of the binary data "1" indicating the outline of the graphical element and the other binary data "1" indicating the ground where the graphical element is drawn. 0
”, and the “1” signal obtained in the previous scan changes to the “0” signal sandwiched by the “1” signal in the current scan, thereby determining the starting coordinates of the closed loop graphic element in the X and Y axis directions. When a point is detected and the "0" signal interposed between the "1" signals obtained in the previous scan changes to a "1" signal, and it occurs within a predetermined distance range from the starting coordinate point, Y
The preprocessing device for figure recognition according to claim 1, characterized in that the terminal coordinate point of the closed loop figure element in the axial direction is detected.
JP53066206A 1978-06-01 1978-06-01 Preprocessing device for shape recognition Expired JPS603674B2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP53066206A JPS603674B2 (en) 1978-06-01 1978-06-01 Preprocessing device for shape recognition

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP53066206A JPS603674B2 (en) 1978-06-01 1978-06-01 Preprocessing device for shape recognition

Publications (2)

Publication Number Publication Date
JPS54157442A JPS54157442A (en) 1979-12-12
JPS603674B2 true JPS603674B2 (en) 1985-01-30

Family

ID=13309121

Family Applications (1)

Application Number Title Priority Date Filing Date
JP53066206A Expired JPS603674B2 (en) 1978-06-01 1978-06-01 Preprocessing device for shape recognition

Country Status (1)

Country Link
JP (1) JPS603674B2 (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS57159377A (en) * 1981-03-28 1982-10-01 Toshiba Corp Drawing storage device

Also Published As

Publication number Publication date
JPS54157442A (en) 1979-12-12

Similar Documents

Publication Publication Date Title
JPH08305796A (en) Pattern extraction device, pattern re-recognition table creation device, and pattern recognition device
Song et al. Line net global vectorization: an algorithm and its performance evaluation
US5050229A (en) Method and apparatus for thinning alphanumeric characters for optical character recognition
JP2000112599A (en) Document image processing apparatus and document image processing method
GB2366108A (en) Vectorization of raster images
JPS603674B2 (en) Preprocessing device for shape recognition
JPH04260980A (en) Device for recognizing graphic
JP2890307B2 (en) Table space separation device
JPH117493A (en) Character recognition processor
JPH0658689B2 (en) Line figure separation device
JPS5943486A (en) Processing system for extracting circle
JPS6019285A (en) Stroke extracting method
JPH0620091A (en) Character size extraction method
JPH0793481A (en) Document reader
JPS6379183A (en) Graphic recognizing device
JPS6047637B2 (en) Shape recognition processing device
JPH08241376A (en) Character recognition device and character recognition method
JPH08339424A (en) Image processing apparatus and method
JPH0821059B2 (en) Unnecessary data removal method for character contour generation
JPS5814709B2 (en) Shape recognition method for closed shapes
JPS63142465A (en) Character string dividing system
JPH0139156B2 (en)
JPS63140372A (en) Graphic recognition device
JP2000268182A (en) Rectangle recognition method
JPS60181883A (en) Stroke extraction method in character discrimination