JPH06348837A - Dividing/reading/compressing/storage device and synthesizing/outputting device for character and graphic - Google Patents

Abstract

PURPOSE:To adapt a device also to an original picture whose area is wider by using a computer whose memory capacity is small by operating outline point string extraction, connection extraction, and function approximation by using a small area as an object. CONSTITUTION:Graphic/character are optically read by an image scanner, stored in a first picture storage device 1, divided into basic processing areas which can be data-compressed, the divided pictures are successively data-compressed, and stored in a second picture storage device 1'. Then, the entire original picture is stored in the first picture storage device 1, divided into unit sizes from the top left corner toward the right direction, compressed one by one, the first divided picture is segmented, data-compressed, and stored in the second picture storage device 1'. Moreover, the second divided picture is similarly data- compressed, and stored in the second picture storage device 1'. Thus, the border line extraction, connection extraction, and inter-connection line function approximation is operated. At the time of reproducing the picture, the reproduction of each divided picture is repeatedly operated.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a device for dividing, reading, compressing, storing and reproducing a large original image including a character graphic by using a device having a small memory capacity. Shape record,
It is an object of the present invention to provide a device which can perform reproduction with a memory having a small capacity, has extremely excellent recording quality, and has beautiful reproduced characters and figures.

[0002]

2. Description of the Related Art There are already many devices for reading characters and figures by an image scanner, digitizing them, and storing them in a memory. The screen of the image scanner is divided into vertical and horizontal pixels. Assuming that pixels are arranged laterally M and vertically N, there are a total of MN pixels.
Pixels are sometimes simply called dots. If there are n bits of data for one pixel, the total amount of data is n.
It becomes the MN bit. The larger the number of screen divisions MN is, of course, the higher the sharpness of the image is. However, if the MN is large, an enormous amount of data will be generated even if the amount of data on one screen is nMN.
It will be the amount of data. If this is stored as it is, a very large memory is required. In fact, currently used printing machines and the like use a huge amount of memory for storing image data.

However, if the number of divisions MN is reduced, the screen becomes rough and the quality of the reproduced image deteriorates. The appropriate number of divisions is determined from the requirements for memory capacity and image quality. An actual character graphic is often a continuous graphic surrounded by continuous contour lines. Therefore, the contour line is often a set of straight lines, a straight line and a smooth curve, or a set of perfect circles. Do not handle graphics whose slope changes for each dot. Therefore, it is attempted to read the original image with an image scanner, digitize it, and immediately compress it instead of storing it in a memory. However, at the present time, no compression method has been found other than the method of the present inventor, in which the data can be sufficiently compressed and the reproduced image has high quality.

The method for compressing character data and the method for compressing graphic data by the present inventor have been proposed in Japanese Patent Application Nos. 4-259137 and 4-269646. This is because after reading the original image and digitizing it, the contour line was extracted, the curvature at each point of the contour line was calculated, the point with a large curvature was made the joint point, the joint point was arranged, and the position of the joint point was corrected. Later, the parameters of the line connecting the adjacent junctions are obtained. At this time, when the line connecting the joining points is a curve, the full-energy function proposed by the present inventor is used. This is a major feature.
The coordinates of the joint point thus obtained and the parameters of the line connecting the joint points are stored in the memory. This eliminates the need for pixel data other than the contour line. Further, even on the contour line, the data of points other than the joining points becomes unnecessary. Therefore, the amount of data to be stored is greatly reduced. The memory capacity is also small. It is a truly excellent invention.

[0005]

With a large-sized computer having a large memory capacity, even an original image of A4 or B4 size can be read and compressed as it is and stored in the memory. In the case of a device having a large memory capacity, the method of the above invention can be applied as it is. It is desired to implement these inventions by using an inexpensive personal computer. However, with a small memory capacity of the personal computer, only a small original image can be processed. It is necessary to store all the data of the input image even temporarily, because the memory capacity required for this purpose is quite large.

For example, when a personal computer is used, a device for reading an image in a small square area of 256 dots × 256 dots can be constructed according to the above invention. When the number of dots is limited, the size of the original image is also limited. For example, if an image scanner of 320 dpi is used, the size of 256 dots × 256 dots is about 2c.
The size is m square. This can be effectively used for small original images of 2 cm square. There is a benefit in storing and reproducing such a small original image. However, the readable area is extremely narrow, limiting its use. It is highly desirable to be able to process a larger area of the original picture.

If a coarser dot image scanner is used, the size of the reading area is increased, but on the contrary, the reading data may be coarse, which is not desirable. If you try to read an original image of A4 size (length 30 cm x width 21 cm) with the same accuracy, 15 times x 11 times = 165
Requires double the memory capacity. It is impossible for an ordinary personal computer to handle such an enormous amount of data as it is. It is a first object of the present invention to solve the above problems and to provide an apparatus in which the invention described above can be applied to an original image having a wider area while using a computer having a small memory capacity. A second object is to provide a device capable of simply describing a contour line by an appropriate function approximation and improving the quality of a reproduced image.

[0008]

According to the method of the present invention, a large original image is read by an image scanner, the read image is divided into small basic image processing areas which can be processed by small dots, and these divided images are divided. Is treated as one figure, contour lines and joint points are extracted, and the lines between the joint points are function-approximated. The same process is performed for all divided images. The processing to be performed on the divided images is described in Japanese Patent Application No. 4-2
This is the same as the method proposed in 59137. The parameters of the connecting points for all the divided images and the line connecting the connecting points are obtained. Then, these are stored in the memory. Reproduction is also performed for each divided image. Since each dot overlaps, a continuous large image is reproduced.

Since the original image is divided vertically and horizontally by the basic processing area, some areas of the divided image have no original image at the upper, lower, left and right edges. In this portion, the pixel data is set to 0. In other words, 0s are embedded in the remaining portion that extends from the original picture. In this way, all the divided images have the size of the basic processing area. Some measures are taken so that curves and straight lines are smoothly connected between adjacent divided images. One dot that overlaps between adjacent divided images will be referred to as a boundary portion. Border pixels are particularly important. This portion has the same dot data in adjacent divided images. This undergoes different processing on different split images.
Dot data at the boundary should not disappear during the approximation of the junction extraction function. Therefore, when extracting the junction points, the black pixels at both ends are always used as the junction points in the boundary portion.

Next, the outline of the method of the present invention will be described in advance. A character figure or the like having an arbitrary size is read by optical means. The data read by the optical means is stored by the first image storage device. It is divided into basic processing areas capable of image processing, and data is cut out for each divided image. At this time, one dot is overlapped along the boundary line. The divided image data is stored in the second image storage device. A contour line is extracted for each divided image. This is the second
This is done by reading the data for each divided image from the image storage device. The contour line is given as a sequence of contour points. A contour point sequence is stored for each divided image. Extract boundary junction points. This is a splice point near the boundary of the two split images. This is one of the features of the present invention. The joint points at the boundary portion in contact with the surroundings are forcibly extracted so that the divided data can be smoothly connected when joined at the time of reproduction. Since the extracted joining point needs to exist as a joining point in any case, it is treated as a special joining point in the subsequent processing and is not removed by the joining point removing mechanism or the like. Data approximation is performed on one divided image to compress the data. Store the compressed data. The data compression is performed by the same method as the above-mentioned Japanese Patent Application Nos. 4-259137 and 4-269646. The joint points are extracted from the contour line and the coordinates thereof are obtained. Delete unnecessary junction points.
It is determined whether the line connecting the remaining adjacent junction points is a straight line, a circular arc, or a free curve, and these are stored together with the parameters that define these lines. The full-energy function is used when connecting adjacent junctions with a free-form curve. The number of data is remarkably reduced, and the straight line becomes beautiful and the curve becomes smooth. This is called data compression because the number of data decreases. This is a data compression operation performed for each divided image. After storing the compressed data of one divided image in the storage device, the same operation is performed for the next divided image. Data compression is sequentially performed on all divided images. In this way, all the divided images are represented by the line connecting the joining points. The reproduction of the image is performed by repeating the reproduction of each divided image. Reproduction of an image from compressed data is also described in Japanese Patent Application Nos. 4-25913 and 4-26964.
Perform in the same manner as No. 6. At this time, the layout editor is used to lay out the divided images so that they are attached to each other. The divided images are reproduced so that one dot overlaps at the boundary.

[0011]

The method of the present invention will be described with reference to the drawings. FIG. 1 shows an operation of cutting out a divided image from the first image storage device and compressing the data and storing the data in the second image storage device. The original drawing is, for example, the size of a normal document having a size of A4 or A3. The image character is optically read by an image scanner. This is the first image storage device 1
Memorized in. Since the original image is large, the amount of data also increases. Since the amount of data is too large, it is impossible to compress the data as it is with the capacity of a commercially available personal computer. Therefore, this is divided into basic processing areas in which data compression is possible. This is a small area of, for example, 256 × 256. The image of the basic processing area will be referred to as a divided image. According to the procedure described below, the divided images are sequentially compressed one by one and then stored in the second image storage device 1 '.

Since the divided image is sufficiently small, it can be easily compressed by the method of the present invention using a commercially available personal computer. Data compression includes contour point sequence extraction, curvature calculation, curvature storage, perfect circle extraction, joint extraction, optimum joint extraction, joint removal, joint storage, derivation of a line connecting the joints, This is done by memory of parameters.
The entire original image is stored in the first image storage device 1.
Divide it from the upper left to the unit size to the right. This is compressed one by one. Cut out the first divided image,
The data-compressed version of this is used as a second image storage device 1 '.
(Compressed data storage device). This is shown in (1) of FIG. Then, the second basic processing area is cut out to form a second divided image. The same data compression operation is performed on the second divided image. That is, contour point sequence extraction, curvature calculation, curvature memory, perfect circle extraction, joint point extraction, optimum joint point extraction, joint point removal, joint point storage, derivation of a line connecting joint points, and parameters for this line. Storage and the like are performed on the second divided image, and the result is stored in the second image storage device 1 '(compressed data storage device). Figure 1
(2) of.

