JP2646479B2 - Communication device for character and graphics - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION The present invention relates to a method for obtaining characters, figures, logo marks, illustrations, etc. (hereinafter simply abbreviated as "characters / illustrations") as binary data by an image reading apparatus. The data is compressed without losing the noise, and the compressed data is transmitted using a telephone line, etc., and characters and illustrations are reproduced from the transmitted data. is there. In particular, it automatically converts text and illustrations from original images to digital data, transmits them to remote values via a line, reproduces them to an arbitrary size, and can be used for printing equipment and computers. .

[0002]

2. Description of the Related Art An original picture in which characters and illustrations are mixed is a figure, a pattern, or a group of any shape and size.
Even in the case of a character, it is natural to consider it as a figure having an arbitrary shape and dimensions in consideration of fluctuations caused by handwriting. Type, etc.
Although some characters have a defined shape, it is preferable to consider it as an abstract figure when expressing the character by scaling it to an arbitrary size.

Conventionally, as a method of transmitting character / illustration data, there has been a method of transmitting black-and-white binary data input from a scanner in a raster scan format as it is. This is a format in which data obtained by sampling an original image line by line is sequentially transmitted. Facsimile currently in widespread use this format. As will be described later, data reduction processing such as Huffman coding after the digital signal is performed is performed, but no data compression or the like is performed on the image itself. It can be said that the binary data of the image is sent as it is. As is well known, current facsimile transmissions have significant drawbacks. One is that the restored image is dirty. The interval at which data is taken is called a sample interval. Since this interval is coarse, the transmitted image becomes unclear. When the original image is fine, it is not possible to obtain a transmission image that completely retains the characteristics of the original image. Noise may occur due to optical reading. When the original image is small, a beautiful transmission image cannot be obtained. If the image is passed through a facsimile twice or three times, the noise of the image is amplified and becomes extremely unclear.

Another disadvantage is that the reproduced image is the same size and cannot be enlarged or reduced. The received image can be scaled up or down using a copy machine, but this further increases the blur.

If the sample interval can be made closer,
It is possible to obtain a high quality transmission image that does not lose the characteristics of the original image. However, when the sampling interval is made closer, the amount of data further increases. As the amount of data increases, the transmission time increases. Then, the cost for transmission per original picture increases. To shorten the transmission time, run-length method,
Techniques for compressing data using an encoding method such as the modified Huffman method have been developed. The degree to which data can be compressed by conventional coding techniques is limited. The accuracy of the currently popular facsimile is still low. Therefore, the transmission image does not retain the characteristics of the original image.

[0006] Even if the sample interval becomes narrower and the original image can be transmitted faithfully, if it is desired to have an arbitrary size at the time of reproduction, it is necessary to perform interpolation or thinning of the scan interval. This is not the case in practice, but if you do, you may lose the features of the original and further reduce the quality of the image.

As described above, it can be said that in the past, data was transmitted as it was without processing the original image like a facsimile. The transmitted signal is therefore noisy, the lines are disturbed, the diagonal lines are jagged, and the image quality is poor.

[0008]

Heretofore, there has been no technique for transmitting characters and illustrations with a small amount of data without losing the characteristics of the original image. Further, there is no technology capable of reproducing data at an arbitrary size. In the method used in the conventional facsimile, it is necessary to narrow the sample interval in order to transmit a high-quality image faithful to the original image. However, when doing so, the amount of data increases significantly,
A long transmission time is required.

For example, with a conventional facsimile, it is not possible to transmit an original, such as a print copy. Such a thing has no means but to send what is written on paper by mail. Sending by mail takes 2-3 days. It would be extremely advantageous to be able to instantaneously transmit what requires precision, such as a printing block, faithfully to the original image. In that case, there is no need to send the original picture by courier.

There is a strong demand for a technique capable of transmitting an original picture beautifully and accurately through a telephone line in a short time.
For this purpose, a raster scan is performed as in the prior art, and a monochrome 2
Obtaining the value data and transmitting it as it is almost useless. The object of the present invention is as follows.

(1) Data for transmitting characters and illustrations
Saving the effort to convert to data format. (2) Capable of handling high-quality characters and illustrations. That is, the original image can be reproduced almost as it is. (3) The amount of data for transmitting characters and illustrations is small.

[0012]

According to the present invention, unlike the conventional transmission method, the original image is not represented for each scanning line, but the shape of the figure is obtained as two-dimensional information, which is automatically compressed.
The compressed data is transmitted and reproduced to an arbitrary size. A full-energy function is used for compression. When the original image is optically read, if the capability of the computer is sufficient, the whole is processed collectively. If the capacity of the computer is insufficient, the original image is divided vertically and horizontally, and processing is performed for each divided screen.
The processing is the same whether handling the entire image or the divided image. This is a process for optically reading the original image and compressing the data.

In this method, an image is converted into a binary image, a sequence of contour points is extracted, and a junction point having a large curvature of the sequence of contour points is extracted. A sequence of contour points between adjacent joining points is approximated by a line that can be best approximated, such as a straight line, a circle, an arc, or a free curve. At this time, the above-mentioned full-energy function is used. Further, the joint points are examined, and a more appropriate joint point is obtained by removing unnecessary joint points. When the joint point is determined, a line connecting the adjacent joint points is approximated by a straight line, an arc, a free curve, or the like. The data is the coordinates of the junction and the parameters of the line connecting them. All coordinates of the outline point sequence connecting the joining points are discarded. This significantly reduces the amount of data.

Compression not only reduces the amount of data, but also has the effect of removing noise and producing a beautiful image. A portion that should be a straight line may be jagged due to reading noise. In the data compression of the present invention, a portion that should be a straight line is found, and this is made a straight line, so that noise disappears. The same is true for arcs. Even if the line is uneven, it is originally a part that should be an arc, so this is defined as an arc, so that noise can be eliminated. Surprisingly, this is also true for free curves. The optimum joint point is found, and this is approximated by a free curve using a full-energy function. Since the joint point is selected to be far apart, the gap is smoothly approximated. As a result, noise generated in the process of optical reading and the like disappears. Such a data compression method for characters and illustrations is disclosed in Japanese Patent Application No. 4-259 of the present inventor.
137 and Japanese Patent Application No. 4-269646. It will be described later.

[0015] Such compressed data are sequentially stored in a storage device. Since these are digital data, they are converted into time-series data and converted into communication data. The communication data is transmitted using the transmission device. As the transmission device, a telephone line or the like can be used. In some cases, a host computer is used between the transmitter and the receiver.

The receiving side receives this. The compressed data is stored, and the original picture is reproduced from the compressed data. First, since a joining point is given, the joining point is defined on the reproduced image. Then, a straight line, an arc, and a free curve connecting the joining points are given, thereby giving a line between the joining points. Thereby, the contour is reproduced. If the inside of the closed outline point sequence is filled, the same thing as the original image can be obtained. When the screen is divided first, reproduction is performed for each divided image. After the reproduction is performed for all the divided screens, these are integrated and output. It is also possible to obtain only the outline point sequence and not to paint. In this case, a cutting plotter can be used as an output mechanism to cut a sheet.

[0017]

According to the present invention, it is possible to send a high quality character graphic. FIG. 1 is a schematic configuration diagram of a data transmitting / receiving apparatus according to the present invention. The data created by the present invention is input to a personal computer. Data generated by the method of the present invention can be input and transmitted. Alternatively, data obtained by reading an original image with an image scanner and compressing the data by the method of the present invention may be used. A system in which the method of the present invention is programmed is input to a personal computer in advance. Data obtained by compressing the original image is digital data, which is transmitted by a communication modem. This data is transmitted through the telephone line. On the way, it passes through a commercial host station computer. Since the password and password can be registered for each member, the confidentiality of the communication can be kept. The membership fee is determined for each commercial host station.

On the receiving side, the communication data is inversely converted by a communication modem connected to a telephone line and input to a personal computer. In this personal computer, a system in which the method of the present invention is programmed is input in advance. Thus, the compressed data is received on the transmission side. The transmission time is short due to the small amount of data. Therefore, the burden of telephone charges is reduced. The receiving side can thus receive the data compressed by the method of the present invention. It is stored in the storage device as it is, but is reproduced visually simultaneously or later. This uses a printer, a cutting plotter, or the like as an output device. Although the transmitted data amount is small, since the outline is approximated by the line connecting the junctions, the outline can be reproduced faithfully to the original image.

In the gist of the present invention, the original image is extracted at the joint point, the data is compressed by approximation by the full-energy function, and the compressed data is transmitted. On the receiving side, the joint point is extracted from the compressed data, and the full interval is extracted. -The image is reproduced by connecting with an enchy function.

A conventional facsimile reads an image in raster order and transmits data of a black and white binary image. After being converted into a digital signal, the data is slightly reduced by encoding. However, no approximation or data compression is performed on the image itself. Therefore, the quality of the reproduced image was poor, the characters were crushed, the straight lines were wavy, and it was unusable when a precise image was required. However, in the present invention, since the data obtained by compressing the character / graphic data by the full-energy function is transmitted / received, the reproduced image is truly beautiful.

The novel aspect of the present invention has been described above. The input character / graphic may be subjected to compression processing collectively for the entire screen, or may be divided and subjected to compression processing for each divided image. This is shown in FIG. If the computer has sufficient capacity, the entire input screen is handled collectively. If your computer has limited capabilities,
Divide into small screens with a fixed dot angle. Compression processing is performed for each divided image and data is stored. Reproduction is also performed for each divided image.

The present invention can be carried out by any of a batch method and a division method. Since the method of the batch method is obvious from the division method, data transmission when treating as a divided image will be described. Regarding the handling of the divided images, the same method as in the above-mentioned Japanese Patent Application Nos. 4-259137 and 4-269646 is used. The divided image is an image having a unit size, for example, an image of 256 dots × 256 dots. This is data compressed and stored. FIG. 3 shows a configuration for that purpose.

A. Image storage device 1 Δ. Image segmentation device II. Divided image storage device B. Contour point sequence extraction device C. Outline point sequence storage device II. Boundary junction extraction device Π. B. boundary junction storage device Data approximation mechanism AE Curvature calculation mechanism E '. Approximate curvature storage device F. Perfect circle extraction mechanism G. Perfect circular storage device H. Junction point position extraction mechanism I. Junction point position storage device Optimal junction extraction mechanism K. Optimal junction position storage device Junction point removal mechanism Final junction storage device Data approximation mechanism B.O. Compressed data output mechanism Compressed data storage device Q. Communication data generation device Communication data transmitter W. Communication data receiving device Compressed data storage Ω. Split data generation mechanism Z. Divided data storage device Contour reproduction mechanism Image reproduction mechanism Reproduction data output mechanism U. Image storage device 2

The above-mentioned mechanism is a mechanism diagram when a screen is divided. In the case where the entire image is batch-processed without dividing the screen, the image division device Δ, the divided image storage device Γ, the boundary junction extraction device Ξ, the boundary junction storage Π, the divided data generation mechanism Ω, the divided data The storage device Z and the like are unnecessary. Of these, A to V are transmission-side devices. W to U are devices on the receiving side.

