JPH08221581A - Center line vectorization processing method for image data - Google Patents

Center line vectorization processing method for image data

Info

Publication number
JPH08221581A
JPH08221581A JP7028975A JP2897595A JPH08221581A JP H08221581 A JPH08221581 A JP H08221581A JP 7028975 A JP7028975 A JP 7028975A JP 2897595 A JP2897595 A JP 2897595A JP H08221581 A JPH08221581 A JP H08221581A
Authority
JP
Japan
Prior art keywords
vector
straight line
vertex
contour
apex
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
JP7028975A
Other languages
Japanese (ja)
Inventor
Nagisa Ogiyama
なぎさ 荻山
Koji Fukutomi
耕司 福富
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.)
Meidensha Corp
Meidensha Electric Manufacturing Co Ltd
Original Assignee
Meidensha Corp
Meidensha Electric Manufacturing Co 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 Meidensha Corp, Meidensha Electric Manufacturing Co Ltd filed Critical Meidensha Corp
Priority to JP7028975A priority Critical patent/JPH08221581A/en
Publication of JPH08221581A publication Critical patent/JPH08221581A/en
Pending legal-status Critical Current

Links

Landscapes

  • Image Processing (AREA)

Abstract

PURPOSE: To perform the center line vectorization of an image close to an original figure and to reduce the size of vector data by generating center vectors shaped by connecting the end points and start points of center vectors after straight lines are successively increased until touching contour vectors. CONSTITUTION: After the start point of the center vector is defined as a reference S0 (ST1), that reference S0 and a second apex S2 are connected by a straight line SL (ST2). It is judged whether this straight line SL touches the contour vectors or not (ST3) and when it does not touch them as a result of judgement, a first apex S1 is deleted and processing for connecting the reference S0 and a third apex S3 with a straight line is performed (ST5). On the other hand, when the straight line SL touches the contour vectors, the reference is defined as a first apex S1 (ST6) and the first apex S1 and the third apex S3 are connected by a straight line (ST7). Afterwards, it is judged whether an n-th apex is the end point or not (ST8) and processing is finished. Thus, the center vectors of the image close to the original figure can be generated and the size of vector data can be reduced.

Description

【発明の詳細な説明】Detailed Description of the Invention

【0001】[0001]

【産業上の利用分野】この発明は、画像ベクトル化処理
による画像処理方法に係わり、特に画像データの芯線ベ
クトル化処理方法に関する。
BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an image processing method by image vectorization processing, and more particularly to a core line vectorization processing method for image data.

【0002】[0002]

【従来の技術】近年、CAD(コンピュータエイディド
デザイン)の普及に伴って、図面入力装置のニーズが高
まっている。この図面入力装置は、図面や文書などの画
像をイメージスキャナ等で読み取ってCAD等で取り扱
うに適した画像データを得るためのものであり、CAD
等で取り扱うにあたっての簡便性を確保しつつデータ圧
縮を行う点が重要となる。これらの点を満足する画像処
理技術として画像ベクタライズ処理が挙げられる。この
画像ベクタライズ処理では、イメージスキャナ等から読
み込まれた2値化画像データを処理対象とし、画像の輪
郭を抽出して輪郭ベクトルを生成するとともに、その輪
郭ベクトルを用いて芯線ベクトルを生成する。得られた
ベクトルデータは、画像を構成する基本要素(文字・線
分等)を分離してコード化する認識処理等に利用され
る。
2. Description of the Related Art In recent years, with the spread of CAD (Computer Aided Design), the need for a drawing input device has increased. This drawing input device is for reading an image such as a drawing or a document with an image scanner or the like to obtain image data suitable for handling by CAD or the like.
It is important to perform data compression while ensuring the ease of handling in such cases. An image vectorizing process is an image processing technique that satisfies these points. In this image vectorization processing, the binarized image data read from an image scanner or the like is processed, the contour of the image is extracted to generate a contour vector, and the contour vector is used to generate a core line vector. The obtained vector data is used for a recognition process or the like in which basic elements (characters, line segments, etc.) that form an image are separated and coded.