When the third divided image is cut out, it is entirely made up of white pixels. There are no black pixels. In other words, it is a blank part. This does not require processing such as contour point string extraction. Immediately, the next divided image can be cut out and compressed. Similarly, the data compression for each divided image is repeated in the same manner, and the data compression is performed for all the divided images. If the original image is divided into M'horizontal divided images and N'vertical divided images in the vertical direction, there are a total of M'N 'divided images. In this case, the same data compression operation is repeated for M'N 'divided images.

According to the present invention, when dividing a large original image, one pixel at the boundary is overlapped. FIG. 2 is a diagram showing that the boundaries overlap at the time of division. The divided image is in contact with another divided image on four sides, three sides, or two sides. The region is divided so that one pixel, that is, one dot overlaps at the vertical and horizontal boundaries. This is because the reproduced image correctly reproduces the original image. For example, the size of the basic area, that is, the divided image is, for example, 256 dots × 256 dots. The size of the divided image is not limited to this, and can be set to a square such as 128, 512 dots, which is a power of two. However, it does not have to be a power of two. It suffices if it is of an appropriate size and can be easily compressed by a computer being used. The reason why 1 dot overlap is explained. It is assumed that the divided images P and Q have a pattern as shown in the drawing over both. In the left divided image P, three black pixels are vertically arranged at the boundary. The same three black pixels are also arranged in the right divided image Q. This is because the left and right divided images share one dot on the boundary line. The data is compressed and stored in the second image storage device. When this is read out again and reproduced, a reproduced image P + Q below is obtained. Since the three black pixels of the boundary line are shared, the two divided images can be smoothly connected at the boundary.

If the boundary line is not shared, a reproduced image may have a gap or be deformed. This will be described with reference to FIG. In FIG. 3, the original image is divided into unit sizes without overlapping one pixel. It is assumed that the divided images P and Q have the same pattern as the above. In the left divided image, there are three black pixels arranged vertically at the boundary. The right divided image does not have this, and two black pixels are lined up. This is data-compressed and stored in the second image storage device 1 '. When this is reproduced, a gap is created between the divided images P and Q as shown on the left on the lower side. This is because there is no overlap and there is no connection between them. Alternatively, there will be a step as shown in the lower right. In any case, it separates from the original picture. The original picture cannot be faithfully reproduced. For this reason, the divided images are overlapped by one dot at the boundary as shown in FIG.

The number of dots × the number of dots of the original image as a whole depends on the number of dots of the image scanner in addition to the geometrical size of the original image. The size in the vertical and horizontal directions varies, and is not an integral multiple of the basic size (for example, 256 × 256 dots). When the original image is cut out from the divided images (one dot at a time), a basic unit area is left at the right end as shown in FIG. There is also a surplus at the bottom edge.
When there is a remainder, a white pixel (that is, 0) is associated with this remainder. Zeros are embedded in the remaining part of the basic unit area on the right and bottom. When the image is divided, the end points of the straight line along the boundary are left as joint points. As will be described later, the junction point is originally defined as a point having a large curvature in a part of the curve. This is important as data when performing data compression. The compression data is a straight line or a curve connecting the joining points with each other. Even if it initially appears as a junction, it may disappear due to the removal operation. The end points of the straight line on the boundary are to be left as junction points even if they should be removed by the removal operation. This is for the purpose of smoothly connecting the two divided images at the boundary line.

As shown in FIG. 2, when the boundary line and the pattern line make a large angle (here, a right angle), the black pixel at the bottom of the right divided image Q does not disappear, so that it is smooth. Connected. However, when the pattern line and the boundary line form a small angle, the joint point necessary for reproducing the pattern may disappear. In order to prevent this, it is decided not to remove the junction point forming the end point of the straight line on the boundary. This will be described with reference to FIG. As shown in (1), it is assumed that the original drawing has diagonal lines that make a small angle with respect to the dividing line. This diagonal line and the dividing line intersect. In this case, the right divided image is as shown in (2). RS is a straight line portion along the boundary. Black pixels are lined up. When the junction point is extracted, it becomes as shown in (3). R, S, and T are extracted as junction points. When the normal joining point removing operation is performed, the intermediate joining point S having a low curvature disappears. If this disappears, as shown in (4), the data that connects T and R is
It becomes a ta. Since the point S disappears, the reproduced image is (5)
As shown in, the points S and T are not connected, but the points R and T above this are connected. This is different from the original picture in (1). Why did this happen?
This is because the intermediate junction point S has disappeared. In order to faithfully reproduce the original image, it is necessary to leave an intermediate joining point S. For this reason, the joining points, which are the end points of the straight lines on the boundary, are left in the subsequent operation.

A flowchart showing such an operation is shown in FIG. This is a flowchart for saving the splicing point at the left boundary line (x = 0) of the divided image. The coordinates are taken with the upper left as the origin and the X axis toward the right and the Y axis toward the bottom. First, one closed contour {(x
_i , y _i )} _{i = 0} read data of ^leng-1 . here,
(X _i , y _i ) represents the coordinates of the contour point sequence. i is the number of the contour point sequence. i takes a value from 0 to length-1. The length is the number of constituent contour points of the closed contour. Since the joining point at the left boundary line (x = 0) of the divided image is targeted, x _i = 0 and x _{i + 1} = 0 are conditions.
At this time, a junction point flag for starting a straight line is set at (x _i , y _i ). The i-th and subsequent coordinate points may be on this straight line or may deviate from this straight line. The last coordinate point on this straight line is left as a junction point, and a flag is set so that the curve starts from this point.

Let k be a number from i + 1 to length-1. If x _k = 0, it is a point on the boundary line. First x _k ≠ 0
If there is _one , the coordinate immediately before this (x _k-1 , y
_k-1 ) is the starting point of the curve. The first endpoint of the straight line along the boundary was (x _i , y _i ), but the last endpoint was (x _i , y _i ).
_k-1 , y _k-1 ). Therefore, first, x _k ≠
A curve start flag is set at the coordinates (x _k−1 , y _k−1 ) immediately before the point that becomes 0. Another condition is y _k
-If y _k-1 <0, the previous point (x _k-1 , y _k-1 )
Set the curve start flag from. That is, this point is left as a joining point. The meaning of this will be described with reference to FIG. What has been described above is along the right boundary line of the divided images, but those along the left boundary line also have the junction points at the end points of the straight lines. x _i = 255, x _{i + 1} = 2
The condition of 55 is written in the lower part of the flow chart, which means that the same is done for the straight line component on the right boundary of the divided image. Do the same for a straight line along the line above the split image. The condition for this is y _i
= 0, y _{i + 1} = 0. The same thing is done for a straight line along the boundary line below the divided image. This can be expressed by y _i = 255 and y _{i + 1} = 255.

The meaning of setting the curve start flag at (x _k-1 , y _k-1 ) even when y _k -y _k-1 <0 will be described with reference to FIG. In FIG. 7, the X-axis is downward and the Y-axis is rightward in order to represent the processing order vertically. Consider a junction at x = 0 (a boundary line on the left side) of the divided images. Consider a figure like (1). It is assumed that the contour point sequence is numbered in the order of the arrows. For convenience of description, the pixel is labeled with Irohaniho hetchirinuriru. In x, x = 0 for the first time, so a straight line flag is set here, which means that a straight line along the boundary starts. If there are only conditions of x _{k + 1} ≠ 0,
As shown in (2), a curve start flag will be set up in F. In this case, the reproduced image becomes as shown in (3), and two points, G and C, at the ends of these are missing. Therefore, if a curve start flag is set even when y _k −y _k−1 <0, as shown in (4), y _k −y at the turn point G and the turn point on the boundary line. _k-1 <
0 stands out. Therefore, a curve start flag is set at the point that gives (x _k-1 , y _k-1 ). This way
As shown in (5), all the straight lines along the boundary can be reproduced.

In the present invention, a large image is simply divided, data is compressed, the data is stored, and the divided images are combined and reproduced as an image. Since the contour line is extracted and the image is stored as a straight line or a curved line connecting some joint points and this, the contour line is the first line at the time of reproduction.
Is reproduced. Therefore, it can be used not only for reproducing an image as it is, but also for cutting a sheet along a contour line by using a cutting plotter.
There is not much problem when reproducing the image as it is. However, the problem remains when trying to cut out the contour line. Outputting only the contour line will be referred to as outline output here.

The difficulty of outline output will be described with reference to FIG. It is assumed that the input image is a figure surrounded by a closed curve that extends over four divided images as shown in FIG. This is divided into four small images each having a unit size like a circle. The divided images are individually function-approximated. Then, a figure surrounded by the boundary and the contour line that originally existed is obtained. In this simplified example, the data is composed of three joining points in the divided image, two straight lines connecting the joining points, and one quadrant arc. This data is stored in the image storage device. In the case of reproduction, there are two methods. In the case of filling, data of four partial divided images are overlapped like data, and filling is performed in order from the upper left closed region (data). Next, the closed area on the upper right is also filled. It looks like Les. If you fill this in the lower left too, it will look like Seo. Furthermore, when the lower right part is filled, it becomes like a tsu. This completes the reproduced image.

This is not a problem because the original black line becomes black, and the boundary line is buried in black.
However, when trying to cut the contour line with a cutting plotter or the like, even if the four divided images are simply attached together, the contour line appears like a yo. This is the problem. This will be described more specifically. FIG. 9 is an original drawing drawn by a free-form curve. A line is a group of curves, and there are thick and thin lines. However, since the size is limited by the conditions of the patent application drawings, the size is reduced and copied.