First, an original image is read by an image scanner having an appropriate resolution. The whole is stored in the first image storage device A. Since the image is divided, the image is divided into a basic size (for example, 256 × 256 dots), and the following compression processing is performed one by one. In the following, the target image is a divided image. The divided image is a binary image of white and black, and a contour line that is a boundary between the white region and the black region is extracted. Since there are 256 × 256 dots of pixels, the outline becomes an outline point sequence. There are several sequences of closed contour points. A number is assigned to each group of contour point sequences. The points in the outline point sequence are also numbered sequentially. A point can be represented as a point on the X, Y coordinates. The coordinates can be represented by numbering the sequence of points.

Further, using the parameter display, the X and Y coordinates are defined as functions of t. Since the contour point sequence is a point sequence continuously arranged along a closed curve, it can be displayed as a parameter.
Each contour point sequence group is approximated by a piecewise polynomial throughout. Since a piecewise polynomial becomes a continuous function, the curvature is obtained by performing second order differentiation on each contour point sequence. A contour point sequence having a constant curvature is a perfect circle. This separates as a perfect circle. Regarding the remaining contour point sequence group, a point having a large curvature is set as a joining point. The joining point is a point representing the outline point sequence. This is a point where the contour can be expressed as a joint point and a line connecting the joint point. At first, a portion having a large curvature is simply set as a junction, but this is a temporary junction. Junctions may be added later or removed. Candidate joining points are taken around the temporary joining point, and a suitable joining point is left as an optimal joining point.

When the joining points are determined, a straight line is drawn between the joining points,
Approximate by arc and free curve. The approximations are straight lines, arcs,
Perform in the order of free curves. In the case of a straight line, the time required for approximation is short. The amount of data is also small. The approximation of the arc is also easy. What is necessary is just to give the starting point of the arc, the radius, the central angle, the coefficient of the function, and the like. If it cannot be approximated by a straight line or a circular arc, a free curve is approximated. In this case, the space between the joining points is divided into M subsections and approximated by a piecewise polynomial. If the number of subdivisions is increased, the approximation can be increased, so that an approximation with desired accuracy can be made.

In this way, the parameters of the joint point, the straight line, the circular arc, and the free curve are obtained, and these are stored as data representing the divided image. For example, in the case of 256 × 256 dots, when the data compression of the present invention is performed, it is approximately 300 to 5 dots.
Only about 00 bytes of data is required. If the image is still a black and white image, there is data for all the pixels that compose the screen.
The data amount is 8 kilobytes. In the present invention,
Data can be compressed. In the present invention, such data compression and storage are performed for each divided image. These data are transmitted as communication data using a telephone line or the like. This is the operation on the transmitting side.

The data is transmitted to the receiving side through a telephone line or other communication means. The receiving side receives compressed data for each divided image. These are sequentially received for each divided image and temporarily stored in the storage device. Since it is stored, it can be reproduced at the same time as reception, but can be reproduced at any time thereafter. In this case, the outline is reproduced from the compressed data for each divided image. When the entire outline is reproduced, the portion surrounded by the outline is painted black. This is stored again in the image storage device 2. When a printer is used as the reproducing mechanism, the area surrounded by the outline is blacked out. If a cutting plotter is used as a reproduction output mechanism, only the contour can be cut.

Further, since the coordinates of the joining point and the parameters of the straight line, the circular arc, and the free curve are given by numbers, it is possible to freely enlarge or reduce the size by calculation. Alternatively, it is possible to freely specify at which position on the output screen the image is to be output.

[A. Image storage device 1] This is to read the entire original image by optical means and store it as information decomposed for each pixel. In practice, a commercially available image scanner is used. The input data is stored as, for example, a black and white binary image.

[Δ. Image Division Apparatus] This divides data of a read original image into divided images of a predetermined size. For example, the image data is divided into units of 256 bits × 256 bits or 512 bits × 512 bits. The size of the divided image may be selected according to the capability of the computer. At this time, as shown in FIG. 2, the adjacent divided images are divided such that the boundaries overlap by one bit. In this case, the junction point at the boundary is not lost, and the reproduced image is not distorted at the boundary. Further, as shown in FIG. 4, when the image is divided vertically and horizontally by a unit size, a margin may be generated at the right end or below the divided image. In this case, the margin of the divided image is replaced with data 0.
That is, it is regarded as a white pixel.

[Γ. Divided image storage device] This is a device that stores only one divided image. Subsequent processing is performed on the divided image. When the approximate compression processing for one divided image is completed, the process returns to the image division device Δ, and the similar approximate compression processing is repeated for the next divided image.

[B. Contour Point String Extraction Device] The contour point sequence extraction device extracts a contour point sequence of a divided image. The outline of the set of black pixels is called an outline. It may be called a continuous line of black pixels at the boundary between black pixels and white pixels. The divided image has several closed contour lines. Some contours have both ends at the boundary. This also becomes a closed contour by regarding the boundary dividing line as a contour. Since the image is a group of dots, the outline can be regarded as a group of points. A contour line is a set of points, and a sequence of successive points is called a contour point sequence.

Let U be the total number of contour point sequences. The U contour point sequences are numbered from 0 to U-1. The total number of contour points in the u-th contour point sequence is represented by N (u). A number k is assigned to consecutive points in one outline point sequence. k is 0 to N
(U) is an integer of -1. The u-th k-th coordinate of the contour points of the contour point sequence is represented by _{^{(x k u, y k u}} ).
All contour points are

[0036] ^{_{{(x k u, y k}} u)} k = 0 N u -1 u = 0 U-1 (1)

Is represented by because _{k = 0} ^{N u -1} is that can take values from the point sequence number k is 0 to N (u) -1. N (u) -1 contains parentheses and is 1
When it becomes a variable suffix because it cannot be a square, the parentheses are removed and written as Nu-1. Nu
-1 = N (u) -1. Since it is a suffix, it should be written on the top and bottom, but since this is not possible, it is divided into lower left and upper right. _{u = 0} ^U-1 means that the number u of the outline point sequence group is _{0 to} ^U -1
Is to take the value of The number u of the contour point sequence should be indicated by adding parentheses to the right shoulder of the variable.
Omit the brackets because they cannot be square.

[C. Contour Point Sequence Storage Device] The contour point sequence storage device is a device for storing the contour point sequence obtained in the preceding stage. (X
_k ^u, and stores this in the form of ^{_{y k u) k = 0 N}} u -1 u = 0 U-1. As described above, U is the number of all point sequences, and u is the number assigned to the point sequence. The number of points in the point sequence u is N (u)
And k is the point number assigned to this. Such things expressed by ^{_{k = 0 N u -1 u =}} 0 U-1. (X _k ^u, y _k
^u ) is the x, y coordinates of the kth point in the uth point sequence.

[Ξ. Boundary Junction Extraction Apparatus] Simply speaking, the junction is where the slope of the line changes greatly. A corner or a corner. As described later, the figure in the middle part of the screen can be used. However, attention must be paid to the side of the screen generated due to the division, that is, the boundary of the division. When the line of the graphic intersects the boundary line, if the angle between the line and the boundary line is large, the intersection is extracted as a junction point. However, if the intersection angle is small, this intersection may not be a junction. However, points on the boundary must be left as junctions. Also, if there is a line end point on the boundary, it is not extracted as a junction, but if it is on the boundary, it must be left.

Therefore, a special operation is performed in advance on the junction on the boundary to extract the junction. This will be described with an example shown in FIG. It is assumed that the pixels of the contour line are arranged in the manner of Irohanihohettilinul. X axis and Y axis are written in reverse,
The same applies to a boundary along the X axis and a boundary along the Y axis. Lot is a straight line. The end point is Loti. Since the point B is the intersection of the two straight lines, it is extracted as a junction point even as it is. However, the lone end point does not become a junction point as it is. Instead, f is chosen as the junction.

However, the existence of the end point at the boundary is different in meaning from the existence of the end point at the center. In the case of a border,
A continuous black pixel exists on the screen, but the black pixel does not appear here due to the division. If チ is selected instead of チ as the junction, some black pixels disappear in the reproduction result as shown in (3). Since this is troublesome, on the boundary line, the end point of the line segment of the black pixel is selected as a joining point.

[Π. Boundary junction storage device] Stores the boundary junction extracted in the previous stage. This is stored by the number of the contour point sequence and the coordinates of the joining point. The junction points extracted here are not added or deleted as in the case of the junction point in the middle of the figure. This is the final junction.

[D. Data approximation mechanism A] There are two data approximation mechanisms. This is the first one, but is appended with A to distinguish it. This is necessary for temporarily finding a place where the curvature of the outline point sequence is large and for finding a joint point. In order to determine the curvature, some of the discrete points can be adopted as data and can be determined from this. The present invention can be practiced even with such discrete curvatures. However, here, the entire contour point sequence group is approximated by a continuous function consisting of a piecewise polynomial, and then this is second-order differentiated to obtain a curvature.
The approximation for this is the data approximation here.

The x and y coordinates of the contour point sequence for each continuous group are approximated by a quadratic piecewise polynomial in which t is an independent variable and x and y are dependent variables. This is to obtain an approximate polynomial for each group of contour point sequences by repeating the square method approximation. The range approximated by the piecewise polynomial is the entire contour point sequence group. This is not for obtaining final data but for obtaining a temporary junction.

The group contour point sequence in ^{_{u (x k u, y k}} u) of x
The coordinates are approximated by S _x (t), and the y coordinates are approximated by S _y (t). t is a parameter. S _x (t) and S _y
(T) is given as a linear combination based on a quadratic full-energy function system { _m }. S _x (t) is developed based on an aperiodic m-th order full-energy function ψ _k as a base.

[0046] _{S x (t) = Σ k} = -m M + m C k x ψ k (t) (2)

The full-function function is a function name named by the present inventor. The degree m corresponds to the degree of the polynomial. M is the number of dimensions. In general, the m-th order full-energy function has a domain of [0, T], a parameter of k,
This parameter is represented with a suffix. C _k ^x
Is the coefficient of linear linear combination. ψ _k itself is a polynomial having a value near k.

Ψ_k (T) = 3 (T / M)^-mΣ_{q = 0} ^{m + 1}(-1)^q {T- (k + q) (T / M)} ^m ₊ / ｛Q! (M + 1-q)! ｝ (3) where k = −m, −m + 1,..., 0, 1, 2,.

Here, the plus added below the m-th power is 0 when the value in the parenthesis is negative and m-th when the value is positive, and is defined as follows.

(T−a) ^m ₊ = (t−a) ^m t> a, (4) 0 t ≦ a (5)

The basis function ψ _k is a chevron-shaped function having finite values from section numbers _{k to k} + m + 1 and having zero on both sides. This is 0 such as {t- (k + q) (T / M)} ^m ₊
The coordinates of the m-th order function rising from are shifted one by one (q is increased one by one), and these are superimposed. Must be equal to 0 when t> (k + m + 1) (T / M). Under this condition, the superimposition coefficient is (−1) ^q / ｛q! (M + 1-q)! It is determined as｝. The size T of the area is the number N of points in the outline point sequence group.
Although it is easy to make it equal to (u), it may be defined as being proportional. As described above, the contour point sequence is approximated by using the full-energy function. However, since there are many division points having a T / M interval, the contour point sequence can be approximated without a joint point. To increase the degree of approximation, the order m of the full-energy function may be increased. However, when the degree is high, the number of calculations increases, so that processing time is required.