【0003】ここで、芯線ベクトルを生成する従来の方
法を図4によって述べる。図4において、まず、ある輪
郭ベクトル(以下先行ベクトルと称す)に注目する。次
に、その先行ベクトルとペアになる輪郭ベクトル(以下
ペアベクトルと称す)に注目する。その後、先行ベクト
ル始点と、ペアベクトル終点の中点を、芯線ベクトルの
始点とし、先行ベクトル終点とペアベクトル始点の中点
を芯線ベクトルの終点とすることによって芯線ベクトル
を生成する。
Now, a conventional method for generating a core vector will be described with reference to FIG. In FIG. 4, first, attention is paid to a certain contour vector (hereinafter referred to as a preceding vector). Next, attention is paid to a contour vector (hereinafter referred to as a pair vector) that forms a pair with the preceding vector. After that, the midpoint of the preceding vector start point and the pair vector end point is set as the starting point of the core line vector, and the midpoint of the preceding vector end point and the pair vector starting point is set as the end point of the core line vector to generate the core line vector.

【0004】上記例は芯線生成の理想的な場合である
が、図5に示すように、先行ベクトルの始点と、ペアベ
クトルの終点が離れ過ぎているときには、ペアベクトル
から先行ベクトルに対して垂線を下ろした足を使用して
芯線ベクトルの始点を決定している。また、図6は上述
の場合とは逆で、先行ベクトルの終点とペアベクトルの
始点が離れているときには、先行ベクトルの終点からペ
アベクトルに対して垂線を下ろした足を使用して芯線ベ
クトルの終点を決定している。
The above example is an ideal case of core line generation, but as shown in FIG. 5, when the start point of the preceding vector and the end point of the pair vector are too far apart, a perpendicular line from the pair vector to the preceding vector is generated. The starting point of the skeleton vector is determined using the foot that has been lowered. Further, FIG. 6 is opposite to the above case, and when the end point of the preceding vector and the starting point of the pair vector are distant from each other, the foot that is perpendicular to the pair vector from the ending point of the preceding vector is used to The end point has been decided.

【0005】[0005]

【発明が解決しようとする課題】上記のようにして従来
は芯線ベクトルを生成していたが、図7A,B(図7A
は手書きされた図面で、輪郭ベクトルのペアが9つ、芯
線ベクトルが9つの場合を示し、図7Bは印刷等で浄書
された図面で、輪郭ベクトルのペアが4つ、芯線ベクト
ルが4つの場合を示す)に示すような図面では、輪郭ベ
クトルのペアをもとに芯線ベクトルを生成するので、そ
のペアと同数の芯線ベクトルおよび頂点(図示黒丸印)
が生成されてしまう。このことは図面の状態(図7Aが
手書き図面、図7Bが印刷された図面)により、芯線デ
ータの精度、データの大きさ(芯線ベクトルの頂点数)
に大きな違いが生ずる。つまり、図7Bのような印刷等
によるきれいな図面では、原図のイメージを損なう事な
く、芯線ベクトル頂点数も原図の頂点数と大きな差は生
じないが、図7Aのような手書きされた図面の場合に
は、線の太さが均一でないことが多く、芯線ベクトル化
すると、直線を表しているはずの線分が細かい凹凸にな
って原図のイメージを著しく損なってしまう恐れがあ
る。また、頂点の数も本来あるべき頂点数の何十倍、何
百倍の数になってデータの大きさも膨大になってしまう
問題がある。
As described above, the core line vector is conventionally generated as described above. However, as shown in FIGS. 7A and 7B (FIG. 7A).
Shows a case where there are nine contour vector pairs and nine skeleton vectors in a handwritten drawing, and FIG. 7B shows a case in which there are four contour vector pairs and four skeleton vectors, which are engraved by printing. In the drawing as shown in (1), since the core line vector is generated based on the pair of contour vectors, the same number of core line vectors and vertices (black circles shown in the figure) as the pair.
Will be generated. This depends on the drawing state (handwritten drawing in FIG. 7A and printed drawing in FIG. 7B), accuracy of core line data, size of data (number of vertices of core line vector).
Makes a big difference. In other words, in the case of a clean drawing such as the one shown in FIG. 7B, the number of core line vector vertices does not greatly differ from the number of vertices of the original drawing without damaging the image of the original drawing. In many cases, the thickness of the line is not uniform, and if the core line vector is used, the line segment that should represent the straight line may have fine irregularities, which may significantly impair the image of the original drawing. In addition, there is a problem that the number of vertices is tens or hundreds times the number of vertices that should be present, and the data size becomes enormous.

