JPS59189469A - Vector generating system of line picture - Google Patents

Abstract

PURPOSE:To obtain quickly a data made into a vectorial form and to facilitate coding of picture data and pattern recognition by generating vector in the highest-order segment out of registered segments from the coordinate relation of the lowest order segment. CONSTITUTION:A drawing 11 is photoelectrically converted by a photoelectrical conversion section 12 and binary coded by a binary coding device 13. The binary coded data is stored in buffer memories 18, 112. A run detecting section 110 detects run from the binary coded data, and a matching section 114 detects the number of runs of preceding line exists in the section corresponding to the run of detected line. A segment judging section examines to which segment a run is connected from the number of runs, and at the same time, stores the run with a segment table 115, segment length, inclination and line width, and registers whether the run exists in the segment or not. A vector generating section 118 generates vector from coordinate relation of the highest-order and the lowest- order segments out of registered segments.

Description

Detailed Description of the Invention (1) Technical Field of the Invention The present invention compresses two-dimensional information of an input image in the form of a segment table, and stores information in the scanning line direction in a buffer memory in the form of a run (a series of pixels). A method in which the correlation between scanning lines is determined by comparing the run information with the segment table, and the coordinate values of the vector (broken line approximation pattern) are immediately output when the vector generation conditions are satisfied. Regarding.

(2) Prior art and problems Conventional nine image processing devices simply photoelectrically convert documents and drawings,
It only performs digitization processing (converting shading into binary values of white and black), and has the disadvantage that the storage capacity of the digitized data becomes large and that it cannot be easily used for pattern processing, etc. .

(3) Purpose of the Invention The present invention solves the above-mentioned drawbacks by photoelectrically converting line figures, further binarizing them, and then quickly obtaining hectorized (broken line approximation) data.

The purpose is to facilitate image data encoding and pattern recognition processing.