FIG. 10 is a reproduced image with contour lines. This corresponds to the case where the sheet is cut by the cutting plotter. Such a diagram can be obtained by replacing the blade of the plotter with a pen. The contour line appears so as to surround a portion that should become a black pixel. The boundary line (division line) of the divided image also appears inside the region that should become the black pixel.
The size of the basic divided image is about 20mm x 20mm ~
Since it is about 30 mm × 30 mm, boundary division lines appear vertically and horizontally at the pitch of the divided image. Boundary dividing lines appear clearly for those with many black pixels. Such a dividing line originally did not exist, and appeared because the original image was divided into small divided images. Therefore, when cutting the contour line, it is necessary to prevent such a boundary dividing line from appearing.

FIG. 11 is a reproduced image by painting.
The output device is Rico-Imagio MF530 (400 dp
i). In this case, the portion surrounded by the closed contour line as shown in FIG. 8 is blackened. The same figure as the original picture is obtained. Since the boundary dividing line is only in the black pixel portion,
If you fill it, such a boundary dividing line will disappear. It is a drawing of a patent application and its size is limited, so it has been reduced. Therefore, there is no difference in size from the original image in FIG. However, since the data is compressed and stored, enlargement and reduction can be performed in a short time by a simple calculation. In this case as well, the size of the reproduction screen and the size of the original image are different, but it is not possible to show the difference in size due to the restriction of application drawings.
It can be seen that the reproduction screen of FIG. 11 is a faithful reproduction of the original image of FIG.

FIG. 12 shows another original picture. This is also an illustration of animals that are mainly composed of curves. Includes thin lines, thick lines, solid parts, etc. This is divided into small basic processing screens and data is compressed. The reproduced image by the contour line is shown in FIG. This also shows the dividing line of the boundary. Especially, the dividing line appears in the picture of panda with many black parts. FIG. 14 is a reproduced image by filling. This also used Rico-Imagio MF530 (400 dpi) as an output device. Although the size is different from the original, it is almost the same size because it is a patent drawing. It can be seen from this that the original data is faithfully reproduced by the method of the present invention when the divided data is compressed, stored and reproduced.

The problem of outline output will now be described. The features of the contour line on the division boundary line will be described with reference to FIG. The contour line on the dividing boundary line has the following features. (1) It is a straight line. (2) The joint points at both ends are both on the boundary line, and the x-coordinates or the y-coordinates are the same. That is, if the coordinates of both ends of the straight line are (X _a , Y _a ), (X _b , Y _b ), X _{a
= X b = 0, X a} = X b = 255, Y a = Y b = 0,
Any one of Y _a = Y _b = 255 is established. For example,
In FIG. 15, both ends of the curved line are on the left side of the divided image (that is, X _a = X _b = 0). Both ends of the curved line are on the upper side of the divided image (Y _a = Y _b = 0). Both ends of the curved line are also on the upper side of the divided image. Both ends of the curved line are on the right side of the divided image (X _a = X _b = 255), one end of the curved line is on the lower side of the divided image (Y _a = 255), and multi-end is on the right side of the divided image (X _b = 255). The line segment connecting these two points appears by dividing, and in the case of outline output, it is necessary to devise not to output this.

FIG. 16 shows an example of an algorithm in which the contour line on the division boundary line is not output at the time of output. FIG.
In, the coordinates of the point on the boundary line are (X _a , Y _a ), and the coordinates of E are (X _b , Y _b ). From the starting point ヰ draw a figure on a paper or release paper with a pen or a blade.
From the edge to the edge, trace on the paper as it is, but when you reach the point on the boundary line, raise the pen or the blade, move the pen or blade along the boundary line with it raised, and move it to the point on the other boundary line. Use the pen and the blade to draw the contour line in the split image. In this way, by raising the pen and the blade between the joining points on the boundary line and moving them, the dividing line can be prevented.

The novel aspects of the present invention are as described above. Next, the data output of divided images will be described.
Regarding the handling of divided images, the above-mentioned Japanese Patent Application No. 4-25913
No. 7, Japanese Patent Application No. 4-269646 and the like are used. A divided image is an image of a unit size,
For example, it is an image of 256 dots × 256 dots. This is data-compressed and stored. A configuration therefor is shown in FIG.

A. Image storage device 1 B. Contour point sequence extraction device C. Contour point sequence storage device D. Data approximation mechanism A E. Curvature calculation mechanism E '. Approximate curvature storage device F. Perfect circle extraction mechanism G. Perfect circle memory device Joint position extraction mechanism I. Joint point position storage device J. Optimal junction extraction mechanism K. Optimal Junction Memory L. Junction removal mechanism M. Final junction memory N. Data approximation mechanism B O. Compressed data output mechanism P. Compressed data storage device R. Contour reproduction mechanism S. Image reproduction mechanism T.I. Reproduction data output mechanism U. Image storage device 2

First, the original image is read by an image scanner having an appropriate resolution. The entire image is stored in the first image storage device A. This is the basic size (eg 256 x 25
(6 dots), and the following compression processing is performed one by one. The target of the following is a divided image. The divided image is a binary image of white and black, and the contour line that is the boundary between the white area and the black area is extracted. Since there are 256 × 256 pixels, the contour line is a contour point sequence. There are several closed contour point sequences. A number is assigned to each group of contour point sequences. Number the points in the sequence of contour points in order. The points can be expressed as points on the X and Y coordinates. Coordinates can be represented by numbering point sequences.

Further, using the parameter display, the X and Y coordinates are made a function of t. Since the contour point sequence is a sequence of points lined up continuously along the closed curve, it is possible to display a parameter.
Approximate with a piecewise polynomial over the entire contour point sequence group. Since it is a continuous function with a piecewise polynomial, the second-order differentiation is performed on each contour point sequence to obtain the curvature. 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 junction points are points that represent the outline point sequence. It is a point where the contour line can be expressed as a joining point and a line connecting the joining points. Initially, the point where the curvature is large is simply set as the joining point, but this is a temporary joining point. Junction points may be added later or removed. A joint point candidate is taken around the temporary joint point, and a suitable joint point is left as the optimum joint point.

When the joining points are determined, a straight line between the joining points,
It is approximated by an arc and a free curve. Approximation is straight line, arc,
Perform in the order of free-form 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 circular arc is easy. The starting point of the arc, the radius, the central angle, the coefficient of the function, etc. may be given. If it cannot be approximated by a straight line or a circular arc, then a free curve approximation is performed. In this case, the joining points are divided into M subsections and approximated by a piecewise polynomial. Since the approximation can be improved by increasing the number of subdivisions, the approximation with desired accuracy can be performed.

In this way, since the parameters of the joining point, the straight line, the circular arc, and the free curve are obtained, they are stored as the data expressing the divided image. For example, in the case of 256 × 256 dots, when the data compression of the present invention is carried out, it will be approximately 300
Data of about 500 bytes is enough. If the image is a black and white image as it is, there is as many data as there are pixels constituting the screen, so the data amount is 8 kilobytes. In the present invention, the data can be compressed significantly. In the present invention, such data compression and storage are performed for each divided image. On the contrary, these data can be read out to reproduce a straight line, a circular arc or a free curved line with the junction point as a reference. It can be reproduced at any size and at any position by calculation.

[A. Image storage device 1] This is for reading the entire original image by optical means and storing it as information decomposed for each pixel. Actually a commercial image
Use the scanner. Then, the input data is stored as, for example, a black and white binary image.

[B. Contour Point Sequence Extraction Device] The contour point sequence extraction device extracts the contour point sequence of the divided image. The contour of a set of black pixels is called a contour line. The divided image has several closed contour lines. There is also a contour line that has both ends at the boundary. This also becomes a closed contour line by regarding the boundary dividing line as a contour line. Since the image is a collection of dots, the contour line can be regarded as a collection of dots. A contour line is a set of points, and a series of consecutive 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 given to consecutive points in one contour point sequence. k is an integer of 0 to N (u) -1.
The coordinates of the k-th contour point in the u-th contour point sequence are (x _k ^u ,
y _k ^u) be represented by. All contour points

{(X _k ^u , y _k ^u )} _{k = 0} ^{N u -1} _{u = 0} ^U-1 (1)

Is represented by _{k = 0} ^{N u -1} means that the point sequence number k can take values from 0 to N (u) -1. N (u) -1 includes parentheses, which is 1
When it is a suffix of a variable because it cannot be / 4 corner, parentheses are removed and it is written as Nu-1. N u
−1 = N (u) −1. Since it is a suffix, it should be written above and below, but since this cannot be done, it is attached separately to the lower left and upper right. _{When u = 0} ^U-1 , the number u of the contour point sequence group is _{0 to} ^U -1
Is to take the value of. Also, the number u of the contour point sequence should be shown with parentheses on the right shoulder of the variable, but the parentheses are 1 /
Omit parentheses because it can't 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
This is stored in the form of _k ^u , y _k ^u ) _{k = 0} ^{N u -1} _{u = 0} ^U-1 . As described above, U is the number of all points and u is the number given to the points. The number of points in the point sequence u is N (u)
And k is the point number attached to it. Such a thing is expressed by _{k = 0} ^{N u -1} _{u = 0} ^U-1 . (X _k ^u, y _k
^u ) is the x, y coordinate of the kth point of the uth point sequence.

[D. Data Approximation Mechanism A] There are two data approximation mechanisms. This is the first one, but is added with A for distinction. This is necessary in order to find a joint where the contour point sequence has a large curvature. In order to obtain the curvature, some of the discrete points can be adopted as data and obtained from this. The present invention can be implemented even by adopting such a discrete curvature. However, here, the whole contour point sequence group is approximated by a continuous function consisting of a piecewise polynomial, and then this is second-order differentiated to obtain the curvature.
The approximation for this is the data approximation here. Approximate with a quadratic piecewise polynomial in which the independent variable is t, the dependent variables are x and y, and the x and y coordinates of the contour point sequence for each continuous group are t as the independent variable and x and y are the dependent variables. Then, the least squares approximation is repeated until the approximation accuracy falls within a predetermined range, and the approximation polynomial for each group of the contour line point sequence is obtained. The range approximated by the piecewise polynomial is the entire contour point sequence group. This is not to obtain the final data, but to find a temporary joining point.