【0006】この発明は上記の事情に鑑みてなされたも
ので、原図に近いイメージの芯線ベクトルが生成できる
とともに、ベクトルデータの大きさを少なくできる画像
データの芯線ベクトル化処理方法を提供することを目的
とする。
The present invention has been made in view of the above circumstances, and provides a skeleton vectorization processing method for image data that can generate a skeleton vector of an image close to the original image and reduce the size of vector data. To aim.

【0007】[0007]

【課題を解決するための手段】この発明は、上記の目的
を達成するために、第1発明は、画像データに基づいて
画像の輪郭を抽出して輪郭ベクトルを生成し、輪郭ベク
トルの対を検出してその検出点を頂点とし、その頂点を
結んで芯線ベクトルを生成した後、この芯線ベクトルを
整形する芯線ベクトル化処理方法において、前記芯線ベ
クトルの始点を基準S0とした後、その基準S0と(S0
+1)番目の頂点をSnとし、その頂点Snの次の頂点
(Sn+1)番目と前記基準S0とを直線で結び、その
直線が前記輪郭ベクトルに接触するかを判断した後、直
線が輪郭ベクトルに接触しなければ、前記Snを削除し
てから、次に基準S0と頂点(Sn+2)番目とを直線
で結び、その直線が輪郭ベクトルに接触するかを判断
し、接触しなければ頂点(Sn+1)を削除するような
処理を行って行き、直線が輪郭ベクトルに接触するまで
順次増やして行った後に芯線ベクトルの終点と始点を結
ぶようにして整形された芯線ベクトルを生成することを
特徴とするものである。
In order to achieve the above-mentioned object, the first invention is to extract the contour of an image based on image data to generate a contour vector, and to form a pair of contour vectors. In the skeleton vectorization processing method of detecting and using the detected points as vertices, connecting the vertices to generate a skeleton vector, and in the skeleton vectorization processing method for shaping the skeleton vector, the starting point of the skeleton vector is set as the reference S 0 S 0 and (S 0
The (+1) th vertex is designated as Sn, the vertex (Sn + 1) th next to the vertex Sn is connected to the reference S 0 by a straight line, and it is determined whether the straight line contacts the contour vector. If it does not touch, the Sn is deleted, then the reference S 0 and the vertex (Sn + 2) th are connected by a straight line, and it is determined whether or not the straight line touches the contour vector. Sn + 1) is deleted, the straight line is sequentially increased until it comes into contact with the contour vector, and then a shaped core line vector is generated so as to connect the end point and the start point of the core line vector. To do.

【0008】第2発明は、前記基準S0と頂点(Sn+
1)番目とを直線で結んだ後に、その直線が輪郭ベクト
ルに接触したときには、基準をSnに移した後に、Sn
と頂点(Sn+2)番目とを直線で結んでその直線が輪
郭ベクトルに接触するかを判断するように処理したこと
を特徴とするものである。
A second aspect of the present invention is based on the reference S 0 and the vertex (Sn +
After connecting 1) and # with a straight line and the straight line touches the contour vector, after shifting the reference to Sn, Sn
And a vertex (Sn + 2) th are connected by a straight line, and it is processed so as to determine whether or not the straight line contacts the contour vector.

【0009】[0009]

【作用】輪郭ベクトルに接触しない直線が多くなれば頂
点を大幅に少なくできるようになるとともに、整形した
芯線ベクトルも細かな凹凸がなくなる線分に生成できる
ようになる。
If the number of straight lines that do not contact the contour vector increases, the number of vertices can be significantly reduced, and the shaped core line vector can be generated as a line segment without fine irregularities.

【0010】[0010]