The inventor's claim is that many functions representing variations in physical quantities in the natural world are expressed as linear combinations of first-order and second-order full-energy functions. The m-th order full-energy function is a piecewise polynomial consisting of an m-th order polynomial having one peak over m + 1 regions. FIG. 8 is a schematic diagram of the basis function of the full-energy function of m = 0, 1, 2, and 3. m = 0 is a simple box function,
m = 1 is a triangular function, and m = 2 is a quadratic polynomial function spanning three regions. Here, only m = 2 is adopted. As a result, the contour lines can be expressed without excess or shortage. Of course, the present invention can also be configured using a full-energy function of m = 3 or more. Since m = 2, the basis function has a value over three sections, and becomes a second-order polynomial in the section having the maximum at the center. The above equation is for m = 2,

[0053] _{S x (t) = Σ k} = -2 M + 2 C k x ψ k (t) (6) ψ k (t) = 3 (T / M) -2 Σ q = 0 3 (-1 ) ^Q {t- (k + q) (T / M)} ² ₊ / ｛q! (3-q)! ｝ (7)

Is as follows. The basis function is Δt− (k + q) (T
/ M)} is a superposition of the quadratic function rising from four 0-shifted laterally by T / M is the ^two _+. The number of subdivisions is a function with values from k to k + 3. k + 3
As described above, since the constant is 0, the superimposition coefficient becomes (−
1) ^q / ｛q! (3-q)! It becomes｝. The number of basis functions is M + 5. M is the number of divisions of all sections, and this is called an approximate dimension number. This should not be confused with the order m of the fluency function. S _y that approximates the y-coordinate (t) can also be deployed by the fluency function to coefficients similarly C _k ^y.

This will be described with reference to FIG. (A) is a group of points indicating the x coordinate of a certain contour point sequence. As shown in (b), when the number of basis functions is small, that is, when the number of sections is small, the point sequence of the X coordinate of the contour point sequence and its approximate expression S _x (t)
And there is a considerable difference. However, when the number of sections is increased and the number of dimensions is increased as in (c), the outline point sequence can be accurately approximated. The value written below the graph of (c) is a value obtained by multiplying the base function by a coefficient. Since the basis of the quadratic full-energy function is a quadratic function that spans three sections, each exists over three sections. Since all the basis functions have the same shape but are multiplied by the coefficient c _k ^x ,
Functions with different heights are illustrated. The degree of approximation can be judged by this how the original contour point sequence ^{_{(x k u, y k u}} ) that is closer to. This is evaluated by the least squares method, which is

[0056] _{Q = Σ {S x (t} k u) -x k u} 2 + {S y (t k u) -y k u} 2 (8)

Is to be minimized. The range of integration is all points of the outline point sequence group u. From this condition, it is possible to obtain coefficients, C _k ^x, the C _k ^y. by this,
Approximate functions S _x (t) and S _y (t) are obtained. When the calculation can be performed for the contour point sequence group u = 0, the following is performed for the group of u = 1. Similarly, for all contour point sequence groups, (u = U−
The calculation of 1 group) is performed.

[E. Curvature operation mechanism] Since the approximate function has been obtained for all the contour point sequence groups, this is second-order differentiated to obtain the curvature at each contour point sequence group and each point. K-th point of the contour point sequence group ^{_{u (x k u, y k}} u) curvature at K (t _k ^u
)