X of contour point sequence (x _k ^u , y _k ^u ) in group u
Coordinates are approximated by S _x (t) and 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 whose base is a quadratic full-energy functional system {ψ _m }. S _x (t) is developed with the aperiodic mth-order full-energy function ψ _k as a basis.

S _x (t) = Σ _{k = -m} ^{M + m} C _k ^x ψ _k (t) (2)

The full-ency function is a function name named by the present inventor. The order m corresponds to the order of the polynomial. M is the number of dimensions. Generally, a m-th order full-energy function has a domain of [0, T], a parameter of k,
This parameter is shown as a suffix. C _k ^x
Is the coefficient of the linear linear combination. ψ _k itself is a polynomial whose value is 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) However, k = -m, -m + 1, ..., 0, 1, 2, ...
., M + M

Here, the plus added below the m-th power is 0 when the inside of the parentheses is negative, and the m-th power when it 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 mountain-shaped function having a finite value from the division number _{k to k} + m + 1 and having 0 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. When t> (k + m + 1) (T / M), it must be 0. Under this condition, the superposition coefficient is (-1) ^q / {q! (M + 1-q)! } Is decided. The size T of the area is the number N of points in the contour point sequence group.
It is easy to make it equal to (u), but it may be defined as proportional. As described above, the contour point sequence is approximated by using the full-energy function. However, since there are many division points having the intervals of T / M, the contour point sequence can be approximated even if there are no junction points. In order to increase the degree of approximation, the order m of the full-energy function may be increased. However, if the order is high, the number of calculations increases, and thus processing time is required.

The inventor's argument is that many functions representing the fluctuations of physical quantities in the natural world are expressed as a linear combination 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. m = 0 is a simple box-shaped function, m = 1 is a triangular function, and m = 2 is a quadratic polynomial function that spans three regions. Here, only m = 2 is adopted. With this, the contour line can be expressed exactly. Of course, the present invention can be constructed by using a full-energy function of m = 3 or more. m = 2
Therefore, the basis function has values over three intervals,
It becomes a quadratic polynomial in the section that takes the maximum at the center. The above formula is when m = 2,

S _x (t) = Σ _{k = -2} ^{M + 2} C _k ^x ψ _k (t) (6) ψ _k (t) = 3 (T / M) ⁻² Σ _{q = 0} ³ (−1) ) ^Q {t- (k + q) (T / M)} ² ₊ / {q! (3-q)! } (7)

It becomes The basis function is {t- (k + q) (T
/ M)} ² ₊ is a superposition of quadratic functions rising from four 0s which are shifted by T / M in the lateral direction. It is a function whose number of subdivisions has a value from k to k + 3. k + 4
The coefficient of superposition is (-
1) ^q / {q! (3-q)! } Becomes. The number of basis functions is M + 5. M is the number of divisions of the entire section, which is called the approximate number of dimensions. This should not be confused with the order m of the full-ency function. Similarly, S _y (t) approximating the y coordinate can be expanded by a full-energy function having C _k ^x as a coefficient.

The degree of approximation can be judged by how close it is to the original contour point sequence (x _k ^u , y _k ^u ). We evaluate this by the method of least squares, which is

Q = Σ {S _x (t _k ^u ) −x _k ^u } ² + {S _y (t _k ^u ) −y _k ^u } ² (8)

Is to minimize. The range of integration is all the points of the contour point sequence group u. From this condition, the coefficients C _k ^x and C _k ^y can be obtained. by this,
The approximate functions S _x (t) and S _y (t) are obtained. If the calculation can be performed for the contour point sequence group u = 0, the next step is performed for the group u = 1. Similarly, (u = U-
Calculate up to 1 group).

[E. Curvature calculation mechanism] Since approximate functions have been obtained for all contour point sequence groups, the second order differentiation is performed to obtain the curvature at each contour point sequence group and each point. The curvature K (t _k ^{u at} the k-th point (x _k ^u , y _k ^u ) of the contour point sequence group ^u
) Is

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 )² + S_y ′ (T_k ^u )² }^3/2 (9)

Can be calculated by Curvatures are calculated for all points in all contour point sequences.