【実施例】以下この発明の一実施例を図面に基づいて説
明する。図1はこの発明の一実施例を示すベクトル整形
処理のフローチャートで、図1において、ステップST
1で、図2Aに示す輪郭ベクトルa1,a2,a3…と
b1,b2,b3…に生成された芯線ベクトルの整形を
行うには、まず始点を基準S0として始点方向からの整
形を始める。次に、ステップST2で基準S0と第2頂
点S2を図2Bに示す直線SLで結ぶ。この直線SLが
輪郭ベクトルに接触するか、どうかをステップST3で
判断する。ステップST3の判断の結果、接触しないと
きには、ステップST4に処理が進んで第1頂点S1
削除し、次のステップST5の処理を行う。ステップS
T5は基準S0と第3頂点S3を前述と同様に直線(図2
Bには図示せず)で結ぶ処理で、この処理で、直線が輪
郭ベクトルに接触しないかをステップST3に戻って再
び判断する。判断の結果、直線が接触しないときには第
2頂点S2を削除する。以後、基準S0と第4頂点S4
を直線で結んで上記と同様の処理を行って、直線が輪郭
ベクトルに接触するときにはステップST6の処理に移
る。
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of the present invention will be described below with reference to the drawings. FIG. 1 is a flowchart of a vector shaping process showing an embodiment of the present invention. In FIG.
In FIG. 1, in order to shape the core line vectors generated for the contour vectors a1, a2, a3 ... And b1, b2, b3 ... Shown in FIG. 2A, first, with the starting point as the reference S 0 , shaping from the starting point direction is started. Next, in step ST2, the reference S 0 and the second vertex S 2 are connected by the straight line SL shown in FIG. 2B. In step ST3, it is determined whether or not this straight line SL contacts the contour vector. If the result of determination in step ST3 is that there is no contact, the process proceeds to step ST4, the first vertex S 1 is deleted, and the process of next step ST5 is performed. Step S
T5 is a straight line (see FIG. 2) between the reference S 0 and the third vertex S 3 as described above.
In this process, the process returns to step ST3 and it is determined again whether or not the straight line contacts the contour vector. As a result of the determination, when the straight lines do not contact, the second vertex S 2 is deleted. After that, the reference S 0 and the fourth apex S 4 are connected by a straight line and the same process as above is performed. When the straight line comes into contact with the contour vector, the process proceeds to step ST6.

【0011】一方、前記ステップST3で前記直線SL
が輪郭ベクトルに接触する場合にはステップST6の処
理を行う。ステップST6は直線SLが輪郭ベクトルに
接触するときには基準を第1頂点S1とする処理であ
る。この処理の後、ステップST7で、図2Aに示す第
1頂点S1と第3頂点S3を直線(図2Aには図示せず)
で結ぶ。その後、第n頂点が終点かをステップST8で
判断し、「NO」の場合には、上記処理を終点になるま
で繰り返し、「YES」の場合には処理を終了する。そ
して、残った頂点を対象に終点方向から上記と同様な処
理を行う。
On the other hand, in step ST3, the straight line SL
When touches the contour vector, the process of step ST6 is performed. Step ST6 is a process in which the reference is the first vertex S 1 when the straight line SL contacts the contour vector. After this process, in step ST7, the first vertex S 1 and the third vertex S 3 shown in FIG. 2A are straight lines (not shown in FIG. 2A).
Tie in. Then, it is determined in step ST8 whether the nth vertex is the end point. If "NO", the above process is repeated until the end point, and if "YES", the process ends. Then, the same processing as above is performed from the end point direction on the remaining vertices.

【0012】上記のような処理を行うことにより図7A
に示した芯線ベクトルの整形後の芯線ベクトルには図3
に示すようにペアベクトルは9つあるが、頂点数は3
つ、芯線ベクトル数は2つと大幅に少なく、しかも芯線
ベクトルは細かい凹凸が生じない線分として生成される
ようになる。
By performing the above processing, FIG.
The core line vector after shaping the core line vector shown in FIG.
There are 9 pair vectors as shown in, but the number of vertices is 3
On the other hand, the number of skeleton vectors is significantly small as two, and the skeleton vector is generated as a line segment that does not cause fine unevenness.

【0013】[0013]