[0059] ^{_{K (t k u) = {}} S x '(t k u) S y''(t k u) -S x''(t k u) S y' (t k u)} / {S _{^{x '(t k u) 2}} + S y' (t k u) 2} 3/2 (9)

Can be calculated by The curvatures are obtained for all points in all contour point sequences. Since the approximate function is piecewise quadratic, it is second-order differentiable. Such calculations are performed throughout.

[E '. Approximate curvature memory] curvature K obtained in the previous stage of (t _k ^u) point (edge point sequence group u, the point number k) is a device for storing for each.

[F. Perfect circle extraction mechanism] This is to determine whether a certain contour point sequence is a perfect circle or not based on the approximate curvature and extract a perfect circle. The part of the perfect circle is another straight line,
If they are in cross contact with the curve, they are not extracted as perfect circles. The pattern extracted by the perfect circle extraction is thereafter removed from the approximation calculation. This is denoted by Circle (u). u is the number of the contour point sequence group. Extracting a perfect circle has the following advantages. In the first case, even if a circle that is originally a circle is slightly distorted due to noise, the data is converted into a true circle, so that the noise drops and the shape can be determined more accurately. Since a circle can be specified only by the coordinates of the radius and the center, it is extremely effective in data compression. A perfect circle means that the curvatures at each point in the outline point sequence are all equal. Since the curvatures are obtained at all points in the contour point sequence, the curvature at each point can be checked to extract a perfect circle.

[G. Perfect circle storage device] Stores the center coordinates and radius r of the perfect circle obtained in the previous stage. Thus, data of the group u which is a perfect circle can be described by three values. In the case of a single perfect circle, this is an isolated circle point because the entire inside is a circle filled with black pixels. In the case of a double perfect circle, the space between the double circles corresponds to a circle filled with black pixels.

[H. Joining Point Position Extraction Mechanism] The joining points include a joint between a straight line and a straight line, a joint between a curve and a curve, a joint between a straight line and a curve, and the like. Since the lines having different slopes and different curvatures come into contact, this is called a junction. The junction points play a very important role when approximating the sequence of contour points as a function.
The junction determined through the curvature is a temporary junction, and the junction is additionally removed. According to the present invention, the amount of data can be minimized while maintaining a high quality reproduced image by accurately and appropriately determining the joining point.

FIG. 7 shows the outline of the junction extraction procedure. A divided image is input, and a contour point sequence forming an outer periphery is extracted. A joint point is extracted for each group of contour points obtained as described above.
First, obvious joint points are extracted. This can be determined as a point having a large curvature. This is a temporary junction and not optimal. Also, this alone cannot find all the junctions.
Conversely, those unnecessary as junctions are also included.

Therefore, it is necessary to correct the designation of the joining point. After that, a junction at the right angle portion is extracted. This is to make the connection at the intersection smooth when two straight lines intersect. The joining points of the straight lines are the starting point and the ending point of the thin line, and adding a joining point that is a thin line and does not appear under the condition that the curvature is large.

On the contrary, since there are unnecessary junction points, it is necessary to remove them. One is a junction in a straight line. When the joining point is in the middle of the straight line and the distance from the straight line is small, the straight line may be maintained even if this is removed. Since this is a junction point caused by noise, it is removed. The other is the junction of the arcs. What is supposed to be a single arc may appear as two arcs separated by two junctions due to the large number of joints. This also removes intermediate junctions and combines the arcs into a single arc. FIG. 6 shows an example of the junction.
(A) shows the junction of the outline of "a" by x,
(B) indicates the junction of the points by x. A point at which a straight line intersects, a cusp, or a point at which the curvature changes is a junction point. Although this is a case of a character, a joint point of a contour line can be obtained for an arbitrary figure.

When the joining point is determined, each section is approximated by a piecewise polynomial. The approximation of this piecewise polynomial is the same as that described above for the data approximation mechanism A, but in the previous one the approximation interval spanned the entire contour point sequence group. This time, instead, a piecewise polynomial approximation is performed for each junction. The accuracy of the polynomial approximation is achieved by performing the least squares approximation of minimizing the sum of the square of the difference from the original coordinate value, as described previously.

[I. Joining point position storage device] This is the number of the temporary joining point and the coordinates ｛d _i (x _i ^u , y
_i ^u )｝. u is the number of the contour point sequence. i is the number assigned to the junction in group u.

[J. Optimal Joint Point Extraction Mechanism] What has been obtained so far is a temporary joint point determined only by the magnitude of the curvature. These may not be actual junctions. So we need to find the best joint. For example, when two lines intersect, four corner points are formed. In this case, the corners are crushed and easily enlarged. Therefore, an optimum joint point is obtained from the fact that adjacent corner points are on the contour of those lines. In this way, the corners at the intersections of the lines do not grow grossly. The optimal junction should be near the temporary junction determined by the method described above. Therefore, some of the vicinity of the temporary connection point are set as connection point candidates, and the optimum point is determined as the optimum connection point from the connection point candidates.

There are several possible methods, but the point where the waviness of the line is minimized can be determined as the optimum joining point.
In other words, two of the corner points, four points of the junction point ahead and four points after
Considering the four joining points, a point near the corner where the positive / negative change of the derivative of the curve connecting the four joining points is minimized is newly selected as the joining point. The optimal joint is determined so that the line connecting the four joints is the smoothest.
By performing this operation, it is possible to prevent the corners from being crushed at the intersection of the two lines, and to restore a sharp typeface. This is also an effective means in terms of removing noise.

[K. Optimum junction position storage device] This is a device that stores all the optimal junction points obtained by the above operation.
Stores the optimum junction as _{^{(x i u, y i u}} ). u is the number of the contour point sequence. i is the number assigned to the junction in group u.

[L. Junction point removal mechanism] Here, unnecessary junction points are removed from the junction points extracted so far.
Unnecessary joints are removed from straight or circular joints.
The joint points determined so far are obtained by approximating the contour line with a piecewise polynomial, determining the curvature, determining the temporary joint point, and determining the optimum joint point from the joint point candidates. Therefore, there should be almost no unnecessary junctions, but there is still a possibility that there are unnecessary junctions due to the influence of image noise. It is the junction of a straight line and the junction of an arc. There may be unnecessary junctions in the free curve, but in the case of the free curve, it cannot be determined whether or not this is unnecessary. In the case of a straight line or an arc, it is a definitive figure, and one that deviates from this and one that does not deviate can be clearly distinguished. For this purpose, unnecessary joining points of straight lines and arcs are removed.

[Removal of Joint Points of Straight Line] For example, there are cases where three joint points U, V, and W are arranged substantially on a straight line, but slightly deviate from the straight line. In this case, it is assumed that the distance between the straight line connecting the end points U and W and the intermediate point V is within a certain distance. V is considered to be generated by noise. In this case, the junction point V in the middle of the straight line is removed. Excluding this, one coordinate point is reduced and one straight line is reduced. The data is reduced by two. This is more important in reducing the amount of data than in reproducing straight lines.

[Removal of Arc Joints] A plurality of joints may be continuous among arc joints extracted up to the previous stage. In this case, if the data quality is maintained even if the intermediate junction is removed, the junction is removed. In other words, if the center and radius of the arc connecting the intermediate connection point and the next connection point are close to the center and radius of the arc connecting the first connection point and the final connection point, the intermediate connection point is removed. Eliminating the junction reduces the data. However, the removal of the arc junction is not for data reduction but for reproducing a beautiful figure. What was actually a single arc was blurred due to noise, and the line looked like a set of multiple arcs. So this also means shaping figures. One of the reasons why the quality of the reproduced image of the present invention is good is that a straight line or an arc is correctly drawn by removing the joint points.

[M. Final junction storage device] The final junction obtained by removing unnecessary junctions is stored in the final junction storage. The final junction is at coordinates (x _i ^u , y _i ^u )
_{Indicated by i = 0} ^I-1 . Where i is the number of the junction, u
Is the number of the contour point sequence group, and I is the total number of final joining points of the contour point sequence group u.

[N. Data approximation mechanism B] This is a mechanism for approximating data from data such as a contour point sequence, a final joint point, and a perfect circle obtained so far. It is a central part of the present invention. What is input from the respective storage, contour point string storage device ... contour point sequence ^{_{{(x k u, y k}} u)} k = 0 N u -1 final junction memory .. final junction {(X _i ^u , y _i ^u )} _{i = 0} ^I-1 perfect circle storage device... Circle Circle (u). The suffix u of the outline point sequence is the number of the outline point sequence group. k is a contour point sequence number in the contour point sequence group u. N (u) (represented by N u) is the number of contour point sequences in the group u. i is the final junction in group u. Although the final joint point is obtained, a straight line, a circular arc, and a free curve approximation are made between two adjacent joint points (between the joint points). Using the parameter t in the approximation, the x component is given by s _x (t):
The y component is represented by s _y (t).

First, the entire contour point sequence is defined as a parameter t.
This is the same method as expressed in. But this time, since the region is between the junctions, the range of t and t and s _x
The correspondence between (t) and s _y (t) is different from the previous one. Whether the section starting from a certain junction is a section of a straight line, a section of an arc, or a section of a free curve is known when the curvature is obtained at each point. If it is a straight line, it is only necessary to connect adjacent points. In the case of an arc, the coordinates and radius of the center may be obtained. In the case of a free curve, it is necessary to determine the coefficient of the full-energy function.

[Approximation of Straight Line Section] A section starting from a joint point of a straight line is determined to be a straight line at the stage of extracting the joint point. The coordinates of the start and end points are known. Therefore, there is no need to determine the gradient of the straight line. You only need to flag it as a straight line. [Approximation of Circular Arc Section] Approximation of a section starting from a junction of arcs will be described. This section is determined to be a circular arc at the point of joint point extraction. The approximate curves s _x (t) and s _y (t) representing the arc are expressed by the following linear combination of trigonometric functions. Let the observation interval be t∈ [0, T]
Then, s _x (t) and s _y (t) are

S_x (T) = A_xcos ｛2πt / (T / n_arc )｝ + B_x sin ｛2πT / (T / n _arc )｝ + C_x (10) s_y (T) = A_ycos ｛2πt / (T / n_arc )｝ + B_y sin ｛2πT / (T / n _arc )｝ + C_y (11)

Is represented by n _arc is the ratio of the arc to the total circle. That is, it is a value obtained by dividing the central angle of the arc by 360 degrees. 2πn _arc is the central angle of this arc.
The variable 2πt / (T / n _arc ) is a parameter from the starting point of the arc.
It is the central angle up to the point corresponding to point t. (C _x , C _y )
Is the coordinates of the center of the arc. At this time,

[0082] _{^{A x 2 + B x 2 =}} A y 2 + B y 2 (12) B y / A y = B x / A x (13)

If the above holds, the approximation function becomes an arc. In this case, parameter defines an arc - data each coefficient A _x of the function, B _x, is _{C x, A y, B y} , C y, n arc. If it is known from the beginning that this section is a circular arc, such parameters can be uniquely determined from the coordinates of the start and end points, the curvature and the coordinates of one point in the middle.
[Approximation of Free Curve] A section starting from a joint that is neither a joint of a straight line nor a joint of an arc is approximated by a free curve. Although represented by the parameter t, the outline point sequence is (x _i3 ^u , y _i3 ^u
), And corresponding to t, (t _i3 ^u , x
_i3 ^u ) and (t _i3 ^u , y _i3 ^u ). Until now, the suffix of the contour point sequence was k. However, since k is used as the section number of the section, i3 is used as the contour point sequence number instead of k. Then, the total number of contour point sequences is set to n3.

Then, s _x (t) and s _y (t) are developed with the secondary fluency function ψ _k as the base. The fluency function is as shown in FIG. This is a function that has values only in three subdivisions. The interval is [0,
T], the quadratic fluency function ψ _k is an M-dimensional functional system

{ _K (t) = 3 (T / M) ⁻² _{} q = 0} ³ (−1) ^q (t−ξ _{k + q} ) ² ₊ / {(q! (3-q)!)} (14)

K = −2, −1, 0, 1, 2,..., M +
2. Using this as the base, s _x (t _i3 ) and s _y (t _i3 )
Is calculated using coefficients c _k ^x and c _k ^y .

S _x (t _i3 ) = Σ _{k = −2} ^{M + 2} c _k ^× ψ _k (t _i3 ) (15) _sy (t _i3 ) = Σ _{k = −2} ^{M + 2} c _k ^y ψ _k (T _i3 ) (16) Here, when t> ξ _{k + q} (t−ξ _{k + q} ) ² ₊ = (t−ξ _{k + q} ) ² (17) When t ≦ ξ _{k + q} (t−ξ _{k + q} ) ² ₊ = 0 (18)

Is defined as ξ _{k + q} is _defined as
It is a subdivision when divided equally. ξ _{k + q} = (k + q) T / M (19)

The coefficients c _k ^x and c _k ^y are the values (x _i3
^u , y _i3 ^u ) and the values of s _x (t _i3 ) and s _y (t _i3 ) are determined to be similar. Determine the value of the coefficient by the least squares method. The square error Q is

Q = Σ _{i3 = 1} ⁿ³ | x _i3 ^u −s _x (t _i3 ) | ² + Σ _{i3 = 1} ⁿ³ | y _i3 ^u −s _y (t _i3 ) | ² (20)

Is defined by By minimizing this, the coefficients c _k ^x and c _k ^y can be obtained.

[O. Compressed Data Output Mechanism] The outline of a figure is separated into straight lines (line segments), perfect circles, circular arcs, and free curves by the above procedure. These have a starting point and an ending point, and have parameters such as inclination, center, and radius.
The data to be stored differs depending on the type. In the case of straight line data, a flag indicating a straight line,
The coordinates of the starting point of the straight line are stored as data. Since the end point coordinates are given as the start point of the next section, there is no need to store them here. The inclination of the straight line is a parameter that defines the straight line. However, since the straight line can be formed by connecting the coordinates of the starting point and the coordinates of the next junction, no inclination is required. This is not stored either.

In the case of the perfect circle data, the data can be obtained directly from the perfect circle storage device G. This has already been selected by the first data approximation mechanism A. In the case of a perfect circle, the flag indicating the perfect circle, the center coordinates of the circle, and the radius of the circle are provided.
Stored as data. As the arc data, a flag indicating an arc, the coordinates of the starting point of the arc, the arc division length (arc length / perimeter), the number of contour points, and the coefficient of the function are stored. De of free curve - The data, dimensionality of the function, the contour points, the middle point (μ _x, μ _y) of the variation of the contour point sequence and the coefficient of the function c ^x, stores c ^y.

[P. Compressed data storage device] Stores data such as straight lines, perfect circles, circular arcs, and free curves output from the compressed data output mechanism. This is output at an appropriate time after being stored. Up to this point, the data is compressed and generated and stored. A large original image is input, stored in the first image storage device, cut out for each divided image, subjected to the above data compression operation, and stored in the compressed data storage device P. Similarly, the processing of the next divided image is performed. Data compression processing of the divided images is performed one after another, and this is stored in the compressed data storage device. Therefore, this means that all the data of the original picture is stored together. Table 1 shows the data structure stored in the compressed data storage device P.

[0095]

[Table 1]

The size of the data will be described. If a straight line exists between the joining points, one byte is used for the flag indicating the straight line, and two bytes are used for indicating the start point of the line segment (x coordinate and y coordinate).
Requires a total of 3 bytes. When the arc between the joining points is an arc, the flag indicating the arc is 1 byte, and the start point of the arc is 2 bytes.
4 bytes to represent the arc center angle, 1 byte to represent the number of contour points, 1 to represent the approximate function coefficients (there are 6)
A total of 20 bytes are required for 2 bytes. In the case of a free curve between the joining points, 1 byte is used to represent the dimension number M of the function, 1 byte is used as the number of contour points, 2 bytes is used to represent the center of variation of the contour points, and 2M is used to represent the coefficient of the approximate function. Bytes, 4 in total
+2 Mbytes.

[Q. Communication Data Generation Apparatus] This is for converting compressed data of an image into communication data. A known data structure is used for communication. FIG. 19 shows the conversion from compressed data to communication data. First, the compressed data is changed to encoded data (STEP 1). This is further converted into communication data (STEP 2). STEP2
Is to be done automatically by the modem.

As compressed data, contour function data (junction points, parameters of approximate functions, shown in Table 1) are given. Encoded data (STEP 1) The compressed data can be used as it is as the encoded data. In this case, the compressed data
The communication data can be generated by attaching necessary error codes and flags to the data itself. However, to further reduce the data,
The amount of data is reduced when encoding data. Coding for communication is performed using commercially available software to reduce the amount of data. This is a known technique.

A typical example of encoding will be described. This is called Huffman coding. First, the compressed data file is "0",
It is a group of numbers "1". It is assumed that the compression data is 24 bits. (Example) 0010000010101111001111111

Data is divided into three digits. 001 000 001 010 111 001 111 111 ・ Check the appearance frequency of the pattern of the number string. 000 ... 1 time, 001 ... 3 times, 010 ... 1 time, 011 ...
0 times, 100 ... 0 times, 101 ... 0 times, 110 ... 0 times, 1
11 ... 3 times

Assigning short codes in order of frequency (automatically assigned by Huffman codes)

Replace the old code with the new code. Then, encoded data is completed. 001000010101000101, for a total of 18 bits. Since it is originally 24 bits, 6 bits can be saved. The above coded data is cut to explain the correspondence.

00 100 00 101 01 00 01 01 First 00 is replaced with 001. The next 100 is 00
0 is replaced, 3rd 00 is replaced with 001, 4th 101 is replaced with 010, 5th 01 is 1
11 replaced, 6th 00 replaced 001,
The seventh 01 and the eighth 01 are obtained by replacing 111.

Communication Data (STEP 2) This is performed in the modem. A flag (start signal / end signal) and an error code are added before and after the encoded data. An error code means that when noise is accidentally placed on the line during communication,
This is a code attached so that the receiving side can detect it.

* Representative example of error code (parity check) (Example) Encoded data 00010110101111100001010

Add a parity bit (0 when the number of 1s in a row / column is an even number, 1 when it is an odd number) The rightmost bit is horizontal parity. On the fourth line is vertical parity. Including the parity in this way, even numbers of 1s are arranged vertically and horizontally.

Assume that 1 bit is inverted due to noise during transmission (1 in 2 rows and 4 columns is changed to 0). Then, the vertical parity in the second row and the horizontal parity in the fourth column become strange. Then, it is found that the data in the second row and the fourth column is erroneous. As described above, when either one of the horizontal parity and the vertical parity does not match, it can be determined that noise is present during transmission. In this case, correction may be made on the receiving side, or transmission may be requested again.
Encoding of communication data, flags, parity, and the like described above are normally performed in communication. It is not a novel feature of the present invention.

[V. Communication Data Transmitting Device] This is a communication modem as shown in FIG. When using a telephone line, such a conversion device is required. As the communication line, a special wire communication means other than the telephone line can be used. What has been described above is the transmitting device.

[W. Communication Data Receiving Apparatus] This is also the communication modem shown in FIG. Since it is used for both transmission and reception, it is the same as the transmission side. The subsequent devices are receiving-side devices. Actually, both transmission and reception are performed mutually, so that one station can perform both transmission and reception.

[X. Compressed Data Generating Apparatus] Generates compressed data from transmitted data. This can be done inside a personal computer. The compressed data is, for each divided image, parameters such as joining points, straight lines connecting between the joining points, arcs, and curves. This is shown in Table 1.

[Y. Compressed data storage device] This stores compressed data generated on the receiving side. This is the entire compressed data.

[Ω. Divided Data Generation Mechanism] This is to divide compressed data on the receiving side into units of information corresponding to divided images.

[Z. Divided data storage device] The compressed data is divided on the receiving side into units of information corresponding to the divided image and the data is stored. Thereafter, the screen is reproduced for each divided image.

[R. Contour Reproducing Mechanism] This is a mechanism for reproducing a contour line to be a skeleton of an image from stored compressed data. If the image is divided and compressed, it is handled for each divided image. If the image is compressed as a whole, the outline point sequence on the entire screen is reproduced. The contour may be a straight line, a perfect circle, an arc, or a free curve. [Reproduction of Straight Line] The reproduction of a straight line is performed by connecting a straight line from the coordinates of the starting point to the coordinates of the joining point in the next section. No data regarding the inclination of the straight line is required. [Reproduction of Perfect Circle] Reproduction of a perfect circle is performed by drawing a circle having a given radius around the center coordinates from data of the coordinates and the radius of the center. [Reproduction of circular arc] Reproduction of circular arc is performed by substituting each stored data (A _x , B _x ,...) Into the following equation.

S _x (t) = A _x cos ｛2πt / (T / n _arc )｝ + B _x sin ｛2πt / (T / n _arc )｝ + C _x (21) S _y (t) = A _y cos {2πt / (T / n _arc )} + B _y sin {2πt / (T / n _arc )} + C _y (22)

The x and y coordinates are obtained from S _x (t) and S _y (t) by varying the parameter t in the interval [0 to T]. [Reproduction of Free Curve] The value of the basis ψ _k of the approximation function at each sample point t _i is such that the sample point t _i is in the interval [(L + 2) (T / M, L (L + 3) (T /
M)] when in (1 ≦ L ≦ M), p = L + 3-t i ×
Using M / T,

Ψ _k (t _i ) = 0.5p ² k = L (23) ψ _k (t _i ) = p (1-p) +0.5 k = L + 1 (24) ψ _k (t _i ) = 0 .5 (p-1) ² k = L + 2 (25) ψ _k (t _i ) = 0 k ≦ L-1, L + 3 ≦ k (26)

Is represented by Where L is the number of dimensions M
It is the following natural number. Using such a base ψ _k , the approximate function value S (t _i ) at each sample point is

[0119] _{S (t i) = Σ k} = L L + 2 C k ψ k (t i) (27)

Is obtained by If the output is a cutting plotter or the like and a sheet member is cut out, the sheet may be cut along such a contour line.

[S. Image reproducing mechanism] Since the outline is obtained, a portion surrounded by the outline is set as a black pixel, and a black-and-white binary image is reproduced in a logo / illustration shape. Or, conversely, the portion surrounded by the outline can be white pixels, and the rest can be black pixels. Further, a portion surrounded by the outline may be set to a certain color, and another portion may be set to another color.

[T. Reproduction data output mechanism] In order to reproduce an image from the coefficient of the function, for example, the size of the reproduced image is set to 1
Use a layout editor that can specify from mm square to A3 size large. The reproduced image is printed by using a laser printer having an accuracy of 300 DPI or a laser printer having an accuracy of 600 DPI. Further, it can be output by a 3000 DPI electroplanter (printing device), a 400 DPI postscript compatible printer, a laser cutter, or the like.

The original figure is stored in the form of a function coefficient.
It can be scaled to any magnification. Also, the center can be arbitrarily specified for the coordinates. Therefore, it is possible to output a character, a figure, or the like having an arbitrary shape at an arbitrary position and an arbitrary size.

[0124]

DESCRIPTION OF THE PREFERRED EMBODIMENTS In the present invention, an original image is read (input) by an image scanner, and this is directly or divided into divided images.
The data is compressed and the data is stored in the storage device. This is converted into communication data and transmitted to a desired destination via a telephone line or the like. The receiving side receives the compressed data and stores it in the storage device. From the stored compressed data, for each divided image,
A contour equivalent to the contour of the original image is generated, and a sequence of outline points is reproduced for all the divided images, and then the outline is painted out to reproduce the original image. Reproduction can be performed using a laser printer, a cutting plotter, or the like (output).

In the present invention, the data is compressed by approximating the data with a function, so that the characters and figures can be transmitted beautifully and instantly. Date
It is more important to perform data compression not only to reduce the amount of data, but also to improve the image quality by removing noises and the like that enter during a reading operation or the like. For example, the following can be used as the input / output device.

[Input Device] System Quality IS
-500 (400 dpi) This is an image scanner having a resolution of 400 DPI and 256 gradations. In the case of the original picture of A4 size, 40
It is about 8 seconds at 0 dpi and about 5.5 seconds at 240 dpi.

[Output Device] Rico-SP8 (240 dpi, pseudo 600 dpi) This is a clear laser printer output. Although depending on the complexity of the original image, the output speed is about 1 minute or less when the original image is A4 size. It is an extremely fast output machine. Output dimensions are up to A4.

Rico-Imagio MF530 (400 dp
i) A beautiful high-resolution laser printer output can be obtained. By using the composition as it is, it can be used as a DTP printing machine. Output speed is slow. When outputting an image stored by the method of the present invention, the size of A4 is 15
It takes between minutes and 30 minutes.

Cutting plotter For example, FC2100-50, FC21 manufactured by Graphtec
00-90A or the like can be used. This is width 50
A film having a width of 0 mm to 50 mm can be cut. The cutting blade is a super steel blade, a ceramic blade, a sapphire blade or the like. This cuts the film consisting of release paper and backing paper. In this case, the cut film can be attached to some kind of base material and used for signboards, information boards, building decorations, road signs, and the like. When using thermal transfer film,
It can be used to draw letters and patterns on t-shirts, outdoor goods, T-shirts, etc. By changing the blade of the cutting plotter to a pen, you can draw drawings on paper.

Thermal plotter (400 dpi) This draws a drawing on thermal paper. For example, TM1000-OPF of Graphtec can be used. It can output drawings and characters on paper of A0, A1, A2, A3, etc. It is suitable for outputting brush letters such as banners, venue guides, and funeral name tags. The ability to play large screens makes it possible to produce oversized banners.

When a reproduced image is output by a cutting plotter, an outline (outline output) is drawn with a blade or a pen. As described above, if the division boundary line is not output and the outline is output, the sheet member or the like can be cut along the outline. It can be used for a wide range of applications such as signboards, information boards, display boards, name tags, banners, and iron prints. The position and size can be freely set by calculation.

FIG. 10 is a diagram in which an animal is kicking a ball. Although the height of the original image is 234 mm, it is reduced and copied in order to make a patent drawing. There is a decrease in image quality due to copying. System Quality IS-500 (400dp
i) System Quality IS-500 (400dp
An image was input according to i)) and data was compressed by the method of the present invention. The amount of compressed data was 25.2 kbytes (kilobytes). The application time was 1 minute and 48 seconds. Approval time means that after data compression,
This is the time from the conversion to communication data and the signaling of transmission until the central host computer receives and stores it. It does not include the time of image input, data compression, and data conversion at the preceding stage. It can be kept on the central host computer for hours. The receiving side can instruct the user to immediately access this and send it to them. There is a temporal separation between transmission and reception.

FIG. 11 shows a reproduced image obtained on the receiving side. The animal is 234 mm tall because it is being reproduced at full scale. The data amount is 25.2 kilobytes. It is an illustration and the amount of data is large because there are many free curve parts. Since this is also reduced and copied, the image quality is degraded. Before the copy, the picture is more beautiful. The download time (data reception time) is 2 minutes and 6 seconds.
This is the time required for the receiving side to receive data from the central host computer. After reception, it takes time to convert data, store compressed data, and play back divided images. It takes longer than a facsimile, but the image quality is by far the best.

FIG. 12 is a reproduced image obtained by transmitting the original image shown in FIG. 10 by facsimile. Although the difference is difficult to understand due to the reduced copy, there is a clear difference in image quality between FIG. 11 (the present invention) and FIG. 12 (facsimile). In the case of facsimile, the outline of the beard portion is jagged. The oval frame of the eye is also jagged. There is also a wavy part in the contour of the wing. The contours of the shoes are also waving. In all three figures, the image is degraded due to the copy since the copy is passed once to match the size of the patent drawing. If the original figures are compared without passing through a copy, the difference can be seen more clearly.

FIG. 13 shows a screen of “Fashion Glasses Fair”. This was also read by IS500 of System Ority. The data amount was 3.2 kilobytes.
The application time was 15 seconds. FIG. 14 shows the result of compression, transmission and reproduction on the receiving side. After all Rico-
Played on Imagio MF530. The download time was 20 seconds. The difference from the original cannot be found by visual observation. It is a very faithful reproduction image.

FIG. 15 shows the original image of FIG. 13 transmitted by facsimile. Steps appear strongly on the bar above "F". Not a smooth straight line. The jaggedness also appears strongly in the horizontal bar of “A”. The saw-tooth shape also appears in the three horizontal bars of “Y”. The rounds of the glasses are also gradually increasing. There are vertical lines before and after the "ga" due to noise. Comparing FIG. 14 (the method of the present invention) with FIG. 15, it can be seen that the transmission image according to the method of the present invention is much better.

FIGS. 16 to 18 depict the characters “Ebisu Kodai Special”. FIG. 16 is an original image. The input uses an image scanner IS500 manufactured by System Quality. The data volume was 6.9 kilobytes. Date
The upload time of the heater was 30 seconds.

FIG. 17 shows the original picture of FIG. 16 transmitted and reproduced at the receiving end. The download time was 40 seconds. Each bar in the original picture has been waving from the beginning,
The reproduced images are also waving in the same way. No serrated jaggedness.

FIG. 18 is a transmission image by facsimile. Horizontal lines such as "e" and "su" appear blurred. This is the fluctuation of the line due to the instability of the pixels on the contour line becoming white or black. The jaggedness is particularly strong on the vertical bar of "Ko". In addition, horizontal lines have been inserted above and below "*". A saw-shaped line is also visible in the diagonal line of "Sell".

[0140]

According to the present invention, characters / illustrations as original pictures can be optically read and transmitted with a small amount of data. It is no longer necessary to transmit in raster scan format. Since straight lines are extracted as straight lines and arcs and circles are extracted and stored as geometrically correct arcs and circles, noise included in the original image and noise generated at the time of reading can be removed, and the image quality can be improved. The present invention is further characterized in that the processing time is short. Therefore, many character / illustration data can be transmitted as mathematical data in a short time. Since the data format to be transmitted is a sequence of numbers, the amount of data can be further reduced by using a technique for removing the redundancy of the existing number data.

[0141] It is easy not only to transmit, but also to reproduce. Characters / illustrations of any size can be reproduced at any positions using the transmitted data. At this time, noise is inevitably increased by enlarging by optical means, and the outline is blurred. Since the present invention expands on calculation instead, straight lines are reproduced as straight lines and arcs are reproduced as arcs. The same is true for free curves. This is also computed and scaled so that the lines are not jerky, jagged or blurred. Good quality enlarged reproduction images can be obtained.

Although the time is longer than that of the transmission by facsimile, the present invention is much better in terms of image quality.
Instead of sending the original drawing itself, such as a print copy, by mail, it can be transmitted by the apparatus of the present invention. This can be used for printing as it is. The number of days required to send by mail or courier can be significantly reduced.

[Brief description of the drawings]

FIG. 1 is a configuration diagram showing an outline of a character / graphic communication apparatus of the present invention.

FIG. 2 is an explanatory diagram showing a procedure for reading a character or graphic by optical means and compressing the data as a whole or divided and storing it in a storage device in the present invention.

FIG. 3 is an overall configuration diagram of a character / graphic communication device of the present invention.

FIG. 4 is a view showing that data 0 is given to an original image because a margin is generated at an end of the divided image when the original image is divided into unit sizes.

FIG. 5 is a view for explaining extraction of a joint point at a boundary.

FIG. 6 is a diagram showing junctions between the characters “A” and “Po”.

FIG. 7 is an explanatory diagram showing a procedure for extracting a junction in the present invention.

FIG. 8 is an explanatory diagram of a basis function of a full-ency function. In the present invention, a second-order full-energy function is mainly used for approximation of the first contour point sequence and approximation of a free curve, which is shown in FIG. Here, the form of the basis of the zeroth to third-order full-energy functions is shown.

FIG. 9 is a view for explaining approximation of a contour point sequence while increasing the number of bases of a full-energy function, that is, the number of dimensions.

FIG. 10 is a reduced copy of an original drawing of an illustration of an animal and a sphere. The actual animal height is 234mm.

FIG. 11 is a reduced copy of the original image of FIG. 10 transmitted by the method of the present invention and reproduced at the original size. The actual animal height is 234
mm.

12 is a reduced copy of the original image of FIG. 10 transmitted by facsimile. The actual animal height is 234mm.

FIG. 13 is a reduced copy of the original illustration of the fashion glasses fair illustration. The actual length is 248mm. 73m wide
m.

FIG. 14 is a reduced copy of the original picture of FIG. 13 transmitted by the method of the present invention and reproduced at its original size. The actual length is 248mm.
The width is 73mm.

FIG. 15 is a reduced copy of the original image of FIG. 13 transmitted by facsimile. The actual length is 248mm. 73m wide
m.

FIG. 16 is a reduced copy of the original picture of the illustration of “Ebisu Kodai Special Sale”. The length is 248mm. The width is 50mm.

FIG. 17 is a reduced copy of the original image of FIG. 16 transmitted by the method of the present invention and reproduced at the original size. The length is 248mm. Width 5
0 mm.

FIG. 18 is a reduced copy of the original image of FIG. 16 transmitted by facsimile. The length is 248mm. The width is 50mm.

FIG. 19 is a diagram showing an example of conversion from compressed data to communication data.

 ──────────────────────────────────────────────────続 き Continuation of the front page (56) References JP-A-60-49483 (JP, A) JP-A-57-159363 (JP, A) JP-A-62-274372 (JP, A) 221979 (JP, A) IEICE Transactions D VOL. J70-D NO. 6P. 1164-1172 (June 1987) IEICE Transactions D-II VOL. J73-D-II NO. 9 P. 1448-1457 (September 1990)

Claims (10)

(57) [Claims] An apparatus for transmitting a character graphic from a transmission side to a reception side via a transmission line, comprising: (B) a data compression device that divides the stored image data into basic small areas and sequentially compresses the divided images by function approximation; and (c) data compression. (D) a communication data generating device for converting the data in the compressed data storage device into communication data; and (e) a communication data transmitting device for transmitting the communication data. The data compression device (b) for the divided image of (b) includes: (b1) a contour extraction mechanism for extracting a contour of a character figure from the divided image; and (b2) two-dimensional coordinates of the extracted contour ( , Y) and the contour point sequence storage mechanism for storing for each group successive, secondary to (b3) X contour point sequence for each of the groups, independent of the Y-coordinate t variables, dependent variables x and y And a data approximation mechanism A for obtaining an approximate polynomial for each group of contour point sequences by repeating least squares approximation until the approximation accuracy falls within a predetermined range, and (b4) x, y space (B5) a perfect circle extraction mechanism for extracting a perfect circle from the curvature data for each group; and (b6) a contour point sequence excluding the perfect circle. (B7) a temporary junction point extraction mechanism for extracting a point having a curvature greater than a predetermined value from the curvature data as a temporary junction point; and (b7 ) a contour point of one of the temporary junction points (first temporary junction point).
One of a predetermined number of points before and after the column is regarded as a first joining point candidate,
Other temporary joints on the same contour point sequence near the first temporary joint point
A predetermined number of front and rear points on the outline point sequence of one of
One of the points is regarded as a second joint point candidate, and a point sequence is formed on the same contour point sequence.
In the scanning direction, the second temporary junction, the first temporary junction, and the vicinity
Before the joining point and the third temporary joining point are arranged in a line in this order.
Select the near junction, the second temporary junction, and the third temporary junction
Means, the second temporary junction, the first junction candidate,
The four points of the second joint point candidate and the third temporary joint point are smoothest.
Of the first candidate junction based on the smoothness of the line connecting
Means for determining the degree of connection, and the first joint point having the highest degree of fitness.
Select the complement and make it the optimal joint that replaces the first temporary joint.
And the optimum junction extraction mechanism having a means that, (b8) to the approximation accuracy is maintained without it from the optimum junction is two or more arc start point to the straight line or a continuous two or more consecutive linear and unwanted junction removal mechanism for an integrated unnecessary optimum bonding points found removing linear or arc this, between the (b9) adjacent the junction of the sequence of points the same group,
When approximated by an arc of the order which at a given approximation accuracy is not obtained
When t is an independent variable and x and y are dependent variables, it is approximated by a second-order piecewise polynomial and the second order is used until the approximation accuracy falls within a predetermined value.
Wherein between the piecewise polynomial junctions while increasing the number of dimensions adjacent repeated a least squares approximation straight line, an arc, a data approximation mechanism B approximated by piecewise polynomials, every group of (b10) point sequence compressed data storage mechanism for storing the parameters of the function approximating the one coordinate and the adjacent <br/> junction of the junction and be more of the compressed data is the communication data generating device (d) to the communication data (F) a communication data receiving device for receiving the transmitted data; (g) a compressed data generating device for generating compressed data from the received communication data; h) a mechanism for reproducing the outline of each divided image based on the approximate data of the line connecting the joint points from the compressed data and reproducing the image data; and (i) a reproduced data output device for drawing an image based on the reproduced data. Apparatus and, (j) communication device character graphic comprising a second image memory for storing an image based on the reproduction data. 2. An apparatus for transmitting a character graphic from a transmission side to a reception side via a transmission line, the transmission side comprising: a first image storage device for storing by data compression to the data compression by sequential function approximation for (b) divided by the divided image is divided stored image data in the basic small region so as to overlap one pixel at the boundary (C) a compressed data storage device for storing data that has been compressed, (d) a communication data generation device for converting data in the compressed data storage device into communication data, and (e) communication. A data compression device (b) for transmitting the divided image, the data compression device (b) for transmitting the divided image, comprising: (b1) a contour line extracting mechanism for extracting a contour line of a character figure from the divided image; b2) a contour point sequence storage mechanism that stores the two-dimensional coordinates (X, Y) of the extracted contour line for each continuous group; and (b11) a boundary joint point extraction mechanism that extracts a joint point on the boundary line of the divided image. (B12) a boundary junction storage device that stores the extracted boundary junctions; and (b3) the X and Y coordinates of the contour point sequence for each group are t as independent variables, and x and y as dependent variables. A data approximation mechanism A for approximating with a quadratic piecewise polynomial to repeat the least squares approximation until the approximation accuracy is within a predetermined range to obtain an approximate polynomial for each group of contour point sequences; and (b4) x (B5) a perfect circle extraction mechanism for extracting a perfect circle from the curvature data for each group, and (b6) excluding perfect circles. points greater than the value defined in curvature from the curvature data of the contour point sequence A temporary joining point position extraction mechanism for extracting as a junction, contour points (b7) wherein one of the temporary junction (first temporary junction)
One of a predetermined number of points before and after the column is regarded as a first joining point candidate,
Other temporary joints on the same contour point sequence near the first temporary joint point
A predetermined number of front and rear points on the outline point sequence of one of the joint points (neighboring joint points)
One of the points is regarded as a second joint point candidate, and a point sequence is formed on the same contour point sequence.
In the scanning direction, the second temporary junction, the first temporary junction, and the vicinity
Before the joining point and the third temporary joining point are arranged in a line in this order.
Select the near junction, the second temporary junction, and the third temporary junction
Means, the second temporary junction, the first junction candidate,
The four points of the second joint point candidate and the third temporary joint point are smoothest.
Of the first candidate junction based on the smoothness of the line connecting
Means for determining the degree of connection, and the first joint point having the highest degree of fitness.
Select the complement and make it the optimal joint that replaces the first temporary joint .
And the optimum junction extraction mechanism having a means that, (b8) to the approximation accuracy is maintained without it from the optimum junction is two or more arc start point to the straight line or a continuous two or more consecutive linear and unwanted junction removing mechanism to a removal found it unnecessary junctions, between the (b9) adjacent the junction of the sequence of points the same group,
When approximated by an arc of the order which at a given approximation accuracy is not obtained
Can independently variable t, x, repeated a least squares approximation with increasing number of dimensions of the secondary piecewise polynomial up approximation accuracy is approximated by a quadratic piecewise polynomial that is a dependent variable y is within a predetermined value straight between the junction points adjacent Te, arc, between a data approximation mechanism B approximated by piecewise polynomial, the <br/> junction adjacent to said junction points coordinates for each group of (b10) point sequence And a compressed data storage mechanism for storing a parameter of a function that approximates the following equation. The compressed data is converted into communication data by the communication data generating device (d). (G) a compressed data generator that generates compressed data from the received communication data; and (h) an approximation of a line connecting the junctions from the compressed data. Split image based on data (I) a playback data output mechanism device for drawing an image based on the playback data, and (j) a second image storage device for storing an image based on the playback data. communication device character graphic comprising. 3. An apparatus for transmitting a character graphic from a transmission side to a reception side via a transmission line, the transmission side comprising: (a) corresponding to a finite number of pixels in which data obtained by optically reading a character graphic are arranged vertically and horizontally. first an image storage device for storing by, (b) the stored image data divided into basic sub-region so as to overlap one pixel at the boundary, data compressed by sequential function approximation for divided divided image data A compression device; (c) a compressed data storage device for storing data that has been compressed; (d) a communication data generation device for converting data in the compressed data storage device into communication data; and (e) communication. A data compression device (b) for transmitting the divided image, the data compression device (b) for transmitting the divided image, comprising: (b1) a contour line extracting mechanism for extracting a contour line of a character figure from the divided image; (B2) a contour point sequence storage mechanism that stores the two-dimensional coordinates (X, Y) of the extracted contour line for each continuous group; and (b11) a boundary joint point extraction that extracts a joint point on the boundary line of the divided image. (B12) a boundary junction storage device that stores the extracted boundary junctions; and (b3) the X and Y coordinates of the contour point sequence for each group are t as independent variables, and x and y are dependent variables. A data approximation mechanism A for approximating with a quadratic piecewise polynomial and repeating the least squares approximation until the approximation accuracy falls within a predetermined range to obtain an approximate polynomial for each group of contour point sequences; and (b4) x, a curvature calculation device for obtaining a curvature at each point of a point sequence for each group in y space, a perfect circle extraction mechanism for extracting a roundness from the curvature of the data for each (b5) group, a circularity (b6) values greater than point defined with curvature from the data of the curvature of the contour point sequence except A temporary joining point position extraction mechanism for extracting as a temporary junction, contour points (b7) wherein one of the temporary junction (first temporary junction)
One of a predetermined number of points before and after the column is regarded as a first joining point candidate,
Other temporary joints on the same contour point sequence near the first temporary joint point
A predetermined number of front and rear points on the outline point sequence of one of the joint points (neighboring joint points)
One of the points is regarded as a second joint point candidate, and a point sequence is formed on the same contour point sequence.
In the scanning direction, the second temporary junction, the first temporary junction, and the vicinity
Before the joining point and the third temporary joining point are arranged in a line in this order.
Select the near junction, the second temporary junction, and the third temporary junction
Means, the second temporary junction, the first junction candidate,
The four points of the second joint point candidate and the third temporary joint point are smoothest.
Of the first candidate junction based on the smoothness of the line connecting
Means for determining the degree of connection, and the first joint point having the highest degree of fitness.
Select the complement and make it the optimal joint that replaces the first temporary joint.
And the optimum junction extraction mechanism having a means that, (b8) to the approximation accuracy is maintained without it from the optimum junction is two or more arc start point to the straight line or a continuous two or more consecutive linear and unwanted junction removing mechanism to a removal found it unnecessary junctions, between the (b9) adjacent the junction of the sequence of points the same group,
When approximated by an arc of the order which at a given approximation accuracy is not obtained
When t is an independent variable and x and y are dependent variables, it is approximated by a second-order piecewise polynomial and the second order is used until the approximation accuracy falls within a predetermined value.
Wherein between the piecewise polynomial junctions while increasing the number of dimensions adjacent repeated a least squares approximation straight line, an arc, a data approximation mechanism B approximated by piecewise polynomials, every group of (b10) point sequence compressed data storage mechanism for storing the parameters of the function approximating the one coordinate and the adjacent <br/> junction of the junction and be more of the compressed data is the communication data generating device (d) to the communication data (F) a communication data receiving device that receives the transmitted data; (g) a compressed data generating device that generates the compressed data from the received communication data; h) a mechanism for reproducing the image data by reproducing the contour of each divided image at its original size, or enlarged by calculation, or reduced by calculation based on the approximate data of the line connecting the joining points from the compressed data. (I) based on the reproduced data scale, and the reproduced data output mechanism device to draw enlarged or reduced image, the character graphic comprising a second image storage unit that stores an image based on (j) reproducing data Communication device. 4. An apparatus for transmitting a character graphic from a transmission side to a reception side via a transmission line, the transmission side comprising: (B) a data compression device that divides the stored image data into basic small areas and sequentially compresses the divided images by function approximation; and (c) data compression. (D) a communication data generating device for converting the data in the compressed data storage device into communication data; and (e) a communication data transmitting device for transmitting the communication data. The data compression device (b) for the divided image of (b) includes: (b1) a contour extraction mechanism for extracting a contour of a character figure from the divided image; and (b2) two-dimensional coordinates of the extracted contour ( , Y) and the contour point sequence storage mechanism for storing for each group successive, secondary to (b3) X contour point sequence for each of the groups, independent of the Y-coordinate t variables, dependent variables x and y And a data approximation mechanism A for obtaining an approximate polynomial for each group of contour point sequences by repeating least squares approximation until the approximation accuracy falls within a predetermined range, and (b4) x, y space (B5) a perfect circle extraction mechanism for extracting a perfect circle from the curvature data for each group; and (b6) a contour point sequence excluding the perfect circle. (B8) a joining point that is a starting point of two or more continuous straight lines or two or more continuous arcs, and that extracts a point where the curvature is larger than a predetermined value from the curvature data as a joining point. Unnecessary joining that keeps approximation accuracy without it The found and unnecessary junction removing mechanism to remove it, between the (b9) adjacent the junction of the sequence of points the same group linear,
When approximated by an arc of the order which at a given approximation accuracy is not obtained
When t is an independent variable and x and y are dependent variables, it is approximated by a second-order piecewise polynomial and the second order is used until the approximation accuracy falls within a predetermined value.
Wherein between the piecewise polynomial junctions while increasing the number of dimensions adjacent repeated a least squares approximation straight line, an arc, a data approximation mechanism B approximated by piecewise polynomials, every group of (b10) point sequence compressed data storage mechanism for storing the parameters of the function approximating the one coordinate and the adjacent <br/> junction of the junction and be more of the compressed data is the communication data generating device (d) to the communication data (F) a communication data receiving device for receiving the transmitted data; (g) a compressed data generating device for generating compressed data from the received communication data; h) A mechanism for reproducing the image data by reproducing the contour of each divided image based on the approximate data of the line connecting the joint points from the compressed data, and (i) a reproduction data output mechanism for drawing an image based on the reproduced data. Location and, (j) communication device character graphic comprising a second image memory for storing an image based on the reproduction data. 5. An apparatus for transmitting a character graphic from a transmission side to a reception side via a transmission line, the transmission side comprising: (B) a data compression device that divides the stored image data into basic small areas and sequentially compresses the divided images by function approximation; and (c) data compression. (D) a communication data generating device for converting the data in the compressed data storage device into communication data; and (e) a communication data transmitting device for transmitting the communication data. The data compression device (b) for the divided image of (b) includes: (b1) a contour extraction mechanism for extracting a contour of a character figure from the divided image; and (b2) two-dimensional coordinates of the extracted contour ( , Y) and the contour point sequence storage mechanism for storing for each group successive, secondary to (b3) X contour point sequence for each of the groups, independent of the Y-coordinate t variables, dependent variables x and y And a data approximation mechanism A for obtaining an approximate polynomial for each group of contour point sequences by repeating least squares approximation until the approximation accuracy falls within a predetermined range, and (b4) x, y space (B5) a perfect circle extraction mechanism for extracting a perfect circle from the curvature data for each group; and (b6) a contour point sequence excluding the perfect circle. lines and junction position extraction mechanism, between the junction points adjacent in the point sequence (b9) the same group to extract points from the curvature data larger than the value determined with the curvature as a joining point,
When approximated by an arc of the order which at a given approximation accuracy is not obtained
When t is an independent variable and x and y are dependent variables, it is approximated by a second-order piecewise polynomial and the second order is used until the approximation accuracy falls within a predetermined value.
Wherein between the piecewise polynomial junctions while increasing the number of dimensions adjacent repeated a least squares approximation straight line, an arc, a data approximation mechanism B approximated by piecewise polynomials, every group of (b10) point sequence compressed data storage mechanism for storing the parameters of the function approximating the one coordinate and the adjacent <br/> junction of the junction and be more of the compressed data is the communication data generating device (d) to the communication data (F) a communication data receiving device for receiving the transmitted data; (g) a compressed data generating device for generating compressed data from the received communication data; h) A mechanism for reproducing the image data by reproducing the contour of each divided image based on the approximate data of the line connecting the joint points from the compressed data, and (i) a reproduction data output mechanism for drawing an image based on the reproduced data. Location and, (j) communication device character graphic comprising a second image memory for storing an image based on the reproduction data. 6. An apparatus for transmitting a character / graphic from a transmitting side to a receiving side via a transmission line, the transmitting side comprising: (B) a data compression device that divides the stored image data into basic small areas and sequentially compresses the divided images by function approximation; and (c) data compression. (D) a communication data generating device for converting data in the compressed data storage device into communication data, and a communication data transmitting device for transmitting communication data, (B): a contour extraction mechanism for extracting a contour of a character figure from a divided image; and (b2) a two-dimensional coordinate (X, Y) of the extracted contour. A contour point string storage mechanism for storing for each group successive, (b3) X contour point sequence for each of the groups of independent variables Y coordinates t, 2-order piecewise to dependent variable x and y A data approximation mechanism A that approximates with a polynomial and repeats least squares approximation until the approximation accuracy falls within a predetermined range to obtain an approximate polynomial for each group of contour point sequences; (B5) a perfect circle extraction mechanism that extracts a perfect circle from the curvature data for each group; and (b6) a perfect curvature extraction mechanism that excludes a perfect circle . a junction position extraction mechanism for extracting points from the data larger than the value determined with curvature as the junction, between the (b9) adjacent the junction of the sequence of points the same group linear,
When approximated by an arc of the order which at a given approximation accuracy is not obtained
When t is an independent variable and x and y are dependent variables, it is approximated by a second-order piecewise polynomial and the second order is used until the approximation accuracy falls within a predetermined value.
Wherein between the piecewise polynomial junctions while increasing the number of dimensions adjacent repeated a least squares approximation straight line, an arc, a data approximation mechanism B approximated by piecewise polynomials, every group of (b10) point sequence compressed data storage mechanism for storing the parameters of the function approximating the one coordinate and the adjacent <br/> junction of the junction and be more of the compressed data is the communication data generating device (d) to the communication data (F) a communication data receiving device for receiving the transmitted data; (g) a compressed data generating device for generating compressed data from the received communication data; h) a mechanism for reproducing the image data by reproducing the contour of each divided image at its original size, or by enlargement by calculation, or by reduction by calculation based on the approximate data of the line connecting the joint points from the compressed data, (I) based on the reproduced data scale, and the reproduced data output mechanism device to draw enlarged or reduced image, the character graphic comprising a second image storage unit that stores an image based on (j) reproducing data Communication device. 7. A device for transmitting a character / graphic from a transmitting side to a receiving side through a transmission line, comprising: (a) corresponding to a finite number of pixels in which data obtained by optically reading a character / graphic are arranged vertically and horizontally. (B) a data compression device for sequentially compressing the entire stored image data by function approximation, and (c) a compressed data storage device for storing the compressed data. (D) a communication data generation device for converting data in the compressed data storage device into communication data, and (e) a communication data transmission device for transmitting communication data, wherein the data compression device for the whole image on the transmission side (b) (B1) a contour line extraction mechanism for extracting a contour line of a character figure from the entire image; and (b2) a contour point for storing two-dimensional coordinates (X, Y) of the extracted contour line for each continuous group. A storage mechanism, (b3) X contour point sequence for each of the groups, the Y-coordinate independent variable t, approximated by a quadratic piecewise polynomial that the dependent variable x and y, the approximation accuracy is within a predetermined range A data approximation mechanism A for repeating the least squares approximation until an approximate polynomial for each group of contour point sequences is obtained, and A curvature calculation mechanism; (b5) a perfect circle extraction mechanism for extracting a perfect circle from the curvature data for each group; and (b6) a curvature greater than a predetermined value from the curvature data of the contour point sequence excluding the perfect circle. A temporary junction position extracting mechanism for extracting a point as a temporary junction, and (b7 ) a contour point of one of the temporary junctions (first temporary junction).
One of a predetermined number of points before and after the column is regarded as a first joining point candidate,
Other temporary joints on the same contour point sequence near the first temporary joint point
A predetermined number of front and rear points on the outline point sequence of one of the joint points (neighboring joint points)
One of the points is regarded as a second joint point candidate, and a point sequence is formed on the same contour point sequence.
In the scanning direction, the second temporary junction, the first temporary junction, and the vicinity
Before the joining point and the third temporary joining point are arranged in a line in this order.
Select the near junction, the second temporary junction, and the third temporary junction
Means, the second temporary junction, the first junction candidate,
The four points of the second joint point candidate and the third temporary joint point are smoothest.
Of the first candidate junction based on the smoothness of the line connecting
Means for determining the degree of connection, and the first joint point having the highest degree of fitness.
Select the complement and make it the optimal joint that replaces the first temporary joint.
And the optimum junction extraction mechanism having a means that, (b8) to the approximation accuracy is maintained without it from the optimum junction is two or more arc start point to the straight line or a continuous two or more consecutive linear and unwanted junction removing mechanism to a removal found it unnecessary junctions, between the (b9) adjacent the junction of the sequence of points the same group,
When approximated by an arc of the order which at a given approximation accuracy is not obtained
When t is an independent variable and x and y are dependent variables, it is approximated by a second-order piecewise polynomial and the second order is used until the approximation accuracy falls within a predetermined value.
Wherein between the piecewise polynomial junctions while increasing the number of dimensions adjacent repeated a least squares approximation straight line, an arc, a data approximation mechanism B approximated by piecewise polynomials, every group of (b10) point sequence compressed data storage mechanism for storing the parameters of the function approximating the one coordinate and the adjacent <br/> junction of the junction and be more of the compressed data is the communication data generating device (d) to the communication data (F) a communication data receiving device for receiving the transmitted data; (g) a compressed data generating device for generating compressed data from the received communication data; h) A mechanism for reproducing the outline of the entire image based on the approximate data of the line connecting the joint points from the compressed data to reproduce the image data, and (i) a reproduced data output mechanism device for drawing an image based on the reproduced data. , (J) communication device character graphic comprising a second image memory for storing an image based on the reproduction data. 8. A device for transmitting a character / graphic from a transmitting side to a receiving side through a transmission line, the transmitting side comprising: (B) a data compression device for sequentially compressing the entire stored image data by function approximation, and (c) a compressed data storage device for storing the compressed data. (D) a communication data generation device for converting data in the compressed data storage device into communication data, and (e) a communication data transmission device for transmitting communication data, wherein the data compression device for the whole image on the transmission side (b) (B1) a contour line extraction mechanism for extracting a contour line of a character figure from the entire image; and (b2) a contour point for storing two-dimensional coordinates (X, Y) of the extracted contour line for each continuous group. A storage mechanism, (b3) X contour point sequence for each of the groups, the Y-coordinate independent variable t, approximated by a quadratic piecewise polynomial that the dependent variable x and y, the approximation accuracy is within a predetermined range A data approximation mechanism A that repeats least square approximation until an approximate polynomial for each group of contour point sequences is obtained, and (b4) obtains a curvature at each point of the point sequence for each group in the x, y space from the approximation result. A curvature calculation mechanism; (b5) a perfect circle extraction mechanism for extracting a perfect circle from the curvature data for each group; and (b6) a curvature greater than a predetermined value from the curvature data of the contour point sequence excluding the perfect circle. A temporary junction position extracting mechanism for extracting a point as a temporary junction, and (b7 ) a contour point of one of the temporary junctions (first temporary junction).
One of a predetermined number of points before and after the column is regarded as a first joining point candidate,
Other temporary joints on the same contour point sequence near the first temporary joint point
A predetermined number of front and rear points on the outline point sequence of one of the joint points (neighboring joint points)
One of the points is regarded as a second joint point candidate, and a point sequence is formed on the same contour point sequence.
In the scanning direction, the second temporary junction, the first temporary junction, and the vicinity
Before the joining point and the third temporary joining point are arranged in a line in this order.
Select the near junction, the second temporary junction, and the third temporary junction
Means, the second temporary junction, the first junction candidate,
The four points of the second joint point candidate and the third temporary joint point are smoothest.
Of the first candidate junction based on the smoothness of the line connecting
Means for determining the degree of connection, and the first joint point having the highest degree of fitness.
Select the complement and make it the optimal joint that replaces the first temporary joint.
And the optimum junction extraction mechanism having a means that, (b8) to the approximation accuracy is maintained without it from the optimum junction is two or more arc start point to the straight line or a continuous two or more consecutive linear and unwanted junction removing mechanism to a removal found it unnecessary junctions, between the (b9) adjacent the junction of the sequence of points the same group,
When approximated by an arc of the order which at a given approximation accuracy is not obtained
When t is an independent variable and x and y are dependent variables, it is approximated by a second-order piecewise polynomial and the second order is used until the approximation accuracy falls within a predetermined value.
Wherein between the piecewise polynomial junctions while increasing the number of dimensions adjacent repeated a least squares approximation straight line, an arc, a data approximation mechanism B approximated by piecewise polynomials, every group of (b10) point sequence compressed data storage mechanism for storing the parameters of the function approximating the one coordinate and the adjacent <br/> junction of the junction and be more of the compressed data is the communication data generating device (d) to the communication data (F) a communication data receiving device for receiving the transmitted data; (g) a compressed data generating device for generating compressed data from the received communication data; h) a mechanism for reproducing the image data by reproducing the outline of the entire image based on the approximate data of the line connecting the joint points from the compressed data by enlarging or reducing the outline by an original size or calculation; and (i) reproducing data. Based scale, and enlarged or reduced reproduction data output mechanism draw the image device, (j) communication device character graphic comprising a second image memory for storing an image based on the reproduction data. 9. An apparatus for transmitting a character graphic from a transmission side to a reception side via a transmission line, the transmission side comprising: (B) a data compression device for sequentially compressing the entire stored image data by function approximation, and (c) a compressed data storage device for storing the compressed data. (D) a communication data generation device for converting data in the compressed data storage device into communication data, and (e) a communication data transmission device for transmitting communication data, wherein the data compression device for the whole image on the transmission side (b) (B1) a contour line extraction mechanism for extracting a contour line of a character figure from the entire image; and (b2) a contour point for storing two-dimensional coordinates (X, Y) of the extracted contour line for each continuous group. A storage mechanism, (b3) X contour point sequence for each of the groups, the Y-coordinate independent variable t, approximated by a quadratic piecewise polynomial that the dependent variable x and y, the approximation accuracy is within a predetermined range A data approximation mechanism A for repeating the least squares approximation until an approximate polynomial for each group of contour point sequences is obtained, and A curvature calculation mechanism; (b5) a perfect circle extraction mechanism for extracting a perfect circle from the curvature data for each group; and (b6) a curvature greater than a predetermined value from the curvature data of the contour point sequence excluding the perfect circle. A joining point position extracting mechanism for extracting a point as a joining point; and (b8) approximation accuracy is maintained without a joining point which is a starting point of two or more continuous straight lines or two or more continuous arcs. Unnecessary joint removal that finds and eliminates such unnecessary joints A mechanism, between the (b9) adjacent the junction of the sequence of points the same group linear,
When approximated by an arc of the order which at a given approximation accuracy is not obtained
When t is an independent variable and x and y are dependent variables, it is approximated by a second-order piecewise polynomial and the second order is used until the approximation accuracy falls within a predetermined value.
Wherein between the piecewise polynomial junctions while increasing the number of dimensions adjacent repeated a least squares approximation straight line, an arc, a data approximation mechanism B approximated by piecewise polynomials, every group of (b10) point sequence compressed data storage mechanism for storing the parameters of the function approximating the one coordinate and the adjacent <br/> junction of the junction and be more of the compressed data is the communication data generating device (d) to the communication data (F) a communication data receiving device for receiving the transmitted data; (g) a compressed data generating device for generating compressed data from the received communication data; h) A mechanism for reproducing the outline of the entire image based on the approximate data of the line connecting the joint points from the compressed data to reproduce the image data, and (i) a reproduced data output mechanism device for drawing an image based on the reproduced data. , (J) communication device character graphic comprising a second image memory for storing an image based on the reproduction data. 10. A device for transmitting a character / graphic from a transmitting side to a receiving side through a transmission line, the transmitting side comprising: (B) a data compression device for sequentially compressing the entire stored image data by function approximation, and (c) a compressed data storage device for storing the compressed data. (D) a communication data generation device for converting data in the compressed data storage device into communication data, and (e) a communication data transmission device for transmitting communication data, wherein the data compression device for the whole image on the transmission side (b) (B1) a contour extraction mechanism for extracting a contour of a character figure from the entire image; and (b2) a contour for storing two-dimensional coordinates (X, Y) of the extracted contour for each continuous group. A sequence storage mechanism, (b3) X contour point sequence for each of the group of, Y coordinates independently t variable, and approximated by a quadratic piecewise polynomial that the dependent variable x and y, the approximation accuracy is predetermined range A data approximation mechanism A that repeats least-squares approximation until an approximate polynomial for each group of contour point sequences is obtained, and (B5) a perfect circle extraction mechanism for extracting a perfect circle from the curvature data for each group; and (b6) a curvature having a predetermined value based on the curvature data of the contour point sequence excluding the perfect circle. lines and junction position extraction mechanism for extracting large points as junctions, between the (b9) adjacent the junction of the sequence of points the same group,
When approximated by an arc of the order which at a given approximation accuracy is not obtained
When t is an independent variable and x and y are dependent variables, it is approximated by a second-order piecewise polynomial and the second order is used until the approximation accuracy falls within a predetermined value.
Wherein between the piecewise polynomial junctions while increasing the number of dimensions adjacent repeated a least squares approximation straight line, an arc, a data approximation mechanism B approximated by piecewise polynomials, every group of (b10) point sequence compressed data storage mechanism for storing the parameters of the function approximating the one coordinate and the adjacent <br/> junction of the junction and be more of the compressed data is the communication data generating device (d) to the communication data (F) a communication data receiving device for receiving the transmitted data; (g) a compressed data generating device for generating compressed data from the received communication data; h) A mechanism for reproducing the outline of the entire image based on the approximate data of the line connecting the joint points from the compressed data to reproduce the image data, and (i) a reproduced data output mechanism device for drawing an image based on the reproduced data. , (J) communication device character graphic comprising a second image memory for storing an image based on the reproduction data.