[E '. Approximate Curvature Storage Device] This is a device that stores the curvature K (t _k ^u ) obtained in the previous stage for each point (contour point group u, point number k).

[F. True Circle Extraction Mechanism] This is to extract a true circle by discriminating whether or not a certain contour point sequence is a perfect circle based on the approximate curvature. The part of the perfect circle is another straight line,
If it is in contact with a curve, it is not extracted as a perfect circle. The pattern extracted by the perfect circle extraction is thereafter removed from the approximation calculation. This is labeled Circle (u). u is the number of the contour point sequence group. Extracting a perfect circle has the following advantages. One is that even if what is originally a perfect circle is slightly distorted due to noise, it is converted to a perfect circle and the noise is dropped, so that the shape can be determined more accurately. Further, since the circle can be specified only by the radius and the coordinates of the center, it is extremely effective in terms of data compression. A perfect circle means that the curvature at each point in the contour point sequence is all the same. Since the curvature is obtained at all points in the contour point sequence, the curvature at each point can be examined to extract a perfect circle.

[G. True circle storage device] The center circle coordinates and radius r obtained in the previous step are stored. Thereby, the data of the group u which is a perfect circle can be described by three values. In the case of a single true circle, this is an isolated circle point because the entire interior is a circle filled with black pixels. In the case of a double true circle, the space between the double circles corresponds to a circle filled with black pixels.

[H. Joint Point Position Extraction Mechanism] A joint point is a joint between straight lines, a joint between curves, a joint between curves, or a joint between curves. This is called a junction because lines with different slopes and different curvatures come into contact. Junction points play a very important role when functionally approximating a sequence of contour points.
The joint point determined through the curvature is a temporary joint point, and the joint point is additionally removed. According to the present invention, the amount of data can be minimized while maintaining the high quality of the reproduced image by accurately and properly determining the splicing point.
FIG. 18 shows the outline of the junction extraction procedure. The divided image is input and the outline point sequence forming the outer circumference is extracted. Junction points are extracted for each group of contour point sequences thus obtained. First, the obvious junction points are extracted. This can be determined as a point with a large curvature. This is a tentative junction and not optimal. Also, this alone cannot find all the joint points. On the contrary, some unnecessary junction points are included.

Therefore, it is necessary to correct the designation of the junction point. After that, the junction points at the right angle portion are extracted. This is to smooth the connection at the intersection when two straight lines intersect. The joining points of the straight line are the starting point and the ending point of the thin line, and the joining points which are thin lines and do not appear under the condition that the curvature is large are added. On the contrary, it is necessary to remove these because there are unnecessary junction points. One is a junction point in a straight line. When the junction is in the middle of a straight line and the distance from the straight line is small, the straight line may be maintained even if this is excluded. Since this is a junction point caused by noise, it is removed. The other is the junction of the arcs. What should be one arc originally has many junctions and may appear as two arcs. Also in this case, the middle joining point is removed and the arcs are merged into one arc. FIG. 19 shows an example of a joining point. In (a), the junction point of the contour line of "a" is shown by x, and in (b), the junction point of po is shown by x. Junction points are points where straight lines intersect, cusps, and curvature changes. This is a case of characters, but the junction of contours can be obtained for any figure.

When the joint points are determined, each section is approximated by a piecewise polynomial. The approximation of this piecewise polynomial is the same as that described in the data approximation mechanism A, but in the previous one, the approximation interval was over 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 in which the sum of the squares of the differences from the original coordinate values is minimized, as described above.

[I. Joining point position storage device] This is the temporary joining point number and coordinates {d _i (x _i ^u , y
_i ^u )} is stored.

[J. Optimal Joint Point Extraction Mechanism] What has been obtained so far is a temporary joint point determined only by the magnitude of curvature. These may not be the actual junctions. So we need to find the best joint. For example, when two lines intersect with each other, four corner points are formed, but in this case, the corners are crushed and are easily enlarged. Therefore, since the adjacent corner points are on the contour line of those lines, the optimum joint point is obtained. This will prevent the corners from undesirably bloating at the intersection of the lines. The optimum joining point should be near the temporary joining point obtained by the method described above. Therefore, some of the vicinity of the temporary joint point are set as joint point candidates, and the optimum point is obtained from the joint point candidates as the optimum joint point.

[K. Optimal Junction Storage Device] This is a device that stores all the optimum junctions obtained by the above operation. The optimum junction point is stored as (x _i ^u , y _i ^u ). u is the number of the contour point sequence. i is the number given to the junction in group u.

[L. Joint Point Removal Mechanism] Here, unnecessary joint points among the joint points extracted so far are removed.
Remove unnecessary joints from straight or circular joints.
The joining points obtained so far are obtained by approximating the contour line with a piecewise polynomial, obtaining the curvature, obtaining the temporary joining point, and obtaining the optimum joining point from the joining point candidates. Therefore, there should be almost no unnecessary junction points, but there may still be unnecessary junction points due to the influence of image noise. It is the junction of straight lines and the junction of arcs. There may be unnecessary junctions in the free curve, but in the case of a free curve it cannot be decided whether or not this is unnecessary. In the case of a straight line or a circular arc, it is a definitive figure, and it is possible to clearly distinguish what is out of this and what is not. For this reason, unnecessary joining points of straight lines and circular arcs are removed.

[Removal of Junction Points on Straight Line] For example, three junction points U, V, and W are arranged substantially on a straight line, but there are cases where they are slightly deviated from the straight line. In this case, 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. If this is excluded, the number of coordinate points decreases by one and the number of straight lines decreases by one. Two data will be reduced. This is more important in terms of reproducing a straight line more clearly than reducing the amount of data.

[Removal of Arc Joints] There are cases where a plurality of joints are continuous in the arc joints extracted up to the previous stage. In this case, if the quality of the data is maintained even if the intermediate joining point is removed, the joining point is removed. That is, when the center and radius of the arc connecting the intermediate junction and the next junction are similar to the center and radius of the arc connecting the first junction and the final junction, the intermediate junction is removed. The removal of the junction reduces the data. However, the removal of the joining points of the arcs is not to reduce the data but to reproduce the beautiful figure. In reality, what was a single arc is blurred due to noise, and the line looks like a set of multiple arcs. Therefore, this also means shaping the figure. The good quality of the reproduced image of the present invention is due to the fact that straight lines and arcs are drawn correctly by removing the joining points.

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

[N. Data Approximation Mechanism B] This is a mechanism for approximating the data from the data of the contour point sequence, the final joining point, the perfect circle, etc. obtained so far. It is the central part of the invention. What is input from each storage device is a contour point sequence storage device ... Contour point sequence {(x _k ^u , y _k
^u )} _{k = 0} ^{N u -1} Final junction memory device ... Final junction {(x _i ^u , y _i
^u )} _{i = 0} ^I-1 Perfect circle storage device ... Circle Circle (u). The suffix u of the contour point sequence is the number of the contour point sequence group. k is a contour point sequence number in the contour point sequence group u. N (u) (which is 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 are approximated between two adjacent joint points (between joint points). In the approximation, using the parameter t, the x component is s _x (t),
The y component is represented by s _y (t).

This means that the entire contour point sequence is first transformed by the parameter t.
It is the same method as described in. But this time the region is between the junctions, so the range of t or t and s _x
The correspondence between (t) and s _y (t) is different from the previous one. Further, it is known when the curvature is obtained at each point whether the section starting from a certain joint is a straight section, an arc section, or a free curve section. If it is a straight line, you just need to connect adjacent points. In the case of a circular arc, the coordinates and radius of the center may be calculated. In the case of a free curve, it is necessary to find the coefficient of the full-energy function.

[Approximation of Straight Line Section] The section starting from the joining point of the straight line is judged to be a straight line in the step of extracting the joining point. You know the coordinates of the start and end points. Therefore, it is not necessary to obtain the slope of the straight line. Just flag it as a straight line. [Approximation of Arc Section] Approximation of a section starting from a junction point of arcs will be described. This section is determined to be a circular arc at the stage of extracting the joining point. Approximate curves s _x (t) and s _y (t) representing arcs are represented by the linear combination of the following trigonometric functions. The observation interval is 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)

It is expressed 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 the parameter from the starting point of the arc.
It is the central angle up to the point corresponding to t. (C _x , C _y )
Are the coordinates of the center of the arc. At this time,

A _x ² + B _x ² = A _y ² + B _y ² (12) B _y / A _y = B _x / A _x (13)

If the following is true, the approximate function is a circular 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 and the coordinate of the curvature and one point in the middle.
[Approximation of free curve] A section that starts from a junction that is neither a straight line junction point nor a circular arc junction point is subjected to a free curve approximation. Although expressed by the parameter t, the contour point sequence is (x _i3 ^u , y _i3 ^u
), And t is associated with this, (t _i3 ^u , x
_i3 ^u ) and (t _i3 ^u , y _i3 ^u ) are displayed as parametric variables. Up to now, the suffix of the contour point sequence has been k, but since k is used as the section division number here, i3 is used as the contour point sequence number instead of k. The total number of contour point sequences is n3.

Then, s _x (t) and s _y (t) are expanded with the quadratic full-energy function ψ _k3 as the base. This is 3
This function has a value only in one subdivision. The interval is [0,
T], the quadratic full-energy function ψ _k3 is an M-dimensional functional system.

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

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

S _x (t _i3 ) = Σ _{k = -2} ^{M + 2} c _k ^x ψ _k3 (t _i3 ) (15) s _y (t _i3 ) = Σ _{k = -2} ^{M + 2} _ck ^y ψ _k3 It is expressed as (t _i3 ) (16). Here, when t> ξ _{k + q} (t−ξ _{k + q} ) ² ₊ = (t−ξ _{k + q} ) ² (17) When t ≦ ξ _{k + q} (t−ξ _{k + q} ) ² ₊ = 0 (18)

It is defined as ξ _{k + q} is the interval T is M
It is a subdivision when divided into equal parts. ξ _{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 so as to approximate each other. The value of the coefficient is determined by the method of least squares. Squared 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 contour line of a figure was separated into a straight line (line segment), a perfect circle, a circular arc, and a free curve by the above procedure. These have start and end points, and have parameters such as inclination, center, and radius.
The data to be stored also differs depending on each type. In the case of straight line data, a flag indicating that it is a straight line,
The starting point coordinates of the straight line are stored as data. Since the end point coordinate is given as the start point of the next section, it is not necessary to store it here. The slope of the straight line is a parameter that defines the straight line, but since the straight line is formed by connecting the coordinates of the start point and the next junction point, the slope is not necessary. This is also not stored.

In the case of 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 deleted.
Stored as a data. As the arc data, a flag indicating that it is an arc, the starting point coordinates of the arc, the arc division length (arc length / circumferential length), 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 stored and then output at an appropriate time. Up to this point, the device is for compressing and generating data and storing it. A large original image is input, stored in the first image storage device, cut out for each divided image, the above data compression operation is performed, and this is stored in the compressed data storage device P. This was expressed as the twelfth image storage device 1 '. Similarly, the next divided image is processed.
Data compression processing of divided images is performed one after another, and this data is compressed.
Data is stored in the memory device. Table 1 shows the data structure stored in the compressed data storage device P.

[0088]

[Table 1]

The size of the data will be described. If there is a straight line between the junction points, 1 byte for the flag indicating the straight line, 2 bytes for indicating the start point of the line segment (x coordinate and y coordinate)
It requires a total of 3 bytes. If there is an arc between the joining points, 1 byte is the flag that indicates the arc, 2 bytes to indicate the start point of the arc,
4 bytes to represent the central angle of the arc, 1 byte to represent the number of contour point sequences, 1 to represent the coefficients of the approximation function (there are 6)
Two bytes require a total of 20 bytes. If there is a free curve between the connecting points, it is 1 byte to represent the dimension number M of the function, 1 byte to represent the number of contour points, 2 bytes to represent the center of variation of the contour points, and 2M to represent the coefficient of the approximation function. 4 bytes in total
It becomes +2 Mbytes.

[R. Contour Reproducing Mechanism] This is a mechanism for reproducing a contour line to be a skeleton of an image from the stored compression data. The contour line may be a straight line, a perfect circle, an arc, or a free curve. [Reproduction of Straight Line] Reproduction of a straight line is performed by connecting a straight line from the coordinates of the start point to the coordinates of the junction point of the next section. No data is needed on the slope of the straight line. [Reproduction of Perfect Circle] The reproduction of a perfect circle is performed by drawing a circle having a given radius centered on the center coordinate from the data of the center coordinate and the radius. [Reproduction of arc] Reproduction of arc is performed by storing each data (A _x , B _x , ...
・) Is substituted into the following formula.

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 (2 2)

By varying the parameter t in the interval [0 to T], the x and y coordinates are obtained from S _x (t) and S _y (t). [Reproduction of Free Curve] As for the value of the basis ψ _K3 of the approximation function at each sample point t _i , the sample point t _i is in the interval [(L−1) (T /
M), L (T / M)] (1 ≦ L ≦ M), p =
Using L−t _i × M / T,

Ψ _k3 (t _i ) = 0.5 p ² k = L (23) ψ _k3 (t _i ) = p (1-p) +0.5 k = L + 1 (24) ψ _k3 (t _i ) = 1 −φ _L3 (t _i ) −φ _{L + 13} (t _i ) k = L + 2 (25) φ _k3 (t _i ) = 0 k ≦ L−1, L + 3 ≦ k (26)

Is represented by However, L is a natural number having a dimension number M or less. Using such a basis ψ _K3 , the approximate function value S (t _i ) at each sample point is

S (t _i ) = Σ _{k = L} ^{L + 2} C _k ψ _k3 (t _i ) (27)

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

[S. Image reproducing mechanism] Since the contour line is obtained, the portion surrounded by the contour line is used as a black pixel, and is reproduced as a black and white binary image in a logo / illustration shape. Alternatively, on the contrary, the portion surrounded by the contour line may be white pixels and the rest may be black pixels. Further, it is possible to make a part surrounded by the contour line a certain color and another part another color.

[T. Reproduction Data Output Mechanism] In order to reproduce the image from the coefficient of the function, for example, the size of the reproduced image is set to 1
A layout editor that can specify from mm square to A3 size is used. 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, the data can be output by a 3000 DPI electro-implanter (printing device) or a 400 DPI Postscript printer or laser cutter. The original drawing is stored in the form of function coefficients, and can be scaled up or down to any magnification. In addition, the center of coordinates can be arbitrarily specified. Therefore, it is possible to output characters, figures, etc. having arbitrary shapes at arbitrary positions and in arbitrary sizes.

[0099]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS In the present invention, an original image is read (input) by an image scanner, divided into divided images, the data is compressed, and the data is stored in a storage device. Then, the data is read from the storage device, combined, and a reproduction diagram is drawn (output) with a laser printer or a cutting plotter. In the present invention, the size of the divided image can be set to any size. For example, 400 × 40
It can be 0 dots or 1000 × 1000 dots. However, the size of the divided image is the power of 2 n (6
4,256,512,1024) is more convenient. In the embodiment described here, the size of the divided image is 256.
There are 256 dots.

Since the divided image is defined by the number of dots,
The actual size of the divided image changes depending on the dpi (dots per inch) of the image scanner for reading the image. In the case of an image scanner with a coarse reading accuracy (small dpi), the divided image becomes large.
In this case, when handling original images of the same size, the number of divided images (here, the number of boxes) is reduced. On the other hand, in the case of an image scanner for fine reading (large dpi), the divided image becomes small. The number of divisions (number of boxes) becomes large, and the processing time is long. The reading accuracy (dpi) of the image scanner varies from 90 to 400 dpi.

[0101]

[Table 2]

Table 2 shows the dpi of the image scanner, the size of the divided image, and the number of divided images (the number of boxes) that can cover the A4 screen when input. It also shows the amount of data read at that time. Since the dpi of the image scanner is the number of dots per inch, 256
The side dimension S of the divided image of dots is 25.4 × 256 /
It means that it is dpi (mm). For 90 dpi,
When S = 72.2 mm and 400 dpi, S = 16.
It is 2 mm. In case of A4 original picture, 210mm × 296
Since it is mm, R = [210 / S] +1 is the number of divided images in the horizontal direction. Here, [...] means the integer part of. In the vertical direction, Q = [296 / S] +1. The number of boxes at the time of full reading of A4 is the product PQ of these. The number of boxes is 70 at 200 dpi. The number of boxes is 266 at 400 dpi. The amount of data when read is 256 × 256 × (number of boxes). For example, the following input / output devices can be used.

[Input Device] System Quality IS
-500 (400 dpi) This is an image scanner having a resolution of 400 DPI and 256 gradations. 40 for A4 size originals
It takes 8 seconds at 0 dpi and 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 picture, the output speed is about 1 minute or less when the original picture is A4 in size. It is an extremely fast output machine. The output size is up to A4.

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

Cutting plotter For example, FC2100-50, FC21 manufactured by Graphtec Co., Ltd.
00-90A or the like can be used. This is width 50
A film with 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 a film consisting of release paper and backing paper. In this case, the cut film can be attached to some base material and used as a signboard, a guide plate, a building decoration, a road sign, or the like. If you use a thermal transfer film,
It can be used to draw letters and patterns on clothing, outdoor products, T-shirts, etc. You can also draw drawings on paper by changing the cutting plotter blade to a pen.

Thermal plotter (400 dpi) This is a drawing drawn on thermal paper. For example, TM1000-OPF manufactured by Graphtec Co., Ltd. can be used. This allows drawings and characters to be output on paper of sizes A0, A1, A2, A3, etc. Suitable for outputting calligraphy such as banners, venue information, funeral name tags, etc. Because it can play a large screen, you can make an oversized banner. When outputting the reproduced image with the cutting plotter, use the blade or pen to draw the outline (outline output)
Will be drawn. As described above, if the outline is output without outputting the division boundary line, the sheet member or the like can be cut along the contour line. Signboards, information boards,
It can be used for a wide range of purposes such as display boards, name tags, banners, and iron prints. The position and size can be set freely by calculation. FIG. 20 shows an S-PULSE mark (original image is actual size shown in FIG. 28) read by the method of the present invention, divided, data-compressed, stored, synthesized and output as an outline. The border dividing line has disappeared. See also FIG.
Reference numeral 1 denotes the word Verdy (original picture is actual size shown in FIG. 29) which is read and divided by the method of the present invention, compressed by data, stored, further synthesized and output as an outline. In this case too, the dividing line has disappeared. In FIG. 22 as well, the present invention is applied to the word “Nyoryosai” (original picture is actual size in FIG. 30) and is output in outline. As described above, according to the present invention, the sheet can be accurately cut along the contour line.
It can be used for various purposes. In FIG. 27, only the upper layer of the cutting sheet is cut by a cutting plotter. The dividing border does not appear. This is a large sheet with a long side of 1120 mm and a short side of 461.5 mm.
It is The height of the letter K is 122 mm. Even such a wide sheet can be easily cut out.

Next, a reproduced image output by a normal printer will be described. FIG. 23 is an original picture. The characters such as autumn visiting clothes and autumn kimono market are written. The size has been reduced to meet the restrictions for patent applications. This is read by the image scanner described above, divided according to the method of the present invention, and the data is compressed and stored. PC-9801BA was used for data compression and the like. FIG. 26 is a reproduced image by Rico-Imagio. This looks exactly the same as in FIG. Of course the size is different,
Since the drawings are for patent applications, the sizes are similar. You can see that the original picture is beautifully reproduced. FIG. 24 is a reproduced image of a part of autumn arrival clothes by Rico-SP8. The size can be variously changed by calculation. FIG. 25 is a reproduced image of a part of Kimono City in autumn by Rico-SP8. It can be seen that this is also a faithful reproduction of the original picture.

[0109]

[Table 3]

Table 3 shows the time required for such processing. It takes 13 seconds for the image scanner to read the part of autumn in Kimono City by the image scanner, and 1 minute 40 seconds for the segmented image cutting, data compression, and data storage by the personal computer PC9801BA. When this is output, 9 minutes 52 by Rico-Imagio
Second, it took 1 minute 19 seconds with Rico-SP8. In the latter case,
The total time from data reading to output is only 3 minutes and 12 seconds.

[0111]

[Table 4]

Table 4 shows the reading and data of the part of the autumn visiting clothes.
Indicates the time for data compression and output. It took 21 seconds to read with the image scanner and 1 minute 57 seconds to process with PC9801BA. For output of playback image, Rico-Imagio 8 min 4
It took 4 seconds and 1 minute and 4 seconds with Rico-SP8. In any case, it can be seen that a very large image can be divided, function-approximated, data-compressed, stored, and the stored data can be combined into an image in an extremely short time. .
Further, conventionally, when the original image is optically read, noise is generated and the reproduced image becomes dirty. However, in the present invention, there is also an action of positively correcting the straight-lined arc portion and the like, so that a neat reproduction is performed. Images can be obtained.

[0113]

According to the present invention, a large image is divided into images each having a small unit size, and a black-and-white image is subjected to contour point sequence extraction, joint point extraction, function approximation, and the like to obtain a compressed data.
Data in the storage device. Then, this process is repeated many times to compress the entire image. On the contrary, the data of the individual divided images are read out and are combined and reproduced. Since the outline point sequence extraction, the joint point extraction, and the function approximation are performed for a small range, a normal personal computer can sufficiently cope with it. Since the joining points are extracted and the straight lines, the circular arcs, and the free curves are connected between these points, the influence of noise caused by an optical factor that occurs during reading can be eliminated. On the contrary, a smooth curved portion can be beautifully reproduced and a high quality reproduced image can be obtained. Since it is a function approximation, the data to be stored
The amount of data is reduced and the approximation can be done smoothly. Therefore, the output time is shortened and the quality of the reproduced image can be improved.

[Brief description of drawings]

FIG. 1 is a schematic diagram showing a large original image read by an image scanner, stored in a first image storage device, divided into small basic divided images, and sequentially subjected to data compression processing, and then stored in a second image storage device 1 '. The figure which shows the procedure of this invention which writes compressed data.

FIG. 2 is a diagram showing that when a divided image is cut out from an original image, one pixel is vertically and horizontally overlapped.

FIG. 3 is a diagram illustrating what happens to a reproduced image when one pixel is not overlapped when a divided image is cut out from an original image.

FIG. 4 is a diagram showing that when the original image is divided into divided images each having a unit size, a left end and a lower end are left, but 0 is embedded in the left end.

FIG. 5 is a diagram for explaining that the end points of a straight line along a boundary need to be left as junction points.

FIG. 6 is a diagram showing an algorithm for leaving an end point of a straight line at a boundary as a junction point.

FIG. 7: In order to leave the boundary junction points correctly, y _k −y
The figure for demonstrating that _k-1 <0 is required.

FIG. 8 is a diagram showing how a pattern spanning four divided images is divided and reproduced. There will be no problem in the case of filling, but it will be explained that in the case of drawing an outline, a dividing line due to the boundary appears in the portion of the black image.

FIG. 9 is an original diagram showing the effect of the present invention.

FIG. 10 is a diagram showing a reproduction of a contour line image by compressing and storing the original data of FIG. 9 by the method of the present invention, combining the divided data. A division boundary line appears in the black pixel portion.

FIG. 11 is a diagram showing a reproduction of the original image by dividing the original image of FIG. 9 by the method of the present invention, compressing and storing the data, combining the divided data.

FIG. 12 is another original diagram showing the effect of the present invention.

FIG. 13 is an original diagram of FIG. 12 divided by the method of the present invention,
FIG. 6 is a diagram showing a contour line image reproduced by compressing and storing the data, synthesizing the divided data further. Reproduction (outline output) image with contour lines. A division boundary line appears in the black pixel portion.

FIG. 14 is a diagram showing a reproduction of the original image of FIG. 12 divided by the method of the present invention, data compressed, stored, combined divided data, filled with a closed contour line.

FIG. 15 is a diagram showing characteristics of a contour line on a division boundary line.

FIG. 16 is a diagram illustrating one algorithm for not outputting a contour line on a division boundary line when outputting.

FIG. 17 is a configuration diagram for explaining a mechanism for data compression of divided images.

FIG. 18 is a flowchart for explaining the procedure of the joint point extraction method adopted in the data compression method of the present invention.
To.

FIG. 19 is a diagram exemplifying a result of extracting a junction point between “a” and “po”.

FIG. 20 is a diagram in which a character S-PLUSE is input, divided, data-compressed by the method of the present invention, and a contour line is output (outline output). The dividing border disappears.

FIG. 21 is a diagram in which a character Verdy is input, divided, data-compressed by the method of the present invention, and a contour line is output (outline output). The dividing border disappears.

FIG. 22 is a diagram in which the characters of the summer festival are input, divided, data-compressed by the method of the present invention, and the contour line is output (outline output). The dividing border disappears.

FIG. 23: “Autumn kimono city for investigating the effect of the present invention,
An original picture that includes words such as "Autumn visitor's clothes, furisode, kimono festival".

FIG. 24 is a reproduction diagram of a part of autumn visiting clothes in FIG. 23 by using Rico-SP8.

[Fig. 25] In Fig. 23, Rico-SP8 in the part of autumn in Kimono City
Playback diagram by.

FIG. 26 is a reproduction diagram of FIG. 23 reproduced by Rico-Imagio.

FIG. 27 is a view showing a cutting sheet in which only the upper layer is cut by a cutting plotter.

FIG. 28 is a full-scale drawing of the character S-PLUSE that is the original image of FIG. 20.

FIG. 29 is a full-scale view of the character Verdy which is the original image of FIG. 21.

FIG. 30 is a full-scale drawing of the character “Nyorakuji” which is the original image of FIG. 22.

Claims (10)

[Claims] 1. A first image storage device for storing data obtained by optically reading a character pattern corresponding to a finite number of pixels arranged vertically and horizontally, and the stored image data is divided into basic small areas. The divided images are divided by sequential function approximation.
A device for data compression, a second image storage device for storing the data compressed data, and data relating to the pre-divided image stored in the second image storage device are combined to produce an original image. The data compression device for the divided image, which includes a reproducing device for reproducing, divides the divided image into a contour line extracting mechanism for extracting a contour line of a character figure, and a two-dimensional coordinate (X, X, X) of the extracted contour line. Y) is stored for each continuous group, a contour point sequence storage mechanism, and t is an independent variable, x and y are dependent variables, and t is an independent variable where x and y coordinates of the contour point sequence of each group are A data approximation mechanism A for approximating with a quadratic piecewise polynomial in which y and y are dependent variables and repeating the least-squares approximation until the approximation accuracy falls within a predetermined range to obtain an approximation polynomial for each group of contour line point sequences; A song for obtaining the curvature at each point of the point sequence for each group in the x and y spaces from the above approximation result A calculation mechanism, a perfect circle extraction mechanism that extracts a perfect circle from curvature data for each group, and a temporary joining point position that extracts a point that cannot be spatially differentiated as a temporary joining point from the curvature data of a point sequence. The extraction mechanism and other junction candidates near the temporary junction are stochastically adjusted based on the correlation,
The same point as the optimum joint point extraction mechanism that finds the optimum joint point and the unnecessary joint point removal mechanism that finds and removes unnecessary joint points that can maintain the approximation accuracy from the optimum joint points Approximate a straight line and a circular arc between adjacent junction points in the column group, and if a prescribed approximation accuracy cannot be obtained with this, approximate with a quadratic piecewise polynomial with t as an independent variable and x and y as dependent variables. And a data approximation mechanism B for approximating adjacent joint points with straight lines, arcs, and piecewise polynomials by repeating least squares approximation while increasing the number of dimensions of the quadratic piecewise polynomial until the approximation accuracy falls within a predetermined value. , A compression data storage mechanism for storing the coordinates of the joint points and the parameters of the function approximating between the adjacent joint points for each group of point sequences, and the compression data is the second one. Character graphics divided reading characterized by being stored in an image storage device Ri compressed storage composite output device. 2. A first image storage device for storing data obtained by optically reading a character pattern corresponding to a finite number of vertical and horizontal pixels, and the stored image data is divided into basic small areas. The divided images are divided by sequential function approximation.
A device for data compression, a second image storage device for storing the data compressed data, and data relating to the pre-divided image stored in the second image storage device are combined to produce an original image. The division of the original image including the reproduction device for reproduction is performed so as to overlap by one pixel at the boundary, and the data compression device for the division image is
A contour line extraction mechanism for extracting a contour line of a character figure, a contour point sequence storage mechanism for storing two-dimensional coordinates (X, Y) of the extracted contour line for each continuous group, an independent variable t, and a dependent variable Is defined as x, y, and the x, y coordinates of the contour point sequence for each group are t
Is an independent variable and x and y are dependent variables and is approximated by a quadratic piecewise polynomial, and least-squares approximation is repeated until the approximation accuracy falls within a predetermined range to obtain an approximate polynomial for each group of contour line point sequences. An approximation mechanism A, a curvature calculation mechanism for obtaining the curvature at each point of the point sequence for each group in the x and y spaces from the above approximation result, and a perfect circle extraction for extracting a perfect circle from the curvature data for each group. Based on the correlation between the mechanism, the temporary joint point position extraction mechanism that extracts a point that cannot be spatially differentiated from the data of the curvature of the point sequence as a temporary joint point, and other candidate joint points near the temporary joint point. The optimal joint point extraction mechanism that finds the optimum joint point by stochastic matching and the unnecessary joint point that maintains the approximation accuracy from the optimum joint point and removes it Unnecessary joint removal mechanism and straight or circular line between adjacent joints in the same point group When a predetermined approximation accuracy cannot be obtained with this, approximation is performed with a quadratic piecewise polynomial in which t is an independent variable and x and y are dependent variables, and the quadratic piecewise approximation is performed until the approximation accuracy falls within a predetermined value. A data approximating mechanism B for approximating adjacent joint points by a straight line, a circular arc, and a piecewise polynomial by repeating the least square approximation while increasing the number of dimensions of the polynomial, and the coordinates of the joint points for each group of point sequences. And a compression data storage mechanism for storing the parameters of a function approximating between adjacent junction points,
A divided reading compression storage combination output device for character and graphics, wherein compression data is stored in the second image storage device. 3. A first image storage device for storing data obtained by optically reading a character pattern corresponding to a finite number of vertical and horizontal pixels, and the stored image data is divided into basic small areas. The divided images are divided by sequential function approximation.
A device for data compression, a second image storage device for storing the data compressed data, and data relating to the pre-divided image stored in the second image storage device are combined to produce an original image. A reproduction device for reproducing the original image is divided so that the original image is divided by one pixel at the boundary, and the data compression device for the divided image is a contour line of a character graphic for the divided image. And a contour point sequence storage mechanism that stores the two-dimensional coordinates (X, Y) of the extracted contour line for each continuous group, an independent variable is t, and dependent variables are x and y. The x, y coordinates of the contour point sequence for each group are approximated by a quadratic piecewise polynomial in which t is an independent variable and x and y are dependent variables, and least square approximation is performed until the approximation accuracy falls within a predetermined range. Data approximation mechanism A for finding an approximate polynomial for each group of repetitive contour line points , A curvature calculation mechanism for obtaining a curvature at each point of a point sequence for each group in the x and y spaces, a perfect circle extraction mechanism for extracting a perfect circle from the curvature data for each group, Temporary junction position extraction mechanism that extracts spatially non-differentiable points as temporary junction points from the curvature data of the column and other junction candidates near the temporary junction point based on the correlation. The optimal joint point extraction mechanism that stochastically determines the optimum joint point and the unnecessary joint point that maintains the approximation accuracy even if it does not exist on the dividing boundary line is found and removed. The unnecessary joining point removing mechanism and the adjacent joining points in the same point sequence group are approximated in the order of a straight line and a circular arc, and when a predetermined approximation accuracy cannot be obtained by this, t is an independent variable,
Approximate with a quadratic piecewise polynomial with x and y as dependent variables, and repeat the least-squares approximation while increasing the dimensionality of the quadratic piecewise polynomial until the approximation accuracy falls within a predetermined value, and draw a straight line between adjacent junction points. , A circular arc, a data approximating mechanism B for approximating with a piecewise polynomial, and a compression data for storing the coordinates of the above-mentioned joining points and the parameters of the function approximating between adjacent joining points for each group of point sequences.
And a compression storing data storage unit for storing compression data in the second image storage unit. 4. A first image storage device for storing data obtained by optically reading a character pattern in association with a finite number of pixels arranged vertically and horizontally, and the stored image data is divided into basic small areas. The divided images are divided by sequential function approximation.
A data compression device and a second image storage device for storing the data-compressed data. The original image is divided so that it is overlapped by one pixel at the boundary. The data compression apparatus for the divided images stores the contour line extracting mechanism for extracting the contour line of the character graphic and the two-dimensional coordinates (X, Y) of the extracted contour line for each continuous group. A contour point sequence storage mechanism, and t is an independent variable, x and y are dependent variables, and t is an independent variable and x and y coordinates of the contour point sequence of each group are 2 and x and y are dependent variables.
A data approximation mechanism A for approximating with the following 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 the contour point sequence, and x, y from the above approximation results. A curvature calculation mechanism that obtains the curvature at each point of the point sequence for each group in space, a perfect circle extraction mechanism that extracts a perfect circle from the curvature data for each group, and a space from the curvature data of the point sequence. A temporary joint point position extraction mechanism that extracts non-differentiable points as temporary joint points and other joint point candidates near the temporary joint point are stochastically stochastized based on the correlation to find the optimum joint point. The same as the extraction mechanism for the optimum joint point to be found, and the unnecessary joint point removal mechanism that finds and removes unnecessary joint points that can maintain the approximation accuracy even if they do not exist on the division boundary line. Approximate a straight line and a circular arc between adjacent joints in When the approximation accuracy of is not obtained, it is approximated by a quadratic piecewise polynomial in which t is an independent variable and x and y are dependent variables, and the dimensionality of the quadratic piecewise polynomial is increased until the approximation accuracy falls within a predetermined value. The data approximation mechanism B that repeats the least-squares approximation while approximating the adjacent joint points with a straight line, an arc, and a piecewise polynomial, and approximates the coordinates of the joint points and the adjacent joint points for each group of point sequences. And a compression data storage mechanism for storing the parameters of the function to be stored, the compression data being stored in the second image storage device. Compressed storage device. 5. A first image storage device for storing data obtained by optically reading a character pattern in association with a finite number of vertical and horizontal pixels, and the stored image data is divided into basic small areas. The divided images are divided by sequential function approximation.
A device for data compression, a second image storage device for storing the data compressed data, and data relating to the pre-divided image stored in the second image storage device are combined to produce an original image. Including the reproducing device for reproducing only the contour line with a pen or a blade, the original image is divided so that it overlaps by one pixel at the boundary, and the data for the divided image is divided.
The data compression device includes a contour line extraction mechanism that extracts a contour line of a character graphic and a contour point sequence storage mechanism that stores two-dimensional coordinates (X, Y) of the extracted contour line for each continuous group. And the independent variable is t, the dependent variables are x and y, and the x and y coordinates of the contour line sequence for each group are t and the independent variables are x and y.
And a data approximation mechanism A for approximating with a quadratic piecewise polynomial with the dependent variable as a dependent variable and repeating the least-squares approximation until the approximation accuracy falls within a predetermined range to obtain an approximation polynomial for each group of the contour point sequence.
A curvature calculation mechanism for obtaining the curvature at each point of the point sequence for each group in the x and y spaces from the above approximation results, and the curvature data for each group
A true circle extraction mechanism that extracts a perfect circle from the data, a temporary junction position extraction mechanism that extracts a point that cannot be spatially differentiated from the curvature data of the point sequence as a temporary junction point, and a temporary circle An optimal junction extraction mechanism that stochastically matches other junction candidates based on the correlation and finds the optimal junction, and the approximation accuracy is maintained even if there is no such optimal junction. Unnecessary joint removal mechanism that finds unnecessary joints and removes them, and between adjacent joints in the same point sequence group is approximated in the order of a straight line and a circular arc. Approximate with a quadratic piecewise polynomial with independent variables x and y as dependent variables, and repeat least-square approximation while increasing the number of dimensions of the quadratic piecewise polynomial until the approximation accuracy falls within a predetermined value. A data approximation mechanism B that approximates a straight line, a circular arc, and a piecewise polynomial between And a compression data storage mechanism for storing the coordinates of the joint points and the parameters of the function approximating between adjacent joint points for each group of point sequences, the compression data being the second image. It is stored in a storage device, and when outputting a contour line, when tracing a dividing boundary line, a pen or a blade is raised so that the dividing boundary line does not appear. Compressed memory synthesis output device. 6. A first image storage device for storing data obtained by optically reading a character pattern in association with a finite number of vertical and horizontal pixels, and the stored image data in a basic small area. Data for the divided images is included, which includes a device for sequentially compressing the divided images by function approximation and a second image storage device for storing the data-compressed data. The compression device includes a contour line extraction mechanism that extracts a contour line of a character figure from a divided image, and a contour point sequence storage mechanism that stores two-dimensional coordinates (X, Y) of the extracted contour line for each continuous group. , The independent variable is t, the dependent variables are x and y, and the x and y coordinates of the above-mentioned contour point sequence for each group are approximated by a piecewise polynomial in which t is the independent variable and x and y are the dependent variables. A data approximation mechanism for obtaining an approximate polynomial for each group of columns,
A curvature calculation mechanism for obtaining the curvature at each point of the point sequence for each group in the x and y spaces from the above approximation results, and the curvature data for each group
A perfect circle extraction mechanism that extracts a perfect circle from the data, a joint position extraction mechanism that extracts a point that cannot be spatially differentiated from the curvature data of the point sequence as a joint point, and an adjacent joint point in the same point sequence group. If a predetermined approximation accuracy cannot be obtained with a straight line and a circular arc in this order, then a straight line and a circular arc are drawn between adjacent junction points by approximating with a piecewise polynomial in which t is an independent variable and x and y are dependent variables. A data approximation mechanism for approximating with a piecewise polynomial, and a compression data storage mechanism for memorizing the coordinates of the junction points and the parameters of the function approximating between adjacent junction points for each group of point sequences. Compression data
And a character graphic divided read compression storage device, wherein the data is stored in the second image storage device. 7. A first image storage device for storing data obtained by optically reading a character pattern in association with a finite number of pixels arranged vertically and horizontally, and the stored image data is divided into basic small areas. The divided images are divided by sequential function approximation.
A device for compressing data, a second image storage device for storing the data compressed data, and data for the pre-divided image stored in the second image storage device are combined to reproduce the original image. The data compression device for the divided image includes a contour line extraction mechanism for extracting the contour line of the character graphic and the two-dimensional coordinates (X, Y) of the extracted contour line. ) Is stored for each continuous group, and the independent variable is t, the dependent variables are x, y, and the x, y coordinates of the outline point sequence for each group are t as independent variables, x. A data approximation mechanism for approximating with a piecewise polynomial with y as a dependent variable to obtain an approximate polynomial for each group of contour point sequences, and each point of the sequence of points for each group in the x and y spaces from the above approximation results Curvature calculation mechanism to find the curvature in a circle, and a perfect circle extraction mechanism to extract a perfect circle from the curvature data for each group , A joint point position extraction mechanism that extracts points that cannot be spatially differentiated from the curvature data of the point sequence as joint points, and between adjacent joint points in the same point sequence group in the order of straight line, arc When a predetermined approximation accuracy cannot be obtained, a data approximation mechanism that approximates a piecewise polynomial in which t is an independent variable and x and y are dependent variables and approximates a straight line, an arc, or a piecewise polynomial between adjacent junction points And a compression data storage mechanism for storing the coordinates of the joint points and the parameters of the function approximating between the adjacent joint points for each group of point sequences.
The image reading / storing / compositing output device for character / figure. 8. A first image storage device for storing data obtained by optically reading a character pattern in association with a finite number of vertical and horizontal pixels and dividing the stored image data into basic small areas. The divided images are divided by sequential function approximation.
A device for compressing data, a second image storage device for storing the data compressed data, and data for the pre-divided image stored in the second image storage device are combined to reproduce the original image. The division of the original image is performed so as to overlap by one pixel at the boundary, and the data compression apparatus for the divided image is
A contour line extraction mechanism for extracting a contour line of a character figure, a contour point sequence storage mechanism for storing two-dimensional coordinates (X, Y) of the extracted contour line for each continuous group, an independent variable t, and a dependent variable Is defined as x, y, and the x, y coordinates of the contour point sequence for each group are t
Is an independent variable and x and y are dependent variables and is approximated by a piecewise polynomial to obtain an approximate polynomial for each group of the contour point sequence, and for each group in the x, y space from the approximation result. A curvature calculation mechanism for obtaining the curvature at each point of the point sequence, a perfect circle extraction mechanism for extracting a perfect circle from the curvature data for each group, and a point that cannot be spatially differentiated from the curvature data of the point sequence. A joint position extraction mechanism for extracting as a joint point, and a joint between adjacent joints in the same point sequence group is approximated in the order of a straight line and an arc. , A data approximating mechanism for approximating adjacent joint points by a straight line, a circular arc, and a piecewise polynomial by approximating with a piecewise polynomial with y as a dependent variable, and adjoining the coordinates of the joint points for each group of point sequences. And a compression data storage mechanism that stores the parameters of the function approximating between the junction points,
A divided reading compression storage combination output device for character and graphics, wherein compression data is stored in the second image storage device. 9. A first image storage device for storing data obtained by optically reading a character pattern in association with a finite number of vertical and horizontal pixels, and dividing the stored image data into basic small areas. The divided images are divided by sequential function approximation.
A device for data compression, a second image storage device for storing the data-compressed data, and data relating to the pre-divided image stored in the second image storage device to synthesize the outline of the original image. Including a reproducing device that reproduces only the line with a pen or a blade,
The division of the original image is performed so that one pixel overlaps at the boundary, and the data for the divided image is divided.
The data compression device includes a contour line extraction mechanism that extracts a contour line of a character graphic and a contour point sequence storage mechanism that stores two-dimensional coordinates (X, Y) of the extracted contour line for each continuous group. And the independent variable is t, the dependent variables are x and y, and the x and y coordinates of the contour line sequence for each group are t and the independent variables are x and y.
A data approximation mechanism for approximating a contour polynomial for each group of a point sequence by a piecewise polynomial with a dependent variable, and the above approximation results at each point of the point sequence for each group in the x and y spaces. A curvature calculation mechanism that obtains the curvature, a perfect circle extraction mechanism that extracts a perfect circle from the curvature data for each group, and a join that extracts a point that cannot be spatially differentiated from the curvature data of the point sequence as a joint point. When the point position extraction mechanism and adjacent joint points in the same point sequence group are approximated in the order of a straight line and a circular arc and a predetermined approximation accuracy cannot be obtained by this, t is an independent variable and x and y are dependent variables. A data approximation mechanism that approximates a piecewise polynomial by approximating between adjacent junctions by a straight line, an arc, and a piecewise polynomial, and a function that approximates the coordinates of the junction and the adjacent junctions for each group of point sequences And a compression data storage mechanism for storing the parameters of the second image storage device. So as to be stored in the divided read compressed storage combined output device of a character graphic which is characterized in that so as not to output this by raising the pen or blade at the dividing boundary. 10. A first image storage device for storing data obtained by optically reading a character pattern in association with a finite number of vertical and horizontal pixels and dividing the stored image data into basic small areas. A device for sequentially compressing the divided images by function approximation, a second image storage device for storing the data-compressed data, and a previous image data stored in the second image storage device. A reproduction device for reproducing the original image by synthesizing the data relating to the divided images, wherein the division of the original image is performed so that one pixel overlaps at the boundary, and the data compression for the divided image is performed. For the divided image, the apparatus extracts the contour line extraction mechanism for extracting the contour line of the character graphic and the two-dimensional coordinates (X, Y) of the extracted contour line for each continuous group of t as an independent variable, X, Y. A contour point sequence storage mechanism for storing as a dependent variable; x , A curvature calculation mechanism for obtaining a discrete curvature at each point of the point sequence in the y space, a perfect circle extraction mechanism for extracting a perfect circle from the curvature data for each group, and a curvature data for the point sequence. -A joint position extraction mechanism that extracts points that cannot be spatially differentiated from the joint as a joint point, and between adjacent joint points in the same point sequence group is approximated in the order of a straight line and a circular arc. If there is no t, it is approximated by a piecewise polynomial in which t is an independent variable and x, y are dependent variables, and the least squares approximation is repeated while increasing the number of dimensions of the piecewise polynomial until the approximation accuracy falls within a predetermined value. A data approximation mechanism for approximating the distances by a straight line, a circular arc, and a piecewise polynomial, and a compression data storing the coordinates of the junction points and the parameters of the function for approximating the adjacent junction points for each group of point sequences. A storage unit for storing compressed data in the second image storage device. Split read compressed storage combined output device of a character graphic which is characterized in that the.