【発明の効果】以上述べたように、この発明によれば、
手書き図面や四角形等多角形の多い住宅地図等の画像デ
ータから得た芯線ベクトルの細かい凹凸を無くした線分
が得られるとともに、不必要な頂点を少なくすことによ
って芯線ベクトル数および頂点数共に大幅に減少させる
ことができ、これにより入力原図により近いイメージの
芯線ベクトルが生成できるようになるとともに、無駄な
頂点を生成しないので、ベクトルデータの大きさも効率
良く削減できるようになる等の利点がある。
As described above, according to the present invention,
A line segment without fine irregularities of the core line vector obtained from image data such as handwritten drawings and residential maps with many polygons such as squares can be obtained, and by reducing unnecessary vertices, both the number of core line vectors and the number of vertices can be significantly increased. The core line vector of the image closer to the input original image can be generated, and unnecessary vertices are not generated, so that the size of vector data can be efficiently reduced. .

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

【図1】この発明の一実施例を示すベクトル整形処理の
フローチャート。
FIG. 1 is a flowchart of a vector shaping process according to an embodiment of the present invention.

【図2】実施例の動作を述べるための説明図。FIG. 2 is an explanatory diagram for explaining the operation of the embodiment.

【図3】実施例により整形された結果を示す説明図。FIG. 3 is an explanatory diagram showing a result of shaping according to an embodiment.

【図4】芯線ベクトル生成の基本説明図。FIG. 4 is a basic explanatory diagram of core vector generation.

【図5】芯線ベクトル生成の例外説明図。FIG. 5 is an explanatory diagram of an exception of core line vector generation.

【図6】芯線ベクトル生成の例外説明図。FIG. 6 is an explanatory diagram of an exception of core line vector generation.

【図7】Aは手書き図面における図面入力画像を示す説
明図、Bは浄書された図面における図面入力画像を示す
説明図。
FIG. 7A is an explanatory diagram showing a drawing input image in a handwritten drawing, and B is an explanatory diagram showing a drawing input image in an engraved drawing.

【符号の説明】[Explanation of symbols]

ST1…始点を基準とする処理ステップ ST2…基準S0と第2頂点S2を直線で結ぶ処理ステッ
プ ST3…直線が輪郭ベクトルと接触するかを判断するス
テップ ST4…直線間にある頂点を削除するステップ ST5…基準S0と第3頂点S3を直線で結ぶ処理ステッ
プ ST6…第1頂点S1を基準とするステップ ST7…第1頂点S1と第3頂点S3を直線で結ぶ処理ス
テップ
ST1 ... Processing step with reference to the starting point ST2 ... Processing step for connecting the reference S 0 and the second vertex S 2 with a straight line ST3 ... Step for determining whether or not the straight line contacts the contour vector ST4 ... Step ST5 ... A processing step connecting a reference S 0 and a third vertex S 3 with a straight line ST6… A step using a first vertex S 1 as a reference ST7… A processing step connecting a first vertex S 1 and a third vertex S 3 with a straight line

Claims (2)