(4) Structure of the invention The purpose is to photoelectrically convert a line image and convert it to 0 (white) using a binarizer.
or a system that binarizes to 1 (black), a buffer memory that stores the binarized data, a run detection means that detects a run (a series of 1's) from the binarized data;
A matching means for counting how many runs are in the previous row in the interval corresponding to the run in the detected row, and determining which segment (collection of runs) a certain run is connected to from the number of runs. After checking and storing the run along with the segment table 2 segment length and slope 2 line width,
The segment determination means determines whether the run is included in the segment and registers it, and the vector generation means generates a vector from the coordinate relationship between the highest segment and the lowest segment among the registered segments. This is achieved by a line image hector generation method characterized by:

(5) Examples of the invention The present invention will be described in detail below with reference to the drawings.

FIG. 1 is an overall block diagram showing one embodiment of the present invention.

In the figure, 11 is a drawing, and 12 is a photoelectric conversion unit.

13 is a binarizer, 14 is a row counter, 15 is a column counter, 16 is a data bus, 17 is a switch, 18 is a buffer memory A, 19 is a memory access section 1 (memory read/write), and 110 is a run detection section.

111 is a memory access unit 4, 112 is a buffer memory B, 113 is a memory access unit 2, 114 is a matching unit, 115 is a segment table, 116 is a memory access unit 3, 117 is a segment determination unit, 118 is a vector generation unit, and 119 is an external unit. It's memory.

FIG. 2 shows details of run detection according to an embodiment of the present invention. 24 is a black part, 25 is a buffer for the previous line, and 26 is a buffer for a processed line.

FIG. 3 is a diagram showing details of a segment table showing an embodiment of the present invention. In the figure, 31 indicates the segment number, and 32 indicates the segment start point coordinates.

33 is the segment length, 34 is 1 inch, and 35 is the line width.

First, the drawing 11 is viewed from left to right using the photoelectric conversion unit 12.

Television-style scanning is performed horizontally one line at a time from top to bottom, and binarized into O (white) and 1 (black) by the binarizer 13, and then stored in the buffer memory A18 using the line counter 114. The data is continuously stored one row at a time in the eight sofa memory B112. The buffer memory has n bits per pixel because it can handle integer values.

The width of the buffer and the number of focuses n can be changed depending on the image being handled.

Next, the buffer memory A18. The binary data stored in B112 is read out by the memory access units 19 and 113, and the run detection unit 110 detects one series of 1 (black) portions as a run (RUN). In other words, the binary data stored in the buffer memory is detected from one direction, and from the 0 value part to the part where the value is greater than 0 (start of run)
, record the opposite point (end of run). The matching unit 114 is concerned with the combination of the runs,
As shown in the second example, the buffer 25 for the previous line and the buffer 26 for the processed line
Check out the orchid. In other words, the start and end coordinates are +
In the case of a run x/+xλ, check whether there is a run XZ~1). It is counted whether there is such a run in the interval (x7.

In the case of K(1!1t(K>O), it indicates that the book runs (segments or lines) have gathered into one line. When the above processing is completed for one run, the second segment The judgment unit checks the run combination status and determines which segment (collection of runs) the run currently being processed is.
Check whether it is connected to Here, a segment is a collection of runs, and corresponds to a line segment with a certain slope. In this explanation, the values l, which can be found when scanning the previous row buffer 25,
(J21 is the area 34 indicating the average slope between the first line and the next run, and the line width 3 which is the run coordinate difference between the first line and the next line.
A segment table 115 with 5 is created.

Subsequently, the next run is written in the segment table 115 in the same manner. Segment table 11 If X, , X2= is significantly different from ΔX, or the line width is extremely different, do not include it in the same segment.■ Other ΔX
For X7. If the X force does not deviate much and the line widths are approximately the same, it is determined to be included.

It's crowded. The other side that was determined not to be included in the same segment
Register on Pull 115. Next, the vector generator 118
After all the runs of the rows are registered as segments in the segment table 115, if the first-order condition is satisfied, the seven segments are vectorized.

corresponds to a song. ) ■' If there is no run below the upper segment (corresponds to a break in the line), the segment is vectorized from the starting point coordinates x, y, slope ΔX, and length m in the segment table 115 (Xf, Yf) - (X,)'): f is an abbreviation for from.

(X t, Y t) ←−(x +m
- Δx, y+m): Calculate the vector ((Xf, Yf)→0(t, yt)), where t is an abbreviation for to.

After completing the above processing for one line, the anterior bone buffer 25
The buffer being processed and the sofa are moved to the buffer being processed, the binary data of the next row is put into the buffer being processed, and a vector is generated in the same manner.

(6) Detailed Description of the Invention As described above, according to the present invention, binarized data can be quickly vectorized (broken line approximation) and pattern recognition processing can be facilitated.

[Brief explanation of drawings]

FIG. 1 is an overall block diagram showing one embodiment of the present invention. FIG. 2 is a diagram showing details of run detection according to an embodiment of the present invention. FIG. 3 is a diagram showing details of a segment table showing an embodiment of the present invention. Explanation of symbols: 11 is a drawing 512 is a photoelectric conversion unit. 13 is a binarizer, 14 is a row counter, 15 is a column counter, 16 is a data bus, 17 is a switch, 18 is a buffer memory A, 19 is a memory access section 1 (memory read/write), and 110 is a run detection section. 111 is a memory access unit 4, 112 is a buffer memory B, 113 is a memory access unit 2, 114 is a matching unit, 115 is a segment table, 116 is a memory access unit 3, 117 is a segment determination unit, 118 is a vector generation unit, and 119 is an external unit. memory. Seri 20 Door 3 Figure

Claims (1)

[Claims] The line image is photoelectrically converted and converted into O (white) or 1 by a binarizer.
In a system that binarizes into (black) data, a buffer memory stores the binarized data. a run detecting means for detecting a run (a series of 1's) from the binarized data; a matching means for counting the number of runs in the previous row in an interval corresponding to the run in the detected row; After determining which segment (collection of runs) a run is connected to based on the number of numbers, and storing the run along with the segment length, slope, and line width in the segment table, the run is connected to the segment. A line image characterized by comprising a segment determining means for determining whether the segment is included and registering it, and a vector generating means for generating a vector from the coordinate relationship between the highest segment and the lowest segment among the registered segments. vector generation method.