JPS62274472A - Compression system for pattern data - Google Patents
Compression system for pattern dataInfo
- Publication number
- JPS62274472A JPS62274472A JP61118920A JP11892086A JPS62274472A JP S62274472 A JPS62274472 A JP S62274472A JP 61118920 A JP61118920 A JP 61118920A JP 11892086 A JP11892086 A JP 11892086A JP S62274472 A JPS62274472 A JP S62274472A
- Authority
- JP
- Japan
- Prior art keywords
- points
- curve
- lines
- contour
- pattern
- 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
- 238000007906 compression Methods 0.000 title description 8
- 230000006835 compression Effects 0.000 title description 8
- 238000005452 bending Methods 0.000 claims description 46
- 238000000034 method Methods 0.000 claims description 43
- 238000005034 decoration Methods 0.000 claims description 14
- 238000013144 data compression Methods 0.000 claims description 9
- 238000009499 grossing Methods 0.000 claims description 4
- 239000000284 extract Substances 0.000 abstract description 3
- 230000006870 function Effects 0.000 description 16
- 238000006243 chemical reaction Methods 0.000 description 12
- 238000010586 diagram Methods 0.000 description 10
- 230000009466 transformation Effects 0.000 description 6
- 238000007796 conventional method Methods 0.000 description 5
- 230000000694 effects Effects 0.000 description 4
- 238000004364 calculation method Methods 0.000 description 3
- 238000003079 width control Methods 0.000 description 2
- 230000008602 contraction Effects 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 238000000605 extraction Methods 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 238000013139 quantization Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T3/00—Geometric image transformations in the plane of the image
- G06T3/40—Scaling of whole images or parts thereof, e.g. expanding or contracting
- G06T3/4007—Scaling of whole images or parts thereof, e.g. expanding or contracting based on interpolation, e.g. bilinear interpolation
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Image Processing (AREA)
Abstract
Description
【発明の詳細な説明】
３、発明の詳細な説明
〔概 要〕
文字、図形パターンから斜め線及び曲線ストロークを構
成する輪郭線分を抽出し、抽出した部分に０次スプライ
ン関数による曲線近似を行なう。[Detailed Description of the Invention] 3. Detailed Description of the Invention [Summary] Contour line segments constituting diagonal lines and curved strokes are extracted from character and graphic patterns, and curve approximation is applied to the extracted portions using a zero-order spline function. Let's do it.
本発明は、文字、図形のパターンデータの圧縮方式に関
する。The present invention relates to a compression method for character and graphic pattern data.
文字、図形データをフルドツトで記憶すると大容量メモ
リが必要になり、またフルドツトパターンをそのフルド
ツトのま＼で拡大、縮小処理すると美しいパターンが得
られない。そこで文字、図形データを少ないメモリ容量
で蓄積でき、かつ高品質の拡大、縮小パターンを生成で
きるパターンデータ圧縮、復元およびパターン生成方法
が必要とされる。本発明はこのうちのパターンデータ圧
縮方式に係るものである。Storing character and graphic data as full dots requires a large capacity memory, and enlarging or reducing a full dot pattern without leaving it as full dots results in a beautiful pattern. Therefore, there is a need for a pattern data compression, restoration, and pattern generation method that can store character and graphic data with a small memory capacity and generate high-quality enlarged and reduced patterns. The present invention relates to a pattern data compression method among these methods.
パターン拡大、縮小は、画素密度の異なるファクシミリ
へ転送する場合、およびある画素密度のスキャナで読み
込んだ文字、図形データを画素密度を変換して使用する
例えばプリンタで記録しディスプレイに表示する場合に
必要不可欠である。Pattern enlargement or reduction is necessary when transferring to a facsimile machine with a different pixel density, or when converting the pixel density of character and graphic data read by a scanner with a certain pixel density and using it, for example, when recording it on a printer and displaying it on a display. It is essential.
拡大、縮小変換の一方式として直線近似がある。 Linear approximation is one method of enlarging and reducing conversion.
これは文字、図形の輪郭を直線群で近似し、各直線（ベ
クトル）の端点座標を文字、図形のパターンデータとし
て持つもので、ドツトパターンで持つ方式に比べて大幅
にメモリ容量を節減でき、またパターン拡大、縮小も容
易である。例えば文字、図形を２倍に拡大又は１／２に
縮小するには、各直線の端点座標を２倍に拡大又は１／
２に縮小すればよい。しかしこの直線近似方式では水平
、垂直線に対しては近似度が高く拡大、縮小を行なって
も美しいパターンを生成できるが、斜め線や曲線ストロ
ークに対しては凹凸が目立ち、美しいパターンを生成す
ることができない。即ち斜め線は、ディスプレイ上では
格子点を辿ることになるのでいわば量子化誤差が生じて
階段状になり、また曲線ストロークを直線近似すると近
似度が低く （これを高めると多数の直線が必要になり
、データ量が多くなる）、これらを拡大、縮小すると美
しいパターンにはならない。そこで滑らかな斜め線や曲
線ストロークを生成できるパターンデータ圧縮、復元お
よびパターン生成方法が望まれる。This approximates the contours of characters and figures using a group of straight lines, and stores the coordinates of the end points of each straight line (vector) as pattern data for the characters and figures. Compared to a method that uses dot patterns, it can significantly reduce memory capacity. Furthermore, the pattern can be easily enlarged or reduced. For example, to enlarge characters or figures by 2 times or reduce them by 1/2, the coordinates of the end points of each straight line should be enlarged by 2 times or reduced by 1/2.
It can be reduced to 2. However, this linear approximation method has a high degree of approximation for horizontal and vertical lines, and can generate beautiful patterns even when enlarged or reduced. However, for diagonal lines or curved strokes, unevenness becomes noticeable and a beautiful pattern is generated. I can't. In other words, diagonal lines trace lattice points on the display, so quantization errors occur, creating a step-like shape, and when a curved stroke is approximated by a straight line, the degree of approximation is low (if this is increased, many straight lines are required). (This increases the amount of data.) If you enlarge or reduce these, you will not get a beautiful pattern. Therefore, a pattern data compression, restoration, and pattern generation method that can generate smooth diagonal lines and curved strokes is desired.
文字、図形の輪郭を、直線ではなく曲線で近似する方式
もある。第９図にその一例を示す。本例では平仮名の「
な」の輪郭をＯ１△、・を付した線群で近似している。There is also a method of approximating the contours of characters and figures using curved lines instead of straight lines. An example is shown in FIG. In this example, the hiragana “
The outline of `` is approximated by a group of lines marked with O1△, .
輪郭を曲線で近似するとき、その曲線を表わす関数は、
一方の軸例えばＸ軸について１価関数でなければならず
、そこで文字輪郭を辿るこれらの線群は１つのＸ値に対
して１つのｙ値になるように区分されている。○印はこ
の区分された１つの線（１ブロツク）の始、終点を示す
。Δ印は直線近似により得られた標本点、即ち輪郭上の
２点を直線で結び該直線と輪郭とのずれが許容値にある
範囲で可及的に該直線を長くした（上記２点間距離を大
にした）ときの該直線の端点である。また・印は曲線分
割点である。即ち、文字の輪郭を１価関数になるように
区分した前記ブロックは直線部（※で示す）を含むもの
、２ストロークが交差して出来ていて傾斜が急に変る点
（変曲点）を含むものなどがあるが、このような曲線と
直線の境界および変曲点（・印で示す）では線を分割し
て複数ブロックとし、関数表現を容易にする。When approximating the contour with a curve, the function representing that curve is
It must be a monovalent function for one axis, for example the X axis, so that these lines tracing the character contour are partitioned into one y value for one x value. The ○ marks indicate the start and end points of one divided line (one block). The Δ marks are sample points obtained by linear approximation, that is, two points on the contour are connected by a straight line, and the straight line is made as long as possible within the range where the deviation between the straight line and the contour is within the allowable value. This is the end point of the straight line when the distance is increased. Also, the marks are curve dividing points. In other words, the above-mentioned blocks in which the contours of characters are divided into monovalent functions include those that include a straight line part (indicated by *), and those that are formed by two intersecting strokes and a point where the slope suddenly changes (point of inflection). However, at the boundary between a curve and a straight line and at an inflection point (indicated by a *), the line is divided into multiple blocks to facilitate function expression.
直線部は、上記標本点間距離が所定値以上のものをいう
。直線部は１次長項式で表現し、曲線部はｎ次（２次ま
たは３次）多項式で表現する。ｎ次多項式の係数は、曲
線近似する区間の両端座標とその傾きより決定する。曲
線近似を行なうには、各輪郭点（輪郭上の点）における
傾きを求め、次に輪郭上の２つの輪郭点により近似曲線
を決定し、該近似曲線と輪郭との偏位量を各輪郭点につ
き求め、今、問題とする近似曲線区間における各偏位量
が許容誤差以下の場合は輪郭点を１つ前進させて同様処
理を繰り返し、該偏位量が許容誤差内で最長となる区間
（サンプル区間）を決定し、輪郭を該サンプル区間毎に
分割する。このサンプル区間を表わすｎ次多項式で輪郭
曲線部が近似される。The straight line section refers to a section where the distance between the sample points is greater than or equal to a predetermined value. The straight line portion is expressed by a first-order long term, and the curved portion is expressed by an n-th order (second-order or third-order) polynomial. The coefficients of the n-th degree polynomial are determined from the coordinates of both ends of the curve-approximating section and its slope. To perform curve approximation, find the slope at each contour point (point on the contour), then determine the approximate curve using the two contour points on the contour, and calculate the deviation between the approximate curve and the contour for each contour. If each deviation in the approximation curve section in question is less than the allowable error, move the contour point forward by one and repeat the same process to find the section where the deviation is the longest within the allowable error. (sample section) is determined, and the contour is divided into each sample section. The contour curve portion is approximated by an n-th degree polynomial representing this sample section.
この詳細は特開昭６０−７５９７５．同７５９７６、同
７５９７７．同１７９７８．同７５９７９にある。Details of this can be found in Japanese Patent Application Laid-Open No. 60-75975. 75976, 75977. 17978. It is located at 75979.
この従来の方法では、ブロック内で曲線近似し、該曲線
と輪郭点との偏位量が許容誤差以下なら輪郭点を１つ増
やし、偏位置をチェックして許容誤差以下なら再び輪郭
点を１つ増やし、という逐次処理を行なうので効率が悪
い。In this conventional method, a curve is approximated within a block, and if the amount of deviation between the curve and the contour point is less than the tolerance, the contour point is increased by one, the offset is checked, and if it is less than the tolerance, the contour point is increased by one again. It is inefficient because it performs sequential processing of increasing the number by one.
また従来の方法では、直線部以外の全ての曲線部に曲線
近似を行なうので効率が悪い。文字拡大、縮小で凹凸が
目立つのは、左はらい、右はらい等の長い曲線ストロー
クや斜め線であり、飾りのような短い部分では目立たな
いので簡略化が可能である。Furthermore, in the conventional method, curve approximation is performed for all curved sections other than straight sections, which is inefficient. When characters are enlarged or reduced, unevenness is noticeable in long curved strokes and diagonal lines such as the left edge and right edge, but it is not noticeable in short parts such as decorations, so it can be simplified.
また従来の方法では、曲線振動現象を考慮していないの
で、適切な曲線近似ができない場合が生じる。即ち、従
来方法で輪郭線を分割し曲線近似すると、１ブロツク内
で拡大値と極小値が両方存在する曲線を多項式近似する
場合があり、そのため極大値と極小値が両方存在しない
ブロックを曲線近似する場合得られた曲線が振動してい
ないかどうか判定することができず、常に適切な曲線を
当て嵌め、美しいパターンを生成できるとは限ら、ない
。これに対しては予め曲線近似する前に極大値と極小値
の数を調べ、曲線近似後に確認することが考えられるが
、輪郭点列から正確な極大値と極小値の数を算出するこ
とは難しい。Furthermore, since the conventional method does not take curve vibration phenomena into consideration, there are cases where appropriate curve approximation cannot be performed. In other words, when dividing the contour line and approximating the curve using the conventional method, a curve in which both an enlarged value and a local minimum value exist within one block may be approximated by a polynomial. In this case, it is not possible to determine whether the obtained curve is vibrating or not, and it is not always possible to fit an appropriate curve and generate a beautiful pattern. To solve this problem, it is possible to check the number of maximum and minimum values before approximating the curve, and then check the number after approximating the curve, but it is not possible to calculate the exact number of maximum and minimum values from the contour point sequence. difficult.
また従来方法では、曲線近似を行なう際、参照点として
輪郭点のみ使用するが、１プロツ、り内の輪郭点が少な
い場合誤差を計算する参照点が少ないため、適切な曲線
が得られるとは限らない。In addition, in the conventional method, only contour points are used as reference points when approximating a curve, but if there are few contour points within one plot, there are fewer reference points for calculating errors, so it is difficult to obtain an appropriate curve. Not exclusively.
本発明はこのような点を改善したパターン圧縮、復元、
生成方式特にパターンデータ圧縮方式を提供しようとす
るものである。The present invention provides pattern compression, restoration, and
It is intended to provide a generation method, particularly a pattern data compression method.
本発明のパターン圧縮方式の原理ブロック図を第１図に
示す。この図に示すように本発明は、入カバターン（文
字、図形のドツトパターン）１０から屈曲点（屈曲部を
表わす点で、前記ブロックの始終点、標本点および曲線
分割点に相当）を抽出する処理（１２）と、屈曲点の座
標値から水平、垂直線を認識しまた飾りを抽出しこれら
の屈曲点の座標値を記憶する処理（１４，１６）と、斜
め線及び曲線ストロークを抽出する処理（１８）と、屈
曲点のみを使って輪郭近似多項式（ｎ次のスプライン関
数）の各係数を算出する処理（２２）と、屈曲点が少な
い部分に対しＤＤＡにより直線辺イ以を行なう斜め線及
び曲線ストロークの輪郭復元処理（２８）と、求めた多
項式が振動していないか否かを判定する処理（２４）と
、得られた多項式の係数と曲線近似した区間の両端点の
座標値（曲線近似による圧縮データ）を記憶する処理（
２６）と、水平、垂直線及び飾りを直線近似した圧縮デ
ータを記憶する処理（２０）からなる。A block diagram of the principle of the pattern compression method of the present invention is shown in FIG. As shown in this figure, the present invention extracts bending points (points representing bending parts, corresponding to the start and end points of the block, sample points, and curve dividing points) from the input cover pattern (dot pattern of characters and figures) 10. Processing (12), Processing (14, 16) of recognizing horizontal and vertical lines from the coordinate values of bending points, extracting ornaments, and storing the coordinate values of these bending points, and extracting diagonal lines and curved strokes. Processing (18), Processing (22) of calculating each coefficient of the contour approximation polynomial (n-th order spline function) using only the bending points, and Diagonal calculation of straight-line sides A and D using DDA for parts with few bending points. Contour restoration processing for line and curve strokes (28), processing for determining whether or not the obtained polynomial is oscillating (24), and the coefficients of the obtained polynomial and the coordinate values of both end points of the section approximated by the curve. Process of storing (compressed data by curve approximation) (
26), and a process (20) of storing compressed data obtained by linear approximation of horizontal and vertical lines and decorations.
この方式によれば、水平線、垂直線、及び飾りは除いて
、斜め線及び曲線ストロークにのみ曲線近似を適用する
ので、ベクトル文字を拡大、縮小した場合に凹凸が目立
つ右はらい、左はらい等の長い曲線ストローク又は斜め
線を美しいパターンで再生でき、しかも効率の良いデー
タ圧縮を行なうことができる。According to this method, curve approximation is applied only to diagonal lines and curved strokes, excluding horizontal lines, vertical lines, and decorations, so when vector characters are enlarged or reduced, unevenness is noticeable such as on the right edge or left edge. Long curved strokes or diagonal lines can be reproduced in beautiful patterns, and data can be compressed efficiently.
また曲線近似される各セグメント内に極大値と極小値が
存在しないため、得られた曲線の振動現象の有無を容易
に調べることができ、適切な曲線が求められる。Furthermore, since there are no local maximum values and local minimum values within each segment to which the curve is approximated, it is possible to easily check whether or not there is a vibration phenomenon in the obtained curve, and an appropriate curve can be determined.
また各セグメントは、曲線の接線方向が類似しており、
２次の多項式でもある程度良好に近似できるなど、各セ
グメントは曲線近似しやすく分割されている。そのため
セグメントを曲線近似の精度によって変更することがな
く、処理効率の点でよい。Also, each segment has similar tangential directions to the curve,
Each segment is divided to facilitate curve approximation, such as even a quadratic polynomial can be approximated to some extent. Therefore, the segments are not changed depending on the accuracy of curve approximation, which is good in terms of processing efficiency.
更に、曲線近似のとき参照とする点を屈曲点だけでなく
、場合によっては輪郭点を使うので、誤差を計算する参
照点が少なくて通切な曲線が得られないことがない。Furthermore, since not only inflection points are used as reference points during curve approximation, but contour points are also used in some cases, there is no possibility that a complete curve cannot be obtained due to a small number of reference points for calculating errors.
このパターン圧縮方式は水平線、垂直線、および飾りに
対して直線近似を適用する処理と、斜め線および曲線ス
トロークに対して曲線近似を通用する処理の２つが主要
なものであるが、前者については既出側の■「パターン
情報量圧縮方式」（特願昭６Ｏ−４８８９５）および■
「パターンの相似変換方式」 （特願昭６Ｏ−２８２２
７１）を利用できる。There are two main types of this pattern compression method: one that applies linear approximation to horizontal lines, vertical lines, and decorations, and the other that applies curve approximation to diagonal lines and curved strokes. ■ “Pattern information compression method” (patent application 1986-48895) and ■
"Pattern similarity conversion method" (Patent application 6O-2822
71) can be used.
印刷された漢字などは直線部が多く、それに飾りが付い
ている。第１０図にその一例を示す。直線部の端点が屈
曲点になる。屈曲点は勿論、飾り１、斜め線及び曲線ス
トロークにもあり、図では濃いスポットが屈曲点である
。輪郭線上の各屈曲点を抽出すれば、これらの屈曲点の
座標情報で輪郭線を表現でき、ドツトデータで文字パタ
ーンを持つ方式に比べて大幅なデータ圧縮が可能になる
。屈曲点は上記■に記載の方法で求めることができる。Many of the printed kanji have straight lines, and they have decorations attached to them. An example is shown in FIG. The end point of the straight line becomes the bending point. Of course, there are bending points in decoration 1, diagonal lines, and curved strokes, and the dark spots in the figure are bending points. By extracting each bending point on the contour line, the contour line can be expressed using the coordinate information of these bending points, making it possible to significantly compress data compared to a method that uses dot data as a character pattern. The bending point can be determined by the method described in ① above.
即ち、文字輪郭線は閉ループを作るので、ドツト群で表
わされる輪郭線の隣接２点を始点Ｐｓ、終点ｐｅとして
点Ｐを終点より始点へ遠廻りしながら輪郭線上で辿らせ
、ＤＤＡ （Ｄｉｇｉｔａｌ Ｄｉｆｆｅｒｅｎ−ｔｉ
ａｌ Ａｎａｌｙｚｅｒ ）で点ＰとＰｓを結ぶ直線を
発生し、該直線と輪郭線とのずれを調べる。点Ｐｓが角
にあるとすると、点Ｐがその１つ手前の角に来たとき上
記ずれはなくなるからそのときの点Ｐの位置（Ｐ＋とす
る）を屈曲点とする。次は点Ｐ１をＰｓ相当とし、同様
処理を行なうとＰｌの１つ手前の屈曲点が発見でき、以
下同様にして輪郭線上の全屈曲点を求めることができる
。That is, since the character contour line forms a closed loop, two adjacent points of the contour line represented by a group of dots are set as the starting point Ps and the ending point pe, and the point P is traced on the contour line while detouring from the ending point to the starting point. -ti
A straight line connecting the points P and Ps is generated using the Al Analyzer), and the deviation between the straight line and the contour line is examined. Assuming that the point Ps is at a corner, the above-mentioned deviation disappears when the point P comes to the corner one place before it, so the position of the point P at that time (denoted as P+) is set as the bending point. Next, point P1 is set to correspond to Ps, and by performing the same processing, the bending point one point before Pl can be found, and all bending points on the contour can be found in the same manner.
上記■には輪郭を折れ線近似する各線分の統合、線群、
飾り検出、線幅制御などが開示されている。The above ■ includes the integration of each line segment that approximates the contour with a polygonal line, line groups,
Decoration detection, line width control, etc. are disclosed.
例えば第１）図の如き漢字「大」の折れ線近似において
、ＰＩ〜Ｐ２４は屈曲点、Ｌ１〜Ｌ２４はこれらを結ぶ
線分である。線分は水平線、垂直線などに分けられ、同
種のものは統合し、統合した線分の水平方向のものには
Ｅｌ、Ｅ３．・・・・・・垂直方向のものにはＥ２．Ｅ
４．・・・・・・などの輪郭線番号を与える。線分Ｌ２
など水平／垂直方向にないもの（所定のルールに合わな
いもの）には輪郭線番号は付さない。Ｅｉ （ｉ＝１
．２．・・・・・・）が付いた輪郭については対になる
ものを重なり度と距離から求め、線群Ｇ１．Ｇ２．・・
・・・・を求める。飾りは、線群の端部、または角を作
る２線群の該角部にあるものとして求める。Ｐｌは線群
Ｇ１の左の飾り、Ｐ２は同右の飾り、Ｐ６は線群Ｇ２の
上の飾り、Ｐ２Ｏは線群Ｇ３の下の飾り・・・・・・で
ある。For example, in the polygonal line approximation of the kanji character "dai" as shown in Figure 1), PI to P24 are bending points, and L1 to L24 are line segments connecting them. Line segments are divided into horizontal lines, vertical lines, etc. Line segments of the same type are integrated, and the horizontal lines of the integrated line segments are El, E3.・・・・・・E2 for vertical direction. E
4. Give a contour number such as... Line segment L2
Contour numbers are not assigned to items that are not in the horizontal/vertical direction (those that do not meet the predetermined rules). Ei (i=1
．． 2. ...), the pair is determined from the degree of overlap and the distance, and line group G1. G2.・・・
Find... The decoration is determined as being at the end of a group of lines or at the corner of two groups of lines forming a corner. Pl is the decoration on the left of the line group G1, P2 is the decoration on the right, P6 is the decoration above the line group G2, P2O is the decoration below the line group G3, and so on.
斜め線は、水平線、垂直線、および飾り以外の線分とす
る。Diagonal lines are horizontal lines, vertical lines, and line segments other than decorative lines.
水平線、垂直線の検出は屈曲点の座標値を使って簡単に
行なえる。例えば線分の両端の屈曲点をＰｉ （Ｘｉ
、Ｙｉ）、Ｐｊ （Ｘｊ、Ｙｊ）とすれば、Ｘ１＝Ｘ
ｊ、Ｙｉ嫉Ｙｊなら垂直線、Ｙ ｉ ＝Ｙ３．Ｘｌ５Ｘ
ｊなら水平線である。Horizontal and vertical lines can be easily detected using the coordinate values of bending points. For example, the bending points at both ends of the line segment are Pi (Xi
, Yi), Pj (Xj, Yj), then X1=X
j, Yi jealous Yj, then vertical line, Y i =Y3. Xl5X
If j, it is a horizontal line.
別途出願した■「斜め線及び曲線ストロークの抽出方式
」 （特願昭６１− ）では、次のようにして
斜め線及び曲線ストロークの輪郭線を識別する。即ち該
輪郭線を表わす屈曲点列のグループがＮ群存在し、その
第１群の屈曲点数を町。In the separately filed ``Method for Extracting Diagonal Lines and Curved Strokes'' (Japanese Patent Application No. 1988-), the outlines of diagonal lines and curved strokes are identified as follows. That is, there are N groups of bending point sequences representing the contour line, and the number of bending points in the first group is expressed as N.
第１群の各屈曲点をＰｊｉ（こ−でｉ＝１．２．ｎｊ。Let each bending point of the first group be Pji (where i=1.2.nj.
３＝Ｌ ２．・・・・・・Ｎ）、第１群の各屈曲点の
Ｘ。3=L 2. ...N), X of each bending point of the first group.
ｙ座標をＸ （Ｐｊｉ） 、 Ｙ （Ｐｊｉ）として次
のステップ１〜５の処理を行ない、上記輪郭線を識別す
る。The following steps 1 to 5 are performed with the y coordinates being X (Pji) and Y (Pji) to identify the above contour line.
ステップＩ・・・・・・各群の輪郭線の長さＤｊ′を計
算する。Step I: Calculate the length Dj' of the contour line of each group.
Ｄｊ’＝ ”ｊ （（Ｘ（Ｐｊｉ＋１ ） Ｘ（Ｐ ｊ
ｉ））２＋（Ｙ（Ｐｊｉ＋１）−ｉ＝１
Ｙ（Ｐｊｔ））２］ ・・・・・・・・・（１）イ且
しＸ （Ｐｊｎｊ＋１ ） ＝Ｘ （Ｐｊ＋１））Ｙ
（Ｐｊｎｊ＋１ ） ＝Ｙ （Ｐｊ＋１））ステップ２
・・・・・・閾値をＤｔｈとしてＩ）ｊ’＞Ｄｔｈを満
たす群（ｊとする）に注目する。群ｊの属性ＡＴＲ（Ｊ
）に対して群にの属性Ａ Ｔ Ｒ（ｋ）が表１の対応表
を満たす群ｋを群ｊのマツチング候補とする。Dj'= ”j ((X(Pji+1) X(Pj
i))2+(Y(Pji+1)-i=1 Y(Pjt))2] ・・・・・・・・・(1) I and X (Pjnj+1) =X (Pj+1))Y
(Pjnj+1) =Y (Pj+1)) Step 2
. . . Letting the threshold value be Dth, attention is paid to a group (referred to as j) that satisfies I) j'>Dth. Attribute ATR(J
), the group k whose attribute ATR(k) satisfies the correspondence table of Table 1 is set as a matching candidate for group j.
表 １
矢印は前記群の方向を示しており、そして第１図に示し
たように文字の輪郭は１つの方向、本例では時計方向に
辿るので各画（カフ）の上／下縁、左／右縁は辿る方向
が逆になる。従って表１の関係がある群ｊ、には斜めの
画を構成する条件の１つを満たしている。Table 1 The arrows indicate the direction of the group, and as shown in Figure 1, the outline of the letter follows one direction, in this case clockwise, so the upper/lower edge of each stroke (cuff), left /The right edge is traced in the opposite direction. Therefore, the group j having the relationship shown in Table 1 satisfies one of the conditions for forming a diagonal picture.
ステップ３・・・・・・群ｊの対応候補である全ての群
ｋに対して次の識別量を計算する。Step 3: Calculate the next discrimination amount for all groups k that are correspondence candidates for group j.
Ｄｊｋ＝ （Ｍｊ−Ｍｋ）＋ Ｉ Ｄ ｊ’ −Ｄｋ’
ｌ・・・・・・（２）
こ＼で（２）式の右辺第１項は輪郭線間の距離を表わし
、同第２項は輪郭線の長さの差である。上記距離は両輪
郭線の中点におけるそれとする。Djk= (Mj-Mk)+I Dj'-Dk'
l...(2) Here, the first term on the right side of equation (2) represents the distance between the contour lines, and the second term represents the difference in length between the contour lines. The above distance is that at the midpoint of both contours.
ステップ４・・・・・・群ｊは識別１Ｄｊｋを最小にす
る群とマツチングする（これらの群は画の両縁とする）
。Step 4...Group j is matched with the group that minimizes the discrimination 1Djk (these groups are assumed to be both edges of the image)
.
ステップ５・・・・・・全てのｊに対してステップ２〜
４を行なう。Step 5...Step 2~ for all j
Do step 4.
斜め線及び曲線ストロークの抽出を行なった屈曲点デー
タの一例が第１０図に示しである。この図では見にくい
が、水平線または垂直線の屈曲点゛には旧印が、飾り部
の屈曲点にはｔ印が、斜め線と曲線ストロークの屈曲点
には０と数字が付されている。特に数字は、斜め線及び
曲線ストロークの輪郭線ペアを示す。上記論理で抽出し
た輪郭線ペアは、各々接線方向が類似で、かつ極大値と
極小値が存在しない１価関数となる。An example of bending point data from which diagonal lines and curved strokes have been extracted is shown in FIG. Although it is difficult to see in this figure, the bending points of horizontal or vertical lines are marked with old marks, the bending points of decorations are marked with t marks, and the bending points of diagonal lines and curved strokes are marked with 0 and numbers. In particular, the numbers indicate contour pairs of diagonal lines and curved strokes. The contour pairs extracted by the above logic are monovalent functions in which the tangential directions are similar and there is no maximum value or minimum value.
この出願■の方式では斜め線および曲線ストロークを直
線近似するが、直線近似は拡大、縮小で凹凸が目立つよ
うになる。そこで本発明では、輪郭線ペアの各々に曲線
近似を適用する。曲線近似には第９図で述べた方法があ
るが、本発明ではｎ次のスプライン関数による平滑化方
式、特に数値的に安定であるＢ −５ｐｌｉｎｅ関数に
よるそれを用いる。In the method of this application (2), diagonal lines and curved strokes are approximated by a straight line, but when the linear approximation is enlarged or reduced, unevenness becomes noticeable. Therefore, in the present invention, curve approximation is applied to each pair of contour lines. Although the method described in FIG. 9 is available for curve approximation, the present invention uses a smoothing method using an nth-order spline function, particularly a B-5 pline function that is numerically stable.
曲線近似： Ｂ−Ｓｐｌｉｎｅ平滑化方式には、節点
列を外部から与える固定節点式と、節点列を内部で適応
的に与える節点追加方式または逐次分割方式がある。節
点列の与え方は幾通りもあり、曲線の形状によって異な
るので、本発明では後者の節点追加方式を採る。Ｂ −
５ｐｌｉｎｅ関数による平滑化方式（節点追加方式）の
一般式Ｓ （Ｘｌを（３）式に示す。Curve approximation: The B-Spline smoothing method includes a fixed node method in which a node string is provided externally, and a node addition method or sequential division method in which a node string is adaptively provided internally. Since there are many ways to provide a node sequence, which differ depending on the shape of the curve, the latter method of adding nodes is adopted in the present invention. B-
The general formula S (Xl) of the smoothing method (node addition method) using the 5-pline function is shown in equation (3).
但しｍは次数、ｎ、は節点の数、Ｃｊは係数、Ｎｊ、ｍ
＋１は（ｍ＋１）階の差分商
（３）式の係数Ｃｊは、最小２乗近似的条件から求めら
れる。具体的には（４）式の評価式を満足するように決
める。However, m is the degree, n is the number of nodes, Cj is the coefficient, Nj, m
+1 is the (m+1)th order difference quotient. The coefficient Cj of equation (3) is obtained from the least squares approximation condition. Specifically, it is determined so as to satisfy the evaluation formula (4).
但しδ２は残差２乗和、δ２ｔｈは残差ｔｈ２乗和の闇
値、ｙｌ はｉ番目参照点のｙ座標値、σ１′は観測誤
差、ｎは参照点の総数
こ−で観測誤差σ１２は、参照点の重み即ちどの点を重
要視するかを表わす点である。こ−では、スプライン関
数の次数ｍを３とし、観測誤差σ１′は、各参照点を統
計量とみなし相対誤差が一定になるように次の如く与°
える。However, δ2 is the sum of squared residuals, δ2th is the dark value of the sum of squared residuals th, yl is the y-coordinate value of the i-th reference point, σ1' is the observation error, n is the total number of reference points, and the observation error σ12 is , which represents the weight of the reference point, that is, which point is considered important. Here, the order m of the spline function is set to 3, and the observation error σ1' is given as follows so that each reference point is regarded as a statistical quantity and the relative error is constant.
I can do it.
σＩ／）’＋＝一定 ・・・・・・（５
）振動判定： 前記のように本発明では曲線近似の対象
となる各セグメント（線分）内に極大値、極小値は存在
しないので、これを調べることにより振動が起きている
か否か判定できる。極大値、極小値の有無は、得られた
曲線を細かく分割し、各点の微係数の符号を調べれば分
るが、微係数算出の手間を省くため、これは次のように
行なう。σI/)'+=constant ・・・・・・(5
) Vibration determination: As described above, in the present invention, there are no local maximum values or local minimum values within each segment (line segment) that is the target of curve approximation, so by examining this it is possible to determine whether vibration is occurring. The presence or absence of local maximum values and local minimum values can be determined by dividing the obtained curve into small pieces and checking the sign of the differential coefficient at each point, but in order to save the effort of calculating the differential coefficient, this is done as follows.
各セグメントは、屈曲点間のベクトルを９０”おきの４
方向に分類し、その属性を基に決定しておくので、各分
割区間の属性を調べることにより極大値と極小値の有無
が分り、振動の有無を判定できる。分割した１番目の点
のＸ座標をＸｚ ＋ ３’座標を５（ｘｚ）とすると
、（Ｊ＋１）とｌの区間で（ｘｔ＋１＋Ｘｔ）の正負と
（Ｓ （ｘｔ＋１） −５（ｘＬ））の正負を調べるこ
とにより属性が分る。次に振動判定の処理ステップを示
す。Each segment divides the vector between the inflection points into 4
Since the directions are classified and determined based on the attributes thereof, by examining the attributes of each divided section, the presence or absence of local maximum values and local minimum values can be determined, and the presence or absence of vibration can be determined. If the X coordinate of the first divided point is Xz + 3' coordinate is 5 (xz), then in the interval between (J + 1) and l, the positive and negative of (xt + 1 + Xt) and the positive and negative of (S (xt + 1) - 5 (xL)) The attributes can be determined by examining the . Next, processing steps for vibration determination will be described.
ステップト・・・・・曲線を、分割点をＮ ｓ ｌ［ｌ
として（Ｎｓ−１）（ＩＩに分割する。Stepped... Curve, dividing point N s l[l
(Ns-1) (II).
ステップ２・・・・・・分割点β＝１の属性を求める。Step 2: Find the attribute of the dividing point β=1.
（Ｘ２ ｘ＋）と（Ｓ （Ｘ２） Ｓ （ＸＩ））
の正負を判定することにより、表２に示す属性を決定す
る。(X2 x+) and (S (X2) S (XI))
The attributes shown in Table 2 are determined by determining the sign of .
ステップ３・・・・・・分割点１＝２の属性を同様な方
法で求め、／＝１の属性と一致しているか否か調べる。Step 3: Obtain the attribute of division point 1=2 in a similar manner, and check whether it matches the attribute of /=1.
ステップ４・・・・・・もし属性が一致していればｌ＝
３についても属性を求め、！＝１との属性の一致／不一
致を調べる。属性が一致しなければ振動ありと判定し、
処理を打ち切る。Step 4...If the attributes match, l=
Find the attributes for 3 as well! Check the attribute match/mismatch with =1. If the attributes do not match, it is determined that there is vibration,
Abort processing.
ステップ５・・・・・・ｌ＝４から１＝Ｎｓ−１までス
テップ４の処理を行ない、１＝Ｎｓ−１まで属性の一致
が確認できれば振動なしと判定する。Step 5: The process of step 4 is performed from 1=4 to 1=Ns-1, and if it is confirmed that the attributes match up to 1=Ns-1, it is determined that there is no vibration.
表 ２
斜め線及び曲線ストロークの輪郭復元： これは前記（
３）式により行なう。なお屈曲点が少ない場合は（４）
式により得られる誤差の信頼性が薄く、また振動現象も
生じやすいため、適切な曲線を得ることが難しい。そこ
で屈曲点数が少ない場合は、屈曲点間をＤＤＡにより発
生させた直線で結び、参照点を増やして曲線近似を行な
う。また屈曲点が多い場合でも（４）式の誤差条件と前
項の振動判定の条件を満足しないとき、屈曲点間をＤＤ
Ａで結び、参照点を増やして曲線近似を行なう。Table 2 Contour restoration of diagonal lines and curved strokes: This is as described above (
3) Performed by the formula. In addition, if there are few bending points, (4)
It is difficult to obtain an appropriate curve because the reliability of the error obtained by the formula is low and vibration phenomena are likely to occur. Therefore, when the number of bending points is small, the bending points are connected by straight lines generated by DDA, and the number of reference points is increased to perform curve approximation. In addition, even if there are many bending points, if the error condition of equation (4) and the vibration judgment condition of the previous section are not satisfied, the distance between the bending points is
Connect at A, increase the number of reference points, and perform curve approximation.
このようにして得た文字、図形パターンの圧縮データの
復元およびパターン生成は次のようにして行なう。Restoration of the compressed data of character and graphic patterns obtained in this manner and pattern generation are performed as follows.
パターンの復元および生成： これは第６図に示すよう
に、水平、垂直線、および飾りに対する、屈曲点の線形
変換、ＤＤＡによる輪郭復元、また斜め線及び曲線スト
ロークに対する、多項式の線形変換、関数値算出、輪郭
復元、直線近似部と曲線近似部の接続、および塗りつぶ
し、で処理される。Pattern restoration and generation: As shown in Figure 6, this includes linear transformation of bending points for horizontal, vertical lines and ornaments, contour restoration by DDA, and linear transformation of polynomials and functions for diagonal lines and curved strokes. Processing includes value calculation, contour restoration, connection of the straight line approximation part and curve approximation part, and filling.
多項式の線形変換は次のようにして行なう。式（６）に
示すように、式（３）で得られた多項式Ｓ （Ｘ）を多
項式Ｓ （ｘ’ ）に線形変換する。Linear transformation of polynomials is performed as follows. As shown in Equation (6), the polynomial S (X) obtained by Equation (3) is linearly transformed into polynomial S (x').
この処理は第２図のようにＸ軸、Ｓ ＦＸ）軸のスケー
ルを（６）式の関係にあるＸ’ 、Ｓ （ｘ’ ）に変
換することに相当する。例えば拡大、縮小変換する場合
は、その変換倍率をαとして、αＸ＝αＳｘα、βＸ＝
βＳ＝Ｏと設定する。また圧縮データから復元する場合
はαＸ＝αＳ＝１．βＸ−βＳ＝０と設定する。 。This processing corresponds to converting the scales of the X-axis and SFX) axis into X' and S(x') having the relationship expressed by equation (6), as shown in FIG. For example, when performing enlargement or reduction conversion, the conversion magnification is α, αX=αSxα, βX=
Set βS=O. Also, when restoring from compressed data, αX=αS=1. Set βX−βS=0. .
関数値算出は次の如く行なう。Ｘ＋’からｘｎまでｌ
Ｘｉ＋１ ’ −Ｘｉ ’ ｌ ＝１となるｉ＝１′
〜ｎ′のｘ１′に対して各Ｓ （１＋ ’ ）を算出す
る。Function value calculation is performed as follows. l from X+' to xn
i=1' such that Xi+1'-Xi' l =1
Each S (1+') is calculated for x1' of ~n'.
Ｓ （ｘ、 ” ）はＳ （ｘｔ ）より求まルノテ、
元ノｘ、５（ｘ）座標系であるサンプル間隔ΔＸごとに
５（ｘｌ）を算出し、（６）式のα５ｓ（Ｘｌ） ＋β
ＳよりＳ （ｘ、 ’ ）が求まる。例えば拡大、縮小
変換の場合αＸ＝αＳ＝α、βＸ＝βＳ＝Ｏであるから
Ｘｌ ’ ／ １２ ＝ ｘｌ となり、元のｘ、５
ｉｘ）座標系でサンプル間隔１／α毎にＳ （Ｘｌ ）
を算出する。例を挙げるとα＝２の場合（２倍に拡大す
るとき）第３図に示すように、０．５間隔でＳ （ｘ、
）を算出し、２Ｓ （ｘ、 ）より拡大した座標系で
の輪郭点の座標値を計算できる。S (x, ”) is found from S (xt),
Calculate 5(xl) for each sample interval ΔX, which is the original x, 5(x) coordinate system, and calculate α5s(Xl) + β of equation (6).
S (x, ') is found from S. For example, in the case of expansion and contraction conversion, αX = αS = α, βX = βS = O, so Xl ' / 12 = xl, and the original x, 5
ix) S (Xl) at every sample interval 1/α in the coordinate system
Calculate. For example, when α=2 (when enlarging twice), as shown in Figure 3, S (x,
), and the coordinate values of the contour points in the coordinate system expanded from 2S (x, ) can be calculated.
輪郭復元は次のようにして行なう。多項式の線形変換を
行ない、あるＸ座標に対応した関数値５（Ｘｌを算出す
ることにより輪郭点が求まる。このとき隣り合う輪郭点
間が４連結又は８連結で結びつかない場合が生じる。例
えば拡大、縮小変換する場合、第４図に示すように曲線
の傾きが４５°を超えると隣り合う輪郭点間が４連結あ
るいは８連結で結びつかなくなる。なお図中Ｏ印は曲線
近似により求まる輪郭点である。このような場合は輪郭
点○即問を、ＤＤＡで発生させた直線で結ぶ。Contour restoration is performed as follows. Contour points are found by performing linear transformation of the polynomial and calculating the function value 5 (Xl) corresponding to a certain X coordinate. At this time, there may be cases where adjacent contour points are not connected by 4 or 8 connections. When performing reduction conversion, as shown in Figure 4, if the slope of the curve exceeds 45°, adjacent contour points will no longer be connected by 4-connections or 8-connections.The O marks in the figure are contour points found by curve approximation. Yes.In such a case, connect the contour points ○ with a straight line generated by DDA.
Δ印がそれ、即ち直線近似で穴埋めする輪郭点である。The Δ mark is the contour point to be filled with straight line approximation.
直線近似部と曲線近似部の接続： 直線近似部の輪郭復
元は第６図左側に示したように圧縮データである屈曲点
座標値を読取り、次に屈曲点座標値の線形変換を行なっ
た後、屈曲点間をＤＤＡによって結び、輪郭復元する。Connection of the straight line approximation part and the curve approximation part: To restore the contour of the straight line approximation part, as shown on the left side of Figure 6, read the bending point coordinate values, which are compressed data, and then linearly transform the bending point coordinate values. , the bending points are connected by DDA and the contour is restored.
輪郭復元の順序は圧縮データに依存する。本例では原パ
ターンから屈曲点を抽出するときに用いた輪郭追跡の順
序に従う。直線近似部と曲線近イ以部は、それらを示す
泥性を読取り、各々の処理を行なう。圧縮データに変形
変換を通用し、パターン生成を行なう場合に、直線近似
部の端点と曲線近似部の端点が一致しない場合が生じる
。これに対しては端点間をＤＤＡで結びつける処理を行
ない、直線近似部と曲線近似部を接続する。The order of contour restoration depends on the compressed data. In this example, the order of contour tracing used when extracting bending points from the original pattern is followed. The linear approximation section and the curve approximation section read the muddy properties that indicate them and perform the respective processing. When a pattern is generated by applying deformation transformation to compressed data, the end points of the linear approximation section and the end points of the curve approximation section may not match. For this purpose, processing is performed to connect the end points using DDA to connect the straight line approximation section and the curve approximation section.
塗りつぶし： 算出した全輪郭点に対し、輪郭点で囲ま
れた内部領域に対する塗りつぶしパターンを生成する。Filling: For all calculated contour points, a fill pattern is generated for the internal area surrounded by the contour points.
このとき各輪郭点が内部に属する点か外部に属する点（
判別点）かを判別し、判別点を用いて内部領域を塗りつ
ぶす。In this case, each contour point is either a point belonging to the interior or a point belonging to the exterior (
(discrimination point) and fills the internal area using the discrimination point.
第５図は本発明の効果を示す図で、［ａ）は直線近似に
よる拡大変換（屈曲点の座標値に変換倍率を掛けて拡大
サイズの屈曲点の座標値を求め、その屈曲点間をＤＤＡ
で結んで輪郭を復元したのち塗りつぶしを行なう）の結
果例、（ｂ）は本発明方式による拡大変換の結果例であ
る。いずれも１０４×１０４サイズのものを１８０Ｘ１
８０サイズに拡大した。（ａｌでははらい部に欠けが見
られるが（ｂｌではこれが除かれている。FIG. 5 is a diagram showing the effects of the present invention, and [a] is an enlargement conversion by linear approximation (the coordinate values of the bending points are multiplied by the conversion magnification to obtain the coordinate values of the bending points of the enlarged size, and the coordinates of the bending points of the enlarged size are calculated. D.D.A.
(b) is an example of the result of enlarging conversion using the method of the present invention. Both are 104x104 size 180x1
Expanded to 80 size. (Although there is a chip on the heel in the al, this has been removed in the bl.
第７図は第１図と同種の図であるが、対象を文字に限定
している。屈曲点の属性とは前述の方向性などである。FIG. 7 is a diagram of the same type as FIG. 1, but the object is limited to characters. The attributes of the bending point include the above-mentioned direction.
第８図は第７図で得られた圧縮データを用いて拡大、縮
小を行ない、それを復元、表示する処理要領を示し、第
６図に対応する。FIG. 8 shows a processing procedure for enlarging and reducing the compressed data obtained in FIG. 7, and restoring and displaying it, and corresponds to FIG. 6.
本発明のパターン圧縮方式によれば、直線近似では余り
データ圧縮できない曲線部分にはｎ次スプライン関数に
よる曲線近似を行なうので、曲線部分の数多い屈曲点の
代りに多項式の係数を記憶すればよく、大幅なデータ圧
縮が可能になる。特にこの効果は、サイズの大きいパタ
ーンに対して著しい。また本発明の圧縮方式によれば、
曲線近似のとき生じる振動現象を防止することができ、
また斜め線及び曲線ストロークを抽出してこれにのみ曲
線近似を行なうので、効率よく美しいパターンを生成す
ることができる。このため拡大／縮小変換だけでなく本
発明は、線幅制御など種々の線形変換に対して斜め線や
曲線ストロークの美しい高品質パターンを生成するのに
利用できる。According to the pattern compression method of the present invention, curve approximation is performed using an n-th order spline function for curve parts whose data cannot be compressed much by linear approximation, so it is only necessary to store polynomial coefficients instead of the many bending points of the curve part. Significant data compression becomes possible. This effect is particularly significant for large-sized patterns. Furthermore, according to the compression method of the present invention,
It is possible to prevent vibration phenomena that occur during curve approximation,
Furthermore, since diagonal lines and curved strokes are extracted and curve approximation is performed only on these, beautiful patterns can be efficiently generated. Therefore, in addition to enlargement/reduction conversion, the present invention can be used to generate beautiful high-quality patterns of diagonal lines and curved strokes for various linear conversions such as line width control.
第１図は本発明の原理ブロック図、
第２図は多項式の線形変換の説明図、
第３図は関数値の算出要領の説明図、
第４図は輪郭復元要領の説明図、
第５図は拡大変換例の説明図、
第６図は復元、生成要領の説明図、
第７図および第８図は具体例の説明図、第９図は従来の
曲線近似例の説明図、
第１０図は斜め線の抽出例を示す説明図、第１）図は折
れ線近似の説明図である。Figure 1 is a block diagram of the principle of the present invention. Figure 2 is an illustration of linear transformation of polynomials. Figure 3 is an illustration of how to calculate function values. Figure 4 is an illustration of contour restoration procedures. Figure 5 is an explanatory diagram of an enlargement conversion example, Fig. 6 is an explanatory diagram of restoration and generation procedures, Figs. 7 and 8 are explanatory diagrams of specific examples, Fig. 9 is an explanatory diagram of a conventional curve approximation example, and Fig. 10 is an explanatory diagram showing an example of diagonal line extraction, and Figure 1) is an explanatory diagram of polygonal line approximation.
Claims (2)
似するパターンデータ圧縮方式において、文字、図形の
ドットパターン（１０）より輪郭線の屈曲点を抽出する
手段（１２）と、 屈曲点の座標値から、屈曲点を結ぶ線分のうち水平線、
垂直線、および飾りを抽出する手段（１４、１６）と、 該線分より斜め線及び曲線ストロークを抽出する手段（
１８）と、 抽出した部分にｎ次のスプライン関数による平滑化方式
を通用する手段（２２）と、 前記関数により曲線近似した部分の傾きにより振動の有
無を調べる手段（２４）とを有することを特徴とするパ
ターンデータの圧縮方式。(1) In a pattern data compression method that approximates the outline of a character or figure pattern using straight lines and curves, a means (12) for extracting a bending point of the outline from a dot pattern (10) of the character or figure; From the coordinate values of, the horizontal line among the line segments connecting the bending points,
means (14, 16) for extracting vertical lines and decorations; and means (14, 16) for extracting diagonal lines and curved strokes from the line segments;
18), means (22) for applying a smoothing method using an nth-order spline function to the extracted portion, and means (24) for checking the presence or absence of vibration based on the slope of the portion approximated by a curve using the function. Features a pattern data compression method.
だけを使って行なう他に、屈曲点が少ない部分について
はＤＤＡにより発生させた直線により屈曲点間を結んで
、該直線上の輪郭点をも使って行なうことを特徴とする
特許請求の範囲第１項記載のパターンデータの圧縮方式
。(2) Curve approximation using an nth-order spline function is performed using only bending points, and in addition to connecting the bending points with a straight line generated by DDA for parts with few bending points, contour points on the straight line are The pattern data compression method according to claim 1, characterized in that the pattern data compression method is carried out using also.
Priority Applications (7)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP61118920A JPS62274472A (en) | 1986-05-23 | 1986-05-23 | Compression system for pattern data |
| CA000537470A CA1270953A (en) | 1986-05-23 | 1987-05-20 | Method of curve approximation |
| US07/052,431 US4853885A (en) | 1986-05-23 | 1987-05-21 | Method of compressing character or pictorial image data using curve approximation |
| EP87304527A EP0246898B1 (en) | 1986-05-23 | 1987-05-21 | method of curve approximation |
| DE87304527T DE3787670T2 (en) | 1986-05-23 | 1987-05-21 | Curve approximation. |
| AU73341/87A AU582303B2 (en) | 1986-05-23 | 1987-05-22 | Method of curve approximation |
| KR1019870005129A KR910001525B1 (en) | 1986-05-23 | 1987-05-23 | Method of curve approximation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP61118920A JPS62274472A (en) | 1986-05-23 | 1986-05-23 | Compression system for pattern data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| JPS62274472A true JPS62274472A (en) | 1987-11-28 |
| JPH0419593B2 JPH0419593B2 (en) | 1992-03-30 |
Family
ID=14748454
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| JP61118920A Granted JPS62274472A (en) | 1986-05-23 | 1986-05-23 | Compression system for pattern data |
Country Status (1)
| Country | Link |
|---|---|
| JP (1) | JPS62274472A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2009175836A (en) * | 2008-01-22 | 2009-08-06 | Dainippon Printing Co Ltd | Information processing device |
| JP2009175834A (en) * | 2008-01-22 | 2009-08-06 | Dainippon Printing Co Ltd | Terminal and its program |
| JP2009181282A (en) * | 2008-01-30 | 2009-08-13 | Dainippon Printing Co Ltd | Information processing device |
| JP2009181281A (en) * | 2008-01-30 | 2009-08-13 | Dainippon Printing Co Ltd | Terminal equipment and its program |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPS6039280A (en) * | 1983-07-04 | 1985-03-01 | ウーアーヴェー ソフトウエアー アンド タイプ ゲーエムベーハー | Method and apparatus for automatically digitizing contour line |
| JPS6075975A (en) * | 1983-10-03 | 1985-04-30 | Photo Composing Mach Mfg Co Ltd | Processing method of character picture data |
-
1986
- 1986-05-23 JP JP61118920A patent/JPS62274472A/en active Granted
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPS6039280A (en) * | 1983-07-04 | 1985-03-01 | ウーアーヴェー ソフトウエアー アンド タイプ ゲーエムベーハー | Method and apparatus for automatically digitizing contour line |
| JPS6075975A (en) * | 1983-10-03 | 1985-04-30 | Photo Composing Mach Mfg Co Ltd | Processing method of character picture data |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2009175836A (en) * | 2008-01-22 | 2009-08-06 | Dainippon Printing Co Ltd | Information processing device |
| JP2009175834A (en) * | 2008-01-22 | 2009-08-06 | Dainippon Printing Co Ltd | Terminal and its program |
| JP2009181282A (en) * | 2008-01-30 | 2009-08-13 | Dainippon Printing Co Ltd | Information processing device |
| JP2009181281A (en) * | 2008-01-30 | 2009-08-13 | Dainippon Printing Co Ltd | Terminal equipment and its program |
Also Published As
| Publication number | Publication date |
|---|---|
| JPH0419593B2 (en) | 1992-03-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JPH09237338A (en) | Method and device for quickly smoothing contour | |
| Sarfraz et al. | An algorithm for automatic capturing of the font outlines | |
| JP3238580B2 (en) | Thicker text generator | |
| US7239318B2 (en) | Method and computer software program product for processing characters based on outline font | |
| JPS62274472A (en) | Compression system for pattern data | |
| US5450096A (en) | Character generating method and apparatus | |
| KR910001525B1 (en) | Method of curve approximation | |
| JPS62296280A (en) | Restoration and generation system for compressed data | |
| US5355451A (en) | Graphic processing unit | |
| JPH04137034A (en) | Font information transfer system | |
| JP2527187B2 (en) | Compression method of pattern data by curve approximation | |
| JPS62211692A (en) | Preparation system for character of varied size | |
| KR100227178B1 (en) | Character generation device | |
| JP3344538B2 (en) | Character generator | |
| JPS62212167A (en) | Synthesized character forming system | |
| JP2507413B2 (en) | Pattern data compression method | |
| JP3278247B2 (en) | Character recognition method | |
| JP2782753B2 (en) | Character pattern scaling device | |
| JP2882327B2 (en) | Line figure matching device | |
| JPS62211691A (en) | Character synthesization system | |
| JP3035141B2 (en) | Character creation device and character creation method | |
| JP2856704B2 (en) | Character generator | |
| JPS6376086A (en) | Pattern restoring system from contour vector | |
| JPH01184586A (en) | System for compressing pattern data by curve approximation | |
| JPH0236955B2 (en) |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EXPY | Cancellation because of completion of term |