【特許請求の範囲】[Claims] 【請求項1】 画像データに基づいて画像の輪郭を抽出
して輪郭ベクトルを生成し、輪郭ベクトルの対を検出し
てその検出点を頂点とし、その頂点を結んで芯線ベクト
ルを生成した後、この芯線ベクトルを整形する芯線ベク
トル化処理方法において、 前記芯線ベクトルの始点を基準S0とした後、その基準
0と(S0+1)番目の頂点をSnとし、その頂点Sn
の次の頂点(Sn+1)番目と前記基準S0とを直線で
結び、その直線が前記輪郭ベクトルに接触するかを判断
した後、直線が輪郭ベクトルに接触しなければ、前記S
nを削除してから、次に基準S0と頂点(Sn+2)番
目とを直線で結び、その直線が輪郭ベクトルに接触する
かを判断し、接触しなければ頂点(Sn+1)を削除す
るような処理を行って行き、直線が輪郭ベクトルに接触
するまで順次増やして行った後に芯線ベクトルの終点と
始点を結ぶようにして整形された芯線ベクトルを生成す
ることを特徴とする画像データの芯線ベクトル化処理方
法。
1. A contour vector of an image is extracted based on image data to generate a contour vector, a pair of contour vectors is detected, the detected point is made a vertex, and the vertex is connected to generate a core line vector, In this skeleton vectorization processing method for shaping the skeleton vector, after the starting point of the skeleton vector is set as a reference S 0 , the reference S 0 and the (S 0 +1) th vertex are set as Sn, and the vertex Sn
If the straight line does not touch the contour vector after determining whether the straight line touches the contour vector and connects the next vertex (Sn + 1) th of the reference point S 0 with the reference S 0 ,
After deleting n, the reference S 0 and the vertex (Sn + 2) th are connected by a straight line, and it is determined whether or not the straight line contacts the contour vector. If not, the vertex (Sn + 1) is deleted. Performing processing, sequentially increasing until a straight line touches the contour vector, and then generating a skeleton vector that is shaped so as to connect the end point and the start point of the skeleton vector. Processing method.
【請求項2】 前記基準S0と頂点(Sn+1)番目と
を直線で結んだ後に、その直線が輪郭ベクトルに接触し
たときには、基準をSnに移した後に、Snと頂点(S
n+2)番目とを直線で結んでその直線が輪郭ベクトル
に接触するかを判断するように処理したことを特徴とす
る請求項1記載の画像データの芯線ベクトル化処理方
法。
2. When the reference S 0 and the vertex (Sn + 1) th are connected by a straight line and then the straight line comes into contact with a contour vector, after shifting the reference to Sn, Sn and the vertex (Sn + 1)
The core line vectorization processing method of image data according to claim 1, wherein the processing is performed by connecting the (n + 2) th line with a straight line and determining whether or not the straight line contacts the contour vector.
JP7028975A 1995-02-17 1995-02-17 Center line vectorization processing method for image data Pending JPH08221581A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP7028975A JPH08221581A (en) 1995-02-17 1995-02-17 Center line vectorization processing method for image data

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP7028975A JPH08221581A (en) 1995-02-17 1995-02-17 Center line vectorization processing method for image data

Publications (1)

Publication Number Publication Date
JPH08221581A true JPH08221581A (en) 1996-08-30

Family

ID=12263433

Family Applications (1)

Application Number Title Priority Date Filing Date
JP7028975A Pending JPH08221581A (en) 1995-02-17 1995-02-17 Center line vectorization processing method for image data

Country Status (1)

Country Link
JP (1) JPH08221581A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2012253814A (en) * 2005-10-25 2012-12-20 Kyocera Corp Input device and mobile phone apparatus

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2012253814A (en) * 2005-10-25 2012-12-20 Kyocera Corp Input device and mobile phone apparatus
JP2014200098A (en) * 2005-10-25 2014-10-23 京セラ株式会社 Input device and mobile phone apparatus

Similar Documents

Publication Publication Date Title
CN111723798B (en) Multi-instance natural scene text detection method based on relevance hierarchy residual errors
CN112070649B (en) Method and system for removing specific character string watermark
US20200005078A1 (en) Content aware forensic detection of image manipulations
JP3884468B2 (en) Fast image search method
JPH06274619A (en) Image processor
JPH08221581A (en) Center line vectorization processing method for image data
US5325476A (en) Method of converting area data into path data
JPH07200735A (en) Graphic recognition device
JP4350228B2 (en) Pattern recognition method and apparatus
Su et al. Dimension recognition and geometry reconstruction in vectorization of engineering drawings
JP2020064438A (en) Learning data generation device and learning data generation method
JP2858551B2 (en) Wiring inspection data creation method
JP2829968B2 (en) Waveform matching method
JP2507413B2 (en) Pattern data compression method
CN113297340B (en) Vectorization method and device for point cloud map and method and device for converting vector map into point cloud map
JP2867650B2 (en) Symbol candidate area detection method
JPH11203405A (en) Character recognition device, its method and program recording medium
JP2935331B2 (en) Figure recognition device
JPS5866176A (en) Pattern recognizing device
JPH10335206A (en) Method and apparatus for creating mask pattern data
JP2715930B2 (en) Line detection method
JP3763966B2 (en) Image recognition method, apparatus and recording medium
JPH06259602A (en) Candidate character extracting device
JP2706367B2 (en) Processing method of mask pattern data
Megdal VLSI computational structures applied to fingerprint image analysis